Issues [Year wise]

Year Wise :


Paper Title : A Survey: Query Processing Techniques for Secure Cloud Databases
Authors : N.Swetha,, Prof. S Ramachandram,
Affiliations : Research Scholar, Dept. of CSE, Osmania University, Hyderabad
Principal, Dept. of CSE, Osmania University, Hyderabad.
Abstract :

af

The Major challenge in cloud computing is to manage distributed cloud. Traditional relational database management systems (RDBMS) are a choice but they are not compatible to measure crossways large clusters of distributed servers. Therefore changeovers to RDBMS have been developed. The development of new database management systems (DBMS) for the cloud computing environment or flexibility of the existing systems to the cloud computing environment is a critical component of cloud computing research. This paper focuses on the study of a relational database system based on holomorphic encryption schemes to preserve the integrity and confidentiality of the data. And also examines various SQL queries over encrypted data. And this paper helps in focusing where research is needed.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


database management systems, relational database management systems, Homomorphic encryption, Cloud Data bases.

N.Swetha,,Prof. S Ramachandram."A Survey: Query Processing Techniques for Secure Cloud Databases". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1257-1262, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1283.pdf,

[1] Wiggins, A. (2009), SQL Databases Don't Scale.
http://adam.heroku.com/past/2009/7/6/sql_databases_d
ont_scale/
[2] Abadi, D. J. (2009), Data Management in the Cloud:
Limitations and Opportunities. IEEE Data Engineering
Bulletin, Volume 32, Number 1, March 2009, pp. 3-12
[3] Garret (2010), What is a Column Oriented Database?
http://www.columnorienteddatabase.com/
[4] DeCandia, G., D. Hastorun, M. Jampani, G.
Kakulapati, A. Lakshman, A. Pilchin, S.
Sivasubramanian, P. Vosshall, and W. Vogels(2007)
Dynamo: Amazon’s highly available key-value store, In
SOSP, pp. 205–220
[5] Dean, J. and S. Ghemawat (2004) Mapreduce:
Simplified data processing on large clusters.
Proceedings of the 6th conference on Symposium on
Opearting Systems Design & Implementation ACM pp.
137–150
[6] C. Gentry, Computing arbitrary functions of
encrypted data, Commun. ACM, Vol. 53, No. 3., pp. 97-
105, March 2010.
[7] C. Gentry, A fully homomorphic encryption
scheme. PhD thesis, Stanford University, 2009.
[8] M. Raykova, B. Vo, and S. Bellovin, Secure
Anonymous Database Search, CCSW’09, pp. 115-126,
Chicago, Illinois, USA, November 13, 2009. 
[9] N. Shang, G. Ghinita, Y. Zhou, and E. Bertino,
Controlling Data Disclosure in Computational PIR
Protocols. ASIACCS’10, pp. 310- 313, Beijing, China,
April 13–16, 2010.
[10] T. Nakamura, S. Inenaga, D. Ikeda, K. Baba, H.
Yasuura, Anonymous Authentication Systems Based
on Private Information Retrieval. Networked Digital
Technologies. NDT '09, pp.53-58, 28- 31 July 2009.
[11] S. Yinan and Z. Cao, Extended Attribute Based
Encryption for Private Information Retrieval. Mobile
Adhoc and Sensor Systems, 2009. MASS '09, pp. 702-
707, 12-15 Oct. 2009.
[12] C. Gentry and Z. Ramzan, Single-Database Private
Information Retrieval with Constant Communication
Rate. ICALP 2005, LNCS 3580, pp. 803–815, 2005.
[13] C. A. Melchor and P. Gaborit, A Fast Private
Information Retrieval Protocol. ISIT 2008, pp. 1848-
1852, Toronto, Canada, July 6 - 11, 2008.

Currently there are no Refbacks

Paper Title : Enhancing CAPTCHA based Image Authentication for E-mail ID and Password
Authors : MACHARLA BHANU KUMAR, K.KRANTHI KUMAR,
Affiliations : Pursuing M.Tech, CSE Branch,Dept of CSE
Assistant Professor, Department of Computer Science and Engineering
NRI Institute of Technology, Guntur, Andhra Pradesh, India
Abstract :

af

-In this paper we survey the current Captcha password schemes furthermore exhibit the significance of Email authentication over cutting edge Captcha Advancements where Captcha and Its graphical password it can addresses various security issues out and out. CAPTCHA is accomplished by revision of letters in order arbitrarily on the catches and it is anything but difficult to baffle by straightforward key loggers .In data security, client authentication is a noteworthy issue in each framework. What's more, for authentication reason each framework relies on upon password whether it is literary password or graphical password. CAPTCHA is a test work by computer programs which human can pass however computer programs can't pass .The thought process of incorporating so as to enhance Email authentication is finished visual authentication instruments. This is ensured to the regular assaults endured by other authentication schemes.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Graphical Password, CaRP, CAPTCHA, Authentication, Security, E-mail, Hacker Attack, Keyloggers

MACHARLA BHANU KUMAR,K.KRANTHI KUMAR."Enhancing CAPTCHA based Image Authentication for E-mail ID and Password". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1251-1256, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1282.pdf,

[1] Shraddha S.Banne, Prof. K.N.Shedge,”A Review
Graphical password Based Authentication
Scheme”,International Journal of Science &
Research(IJSR), Volume 3 Issue 10, October 2014.
[2] Shraddha S.Banne, Prof. K.N.Shedge,” A Novel
Graphical Password Based Authentication Method
Using CAPTCHA”, International Journal of
Informative & Futuristic Research (IJIFR), Volume 2
Issue 11 July 2015
[3] Bin B. Zhu, Je Yan, Guanbo Bao, Maowei Yang,
and Ning Xu,``Captcha as a Graphical Passwords A
New Security Primitive Based on Hard AI
Problems",IEEE Trans, Vol. 9, No. 6, pp 891- 904,
June 2014.
[4] S. Chiasson, A. Forget, R. Biddle, and P. C. van
Oorschot, ``Inuencing users towards better
passwords: Persuasive cued clickpoints", in Proc.
HCI, British Computer Society, Liverpool, U.K., pp
121-130, 2008. [5] S. Chiasson, A. Forget, R. Biddle,
and P. C. van Oorschot, ``User interface design
affects security: Patterns in click-based graphical
passwords", Int. J. Inf. Security, vol. 8, no. 6, pp. 387-
398, 2009.
[6] G. Blonder, Graphical Passwords, U.S. Patent
5559961, 1996.
[7] Xiaoyuan Suo, Ying Zhu, G. Scott. Owen,
“Graphical Passwords: A Survey”, Department of
Computer Science Georgia State University.
[8] A. Dirik, N. Memon, and J.-C. Birget, “Modeling
User choice in the Pass-Points graphical password
scheme", in 3rd Symp. Usable Privacy and
Security(SOUPS), Pittsburgh, PA, pp. 20-28, 2007.
[9] Chippy. T and R. Nagendran, Defences Against
Large Scale Online Password Guessing Attacks By
Using Persuasive Click Points, International Journal
of Communications and Engineering, Volume 03
No.3, Issue: 01 March2012 .
[10] D. Davis, F. Monrose, and M. K. Reiter, “On
user choice in graphical pass-word schemes", in
Proc. 13th USENIX Security Symp., San Diego, CA,
pp. 151-164, 2004.
[11] Robert Biddle, Sonia Chiasson and P.C.van
Oorschot. Graphical Passwords: Learning from the
First Twelve Year. School of Computer Science,
Carleton University, Jan 4, 2012.
[12] Liming Wang, Xiuling Chang, Zhongjie Ren,
Haichang Gao, Xiyang Liu, Uwe Aickelin, “Against
Spyware Using CAPTCHA in Graphical Password
Scheme”
[13] Luis von Ahn, Manuel Blum, Nicholas J.
Hopper, and John Langford, “CAPTCHA: Using
Hard AI Problems For Security”
[14] S. Wiedenbeck, J. Waters, J.C. Birget, A.
Brodskiy, N. Memon, ``PassPoints: Design and
longitudinal evaluation of a graphical password
system'', International J. of Human-Computer
Studies (Special Issue on HCI Research in Privacy
and Security), 63 (2005) 102-127.
[15] Xiaoyuan, S., Z. Ying, et al. (2005). “Graphical
passwords: a survey”, Computer Security
Applications Conference, 21st Annual.
[16] H. Gao, X. Liu, S.Wang, and R. Dai, “A new
graphical password scheme against spyware by
using CAPTCHA,” in Proc. Symp. Usable Privacy
Security, 2009, pp. 760–767.
[17] M. Alsaleh, M. Mannan, and P. C. van Oorschot,
“Revisiting defenses against large-scale online
password guessing attacks,” IEEE Trans.
Dependable Secure Comput., vol. 9, no. 1, pp. 128–
141, Jan./Feb. 2012.

Currently there are no Refbacks

Paper Title : Performance of AHB Bus Tracer with Dynamic Multiresolution and Lossless Real Time Compression
Authors : VELLANKI SATHEESH BABU, B.N. SRINIVASA RAO,
Affiliations : Pursuing M.Tech, VLSI DESIGN, Dept of ECE
Assistant Professor, Department of Electronics and Communication Engineering Avanthi Institute of Engineering and Technology, Visakhapatnam, Andhra Pradesh, India.
Abstract :

af

In this paper we demonstrate the On-Chip bus SoC(system-on-chip) infrastructure that connects major hardware components. Monitoring the on-chip bus signals is crucial to the SoC debugging and performance analysis/optimization. The past two decades of SoC evolution have seen an exponential increase in complexity. Today’s devices have multiple processing units, CPUs, GPUs, DSPs, DMAs, third-party IP blocks and custom logic. As if the hardware is not complicated enough, there will of course be substantial amounts of sophisticated software code running on the SoC hardware/software integration, and testing are made very much harder. The commercial consequences of problems in the development flow are potentially dire: since the debugging / analysis needs are adaptable: some designers need all signals at cycle-level, while some others only care about the transactions. For the latter case, tracing all signals at cycle-level wastes a lot of trace memory. Thus, there must be a way to capture traces at different abstraction levels based on the specific debugging/analysis need.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


SoC(system-on-chip), bus tracer, On-Chip, SoC debugging and analysis.

VELLANKI SATHEESH BABU,B.N. SRINIVASA RAO."Performance of AHB Bus Tracer with Dynamic Multiresolution and Lossless Real Time Compression". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1245-1250, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1280.pdf,

[1+ ARM Ltd., San Jose, CA, “Embedded trace
macrocellarchitecture specification,” 2006.
*2+ B. Tabara and K. Hashmi, “Transaction-level
modeling and debug of SoCs,” presented at the IP SoC
Conf., France, 2004
*3+ ARM Ltd., San Jose, CA, “AMBA Specification (REV
2.0) ARMIHI0011A,” 1999.
*4+ ARM Ltd., San Jose, CA, “ARM. AMBA AHB Trace
Macrocell (HTM) technical reference manual ARM DDI
0328D,” 2007.
[5] J. Gaisler, E. Catovic, M. Isomaki, K. Glembo, and S.
Habinc, “GRLIB IP core user’s manual, gaisler
research,” 2009.
[6+ E. Rotenberg, S. Bennett, and J. E. Smith, “A trace
cache microarchitecture and evaluation,” IEEE Trans.
Comput., vol. 48, no. 1, pp. 111–120, Feb. 1999.
[7] A. B. T. Hopkins and K. D. Mcdonald-Maier,
“Debug support strategy for systems-on-chips with
multiple processor cores,” IEEE Trans. Comput., vol.
55, no. 1, pp. 174–184, Feb. 2006.
[8] B. Vermeulen, K. Goosen, R. van Steeden, and M.
Bennebroek, “Communication-centric SoC debug using
transactions,” in Proc. 12th IEEE Eur. Test Symp., May
20–24, 2007, pp. 69–76.
[9] Y.-T. Lin, C.-C. Wang, and I.-J. Huang, “AMBA
AHB bus protocol checker with efficient debugging
mechanism,” in Proc. IEEE Int. Symp. Circuits Syst.,
Seattle, WA, May 18–21, 2008, pp. 928–931

Currently there are no Refbacks

Paper Title : An Effective Supermodularity Based Approach for Data Privacy at Storage Level
Authors : Annamneni Soujanya, Baburao Kopuri,
Affiliations : M.Tech (CSE), Department of Computer Science & Engineering, NRI Institute of Technology
Associate Professor, Department of Computer Science & Engineering, NRI Institute of Technology.
Abstract :

af

In this paper we presented a supermodulaity based approach for data privacy using noval encryption mechanisum in this conncetion the seviority of data privacy at storage level is most considerable so in our presented system lack of data privacy , scalability due to low security algorithm while data transformation so in our proposed system Scalability and privacy risk of data anonymization can be addressed by using differential privacy. Differential privacy provides a theoretical formulation for privacy. A scalable algorithm is use to find the differential privacy when applying specific random sampling. The risk function can be employ through the supermodularity properties.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Supermodularity, Differential privacy, Scalability, privacy.

Annamneni Soujanya,Baburao Kopuri."An Effective Supermodularity Based Approach for Data Privacy at Storage Level ". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1240-1244, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1279.pdf,

[1] Mohamed R. Fouad, Khaled Elbassioni, ―A Supermodularity-Based Differential Privacy Preserving Algorithm for Data Anonymization‖, IEEE transaction on
Knowledge and Data Engineering July 2014.
[2] M. R. Fouad, K. Elbassioni, and E. Bertino, ―Towards
a differentially private data anonymization,‖ Purdue
Univ., West Lafayette, IN, USA, Tech. Rep. CERIAS
2012-1, 2012.
[3] N. Mohammed, R. Chen, B. C. Fung, and P. S. Yu,
―Differentially prívate data release for data mining,‖ in
Proc. 17th ACM SIGKDD,New York,NY, USA, 2011, pp.
493–501.
[4] M. R. Fouad, G. Lebanon, and E. Bertino, ―ARUBA:
A risk-utility based algorithm for data disclosure,‖ in
Proc. VLDB Workshop SDM, Auckland, New Zealand,
2008, pp. 32–49.
[5] K. M. Elbassioni, ―Algorithms for dualization over
products of partially ordered sets,‖ SIAM J. Discrete
Math., vol. 23, no. 1,pp. 487–510, 2009.
[6] C. Dwork, ―Differential privacy: A survey of results,‖ in Proc. Int.Conf. TAMC, Xiˇ San, China, 2008,
pp. 1–19.
[7] G. Lebanon, M. Scannapieco, M. R. Fouad, and E.
Bertino,―Beyond kanonymity:A decision theoretic
framework for assessing Privacy risk,‖ in Privacy in Statistical Databases. Springer LNCS 4302:217U 232, 2006.
[8] C. Dwork, ―Differential privacy,‖ in Proc. ICALP,
Venice, Italy,2006, pp.1–12.
[9] C. C. Aggarwal, ―On k-anonymity and the curse of
dimensionality,‖in Proc. Int. Conf. VLDB, Trondheim,
Norway, 2005,pp. 901–909.
[10] C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov,
and M. Naor,―Our data, ourselves: Privacy via distributed noise generation,‖in Proc. 25th EUROCRYPT,
Berlin, Germany, 2006, pp. 486–503,LNCS 4004.
[11] A. Frieze, R. Kannan, and N. Polson, ―Sampling
from log-concave distributions,‖ Ann. Appl. Probab.,
vol. 4, no. 3, pp. 812–837, 1994.
[12] B. C. M. Fung, K. Wang, and P. S. Yu, ―Top-down
specialization for information and privacy preservation,‖ in Proc. IEEE ICDE, Washington, DC, USA, 2005,
pp. 205–216.
[13] G. Ghinita, P. Karras, P. Kalnis, and N. Mamoulis,
―Fast data anonymization with low information loss,‖ in
Proc. Int. Conf.VLDB, Vienna, Austria, 2007, pp. 758–
769.
[14] G. A. Gratzer, General Lattice Theory, 2nd ed. Basel, Switzerland:Birkh¨auser, 2003.
[15] M. Grotschel, L. Lovasz, and A. Schrijver, ―Geometric algorithms and combinatorial optimization,‖ in Algorithms and Combinatorics, vol. 2, 2nd ed. Berlin,
Germany: Springer, 1993.
[16] J. Cao, P. Karras, P. Kalnis, and K.-L. Tan, ―SABRE:
A sensitive attribute bucketization and redistribution
framework for t-closeness,‖ J. VLDB, vol. 20, no. 1, pp.
59–81, 2011.
[17] C. M. Fung, K. Wang, and P. S. Yu, ―Top-down
specialization for information and privacy preservation,‖ in Proc. IEEE ICDE, Washington, DC, USA, 2005,
pp. 205–216.

Currently there are no Refbacks

Paper Title : SYSTEM EVALUATION OF 32 BIT UNNSIGNED MULTIPLER USING CLAA AND CSLA.
Authors : SIVASANKAR RAO.Y, SOMASEKHAR .A,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Associate Professor, Dept. of ECE Priyadarshini Institute of Technology & Management
Abstract :

af

- In this paper deals with the comparison of the VLSI design of the carry look-ahead adder (CLAA) based 32- bit signed and unsigned integer multiplier. Multiplication is a fundamental operation in most signal processing algorithms. Multipliers have large area, long latency and consume considerable power. Therefore low-power multiplier design has been an important part in low- power VLSI system design. In computational circuits the adders plays a key role in arithmetic operations. Adders like Ripple carry adder, Carry look ahead adder, Carry select adder, Carry skip adder and carry save adder etc. In this paper, a high performance and low power 32bit unsigned multiplier is proposed using adders. The CLAA based multiplier and CSLA based multiplier uses the same delay for multiplication operation.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


CLAA,CSLA,Delay,Area, Array Multiplier

SIVASANKAR RAO.Y,SOMASEKHAR .A."SYSTEM EVALUATION OF 32 BIT UNNSIGNED MULTIPLER USING CLAA AND CSLA.". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1236-1239, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1278.pdf,

[1] J. Bedrij, “Carry-select adder,” IRE Trans. Electron,
pp. 340–344, 1962.
[2] B. Rajkumar, .M. Kittur, and P. Kanna, “ASIC
implementation of modified faster carry select adder,”
Eur. J. Sci.Res., vol. 42, no. 1, pp.53–58, 2010.
[3] Ceiang.T.Y and M. J. Hsiao, “Carry-select adder
using ripple Carry adder,” Electron. Lett, vol. 34, no.
22, pp.2101–2103, Oct. 1998.
[4] Y. Kim and L.-S. Kim, “carry-select adder with
reduced area,” Electron. Lett. vol. 37, no. 10, pp. 614–
615, May2001.
[5] J. M. Rabaeay, Integrated Circuits—A Design
Perspective.Upper Saddle River, NJ: Prentice-Hall, 2001
[6] Y. He, C. H. Chang, and J. Gu, “low power & area
efficient 64-bit square Root carry-select adder for low
powerapplications,” in Proc. IEEE Int. Symp.Circuits
Syst., vol. 4, pp. 4082–4085, 2005.
[7]Rado Zlatanovici, Borivoje Nikolic, “Energy-Delay
of Optimization 64-Bit Carry- Lookahead Adders,”
IEEE J.Solid State circuits,vol.44, no. 2, pp. 569-583, Feb.
2009.
[8] Navi.K , Kavehei.O, Rouholamini.M , Sahafi.A,
“Low-Power and High-Performance 1-bit CMOS
Full.Adder Cell,”Journal of Computers, Academy
Press, vol. 3, no. 2,Feb. 2008.

Currently there are no Refbacks

Paper Title : Square and Cube Architecture using Less Complex and Low Power Architectures
Authors : BELLAM SREEKANYA, K.RAKESH,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Assistant Professor, Dept. of ECE Priyadarshini Institute of Technology & Science for Women
Abstract :

af

In this paper we are going to explore the importance of the design of a Low power and less area square and cube architectures using Vedic sutra , the optimized multiplier are having regular, less complex and parallel structure in design thus this kind of algorithm and its designs used to design square and cube circuit using Vedic sutras over and over again times square and cube are the most sustained on operations in several digital signal processing applications and computation can be condensed using Radix8 and the overall processor performance can be improved for numerous applications.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


DWT, Radix8, Parallel Structure, VEDIC, Urdhva Tiryagbhyam, Anurupyena Sutra, Modified Booth,

BELLAM SREEKANYA,K.RAKESH."Square and Cube Architecture using Less Complex and Low Power Architectures". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1232-1235 , December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1277.pdf,

[1] Y.Yu Fengqi and A. N.Willson,“Multirate digital
squarer architectures,” in Proc. 8th IEEE Int. conf on
Electronics, Circuits and Systems (ICECS 2001), Malta,
Sept. 2–5, 2001 
[2] Swami Bharati Krisna Tirtha, “Vedic
Mathematics,” Motilal Banarsidass Publishers, Delhi
1965
[3] Performance analysis of multipliers for powerspeed trade-off in VLSI designs Sumit R. VaidyaD. R.
Dandekar, ISSN: 1790-5117
[4] Implementation of Multiplier using Vedic
Algorithm. ISSN: 2278- 3075, Volume-2, Issue- 6, May
2013

Currently there are no Refbacks

Paper Title : Investigation on Performance of high speed CMOS Full adder Circuits
Authors : KATTUPALLI KALYANI, G.VASANTH RAO,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Assistant Professor, Dept. of ECE Priyadarshini Institute of Technology & Science for Women
Abstract :

af

- In this paper we demonstrate the performance analysis of CMOS Full adder circuits in this connection the full Adder is designed using CMOS logic style by dividing it in three modules so that it can be optimized at various levels. First module is an XOR-XNOR circuit, which generates full swing XOR and XNOR outputs simultaneously and have a good driving capability. The objective this concept is identified the comparison of power, surface area and complexity of Full adder designs using CMOS Logic Styles. Full adder Design is better compared to conventional design. Transistor Design with respect to power, delay, Power Delay Product Comparison. It is observed that less power is consumed in the Transmission based full adder than the Convention full adder and Pass Transistor full adder.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


High speed, low power. CMOS logic style, full adder.

KATTUPALLI KALYANI,G.VASANTH RAO."Investigation on Performance of high speed CMOS Full adder Circuits ". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1228-1231, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1276.pdf,

[1] N. Weste, and K. Eshranghian, “Principles of
CMOS VLSI Design: A System Perspective,” Reading
MA: Wesley, 1993.
[2] Sanjeev Kumar and Manoj Kumar “4-2
Compressor design with New XOR-XNOR Module”,
4th International Conference on Advanced Computing
and Communication technologies, pp. 106-111, 2014.
[3] Meher, P.; Mahapatra, K.K. "Low power noise
tolerant domino 1-bit full adder", International
Conference on Advances in Energy Conversion
Technologies (ICAECT), pp. 125 – 129, 2014
[4] Vojin G. Oklobdzija, “Simple and Efficient Circuit
for Fast VLSI Adder Realization,” IEEE International
Symposium on Circuits and Systems Proceedings,
1988, pp. 1-4.
[5] J.Rabaey, “Digital Integrated Circuits: A Design
Prospective,” Prentice- Hall, Englewood Cliffs, NJ,
1996.
[6] R. Zimmermann and W. Fichtner, “Low-power
logic styles: CMOS versus pass-transistor logic,” IEEE
Journal of Solid–State Circuits, vol.32, pp.1079-1090,
July 1997.
[7] http://en.wikipedia.org/wiki/CMOS
[8] Devi, Padma, Ashima Girdher, and Balwinder
Singh. "Improved carry select adder with reduced
area and low power consumption." International
Journal of Computer Applications 3.4 (2010): 14-18.
[9] D. Radhakrishnan, “Low-voltage low-power
CMOS full adder,” IEEE Proc. Circuits Devices Syst.,
vol. 148, no. 1, pp. 19–24, Feb. 2001.

Currently there are no Refbacks

Paper Title : IMPLEMENTATION OF HARDWARE IP ROUTER BASED ON VLSI
Authors : KARLAPUDI SRAVANI, P T BALAKRISHNA,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Associate Professor, Dept. of ECE Priyadarshini Institute of Technology & Science for Women
Abstract :

af

A Network-on-chip is a new paradigm in complex system-on-chip designs that provide efficient on chip communication networks. It allows scalable communication and allows decoupling of communication and computation. The data is routed through the networks in terms of packets. We attempts to overcome latency and time reduction issue and can provide multipurpose networking router by means of verilog and it was synthesized in Xilinx 13.2 version, simulated Modelsim 10.0 version. In this paper our attempt is to provide a multipurpose networking router by means of Verilog code, by this we can maintain the same switching speed with more secured way of approach we have even the packet storage buffer on chip being generated by code in our design in the so we call this as the self-independent router called as the VLSI Based router. The three architectures were analyzed for their performance in terms of delay, throughput and latency and we concluded that CDMA router performs better than the other two.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Fictional Coverage, assertions, Randomization, Network-On-Chip,, Register blocks.

KARLAPUDI SRAVANI,P T BALAKRISHNA."IMPLEMENTATION OF HARDWARE IP ROUTER BASED ON VLSI". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1222-1227, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1275.pdf,

[1]Channamallikarjuna Mattihalli, Suprith Ron,Naveen
Kolla ” VLSI Based Robust Router Architecture” Third
International Conference on Intelligent Systems
Modelling and Simulation,2012.
[2]Feng Liang, Luwen Zhang, Shaochong Lei, Guohe
Zhang, Kaile Gao, and Bin Liang” Test Patterns of
Multiple SIC Vectors: Theory and Application in BIST
Schemes” ieee transactions on very large scale
integration (vlsi) systems, vol. 21, no. 4, april 2013. 
[3]James Aweya “IP Router Architectures: An
Overview”.
[4]M. SOWMYA C. SHIREESHA G. SWETHA
PRAKASH J. PATIL” VLSI Based Robust Router
Architecture” .
[5] M. Waldvogel, G. Varghese, J. Turner, and B.
Plattner, “Scalable High Speed IP Routing Lookup,”
Proc. ACM SIGCOMM’97, Cannes, France, Sept. 1997.
[6] V. Srinivasan and G. Varghese, “Faster IP Lookups
using Controlled Prefix Expansion,” Proc. ACM
SIGMETRICS, May 1998.
[7] S. Nilsson and G. Karlsson, “Fast Address Look-Up
for Internet Routers,” Proc. Of IEEE Broadband
Communications’98, April 1998.
[8]E. Filippi, V. Innocenti, and V. Vercellone, “Address
Lookup Solutions for Gigabit Switch/Router,” Proc.
Globecom’98, Sydney, Australia, Nov. 1998.
[9]M. Thottethodi, A. R. Lebeck, and S. S. Mukherjee,
"BLAM: ahigh performance routing algorithm for
virtual cut-through networks," in Proceedings of the
International Parallel and Distributed Processing
Symposium
[10] L. S. Peh and W. J. Dally, "A delay model and
speculative architecture for pipelined routers," in
Proceedings of the 7thInternational Symposium on
High Performance Computer Architecture (HPCA).
[11] A. V. Yakovlev, A. M. Koelmans, and L. Lavagno,
"High-level modeling and design of asynchronous
interface logic," IEEEDesign & Test of Computers.
[12] H. Jingcao and R. Marculescu, "Energy- and
performance aware mapping for regular NoC
architectures," IEEE Transactions on Computer-Aided
Design of Integrated Circuits and Systems, vol. 24, pp.
551-562, 2005.
[13] W. Hangsheng, L. S. Peh, and S. Malik, "A
technology-aware and energy oriented topology
exploration for on-chip Networks," in Proceedings of
the Design, Automation and Test in Europe Conference
and Exhibition .
[14] J. Duato, "A new theory of deadlock-free adaptive
routing in wormhole networks," IEEE Transactions on
Parallel and Distributed Systems, vol. 4.
[15] S. Arjun, W. J. Dally, A. K. Gupta, and B. Towles,
"GOAL: aload-balanced adaptive routing algorithm for
torus networks," in Proceedings of the International
Symposium on ComputerArchitecture.

Currently there are no Refbacks

Paper Title : Circuit for Revisable Quantum Multiplier Implementation of Adders with Reversible Logic
Authors : KONDADASULA VEDA NAGA SAI SRI, M.SAI RAMA KRISHNA,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Assistant Professor, Dept. of ECE Priyadarshini Institute of Technology & Science For Women
Abstract :

af

Programmable reversible logic is gain wide consideration as a logic design style for modern nanotechnology and quantum computing with minimal impact on circuit heat generation in improved computer architecture and arithmetic logic unit designs. In this paper, a 2*2 Swap gate which is a reduced implementation in terms of quantum cost and delay to the previous Swap gate is presented. Then, a novel 3*3 programmable UPG gate capable of calculating the universal logic calculations is presented and verified, and its advantages over the Toffoli and Peres gates are discussed. The UPG is then implemented in a reduced design for calculating n-bit AND, n-bit OR and n-bit ZERO calculations. Then, two 3*3 RMUX gates capable of multiplexing two input values with reduced quantum cost and delay compared to the previously existing Fredkin gate is presented and verified. Next, a novel 4*4 reversible programmable RC gate capable of nine unique logical calculations at low cost and delay is presented and verified. The UPG and RC are implemented in the design of novel sequential and tree-based comparators. These designs are compared to previously existing designs, and their advantages in terms of cost and delay are analyzed.Then, the RMUX is used to improve a reversible SRAM cell we previously presented. The memory cell and comparator are implemented in the design of a Min/Max Comparator device.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Reversible Logic, Quantum cost, Garbage output, Xilinx ISE 14.7

KONDADASULA VEDA NAGA SAI SRI,M.SAI RAMA KRISHNA."Circuit for Revisable Quantum Multiplier Implementation of Adders with Reversible Logic". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1216-1221, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1274.pdf,

[1] C. Bennett, "Logical Reversibility of Computation,"
IBM Journal of Research and Development, vol. 17,
1973, pp. 525-532.
[2] E. Fredkin and T. Toffoli, "Conservative Logic,"
International Journal of Theoretical Physics, vol. 21,
1980, pp. 219-53.
[3] T. Toffoli, "Reversible Computing," Technical Report
MIT/LCS/TM- 151, 1980.
[4] A. Peres, “Reversible Logic and Quantum
Computers,” Physical Review, vol. 32, iss. 6, 1985, pp.
3266-3267.
[5] A. N. Al-Rabadi, “Closed-system quantum logic
network implementation of the viterbi algorithm,”
Facta universitatis-Ser.: Elec. Energy., vol. 22, no. 1, pp.
1–33, April 2009.
[6] H. Thapliyal, N. Ranganathan, and R. Ferreira,
"Design of a Comparator Tree Based on Reversible
Logic," 10th Proceedings of the IEEE International
Conference on Nanotechnology, 2010, pp 1113-6.
[7] M. Morrison, M. Lewandowski, R. Meana and N.
Ranganathan, "Design of Static and Dynamic RAM
Arrays Using a Novel Reversible LogicGate and
Decoder," IEEE NANO, Aug. 2011.
[8] M. Morrison, M. Lewandowski, R. Meana and N.
Ranganathan, "Design of a Novel Reversible ALU with
Enhanced Carry Look-Ahead Adder," IEEE NANO,
Aug. 2011.
[9] N. Weste and D. Harris, CMOS VLSI Design: A
Circuits and Systems Perspective, 3 ed., Boston:
Addison Wesley, 2005, pp. 715-738.
[10] J. Smolin and D. Divincenzo, "Five Two-bit
Quantum Gates Are Sufficient to Implement the
Quantum Fredkin Gate," Physical Review A, vol. 53,
1996, pp 2855-6
[11] H. Thapliyal and N. Ranganathan, "Design of
Efficient Reversible Binary Subtractors Based on A New
Reversible Gate," Proc. of the IEEE Computer Society
Annual Symposium on VLSI, 2009, pp 229-234.
[12] M. Morrison and N. Ranganathan, "Design of a
Reversible ALU Based on Novel Programmable
Reversible Logic Gate Structures," ISVLSI, Jul. 2011, pp.
126-131.
[13] D. Deustch, "Quantum Computational Networks,"
Proceedings of the Royal Society of London. Series A,
Mathematical and Physical Sciences, vol. 425, iss. 1868,
1989, pp. 73-90
[14] R. Feynman, "Simulating Physics with
Computers," International Journal of Theoretical
Physics, 1982.
[15] R. Feynman, "Quantum Mechanical Computers,"
Foundations of Physics, vol. 16, iss. 6, 1986

Currently there are no Refbacks

Paper Title : Enable Batch Auditing for Secure Cloud Storage Using TPA
Authors : PRATHIBHA MAGULURI, B.RANJITHKUMAR,
Affiliations : M.Tech (CSE), Priyadarshini Institute of Technology & Science for women’s
Associate Professor (Dept.of CSE), Priyadarshini Institute of Technology & Science for women’s
Abstract :

af

In this paper we used cloud storage servers remotely in order to store and share the data and enjoy the ondemand high-quality applications and services from a shared pool of configurable computing resources, without communication challenges However, the fact that users no longer have physical control over outsourcing data in this connection data integrity over public cloud is a challenging task, thus this integrity will audited by trusted third party behalf of cloud without reviling any user privacy and also TPA executes multiple task simultaneously i.e batch auditing our proposed framework provides high security and high performance.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED



PRATHIBHA MAGULURI,B.RANJITHKUMAR."Enable Batch Auditing for Secure Cloud Storage Using TPA". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1212-1216, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1273.pdf,

[1] R. Buyya, C.S. Yeo, S. Venugopal, J. Broberg, and I. Brandic, ‘‘Cloud Computing and Emerging IT Platforms: Vision, Hype, Reality for Delivering Computing as the 5th Utility,’’ Future Gen. Comput. Syst., vol. 25, no. 6, pp. 599-616, June 2009.
 [2]M.Armbrust,A.Fox,R.Griffith,A.D.Jose ph,R.Katz,A.Konwinski,G.Lee,D.Patterso n,A.Rabkin,I.Stoica,andM.Zaharia,‘‘AVie wof Cloud Computing,’’ Commun. ACM, vol. 53, no. 4, pp. 50-58, Apr. 2010. 
[3] Customer Presentations on Amazon Summit Australia, Sydney, 2012, accessed on: March 25, 2013. [Online]. Available: http:// aws.amazon.com/apac/awssummitau/. 
[4] J. Yao, S. Chen, S. Nepal, D. Levy, and J. Zic, ‘‘TrustStore: Making Amazon S3 Trustworthy With Services Composition,’’ in Proc. 10th IEEE/ACM Int’l Symposium on Cluster, Cloud and Grid Computing (CCGRID), 2010, pp. 600-605. 
[5] D. Zissis and D. Lekkas, ‘‘Addressing Cloud Computing Secu- rity Issues,’’ Future Gen. Comput. Syst., vol. 28, no. 3, pp. 583-592, Mar. 2011. 
[6] Q. Wang, C. Wang, K. Ren, W. Lou, and J. Li, ‘‘Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing,’’ IEEE Trans. Parallel Distrib. Syst., vol. 22, no. 5, pp. 847-859, May 2011. 
[7] C. Wang, Q. Wang, K. Ren, and W. Lou, ‘‘PrivacyPreserving Public Auditing for Data Storage Security in Cloud INTERNATIONAL JOURNAL OF ADVANCE RESEARCH, IJOAR .ORG ISSN 2320-9194 12 IJOAR© 2015 http://www.ijoar.org Computing,’’ in Proc. 30st IEEE Conf. on Comput. and Commun. (INFOCOM), 2010, pp. 1-9. 
[8] G. Ateniese, R.D. Pietro, L.V. Mancini, and G. Tsudik, ‘‘Scalable and Efficient Provable Data Possession,’’ in Proc. 4th Int’l Conf. Security and Privacy in Commun. Netw. (SecureComm), 2008, pp. 1-10.
 [9] G. Ateniese, R. Burns, R. Curtmola, J. Herring, O. Khan, L. Kissner, Z. Peterson, and D. Song, ‘‘Remote Data Checking Using Provable Data Possession,’’ ACM Trans. Inf. Syst. Security, vol. 14, no. 1, May 2011, Article 12. 
[10]G.Ateniese,R.B.Johns, R.Curtmola,J.Herring,L.Kissner, Z.Peterson, and D. Song, ‘‘Provable Data Possession at Untrusted Stores,’’ in Proc. 14th ACM Conf. on Comput. and Commun. Security (CCS), 2007, pp. 598- 609.

Currently there are no Refbacks

Paper Title : Recommender Systems for e-commerce application using CF
Authors : SIVA KALYANI, S NAGA LAKSHMI,
Affiliations : M.Tech (CSE), Priyadarshini Institute of Technology & Science
Assistant Professor (Dept.of CSE), Priyadarshini Institute of Technology & Science
Abstract :

af

Collaborative filtering (CF) is a very important and common technology for recommender systems. Recommender systems are evidenced to be valuable means that for internet on-line users to deal with the data overload and became one amongst the foremost powerful and common tools in e-commerce. However, current CF ways suffer from such issues as knowledge sparseness, recommendation quality and big-error in predictions with lack of user privacy. There are 3 common approaches to determination the suggestion problem: ancient cooperative filtering, cluster models, and search-based ways and a completely unique rule to advocate things to users supported a hybrid technique. Initial we have a tendency to use cluster to create the user clusters supported the similarity of users. We’ve got taken users look history for similarity calculation. Second we have a tendency to be getting to realize the things that are powerfully related to one another by victimization association rule mining. Finally we'll be victimization these robust association rules in recommendation of things. In ordered to supply the protection we have a tendency to used onion routing algorithms.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Collaborative filtering, e-commerce, cluster models.

SIVA KALYANI,S NAGA LAKSHMI."Recommender Systems for e-commerce application using CF". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1207-1211, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1272.pdf,

[1] K.M. Galotti, Cognitive Psychology In and Out of
the Laboratory, third ed. Wadsworth, 2004.
[2] G.L. Murphy, The Big Book of Concepts. MIT
Press, 2002.
[3] L.W. Barsalou, Cognitive Psychology: An Overview for Cognitive Scientists. Lawrence Erlbaum Assoc., 1992.
[4] S. Schiffer and S. Steele, Cognition and Representation. Westview Press, 1988.
[5] D.L. Medin and E.E. Smith, ―Concepts and Concept Formation,‖ Ann. Rev. of Psychology, vol. 35, pp.
113-138, 1984.
[6] W. Vanpaemel, G. Storms, and B. Ons, ―A Varying
Abstraction Model for Categorization,‖ Proc. Cognitive Science Conf. (CogSci’05), pp. 2277-2282, 2005.
[7] Z. Huang, H. Chen, and D. Zeng, ―Applying Associative Retrieval Techniques to Alleviate the Sparsity
Problem in Collaborative Filtering,‖ ACM Trans. Information Systems, vol. 22, no. 1, pp. 116- 142, 2004.
[8] G. Adomavicius and A. Tuzhilin, ―Toward the
Next Generation of Recommender Systems: A Survey
of the State-of-the-Art and Possible Extensions,‖ IEEE
Trans. Knowledge and Data Eng., vol. 17, no. 6, pp.
734-749, June 2005.
[9]Tekur Vijetha, M.Sri lakshmi, Dr.S.Prem Kumar ,"
Survey on Collaborative Filtering and Content-Based
Recommending " International Journal Of Computer
Engineering In Research Trends. Volume 2, Issue 9,
September 2015, Pp 594-599, ISSN (Online): 2349-7084.
www.ijcert.org.

Currently there are no Refbacks

Paper Title : Privacy Preserving of Data Retrieval for Decentralized Disruption-Tolerant Military Networks
Authors : K Naga Brahma Chari, Dr G Rama swamy,
Affiliations : M.Tech (CSE), Priyadarshini Institute of Technology & Science
Professor (Dept.of CSE), Priyadarshini Institute of Technology & Science
Abstract :

af

Disruption-tolerant network advancements are becoming to be a productive provision that enable remote device passed on by officers to articulate with one another and access the classified information or secret information by abusing outside storage nodes. This framework provides the effective state of associations to approval methods and therefore the solutions overhaul for secure information recovery in most troublesome cases. The foremost encouraging scientific discipline solutions are at home with management the access problems known as Cipher text-Policy AttributeBased encoding (CP-ABE). Indisputably the foremost troublesome problems during this state are the requirement of endorsement arrangements and therefore the methodologies design for secure information recovery. Then again, the problem of applying CP-ABE in suburbanized DTNs presents a handful of securities and insurance challenges on the property denial, key escrow, and coordination of characteristics issued from explicit forces. During this paper, we have a tendency to propose a protected information recovery arrangement mistreatment CP-ABE for suburbanized DTNs wherever varied key forces manage their properties freely. We have a tendency to show the way to apply the projected half to firmly and proficiently touch upon the delineate information speckled within the information scattered within the Interference or disruption tolerant network.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Access control, attribute-based encryption, disruption-tolerant network, multiauthority, secure data retrieval.

K Naga Brahma Chari,Dr G Rama swamy."Privacy Preserving of Data Retrieval for Decentralized Disruption-Tolerant Military Networks". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1203-1206, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1271.pdf,

[1] L. Ibraimi, M. Petkovic, S. Nikova, P. Hartel, and
W. Jonker, ―Mediated ciphertext-policy attributebased encryption and its application,‖ in Proc. WISA,
2009, LNCS 5932, pp. 309–323.
[2] A. Lewko and B. Waters, ―Decentralizing attributebased encryption,‖ Cryptology ePrint Archive: Rep.
2010/351, 2010.
[3] A. Sahai and B. Waters, ―Fuzzy identity-based
encryption,‖ in Proc. Eurocrypt, 2005, pp. 457–473.
[4] V. Goyal, O. Pandey, A. Sahai, and B. Waters,
―Attribute-based encryption for fine-grained access
control of encrypted data,‖ in Proc. ACM Conf. Comput. Commun. Security, 2006, pp. 89–98.
[5] S. Roy and M. Chuah, ―Secure data retrieval based
on ciphertext policy attribute-based encryption (CPAttribute-Based Encryption) system for the Disruption-Tolerant Network’s,‖ Lehigh CSE Tech. Rep.,
2009.
[6] M. Chuah and P. Yang, ―Performance evaluation
of content-based information retrieval schemes for
DTNs,‖ in Proc. IEEE MILCOM, 2007, pp. 1–7.
[7] M. Kallahalla, E. Riedel, R. Swaminathan, Q.
Wang, and K. Fu, ―Plutus: Scalable secure file sharing
on untrusted storage,‖ in Proc. Conf. File Storage
Technol., 2003, pp. 29–42.
[8] A. Harrinton and C. Jensen. Cryptographic access
control in a distributed file system. In Proceedings of
ACM SACMAT, 2003. 

Currently there are no Refbacks

Paper Title : Cooperative Provable Data Possession for Multi-Cloud Server Storage
Authors : VIJAY KUMAR, CH.HARIKA,
Affiliations : (M.Tech) CSE, Dept. of Computer Science and Engineering
Assistant Professor, Dept. of Computer Science and Engineering Priyadarshini Institute of Technology & Science
Abstract :

af

— Provable data possession (PDP) is a strategy for guaranteeing the trustworthiness of information away outsourcing. In this paper, we address the construction of a proficient PDP scheme for disseminated distributed storage to bolster the versatility of administration and information migration, in which we consider the presence of different cloud administration providers to agreeably store and keep up the customers' information. We display an cooperative PDP (CPDP) scheme based on homomorphic verifiable response and hash file indexing order. We demonstrate the security of our scheme based on multi-proven zeroknowledge proof system, which can fulfill culmination, information soundness, and zero-information properties. In addition, we verbalize execution optimization instruments for our scheme, and specifically exhibit a proficient technique for selecting ideal parameter qualities to minimize the computation expenses of customers and capacity administration providers. Our examinations demonstrate that our solution presents lower computation and communication overheads in comparison with non-helpful methodologies
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Storage Security, Provable Data Possession, Interactive Protocol, Zero-knowledge, Multiple Cloud, Cooperative

VIJAY KUMAR,CH.HARIKA."Cooperative Provable Data Possession for Multi-Cloud Server Storage". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1192-1202, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1270.pdf,

[1] B. Sotomayor, R. S. Montero, I. M. Llorente, and I. T. Foster, “Virtual infrastructure management in private and hybrid clouds,” IEEE Internet Computing, vol. 13, no. 5, pp. 14–22, 2009. 
[2] G. Ateniese, R. C. Burns, R. Curtmola, J. Herring, L. Kissner, Z. N. J. Peterson, and D. X. Song, “Provable data possession at untrusted stores,” in ACM Conference on Computer and Communications Security, P. Ning, S. D. C. di Vimercati, and P. F. Syverson, Eds. ACM, 2007, pp. 598– 609. 
[3] A. Juels and B. S. K. Jr., “Pors: proofs of retrievability for large files,” in ACMConference on Computer and Communications Security, P. Ning, S. D. C. di Vimercati, and P. F. Syverson, Eds. ACM, 2007, pp. 584–597. 
[4] G. Ateniese, R. D. Pietro, L. V. Mancini, and G. Tsudik, “Scalable and efficient provable data possession,” in Proceedings of the 4th international conference on Security and privacy in communication netowrks, SecureComm, 2008, pp. 1–10. 
[5] C. C. Erway, A. K¨upc¸ ¨u, C. Papamanthou, and R. Tamassia, “Dynamic provable data possession,” in ACM Conference on Computer and Communications Security, E. Al-Shaer, S. Jha, and A. D. Keromytis, Eds. ACM, 2009, pp. 213–222. 
[6] H. Shacham and B. Waters, “Compact proofs of retrievability,” in ASIACRYPT, ser. Lecture Notes in Computer Science, J. Pieprzyk, Ed., vol. 5350. Springer, 2008, pp. 90–107. .
[7] Q. Wang, C.Wang, J. Li, K. Ren, and W. Lou, “Enabling public verifiability and data dynamics for storage security in cloud computing,” in ESORICS, ser. Lecture Notes in Computer Science, M. Backes and P. Ning, Eds., vol. 5789. Springer, 2009, pp. 355–370. 
[8] Y. Zhu, H. Wang, Z. Hu, G.-J. Ahn, H. Hu, and S. S. Yau, “Dynamic audit services for integrity verification of outsourced storages in clouds,” in SAC, W. C. Chu, W. E. Wong, M. J Palakal, and C.-C. Hung, Eds. ACM, 2011, pp. 1550–1557. 
[9] K. D. Bowers, A. Juels, and A. Oprea, “Hail: a highavailability and integrity layer for cloud storage,” in ACM Conference on Computer and Communications Security, E. Al-Shaer, S. Jha, and A. D. Keromytis, Eds. ACM, 2009, pp. 187–198. 
[10] Y. Dodis, S. P. Vadhan, and D. Wichs, “Proofs of retrievability via hardness amplification,” in TCC, ser. Lecture Notes in Computer Science, O. Reingold, Ed., vol. 5444. Springer, 2009, pp. 109–127. 
[11] L. Fortnow, J. Rompel, and M. Sipser, “On the power of multiprover interactive protocols,” in Theoretical Computer Science, 1988, pp. 156–161. 
[12] Y. Zhu, H. Hu, G.-J. Ahn, Y. Han, and S. Chen, “Collaborative integrity verification in hybrid clouds,” in Applications and Worksharing, CollaborateCom, Orlando, Florida, USA, October 15-18, 2011, pp. 197–206. 
[13] M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. H. Katz, A. Konwinski, G. Lee, D. A. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, “Above the clouds: A berkeley view of cloud computing,” EECS Department, University of California, Berkeley, Tech. Rep., Feb 2009. 
[14] D. Boneh and M. Franklin, “Identity-based encryption from the weil pairing,” in Advances in Cryptology (CRYPTO’2001),vol. 2139 of LNCS, 2001, pp. 213–229.

Currently there are no Refbacks

Paper Title : In Service-Oriented MSN Providing Trustworthy Service Evaluation
Authors : D.RAMANJANEYULU, U.USHA RANI ,
Affiliations : M.Tech (CSE), Priyadarshini Institute of Technology & Science
Associate Professor ( Dept.of CSE), Priyadarshini Institute of Technology & Science
Abstract :

af

In this paper, we are going to propose survey based administration assessment to empower clients to share administration audit in administration situated versatile interpersonal organization. Every administration supplier freely keeps up a TSE for itself, which gathers and stores clients' surveys about its administrations without requiring any third trusted power. The administration surveys can then be made accessible to intrigued clients in settling on savvy administration choice choices. This paper portrays how the audit related normal dangers are destroyed and makes these surveys more fitting and valid. It portrays two frameworks bTSE and SrTSE, these frameworks are depicted to survey related issues and their suitable arrangements. The regular dangers of audits are Linkability, survey dismissal and change which are evacuated by utilizing bTSE; which makes utilization of tokens give incorporated surveys and the framework is progressed and the most vital risk called as Sybil assault is uprooted by utilizing SrTSE; which makes utilization of pseudonyms. Through execution assessment, we demonstrate that the bTSE accomplishes better execution as far as accommodation rate and defer than an administration audit framework that does not receive client collaboration.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Mobile Social Networks, Trust Evaluation, Sybil Attack, Distributed System

D.RAMANJANEYULU,U.USHA RANI."In Service-Oriented MSN Providing Trustworthy Service Evaluation". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1192-1197, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1269.pdf,

[1] W. Dong, V. Dave, L. Qiu, and Y. Zhang, “Secure
Friend Discovery in Mobile Social Networks,” IEEE,
2011.
[2] X. Liang, X. Li, R. Lu, X. Lin, and X. Shen, “Seer: A
Secure and Efficient Service Review System for
ServiceOriented Mobile Social Networks,” IEEE, 2012.
[3] X. Liang, X. Li, T. Luan, R. Lu, X. Lin, and X. Shen,
“Morality- Driven Data Forwarding with Privacy
Preservation in Mobile Social Networks,” IEEE, 2012.
[4] T.H. Luan, L.X. Cai, J. Chen, X. Shen, and F. Bai,
“VTube: Towards the Media Rich City Life with
Autonomous Vehicular Content Distribution,” IEEE,
2011.
[5] J.R. Douceur, “The Sybil Attack,” Proc. Revised
Papers First Int’l Workshop IPTPS, 2002.
[6] J. Newsome, E. Shi, D.X. Song, and A. Perrig, “The
Sybil Attack in Sensor Networks: Analysis & Defenses,”
IPSN, 2004.
[7] D. Quercia and S. Hailes, “Sybil Attacks Against
Mobile Users: Friends and Foes to the Rescue,” IEEE,
2010.
[8] D. Quercia and S. Hailes, “Sybil Attacks Against
Mobile Users: Friends and Foes to the Rescue,” Proc.
IEEE INFOCOM, pp. 336- 340, 2010.
[9] R. Lu, X. Lin, X. Liang, and X. Shen, “A Dynamic
Privacy-Preserving Key Management Scheme for
LocationBased Services in VANETs,” IEEE Trans.
Intelligent Transportation Systems, vol. 13, no. 1, pp.
127-139, Mar. 2012.
[10] R. Lu, X. Lin, T. Luan, X. Liang, and X. Shen,
“Pseudonym Changing at Social Spots: An Effective
Strategy for Location Privacy in VANETs,” IEEE Trans.
Vehicular Technology, vol. 61, no. 1, pp. 86-96, Jan.
2012.
[11] X. Boyen and B. Waters, “Full-Domain Subgroup
Hiding and Constant-Size Group Signatures,” Proc.
10th Int’l Conf. Practice and Theory Public Key
Cryptography, pp. 1- 15, 2007.
[12] X. Liang, Z. Cao, J. Shao, and H. Lin, “Short Group
Signature without Random Oracles,” Proc. Ninth Int’l
Conf. Information and Comm. Security (ICICS), pp. 69-
82, 2007.

Currently there are no Refbacks

Paper Title : Recommendation System for Find Friend on Social Networks.
Authors : B.NAGESH, CH.HARIKA,
Affiliations : (M.Tech) CSE, Dept. of Computer Science and Engineering
Assistant Professor, Dept. of Computer Science and Engineering Priyadarshini Institute of Technology & Science
Abstract :

af

Social networks have become an unlimited source of information, for that several applications have been proposed to mine information from social networks such as: recommender systems. The rapidity and scalability of such a recommender algorithm is as important as the actual logic behind the algorithm because such algorithms generally run over a "huge" graph and implementing these normally would probably take a lot of time for recommending items even if there is one user. The basic idea of recommendation system is to recommend items to users. In this paper various recommender systems are classified are discussed. This paper focuses on providing the overview about the various categories of recommendation techniques developed till now. This paper we present review on recommendation system for find friend on social networks..
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Social networks, Recommender system, user interest, personalized recommendation.

B.NAGESH,CH.HARIKA."Recommendation System for Find Friend on Social Networks.". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1188-1191 , December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1268.pdf,

[1] Prem Melville and Vikas Sindhwani,
Recommendation Systems, In Encyclopedia of
Machine Learning, Claude Sammut and Geoffrey
Webb (Eds), Springer, 2010 Chapter No: 00338, Pg
829-838
[2] W. H. Hsu, A. King, M. Paradesi, T. Pydimarri,
and T. Weninger. Collaborative and structural
recommendation of friends using weblog-based
social network analysis. Proc. Of AAAI Spring
Symposium Series, 2006.
[3] Zhibo Wang, Jilong Liao, Qing Cao, Hairong Qi,
and Zhi Wang, “Friendbook: A Semantic-based
Friend Recommendation System for Social
Networks”IEEE TRANSACTIONS ON MOBILE
COMPUTING, VOL. 13, NO. 99, MAY2014
[4] J. Kwon and S. Kim. Friend recommendation
method using physical and social context.
International Journal of Computer Science and
Network Security, 10(11):116-120, 2010.
[5] A.Kirankumar, P.Ganesh Kumar Reddy, A.Ram
Charan Reddy” A Logic-based Friend Reference
Semantic System for an online Social Networks”,
International Journal Of Computer Engineering In
Research Trends Volume 1, Issue 6, December 2014,
PP 501-506,www.ijcert.org.
[6] D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent
Dirichlet Allocation. Journal of Machine Learning
Research, 3:993- 1022, 2003.
[7] L. Bian and H. Holtzman. Online friend
recommendation through personality matching and
collaborative filtering. Proc. of UBICOMM, pages
230-235, 2011.
[8] K. Farrahi and D. Gatica-Perez. Probabilistic
mining of sociogeographic routines from mobile
phone data. Selected Topics in Signal Processing,
IEEE Journal of, 4(4):746-755, 2010.
[9] K. Farrahi and D. Gatica-Perez. Discovering
Routines from Largescale Human Locations using
Probabilistic Topic Models. ACM Transactions on
Intelligent Systems and Technology (TIST), 2(1), 2011.
[10] L. Gou, F. You, J. Guo, L. Wu, and X. L. Zhang.
Sfviz: Interestbased friends exploration and
recommendation in social networks. Proc. of VINCI,
page 15, 2011.

Currently there are no Refbacks

Paper Title : Efficient Data Access Control for Multi-Authority Cloud Storage using CP-ABE.
Authors : PRAVEEN KUMAR, S.NAGA LAKSHMI,
Affiliations : (M.Tech) CSE, Dept. of Computer Science and Engineering
Assistant Professor, Dept. of Computer Science and Engineering Priyadarshini Institute of Technology & Science
Abstract :

af

Security and data privacy is paramount to cloud users seeking to protect their gigabytes of vibrant business data from the inquisitive eyes of unauthorized users who are attempting to exceed their authority and also it becomes a challenging issue in cloud storage systems. Ciphertext-Policy Attribute-based Encryption (CP-ABE) is observed as one of the most seemly technologies for data access control in cloud storage, because it gives more direct control access strategies to the cloud data owners. This CP-ABE scheme provides intrinsic security mechanisms designed to minimize the security attacks and threats in cloud system. In this paper, we design a Fortified Access control for Multi-Authority Cloud Storage Systems, where the process of data access control is strengthened to ensure the safety of the cloud data. Fortified access control to discourse not only the data privacy difficulties in existing control scheme, by using multiple authorities in the cloud storage system, the proposed scheme can efficiently reaches the tenable access control and revokes the anonymous access to the cloud data. The study and simulation analysis illustrates that proposed well organized Fortified Access Control is both secure and efficient for Cloud Storage Systems.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


access control; multi-authority; security; cloud storage

PRAVEEN KUMAR,S.NAGA LAKSHMI."Efficient Data Access Control for Multi-Authority Cloud Storage using CP-ABE. ". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1182-1187, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1267.pdf,

1. J. Bethencourt, A. Sahai, and B. Waters, “CiphertextPolicy AttributeBased Encryption,” Proc. IEEE Symp.
Security and Privacy (SP ’07), pp. 321-334, 2007.
2. P. Mell and T. Grance, „„The NIST Definition of Cloud
Computing,‟ ‟ National Institute of Standards and
Technology, Gaithersburg, MD, USA, Tech. Rep., 2009.
3. A.B. Lewko, T. Okamoto, A. Sahai, K. Takashima, and
B.Waters, „Fully Secure Functional Encryption: AttributeBased Encryption and (Hierarchical) Inner Product
Encryption,‟ ‟ in Proc. Advances in cryptologyEUROCRYPT’10, 2010, pp. 62-91.
4. M. Li, S. Yu, Y. Zheng, K. Ren, andW. Lou, „„Scalable
and Secure Sharing of Personal Health Records in Cloud
Computing Using Attribute-Based Encryption,‟ ‟ IEEE
Trans. Parallel Distributed Systems, vol. 24, no. 1, pp.
131-143, Jan. 2013.
5. S. Yu, C. Wang, K. Ren, and W. Lou, “Attribute Based
Data Sharing with Attribute Revocation,” Proc. Fifth
ACM Symp. Information, Computer and Comm. Security
(ASIACCS ’10), 2010.
6. J. Hur and D. Noh, “Attribute-based access control
with efficient revocation in data outsourcing systems,”
IEEE Transactions on Parallel and Distributed Systems,
2010.
7. S. Ruj, A. Nayak, and I. Stojmenovic, „„DACC:
Distributed Access Control in Clouds,‟ ‟ in Proc. 10th
IEEE Int’l Conf. TrustCom, 2011, pp. 91-98
8. G. Wang, Q. Liu, and J. Wu, “Hierarchical attributebased encryption for fine-grained access control in cloud
storage services,” in ACM Conference on Computer and
Communications Security, E. Al-Shaer, A. D. Keromytis,
and V. Shmatikov, Eds. ACM, 2010, pp. 735–737. 
9. C. Dong, G. Russello, and N. Dulay, “Shared and
Searchable Encrypted Data for Untrusted Servers,” J.
Computer Security, vol. 19, pp. 367- 397, 2010.
10. D. Boneh and M.K. Franklin, „„Identity-Based
Encryption from the Weil Pairing,‟ ‟ in Proc. 21st Ann.
Int’l Cryptology Conf.: Advances in Cryptology -
CRYPTO’01, 2001, pp. 213-229.

Currently there are no Refbacks

Paper Title : Privacy Preserving with Anonymous Authentication using Decentralized Access Control
Authors : M.Rajesh, Dr G Rama swamy,
Affiliations : M.Tech (CSE), Priyadarshini Institute of Technology & Science
Professor (Dept.of CSE), Priyadarshini Institute of Technology & Science
Abstract :

af

— the spearheading decentralized access control plan for vulnerable data storage in Cloud that backings unidentified confirmation. In the proposed plan, the Cloud checks the validness of the server without knowing the client's uniqueness before putting away data. The proposed outline concentrates on the full cycle access controlling plan wherein the displayed framework it was overlooked. Keeping in mind the end goal to accomplish secure access controlling plan we proposed fine-grained approach at cloud level, it keeps unapproved access controlling from clients or foes adequately our validation and access control plan is decentralized and solid, not at all like different access control plans intended for Cloud which are unified. The correspondence, calculation overheads are like unified methodologies. In addition, our proposed plan demonstrates that our framework has secure crypto instrument towards accomplishing data integrity and security.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Decentralized access Controlling, Coarse-grained Approach, Fine-grained Approach

M.Rajesh,Dr G Rama swamy."Privacy Preserving with Anonymous Authentication using Decentralized Access Control". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1178-1181, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1266.pdf,

[1] S Sushmita Ruj, Milos Stojmenovic and Amiya Nayak, ―Decentralized Access Control with Anonymous Authentication of Data Stored in Clouds‖, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 
[2] C. Wang, Q. Wang, K. Ren, N. Cao, and W. Lou, ―Toward Secure and Dependable Storage Services in Cloud Computing,‖ IEEE Trans. Services Computing, Apr.- June 2012. 
[3] H. Li, Y. Dai, L. Tian, and H. Yang, ―IdentityBased Authentication for Cloud Computing,‖ Proc. First Int’l Conf. Cloud Computing, 2009. 
[4] C. Gentry, ―A Fully Homomorphic Encryption Scheme,‖ PhD dissertation, Stanford Univ., 2009. 
[5] A.-R. Sadeghi, T. Schneider, and M. Winandy, ―Token-Based Cloud Computing,‖ Proc. Third Int’l Conf. Trust and Trustworthy Computing (TRUST), 2010. 
[6] M. Li, S. Yu, K. Ren, and W. Lou, ―Securing Personal Health Records in Cloud Computing: PatientCentric and Fine-Grained Data Access Control in Multi-Owner Settings,‖ Proc. Sixth Int’l ICST Conf. Security and Privacy in Comm. Networks (SecureComm), 2010. 
[7] S. Yu, C. Wang, K. Ren, and W. Lou, ―Attribute Based Data Sharing with Attribute Revocation,‖ Proc. ACM Symp. Information, Computer and Comm. Security (ASIACCS), 2010.
 [8] G. Wang, Q. Liu, and J. Wu, ―Hierarchical Attribute-Based Encryption for Fine-Grained Access Control in Cloud Storage Services,‖ Proc. 17th ACM Conf. Computer and Comm. Security (CCS), 2010. 
[9] F. Zhao, T. Nishide, and K. Sakurai, ―Realizing Fine-Grained and Flexible Access Control to Outsourced Data with Attribute-Based Cryptosystems,‖ Proc. Seventh Int’l Conf. Information Security Practice and Experience (ISPEC), 2011. 
[10] S. Ruj, A. Nayak, and I. Stojmenovic, ―DACC: Distributed Access Control in Clouds,‖ Proc. IEEE 10th Int’l Conf. Trust, Security and Privacy in Computing and Communications (TrustCom), 2011. 
[11] S.SeenuIropia, R.Vijayalakshmi, ―Decentralized Access Control Of Data Stored In Clouds Using Key Policy Attribute Based Encryption‖, International Journal Of Invention In Computer Science And Engineering, 2014.

Currently there are no Refbacks

Paper Title : Automatic and Systematic Methodology for Test Packet Generation
Authors : Prasanna, CH.Harika,
Affiliations : (M.Tech) CSE, Dept. of Computer Science and Engineering
Assistant Professor, Dept. of Computer Science and Engineering Priyadarshini Institute of Technology & Science
Abstract :

af

As of late systems are becoming wide and more complex. In any case, managers use devices like ping and trace route to investigate issues. Consequently, we proposed a programmed and Systematic methodology for testing and investigating systems called Automated Test Packet Generation (ATPG). This methodology gets switch designs and creates a device autonomous model. ATPG create a couple set of Packet Generation to discover each connection in the system. Test bundles are sent as often as possible and it recognize disappointments to limit the issue. ATPG can distinguish both practical and execution (throughput, inertness) issues. We found, less number of Packet Generation is sufficient to test all principles in systems. For case, 4000 parcels can cover all tenets in Stanford spine system while 53 are sufficiently much to cover all connections.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Fault Localization, Test Packet Selection, Network Debugging, Automatic Test packet Generation (ATPG).

Prasanna,CH.Harika."Automatic and Systematic Methodology for Test Packet Generation". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1173-1177, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1265.pdf,

[1] Hongyi Zeng, Peyman Kazemian, George Varghese, ACM, and Nick McKeown, ACM,“Automatic Test Packet Generation”. 
[2] M. Jain, C. Dovrolis,“End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput”, IEEE/ACM Trans. Netw., Vol. 11, No. 4, pp. 537–549, Aug. 2003. 
[3] Kompella, R. R., Greenberg, A., Rexford, J., Snoeren, A. C., Yates, J. Cross-layer Visibility as a Service", In Proc. of fourth workshop on Hot Topics in Networks (HotNet-IV) (2005) 
[4] D. Maltz, G. Xie, J. Zhan, H. Zhang, G. Hjalmtysson, A. Greenberg,"Routing design in operational networks: A look from the inside", In Proc. ACM SIGCOMM, 2004. 
[5] Mark Stemm, Randy Katz, Srinivasan Seshan,“A network measurement architecture for adaptive applications”, In Proceedings of the nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 285 - 294, 2000. 
[6] Verma, D.,"Simplifying Network Administration using Policy based Management". 
[7] P. Yalagandula, P. Sharma, S. Banerjee, S. Basu, S.-J. Lee, “S3: A scalable sensing service for monitoring large networked systems". 
[8] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest,"Introduction To Algorithms", Eastern Economy Edition.New Delhi: Prentice-Hall of India Private Limited 1998. 
[9] E Balagurusamy,"Programming in ANSI C", Second edition. New Delhi: Tata McGraw-Hill, 1997. 
[10] Deitel & Deitel, C++ How To Program, Second Edition, New Jersey, NJ Prentice Hall, 1997
 [11] Tom Christiansen, Nathn Torkington,"Perl Cookbook: Solutions and Examples For Perl Programmers", 1st Edition, Sebastopol, CA: O’Reilly & Associates, Inc., 1999. 
[12] Nathan Patwardhan, Ellen Siever and Stephen Spainhour, PERL In A Nutshell, 2nd Edition, Sebastopol, CA: O’Reilly & Associates, Inc., 2002. 
[13] Tom Milligan, “Using Perl With Rational ClearCase Automation Library”, 2004Retrieved Nov10, 2010 from

Currently there are no Refbacks

Paper Title : Low Cost Multipurpose Camera
Authors : shahil tp, deepak joseph, sharon TOM
Affiliations : B-Tech (Electronics and Communication Engineering) , Vimal Jyothi Engg. College Chemperi , Kannur ,Kannur university (AICTE)
Abstract :

af

today we are facing many problems with shortage of electricity, so we should develop new systems which use less electricity. Presently we have many security system which consumes electricity in large amount, also they are costly. To overcome this problem we developed a low cost multipurpose camera. With the invention of Raspberry pi, it’s easy to develop low cost multi –Purpose security camera. While compared to ordinary system our system has many advantages, this system has reduced power consumption, less memory is used, and any system can be changed into our system.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Multipurpose camera, raspberry pi, PIR sensor.

shahil tp,deepak joseph,sharon TOM."Low Cost Multipurpose Camera". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1170-1172, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1264.pdf,

[1] Gustavo A. Pelaez C., “Driver Monitoring Based
On Low Cost 3-D Sensors,” IEEE Trans. Intell.
Transp. Syst., vol. 15, no. 4, pp. 1855-1860, Aug. 2014.
[2] T. Wakita et al., “Driver identification using
driving behavior signals,” in Proc. IEEE Intell.
Transp. Syst., 2005, pp. 396-401.
[3] C. Papadelis et al., “Monitoring sleepiness onboard logical recordings for preventing sleepdeprived traffic accidents,” Clin. Neurophysiol., vol.
118, no. 9, pp. 1906-1922, Sep. 2007.
[4] C. Papadelis et al., “Monitoring driver’s
sleepiness on-board for preventing road accidents,”
Stud. Health Technol. Inf., vol. 150, pp. 485-489, 2009.
[5] G Fanelli, T. Weise, J. Gall, and L. Van Gool, “Real
time head pose estimation from consumer depth cameras,” in Proc. Int. Conf. Pattern Recog., 2011, pp.
101-110.
[6] J. Sherrah, S. Gong, and E. J. Ong, “Face
distributions in similarity space under varying head
pose,” Image Vis. Comput., vol. 19, no. 12, pp. 807-
819, Oct. 2001.
[7] P. Viola and M. J. Jones, “Robust real-time face
detection,” Int. J. Comput. Vis., vol. 57, no. 2, pp. 137-
154, May 2004.

Currently there are no Refbacks

Paper Title : BUS PASSENGER ALERT SYSTEM
Authors : Jerrin Yomas, Maneesha Unnikrishnan, Anju C. Justin
Affiliations : Vimal Jyothi Engineering College, Chemperi
Abstract :

af

This is microcontroller based project. In this project we introduce a new system for bus passenger alert. The device that we make will automatically produce a sound message when we reach each bus station. It will also monitor the speed of the vehicle. If the speed exceeds a particular limit a message will be passed to the RTO office to take the necessary actions.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED



Jerrin Yomas,Maneesha Unnikrishnan,Anju C. Justin."BUS PASSENGER ALERT SYSTEM". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1166-1169 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1263.pdf,

[1] "ZigBee Specification FAQ". Zigbee Alliance.
Retrieved 14 June 2013.
[2] "ZigBee Wireless Networking", Drew Gislason
(via EETimes) ZigBee Document 053474r06, Version
1.0, ZigBee Specification. ZigBee Alliance. 2004.
[3] "IEEE 802.15.4". Ieee802.org. Retrieved 2012- 10-
18.
[4] Bellido-Outeirino, Francisco J. (February 2012).
"Building lighting automation through the
integration of DALI with wireless sensor networks".
IEEE Transactions on Consumer Electronics 58 (1):
47–52 doi: 10.1109/TCE.2012.61
[5] "Wireless Sensor Networks Research Group".
Sensor-networks.org. 2008-11-17. Retrieved 2012- 10-
18.
[6] Oleg Artamonov (2004-10-26)."X-bit’s Guide:
Contemporary LCD Monitor. Parameters and
Characteristics". Xbitlabs.com. Retrieved 2009-08- 05.

Currently there are no Refbacks

Paper Title : Ultra Stable Flying Robo
Authors : Anoop B K, Manoj K C, Antony Sebastian
Affiliations : ASSISTANT PROFESSOR, VIMAL JYOTHI ENGINEERING COLLEGE, CHEMPERI KANNUR
VIMAL JYOTHI ENGINEERING COLLEGE, CHEMPERI KANNUR
Abstract :

af

— Today we are running out of energy, out of resources, space, etc. high competition in the field for giving more service with lowest cost and maximizing the service. Innovations and inventions are taking place all over the world for delivering the service at lowest cost. The man mobility is decreasing and the work he can do from one place is increasing day by day. Here we are describing a flying object which can fly through the sky for multiple tasks with cheap maintaining costs. For example giving internet, television channels, parcel service, Traffic monitoring etc. are little while we consider the whole scenario. About the device, this device works with the solar energy incorporated with Lithium cells / NiCd Battery chemistries.. Idea by Bionic imitations. And this device has 8 legs which will be used for float movement. It also has gyroscope and accelerometer for steady movements. The attached GPS will enable the device positioning on to deferent geo locations. Communicating with the device is another crucial factor. So far we have two options for the movement. One is the pre allocated trip route set by GPS co-ordinates. Another one is that to establish a wireless RF connection with the device or using the available mobile networks.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Flying object, Arduino, Xbee, GPS, Servo Motor, Communication, Shield

Anoop B K,Manoj K C,Antony Sebastian,Jinu Jose,Jithin M."Ultra Stable Flying Robo". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1162-1165 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1262.pdf,

1. Arduino website: http//www. Arduino.cc/
2. Robort Electronics: http//www,robort-electronics
.co.uk/
3. www.instructables.com
4. www.intorobotics.com
5. www.sparkfun.com
6. http://www.wikipedia.com

Currently there are no Refbacks

Paper Title : Smart Restaurant
Authors : Mrs. Bindu Sebastian, Athira Varghese, Megha Merin Jose
Affiliations : ECE Department, Vimal Jyothi Engineering College,Kannur
Abstract :

af

Smart Restaurant is concept to realize the automation in restaurants or hotels. In this restaurant the kitchen people can get orders from each table through voice alert. This project consists of two sections one is transmitter section and other is receiver section. In our project we have designed an electronic system to order through RF based wireless communication using a menu card provided on each table. Touch panel is used here, which offers simple and multiple menus driven control panel. Mainly touch screen technology is used where control or settings of different parameters in wide manner. We can select the items shown in its display along with its price and can order the selected items through touch panel. The total cost of the items is also displayed. This order details are collected by wireless receiver placed in the kitchen and will display the items in its display along with the voice announcement through speaker. Each table has its own unique digital code. So the kitchen people can supply those items to that table after preparing it. This will give advantage to avoid the time delay usually experienced during bearer coming, collecting order and finally passes to the kitchen manually.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Radio frequency, automation, microcontroller unit, liquid crystal display, transceiver

Mrs. Bindu Sebastian,Athira Varghese,Megha Merin Jose."Smart Restaurant". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1158-1161, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1261.pdf,

1. LINEAR INTEGRATED CIRCUITS:- Dr.
ROY CHOUDHARY, SHAIL .D. JAIN
2. ELECTRONIC CIRCUITS & DEVICES:- J.B
GUPTA
3. SOLID STATE ELECTRONIC DEVICES:-
DENU STREETMAN, SANJAY BANERJEE 

Currently there are no Refbacks

Paper Title : TSUNAMI DETECTION SYSTEM
Authors : Mrs.Grace John , Athira P I, Sreedevi K
Affiliations : ECE Department, Vimal Jyothi Engineering College,Kannur
Abstract :

af

The Tsunami waves cause considerable destruction and kills people . The detection section of the proposed system consists of a microcontroller, a vibration sensor to detect the Tsunami occurrence and a tilt sensor to monitor the sea waves. The principle is as follows, on the onslaught of Tsunami or any other natural calamity of this type , there is an abnormal pressure changes in the sea floor producing vibrations. Here a piezoelectric vibration sensor is used which gives an output depending on variations, and a microcontroller is used to announce the oncoming of Tsunami event to a concerned person, through the mobile computing. Mobile is used to give warning calls or send warning messages.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Peripheral Interface Controller

Mrs.Grace John ,Athira P I,Sreedevi K."TSUNAMI DETECTION SYSTEM". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1153-1157 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1260.pdf,

[1] Kenneth Jamaal,“8051 Microcontroller “, West Publishing Company, 1991. 
[2] R.S.Sedha, B.L.Theraja, ”Principles of Electronics Devices and Circuits”, International Book distributing CO, India, 1998. 
[3] Steven Roman, Ron Petrusha, Paul Lomax, “VB.Net Language In a nutshell”, O’Reilly, 2002. 
[4] F.I.Gonneuman, Jalez, H.B.milburn, E.N.Bernard, Journalfrom “Oceanic and Atmospheric Administration”, WA98115, 2003. 
[5] Wayne, A.Morrissey, Journal from “Science and Technology Information Resources, Science and Industry Division”, 2005. 
[6] Macrander , ”PACT-a bottom pressure based .Compact Deep ocean Tsunameter with Acoustic surface Coupling.” 2009 IEEE.
[7] YasuakiTeshirogi, Jun Sawamoto, NorihisaSegawa, EijiSugino, “A proposal of Tsunami warning system Using Area Mail Disaster Information Service on mobile Phones.”2009 International Conference on Advanced Information networking and application workshops.
 [8] USAID|ASIA –“How do seismometers contribute to a Tsunami Warning System”.

Currently there are no Refbacks

Paper Title : Review on Data Mining Techniques with Big Data
Authors : TEMPALLI NARENDRA BABU, R.MADHURI DEVI,
Affiliations : M.Tech (CSE), Priyadrshini Institute of Technology & Management
AssociateProfessor (Dept.of CSE), Priyadrshini Institute of Technology & Management
Abstract :

af

The term Big Data comprises large- volume, complex, growing data sets with multiple, autonomous sources. With the fast development of networking, data storage, and the data collection capacity, Big Data are now rapidly expanding in all science and engineering domains, including physical, biological and biomedical sciences. This paper presents a HACE theorem that characterizes the features of the Big Data revolution, and proposes a Big Data processing model, from the data mining perspective. This data-driven model involves demand- driven aggregation of information sources, mining and analysis, user interest modeling, and security and privacy considerations. We analyze the challenging issues in the data-driven model and also in the Big Data revolution.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


HACE,Hadoop,Big Data, heterogeneity, autonomous sources, complex and evolving associations

TEMPALLI NARENDRA BABU,R.MADHURI DEVI."Review on Data Mining Techniques with Big Data". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1147-1152, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1259.pdf,

1. Bakshi, K.,(2012),” Considerations for big data: Architecture and approach” 
2. Mukherjee, A.; Datta, J.; Jorapur, R.; Singhvi, R.; Haloi, S.; Akram, W., (18-22 Dec.,2012) , “Shared disk big data analytics with Apache Hadoop” 
3. Aditya B. Patel, Manashvi Birla, Ushma Nair ,(6-8 Dec. 2012),“Addressing Big Data Problem Using Hadoop and Map Reduce”
 4. Wei Fan and Albert Bifet “ Mining Big Data:Current Status and Forecast to the Future”,Vol 14,Issue 2,2013 
5. Algorithm and approaches to handle large Data-A Survey,IJCSN Vol 2,Issue 3,2013
 6. Xindong Wu , Gong-Quing Wu and Wei Ding “ Data Mining with Big data “, IEEE Transactions on Knoweledge and Data Enginnering Vol 26 No1 Jan 2014 
7. Xu Y etal, balancing reducer workload for skewed data using sampling based partioning 2013. 
8. X. Niuniu and L. Yuxun, “Review of Decision Trees,” IEEE, 2010 . 
9. Decision Trees for Business Intelligence and Data Mining: Using SAS Enterprise Miner “Decision Trees-What Are They?”
 10. Weiss, S.H. and Indurkhya, N. (1998), Predictive Data Mining: A Practical Guide, Morgan Kaufmann Publishers, San Francisco, CA

Currently there are no Refbacks

Paper Title : Automatic and Methodical approach for Test Packet Generation
Authors : BEJJANKI PRADEEPKUMAR, D.RAVI KIRAN,
Affiliations : M.Tech (CSE), Priyadrshini Institute of Technology & Management
Professor (Dept.of CSE), Priyadrshini Institute of Technology & Management
Abstract :

af

Recently networks are growing wide and more complex. However administrators use tools like ping and trace route to debug problems. Hence we proposed an automatic and Methodical approach for testing and debugging networks called Automatic Test Packet Generation (ATPG). This approach gets router configurations and generates a device-independent model. ATPG generate a few set of test packets to find every link in the network. Test packets are forwarded frequently and it detect failures to localize the fault. ATPG can detect both functional and performance (throughput, latency) problems. We found, less number of test packets is enough to test all rules in networks.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Fault Localization, Test Packet Selection, Network Debugging, Automatic Test packet Generation (ATPG).

BEJJANKI PRADEEPKUMAR,D.RAVI KIRAN."Automatic and Methodical approach for Test Packet Generation". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1142-1146 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1258.pdf,

[1] Hongyi Zeng, Peyman Kazemian, George Varghese, ACM, and Nick McKeown, ACM,“Automatic Test Packet Generation”.
 [2] M. Jain, C. Dovrolis,“End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput”, IEEE/ACM Trans. Netw., Vol. 11, No. 4, pp. 537–549, Aug. 2003. 
[3] Kompella, R. R., Greenberg, A., Rexford, J., Snoeren, A. C., Yates, J. Cross-layer Visibility as a Service", In Proc. of fourth workshop on Hot Topics in Networks (HotNet-IV) (2005)
 [4] D. Maltz, G. Xie, J. Zhan, H. Zhang, G. Hjalmtysson, A. Greenberg,"Routing design in operational networks: A look from the inside", In Proc. ACM SIGCOMM, 2004. 
[5] Mark Stemm, Randy Katz, Srinivasan Seshan,“A network measurement architecture for adaptive applications”, In Proceedings of the nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 285 - 294, 2000. 
[6] Verma, D.,"Simplifying Network Administration using Policy based Management". 
[7] P. Yalagandula, P. Sharma, S. Banerjee, S. Basu, S.-J. Lee, “S3: A scalable sensing service for monitoring large networked systems". 
[8] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest,"Introduction To Algorithms", Eastern Economy Edition.New Delhi: Prentice-Hall of India Private Limited 1998. 
[9] E Balagurusamy,"Programming in ANSI C", Second edition. New Delhi: Tata McGraw-Hill, 1997. 
[10] Deitel & Deitel, C++ How To Program, Second Edition, New Jersey, NJ Prentice Hall, 1997 
[11] Tom Christiansen, Nathn Torkington,"Perl Cookbook: Solutions and Examples For Perl Programmers", 1st Edition, Sebastopol, CA: O’Reilly & Associates, Inc., 1999. 
[12] Nathan Patwardhan, Ellen Siever and Stephen Spainhour, PERL In A Nutshell, 2nd Edition, Sebastopol, CA: O’Reilly & Associates, Inc., 2002. 
[13] Tom Milligan, “Using Perl With Rational ClearCase Automation Library”, 2004Retrieved Nov10, 2010 from

Currently there are no Refbacks

Paper Title : A Secure and Dynamic Multi Keyword Ranked Search Scheme over encrypted
Authors : A.Raghavendra Praveen Kumar, K.Tarakesh, U.Veeresh
Affiliations : Pursuing M.Tech, CSE Branch, Dept of CSE
Assistant Professor, Department of Computer Science and Engineering
Assistant Professor, Department of Computer Science and Engineering G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.
Abstract :

af

The major aim of this paper is to solve the problem of multi-keyword ranked search over encrypted cloud data (MRSE) at the time of protecting exact method wise privacy in the cloud computing concept. Data holders are encouraged to outsource their difficult data management systems from local sites to the business public cloud for large flexibility and financial savings. However for protecting data privacy, sensitive data have to be encrypted before outsourcing, which performs traditional data utilization based on plaintext keyword search. As a result, allowing an encrypted cloud data search service is of supreme significance. In view of the large number of data users and documents in the cloud, it is essential to permit several keywords in the search demand and return documents in the order of their appropriate to these keywords. Similar mechanism on searchable encryption makes centre on single keyword search or Boolean keyword search, and rarely sort the search results. In the middle of various multi-keyword semantics, deciding the well-organized similarity measure of “coordinate matching,” it means that as many matches as possible, to capture the appropriate data documents to the search query. Particularly, we consider “inner product similarity” i.e., the amount of query keywords shows in a document, to quantitatively estimate such match measure that document to the search query. Through the index construction, every document is connected with a binary vector as a sub index where each bit characterize whether matching keyword is contained in the document. The search query is also illustrates as a binary vector where each bit means whether corresponding keyword appears in this search request, so the matched one could be exactly measured by the inner product of the query vector with the data vector. On the other hand, directly outsourcing the data vector or the query vector will break the index privacy or the search privacy. The vector space model facilitate to offer enough search accuracy, and the DES encryption allow users to occupy in the ranking while the popularity of computing work is done on the server side by process only on cipher text. As a consequence, data leakage can be eradicated and data security is guaranteed.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Multi-keyword ranked search over encrypted cloud data, OTP, Product resemblance, Cloud, Data owners

A.Raghavendra Praveen Kumar,K.Tarakesh,U.Veeresh."A Secure and Dynamic Multi Keyword Ranked Search Scheme over encrypted". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1137-1141, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1257.pdf,

[1] N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, “Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data,” Proc. IEEE INFOCOM, pp. 829- 837, Apr, 2011.
[2] L.M. Vaquero, L. Rodero-Merino, J. Caceres, and M.Lindner, “A Break in the Clouds: Towards a Cloud Definition,” ACM SIGCOMM Comput. Commun. Rev., vol. 39, no. 1, pp. 50-55, 2009.
[3] N. Cao, S. Yu, Z. Yang, W. Lou, and Y. Hou, “LT Codes-Based Secure and Reliable Cloud Storage Service,” Proc. IEEE INFOCOM, pp. 693- 701, 2012. 
[4] S. Kamara and K. Lauter, “Cryptographic Cloud Storage,” Proc. 14th Int’l Conf. Financial Cryptograpy and Data Security, Jan. 2010. 
[5] A. Singhal, “Modern Information Retrieval: A Brief Overview,” IEEE Data Eng. Bull., vol. 24, no. 4, pp. 35- 43, Mar. 2001. 
[6] I.H. Witten, A. Moffat, and T.C. Bell, Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishing, May 1999. 
[7] D. Song, D. Wagner, and A. Perrig, “Practical Techniques for Searches on Encrypted Data,” Proc. IEEE Symp. Security and Privacy, 2000. 
[8] E.-J. Goh, “Secure Indexes,” Cryptology ePrint Archive, http:// eprint.iacr.org/2003/216. 2003. [9] Y.-C. Chang and M. Mitzenmacher, “Privacy Preserving Keyword Searches on Remote Encrypted Data,” Proc. Third Int’l Conf. Applied Cryptography and Network Security, 2005. 
[10] R. Curtmola, J.A. Garay, S. Kamara, and R. Ostrovsky, “Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions,” Proc. 13th ACM Conf. Computer and Comm. Security (CCS ’06), 2006. 
[11] D. Boneh, G.D. Crescenzo, R. Ostrovsky, and G. Persiano, “Public Key Encryption with Keyword Search,” Proc. Int’l Conf. Theory and Applications of Cryptographic Techniques (EUROCRYPT), 2004. 
[12] M. Bellare, A. Boldyreva, and A. ONeill, “Deterministic and Efficiently Searchable Encryption,” Proc. 27th Ann. Int’l Cryptology Conf. Advances in Cryptology (CRYPTO ’07), 2007. 
[13] M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi, “Searchable Encryption Revisited: Consistency Properties, sRelation to Anonymous Ibe, and Extensions,” J. Cryptology, vol. 21, no. 3, pp. 350-391, 2008.

Currently there are no Refbacks

Paper Title : Key Aggregate Searchable Encryption for Group Data Sharing Via Cloud Data Storage
Authors : K.Manohar, R. Anil Kumar, N.Parashuram
Affiliations : Pursuing M.Tech, CSE Branch, Dept of CSE
Assistant Professor, Department of Computer Science and Engineering</br>Assistant Professor, Department of Computer Science and Engineering G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.
Abstract :

af

the ability of preferentially sharing encrypted data with unlike users through public cloud storage might really ease security distress, by possibility data disclose in the cloud. A key test to design such encryption idea lies in the well-organized management encryption keys. The preferred flexibility of allocating any group documents with any group of users by attaining weightage different encryption keys to be used for different documents. On the other hand, this involves the need of securely distributing to users by a large number of keys for both encryption and search, and those users have to progress to store the received keys. The indirect need for secure communication, storage, and complexity clearly cause the unreasonable approach. In this paper, we concentrate on this practical problem, by suggesting the novel concept of key aggregate searchable encryption (KASE) and instantiating the idea through a real KASE scheme, in which a data owner wants to share out a single key to a user for distributing a large number of documents, and the user needs to present a single trapdoor to the cloud for questioning the shared documents.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


data sharing, Searchable encryption, data privacy, cloud storage

K.Manohar,R. Anil Kumar,N.Parashuram."Key Aggregate Searchable Encryption for Group Data Sharing Via Cloud Data Storage". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1132-1136, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1256.pdf,

[1] Baojiang Cui, Zheli Liu and Lingyu Wang : Key-Aggregate Searchable Encryption for Group Data Sharing via Cloud Storage, IEEE Transactions On Computers, Vol. 6, No. 1, January 2014
 [2] R. Lu, X. Lin, X. Liang, and X. Shen, “Secure Provenance:The Essential of Bread and Butter of Data Forensics in Cloud Computing”, Proc. ACM Symp. Information, Computer and Comm.Security, pp. 282-292, 2010. 
[3] X. Liu, Y. Zhang, B. Wang, and J. Yan. “Mona: secure multiowner data sharing for dynamic groups in the cloud”, IEEE Transactions on Parallel and Distributed Systems, 2013, 24(6): 1182-1191. 
[4] C. Chu, S. Chow,W. Tzeng, et al. “KeyAggregate Cryptosystem for Scalable Data Sharing in Cloud Storage”, IEEE Transactions on Parallel and Distributed Systems, 2014, 25(2): 468-477. 
[5] X. Song, D.Wagner, A. Perrig. “Practical techniques for searches on encrypted data”, IEEE Symposium on Security and Privacy, IEEE Press, pp. 44C55, 2000. 
[6] R. Curtmola, J. Garay, S. Kamara, R. Ostrovsky. “Searchable symmetric encryption: improved definitions and efficient constructions”, In: Proceedings of the 13th ACM conference on Computer and Communications Security, ACM Press, pp. 79-88, 2006. [7] P. Van,S. Sedghi, JM. Doumen. “Computationally efficient searchable symmetric encryption”, Secure Data Management, pp.87- 100, 2010. 
[8] S. Kamara, C. Papamanthou, T. Roeder. “Dynamic searchable symmetric encryption”, Proceedings of the 2012 ACM conference on Computer and communications security (CCS), ACM, pp. 965- 976, 2012. 
[9] D. Boneh, C. G, R. Ostrovsky, G. Persiano. “Public Key Encryption with Keyword Search”, EUROCRYPT 2004, pp. 506C522,2004. 
[10] Y. Hwang, P. Lee. “Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System”, In: PairingBased Cryptography C Pairing 2007, LNCS, pp. 2-22, 2007. [11] J. Li, Q. Wang, C. Wang. “Fuzzy keyword search over encrypted data in cloud computing”, Proc. IEEE INFOCOM, pp. 1-5, 2010. 
[12] C. Bosch, R. Brinkma, P. Hartel. “Conjunctive wildcard search over encrypted data”, Secure Data Management. LNCS, pp. 114- 127, 2011. 
[13] C. Dong, G. Russello, N. Dulay. “Shared and searchable encrypted data for untrusted servers”, Journal of Computer Security, pp. 367-397, 2011. 
[14] F. Zhao, T. Nishide, K. Sakurai. Multi-User Keyword Search Scheme for Secure Data Sharing with Fine-Grained Access Control. Information Security and Cryptology, LNCS, pp. 406-418, 2012. 
[15] J. W. Li, J. Li, X. F. Chen, et al. “Efficient Keyword Search over Encrypted Data with FineGrained Access Control in Hybrid Cloud”, In: Network and System Security 2012, LNCS, pp. 490- 502, 2012. 
[16] J. Li, K. Kim. “Hidden attribute-based signatures without anonymity revocation”, Information Sciences, 180(9): 1681-1689, Elsevier, 2010. 
[17] X.F. Chen, J. Li, X.Y. Huang, J.W. Li, Y. Xiang. “Secure Outsourced Attribute-based Signatures”, IEEE Trans. on Parallel and Distributed Systems, DOI.ieeecomputersociety.org/10.1109/TPDS.2013. 180, 2013. 
[18] J.Li, X.F. Chen, M.Q. Li, J.W. Li, P. Lee, Wenjing Lou. “Secure Deduplication with Efficient and Reliable Convergent Key Management”, IEEE Transactions on Parallel and Distributed Systems, 25(6): 1615-1625, 2014. 
[19] Z. Liu, Z. Wang, X. Cheng, et al. “Multi-user Searchable Encryption with Coarser-Grained Access Control in Hybrid Cloud”, Fourth International Conference on Emerging Intelligent Data and Web Technologies (EIDWT), IEEE, pp. 249-255, 2013. 
[20] C. Wang, Q. Wang, K. Ren, and W. Lou, “Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing”, Proc. IEEE INFOCOM, pp. 525-533, 2010. 
[21] B. Wang, B. Li, and H. Li, “Knox: PrivacyPreserving Auditing for Shared Data with Large Groups in the Cloud”, Proc. 10th Int’l Conf. Applied Cryptography and Network Security, pp. 507- 525, 2012. 
[22] D. Boneh, C. Gentry, B. Waters.“ Collusion resistant broadcast encryption with short ciphertexts and private keys”, Advances in CryptologyCCRYPTO 2005, pp. 258-275, 2005. 
[23] D. H. Phan, D. Pointcheval, S. F. Shahandashti, et al. “Adaptive CCA broadcast encryption with constant-size secret keys and ciphertexts”, International journal of information security, 12(4):251-265, 2013.
 [24] D. Boneh, B. Lynn, H. Shacham. “Short signatures from the Weil pairing”, Advances in Cryptology ASIACRYPT 2001, pp. 514-532, 2001.

Currently there are no Refbacks

Paper Title : Cost-Effective Authentic and Anonymous Data Sharing with Forward Security
Authors : C.Praveen Kumar, P Suman Prakash, Dr.S.Prem Kumar
Affiliations : Pursuing M.Tech, CSE Branch, Dept of CSE
Assistant Professor, Department of Computer Science and Engineering
Professor & HOD, Department of computer science and engineering, G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.
Abstract :

af

Data distribution is not at all easier with the progress of cloud computing, and an exact examination on the shared data offers a collection of profits both to the the public and individuals. Data distribution with a huge number of applicants must get into account numerous issues, counting effectiveness, data integrity and confidentiality of data owner. Ring signature is a capable applicant to build an unsigned and genuine data sharing system. It lets a data owner to secretly authenticate his data which can be set into the cloud for storage or scrutiny purpose. so far the expensive certificate authentication in the conventional public key infrastructure (PKI) surroundings becomes a restricted access for this solution to be scalable. Identity-based (ID-based) ring signature, which eradicates the method of certificate verification, can be utilized instead. In this paper, we additionally improve the safety of ID-based ring signature by giving advance security: If a secret key of any user has been compromise, all earlier produced signatures that contain this user still remains legal. This property is particularly significant to any huge scale data distribution system, since it is unfeasible to request all data owners to re-authenticate their data still if a secret key of one single user has been compromised. We offer an actual and well-organized instantiation of our scheme, demonstrate its safety and supply an accomplishment to illustrate its realism.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


cloud computing, forward security, smart grid, data distribution, Authentication

C.Praveen Kumar,P Suman Prakash,Dr.S.Prem Kumar."Cost-Effective Authentic and Anonymous Data Sharing with Forward Security". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1126-1131, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1255.pdf,

[1] M. Abe, M. Ohkubo, and K. Suzuki, “1-out-ofn signatures from a variety of keys,” in Proc. 8th Int. Conf. Theory Appl. Cryptol. Inform. Security: Adv. Cryptol., 2002, vol. 2501, pp. 415–432. 
[2] R. Anderson, “Two remarks on public-key cryptology,” Manu-script, Sep. 2000. (Relevant material presented by the author in an invited lecture at the Fourth ACM Conference on Computer and Communications Security, 1997.)
 [3] G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik, “A practical and provably secure coalition-resistant group signature scheme,” in Proc. 20th Annu. Int. Cryptol. Conf. Adv. Cryptol., 2000, vol. 1880, pp. 255–270. 
[4] M. H. Au, J. K. Liu, T. H. Yuen, and D. S. Wong, “ID-based ring signature scheme secure in the standard model,” in Proc. 1st Int. Workshop Security Adv. Inform. Comput. Security, 2006, vol. 4266, pp. 1-16
 [5] A. K. Awasthi and S. Lal, “Id-based ring signature and proxy ring signature schemes from bilinear pairings,” CoRR, vol. abs/cs/ 0504097, 2005. 
[6] M. Bellare, D. Micciancio, and B. Warinschi, “Foundations of group signatures: Formal definitions, simplified requirements and a construction based on general assumptions,” in Proc. 22nd Int. Conf. Theory Appl. Cryptographic Techn., 2003, vol. 2656, pp 614– 629
 [7] M. Bellare and S. Miner, “A forward-secure digital signature scheme,” in Proc. 19th Annu. Int. Cryptol. Conf., 1999, vol. 1666, 
[8] J.-M. Bohli, N. Gruschka, M. Jensen, L. L. Iacono, and N. Marnau, “Security and privacy-enhancing multicloud architectures,” IEEE Trans. Dependable Sec. Comput., vol. 10, no. 4, pp. 212–224, Jul. \Aug. 2013. 
[9] A. Boldyreva, “Efficient threshold signature, multisignature and blind signature schemes based on the gap Diffie-Hellman group signature scheme,” in Proc. 6th Int. Workshop Theory Practice PublicKey Cryptography: Public Key Cryptography, 2003, vol. 567, pp. 31–46. 
[10] D. Boneh, X. Boyen, and H. Shacham, “Short group signatures,” in Proc. Annu. Int. Cryptol. Conf. Adv. Cryptol., 2004, vol. 3152, pp. 41–55. 
[11] E. Bresson, J. Stern, and M. Szydlo, “Threshold ring signatures and applications to ad-hoc groups,” in Proc. 22nd Annu. Int. Cryp-tol. Conf. Adv. Cryptol., 2002, vol. 2442, pp. 465–480. [12] J. Camenisch, “Efficient and generalized group signatures,” in Proc. Int. Conf. Theory Appl. Cryptographic Techn., 1997, vol. 1233, pp. 465–479. 
[13] N. Chandran, J. Groth, and A. Sahai, “Ring signatures of sub-linear size without random oracles,” in Proc. 34th Int. Colloq. Automata, Lang. Programming, 2007, vol. 4596, pp. 423– 434. 
[14] K. Chard, K. Bubendorfer, S. Caton, and O. F. Rana, “Social cloud computing: A vision for socially motivated resource sharing,” IEEE Trans.Serv.Comput.,vol.5,no.4,pp.551– 563,FourthQuarter2012. 
[15] D. Chaum and E. van Heyst, “Group signatures,” in Proc. Work-shop Theory Appl. Cryptographic Techn., 1991, vol. 547, pp. 257– 265. 
[16] L. Chen, C. Kudla, and K. G. Paterson, “Concurrent signatures,” in Proc. Int. Conf. Theory Appl. Cryptographic Techn., 2004, vol. 3027, pp. 287–305. 
[17] H.-Y. Chien, “Highly efficient ID-based ring signature from pairings,” in Proc. IEEE AsiaPacific Serv. Comput. Conf., 2008, pp. 829–834. 
[18] S. S. Chow, R. W. Lui, L. C. Hui, and S. Yiu, “Identity based ring signature: Why, how and what next,” in Proc. 2nd Eur. Public Key Infrastructure Workshop, 2005, vol. 3545, pp. 144–161. 
[19] S. S. M. Chow, V.K.-W. Wei, J. K. Liu, and T. H. Yuen, “Ring sig-natures without random oracles,” in Proc. ACM Symp. Inform., Comput., Commun. Security, 2006, pp. 297– 302. 
[20] S. S. M. Chow, S.-M. Yiu, and L. C. K. Hui, “Efficient identity based ring signature,” in Proc. 3rd Int. Conf. Appl. Cryptography Netw. Security, 2005, vol. 3531, pp. 499–512. 
[21] R. Cramer, I. Damgard, and B. Schoenmakers, “Proofs of partial knowledge and simplified design of witness hiding protocols,” in Proc. 14th Annu. Int. Cryptol. Conf. Adv. Cryptol., 1994, vol. 839, pp. 174–187. 
[22] R. Cramer and V. Shoup, “Signature schemes based on the strong RSA assumption,” in Proc. ACM Conf. Comput. Commun. Security, 1999, pp. 46–51. 
[23] Y. Dodis, A. Kiayias, A. Nicolosi, and V. Shoup, “Anonymous identification in Ad Hoc groups,” in Proc. Int. Conf. Theory Appl. Cryptographic Techn., 2004, vol. 3027, pp. 609–626. 
[24] A. L. Ferrara, M. Green, S. Hohenberger, and M. Ø. Pedersen. (2009). Practical short signature batch verification,” in Proc. Cryptographers’ Track RSA Conf. Topics Cryptol., vol. 5473, pp. 309– 324 [Online]. Available: http://eprint.iacr.org/2008/015 
[25] J. Han, Q. Xu, and G. Chen, “Efficient IDbased threshold ring sig-nature scheme,” in Proc. IEEE/IFIP Int. Conf. Embedded Ubiquitous Comput., 2008, pp. 437–442.

Currently there are no Refbacks

Paper Title : A Dynamic Secure Group Sharing Framework in Public Cloud Computing
Authors : N.Mounika, N.Parushuram, R.Anil Kumar
Affiliations : Pursuing M.Tech, CSE Branch, Dept of CSE
Assistant Professor, Department of Computer Science and Engineering
Assistant Professor, Department of Computer Science and Engineering
G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.
Abstract :

af

Cloud computing is the extended vision of computing as a effectiveness, where data owners can remotely store their data. The essential service presents by the Cloud is Data Storage. On the other hand, it is a tricky task for sharing data in multi-owner manner anywhere group admin and all group members can store and alter data while protecting data and identity privacy from an untrusted cloud server, due to the frequent change of the membership. so secure multi-owner data sharing scheme for dynamic groups in the cloud computing have been projected which absorb addition of group signature and broadcast encryption techniques. However this system also recognized some boundaries in terms of competence and security. since multi-owner data storing and sharing in a dynamic surroundings dumps enormous amount of data files in the cloud, which leftovers in cloud for imprecise period of time. The confidential information stored may changed by service providers. To maintain cloud file’s security and privacy regular elimination of unwanted files is needed. To determine this drawback we propose new framework which is Reliable and Scalable Secure Method to Store and Share Secrete Data for groups in Cloud i.e MONA that remove unnecessary files automatically when the predefined time period for sharing specified by data owner has been run out which improve performance of the system in terms of security and efficiency. Also this method decreases the overhead at the time of upload and download file in the cloud. At last proposed method by name Multi Owner Data Sharing over Cloud (MODOC) declares required efficiency and most importantly security. We apply a working prototype of the MODOC method and assess its performance based on the time addicted during various operations the results give you an idea about that MODOC has the prospective to be effectively used for secure data sharing in the cloud.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Dynamic group, group signature, dynamic broadcast encryption, data sharing, privacy-preserving.

N.Mounika,N.Parushuram,R.Anil Kumar."A Dynamic Secure Group Sharing Framework in Public Cloud Computing". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1119-1125, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1254.pdf,

[1] Xuefeng Liu, Yuqing Zhang, Boyang Wang, and Jingbo Yan, “Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud”, IEEE Transactions On Parallel and Distributed Systems, Vol.24, No. 6, June 2013. 
[2] S. Yu, C. Wang, K. Ren, and W. Lou, “Achieving Secure, Scalable, and Fine-Grained Data Access Control in Cloud Computing,” Proc. IEEE INFOCOM, pp. 534-542, 2010.
 [3] R. Lu, X. Lin, X. Liang, and X. Shen, “Secure Provenance: The Essential of Bread and Butter of /Data Forensics in Cloud Computing,” Proc. ACM Symp. Information, Computer and Comm. Security, pp. 282-292, 2010. 
[4] Yong CHENG, Jun MA and Zhi-ying “Efficient revocation in cipertext-policy attribute-based encryption based cryptographic cloud storage” Zhejiang University and Springer-Verlag Berlin 2011 
[5] M. Armbrust, A. Fox, R. Griffith, A.D. Joseph, R.H. Katz, A. Konwinski, G. Lee, D.A. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, “A View of Cloud Computing,” Comm. ACM, vol. 53,no. 4, pp. 50-58, Apr. 2010. 
[6] B. Wang, B. Li, and H. Li, “Knox: PrivacyPreserving Auditing for Shared Data with Large Groups in the Cloud,” Proc. 10th Int’l Conf. Applied Cryptography and Network Security, pp. 507-525, 2012. 
[7] C. Delerablee, P. Paillier, and D. Pointcheval, “Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys,” Proc. First Int’l Conf. PairingBased Cryptography, pp. 39-59, 2007. 
[8] B. Waters, “Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization,” Proc. Int’l Conf. Practice and 
[9] Theory in Public Key Cryptography Conf. Public Key Cryptography, http://eprint.iacr.org/2008/290.pdf, 2008.
[10]D. Boneh, X. Boyen, and H. Shacham, Short Group Signature, Proc. Intl Cryptology Conf. Advances in Cryptology (CRYPTO), pp. 41-55, 2004. 
[11]V. Goyal, O. Pandey, A. Sahai, and B. Waters, Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data, Proc. ACM Conf. Computer and Comm. Security (CCS), pp. 89-98, 2006.

Currently there are no Refbacks

Paper Title : A Secure Anti-Collusion Data Sharing Scheme for Dynamic Groups in the Cloud
Authors : G.Mercy Vimala, R.Vara Prasad, P.Rama Rao
Affiliations : Pursuing M.Tech, CSE Branch, Dept of CSE<
Assistant Professor, Department of Computer Science and Engineering
Assistant Professor, Department of Computer Science and Engineering
G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.
Abstract :

af

The Benefited from Cloud Computing, clients can achieve a flourishing and moderate methodology for information sharing among gathering individuals in the cloud with the characters of low upkeep and little administration cost. Then, security certifications to the sharing information records will be given since they are outsourced. Horribly, due to the never-ending change of the enrolment, sharing information while giving protection saving is still a testing issue, particularly for an untrusted cloud because of the agreement attack. In addition, for existing plans, the security of key dispersion depends on the safe communication channel, then again, to have such channel is a solid feeling and is difficult for practice. In this paper, we propose a safe information sharing plan for element individuals. Firstly, we propose a safe route for key dispersion with no safe correspondence channels, and the clients can safely acquire their private keys from gathering administrator. Besides, the plan can accomplish fine-grained access control, any client in the gathering can utilize the source in the cloud and refused clients can't get to the cloud again after they are rejected. Thirdly, we can protect the plan from trickery attack, which implies that rejected clients can't get the first information record regardless of the possibility that they scheme with the untrusted cloud. In this methodology, by utilizing polynomial capacity, we can achieve a protected client denial plan. At long last, our plan can bring about fine productivity, which implies past clients need not to overhaul their private keys for the circumstance either another client joins in the gathering or a client is give up from the gathering.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Access control, Privacy-preserving, Key distribution, Cloud computing

G.Mercy Vimala,R.Vara Prasad,P.Rama Rao."A Secure Anti-Collusion Data Sharing Scheme for Dynamic Groups in the Cloud". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1113-1118, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1253.pdf,

[1] M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, and M. Zaharia. “A View of Cloud omputing,” Comm. ACM, vol. 53, no. 4, pp. 50-58, Apr.2010. 
[2] S. Kamara and K. Lauter, “Cryptographic Cloud Storage,” Proc. Int’l Conf.Financial Cryptography and Data Security (FC), pp.136- 149, Jan. 2010. 
[3] M. Kallahalla, E. Riedel, R. Swaminathan, Q. Wang, and K. Fu, “Plutus: ScalableSecure File Sharing on Untrusted Storage,” Proc. USENIX Conf. File and Storage Technologies, pp. 29-42, 2003. 
[4] E. Goh, H. Shacham, N. Modadugu, and D. Boneh, “Sirius: Securing Remote Untrusted Storage,” Proc. Network and Distributed Systems Security Symp. (NDSS), pp. 131-145, 2003. 
[5] G. Ateniese, K. Fu, M. Green, and S. Hohenberger, “Improved Proxy Re-Encryption Schemes with Applications to Secure Distributed Storage,” Proc.Network and Distributed Systems Security Symp. (NDSS), pp. 29-43, 2005. 
[6] Shucheng Yu, Cong Wang, Kui Ren, and Weijing Lou, “Achieving Secure, Scalable, and Fine-grained Data Access Control in Cloud Computing,” Proc. ACM Symp. Information, Computer and Comm. Security, pp. 282-292, 2010. 
[7] V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data,” Proc. ACM Conf. Computer and Comm. Security (CCS), pp. 89- 98, 2006 
[8] R. Lu, X. Lin, X. Liang, and X. Shen, “Secure Provenance: The Essential of Bread and Butter of Data Forensics in Cloud Computing,” Proc. ACM Symp. Information, Computer and Comm. Security, pp. 282-292, 2010.
[9] B. Waters, “Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization,” Proc. Int’l Conf.http://eprint.iacr.org/2008/290.pdf, 2008 
[10] Xuefeng Liu, Yuqing Zhang, Boyang Wang, and Jingbo Yang, “Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud,” IEEE Transactions on Parallel and Distributed Systems, vol. 24, no. 6, pp. 1182-1191, June 2013. 
[11]D. Boneh, X. Boyen, and E. Goh, “Hierarchical Identity Based Encryption with Constant Size Ciphertext,” Proc. Ann. Int’l Conf. Theory and Applications of Cryptographic Techniques (EUROCRYPT), pp. 440-456, 2005. 
[12] C. Delerablee, P. Paillier, and D. Pointcheval, “Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ci-phertexts or Decryption Keys,” Proc.First Int’l Conf. PairingBased Cryptography, pp. 39-59, 2007. 
[13] Zhongma Zhu, Zemin Jiang, Rui Jiang, “The Attack on Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud,” Proceedings of 2013 International Conference on Information Science and Cloud Computing (ISCC 2013 ), Guangzhou, Dec.7, 2013, pp. 185-189. 
[14] Lan Zhou, Vijay Varadharajan, and Michael Hitchens, “Achieving Secure Role-Based Access Control on Encrypted Data in Cloud Storage,” IEEE Transactions on Information Forensics and Security, vol. 8, no. 12, pp. 1947-1960, December 2013. 
[15] Xukai Zou, Yuan-shun Dai, and Elisa Bertino, “A practical and flexible key management mechanism for trusted collaborative computing,” INFOCOM 2008, pp. 1211-1219. 
[16] M. Nabeel, N. Shang, and E. Bertino, “Privacy preserving policy based content sharing in public clouds,” IEEE Trans. on Know. and Data Eng., vol. 25, no. 11, pp. 2602-2614, 2013. [17] Dolev, D., Yao A. C., "On the security of public key protocols", IEEE trans. on Information Theory, vol. IT-29, no. 2, pp. 198–208, 1983 [18] Boneh Dan, Franklin Matt, “Identitybased encryption from the weil pairing,” Lecture Notes in Computer Science, vol. 2139 LNCS, pp. 213-229, 2001

Currently there are no Refbacks

Paper Title : A Survey on Dynamic Resource Allocation for Efficient Parallel Data Processing
Authors : B. Praveen Kumar, Santhosh Kumar,
Affiliations : M.Tech (CSE), Sreyas Institute of Engineering & Technology
Associate Professor Dept.of Computer Science & Engineering, Sreyas Institute of Engineering & Technology
Abstract :

af

As recently ad-hoc parallel information handling has developed to be one of the executioner applications for Infrastructure as a service (IaaS) cloud. Most of the Distributed computing organizations have begun to coordinate systems for parallel information making ready in their item portfolio, making it straightforward for clients to get to these Infrastructure and to convey their projects. The preparing constitution which are right now utilized have been intended for static, homogeneous group setups and slight the specific way of a cloud. Subsequently, the dispensed figure assets may be lacking for huge parts of the submitted work and superfluously increment handling time and cost. In this paper we discuss the challenges for proficient parallel information handling in cloud and introduce our exploration venture Nephele. Nephele is the first information preparing structure to expressly neglect the dynamic quality portion offered by today's IaaS mists for each, trip booking and execution. In this paper we talk about the open doors and challenges for effective parallel information preparing Specific errands of a handling occupation can be doled out to distinctive sorts of virtual machines which are consequently instantiated and ended amid the employment execution. In view of this new structure, we perform amplified assessments of Map Reduce-roused preparing occupations on an IaaS cloud framework and contrast the outcomes with the mainstream information handling system Hadoop.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Numerous Assignment Processing, High-Throughput Registering, Approximately Coupled Applications, Distributed computing.

B. Praveen Kumar,Santhosh Kumar."A Survey on Dynamic Resource Allocation for Efficient Parallel Data Processing". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1106-1112, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1252.pdf,

[1] Amazon Web Services LLC. Amazon Elastic Compute Cloud (Amazon EC2). http://aws.amazon.com/ec2/, 2009. 
[2] Amazon Web Services LLC. Amazon Elastic MapReduce. http://aws.amazon.com/elasticmapreduce/ , 2009. 
[3] AmazonWeb Services LLC. Amazon Simple Storage Service. http://aws.amazon.com/s3/ , 2009. 
[4] M. Coates, R. Castro, R. Nowak, M. Gadhiok, R. King, and Y. Tsang. Maximum Likelihood Network Topology Identification from Edge-Based Unicast Measurements. SIGMETRICS Perform. Eval. Rev., 30(1):11–20, 2002. 
[5] R. Davoli. VDE: Virtual Distributed Ethernet. Testbeds and Research Infrastructures for the Development of Networks & Communities, International Conference on, 0:213–220, 2005. 
[6] J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. In OSDI’04: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation, pages 10–10, Berkeley, CA, USA, 2004. USENIX Association.
 [7] I. Raicu, I. Foster, and Y. Zhao. Many-Task Computing for Grids and Super computers. In ManyTask Computing on Grids and Supercomputers, 2008. MTAGS 2008. Workshop on, pages 1–11, Nov.2008. 
[8] M. Stillger, G. M. Lohman, V. Markl, and M.Kandil. LEO-DB2’s LEarning Optimizer. In VLDB ’01: Proceedings of the 27th International Conference on Very Large Data Bases, pages 19–28, San Francisco, CA, USA, 2001. Morgan Kaufmann Publishers Inc. 
[9] D. Warneke and O. Kao. Nephele: Efficient Parallel Data Processing in the Cloud. In MTAGS ’09: Proceedings of the 2nd Workshop on Many-Task Computing on Grids and Supercomputers, pages 1– 10, New York, NY, USA, 2009. ACM. 
[10] T. White. Hadoop: The Definitive Guide. O’Reilly Media, 2009.


Currently there are no Refbacks

Paper Title : Avoid Link Failure Using Novel Re-routing Method
Authors : Batsala Balaraju, Sahukaru Jayavardhana Rao,
Affiliations : M.Tech (CSE), Sri Vaishnavi College of Engineering at Srikakulam
Assistant Professor, Department of Computer Science & Engineering, Sri Vaishnavi College of engineering at srikakulam
Abstract :

af

In this paper we present a method to find a path when a link is failure when the data is transmitted for source node to destination node when a link Is failure before entering to the gate way protocol and to recover the response of failure the target application Is tested on small network up to tens of nodes for regional access of the service providers network which is one of the most challenging Task We provide and effective method to find the existing path for the Set of nodes to send the data when the link is failure.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED



Batsala Balaraju,Sahukaru Jayavardhana Rao."Avoid Link Failure Using Novel Re-routing Method". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1100-1105 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1251.pdf,

[1] C. Boutremans and G. Iannaccone and C. Diot, Impact of link failures on VoIP performance, NOSSDAV, 2002. 
[2] J. Moy, OSPF Version 2, RFC 2328, Apr. 1998. 
[3] D. Oran, OSI IS-IS Intra-domain Routing Protocol, RFC 1142, Feb. 1990. 
[4] A. Markopoulou, G. Iannaccone, S. Bhattacharyya, C. Chuah, C. Diot, Characterization of Link Failures in an IP Backbone, INFOCOM 2004.
[5] N. Dubois, B. Fondeviole, N. Michel, Fast convergence project, RIPE-47 presentation, Jan. 2004. 
[6] P. Pan, G. Swallow, A. Atlas, Fast Reroute Extensions to RSVP-TE for LSP Tunnels, Internet Draft, Feb. 2004. 
[7] S. Nelakuditi, S. Lee, Y. Yu, Z.-L. Zhang, Failure Insensitive Routing for Ensuring Service Availability, IWQoS 2003. 
[8] P. Narvaez,´ K.-Y. Siu, and H.-Y. Tzeng, Local Restoration Algorithm for Link-State Routing Protocols, ICCCN 1999. 
[9] A. Medina, A. Lakhina, I. Matta, and J. Byers, BRITE: An Approach to Universal Topology Generation, In Proceedings of MASCOTS 2001, Aug. 2001. 
[10] Y. Liu, A. L. Narasimha Reddy, A Fast Rerouting Scheme for OSPF/IS-IS Networks, technical report available at http://ece.tamu.edu/techpubs, Dept. of Electrical Engineer-ing, Texas A&M University, 2004


Currently there are no Refbacks

Paper Title : RFID BASED SHOPPING TROLLEY
Authors : Mrs.Lekshmy S, Ms.Aniltta T C, Ms.Nivya Shaji
Affiliations : Department of ECE, Vimal Jyothi Engineering College, Chemperi, Kannur
Abstract :

af

While purchasing in super market we can gather items we want, put it in the container and at the time of billing only we come to know about the total cost. Also we need to stand in a queue for billing those items. To overcome this here we can design a RFID Based Trolley to make the purchase more easily and comfortable. An RFID Reader with electronics hardware system in fitted with the trolley to make the purchase comfortable. All the items are fitted with an RFID card whose price is fixed into the card. When an item is shown in front of the reader (fitted in the trolley) the amount for the item is added to the purchase bill and is shown on the LCD Display. It also has the provision for removing the items from the trolley where the cost is removed from the total cost. We can set a limit value for the purchase amount in the microcontroller, once the items are added the cost is added up and if it crosses certain limit it gives an alarm signal to indicate that. Along with this a search mode is also provided to the customer. By selecting search mode, customer can easily find out a product that the customer wants to search in the super market. MCU send data through RF module to the receiver side in the search mode if the particular product is selected using key pad. Send data is corresponds to product details that the customer wants to search in the super market. On receiver side, LED indication for corresponding data/product received will switch ON. Audio indication is also provided by MCU. 2.4 GHz open band wireless transceiver modules are used on receiver and transmitter which have range of 30m.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED



Mrs.Lekshmy S,Ms.Aniltta T C,Ms.Nivya Shaji."RFID BASED SHOPPING TROLLEY". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1096-1099, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1250.pdf,

1.2013 IEEE International Conference On RFID
Technologies.
2.IEEE RFID-TA 2015.
3.Programming a PIC Microcontroller.

Currently there are no Refbacks

Paper Title : SELF BALANCING ROBOT
Authors : Mrs.LEKSHMY.S, ALEESHA GEORGE, ATHIRA C.V
Affiliations : Department of ECE, Vimal Jyothi Engineering College, Chemperi, Kannur
Abstract :

af

-In this paper, we presented the Balance model as a two wheeled self balancing robot that is capable of adjusting itself with respect to changes in weight and position. We developed the Balance System from a single gyroscope and a single accelerometer. The stability of the system is to show the capabilities of the ATmega328P in doing PID loops even with limited accuracy in position readings. PID control system is designed to monitor the motors so as to keep the system in equilibrium. It should be easily reproducible given the right parts and code
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Self balancing robot, Accelerometer, Gyroscope, Kalman filter, PID controller, feedback control

Mrs.LEKSHMY.S,ALEESHA GEORGE,ATHIRA C.V."SELF BALANCING ROBOT". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.6, Issue 12,pp.1091-1095 , December- 2015, URL :https2//ijcert.org/ems/ijcert_papers/V2I1249.pdf,

[1] Nawawi, S. W., Ahmad, M. N. and Osman, J. H. S (2008) "Real-Time Control of Two-Wheeled Inverted Pendulum Mobile Robot" World Academy of Science, Engineering and Technology 29, 214 - 220. 
[2] Lei Guo , Hong Wang , “PID controller design for output PDFs of stochastic systems using linear matrix inequalities”, IEEE Transactions on Systems, Man, and Cybernetics, Part B 01/2005; 35:65-71,pp.65-71. 
[3] K. Loffler, M. Gienger, F. Pfeiffer, and H. Ulbrich, “Sensors and control concept of a biped robot,” IEEE Trans. Ind. Electron., vol. 51, no.5, pp.972– 980. 
[4] R.S.Meena,Vikas Kumawat(2011) .Controller Design For Servo Motor Using MATLAB .In Proceeding of National Conferences on Advances & Research in Electrical System Technology ( AREST 2011). 
[5] Popescu, Cristina; Paraschiv, Nicolae; Cangea, Otilia.(2011) Comparison Between PID And Fuzzy Controllers Used In Mobile Robot Control annals of daaam & proceedings,jan2011, pp223. 
[6] A. Warnasch, and A. Killen, Low cost, high G, micro electro-mechanical systems (MEMS), inertial measurements unit (IMU) program, IEEE Position Location and Navigation Symposium, 2002, pp. 299- 305.
[7] Andrea Demetlika, Tomislav Tomašić, Mladen Crneković (2012),Self balancing Mobile Robot Tilter.FAMENA issue 3, volume 36. 
[8] Young Soo Suh.(2003) .Attitude Estimation Using Low Cost Accelerometer And Gyroscope Proceedings KORUS 2003. The 7th Korea-Russia International Symposium on Volume: 2, Page(s): 423 - 427. 
[9] D. Simon, Kalman Filtering With State Constraints: A Survey Of Linear And Nonlinear Algorithms, IET Proceediings in Control Theory & Applications,Volume 4, no. 8, pp. 1303-1318.

Currently there are no Refbacks

Paper Title : Android controlled Smart Car
Authors : Jayesh George M, Adithya Sreyaj P P, Daniel Joseph
Affiliations : Vimal Jyothi Engineering College, Chemperi Kannur
Abstract :

af

A car is usually an electro-mechanical machine that is guided by computer and electronic programming. The car which can be controlling using an APP for android mobile. We are developing the remote buttons in the android app by which we can control the car motion with them. Here we use Bluetooth communication to interface controller and android. Controller can be interfaced to the Bluetooth module though UART. According to commands received from android the robot motion can be controlled. The consistent output of a robotic system along with quality and repeatability are unmatched.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


PIC, Android application, Bluetooth module, Motor driver

Jayesh George M,Adithya Sreyaj P P,Daniel Joseph,Sajeer P."Android controlled Smart Car". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1087-1090, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1248.pdf,

1. [Android Developers Guide. Android Architecture.
[Online] 2013. URL:
http://.android.com/about/versions/index.html.
2. Heidi Monson (1999) Bluetooth technology and
implementations, John Wiley & Sons.
3. Piyare, R. and Tazil, M. (2011) “Bluetooth based
home automation system using Android phones”.
IEEE 15TH International symposium on consumer
electronics (ISCE), 14-17 June 2011, Singapore.
4. Potts, J. and Sukittanon, S. (2012) “Exploiting
bluetooth on android mobile mobile devices for
home security application”, proceedings of
southeastcan, 15-18 March 2012, Orlando, Florida,
USA.

Currently there are no Refbacks

Paper Title : Solar Power Smart Waste Bin
Authors : Mr. Jobin francis, Mr. Melbin TL, Mr. Praveen CN
Affiliations : Vimal Jyothi Engineering College, Chemperi Kannur
Abstract :

af

India government recently introduced a new campaign named “SWACH BHARATH” that is aiming to make our country clean and tidy. That is, now the condition of our country is very bad in the field of waste management. There are many waste bins in our cities and country sides. But the reality is nobody using it in an effective way. As we all saw that in cities and streets the waste bin is there and all the wastes are near its side. The reason for this is, if one person deposit the waste outside of it, the person next coming to their will automatically throws the waste outside of the basket. This will continues. Our intention is to approach this problem in a different manner. If the lid of the waste bin opens automatically, when a person approaches to the waste bin then the person automatically deposit the waste inside it. No one has a tendency to throw the garbage outside the basket. That is our project “SOLAR POWERED SMART WASTE BIN “which is aimed to make our cities and streets clean and tidy.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


solar powering, automatic, waste bin, ultra sonic

Mr. Jobin francis,Mr. Melbin TL,Mr. Praveen CN."Solar Power Smart Waste Bin". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1083-1086 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1247.pdf,

[1] http:// www.arduino.cc
[2] http://www.datasheetcatalog.com
[3] http://www.instructables.com
[4] http://www.wikipedia.com
[5] Electronic Circuit and Devices by J.B Gupta
[6] Von Meier, Alexandra (2006). Electric Power
Systems: A Conceptual Introduction. Wiley-IEEE

Currently there are no Refbacks

Paper Title : FPGA Based Efficient Implementation of Viterbi Decoder
Authors : BEERAM RAJ MOHAN REDDY, BELLAM VARALAKSHMI,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Assistant Professor, Dept. of ECE Priyadarshini Institute of Technology & Management
Abstract :

af

Convolutional encoding is a forward error correction technique that is used for correction of errors at the receiver end. The Viterbi algorithm, which is the most extensively employed decoding algorithm for convolutional codes. In this paper, we present a Spartan XC3S400A Field- Programmable Gate Array efficient implementation of Viterbi Decoder with a constraint length of 3 and a code rate of 1/3. The proposed architecture can be realized by an Adaptive Viterbi Decoder having constraint length, K of 3 and a code rate (k/n) of 1/2 using Verilog HDL. Simulation is done using Xilinx ISE 12.4i design software and it is targeted into Xilinx Virtex-5, XC5VLX110T FPGA. The parameters of Viterbi algorithm can be changed to suit a specific application. The high speed and small area are two important design parameters in today’s wireless technology. In this paper, a high speed feed forward viterbi decoder has been designed using track back architecture and embedded BRAM of target FPGA. It shows that the larger the constraint length used in a convolutional encoding process, the more powerful the code produced.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Convolutional encoding, Viterbi decoder, Path Metric, branch metric, FPGA, Xilinx, Modelsim.

BEERAM RAJ MOHAN REDDY,BELLAM VARALAKSHMI."FPGA Based Efficient Implementation of Viterbi Decoder". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1076-1082, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1246.pdf,

[1] Altera Corporation. Apex II data sheet, 2001.V http://www.altera.com. 
[2] Annapolis Microsystems, Inc. WILD-ONE Reference Manual, 1999. 
[3] W. Burleson, R. Tessier, D. Goeckel, S.Swaminathan, P. Jain, J. Euh, S. Venkatraman, and V. Thyagarajan. Dynamically Parameterized Algorithms and Architectures to Exploit Signal Variations for Improved Performance and Reduced Power. In IEEE Conference on Acoustics, Speech, and Signal Processing, May 2001. 
[4] F. Chan and D. Haccoun. Adaptive Viterbi Decoding of Convolutional Codes over Memoryless Channels IEEETransactions on Communications, 45(11):1389– 1400, Nov. 1997. 
[5] M. Kivioja, J. Isoaho, and L. Vanska. Design and Implementation of a Viterbi Decoder with FPGAs. Journal of VLSI Signal Processing, 21(1):5–14, May 1999. 
[6] C. F. Lin and J. B. Anderson. M-algorithm Decoding of Channel Convolutional Codes. In Proceedings, Princeton Conference of Information Science and Systems, pages 362–366, Princeton, NJ, Mar. 1986. 
[7] A. Michelson and A. Levesque. Error-control Techniques for Digital Communication. John Wiley and Sons, New York, NY,1985.
 [8] B. Pandita and S. K. Roy. Design and Implementation of a Viterbi Decoder Using FPGAs. In Proceedings, IEEE International Conference on VLSI Design, pages 611–614, Jan. 1999. 
[9] J. Proakis. Digital Communications. McGraw-Hill, New York, NY, 1995. 
[10] H. Schmit and D. Thomas. Hidden Markov Modelling and Fuzzy Controllers in FPGAs. In Proceedings, IEEE Workshop on FPGA-based Custom Computing Machines, pages 214–221,Napa, Ca, Apr. 1995. 
[11] S. J. Simmons. Breath-first Trellis Decoding with Adaptive Effort. IEEE Transactions on Communications, 38:3–12, Jan. 1990.
 [12] S. Swaminathan. An FPGA-based Adaptive Viterbi Decoder. Master’s thesis, University of Massachusetts, Amherst, Department of Electrical and Computer Engineering, 2001. 
[13] R. Tessier and W. Burleson. Reconfigurable Computing and Digital Signal Processing: A Survey. Journal of VLSI Signal Processing, 28(1):7–27, May 2001. 
[14] Texas Instruments, Inc. TMS320C6201 DSP Data Sheet, 2001.
[15] Xilinx Corporation. Virtex II data sheet, 2001. http://www.xilinx.com.

Currently there are no Refbacks

Paper Title : Design of an efficient aging aware reliable multiplier to reduce aging effects
Authors : BANDANADHAM BALA KRANTHI KUMAR, AL.SHABNA SAMANTHA TERA,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Associate Professor, Dept. of ECE Priyadarshini Institute of Technology & Management
Abstract :

af

Digital multipliers are among the most critical arithmetic functional units. The Meanwhile, the negative bias temperature instability effect occurs when a pMOS transistor is under negative bias increasing the threshold voltage of the pMOS transistor, and reducing multiplier speed.. There are three types of multipliers Vedic multiplier base on Vedic arithmetic using Urdhva-Tiryabhyam sutra are proved to be the most efficient in terms of lower power consumption. overall performance of these systems depends on the throughput of the multiplier .A similar phenomenon, positive bias temperature instability, occurs when an nMOS transistor is under positive bias. Both effects degrade transistor speed, and in the long term, the system may fail due to timing violations. Therefore, it is important to design reliable high-performance multipliers. A multiplier is one of the chief hardware blocks in most digital and high concert systems such as microprocessors, digital signal processors. The CNFET-based multipliers have higher speed, and low power dissipation and it nearly reduces 99% PDP (power-delay product) as compared to the MOSFET In this paper, we propose an agingaware multiplier design with a novel adaptive hold logic (AHL) circuit. The multiplier is able to provide higher throughput through the variable latency and can adjust the AHL circuit to mitigate performance degradation that is due to the aging effect. Moreover, the proposed architecture can be applied to a column- or row-bypassing multiplier. The experimental results show that our proposed architecture with 16 ×16 and 32 ×32 column-bypassing multipliers can attain up to 62.88% and 76.28% performance improvement, respectively, compared with 16×16 and 32×32 fixed-latency column-bypassing multipliers
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Adaptive Hold Logic(AHL), variable Latency, Reliable Multiplier, Positive Bias Temperature Instability(PBTI),Negative Bias Temperature Instability(PBTI)

BANDANADHAM BALA KRANTHI KUMAR,AL.SHABNA SAMANTHA TERA."Design of an efficient aging aware reliable multiplier to reduce aging effects". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1070-1075 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1245.pdf,

[1] Y. Cao. (2013). Predictive Technology Model (PTM) and NBTI Model 
[2] S. Zafar et al., “A comparative study of NBTI and PBTI (charge trapping) in SiO2/HfO2 stacks with FUSI, TiN, Re gates,” in Proc. IEEE Symp. VLSI Technol. Dig. Tech. Papers, 2006, pp. 23–25. 
[3] S. Zafar, A. Kumar, E. Gusev, and E. Cartier, “Threshold voltage instabilities in high-k gate dielectric stacks,” IEEE Trans. Device Mater. Rel., vol. 5, no. 1, pp. 45–64, Mar. 2005. 
[4] H.-I. Yang, S.-C.Yang, W. Hwang, and C.-T. Chuang, “Impacts of NBTI/PBTI on timing control circuits and degradation tolerant design in nanoscale CMOS SRAM,” IEEE Trans. Circuit Syst., vol. 58, no. 6, pp. 1239–1251, Jun. 2011. 
[5] R. Vattikonda, W. Wang, and Y. Cao, “Modeling and miimization of pMOS NBTI effect for robust naometer design,” in Proc. ACM/IEEE DAC, Jun. 2004, pp. 1047–1052. 
[6] H. Abrishami, S. Hatami, B. Amelifard, and M. Pedram, “NBTI-aware flip-flop characterization and design,” in Proc. 44th ACM GLSVLSI, 2008, pp. 29–34 
[7] S. V. Kumar, C. H. Kim, and S. S. Sapatnekar, “NBTI-aware synthesis of digital circuits,” in Proc. ACM/IEEE DAC, Jun.2007, pp. 370–375. 
[8] A. Calimera, E. Macii, and M. Poncino, “Design techniqures for NBTI-tolerant power-gating architecture,” IEEE Trans. Circuits Syst., Exp. Briefs, vol. 59, no. 4, pp. 249–253, Apr. 2012. 
[9] K.-C. Wu and D. Marculescu, “Joint logic restructuring and pin reorder-ing against NBTIinduced performance degradation,” in Proc. DATE, 2009, pp. 75–80. 
[10] Y. Lee and T. Kim, “A fine-grained technique of NBTI-aware voltage scaling and body biasing for standard cell based designs,” in Proc. ASP- DAC, 2011, pp. 603–608. 
[11]M. Basoglu, M. Orshansky, and M. Erez, “NBTIaware DVFS: A new approach to saving energy and increasing processor lifetime,” in Proc. ACM/IEEE ISLPED, Aug. 2010, pp. 253–258. 
[12] K.-C. Wu and D. Marculescu, “Aging-aware timing analysis and optimization considering path sensitization,” in Proc. DATE, 2011, pp. 1–6. 
[13] K. Du, P. Varman, and K. Mohanram, “High performance reliable variable latency carry select addition,” in Proc. DATE, 2012, pp. 1257–1262. 
[14] A. K. Verma, P. Brisk, and P. Ienne, “Variable latency speculative addition: A new paradigm for arithmetic circuit design,” in Proc. DATE, 2008, pp. 1250–1255. 
[15] D. Baneres, J. Cortadella, and M. Kishinevsky, “Variable-latency design by function speculation,” in Proc. DATE, 2009, pp. 1704–1709.

Currently there are no Refbacks

Paper Title : Design and implementation of high speed 8 bit Vedic multiplier on FPGA
Authors : ANNAM ARAVIND KUMAR, SK. MASTAN BASHA,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Assistant Professor, Dept. of ECE Priyadarshini Institute of Technology & Management
Abstract :

af

In high speed digital signal processing units arithmetic logic units, multiplier and accumulate units, the multipliers are use as the key block. A systems performance is generally determined by the speed of the multiplier since multiplier is one of the key hardware component in high performance systems such as FIR filters, digital signal processors and microprocessors etc. Vedic Mathematics is the ancient system of mathematics which has a unique technique of calculations based on 16 Sutras. With the increasing constraints on delay, more and more emphasis is being laid on design of faster multiplications. The Array multiplier, Vedic 4*4 multiplier and 8*8 multiplier are designed, then 16*16 multiplier. These adders are called compressors. Amongst these Vedic multipliers based on Vedic mathematics are presently under focus due to these being one of the fastest and low power multiplier. In this paper a 4 X 4 Vedic multiplier is designed using reversible logic gates which is efficient in terms of constant inputs, garbage outputs, quantum cost, area, speed and power. The design is simulated using Verilog. Compressor based Vedic Multipliers show considerable improvements in speed and area efficiency over the conventional ones.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Multiplier, Vedic multiplier, Reversible logic, garbage output, quantum cost.

ANNAM ARAVIND KUMAR,SK. MASTAN BASHA."Design and implementation of high speed 8 bit Vedic multiplier on FPGA". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1062-1069, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1244.pdf,

[1] Swami Bharati Krsna Tirtha, Vedic Mathematics. Delhi: Motilal Banarsidass publishers 1965 
[2] Rakshith Saligram and Rakshith T.R. "Design of Reversible Multipliers for linear filtering Applications in DSP" International Journal of VLSI Design and Communication systems, Dec-12 
[3] R. Landauer,"Irreversibility and Heat Generation in the Computational Process", IBM Journal of Research and Development, 5, pp.183-191, 1961. 
[4] C.H. Bennett, "Logical reversibility of Computation", IBM J. Research and Development, pp.525-532, November 1973. 
[5] R. Feynman, "Quantum Mechanical Computers," Optics News,Vol.1l, pp. 11-20, 1985. 
[6] H. Thapliyal and M.B. Srinivas, "Novel Reversible Multiplier Architecture Using Reversible TSG Gate", Proc. IEEE International Conference on Computer Systems and Applications, pp. 100-103, March 20 06. 
[7] Shams, M., M. Haghparast and K. Navi, Novel reversible multiplier circuit in nanotechnology. World Appl. Sci. J.,3(5): 806-810. 
[8] Somayeh Babazadeh and Majid Haghparast, "Design of a Nanometric Fault Tolerant Reversible Multiplier Circuit" Journal of Basic and Applied Scientific Research, 2012. 
[9] Thapliyal, H., M.B. Srinivas and H.R. Arabnia, 2005, A Reversible Version of 4x4 Bit Array Multiplier with Minimum Gates and Garbage Outputs, Int. Conf. Embedded System, Applications (ESA'05), Las Vegas, USA, pp: 106 114. 
[10] H. Thapliyal and M.B. Srinivas, "Reversible Multiplier Architecture Using TSG Gate", Proc. IEEE International Conference on Computer Systems and Applications, pp. 241- 244, March 20 07.
 [11] M. Haghparast et al. , "Design of a Novel Reversible Multiplier Circuit using HNG Gate in Nanotechnology," in World Applied Science Journal, Vol. 3, No. 6, pp. 974-978, 2008. 
[12] M. S. Islam et al. , "Realization of Reversible Multiplier Circuit," in Information Tech. 1, Vol. 8, No. 2, pp. 117-121, 2005. 
[13] K. Navi, M. Haghparast, S. JafaraliJassbi, O. Hashemipour, Design of a novel reversible multiplier circuit using HNG gate, World Sci. 1 3 (6). 
[14] M. Shams et al., "Novel Reversible Multiplier Circuits in Nanotechnology," in World Applied Science Journal, Vol. 3, No. 5, pp, pp. 806- 810, 2008. 
[15] M S Islam, M M Rahman, Z Begum and M Z Hafiz, 2009. Low Cost Quantum Realization of Reversible Multiplier Circuit. Information Technology Journal, vol. 8(2), pp. 208-213.

Currently there are no Refbacks

Paper Title : Geotechnical Strength of Randomly Oriented Fiber Reinforced Compacted Pond Ashes
Authors : V.ASRITH, G.VISWANATH,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Assistant Professor, Dept. of Civil Engineering Priyadharshini Institute of Tech & Science
Abstract :

af

Fly ash is generated in large quantities as a byproduct of burning coal. Thermal power plants are the major sources of ash generation. Fly ash is disposed in the form of slurry in the ash ponds within the plant area, called coal combustion residue or pond ash. When fly ash is mixed with water, afterwards it gets hardened and forms high strength and low permeability material. Fly ash produced thus possesses both ceramic and pozzolanic properties. The power requirements of the country are rapidly increasing in pace with in industrial developments. Nearly, 73% of India‟s total installed power generation capacity is thermal of which coal based generation are nearly 90% (by diesel, wind, gas and steam adding about 10%). The inherent strength of the compacted pond ash mass reduces considerably due to saturation. In this context to improve and retain the strength of compacted pond ash, cementing agents like cement or lime may be very much beneficial. The stress-strain behavior of compacted pond ash mass can be modified by inclusion of fibre reinforcements. Fibre reinforcements also improve the strength characteristics of the mass. This paper presents the details of the pond ashes, the experiments carried out to characterize them when mixed with fiber and the results and discussions.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Pond Ash, Polypropylene Fiber, Geotechnical Characterization, Physical Properties, Triaxial Tests.

V.ASRITH,G.VISWANATH."Geotechnical Strength of Randomly Oriented Fiber Reinforced Compacted Pond Ashes ". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1056-1061, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1243.pdf,

[1] Gray, D.H., “Role of woody vegetation in reinforcing soils and stabilizing slopes” Proc., Sym. On Soil Reinforcement and Stabilizing Techniques, Sydney, Australia, 253-306, 1970. 
[2] Wu, T.H. and Erb, R.T., “Study of soil-root interaction”, J. Geotech.Engg. ,Div., ASCE, 114(12), 1351-1375, 1988.
 [3] Brown, C.B., and Sheu, M.S., “Effect of deforestation on slopes”, J. Geotech.Engg., ASCE, 101,147- 165, 1975. 
[4] Gray, D.H., and Ohashi, H., “Mechanics of fiber reinforcing in sand”, J. Geotech.Engg.,Div., ASCE, 109(3), 335-353, 1983. 
[5] Nataraj, M.S., and McManis, K.L., “Strength and deformation properties of soils reinforced with fibrillated fibers”, Geosynthetics Int., 4 (1), 65-79, 1997. 
[6] Bauer, G.E., and Fatani, M.N., “Strength characteristics of sand reinforced with rigid and flexible elements”, Proc., IX Asian Regional Conf. on Soil Mechanics and Foundation Engg., Bangkok,1,471- 474, 1991. 
[7] Shewbridge, S.E., and Sitar, N., “Deformation characteristics of reinforced soil in direct shear”, J. Geotech.Engg.,Div., ASCE, 115 (8), 1134-1147, 1989. 
[8] Hoover, J.M., Moeller, D.T., Pitt, J.M., Smith, S.G., and Wainaina, N.W., “Performance of randomly oriented fiber reinforced roadway soils”, IOWA DOT Project-HR-211, Department of Transportation Highway Division, IOWA State University, U.S.A., 1982. 
[9] Setty, K.R.N.S., and Rao, S.V.G., “Characteristics of fiber reinforced lateritic soils”, Indian Geotech. Conf., Banglore, India,1, 329-333, 1987.
[10] Gray, D.H., and Maher, M.H., “Admixture stabilization of sand with discrete randomly distributed fibers”, Proc., XII Intl. Conf. on Soil Mechanics and Foundation Engg., Rio-de-Janeiro, Brazil, 2,1363-1366, 1989. 
[11] Maher, M.H., and Gray, D.H., “Static Response of sands reinforced with randomly distributed fibers”, J. Geotech. Engg.,Div., ASCE, 116 (11), 1661- 1677, 1990. 
[12] Maher, M.H., and Ho, Y.C., “Mechanical properties of kaolinite/fiber soil composite’, J. Geotech. Engg.,Div., ASCE, 120 (8), 1381-1393, 1994. 
[13] Michalowski, R.L., and Zhao, A., “Failure of fiberreinforced granular soils”, J. Geotech.Engg.,Div., ASCE, 122 (3), 226-234, 1996
 [14] Consoli, N.C., Prietto, P.D.M., and Ulbrich, L.A., “Influence of fiber and cement addition on behaviorof sandy soil”, J. Geotech. And Geoenvir.Engg., ASCE, 124 (12), 1211-1214, 1998. 
[15] Santoni, R.L., and Webster, S.L., “Airfields and road construction using fiber stabilization of sands”, J. Transportation Engg., ASCE, 127 (2), 96- 104, 2001.

Currently there are no Refbacks

Paper Title : Strength and Durability Studies on Silica Fume in Slag Concrete
Authors : P.HARISH, J.SUPRIYA,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Associate Professor, Dept. of Civil Engineering Priyadharshini Institute of Tech & Science
Abstract :

af

Portland cement, as an ingredient in concrete, is one of the widely used construction materials, especially in developing countries. The CO2 emission during its production and the utilisation of natural resources are important issues for the construction industry to participate in sustainable development. These days the waste materials of industries is on its way to increase day by day due to strict environmental policies and this waste contains SCMs generally. They can be utilised not only to improve properties of concrete but also to prevent pollution due to reduction in carbon dioxide emission. Steel slag aggregate generally exhibit a propensity to expand because of the presence of free lime and magnesium oxides hence steel slag aggregates are not used in concrete making. Proper weathering treatment and use of pozzolanic materials like silica fume with steel slag is reported to reduce the expansion of the concrete. The effect of oxide composition of the binder material used, on the strength and durability properties of concrete is also investigated.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Fly Ash, Silica Fume, Strength, Durability, High-Volume Fly Ash Concrete, Oxide Composition.

P.HARISH,J.SUPRIYA."Strength and Durability Studies on Silica Fume in Slag Concrete". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp. 1050-1055 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1242.pdf,

[1] Dilip Kumar Singha Roy (August 2012) on „Effect of partial replacement of Cement by Silica Fumes on Hardened Concrete‟ (ISSN 2250-2459)
[2] Meena Murmu NIT Rourkela topic named as „Evaluation of Strength Characteristics of Steel Slag Hydrated Matrix‟ (2009) 
[3] Hisham Qasrawi, Faisal Shalabi, Ibrahim Asi (2007) named „Use of Steel Slag aggregate in asphalt concrete mix‟ (DOI 10.1139/107-025) 
[4] M. D. A. Thomas and M. H. Shehata on “Use of ternary cementitious systems containing silica fume and fly ash in concrete” (1999). 
[5] Lin D.F., Lin K.L., Chang W.C., Luo H.L and Cai M.Q. (2008) “Improvements of nano SiO2 on fly ash mortar”, Waste Management, 28(6), (1081-1087) 
*6+ Jan Bijen on (1996) on „Benefits of Steel Slag and Fly Ash‟ (DOI: 10.1016/0950-0618(95)00014-3). 
[7] S.A. Barbhuiya, M.I. Russeli, J.K. Gbagbo, and P.A.M. Basheer (2009) on „Properties of fly ash concrete modified with hydrated lime and silicafumes.. 
*8+ Y.L. Wong, L. Lam, and C.S. Poon (1988) on „Effect of fly ash and silica fume on compressive and fracture behaviour of concretes (271- 283) [9] Tahir Gonen and Salih Yazicioglu (Firat University 2009) on „The influence of mineral admixtures on the short and long term performances of concrete‟ (Elazig 23119). 
[10] Susan Bernal, Ruby De Gutierrez, Silvio Delvasto, Erich Rodriguez (2012) on „Slag Blends Using Alkaline Solutions Based on Chemically Modified Silica Fume and Rice Husk Ash‟ (pp 99-108) 
[11] Hisham Qasrawi, Faisal Shalabi, Ibrahim Asi (2010) „Use of steel slag to improve the engineering properties base-course materials‟ .
 [12] O. Boukendakdji, S. Kenai, E.H. Kadri, F. Rouis (2014) „Self- Compacting Concrete Incorporating Micro and Acrylic Polymer.
 [13] M. Maslehuddin, Alfarabi M. Sharif, M. Shameem, M. Ibrahim and M.S Barry (2004) on „Effect of silica fume on the mechanical properties of low quality coarse aggregate concrete‟ (891–900).
[14] Tahir Gonen and Salih Yazicioglu (2007) in „Effect of Micro and Nano Particles in Cement Mortar‟

Currently there are no Refbacks

Paper Title : Investigational Study on Bagasse Ash in Concrete by Partially Substitute with Cement
Authors : M.GANESH BABU, G.SHINY PRIYANKA,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Assistant Professor, Dept. of Civil Engineering Priyadharshini Institute of Tech & Science
Abstract :

af

The utilization of business and agricultural waste created by industrial processes has been the main focus of waste diminution analysis for economical, environmental, and technical reasons. Sugar-cane bagasse is a fibrous waste-product of the sugar refining industry, along with ethanol vapor. This waste product (Sugar-cane Bagasse ash) is already causing serious environmental pollution, which calls for urgent ways of handling the waste. Bagasse ash mainly contains aluminum ion and silica. In this paper, Bagasse ash has been chemically and physically characterized, and partially replaced in the ratio of 0%, 5%, 15% and 25% by weight of cement in concrete. Fresh concrete tests like compaction factor test and slump cone test were undertaken was well as hardened concrete tests like compressive strength, split tensile strength, flexural strength and modulus of elasticity at the age of seven and 28 days was obtained. The result shows that the strength of concrete increased as percentage of bagasse ash replacement increased.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Compressive Strength, Flexural Strength, Split Tensile Strength, Sugarcane Bagasse Ash

M.GANESH BABU,G.SHINY PRIYANKA."Investigational Study on Bagasse Ash in Concrete by Partially Substitute with Cement". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp. 1044-1048 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1241.pdf,

[1] Cordeiro G. C., Toledo filho R. D. And Fairbairn E. M. R. (2010), ultrafine sugar cane bagasse ash: high potential pozzolanic material for tropical countries Cinza ultrafine do bagaço de cana-deaçúcar: material pozolânico de alto potencial para países tropicais, Ibracon structures and materials journal, 3:50-67.
 [2] Prashant O Modania and Vyawaharebnology M. R. (2013), Utilization of Bagasse Ash as a Partial Replacement of Fine Aggregate in Concrete, 51: 25 – 29. 
[3] SivaKumar M. And Dr. Mahindra N. (April 2013), Experimental Studies of Strength and Cost Analysis of Concrete Using Bagasse Ash, International Journal of Engineering Research & Technology, 2(4):1-8. 
[4] Joshi, “Evolution of HPC mixes containing silica fumes,” The Indian concrete journal, vol. 75, no. 10, pp 627-633, 2001. 
[5] Rixom and M. Vaganam, Chemical admixtures for concrete, second edition, E& F.N spon, London, 1996. 
[6] Basu, “NPP Containment structures: Indian experience in silica fumes based HPC,” The Indian concrete journal, vol.75, no.10, pp. 656-664, October 2001.
 [7] A. Mittal and Basu, “Development of HPC for PC dome of NPP, kaiga,” The Indian Concrete Journal, vol. 73, no. 9, pp. 561-568, September 1999.
 [8] A. Mittal and Kamath, “Properties of HPC for PC dome of NPP, Kaiga,” The Indian Concrete Journal, vol. 73, no. 9, pp. 561-568, September 1999. 
[9] Chinnappa, “HPC,” proceedings of the advanced in concrete technology with emphasis on HPC, held at Pondicherry, pp. 185-194. 
[10] Rajamane, “HPC mix proportioning,” Advanced course on HP materials and methodologies for construction and rehabilitation of concrete structures, SERC, Chennai, 2000. 
[11] Jagadish, “HPC,” in Proceedings of national seminar on Waver of the future, civil engg in 21st century,15-16 june 2001, Assosciation of consulting civil engineers, (India), Banglore, pp. 72-90, 2001. 
[12] Shigihlli and M. Ath, “High strength concrete containing silica fume, national,” Seminar on Advances in concrete and concrete structures The Institution of Engineers, Belgaum, India, 2002. 
[13] Wang and Read, “Trials of grade 100 highstrength concrete,” Magazine of concrete research, vol. 51, no 6, pp. 409- 414, December 1999. 
[14] Basu, “High Performance Concrete: Mechanism and Application,” ICI Journal, April-June 2001, pp. 15- 26

Currently there are no Refbacks

Paper Title : Properties of Steel Fiber Reinforced Concrete Composites
Authors : K.SITA HEMANTH, J.SUPRIYA,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Associate Professor, Dept. of Civil Engineering Priyadharshini Institute of Tech & Science
Abstract :

af

Concrete is generally utilized Construction material as a part of the world. Fiber reinforced concrete (FRC) is a concrete in which little and spasmodic filaments are scattered consistently. The filaments utilized as a part of FRC may be of distinctive materials like steel, G.I., carbon, glass, asbestos, polypropylene, jute and so forth. Half and half fiber can give support at all the scope of strains. Mix of low and high modulus strands can capture splits at miniaturized scale level and in addition full scale level. Overcome disservice of lower workability brought about because of utilization of just higher rate of steel filaments. Potential point of interest in enhancing concrete properties and decreasing the general expense of concrete creation. FRC has discovered numerous applications in structural building field. In light of the research facility investigate fiber reinforced concrete (FRC), block and barrels examples have been planned with steel fiber reinforced concrete (SFRC) containing strands of 0% and 0.5% volume part of snare end Steel filaments of 53.85, 50 perspective proportion and soluble base safe glass strands containing 0% and 0.25% by weight of bond of 12mm cut length were utilized without admixture. The outcomes got demonstrate that the expansion of steel fiber enhances the modulus of flexibility of concrete. It was additionally examined that by expanding the fiber volume portion from 0.5% to 1.5% and viewpoint proportion of strands from 50 to 71 there was a sound impact on modulus of versatility of Steel Fiber Reinforced Concrete.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Compressive Strength, Fiber Reinforced Concrete, Glass Fibers, Split Tensile Strength.

K.SITA HEMANTH,J.SUPRIYA."Properties of Steel Fiber Reinforced Concrete Composites". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1039-1043 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1240.pdf,

[1]. Chen, S, 2004. “Strength of Steel Fibre Reinforced Concrete Ground Slabs”. Proceedings of the Institute of Civil Engineers, Structures and Buildings (157), Issue SB2, pp. 157-163 
[2]. Banthia,N,Chokri,K, and Trottier,JF,1995. Impact tests on Cement-Based Fiber Reinforced Composites. ACI Publications, Detroit, USA, SP, 155-9, pp.171-188 
[3]. Khaloo, A R and Kim, N, 1997. “Influence of Concrete and Fiber Characteristics on Behaviour of Steel Fiber Reinforced Concrete under Direct Shear”. ACI Materials Journal, 94, No. 4, pp. 592-601. 
[4]. Johnston, CD, and Zemp, WR, 1991. “Flexural Fatigue performance of Steel Fibre reinforced concrete- Influence of Fibre Content, Aspect Ratio, and Type”. ACI Material Journal, 88, No.4, pp. 374- 383. 
[5]. Elsaigh,WA and Kearsley,EP,2002.”Effect of Steel Fibre Content on Properties of Concrete”. Journal of Concrete/Beton, South Africa, No 102, pp. 8-12. 
[6]. Johnston Gopalaratnam, V.S. and S. Shah, 1987. “Failure mechanism and Fracture of fibre reinforced concrete, Fibre reinforced concrete – Properties and Application”, American Concrete Institute. 
[7]. A.M Shende et al.. “Comparative Study on Steel Fiber Reinforced cum Control Concrete” International Journal Of Advanced Engineering Sciences And Technologies Vol. No. 6, Issue No. 1, 116 – 120 
[8]. Mohammed Alias Yusof et al., “Mechanical Properties of Hybrid Steel Fibre Reinforced Concrete with Different Aspect Ratio.” Australian Journal of Basic and Applied Sciences, 2011 
[9]. Er Prashant Y.Pawade et al. “Effect of Steel Fibres on Modulus of Elasticity of Concrete” (IJAEST) International Journal Of Advanced Engineering Sciences And Technologies Vol No. 7, Issue No. 2, 169 – 177 
[10]. Osman Gencel et al.. “ Workability and Mechanical Performance of Steel Fiber-Reinforced Self-Compacting Concrete with Fly Ash” Composite Interfaces 18 (2011) 169–184 
[11]. Saravana Raja Mohan. K, Parthiban. K “Strength and behavior of Fly Ash based Steel Fibre Reinforced Concrete Composite. 
[12]. J. Mater. “Mechanical Properties of Steel Fiber Reinforced Concrete”, Journal of Materials in Civil Engineering ,Volume 19 , Issue 5, 2007 
[13]. IS: 383-1970, “Indian standards specification for coarse and fine aggregates from natural sources for concrete”, Bureau of Indian Standards, New Delhi
[14]. BS 1881: Part 121:1983,” Testing concrete Method for determination of static modulus of elasticity in compression”.
 [15]. ASTM C 469-94” Standard Test Method for Static Modulus of Elasticity and Poisson’s Ratio of Concrete in Compression”

Currently there are no Refbacks

Paper Title : The Effect of Addition of Limestone powder and Granulated Blast Slag in Concrete
Authors : K.SAHITHI, G.SHINY PRIYANKA,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Assistant Professor, Dept. of Civil Engineering Priyadharshini Institute of Tech & Science
Abstract :

af

The comprehensive programme is taken up to study this ground granulated blast furnace aggregate used as a course aggregate in pavement concrete. In this, replacing the coarse aggregate to ground granulated blast furnace aggregate partially varying 0 to 50% and calculating maximum compressive strength and taking their corresponding Poisson's ratio and modulus of elasticity. Flexural strength of concrete mix decrease with increase in percentage (%) of GGBFS at the age of 7 and 28 days as compared to mix but it was nearly equal with increase in the percentage of GGBFS at the age of 56 days. The Spilt tensile strength of mix with different cement replacement 10%, 20%, 30%, 40%, showed in decrease for all replacement at 7 days and 28 days as compared to control mix due to slower rate of reaction. The Spilt tensile strength of the mix with 20%, 30% cement replacement better performed than control mix at 56 days. The results obtained from the study shows that the percentage (%) of GGBFS (10-40%) in concrete increased the Sulfate and Chloride resistance.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Concrete, Replacement, Blast furnace slag, Limestone Powder, Workability, Compressive strength, Flexure strength, Tensile strength, Durability.

K.SAHITHI,G.SHINY PRIYANKA."The Effect of Addition of Limestone powder and Granulated Blast Slag in Concrete". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 15,pp.1032-1038, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1239.pdf,

[1] Latha K.S, Rao M.V.S, and Reddy V. S. “Estimation of GGBS and HVFA strength efficiencies in concrete with age”, International Journal of Engineering and Advanced Technology (IJEAT) ISSN: 2249 – 8958, Vol. 2, Issue 2, December (2012). 
[2] Dubey A, Chandak R, and Yadav R.K. “Effect of blast furnace slag powder on compressive strength of concrete”, International Journal of Scientific & Engineering Research. ISSN 2229-5518, Vol. 3, Issue 8, August (2012) 
[3] Pathan V.G, Ghutke V.S, and Pathan G. “Evaluation of concrete properties using ground granulated blast furnace slag”, International Journal of Innovative Research in Science, Engineering and Technology Vol. 1, Issue 1, November (2012)
 [4] Gudissa W, and Dinku A. “The use of limestone powder as an alternative cement replacement material: An experimental study”, Journal of EEA. Vol. 27, (2010) 
[5] Allahverdi A, and Salem S, “ Simultaneous influences of micro silica and Limestone powder on properties of Portland cement paste”, Ceramics – Silikáty 54 (1) 65-71 (2010) 
[6] Ahmed A.H.H, Abdurrahman R.B, and Mohammed Z.A, “Influence of Limestone Powder as Partial Replacement of Cement on Concrete and the Effect of High Temperature on It”, Received 13/5/2009 and Accepted 10/12/2009 
[7] IS: 8112-1989 Specification for coarse and fine aggregate from natural sources of concrete 
[8] IS: 456-2000 Plain and reinforced concrete - Code of practice 
[9] IS: 9013-1999 Specification for admixtures for concrete (FirstRevision). 
[10] IS: 10262-2009 Concrete mix proportioningguidelines (FirstRevision). 
[11]. V. Assaad Abdelmseeh, J.C. Jofriet, S.C. Negi and G. Hayward (2005). “Sulphide, Sulphate and Sulphuric Acid Corrosion of Concrete in Laboratory Tests”, School of Engineering University of Guelph, Guelph. on Canada. 
[12]. BIS 10262, Recommended Guidelines for Concrete Mix design, Bureau of Indian Standards, New Delhi, 1982. 
[13]. BIS 383, Specification for Coarse aggregate and Fine aggregate from Natural Sources for Concrete, Bureau of Indian Standards, New Delhi, 1970. 
[14]. BIS 456, Indian Standard Code of Practice for Plain and Reinforced Concrete, Bureau of Indian Standard, New Delhi, 2000. 
[15]. BIS 5816, Splitting Tensile Strength of Concrete Method of Test, Bureau of Indian Standards, New Delhi, 1999.

Currently there are no Refbacks

Paper Title : Study and Analysis of Flexible Pavement by Nonlinear Finite Element Method
Authors : K.RAJESH, G.VISWANADH,
Affiliations : ((M.Tech) Structural Engineering, Dept. of Civil Engineering
Assistant Professor, Dept. of Civil Engineering Priyadharshini Institute of Tech & Science
Abstract :

af

Need for better road transportation facility is increasing day-by-day and in order to fulfill the need researches are carried out from a long period. Construction of a road becomes simple only after the design of a pavement is complete, today engineers are facing challenges in designing pavements that can serve a long duration without premature failures. Pavement design is one of the most important aspects of any transportation project. Poor and inadequate design may result to reduce the life of flexible pavement and increase the annual maintenance cost. It becomes the prime importance to design a durable and economic pavement structure. A durable structure can be designed only after proper analysis. Multilayered analysis is widely used but it assumes the pavement material to behave linearly which in practice is not true hence analysis of materials with nonlinear behavior is required. To obtain accurate response it is essential to analyse the pavement structure considering responses from each and every particle which is a tedious process with multilayered program, to make obtain accurate responses a powerful method like finite element method is used. In the present work an attempt has been made to study and analyse a pavement structure using a finite element based software tool and compare the results with that of a multilayer based program. Overall response helps in identifying the pavement parameters which has major impact on the performance of the pavement structure, by this it will be possible to design a pavement with long durability and high performance.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Flexible Pavement;Finite element method, Pavement responses; tensile strain, compressive strain, Kenlayer;Michigan flexible pavement design software (MFPDS) Linear; non-linear analysis; Multi-layer theory.

K.RAJESH,G.VISWANADH."Study and Analysis of Flexible Pavement by Nonlinear Finite Element Method". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1026-1031, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1238.pdf,

[1] Analysis and design of flexible pavements, Indian Road Congress, Code 37, 2001 
[2] Bruhaspathi, KVRDN and NarasingaRao, BND. 2012. ―Pavement Design of National Highway A Case Study on Reducing Pavement Thickness‖, International Journal of Engineering Research and Applications, Vol. 2, Issue 4, pp.1000-1003 
[3] Chandra, S. and Sikdar, P.K. 2000. ―Factors Affecting PCU in Mixed Traffic Situations in Urban Roads‖, Road Transport Research, Vol. 9, No. 3, Australian Road Research Board, pp. 40-50. 
[4] Highway Capacity Manual. 2000. Transportation Research Board, Special Report 209, fourth edition, Washington D.C. 
[5] Methods of Test for Soils: Part 9 - Determination of Dry Density-Moisture Content Relation by Constant Mass of Soil Method, Indian standard code 2720.8, 1983.
[6] Methods of Test for Soils: Part 16 – Laboratory Determination of CBR, Indian standard code 2720.16,1987. 
[7] A report on flexible pavement design, Public works department, Government of Kerala, 2012. 
[8] Rafiqul A. Tarefder, NayanSaha, Jerome W. Hall, and Percy, T. 2008. ―Evaluating weak subgrade for pavement design and performance prediction‖. Journal of Geo-Engineering, Vol. 3, No. 1. 
[9] Sarna, A.C., Jain, P.K. and Chandra, G. 1989. ―Capacity of Urban Roads - A Case Study of Delhi and Bombay‖. Highway Research Bulletin, No. 4, Indian Roads Congress, New Delhi. 
[10] Saurabh Jain, Joshi, Y.P. and Goliya, S. S. 2013. ―Design of Rigid and Flexible Pavements by Various Methods & Their Cost Analysis of Each Method‖. Int. Journal of Engineering Research and Applications, Vol. 3, Issue 5. 
[11] Yagar, S. and Aerde, M.V. 1983. ―Geometric and Environmental Effects on Speeds of 2-Lane Highways‖, Transportation Research-A, Vol. 17A, No. 4, pp. 315-325. 
[12]. Das, A. (2007) Pavement Design with Central Plant Hot-Mix Recycled Asphalt Mixes, Construction and Building Materials, Vol.21, No.5, pp.928-936. 
[13]. Das, A.(2008) Reliability Considerations of Bituminous Pavement Design by MechanisticEmpirical Approach, the International Journal of Pavement Engineering, Vol.9, No.1, pp. 19-31. 
[14]. Dilip, D., Ravi, P. and Babu,G. (2013) System Reliability Analysis of Flexible Pavements, Journal Transportation Engineering, Vol.139, No.10, pp. 1001- 1009. 
[15]. Hadi, M.N.S. and Bodhinayake, B.C. (2003) Nonlinear Finite Element Analysis of Flexible Pavements, Advances in Engineering Software, Vol.34, No.11-12, pp. 657-662

Currently there are no Refbacks

Paper Title : Design and Construction of Driven Timber Piles and Foundations
Authors : K U M RAO, J.SUPRIYA,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Associate Professor, Dept. of Civil Engineering Priyadharshini Institute of Tech & Science
Abstract :

af

Timber piles can also be driven for ground improvement, to densify loose granular soils. Although timber piles are rarely used on shore in the UK, in other countries notably the United States, Canada and Australia, they are used widely. For many structures, timber piles are a highly suitable choice of foundation, given appropriate ground conditions. They are economical, easy to transport, handle, cut to length and work with on site; and particularly suited for locations with access difficulties, or where excavations and the delivery of concrete would pose problems. Short, driven timber piles can be the solution for foundations in ground with a high water table, and where firm strata exists below surface material of loose sand, soft clays, or organic soils. In deep silt deposits, where the capacity of the pile is determined by shaft friction, timber piles are especially suitable being tapered and easy to splice. In Sweden and the Netherlands, timber piles are used below the water table, where they have proved practically invulnerable to decay, and extended to the surface using concrete sections. One of the suggested methods of reducing global warming has been to bury timber to create carbon dumps. Using timber for piled foundations would effectively achieve this.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Design, durability, Engineering News, Formula, environmental, factor of safety, timber piling.

K U M RAO,J.SUPRIYA."Design and Construction of Driven Timber Piles and Foundations". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.6, Issue 04,pp.1020-1025, April - 2019, URL :https://ijcert.org/ems/ijcert_papers/V2I1237.pdf,

1. GZA GeoEnvironmental, Inc. , Central Artery (I93)/Tunnel (I-90) Project, Geotechnical Data Report, South Bay Interchange, Design Sections D009B/D009C, Boston, MA. 
2. GZA GeoEnvironmental, Inc. Central Artery (I93)/Tunnel (I-90) Project, Geotechnical Data Report, South Bay Interchange, Design Section D009A, Boston, MA. 
3. Haley and Aldrich, Inc. Final Geotechnical Data Report, Central Artery(I-93)/Tunnel (I-90) Project, Design Sections D007C and D007D (C07D2), Boston, MA.
 4. Haley and Aldrich, Inc. Final Geotechnical Report, Central Artery (I-93)/Tunnel (I-90) Project, Design Section D008A, Boston, MA. 
5. Maguire Group, Inc., and Frederic R. Harris, Inc. Final Report on Soil Stabilization and Testing Program, Central Artery (I-93)/Tunnel (I-90) Project, D009A, Boston, MA. 
6. Maguire Group, Inc., and Frederic R. Harris, Inc. Supplemental Geotechnical Data Report, Central Artery (I-93)/Tunnel (I-90) Project, Design Section D009A, Boston, MA. 
7. Stone and Webster, Inc. (1996), Final Geotechnical Data Report, Central Artery (I-93)/Tunnel (I-90) Project, Design Section D019B, I-93 Viaducts and Ramps North of Charles River, Boston, MA. 
8. Barosh, P.J.; Kaye, C.A.; and Woodhouse, D. (1989), “Geology of the Boston Basin and Vicinity.” Civil Engineering Practice: Journal of the Boston Society of Civil Engineers, 4(1),39-52.
9. McGinn, A.J., and O’Rourke, T.D. (2003), Performance of Deep Mixing Methods at Fort Point Channel, Cornell University, Ithaca, NY. 
10. AASHTO (2002), Standard Specifications for Highway Bridges, Washington, DC.
11. FHWA (1998), Design and Construction of Driven Foundations, Report No. FHWA-HI-97- 013, Washington, DC.
 12. Massachusetts Highway Department (1996), Pile Layout Plan: I-90 Logan Airport Interchange Arrivals Road, Tunnel, Contract C07D2, Drawing No. S-1162. 
13. Geosciences Testing and Research, Inc. (1997), Letter to RDA Construction Regarding Dynamic Load Test Results, Arrivals Tunnel: Round 1, May 5, 1997. 
14. Massachusetts Highway Department (1995), Interoffice Memorandum to File Regarding Hilton Heave, June 5, 1995. 
15. Massachusetts Highway Department (1995), Interoffice Memorandum to Lauren Cragg Regarding Hilton Heave, June 28, 1995.

Currently there are no Refbacks

Paper Title : Hybrid Neural Network Model for Compressive Strength of Reinforced Concrete
Authors : CH.BHAGYA LAKSHMI, G.SHINY PRIYANKA,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Assistante Professor, Dept. of Civil Engineering Priyadharshini Institute of Tech & Science
Abstract :

af

This paper focuses on the procedure of statistical assessment of test results in reference to the strength development of self compacting concrete and normally compacting concrete. A self compacting concrete and a normally compacting concrete (NCC) with similar ultimate compressive strength were developed. The concrete cubes were tested at 7, 28, 60, 90, 120 and 150 days after normal water curing. For each case 10 samples were tested and the test results were recorded for each sample on as obtained basis. To predict strength characteristics four input parameters namely water cement ratio, aggregate cement ratio, percentage of fibers and aspect ratio were identified. The results of the present investigation indicate that Genetic Algorithm based Artificial Neural Network (GANN) has strong potential as a feasible tool for predicting strength characteristics of steel fibre reinforced concrete.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Genetic Algorithm , Back Propagation Network , Steel Fibre Reinforced Concrete , Neural Network .

CH.BHAGYA LAKSHMI,G.SHINY PRIYANKA."Hybrid Neural Network Model for Compressive Strength of Reinforced Concrete". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1014-1019, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1236.pdf,

[1] Milton, J. S. and Arnold, J. C, “Introduction to probability and statistics”, Principles and Applications for Engineering and the Computing Sciences, McGrawHill, New York, 816, 1995. 
[2] Subasi, S, “Prediction of mechanical properties of cement containing class C fly ash by using artificial neural network and regression technique”, Scientific Research and Essay, vol. 4, no.4, pp.289-297, 2009. 
[3] Phoon, K. K., Wee, T. H., and Loi, C.S, “Development of statistical quality assurance criterion for concrete using ultrasonic pulse velocity method”, ACI Materials Journal., vol. 96, no.5, pp.568-574, 1999. 
[4] Siddique, R., Aggarwal, P.and Aggarwal, Y, “Prediction of compressive strength of self compacting concrete containing bottom ash using artificial neural networks”, Advances in engineering soft ware., vol. 42, pp. 780-786, 2011. 
[5] Erdal, M, “Prediction of compressive strength of vacuum processed concretes using artificial neural network and regression techniques”, Scientific Research and Essay., vol. 4, no. 10, pp. 1057-1065, 2009. 
[6] Almeida Filho, F.M., Barragan, B.E. Casas, J.R., & Debs, A. L. H. C. EI, “Hardened properties of self compacting concrete-A statistical approach”, Construction of Building Materials., vol. 24, no. 9, pp.1608-1615, Sep 2010. 
[7] Khayat, K. H, “Workability, Testing, and Performance of self consolidating concrete”, ACI Materials Journal., vol. 96, no.3, pp.346-354, 1999.
[8] Ramadoss, P. and Nagamani, K, “Statistical methods of investigation on the compressive strength of high performance steel fiber reinforced concrete”, international journal of computers and concrete. vol. 9, no. 2, 2012. 
[9] Al-Manaseer, A., Nadeem, M.S, “Strength unit weight and elasticity of concrete cylinders for the Benicia Martinez Bridge”, Technical Report, Department of transportation, State of California, Performing organization Report No-SJSU ALM-116, March 2011. 
[10] Al Qadi, Arabi N.S., Nasharuddin Bin Mustapha, K., Al-Mattarneh, H., & Al-Kadi, Q. N. S, “Statistical models for hardened properties of self compacting concrete”, American J. of Engineering and Applied Sciences., vol. 2 no.4, pp. 764-770, 2009. 
[11] Yang, D., Sun, W., and Tan, Y., “Performance evaluation of binary blends of Portland cement and fly ash with complex admixture for durable concrete structures”, International journal of Computers and Concrete., vol. 2, no.5, 2005. 
[12] Amirjanov, A., and Soboleve, K, ”Optimal proportioning of concrete aggregates using a self adaptive genetic algorithm”, International journal of Computers and Concrete., vol.2 no. 5, 2005 
[13] Dayaratnam, P. Ranganathan, R, “Statistical analysis of strength of concrete”, Building and Environment., vol.11, no. 2, pp. 145-152, 1976. 
[14] Indelicato, F, “In-place compressive strength of concrete: statistical methods to evaluate experimental data”, Materials and Structures. vol. 32, pp. 394-399, June 1999. 
[15] Williams,T. J., Nozick, L.K., Sansalone, M. J. and Poston, R. W, “Sampling techniques for evaluating large concrete structures: part 1”,ACI structural journal., vol.100, no.3, pp. 399-408, 2006.

Currently there are no Refbacks

Paper Title : Effect of Reinforcement Lap-Splices in SelfCompacting Concrete Beams
Authors : B.SRINIVASA RAO, J.SUPRIYA,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Associate Professor, Dept. of Civil Engineering Priyadharshini Institute of Tech & Science
Abstract :

af

The advancement of self-compacting concrete (SCC) was a noteworthy step towards adequacy at building sites, reasonably delivering pre-assembled concrete basics, enhanced working conditions and better quality and development of concrete structures. By expansion of filaments to SCC, bar fortification can be supplanted and the execution of concrete structures made strides. The variety of the bond quality along the streaming way for the diverse blends was assessed. The steel-concrete bond sufficiency was assessed in light of standardized bond quality. The outcomes demonstrated that the security quality was decreased because of Portland bond supplanting with dolomite powder. The expansion of either silica rage or fly fiery remains decidedly impeded further corruption as the dolomite powder content expanded. The SCC examples were cast without applying compaction, though the examples of ordinary concrete were cast by customary practice with generous compaction and vibration. The outcomes demonstrated that SCC examples created higher security to fortifying bars than ordinary concrete examples and the relationship between's security quality and compressive quality of NC is more predictable.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Self-compacting concrete, Bond strength, Lap splice, Full-scale beam, Positive bending.

B.SRINIVASA RAO,J.SUPRIYA."Effect of Reinforcement Lap-Splices in SelfCompacting Concrete Beams". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1008-1013, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1235.pdf,

[1] H. Okamura and M. Ouchi, “Self-Compacting Concrete,” Journal of Advanced Concrete Technology, JCI, vol. 1, issue 1, pp. 5-15, 2003. 
[2] K. Yoshitake, H. Orgura and A. Ogawa, “The effect of vertical and horizontal position of reinforcement for bond condition in beam-column joint,” Proceedings of 65th JSCE Annual Conference. 
[3] G. Russo and F. Romano, “Cracking response of RC members subjected to uniaxial tension,” Journal of Structural Engineering ASCE, vol. 118, No.5, pp. 1172- 1190, 1992. 
[4] B.M. Luccioni, D.E. Lopez and R.F. Danesi, “BondSlip in Reinforced Concrete Elements,” Journal of Structural Engineering ASCE, vol. 131, pp. 1690-1698, 2005. 
[5] J. Pedziwiatr, “Influence of Internal cracks on bond on cracked concrete structures,” Archives of Civil and Mechanical Engineering, vol. 8, pp. 91-105, 2008. 
[6] P.G. Gambarova and G. P. R.B. Zasso, “Steel-toConcrete bond after concrete splitting: tests results,” Materials and Structures, vol. 22, issue 1, pp. 35-47, 1989. 
[7] Y. Goto, “Cracks formed in concrete around tension bars,” American concrete Institute (ACI) Journal, vol. 68, issue 68, pp. 244-251, 1971. 
[8] A. Azizinamini, M. Chisala and S.K. Ghosh, “Tension development length of reinforcing bars embedded in high-strength concrete,” Enginering Structures, vol. 17, pp. 512-522, 1995. 
[9] W. Yeih, R. Huang, J.J. Chang, and C.C. Yang, “A pullout Test for Determining Interface properties between rebar and concrete,” Advanced Cement Based Materials, Elsevier, vol.5, pp. 57-65, 1997. 
[10] B.S. Hamad and M. Y. Mansour, “bond strength of non-contact tension lap splices,” American Concrete Institute (ACI) Journal, vol. 93, pp. 316-326, 1996. 
[11] K. Turk, A. Benli and Y. Calayir, “Bond strength of tension lap-splice in full scale self-compacting concrete beams,” Turkish J. Eng. Env. Sci., vol. 32, pp. 377-386, 2008. 
[12] S. J Chamberlin, “Spacing of spliced bars in beams,” American Concrete Institute (ACI) Journal, vol. 54, pp. 689-697, 1958. 
[13] S.J. Chamberlin, “Spacing of spliced bars in tension pullout,” American Concrete Institute (ACI) Journal, vol. 49, pp. 261-274, 1952. 
[14] K.H. Khayat, “Workability, Testing, and Performance of Self-Consolidating Concrete,” American Concrete Institute (ACI) Journal, vol. 96, issue 3, pp. 346-354, 1999. 
[15] R. Kumar, R. Kumar and N. Kumar, “In situ performance of Self-Compacting Concrete in TBeams,” Journal of Materials in Civil Engineering, ASCE, vol. 21, pp. 103-109, 2009.

Currently there are no Refbacks

Paper Title : Investigation on Bacterial Cement Composites
Authors : M.DINESH KUMAR, G.VISWANATH,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Assistant Professor, Dept. of Civil Engineering Priyadharshini Institute of Tech & Science
Abstract :

af

Concrete are the most important materials used in construction industries where the external forces more than the design loads mainly the lateral forces which leads to the deformation and produce cracks in the joints of the structural member. The usage of cement has been increased more over the world results in the air pollution which leads to the ozone depletion .To overcome these type of problem like crack formation and usage of cement content used for repair works can be reduced by using the self healing bacterial concrete. These are materials which heals the crack automatically when the cracks are formed. These self healing is achieved by means of using the Biological healing aspect by using the bacterial concrete. Bacteria are used during the mixing of concrete will cure the cracks the automatically by means of it screeds known as calcium carbonate precipitate. In these study horizontal forces are applied to the three storey single bay framed structure by means of using the hydraulic jack in which the cracks are formed in the framed structure mainly the cracks are formed in the Beam-Column Joints. The Cracks leads to the penetration of oxygen inside the reinforcement area will forms the Corrosion. To avoid the formation of corrosion the cracks bacterial concrete along with 60% of fly ash are used which results in self healing process. These self healing which cure and arrest the cracks in the structure which gives the environment free pollution and sustainable structure.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Bacterial concrete, Calcium carbonate, Epoxy resins, Self healing agent.

M.DINESH KUMAR,G.VISWANATH."Investigation on Bacterial Cement Composites". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.1002-1007 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1234.pdf,

[1]H.M.Jonkers, “Bacteria-Based Self Healing Concrete”,vol .56, 2011, pp.1-12. 
[2]Nithin Kumar , Ayona S Nair, Sreedevi V, “Study On Fracture Parameters Of Bacterial Concrete” ,pp. 6- 12. 
[3]Jagadeesha Kumar B, R Prabhakara, Pushpa H, “Bio Mineralisation Of Calcium Carbonate By Different Bacterial Strains And Their Application In Concrete Crack Remediation” ,vol. 6, 2013, pp. 202- 213. 
[4]Srinivasa Reddy. V, Achyutha Satya.K, Seshagiri Rao .M. V, Azmatunnisa. M, “A Biological Approach To Enhance Strength And Durability In Concrete Structures”, vol. 4, 2012 , pp. 392-399. 
[5]S. Maheswaran, S. S. Dasuru, A. Rama Chandra Murthy, B. Bhuvaneshwari, V. Ramesh Kumar, G. S. Palani1, Nagesh R. Iyer, Sarayu Krishnamoorthy and S. Sandhya, “Strength Improvement Studies Using New Type Wild Strain Bacillus Cereus On Cement Mortar”, vol. 106,2014. 
[6]Er. Satinder Kaur, “Bacterial Concrete- A Concrete Solution For Cracks -An Overview” ,vol. 1,2015. 
[7]Henk Jonkers, “Development And Application Of Bacteria-Based Self-Healing Materials”,2012. 
[8]M Dhaarani and K Prakash, “Durability Study On HVFA Based Bacterial Concrete—A Literature Study”, vol. 3,2014.
[9]Mohini P. Samudre , M. N. Mangulkar , S. D. Saptarshi, “A Review Of Emerging Way To Enhance The Durability And Strength Of Concrete Structures: Microbial Concrete”, vol .3,2014. 
[10]Mayur Shantilal Vekariya, Prof. Jayeshkumar Pitroda, “Bacterial Concrete: New Era For Construction Industry”,vol. 4,2013. 
[11]Jagadeesha Kumar B G, R Prabhakara, Pushpa H, “Effect Of Bacterial Calcite Precipitation On Compressive Strength Of Mortar Cubes”, vol .2,2013.
 [12]Abhijitsinh Parmar, Ankit Patel, Priyank Shah, “Improvement Of The Concrete Cracks By Using Bacillus Sphaericus”,2013. 
[13]Vijeth N Kashyap, Radhakrishna, “A Study On Effect Of Bacteria On Cement Composites”,2013. 
[14]Ravindranatha, N. Kannan, Likhit M.L , “SelfHealing Material Bacterial Concrete” ,vol .3,2014. 
[15]J.Karthik, P.Jagannathan, “Study Of Strength Parameter Of Concrete By Replacing Cement By Flyash Enriched With Microbial Agents”,vol.2,2015

Currently there are no Refbacks

Paper Title : Experimental Study on Bagasse Ash in Concrete by Partially Replacement with Cement
Authors : T.MALYADRI, J.SUPRIYA,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Associate Professor, Dept. of Civil Engineering Priyadarshini Institute of Technology & Management
Abstract :

af

The utilization of industrial and agricultural waste produced by industrial processes has been the focus of waste reduction research for economical, environmental, and technical reasons. Sugar-cane bagasse is a fibrous wasteproduct of the sugar refining industry, along with ethanol vapor. This waste product (Sugar-cane Bagasse ash) is already causing serious environmental pollution, which calls for urgent ways of handling the waste. Bagasse ash mainly contains aluminum ion and silica. In this paper, Bagasse ash has been chemically and physically characterized, and partially replaced in the ratio of 0%, 5%, 15% and 25% by weight of cement in concrete. Fresh concrete tests like compaction factor test and slump cone test were undertaken was well as hardened concrete tests like compressive strength, split tensile strength, flexural strength and modulus of elasticity at the age of seven and 28 days was obtained. The result shows that the strength of concrete increased as percentage of bagasse ash replacement increased.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


bagasse ash, concrete, Fibrous waste product.

T.MALYADRI,J.SUPRIYA."Experimental Study on Bagasse Ash in Concrete by Partially Replacement with Cement". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp. 995-1001 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1233.pdf,

[1] Ganesan, K., Rajagopal, K., &Thangavel K., 2007. “Evaluation of Bagasse Ash as Supplementary Cementitious Material”, Journal of Cement and Concrete Composites 
[2] R. Srinivasan, K Sathiya, 2010. “Experimental study on bagasse ash in concrete”, International Journal of Service Learning in Engineering 5(2), p. 60. 
[3] Payá,J.,et. al., 2002. Sugarcane bagasse ash (SCBA): “Studies on its properties for reusing in concrete production”, Journal of Chemical technology and Biotechnology 77, p.. 321. 
[4] N. B. Singh, V. D. Singh and SaritaRai, 2000. Hydration of Bagasse Ash-Blended Portland cement, Journal of Cement and Concrete Research 30, p. 1485. 
[5] SumrerngRukzon, PrinyaChindaprasirt, 2012. Utilization of Bagasse Ash in High Strength Concrete, Journal of Materials and Design 34, p. 45. 
[6] V. S. Aigbodion, S. B. Hassan, T. Ause and G.B. Nyior, 2010. Potential Utilization of Solid Waste (Bagasse Ash), Journal of Minerals & Materials Characterization & Engineering 9, p.67-77. 
[7] Ganesan, K., Rajagopal, K., &Thangavel, K. 2007. “Evaluation of bagasse ash as supplementary cementitious material”. Cement and Concrete Composites, 29, 515-524. 
[8] Committee Board of sugar cane and sugar (2004). Summary of sugar cane and sugar industry in Thailand in 2003/2004, Division of sugar cane and sugar industry Policy, Ministry of Industry, Vol.2 Bangkok Thailand (in Thai). 
[9] Baguant,K., Properties of concrete with bagasse ash as fine aggregate, In Proc 5th CANMET/ACI Intl. conf. on fly ash, silica fume, slag and natural pozzolans in concrete, Ed by Malhotra VM, USA, ACI SP, (1995)153(18), 315-337. 
[10] Payá,J.,et. al.,Sugarcane bagasse ash (SCBA): studies on its properties for reusing in concrete production, Journal of Chemical technology and Biotechnology, (2002)77, 321-325. 6. IS 383 -1970 “Specifications for Coarse and Fine Aggregates from Natural Sources for Concrete”, Bureau of Indian Standards, New Delhi.
 [11] IS 10262 -1981 “IS Method of Mix Design”, Bureau of Indian Standards, New Delhi 
[12] IS 516 -1959 “Methods of Tests for strength of concrete”, Bureau of Indian Standards, New Delhi
 [13] IS 456 -2000 “Code of Practice for Plain and Reinforced Concrete”, Bureau of Indian Standards, New Delhi. 
[14] Ali I (2004) Biomass: An ideal fuel for sugar mills for steam/power generation. Fuel Research Centre, PCSIR, Karachi, XVII(197), Dec 
[15] Wang R, Trettin V, Rudert R (2003) Umlauf recrystallization of granulated blast furnace slag and the significance for the hydraulicReactivity.

Currently there are no Refbacks

Paper Title : Design and Construction of Driven Timber Piles and Foundations
Authors : D.SREEKRISHNA, G.VISWANADH,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Associate Professor, Dept. of Civil Engineering Priyadarshini Institute of Technology & Management
Abstract :

af

Timber piles can also be driven for ground improvement, to densify loose granular soils. Although timber piles are rarely used on shore in the UK, in other countries notably the United States, Canada and Australia, they are used widely. For many structures, timber piles are a highly suitable choice of foundation, given appropriate ground conditions. They are economical, easy to transport, handle, cut to length and work with on site; and particularly suited for locations with access difficulties, or where excavations and the delivery of concrete would pose problems. Short, driven timber piles can be the solution for foundations in ground with a high water table, and where firm strata exists below surface material of loose sand, soft clays, or organic soils. In deep silt deposits, where the capacity of the pile is determined by shaft friction, timber piles are especially suitable being tapered and easy to splice. In Sweden and the Netherlands, timber piles are used below the water table, where they have proved practically invulnerable to decay, and extended to the surface using concrete sections. One of the suggested methods of reducing global warming has been to bury timber to create carbon dumps. Using timber for piled foundations would effectively achieve this.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Design, durability, Engineering News ,Formula, environmental, factor of safety, timber piling.

D.SREEKRISHNA,G.VISWANADH."Design and Construction of Driven Timber Piles and Foundations". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.989-994 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1232.pdf,

1. GZA GeoEnvironmental, Inc. , Central Artery (I93)/Tunnel (I-90) Project, Geotechnical Data Report, South Bay Interchange, Design Sections D009B/D009C, Boston, MA. 
2. GZA GeoEnvironmental, Inc. Central Artery (I93)/Tunnel (I-90) Project, Geotechnical Data Report, South Bay Interchange, Design Section D009A, Boston, MA. 
3. Haley and Aldrich, Inc. Final Geotechnical Data Report, Central Artery(I-93)/Tunnel (I-90) Project, Design Sections D007C and D007D (C07D2), Boston, MA. 
4. Haley and Aldrich, Inc. Final Geotechnical Report, Central Artery (I-93)/Tunnel (I-90) Project, Design Section D008A, Boston, MA. 
5. Maguire Group, Inc., and Frederic R. Harris, Inc. Final Report on Soil Stabilization and Testing Program, Central Artery (I-93)/Tunnel (I-90) Project, D009A, Boston, MA.
6. Maguire Group, Inc., and Frederic R. Harris, Inc. Supplemental Geotechnical Data Report, Central Artery (I-93)/Tunnel (I-90) Project, Design Section D009A, Boston, MA. 
7. Stone and Webster, Inc. (1996), Final Geotechnical Data Report, Central Artery (I-93)/Tunnel (I-90) Project, Design Section D019B, I-93 Viaducts and Ramps North of Charles River, Boston, MA.
 8. Barosh, P.J.; Kaye, C.A.; and Woodhouse, D. (1989), “Geology of the Boston Basin and Vicinity.” Civil Engineering Practice: Journal of the Boston Society of Civil Engineers, 4(1),39-52.
 9. McGinn, A.J., and O’Rourke, T.D. (2003), Performance of Deep Mixing Methods at Fort Point Channel, Cornell University, Ithaca, NY. 
10. AASHTO (2002), Standard Specifications for Highway Bridges, Washington, DC.
11. FHWA (1998), Design and Construction of Driven Foundations, Report No. FHWA-HI-97- 013, Washington, DC. 
12. Massachusetts Highway Department (1996), Pile Layout Plan: I-90 Logan Airport Interchange Arrivals Road, Tunnel, Contract C07D2, Drawing No. S-1162. 
13. Geosciences Testing and Research, Inc. (1997), Letter to RDA Construction Regarding Dynamic Load Test Results, Arrivals Tunnel: Round 1, May 5, 1997. 
14. Massachusetts Highway Department (1995), Interoffice Memorandum to File Regarding Hilton Heave, June 5, 1995. 
15. Massachusetts Highway Department (1995), Interoffice Memorandum to Lauren Cragg Regarding Hilton Heave, June 28, 1995.


Currently there are no Refbacks

Paper Title : Study of Behavior of Seismic Evaluation of Multistoried Building with Floating Column
Authors : SK.SHAMA BANU, G.SHANI PRIYANKA,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Associate Professor, Dept. of Civil Engineering Priyadarshini Institute of Technology & Management
Abstract :

af

- In present scenario buildings with floating column is a typical feature in the modern multi-storey construction in urban India. Such features are highly undesirable in a building built in seismically active areas .This paper aims to investigate the effect of a floating column under earthquake excitation for various soil conditions and as there is no provision or magnification factor specified in I.S. Code, hence the determination of such factors for safe and economical design of a building having floating column. Sometimes, to meet the requirements these type of aspects cannot be avoided though these are not found to be of safe. Hence, an attempt is taken to study the behavior of the building during the seismic activity. In this study, the seismic behavior of the RC multistory buildings with and without floating column is considered. The analysis is carried out for the multi-storey buildings of G+3 situated at zone iv , Using ETABS Software. Linear Dynamic Analysis is done for 2D multi storey frame with and without floating column to achieve the above aim i.e. the responses (effect) and factors for safe and economical design of the structure under different earthquake excitation.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


– Floating Column, Linear Analysis, Response Spectrum Analysis, Magnification Factor.

SK.SHAMA BANU,G.SHANI PRIYANKA."Study of Behavior of Seismic Evaluation of Multistoried Building with Floating Column". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.983-988 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1231.pdf,

1. K. N. V. Prasada Rao, K. Seetharamulu, and S. Krishnamoorthy, “Frames with staggered panels: experimental study”, Journal of Structural Engineering, VOL 110, No. 5, Page no: 1134-1148, 1984. 
2. Maison Bruce F. and Neuss Carl F., “Dynamic analysis of a forty four story building”, Journal of Structural Engineering, Vol. 111, No. 7, Page No:1559- 572,July, 1985. 
3. Krishnamoorthy CS, Finite element analysis, TMH Publications, 1987. 
4. Maison Bruce F. and Ventura Carlos E., “DYNAMIC ANALYSIS OF THIRTEEN-STORY BUILDING”, Journal of Structural Engineering, Vol. 117, No. 12, Page no:3783-3803,1991. 
5. Hartley Gilbert and Abdel-Akher Ahmed, “Analysis of building frames” Journal of Structural Engineering, Vol. 119, No. 2, Page no:468-483, 1993. 
6. Chopra, Anil k. (1995), “Dynamics of structures”, Prentice Hall. 
7. Arlekar Jaswant N, Jain Sudhir K. and Murty C.V.R, (1997), “Seismic Response of RC Frame Buildings with Soft First Storeys”. Proceedings of the CBRI Golden Jubilee Conference on Natural Hazards in Urban Habitat, 1997, New Delhi. 
8. Awkar J. C. and Lui E.M, “Seismic analysis and response of multi-storey semi rigid frames”, Journal of Engineering Structures, Volume 21, Issue 5, Page no: 425-442, 1997. 
9. Kattan P I (2003), “MATLAB guide to Finite Element”, Springer, Berlin & New York. 
10. Balsamoa A, Colombo A, Manfredi G, Negro P & Prota P (2005), ”Seismic behaviour of a full-scale RC frame repaired using CFRP laminates”. Engineering Structures 27 (2005) 769– 780. 
11. Fall H.G (2006), “Direct Stiffness Method For 2D Frames-Theory of structure”.
 12. Bardakis V.G., Dritsos S.E. (2007), “Evaluating assumptions for seismic assessment of existing buildings “.Soil Dynamics and Earthquake Engineering 27 (2007) 223–233. 
13. Daryl L. Logan (2007), “A First Course in the Finite Element Method”, Thomson, USA. 
14. Brodericka B.M., Elghazouli A.Y. and Goggins J, “Earthquake testing and response analysis of concentrically-braced sub-frames”, Journal of Constructional Steel Research ,Volume 64, Issue 9, Page no: 997-1007,2008. 
15. Agarwal Pankaj, Shrikhande Manish (2009), “Earthquake resistant design of structures”, PHI learning private limited, New Delhi.

Currently there are no Refbacks

Paper Title : Strength and Durability Studies on Higher Grade Concrete with High Volume Fly ash
Authors : SK.ROFA, J.SUPRIYA,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Associate Professor, Dept. of Civil Engineering Priyadarshini Institute of Technology & Management
Abstract :

af

Portland cement, as an ingredient in concrete, is one of the widely used construction materials, especially in developing countries. The CO2 emission during its production and the utilization of natural resources are important issues for the construction industry to participate in sustainable development. These limitations led to the search for alternative binders or cement substitutes. Fly ash is finely divided residue resulting from the combustion of powered coal and transported by the flue gases and collected by electrostatic precipitator. There are multiple benefits for the sustainable development of the construction industry by using fly ash to increase the strength characteristics of structural members. The objective of the present investigation is to study the mechanical strength behavior of High Volume Fly ash concrete pavement slab. The optimum maximum coarse aggregate size for the best compressive strength of 28 day concrete was therefore found to be 8mm for the water/cement ratio of 0.63. The analysis further shows that as heterogeneity increases the compressive strength of concrete reduces.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Fly Ash, Silica Fume, Strength, Durability, High-Volume Fly Ash Concrete, Oxide Composition.

SK.ROFA,J.SUPRIYA."Strength and Durability Studies on Higher Grade Concrete with High Volume Fly ash". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.977-982 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1230.pdf,

[1]. V. Penttala, Concrete and sustainable development, ACI Materials Journal, Vol. 94, No. 5, 1997, 409–416. 
[2]. Z. Li, Advanced concrete technology (John Wiley & Sons, New Jersey, 2011). 
[3]. A. Vanita, S.M. Gupta, and S.N. Sachdeva, Concrete Durability through High Volume Fly ash Concrete (HVFC) A Literature review, International Journal of Engineering Science and Technology, Vol. 2, No. 9, 2010, 4473-4477. 
[4]. C.D. Atis, High Volume Fly Ash Abrasion Resistant Concrete, Journal of Materials in Civil Engineering, Vol. 14, No. 3, 2002, 274-277. 
[5]. L. Jiang, Z. Liu, and Y. Ye, Durability of concrete incorporating large volumes of low quality fly ash, Cement and Concrete Research, Vol. 34, No. 8, 2004, 1467-1469. 
[6]. R, Siddique, Performance characteristics of high volume Class F fly ash concrete, Cement and Concrete Research, Vol. 34, No.3, 2004, 487–493. 
[7]. K.K. Sideris, A.E. Savva, and J. Papayianni, Sulfate resistance and carbonation of plain and blended cements, Cement & Concrete Composites, Vol. 28, No. 1, 2005, 47–56. 
[8]. P. Dinakar, K.G. Babu, and M. Santhanam, Durability properties of high volume fly ash self compacting concretes, Cement & Concrete Composites, Vol. 30, No. 10, 2008, 880–886.
 [9]. M. Sahmaran, I.O. Yaman, and M. Tokyay, Transport and mechanical properties of self consolidating concrete with high volume fly ash, Cement & Concrete Composites, Vol. 31, No. 2, 2009, 99–106. 
[10]. T.K. Erdem, and O. Kirca, Use of binary and ternary blends in high strength concrete, Construction and Building Materials, Vol. 22, No. 7, 2008, 1477–1483. 
[11]. M. Shekarchi, A. Rafiee, and H. Layssi, Longterm chloride diffusion in silica fume concrete in harsh marine climates, Cement & Concrete Composites, Vol. 31, No. 10, 2009, 769–775. 
[12]. H.W. Song, S.W. Pack, S.H. Nam, J.C. Jang, and V. Saraswathy, Estimation of the permeability of silica fume cement concrete, Construction and Building Materials, Vol. 24, No. 3, 2010, 315–321. 
[13]. N.Y. Mostafa, Q. Mohsen, S.A.S. El-Hemaly, S.A. El- Korashy, and P.W. Brown, High replacements of reactive pozzolan in blended cements: Microstructure and mechanical properties, Cement & Concrete Composites, Vol. 32, No. 5, 2010, 386–391.
[14]. IS:12269 –1987, Indian Standard specification for 53 grade ordinary Portland cement, Bureau of Indian Standards, New Delhi.
[15]. IS: 383–1970, Indian standard specification for coarse and fine aggregate from natural sources for concrete, Bureau of Indian Standards, New Delhi.

Currently there are no Refbacks

Paper Title : Design and Analysis of Flexible Pavement by Nonlinear Finite Element Method
Authors : SK.NAYEEM, G.VISWANADH,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Associate Professor, Dept. of Civil Engineering Priyadarshini Institute of Technology & Management
Abstract :

af

Highway and pavement design plays an important role in the DPR projects. The satisfactory performance of the pavement will result in higher savings in terms of vehicle operating costs and travel time, which has a bearing on the overall economic feasibility of the project. A thorough analysis of the existing pavement is greatly required at this point of time, as an excessive amount of vehicle loads is passing through the project site and it is unknown whether or not the road pavement might sustain its structural integrity. The critical line of equal costs on the plane of CBR versus msa is also identified. This is a swing line which delineates the economic feasibility of two types of pavements. It has been found that the pressure vs settlement curve; pressure vs nodal stress curve ; pressure vs element stress curve are linear for small pressure range and then it become nonlinear. More nonlinearity is seen at higher pressure. Hence material nonlinearity must be considered while analysing and designing flexible pavements. This total work includes collection of data analysis various flexible and rigid pavement designs and their estimation procedure are very much useful to engineer who deals with highways.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Flexible pavement, Traffic growth, Kochi port, Design, Overlay thickness.

SK.NAYEEM,G.VISWANADH."Design and Analysis of Flexible Pavement by Nonlinear Finite Element Method". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.971-976, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1229.pdf,

[1] Analysis and design of flexible pavements, Indian Road Congress, Code 37, 2001 
[2] Bruhaspathi, KVRDN and NarasingaRao, BND. 2012. ―Pavement Design of National Highway A Case Study on Reducing Pavement Thickness‖, International Journal of Engineering Research and Applications, Vol. 2, Issue 4, pp.1000-1003 
[3] Chandra, S. and Sikdar, P.K. 2000. ―Factors Affecting PCU in Mixed Traffic Situations in Urban Roads‖, Road Transport Research, Vol. 9, No. 3, Australian Road Research Board, pp. 40-50. 
[4] Highway Capacity Manual. 2000. Transportation Research Board, Special Report 209, fourth edition, Washington D.C. 
[5] Methods of Test for Soils: Part 9 - Determination of Dry Density-Moisture Content Relation by Constant Mass of Soil Method, Indian standard code 2720.8, 1983.
[6] Methods of Test for Soils: Part 16 – Laboratory Determination of CBR, Indian standard code 2720.16,1987. 
[7] A report on flexible pavement design, Public works department, Government of Kerala, 2012. 
[8] Rafiqul A. Tarefder, NayanSaha, Jerome W. Hall, and Percy, T. 2008. ―Evaluating weak subgrade for pavement design and performance prediction‖. Journal of Geo-Engineering, Vol. 3, No. 1. 
[9] Sarna, A.C., Jain, P.K. and Chandra, G. 1989. ―Capacity of Urban Roads - A Case Study of Delhi and Bombay‖. Highway Research Bulletin, No. 4, Indian Roads Congress, New Delhi. 
[10] Saurabh Jain, Joshi, Y.P. and Goliya, S. S. 2013. ―Design of Rigid and Flexible Pavements by Various Methods & Their Cost Analysis of Each Method‖. Int. Journal of Engineering Research and Applications, Vol. 3, Issue 5. 
[11] Yagar, S. and Aerde, M.V. 1983. ―Geometric and Environmental Effects on Speeds of 2-Lane Highways‖, Transportation Research-A, Vol. 17A, No. 4, pp. 315-325. 
[12]. Das, A. (2007) Pavement Design with Central Plant Hot-Mix Recycled Asphalt Mixes, Construction and Building Materials, Vol.21, No.5, pp.928-936. 
[13]. Das, A.(2008) Reliability Considerations of Bituminous Pavement Design by MechanisticEmpirical Approach, the International Journal of Pavement Engineering, Vol.9, No.1, pp. 19-31.
 [14]. Dilip, D., Ravi, P. and Babu,G. (2013) System Reliability Analysis of Flexible Pavements, Journal Transportation Engineering, Vol.139, No.10, pp. 1001- 1009. 
[15]. Hadi, M.N.S. and Bodhinayake, B.C. (2003) Nonlinear Finite Element Analysis of Flexible Pavements, Advances in Engineering Software, Vol.34, No.11-12, pp. 657-662

Currently there are no Refbacks

Paper Title : Structural assessment for reinforced concrete elevated overhead water tank
Authors : SK.NASEEMA, G.SHANI PRIYANKA,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Associate Professor, Dept. of Civil Engineering Priyadarshini Institute of Technology & Management
Abstract :

af

Storage reservoirs and overhead tank are used to store water, liquid petroleum, petroleum products and similar liquids. The force analysis of the reservoirs or tanks is about the same irrespective of the chemical nature of the product. As from very offensive past records, many reinforced concrete elevated water tanks were collapsed or highly damaged during the earthquakes all over the world. General observations are pointing out the reasons towards the failure of supporting system which reveals that the supporting system of the elevated tanks has more critical importance than the other structural types of tanks. Most of the damages observed during the seismic events arise due to the causes like improper/unsuitable design of supporting system, mistakes during selection of supporting system, improper arrangement of supporting elements and/or underestimated demand or overestimated strength. The present work aims at checking the adequacy of water tank supported on shafts for the seismic excitations. The result shows that structure response is exceedingly influenced by different capacities of water tank and their one mass and two mass models and earthquake characteristics.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Elevated water tanks, Reinforced concrete, Seismic response, Tank Staging

SK.NASEEMA,G.SHANI PRIYANKA."Structural assessment for reinforced concrete elevated overhead water tank". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.965-970 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1228.pdf,

[1 ] Chirag N. Patel, H. S. Patel‖ Supporting systems for reinforced concrete elevated water tanks‖, International Journal of Advanced Engineering Research and Studies, Vol. II, Issue I, Oct.-Dec.,2012. 
[2 ] S.K. Jain, U.S. Sameer, ―Seismic Design of Frame Staging for Elevated Water Tanks‖, Ninth Symposium on Earthquake Engineering, Roorkee, December 14-16, 1990, Vol.1. 
[3 ] G. W. Housner, The Dynamic Behavior of Water Tanks, Bulletin of the Seismological Society of America, Vol.53, No.2, pp.381-387, Feb1963. 
[4 ] Durgesh C Rai, (2003) ―Performance of Elevated Tanks in Mw 7.7 Bhuj Earthquake of January 26th, 2001‖ International journal of advanced engineering research Proc. Indian Acad. Sci. (Earth Planet. Sci.), 112, No. 3, September 2003, pp. 421-429 
[5 ] Chirag N. Patel, Burhan k. kanjetawala, H. S. Patel ―Influence of Frame Type Tapered Staging on Displacement of Elevated Water Tank ‖ GIT-Journal of Engineering and Technology, ISSN 2249 – 6157, Sixth volume, 2013, 
[6 ] Pravin B.Waghmare, Atul M. Raghatate & Niraj D.Baraiya ―Comparative Performance of Elevated Isolated Liquid Storage Tanks (With Shaft Staging)‖, International Journal of Advance technology in civil engineering, ISSN:2231-5721, Volume 1, Issue 2-2012. 
[7 ] S. C. Duta, S. K. Jain and C. V. R. Murty, ―Assessing the seismic torsional vulnerability of elevated tanks with RC frame-type staging‖, Soil Dynamics and Earthquake Engineering (ELSEVIER), 2000, Vol. 19, pp. 183-197 
[8 ] S. C. Duta, S. K. Jain and C. V. R. Murty, ―Alternate tank staging configurations with reduced torsional vulnerability‖, Soil Dynamics and Earthquake Engineering (ELSEVIER), 2000, Vol. 19, pp. 199-215 
[9 ] IS: 11682-1985, Criteria for Design of RCC Staging For Overhead Tanks (1985),Bureau of Indian Standards, New Delhi, 
[10]+ M. Kalani and S. A. Salpekar, ―A comparative study of different methods of analysis for staging of elevated water tanks‖, Indian Concrete Journal, JulyAugust – 1978, Pg No.210-216. 
[11]+ M. V. Waghmare, S.N.Madhekar ―Behaviour of elevated water tank under Sloshing effect‖ International Journal of Advanced Technology in Civil Engineering, Volume-2, Issue-1, 2013 *12 + S.K.Jain & et al., ― proposed provision of aseismic design of a liquid storage tank‖ , journal of structural engineering,vol 20 no.4 january 1994 pp. 167-175.
 [13]  Ayazhussain.M.Jabar, H.S.Patel, ―Seismic Behaviour Of RC Elevated Water Tank Under Different Staging Pattern And Earthquake Characteristics‖, International Journal Of Advanced Engineering Research And Studies, April-June2012. 
[14] Pavan .S. Ekbote, Jagdish Kori, ―Seismic Behaviour of RC Elevated Water Tank under Different Types Of staging Pattern‖, Journal Of Engineering,Computers and Applied Sciences, Volume 2, No.8, August 2013. 
[15 ] .R. Livaoglu, A. Dogangün, ―An Investigation about Effects of Supporting Systems on Fluid-Elevated TanksInteraction‖, First International Conference on Seismology and Earthquake Engineering (SEE), Turkey, May – 2007

Currently there are no Refbacks

Paper Title : Strength Behavior of Mortar Using Slag as Supplementary Cementitious Material
Authors : N.M.VENKATESH, J.SUPRIYA,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Associate Professor, Dept. of Civil Engineering Priyadarshini Institute of Technology & Management
Abstract :

af

Pozzolanic admixtures are generally being used along with the cement in concrete mixes so as to derive certain benefits like economy, durability, Chemical resistance in permeability etc. The use of high volumes of fly ash has become on of the current topics of research possibility promoted by the availability of a wide range of chemical and mineral admixtures. Test results of the study show that the designed strength was exceeded and that the ductility ratio and the safety margin against brittle failure of concrete containing these industrial by-products were comparable to those of the reference concrete (normal ordinary Portland cement concrete), proving the feasibility of using the waste materials as alternative construction materials. Different water-binder ratios ranging from 0.55 to 0.27are considered for investigation. From the results, the relationship is developed between Compressive Strength, Split Tensile strength and Flexural Strength of High Volumes of Slag Concrete. Test results show that strength increases with the increase of slag up to an optimum value, beyond which, strength values start decreasing with further addition of slag. Among the seven slag mortars, the optimum amount of cement replacement is about 40%, which provides 19% higher compressive strength and 25% higher tensile strength as compared to OPC mortar.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Slag, Cement, Mortar, Compressive Strength, Tensile Strength, Hydration.

N.M.VENKATESH,J.SUPRIYA."Strength Behavior of Mortar Using Slag as Supplementary Cementitious Material". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.959-964 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1227.pdf,

[1]. Bai, J., Wild, S., and Sabir, B. B. (2003). Chloride ingress and strength loss in concrete with different PCPFA-MK binder compositions exposed to synthetic sea water. Cement and Concrete Research, 33 (3), 353-62. 
[2]. Bleszynski, R., Hooton, R. D. Thomas, M. D. A., and Rogers, C. A. (2002). Durability of ternary blend concrete with silica fume and blast furnace slag: Laboratory and outdoor exposure site studies. ACI Materials Journal, 99 (2), 499-508. 
[3]. Bouzoubaa, N., Zhang, M. H., and Malhotra, V. M. (2000). “Laboratory-produced high-volume fly ash blended cements: compressive strength and resistance to the chloride-ion penetration of concrete.” Cement and Concrete Research, 30 (7), 1037-1046. 
[4]. Chindaprasirt, P., and Rukzon, S. (2008). Strength, porosity and corrosion resistance of ternary blend Portland cement, rice husk ash and fly ash mortar. Construction and Building Materials, 22(8), 1601-1606. 
[5]. Murthi, P., and Sivakumar, V. (2008). Studies on acid resistance of ternary blended concrete. Asian Journal of Civil Engineering and Housing, 9(5), 473- 486. 
[6]. Jones, M. R., Dhir, R. K. and Magee, B. J. (1997). Concrete containing ternary blended binders: carbonation and chloride resistance. Cement and Concrete Research, 27(6), 825-831. 
[7]. Jones, M. R., and Magee, B. J. (2002). A mix constituent proportioning method for concrete containing ternary combinations of cement. Cement and Concrete Research, 54(2), 125-139. 
 [8]. Udoeyo, F. F., and Hyee, A. (2002). “Strengths of cement kiln dust concrete.” J. Mater. Civ. Eng. 14 (6), 524-526. 
[9]. Serrano, S. E., 2010. Engineering Uncertainty and Risk Analysis. A Balanced Approach to Probability, Statistics, Stochastic Modeling, and Stochastic Differential Equations. 3rd. Ed. HydroScience Inc., Ambler, PA. 
[10]. ASTM C 39-02, Standard test method for compressive strength of cylindrical concrete specimens, Annual Book ASTM Standards, 4(04.02), 2002. 
[11]. ASTM C 78-94, Standard test method for flexural strength of concrete (using simple beam with thirdpoint loading), Annual Book ASTM Standards, 4(04.02), 2002. [12]. ASTM C 138-92, Standard test method for unit weight, yield, and air content (Gravimetric) of concrete, Annual Book ASTM Standards. 
[13]. ASTM C 231-916, Standard test method for air content of freshly mixed concrete by the pressure method, Annual Book ASTM Standards. 
[14]. ASTM C 496-02, Standard test method for splitting tensile strength of cylindrical concrete specimens, Annual Book ASTM Standards, 4(04.02), 2002.

Currently there are no Refbacks

Paper Title : Experimental Study on Bacterial Cement Composites
Authors : M.HANUMANTH RAO, G.VISWANADH,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Associate Professor, Dept. of Civil Engineering Priyadarshini Institute of Technology & Management
Abstract :

af

Concrete in most structures is designed to crack in order to let embedded steel reinforcement take over tensile stresses. Crack formation is also a typical phenomenon related to durability. Percolation of cracks may lead to leakage problems or ingress of deleterious materials, causing deterioration of the concrete matrix or corrosion of embedded steel reinforcement. Durability can be enhanced by preventing further ingress of water and other substances. In recent years a bacteria-based self-healing concrete is being developed in order to extend the service life. A two component healing agent is added to the concrete mixture. The agent consists of bacteria and an organic mineral precursor compound. Self healing agents such as epoxy resins, bacteria, fiber are used to heal cracks in concrete. Among these, bacteria used in concrete are effective. When the bacteria is mixed with concrete the calcium carbonate precipitates forms and these precipitates filling the cracks and makes the crack free concrete. The state of art results in all projects show that material designed as self healing agents.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Bacterial concrete, Calcium carbonate, Epoxy resins, Self healing agent.

M.HANUMANTH RAO,G.VISWANADH."Experimental Study on Bacterial Cement Composites". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.953-958 , December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1226.pdf,

[1]H.M.Jonkers, “Bacteria-Based Self Healing Concrete”,vol .56, 2011, pp.1-12.
 [2]Nithin Kumar , Ayona S Nair, Sreedevi V, “Study On Fracture Parameters Of Bacterial Concrete” ,pp. 6- 12. 
[3]Jagadeesha Kumar B, R Prabhakara, Pushpa H, “Bio Mineralisation Of Calcium Carbonate By Different Bacterial Strains And Their Application In Concrete Crack Remediation” ,vol. 6, 2013, pp. 202- 213. 
[4]Srinivasa Reddy. V, Achyutha Satya.K, Seshagiri Rao .M. V, Azmatunnisa. M, “A Biological Approach To Enhance Strength And Durability In Concrete Structures”, vol. 4, 2012 , pp. 392-399. 
[5]S. Maheswaran, S. S. Dasuru, A. Rama Chandra Murthy, B. Bhuvaneshwari, V. Ramesh Kumar, G. S. Palani1, Nagesh R. Iyer, Sarayu Krishnamoorthy and S. Sandhya, “Strength Improvement Studies Using New Type Wild Strain Bacillus Cereus On Cement Mortar”, vol. 106,2014.
 [6]Er. Satinder Kaur, “Bacterial Concrete- A Concrete Solution For Cracks -An Overview” ,vol. 1,2015. 
[7]Henk Jonkers, “Development And Application Of Bacteria-Based Self-Healing Materials”,2012. 
[8]M Dhaarani and K Prakash, “Durability Study On HVFA Based Bacterial Concrete—A Literature Study”, vol. 3,2014. 
[9]Mohini P. Samudre , M. N. Mangulkar , S. D. Saptarshi, “A Review Of Emerging Way To Enhance The Durability And Strength Of Concrete Structures: Microbial Concrete”, vol .3,2014. 
[10]Mayur Shantilal Vekariya, Prof. Jayeshkumar Pitroda, “Bacterial Concrete: New Era For Construction Industry”,vol. 4,2013. 
[11]Jagadeesha Kumar B G, R Prabhakara, Pushpa H, “Effect Of Bacterial Calcite Precipitation On Compressive Strength Of Mortar Cubes”, vol .2,2013.
 [12]Abhijitsinh Parmar, Ankit Patel, Priyank Shah, “Improvement Of The Concrete Cracks By Using Bacillus Sphaericus”,2013. 
[13]Vijeth N Kashyap, Radhakrishna, “A Study On Effect Of Bacteria On Cement Composites”,2013. 
[14]Ravindranatha, N. Kannan, Likhit M.L , “SelfHealing Material Bacterial Concrete” ,vol .3,2014. \
[15]J.Karthik, P.Jagannathan, “Study Of Strength Parameter Of Concrete By Replacing Cement By Flyash Enriched With Microbial Agents”,vol.2,2015

Currently there are no Refbacks

Paper Title : Effect of Aggressive Chemical Environment on Fly Ash Based Geopolymer Concrete
Authors : K.CHINNASUBBARAO, G.SHANI PRIYANKA,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Associate Professor, Dept. of Civil Engineering Priyadarshini Institute of Technology & Management
Abstract :

af

Concrete is the most widely used building material around the world because of the availability of raw materials, the simplicity in preparation and the moulding into different shapes. One of the main ingredients in a normal concrete mixture is Portland cement. It leads to the release of significant amount of CO2 and other greenhouse gases to pollute the atmosphere. Reuse and recycle of industrial solid wastes and by products in concrete is necessary to produce even “greener” concrete. The use of fly ash is more environmental friendly due to the reduced CO2 emissions and costs compared to OPC, which requires the burning of large quantities of fuel and the decomposition of limestone and can result in significant CO2 emissions. The test results indicate that the heat-cured fly ash-based geopolymer concrete has an excellent resistance to acid and sulphate attack when compared to conventional concrete. Thus we can say that the production of geopolymers have a relative higher strength, excellent volume stability and better durability. The experimental results reveal that the poisson’s ratio was in the range of 0.20 to 0.24 and modulus of elasiticity was in the range of 27 to 29 N/mm2.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Geopolymer Concrete, Molarity, Sodium Hydroxide, Sodium Silicate, Modulus of Elasticity.

K.CHINNASUBBARAO,G.SHANI PRIYANKA."Effect of Aggressive Chemical Environment on Fly Ash Based Geopolymer Concrete". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.947-952, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1225.pdf,

[1] McCaffrey R. Climate change and the cement industry, Global cement and lime magazine (Environmental special issue), 8(2002) 15-9. 
[2] Davidovit. J., “Geopolymers: Inorganic polymeric new materials”, Journal of Materials Education,Vol. 16 (1994), pp. 91 – 139. 
[3] N. S. Pandian, “Fly ash characterization with reference to geotechnical applications” J. Indian Inst. Sci., Nov.–Dec. 2004, 84, 189–216. 
[4] Palomo A., Grutzeck, M. W. and Blanco M. T. 1999. Alkali-activated fly ashes: cement for the future. Cement and Concrete Research. 29(8): 1323-1329. 
[5] Shankar H. Sanni1, Khadiranaikar, R. B, “Performance of geopolymer concrete under severe environmental conditions,International Journal Of Civil and Structural Engineering Volume 3, No 2, 2012.
[6] K. Kannapiran*, T. Sujatha and S. Nagan, “Resistance of Reinforced Geopolymer ConcreteBeams To Acid And Chloride Migration” Asian Journal Of Civil Engineering (Bhrc) Vol. 14, No. 2 (2013) Pages 225-238. 
[7] Pavlik, V. 1996. Corrosion of hardened cement paste by acetic and nitric acids Part III: influence of water/cement ratio, Cement and Concrete Research 
[8] Dan, E.; Janotka, I. 2003. Chemical Resistance of Portland cement Blast-furnace slag cement and SulphoaluminateBelite cement in acid, chloride and sulphate solution: Some preliminary results, Ceramics-Silikaty 47(4): 141-148. 
[9] Beddoe, R. E.; Dorner, H. W. 2005. Modeling acid attack on concrete: Part I. The essential mechanisms, Cement and Concrete Research 35(12):2333-2339. 
[10] Allahverdi Ali, Skavara, Frantisek, “Sulfuric acid attack on Hardened paste of Geopolymer cements, Part 1. Mechanism of Corrosion at relatively high Concentrations”, Ceramics -Silikáty 49 (4) 225- 229(2005) 
*11+ Bakharev. T, “Resistance of geopolymer materials to acid attack”, Cement and concrete Research 35 (2005) 658-670. 
*12+ Bakharev.T, “Durability of geopolymer materials in sodium and magnesium sulfate Solutions”, Cement and concrete Research 35 (2005) 1233-1246. 
[13] Wallah,S.E., Hardjito D., sumajoouw, D.M.J., and Rangan (2005a), “Sulphate And Acid Resistance Of Fly Ash-based Geopolymer Concrete”, in proceeding of Australian structural engineering. 
14] Wallah, S.E. and Rangan, B.V. 2006. Low-Calcium fly ash-based geopolymer concrete: Long-term properties. Curtin University of Technology. 
[15] Thokchom, S., Dr. ParthaGhosh, P. and Ghosh, S. 2009. Acid Resistance of Fly Ash Based Geopolymer Mortars. International Journal of Recent Trends in Engineering

Currently there are no Refbacks

Paper Title : Mechanical Properties of Steel Fiber Reinforced Concrete Composites
Authors : CH.JAI CHANDU, J.SUPRIYA,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Associate Professor, Dept. of Civil Engineering Priyadarshini Institute of Technology & Management
Abstract :

af

Concrete is most widely used construction material in the world. Fiber reinforced concrete (FRC) is a concrete in which small and discontinuous fibers are dispersed uniformly. The fibers used in FRC may be of different materials like steel, G.I., carbon, glass, aramid, asbestos, polypropylene, jute etc. Hybrid fibre can provide reinforcement at all the range of strains. Combination of low and high modulus fibres can arrest cracks at micro level as well as macro level. Overcome disadvantage of lower workability caused due to use of only higher percentage of steel fibres. Potential advantage in improving concrete properties as well as reducing the overall cost of concrete production. FRC has found many applications in civil engineering field. Based on the laboratory experiment on fiber reinforced concrete (FRC), cube and cylinders specimens have been designed with steel fiber reinforced concrete (SFRC) containing fibers of 0% and 0.5% volume fraction of hook end Steel fibers of 53.85, 50 aspect ratio and alkali resistant glass fibers containing 0% and 0.25% by weight of cement of 12mm cut length were used without admixture. The results obtained show that the addition of steel fiber improves the modulus of elasticity of concrete. It was also analyzed that by increasing the fiber volume fraction from 0.5% to 1.5% and aspect ratio of fibers from 50 to 71 there was a healthy effect on modulus of elasticity of Steel Fiber Reinforced Concrete.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


- Compressive Strength, Fiber Reinforced Concrete, Glass Fibers, Split Tensile Strength.

CH.JAI CHANDU,J.SUPRIYA."Mechanical Properties of Steel Fiber Reinforced Concrete Composites". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.941-946, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1224.pdf,

[1]. Chen, S, 2004. “Strength of Steel Fibre Reinforced Concrete Ground Slabs”. Proceedings of the Institute of Civil Engineers, Structures and Buildings (157), Issue SB2, pp. 157-163 
[2]. Banthia,N,Chokri,K, and Trottier,JF,1995. Impact tests on Cement-Based Fiber Reinforced Composites. ACI Publications, Detroit, USA, SP, 155-9, pp.171-188 
[3]. Khaloo, A R and Kim, N, 1997. “Influence of Concrete and Fiber Characteristics on Behaviour of Steel Fiber Reinforced Concrete under Direct Shear”. ACI Materials Journal, 94, No. 4, pp. 592-601. 
[4]. Johnston, CD, and Zemp, WR, 1991. “Flexural Fatigue performance of Steel Fibre reinforced concrete- Influence of Fibre Content, Aspect Ratio, and Type”. ACI Material Journal, 88, No.4, pp. 374- 383. 
[5]. Elsaigh,WA and Kearsley,EP,2002.”Effect of Steel Fibre Content on Properties of Concrete”. Journal of Concrete/Beton, South Africa, No 102, pp. 8-12. 
[6]. Johnston Gopalaratnam, V.S. and S. Shah, 1987. “Failure mechanism and Fracture of fibre reinforced concrete, Fibre reinforced concrete – Properties and Application”, American Concrete Institute. 
[7]. A.M Shende et al.. “Comparative Study on Steel Fiber Reinforced cum Control Concrete” International Journal Of Advanced Engineering Sciences And Technologies Vol. No. 6, Issue No. 1, 116 – 120 
[8]. Mohammed Alias Yusof et al., “Mechanical Properties of Hybrid Steel Fibre Reinforced Concrete with Different Aspect Ratio.” Australian Journal of Basic and Applied Sciences, 2011 
[9]. Er Prashant Y.Pawade et al. “Effect of Steel Fibres on Modulus of Elasticity of Concrete” (IJAEST) International Journal Of Advanced Engineering Sciences And Technologies Vol No. 7, Issue No. 2, 169 – 177 
[10]. Osman Gencel et al.. “ Workability and Mechanical Performance of Steel Fiber-Reinforced Self-Compacting Concrete with Fly Ash” Composite Interfaces 18 (2011) 169–184 
[11]. Saravana Raja Mohan. K, Parthiban. K “Strength and behavior of Fly Ash based Steel Fibre Reinforced Concrete Composite.
[12]. J. Mater. “Mechanical Properties of Steel Fiber Reinforced Concrete”, Journal of Materials in Civil Engineering ,Volume 19 , Issue 5, 2007 
[13]. IS: 383-1970, “Indian standards specification for coarse and fine aggregates from natural sources for concrete”, Bureau of Indian Standards, New Delhi 
[14]. BS 1881: Part 121:1983,” Testing concrete Method for determination of static modulus of elasticity in compression”.
 [15]. ASTM C 469-94” Standard Test Method for Static Modulus of Elasticity and Poisson’s Ratio of Concrete in Compression”

Currently there are no Refbacks

Paper Title : Bond Strength of Reinforcement Lap-Splices in Self-Compacting Concrete Beams
Authors : B.GIREESH BABU, G.VISWANADH,
Affiliations : (M.Tech) Structural Engineering, Dept. of Civil Engineering
Associate Professor, Dept. of Civil Engineering Priyadarshini Institute of Technology & Management
Abstract :

af

The development of self-compacting concrete (SCC) was a significant step towards effectiveness at building sites, realistically producing prefabricated concrete rudiments, improved working conditions and better quality and emergence of concrete structures. By addition of fibers to SCC, bar reinforcement can be replaced and the performance of concrete structures improved. The variation of the bond strength along the flowing path for the different mixes was evaluated. The steel-concrete bond adequacy was evaluated based on normalized bond strength. The results showed that the bond strength was reduced due to Portland cement replacement with dolomite powder. The addition of either silica fume or fly ash positively hindered further degradation as the dolomite powder content increased. The SCC specimens were cast without applying compaction, whereas the specimens of normal concrete were cast by conventional practice with substantial compaction and vibration. The results showed that SCC specimens generated higher bond to reinforcing bars than normal concrete specimens and the correlation between bond strength and compressive strength of NC is more consistent.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Self-compacting concrete, Bond strength, Lap splice, Full-scale beam, Positive bending.

B.GIREESH BABU,G.VISWANADH."Bond Strength of Reinforcement Lap-Splices in Self-Compacting Concrete Beams". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.935-940, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1223.pdf,

[1] H. Okamura and M. Ouchi, “Self-Compacting Concrete,” Journal of Advanced Concrete Technology, JCI, vol. 1, issue 1, pp. 5-15, 2003. 
[2] K. Yoshitake, H. Orgura and A. Ogawa, “The effect of vertical and horizontal position of reinforcement for bond condition in beam-column joint,” Proceedings of 65th JSCE Annual Conference. 
[3] G. Russo and F. Romano, “Cracking response of RC members subjected to uniaxial tension,” Journal of Structural Engineering ASCE, vol. 118, No.5, pp. 1172- 1190, 1992. 
[4] B.M. Luccioni, D.E. Lopez and R.F. Danesi, “BondSlip in Reinforced Concrete Elements,” Journal of Structural Engineering ASCE, vol. 131, pp. 1690-1698, 2005. 
[5] J. Pedziwiatr, “Influence of Internal cracks on bond on cracked concrete structures,” Archives of Civil and Mechanical Engineering, vol. 8, pp. 91-105, 2008.
[6] P.G. Gambarova and G. P. R.B. Zasso, “Steel-toConcrete bond after concrete splitting: tests results,” Materials and Structures, vol. 22, issue 1, pp. 35-47, 1989. 
[7] Y. Goto, “Cracks formed in concrete around tension bars,” American concrete Institute (ACI) Journal, vol. 68, issue 68, pp. 244-251, 1971. 
[8] A. Azizinamini, M. Chisala and S.K. Ghosh, “Tension development length of reinforcing bars embedded in high-strength concrete,” Enginering Structures, vol. 17, pp. 512-522, 1995. 
[9] W. Yeih, R. Huang, J.J. Chang, and C.C. Yang, “A pullout Test for Determining Interface properties between rebar and concrete,” Advanced Cement Based Materials, Elsevier, vol.5, pp. 57-65, 1997. 
[10] B.S. Hamad and M. Y. Mansour, “bond strength of non-contact tension lap splices,” American Concrete Institute (ACI) Journal, vol. 93, pp. 316-326, 1996. 
[11] K. Turk, A. Benli and Y. Calayir, “Bond strength of tension lap-splice in full scale self-compacting concrete beams,” Turkish J. Eng. Env. Sci., vol. 32, pp. 377-386, 2008.
[12] S. J Chamberlin, “Spacing of spliced bars in beams,” American Concrete Institute (ACI) Journal, vol. 54, pp. 689-697, 1958. 
[13] S.J. Chamberlin, “Spacing of spliced bars in tension pullout,” American Concrete Institute (ACI) Journal, vol. 49, pp. 261-274, 1952.
 [14] K.H. Khayat, “Workability, Testing, and Performance of Self-Consolidating Concrete,” American Concrete Institute (ACI) Journal, vol. 96, issue 3, pp. 346-354, 1999. 
[15] R. Kumar, R. Kumar and N. Kumar, “In situ performance of Self-Compacting Concrete in TBeams,” Journal of Materials in Civil Engineering, ASCE, vol. 21, pp. 103-109, 2009.

Currently there are no Refbacks

Paper Title : Efficient Document Annotation Using Content and Querying Value
Authors : DASARI MAHIDHAR, B.V.N.V.KRISHNA SURESH,
Affiliations : M.Tech (CSE), Department of Computer Science & Engineering, NRI Institute of Technology
Assistant Professor, Department of Computer Science & Engineering, NRI Institute of Technology
Abstract :

af

Persistently it is hard to locate the germane data in unstructured text documents. The organized data stays secured in unstructured text. Annotations as Attribute name-worth sets are more expressive for the recuperation of such documents. This system proposes a novel, particular, the alternative methodology for report recuperation which joins annotations recognizing confirmation moreover expands the ebb and flow structure using fuzzy search with vicinity positioning. This system recognizes the estimations of organized properties by scrutinizing, inspecting and parsing the exchanged documents. The searching system will make use of fuzzy search with closeness positioning for searching the customer captivated documents just. As needs are this system proposes an approach for capable file recuperation using practical routines.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


proximity ranking, document annotation, OpenNLP, content, querying value, natural language processing, Document retrieval, instant-fuzzy search,

DASARI MAHIDHAR,B.V.N.V.KRISHNA SURESH."Efficient Document Annotation Using Content and Querying Value". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.931-935, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1222.pdf,

1. H. Bast, , A. Chitea, F. Suchanek,Weber, ―Ester : efficient search on text,entities, and relations," SIGIR, 2007. B. Li, J. Feng, G Li, S. Ji, ―Efficient interactive fuzzy keyword search," WWW, 2009. C. Li, G. Li, J. Feng S. Ji, ―Efficient type-ahead search on the relational data: a tastier approach" , SIGMOD, 2009. 
2. Sonal Kutade, Poonam Dhamal, ―Efficient Document Retrieval using Annotation, Searching and Ranking‖, IJCA, (0975 – 8887) Vol 108, No. 5, December 2014 
3. Harshal J. Jain, M. S. Bewoor, S. H. Patil, ―Context Sensitive Text Summarization Using K Means Clustering Algorithm‖, International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume-2, Issue-2, May 2012 
4. Md. Abu Nisar Masud, Md. Munasir Mamun, ―A General Approach to Natural Language Generation‖ In Proceeding of IEEE, INMIC, 2003. 
5. Yiyao Lu, Hai He, Hongkun Zhao, Weiyi Meng, ―Annotating Search Results from Web Databases‖, IEEE Transactions On Knowledge And Data Engineering, Vol. 25, No. 3 YEAR 2013. 
6. Akshay Shingote Nikhil Vispute Priyanka Dhikale,‖ Facilitating Document Annotation Using Content & Querying Value‖, International Journal of Computer Trends and Technology (IJCTT) – volume 9 number 4– Mar 2014 
7. Vagelis Hristidis, Eduardo J. Ruiz, Panagiotis G. Ipeirotis, , ―Facilitating Document Annotation Using Content and Querying Value", volume 6, no 2, IEEE 2014 
8. Chen Li , Cetindil, I., Taewoo Kim , Esmaelnezhad, ―Efficient instant fuzzy search with proximity ranking", Data Engineering (ICDE), 30th International Conference ,IEEE 2014 
9. V. Hristidis, E. Ruiz, " CADS: A Collaborative Adaptive Data Sharing Platform", SCIS, International University, Florida, 2009 A. Broschart, R. Schenkel, , S. Won Hwang, G. Weikum, M. Theobald, ―Efficient text proximity search," SPIRE, 2007. 
10. H. Yan, J. Wen, S. Shi, F. Zhang, T. Suel,, ―Efficient term proximity search with the term-pair indexes,"CIKM, 2010, pp. 1229-1238.

Currently there are no Refbacks

Paper Title : Challenges in Big Data using Data Mining Techniques.
Authors : HIMABINDU MUTLURI, Mrs P.SUJATHA,
Affiliations : M.Tech (CSE), Department of Computer Science & Engineering, NRI Institute of Technology
Associate Professor, Department of Computer Science & Engineering, NRI Institute of Technology
Abstract :

af

Big data is a massive accumulation of unstructured data where it can gather data from different sources like online networking, geological sources, and verifiable sources and so on. .With a specific end goal to separate the valuable data among unstructured stockpiling database, we utilize data mining strategies which coordinate enormous data properties. We utilize Big data Properties like HACE and Hadoop Procedures which uses parallel preparing to perform the data extraction errand in time which leads tedious process and create remove data in less time.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


MapReduce, Data Mining, Hadoop, HACE, Unstructured Data, Structured data.

HIMABINDU MUTLURI,Mrs P.SUJATHA."Challenges in Big Data using Data Mining Techniques.". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.924-930, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1221.pdf,

1. Xindong Wu , Gong-Quing Wu and Wei Ding “ Data Mining with Big data “, IEEE Transactions on Knoweledge and Data Enginnering Vol 26 No1 Jan 2014 
2. Xu Y etal, balancing reducer workload for skewed data using sampling based partioning 2013. 
3. X. Niuniu and L. Yuxun, “Review of Decision Trees,” IEEE, 2010 . 
4. Decision Trees for Business Intelligence and Data Mining: Using SAS Enterprise Miner “Decision TreesWhat Are They?” 
5. Weiss, S.H. and Indurkhya, N. (1998), Predictive Data Mining: A Practical Guide, Morgan Kaufmann Publishers, San Francisco, CA 
6. Bakshi, K.,(2012),” Considerations for big data: Architecture and approach” 
7. Mukherjee, A.; Datta, J.; Jorapur, R.; Singhvi, R.; Haloi, S.; Akram, W., (18-22 Dec.,2012) , “Shared disk big data analytics with Apache Hadoop”
8. Aditya B. Patel, Manashvi Birla, Ushma Nair ,(6-8 Dec. 2012),“Addressing Big Data Problem Using Hadoop and Map Reduce” 
9. Wei Fan and Albert Bifet “ Mining Big Data:Current Status and Forecast to the Future”,Vol 14,Issue 2,2013 
10. Algorithm and approaches to handle large Data-A Survey,IJCSN Vol 2,Issue 3,2013

Currently there are no Refbacks

Paper Title : Enabling Fine-grained Multi-keyword Search Supporting Classified Sub-dictionaries over Encrypted Cloud Data
Authors : G.Lucy, D.Jaya Narayana Reddy, R.Sandeep Kumar
Affiliations : Pursuing M.Tech, CSE Branch, Dept of CSE
Assistant Professor, Department of Computer Science and Engineering</br>Assistant Professor, Department of Computer Science and Engineering G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.
Abstract :

af

Utilizing Cloud Computing, people can store their information on remote servers and permit information access to open clients through the cloud servers. As the outsourced information are liable to contain touchy protection data, they are regularly scrambled before transferred to the cloud. This, on the other hand, altogether restrains the ease of use of outsourced information because of the trouble of seeking over the encoded information. In this paper, we address this issue by building up the fine-grained multi-watchword hunt plans over scrambled cloud information. Our unique commitments are three-fold. To begin with, we present the significance scores and inclination elements upon watchwords which empower the exact catchphrase seek and customized client experience. Second, we build up a handy and exceptionally effective multicatchphrase inquiry plan. The proposed plan can backing entangled rationale seek the blended "AND", "OR" and "NO" operations of catchphrases. Third, we further utilize the ordered sub-lexicons procedure to accomplish better proficiency on list building, trapdoor producing and question. Finally, we examine the security of the proposed plans as far as secrecy of reports, security assurance of file and trapdoor, and unlinkability of trapdoor. Through broad investigations utilizing this present reality dataset, we approve the execution of the proposed plans. Both the security examination and test results show that the proposed plans can accomplish the same security level contrasting with the current ones and better execution as far as usefulness, question multifaceted nature and effectiveness.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Searchable encryption, Multi-keyword, Secure Computation on Encrypted Database, Fine-grained, Cloud computing

G.Lucy,D.Jaya Narayana Reddy,R.Sandeep Kumar."Enabling Fine-grained Multi-keyword Search Supporting Classified Sub-dictionaries over Encrypted Cloud Data". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.919-923, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1220.pdf,

[1] H. Liang, L. X. Cai, D. Huang, X. Shen, and D. Peng, “An smdp-based service model for interdomain resource allocation in mobile cloud networks,” IEEE Transactions on Vehicular Technology, vol. 61, no. 5, pp. 2222–2232, 2012. 
[2] M. M. Mahmoud and X. Shen, “A cloud-based scheme for protecting source-location privacy against hotspot-locating attack in wireless sensor networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 10, pp. 1805–1818, 2012. 
[3] Q. Shen, X. Liang, X. Shen, X. Lin, and H. Luo, “Exploiting geo-distributed clouds for e-health monitoring system with minimum service delay and privacy preservation,” IEEE Journal of Biomedical and Health Informatics, vol. 18, no. 2, pp. 430–439, 2014. 
[4] T. Jung, X. Mao, X. Li, S.-J. Tang, W. Gong, and L. Zhang, “Privacy-preserving data aggregation without secure channel: multivariate poly-nomial evaluation,” in Proceedings of INFOCOM. IEEE, 2013, pp. 2634–2642. 
[5] Y. Yang, H. Li, W. Liu, H. Yang, and M. Wen, “Secure dynamic searchable symmetric encryption with constant document update cost,” in Proceedings of GLOBCOM. IEEE, 2014, to appear. 
[6] N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, “Privacy-preserving multi-keyword ranked search over encrypted cloud data,” IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 1, pp. 222–233, 2014. 
[7] https://support.google.com/websearch/answer/173 733?hl=en.
 [8] D. X. Song, D. Wagner, and A. Perrig, “Practical techniques for searches on encrypted data,” in Proceedings of S&P. IEEE, 2000, pp. 44–55. 
[9] R. Li, Z. Xu, W. Kang, K. C. Yow, and C.-Z. Xu, “Efficient multi-keyword ranked query over encrypted data in cloud computing,” Future Generation Computer Systems, vol. 30, pp. 179– 190, 2014.
[10] H. Li, D. Liu, Y. Dai, T. H. Luan, and X. Shen, “Enabling efficient multi-keyword ranked search over encrypted cloud data through blind storage,” IEEE Transactions on Emerging Topics in Computing, 2014, DOI10.1109/TETC.2014.2371239. 
[11] C. Wang, N. Cao, J. Li, K. Ren, and W. Lou, “Secure ranked keyword search over encrypted cloud data,” in Proceedings of ICDCS. IEEE, 2010, pp. 253–262.

Currently there are no Refbacks

Paper Title : Agent Based Interactions and Economic In an Intelligent Inter Cloud
Authors : K.Latha, D.Jaya Narayana Reddy, Dr.S.Prem Kumar
Affiliations : Pursuing M.Tech, CSE Branch, Dept of CSE
Assistant Professor, Department of Computer Science and Engineering</br>Professor & HOD, Department of computer science and engineering, G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.
Abstract :

af

- Cloud is an interrelated worldwide "wave of Clouds" that make likely every Cloud to take advantage of assets of different Clouds. This is the most punctual work to devise an operator’s based Inter Cloud financial model for investigating shopper to-Cloud and Cloud-to-Cloud connections. While economic experiences in the middle of shoppers and Cloud suppliers are displayed as a numerous to-numerous arrangement, financial experiences among Clouds are demonstrated as a coalition diversion. To reinforce numerous to-numerous customer to-Cloud transactions, this work devises a novel association convention and a novel arrangement technique that is portrayed by both 1) Adaptive concession rate (ACR) and 2) Minimally sufficient concession (MSC). Scientific confirmations demonstrate that specialists receiving the ACR-MSC methodology arrange ideally on the grounds that they make least measures of concession. Via naturally controlling concession rates, observational results demonstrate that the ACR-MSC methodology is proficient in light of the fact that it accomplishes fundamentally higher utilities than the altered concession-rate time-subordinate procedure. To encourage the development of Inter Cloud coalitions, this work devises a novel four-stage Cloud-to-Cloud communication protocols and an arrangement of novel systems for Inter Cloud operators. Scientific confirmations demonstrate that these Inter Cloud coalition arrangement systems. 1) Converge to a sub contentment perfect balance.2) Result in each Cloud operators in an Inter Cloud coalition getting a result that is equivalent to its Shapley regard.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Minimally sufficient concession, Adaptive concession rate, Inter Cloud operators.

K.Latha,D.Jaya Narayana Reddy,Dr.S.Prem Kumar."Agent Based Interactions and Economic In an Intelligent Inter Cloud". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.913-918, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1219.pdf,

[1] M. Armbrust et al. Above the clouds: A Berkeley view of cloud computing. Tech. Rep. UCB/EECS‐2009‐28, EECS Department, U.C. Berkeley, Feb 2009. 
[2] D. Bernstein et al. Blueprint for the Intercloud ‐ Protocols and Formats for Cloud Computing Interoperability. Proc. 4th Int. Conf. Internet and Web Applications and Services pp. 328–336., Venice, May 2009.
 [3] M. Wooldridge, An Introduction to Multiagent Systems, John Wiley & Sons, 2002. 
[4] K. M. Sim. “Agent‐based Cloud Computing,” IEEE Transactions on Services Computing. vol. 5, no. 4, Oct.‐Dec., 2012, pp. 564‐577. 
[5] K. M. Sim, Complex and concurrent negotiations for multiple interrelated e‐markets, IEEE Trans. Cybernet. 43 (1), pp. 230–245,2013. 
[6] S. Son and K. M. Sim, A price‐timeslot negotiation for cloud service reservation, IEEE Trans. Syst. Man Cybernet. B 42 (3), pp.713–728, 2012.
[7] J. O. Gutierrez‐Garcia and K. M. Sim, Agent‐based cloud service composition, Appl. Intell. 38 (3), pp. 436– 464, 2013. 
[8] J. O. Gutierrez‐Garcia and K. M. Sim, Family of heuristics for agent‐based elastic cloud bag‐of‐tasks concurrent scheduling, Future Generat. Comput. Syst. 29 (7), pp. 1682–1699, 2013. 
[9] J. O. Gutierrez‐Garcia and K. M. Sim, Agent‐based cloud workflow execution, Integr. Comput. Aided Eng. 19 (1), pp.39–56, 2012.
[10] J. Kang and K. M. Sim, Cloudle: a multi‐criteria cloud servicesearch engine, Proc. IEEE Asia‐Pacific Services Comput. Conf., pp. 339–346, 2010.
 [11] K. M. Sim. Cloud Intelligence: Agents within an InterCloud.Awareness Magazine. http://www.awareness‐mag.eu/pdf/005153/005153.pdf 
[12] R. Buyya et al. InterCloud: utility‐oriented federation of cloud computing environments for scaling of application services. Proc. 10th int. conf. Algorithms and Architectures for Parallel Processing ‐ Volume Part I. pp. 13‐31, 2010.
 [13] David Bernstein et al. An Intercloud Cloud Computing Economy ‐ Technology, Governance, and Market Blueprints. Proc. 2011 Annual SRII Global Conference, pp.293‐299, San Jose, CA. 
[14]http://cloudcomputing.ieee.org/intercloud (accessed on Dec. 30,2013).

Currently there are no Refbacks

Paper Title : Secure Distributed Deduplication Systems with Improved Reliability
Authors : C.Kavitha Sree, CH.Shashikala, Dr.S.Prem Kumar
Affiliations : Pursuing M.Tech, CSE Branch, Dept of CSE
Assistant Professor, Department of Computer Science and Engineering</br>Professor & HOD, Department of computer science and engineering, G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.
Abstract :

af

Data deduplication is a method for removing duplicate copies of data, and has been extensively used in cloud storage to decrease storage space and upload bandwidth. On the other hand, there is only one copy for each file stored in cloud even if such a file is owned by a huge number of users. Accordingly, deduplication system progress storage utilization while reducing reliability. In addition, the dare of privacy for sensitive data also take place when they are outsourced by users to cloud. Planning to address the above security test, this paper constructs the first effort to celebrate the idea of scattered reliable deduplication system. This paper recommends a new distributed deduplication systems with upper dependability in which the data chunks are distributed from corner to cornering multiple cloud servers. The safety needs of data privacy and tag stability are also accomplish by introducing a deterministic secret sharing scheme in distributed storage systems, instead of using convergent encryption as in previous deduplication systems.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Deduplication, secret sharing, distributed storage system, reliability

C.Kavitha Sree,CH.Shashikala,Dr.S.Prem Kumar."Secure Distributed Deduplication Systems with Improved Reliability". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.908-912 , December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1281.pdf,

[1] J. Gantz and D. Reinsel, “The digital universe in 2020: Bigdigital shadows and biggest growth in the fareast,” http://www.emc.com/collateral/analystreports/idcthe-digital-universe-in-2020.pdf, Dec 2012. 
[2] M. O. Rabin, “Fingerprinting by random polynomials,” Center for Research in Computing Technology, Harvard University, Tech.Rep. Tech. Report TR-CSE-03-01, 1981. 
[3] J. R. Douceur, A. Adya, W. J. Bolosky, D. Simon, and M. Theimer,“Reclaiming space from duplicate files in a serverless distributed file system.” in ICDCS, 2002, pp. 617–624. 
[4]M. Bellare, S. Keelveedhi, and T. Ristenpart, “Dupless: Server-aided encryption for deduplicated storage,” in USENIX Security Symposium, 2013. 
[5] “Message-locked encryption and secure deduplication,” in EUROCRYPT, 2013, pp. 296–312. 
[6]G. R. Blakley and C. Meadows, “Security of ramp schemes,” in Advances in Cryptology: Proceedings of CRYPTO ’84, ser. Lecture Notes in Computer Science, G. R. Blakley and D. Chaum, Eds.Springer-Verlag Berlin/Heidelberg, 1985, vol. 196, pp. 242–268. 
[7]A. D. Santis and B. Masucci, “Multiple ramp schemes,” IEEE Transactions on Information Theory, vol. 45, no. 5, pp. 1720–1728,Jul. 1999. 
[8]M. O. Rabin, “Efficient dispersal of information for security, load balancing, and fault tolerance,” Journal of the ACM, vol. 36, no. 2,pp. 335–348, Apr. 1989. 
[9]A. Shamir, “How to share a secret,” Commun. ACM, vol. 22, no. 11,pp. 612–613, 1979. 
[10]J. Li, X. Chen, M. Li, J. Li, P. Lee, and W. Lou, “Secure deduplica-tion with efficient and reliable convergent key management,” in IEEE Transactions on Parallel and Distributed Systems, 2014, pp. vol.25(6), pp. 1615–1625. 
[11] S. Halevi, D. Harnik, B. Pinkas, and A. ShulmanPeleg, “Proofs of ownership in remote storage systems.” in ACM Conference on Computer and Communications Security, Y. Chen, G. Danezis, and V. Shmatikov, Eds. ACM, 2011, pp. 491–500. 
[12]J. S. Plank, S. Simmerman, and C. D. Schuman, “Jerasure: A library in C/C++ facilitating erasure coding for storage applications - Version 1.2,” University of Tennessee, Tech. Rep. CS-08-627,August 2008.
[13] J. S. Plank and L. Xu, “Optimizing Cauchy Reed-solomon Codes for fault-tolerant network storage applications,” in NCA-06: 5th IEEE International Symposium on Network Computing Applications,Cambridge, MA, July 2006. 
[14] C. Liu, Y. Gu, L. Sun, B. Yan, and D. Wang, “Radmad: High reliability provision for large-scale deduplication archival storage systems,” in Proceedings of the 23rd international conference on Supercomputing, pp. 370–379.

Currently there are no Refbacks

Paper Title : Query Aware Determinization of Uncertain Objects
Authors : P.Jhancy, K.Lakshmi , Dr.S.Prem Kumar
Affiliations : Pursuing M.Tech, CSE Branch, Dept of CSE
Assistant Professor, Department of Computer Science and Engineering</br>Professor & HOD, Department of computer science and engineering, G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.
Abstract :

af

The main aim of this paper is to think about the trouble of determining probabilistic data to allow such data to be stored in legacy systems that agree only deterministic input. Probabilistic data may be produced by mechanized data analysis methods such as entity resolution, information extraction, and speech processing etc. The target is to make a deterministic depiction of probabilistic data that optimizes the excellence of the end-application built on deterministic data. We discover such a determinization problem in the background of two dissimilar data processing jobs – selection and triggers queries. Here approaches such as thresholding or top-1 selection usually used for determinization lead to suboptimal presentation for such applications. As an alternative, we expand a query-aware strategy and demonstrate its rewards over existing solutions through a complete empirical evaluation over real and synthetic datasets.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


uncertain data, query workload, data quality, branch and bound algorithm.

P.Jhancy,K.Lakshmi,Dr.S.Prem Kumar."Query Aware Determinization of Uncertain Objects". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.904-907, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1217.pdf,

[1] D. V. Kalashnikov, S. Mehrotra, J. Xu, and N. Venkatasubramanian, “A semantics-based approach for speech annotation of images,” TKDE’11. 
[2] J. Li and J. Wang, “Automatic linguistic indexing of pictures by a statistical modeling approach,” PAMI’03. 
[3] C. Wangand, F. Jing, L. Zhang, and H. Zhang, “Image annotation refinement using random walk with restarts,” ACM Multimedia’06. 
[4] B. Minescu, G. Damnati, F. Bechet, and R. de Mori, “Conditional use of word lattices, confusion networks and 1-best string hypotheses in a sequential interpretation strategy,” ICASSP’07.
 [5] R. Nuray-Turan, D. V. Kalashnikov, S. Mehrotra, and Y. Yu, “Attribute and object selection queries on objects with probabilistic attributes,” ACM TODS’11. 
[6] J. Li and A. Deshpande, “Consensus answers for queries over proba-bilistic databases,” PODS’09. 
[7] M. B. Ebarhimi and A. A. Ghorbani, “A novel approach for frequent phrase mining in web search engine query streams,” CNSR ’07.
 [8] S. Bhatia, D. Majumdar, and P. Mitra, “Query suggestions in the absence of query logs,” SIGIR ’11. 
[9] C. Manning and H. Schutze, Foundations of Statistical Natural Lan-guage Processing. MIT Press, 1999. 
[10] D. V. Kalashnikov and S. Mehrotra, “Domainindependent data cleaning via analysis of entityrelationship graph,” ACM TODS’06. 
[11] K. Schnaitter, S. Abiteboul, T. Milo, and N. Polyzotis, “On-line index selection for shifting workloads,” SMDB’07.
 [12] P. Unterbrunner, G. Giannikis, G. Alonso, D. Fauser, and D. Kossmann, “Predictable performance for unpredictable workloads,” VLDB’09. 
[13] R. Cheng, J. Chen, and X. Xie, “Cleaning uncertain data with quality guarantees,” PVLDB’08. V. Jojic, S. Gould, and D. Koller, “Accelerated dual decomposition for map inference,” ICML ’1

Currently there are no Refbacks

Paper Title : Anti Theft Tracking and Controlling Of Vehicle According Us
Authors : G.Prasanthi, A.Somasekhar,
Affiliations : Dept of Electronics & Communication Engineering, Priyadarshini Institute of Technology & Sciences, Tenali
Associate Professor Dept of Electronics & Communication Engineering, Priyadarshini Institute of Technology & Sciences, Tenali
Abstract :

af

In MS Word 2007 used to layout altered, and it spared as “word 97-2003” for the PC, finishes creators with a large portion of the organizing determination required for get ready electronic rendition of their papers. Paper segments have been indicates for three reasons: 1. Usability when organizing singular papers. 2. Programmed consistence to electronic necessities that encourage the simultaneous or later generation of electronic items. 3. Congruity of style all through gathering procedures. A few parts, for example, multi-leveled mathematical statements, design, and tables are not endorsed, despite the fact that the different table content styles are given. The Formatter should make these parts, fusing the relevant criteria that take after.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED



G.Prasanthi,A.Somasekhar."Anti Theft Tracking and Controlling Of Vehicle According Us". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.898-903 , December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1216.pdf,

1] A. El-Sawah, N. Georganas, and E. Petriu, "A model for 3-D handtracking and motion estimation," IEEE Trans. Instrum. Meas., vol. 57,no. 8, pp. 1627–1636, Aug. 2008. 
[2] D. G. Lowe, "Particular picture highlights from scale-invariant keypoints," Int. J. Comput. Vis., vol. 60, no. 2, pp. 91–110, Nov. 2004 
[3] A. Bosch, X. Munoz, and R. Marti, "Which is the most ideal approach to sort out/group pictures by substance?" Image Vis. Comput., vol. 25, no. 6, pp. 778– 791, Jun. 2007. 
[4] H. Zhou and T. Huang, "Following enunciated hand movement with Eigen progress examination," in Proc. Int. Conf. Comput. Vis., 2003, vol. 2, pp. 1102–1109.
[5] B. Stenger, "Layout based hand posture acknowledgment utilizing different signals," in Proc. seventh ACCV, 2006, pp. 551–560. 
[6] L. Bretzner, I. Laptev, and T. Lindeberg, "Hand motion acknowledgment utilizing multiscale shading components, hieracrchichal models and molecule separating," in Proc. Int. Conf. Autom. Face Gesture Recog., Washington, DC, May 2002.

Currently there are no Refbacks

Paper Title : Distance and Speed Calculation of Planes & Automobiles
Authors : B.Manogna , A.Somasekhar,
Affiliations : Dept of Electronics & Communication Engineering , Priyadarshini Institute of Technology & Sciences, Tenali
Assistant professor Dept of Electronics & Communication Engineering , Priyadarshini Institute of Technology & Sciences, Tenali
Abstract :

af

The main purpose of this project on board dat aquisiton for vehicles uisng Advanced risc machine controller, now a days the data aquisiton especially plays an important role vehicles an military applications to monitor and control the activiteis .Here in this project we are including ultrasonic sensor which can detect and measure the distance of the vehicles,give to the controller so based on that we can estimate the and secure or protect the required things,if any object comes near to our vhicle it will detect gives an indication, while moving that time any object hit us it automaticlly stops the vehicle, here the vibration sensor detect the vibration and sends data to the Arm controller then Arm perfoms specfic functins and automatically stops the vehicle .Here we have one liquid crystal display it will displays everthing like obstacle distance ranges ,pressure etc
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


parts; pressure sensor, ultrasonic sensor, temperature sensor, Arm board..

B.Manogna ,A.Somasekhar."Distance and Speed Calculation of Planes & Automobiles". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.891-897, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1215.pdf,

1] A. El-Sawah, N. Georganas, and E. Petriu, "A model for 3-D handtracking and signal estimation," IEEE Trans. Instrum. Meas., vol. 57,no. 8, pp. 1627–1636, Aug. 2008. 
[2] D. G. Lowe, "Unmistakable picture highlights from scale-invariant keypoints," Int. J. Comput. Vis., vol. 60, no. 2, pp. 91–110, Nov. 2004 
[3] A. Bosch, X. Munoz, and R. Marti, "Which is the most ideal approach to sort out/group pictures by substance?" Image Vis. Comput., vol. 25, no. 6, pp. 778– 791, Jun. 2007. 
[4] H. Zhou and T. Huang, "Following enunciated hand movementwith Eigen flow examination," in Proc. Int. Conf. Comput. Vis., 2003, vol. 2, pp. 1102–1109. 
[5] B. Stenger, "Layout based hand posture acknowledgment utilizing numerous prompts," in Proc. seventh ACCV, 2006, pp. 551–560. 
[6] L. Bretzner, I. Laptev, and T. Lindeberg, "Hand motion acknowledgment utilizing multiscale shading components, hieracrchichal models and molecule separating," in Proc. Int. Conf. Autom. Face Gesture Recog., Washington, DC, May 2002.
 [7] A. Argyros and M. Lourakis, "Vision-based understanding of hand signals for remote control of a PC mouse," in Proc. Workshop Comput.Human Intera

Currently there are no Refbacks

Paper Title : GSM Calculating the System of Automobiles in Their Safety Way
Authors : Y.Madhuri, G.Chennakesavulu,
Affiliations : Dept of Electronics & Communication Engineering , Priyadarshini Institute of Technology & Sciences, Tenali
Assistant professor Dept of Electronics & Communication Engineering , Priyadarshini Institute of Technology & Sciences, Tenali
Abstract :

af

Microcontroller based advanced framework has been intended to screen the fuel level and aggregate sum of burden on the vessel. No heap, ideal burden And over burden are the three distinctive tanker burden levels.It stays in no heap status at introduction level when burden increments and still stay in ideal level then the framework inform groups to start voyage. When the heap increments to over burden then the framework gives caution and sends ready message to the control tower for important activity. The correspondence between the vessel and fundamental control tower is finished by GSM module to guarantee long separation solid correspondence. The tanker fuel level is observed in simple and computerized scale for the enhancements.Here in this task the vehicle fuel level demonstrating by the showcase and the signal sound, furthermore the over burden, of a vehicle which can be utilized identifies and demonstrates the outcomes.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED



Y.Madhuri,G.Chennakesavulu."GSM Calculating the System of Automobiles in Their Safety Way". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.885-890 , December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1214.pdf,

1] A. El-Sawah, N. Georganas, and E. Petriu, "A model for 3-D handtracking and motion estimation," IEEE Trans. Instrum. Meas., vol. 57,no. 8, pp. 1627–1636, Aug. 2008. 
[2] D. G. Lowe, "Particular picture highlights from scaleinvariant keypoints," Int. J. Comput. Vis., vol. 60, no. 2, pp. 91–110, Nov. 2004 
[3] A. Bosch, X. Munoz, and R. Marti, "Which is the most ideal approach to sort out/group pictures by substance?" Image Vis. Comput., vol. 25, no. 6, pp. 778–791, Jun. 2007. 
[4] H. Zhou and T. Huang, "Following verbalized hand movement with Eigen flow examination," in Proc. Int. Conf. Comput. Vis., 2003, vol. 2, pp. 1102–1109. 
[5] B. Stenger, "Layout based hand posture acknowledgment utilizing different signals," in Proc. seventh ACCV, 2006, pp. 551–560.

Currently there are no Refbacks

Paper Title : Pure and Impurity Water Monitoring In All Accepts
Authors : T.Lakshman, A.Naga Lavanya,
Affiliations : Dept of Electronics & Communication Engineering , Priyadarshini Institute of Technology & Sciences, Tenali.
Assistant professor Dept of Electronics & Communication Engineering , Priyadarshini Institute of Technology & Sciences, Tenali
Abstract :

af

Most critical substances on the earth are the abstract water. Postulation is utilized to characterize the water observing frameworks. Some examples of that is Tank water detecting checking, water contamination checking. We can maintain a strategic distance from the gigantic measure of water by utilizing wireless sensor technology. To demonstrate the level of water in the tank to specialists the PID microcontroller based water level observing is utilized. To check the water quality by utilizing these parameter, sensor based water pollution detection is used. Examples are the PH level, pressure, water level sensor and observe by a specialist. To observing framework utilizing and keep the water by utilize advanced everyday life gadget like portable workstation. Here we are using ph sensor for measuring the level of water quality and dampness sensor additionally.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED



."Pure and Impurity Water Monitoring In All Accepts". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.880-884 , December - 2015,

1] A. El-Sawah, N. Georganas, and E. Petriu, "A model for 3-D handtracking and motion estimation," IEEE Trans. Instrum. Meas., vol. 57,no. 8, pp. 1627–1636, Aug. 2008. 
[2] D. G. Lowe, "Particular picture highlights from scale-invariant keypoints," Int. J. Comput. Vis., vol. 60, no. 2, pp. 91–110, Nov. 2004 
[3] A. Bosch, X. Munoz, and R. Marti, "Which is the most ideal approach to sort out/group pictures by substance?" Image Vis. Comput., vol. 25, no. 6, pp. 778–791, Jun. 2007. 
[4] H. Zhou and T. Huang, "Following verbalized hand movement with Eigen flow examination," in Proc. Int. Conf. Comput. Vis., 2003, vol. 2, pp. 1102– 1109. 
[5] B. Stenger, "Layout based hand posture acknowledgment utilizing different signals," in Proc. seventh ACCV, 2006, pp. 551–560. 
[6] L. Bretzner, I. Laptev, and T. Lindeberg, "Hand signal acknowledgment utilizing multiscale shading elements, hieracrchichal models and molecule separating," in Proc. Int. Conf. Autom. Face Gesture Recog., Washington, DC, May 2002.
 [7] A. Argyros and M. Lourakis, "Vision-based elucidation of hand motions for remote control of a PC mouse," in Proc. Workshop Comput.H

Currently there are no Refbacks

Paper Title : Controlling the Applications through the Android Mobile
Authors : J.Krupachary, K.Krishna Mohan,
Affiliations : Dept of Electronics & Communication Engineering , Priyadarshini Institute of Technology & Sciences, Tenali.
Assistant professor Dept of Electronics & Communication Engineering , Priyadarshini Institute of Technology & Sciences, Tenali.
Abstract :

af

Now a days embedded technology plays an important role in our daily life. These applications ease everyday existence of a typical man. The main purpose of this project Home Automation using through the wifi(wires less fidelity ) . In this paper, we propose configuration and model execution of home mechanization framework that uses Wi-Fi innovation and Android working framework. An attractive business sector for Home Automation Framework is for occupied families and people with physical confinements. Clients can control electrical machines in home or office through advanced mobile phone. Application will likewise give secure notices and alert to Burglary, fire dangers. This undertaking goes for controlling each event at home or office on your fingers. Here in this undertaking we are proposing the wifi module and heaps of electrical apparatuses .so by utilizing android versatile and the backing of the android application we are controlling the heaps furthermore we can control every one of the applications that we expected to the home or other specific spots.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED



J.Krupachary,K.Krishna Mohan."Controlling the Applications through the Android Mobile". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.873-879 , December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1212.pdf,

1] A. El-Sawah, N. Georganas, and E. Petriu, "A model for 3-D handtracking and motion estimation," IEEE Trans. Instrum. Meas., vol. 57,no. 8, pp. 1627–1636, Aug. 2008.
 [2] D. G. Lowe, "Particular picture highlights from scale-invariant keypoints," Int. J. Comput. Vis., vol. 60, no. 2, pp. 91–110, Nov. 2004 
[3] A. Bosch, X. Munoz, and R. Marti, "Which is the most ideal approach to sort out/group pictures by substance?" Image Vis. Comput., vol. 25, no. 6, pp. 778– 791, Jun. 2007. 
[4] H. Zhou and T. Huang, "Following verbalized hand movement with Eigen flow examination," in Proc. Int. Conf. Comput. Vis., 2003, vol. 2, pp. 1102–1109. 
[5] B. Stenger, "Layout based hand posture acknowledgment utilizing different signals," in Proc. seventh ACCV, 2006, pp. 551–560. 
[6] L. Bretzner, I. Laptev, and T. Lindeberg, "Hand signal acknowledgment utilizing multiscale shading elements, hieracrchichal models and molecule separating," in Proc. Int. Conf. Autom. Face Gesture Recog., Washington, DC, May 2002. 
[7] A. Argyros and M. Lourakis, "Vision-based elucidation of hand motions for remote control of a PC mouse," in Proc. Workshop Comput.H

Currently there are no Refbacks

Paper Title : Implementing CP-ABE Scheme for Decentralized Disruption-Tolerant Military Networks
Authors : N.Anjali, A.Harshavardhan,
Affiliations : M.Tech (CSE), Priyadarshini Institute of Technology & Science for women’s
Assistant Professor ( Dept.of CSE), Priyadarshini Institute of Technology & Science for Women’s
Abstract :

af

Compact centre points in sure circumstances, as an example, a forefront or a hostile region area unit indebted to expertise the evil impacts of broken framework system and never-ending bundles. Intrusion tolerant framework (DTN) progressions have gotten the chance to be productive plans that enable remote contraptions passed on by troopers to speak victimization on an individual basis and provides permission to personal proof or charge unfailingly abuse outside limit centre points. Irrefutably the foremost hard problems during this circumstance area unit the approval of endorsement methodologies and their courses of action plan for secure knowledge convalescence. Figure content methodology property provides coding promise rejoinder to channel mechanism topics. Regardless, of topics to use for CP-ABE in localized Intrusion tolerant framework (DTN) presents some security and insurance difficulties regarding the standard disclaimer, fake, and direction of qualities assigned from clear forces. we have a tendency to suggest AN ensured knowledge convalescence arrangement victimization the talent for distributed DTNs anyplace varied key forces fare their dangers self-sufficiently. we offer security to {the knowledge the info the information} that we've sent victimization distributed data. it's utilized in secure transmission of information for nations defence
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Access control, attribute-based encryption (ABE), disruption-tolerant network (DTN), multiauthority, secure data retrieval.

N.Anjali,A.Harshavardhan."Implementing CP-ABE Scheme for Decentralized Disruption-Tolerant Military Networks". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.868-872, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1211.pdf,

[1] J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, “Maxprop: Routing for vehicle-based disruption tolerant networks,” in Proc.IEEE INFOCOM, 2006, pp. 1–11. 
[2] M. Chuah and P. Yang, “Node density-based adaptive routing scheme for disruption tolerant networks,” in Proc. IEEE MILCOM, 2006, pp.1–6. 
[3] S. Roy and. Chuah, “Secure data retrieval based on ciphertext policy attribute-based encryption (CPABE) system for the DTNs,” Lehigh CSE Tech. 
[4] M. Chuah and P. Yang, “Performance evaluation of content-based information retrieval schemes for DTNs,” in Proc. IEEE MILCOM, 2007, pp. 1–7. 
[5] M. Kallahalla, E. Riedel, R. Swaminathan, Q. Wang, and K. Fu, “Plutus: Scalable secure file sharing on untrusted storage,” in Proc.Conf. File Storage Technol., 2003, pp. 29–42. 
[6] L. Ibraimi, M. Petkovic, S. Nikova, P. Hartel, and W. Jonker, “Mediated ciphertext-policy attributebased encryption and its application,” in Proc. WISA, 2009, LNCS 5932, pp. 309–323. 
[7] N. Chen, M. Gerla, D. Huang, and X. Hong, “Secure, selective group broadcast in vehicular networks using dynamic attribute based encryption,” In Proc. Ad Hoc Netw. Workshop, 2010, pp. 1–8.
[8] D. Huang and M. Verma, “ASPE: Attribute-based secure policy enforcement in vehicular ad hoc networks,” Ad Hoc Netw., vol. 7, no. 8, pp. 1526–1535, 2009.
 [9] A. Lewko and B. Waters, “Decentralizing attribute-based encryption,” Cryptology e-Print Archive: Rep. 2010/351, 2010. 
[10] A. Sahai and B. Waters, “Fuzzy identity-based encryption,” in Proc. Eurocrypt, 2005, pp. 457–473.
 [11] V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-based encryption for fine-grained access control of encrypted data,” in Proc.ACM Conf. Comput. Commun. Security, 2006, pp. 89–98.

Currently there are no Refbacks

Paper Title : Efficient Network Recovery Scheme for a node or Link failure using Multiple Standard Routing Configurations
Authors : Sambi Reddy Kalli, Dr G Rama Swamy,
Affiliations : M.Tech (CSE), Priyadarshini Institute of Technology & Science
Professor ( Dept.of CSE), Priyadarshini Institute of Technology & Science
Abstract :

af

As the Internet takes an increasingly central role in our communications infrastructure; the slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failures in IP networks, we present a new recovery scheme called Multiple Routing Configurations (MRC). Our proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism to handle both link and node failures, and without knowing the root cause of the failure. MRC is strictly connectionless, and assumes only destination based hop-by hop forwarding. MRC is based on keeping additional routing information in the routers, and allows packet forwarding to continue on an alternative output link immediately after the detection of a failure. It can be implemented with only minor changes to existing solutions. In this paper we present MRC, and analyze its performance with respect to scalability, backup path lengths, and load distribution after a failure. We also show how an estimate of the traffic demands in the network can be used to improve the distribution of the recovered traffic, and thus reduce the chances of congestion when MRC is used.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Networks Protocols, Routing Protocols, Reliability, Protection

Sambi Reddy Kalli,Dr G Rama Swamy."Efficient Network Recovery Scheme for a node or Link failure using Multiple Standard Routing Configurations". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.862-866, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1210.pdf,

[1] S. Bryant, M. Shand, and S. Previdi, “IP fast reroute using not-via addresses,” Internet Draft (work in progress), draft-ietf-rtgwgpfrrnotvia-addresses-01, Jun. 2007. 
[2] P. Francois, M. Shand, and O. Bonaventure, “Disruption free topology reconfiguration in OSPF networks,” in Proc. IEEE INFOCOM, Anchorage, AK, May 2007, pp. 89–97. 
[3] Amund Kvalbein and Audun Fosselie Hansen, Multiple Routing Configurations for Fast IP Network Recovery, in IEEE, VOL. 17, NO. 2, APRIL 2009. 
[4] Relaxed multiple routing configurations for IP fast reroute . Cicic, Tarik ; Hansen, A.F, Publication Year: 2008. 
[5] Relaxed multiple routing configurations: IP fast reroute for single and correlated failures, Kvalbein, Amund, Publication Year: 2009. 
[6] Optimality Principle Based Sink Tree Methodology for Adaptive Static Routing Using Multiple Route Configuration Scheme, Johal, Hartinder Singh, Publication Year: 2008. 
[7] Post-Failure Routing Performance with Multiple Routing Configurations, Kvalbein, Amund, Publication Year: 2007 
[8] On network traffic concentration and updating interval for proactive recovery method against largescale network failures, Kamei, Satoshi.
 [9] Minimum Backup Configuration-Creation Method for IP Fast Reroute ,Pelsser, Cristel, Publication Year: 2009 
[10] Transport Capacity for Wireless Networks with Multi-User Links, Peel, Christian B. Wireless Communications, IEEE Transactions on Volume:11,Issue: 6, Publication Year: 2012

Currently there are no Refbacks

Paper Title : Enhanced Dynamic Secure group Sharing Using OTP in Public Cloud
Authors : Y. Rajesh Babu, U.Usha Rani,
Affiliations : M.Tech (CSE), Priyadarshini Institute of Technology & Science
Associate Professor ( Dept.of CSE), Priyadarshini Institute of Technology & Science
Abstract :

af

- In cloud computing outsourcing, cluster quality among cloud shoppers could be a noteworthy check, thus cloud computing offers a token effort and everyone around sorted out the arrangement. Thanks to incessant modification of participation, sharing info during a exceedingly in a very} multi-owner manner to an un-trusted cloud continues to be its testing issue. During this paper, we tend to planned a protected multi-owner info sharing arrange for a dynamic cluster in folks, in general, cloud. By furnishing AES cryptography with convergent key whereas transferring the data, any cloud shopper will safely impart info to others. Within the in the meantime, the capability overhead and cryptography calculation expense of the arrange area unit free with the number of disowned shoppers. Also, I break down the protection of this arrange with thorough confirmations. One-Time Secret word is one in all the best and most well-known varieties of confirmation which will be utilized for securing access to accounts. One-Time Passwords area unit oftentimes alluded to as secure and a lot of grounded varieties of confirmation in an exceedingly multi-owner manner. Broad security and execution examination demonstrates that our planned arrange is deeply productive and fulfills the protection requirements for open cloud-based secure cluster sharing.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Cloud computing, broadcast encryption.

Y. Rajesh Babu,U.Usha Rani."Enhanced Dynamic Secure group Sharing Using OTP in Public Cloud". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.856-861, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1209.pdf,

[1] L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan, “Group formation in large social networks: membership, growth, and evolution,” in ACM SIGKDD2006: Proc. 12th international conference on Knowledge discovery and data mining. ACM, 2006, pp. 44–54. 
[2] A. T. Sherman and D. A. McGrew, “Key establishment in large dynamic groups using one-way function trees,” IEEE Transactions on Software Engineering, vol. 29, no. 5, pp. 444–458, 2003. 
[3] C. K. Wong, M. Gouda, and S. S. Lam, “Secure group communications using key graphs,” IEEE-ACM Transactions on Networking, vol. 8, no. 1, pp. 16–30, 2000. 
[4] M. Steiner, G. Tsudik, and M. Waidner, “Key agreement in dynamic peer groups,” IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 8, pp. 769–780, 2000. 
[5] Y. Kim, A. Perrig, and G. Tsudik, “Group key agreement efficient in communication,” IEEE Transactions on Computers, vol. 53, no. 7, pp. 905– 921, 2004. 
[6] W. Yu, Y. Sun, and K. R. Liu, “Optimizing the rekeying cost for contributory group key agreement schemes,” IEEE Transactions on Dependable and Secure Computing, vol. 4, no. 3, pp. 228–242, 2007. 
[7] W. Trappe, Y. Wang, and K. R. Liu, “Resourceaware conference key establishment for heterogeneous networks,” IEEE-ACM Transactions on Networking, vol. 13, no. 1, pp. 134–146, 2005. 
[8] Y. Kim, A. Perrig, and G. Tsudik, “Tree-based group key agreement,” ACM Transactions on Information and System Security (TISSEC), vol. 7, no. 1, pp. 60–96, 2004. 
[9] V.Sathana, J.Shanthini” Enhanced Security System for Dynamic Group in Cloud” International Journal of Advanced Research in Computer Science and Software Engineering, Volume 4, Issue 3, March 2014

Currently there are no Refbacks

Paper Title : A Novel Architecture for Matching the Data Protected With an Error-Correcting Code (ECC)
Authors : Sk.Parvin Bhano, T.Vineela,
Affiliations : (M.Tech) –VLSI & ES, Dept of ECE, Vasireddy Venkatadri Institute of Technology (VVIT),
Assistant Professor, Dept of ECE, Vasireddy Venkatadri Institute of Technology (VVIT), Nambur (V), Guntur(Dt),Andhra Pradesh, India.
Abstract :

af

In this paper we presented a novel architecture for matching the data protected with an Error-Correcting Code (ECC) which proposed to reduce latency and complexity where Data comparison is widely used in computing system to perform so many operations. Where incoming information is needs to be compared with a piece of stored data to locate the matching entry. If both incoming bits and stored bits are matching means there is no error if mismatched means some type of error will occur like random error or burst error. To detect and correct the error here error correcting codes are used. To further reduce the latency and complexity, in addition, a new butterfly-formed weight accumulator (BWA) is proposed for the efficient computation of the Hamming distance and also demonstrates LDPC coding and decoding for Error Correcting Codes further more examines whether the incoming data matches the stored data if a certain number of burst errors are corrected.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Low Power and Low Complexity in Chip, Systematic Error Correcting Code

Sk.Parvin Bhano,T.Vineela."A Novel Architecture for Matching the Data Protected With an Error-Correcting Code (ECC)". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.849-855, December - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1207.pdf,

[1] Byeong Yong Kong, Jihyuck Jo, Hyewon Jeong, Mina Hwang,Soyoung Cha, Bongjin Kim, and InCheol Park “Low-Complexity Low-Latency Architecture for Matching Of Data EncodedWith Hard Systematic ErrorCorrecting Codes” IEEE transactions on (vlsi) systems, vol. 22, no. 7, July 2014 
[2] J. D. Warnock, Y.-H. Chan, S. M. Carey, H. Wen, P. J. Meaney, G. Gerwig and W. V. Huott “Circuit and physical design implementation of the microprocessor chip for the Enterprise system,” IEEE J. Solid-State Circuits, vol. 47, no. 1, pp. 151– 163, Jan. 2012. 
[3].W. Wu, D. Somasekhar, and S.-L. Lu, “Direct compare of information coded with error-correcting codes,” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 20, no. 11, pp. 2147– 2151, Nov. 2012. 
[4].S. Lin and D. J. Costello, Error Control Coding: Fundamentals and Applications, 2nd ed. Englewood Cliffs, NJ, USA: Prentice-Hall, 2004.
 [5] Y. Lee, H. Yoo, and I.-C. Park, “6.4Gb/s multithreaded BCH encoder and decoder for multichannel SSD controllers,” in ISSCC Dig. Tech. Papers, 2012, pp. 426–427 .
[6] M. Tremblay and S. Chaudhry, “A thirdgeneration 65nm 16-core 32-thread plus 32- scoutthread CMT SPARC processor,” in ISSCC. Dig. Tech. Papers, Feb. 2008, pp. 82–83. 
[7] H. Ando, Y. Yoshida, A. Inoue, I. Sugiyama, T. Asakawa, K. Morita, T. Muta, and T. Motokurumada, S. Okada, H. Yamashita, and Y. Satsukawa, “A 1.3 GHz fifth generation SPARC64 microprocessor,” in IEEE ISSCC. Dig. Tech. Papers, Feb. 2003, pp. 246–247

Currently there are no Refbacks

Paper Title : A Novel Design for Encoding and Decoding to Minimize Crosstalk in VLSI Circuits
Authors : J.Prema, Akash Venkatachalam,
Affiliations : M.Tech
B.Tech SRM UNIVERSITY
Abstract :

af

In the developing world much know-how are growing faster and faster as they are becoming reduced, one such is the very large scale integrated design-VLSI. Many trials are faced in VLSI, among them is the crosstalk frequency. Global buses in deep-submicron (DSM) system-on-chip designs Ingest noteworthy extents of power, have large transmission interruptions and are prone to errors due to DSM noise-crosstalk. Owing to this, crosstalk manifestation on long on-chip buses is progressively becoming a limiting factor in high-speed designs. Crosstalk among nearby wires on the bus may create a remarkable portion of the transmission delay. Placing a guard wire between each signal wire assuages the crosstalk problem but doubles the area used by the bus, which is an objectionable concern. Instead, it is proposed to employ data encoding and decoding for special codes called boundary shift codes to abate crosstalk inside a bus.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


VLSI, Deep-Submicron (DSM) system, Crosstalk, Hamming code, Encoder and Decoder

J.Prema,Akash Venkatachalam."A Novel Design for Encoding and Decoding to Minimize Crosstalk in VLSI Circuits". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.842-848, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1206.pdf,

[1] Victor, B. and K. Keutzer, ‚Bus encoding to prevent crosstalk delay‛. Proc. IEEE/ACM Intl. Conf. on Computer Aided Design, pp: 57-69. 2001.
 [2] Ketann, Patel AndIgorl and Marko, ‚Error-correction and crosstalk avoidance in DSM busses‛.
 [3] Sainarayanan, K.S., C. Raghunandan, Ravindra and J.V.R. Srinivas, ‚Bus coding to minimize redundant bit transitions‛ M.B. TENCON. 2007.
 [4] Saravanan, T. and R. Udayakumar, ‚Comparison of Different Digital Image watemarking techniques‛, MiddleEast Journal of Scientific Research, ISSN:1990-9233, 15(12): 1684-1690. 2013.
 [5] Saravanan, T. and R. Udayakumar, ‚Optimization of Machining Hybrid Metal matrix Composites using desirability analysis‛, Middle-East Journal of Scientific Research, ISSN: 1990-9233,15(12): 1691-1697. 2013. 
[6] Saravanan, T. and R. Udayakumar, ‚Simulation Based line balancing of a single piece flow line‛, Middle-East Journal of Scientific Research, ISSN:1990-9233, 15(12): 1698-1701. 2013 
[7] Saravanan, T. and R. Udayakumar, ‚Comparison of Different Digital Image watemarking techniques‛, MiddleEast Journal of Scientific Research, ISSN:1990-9233, 15(12): 1684-1690. 2013.

Currently there are no Refbacks

Paper Title : A Structure of Adaptive Mobile Video Streaming and Methodical Social Video Sharing In the Cloud
Authors : Gattu Uma Maheswari, E Ramya,
Affiliations : M.Tech(CSE) Department of Computer Science & Engineering, Arjun College of Technology and Science
Associate Professor, Department of Computer Science & Engineering, Arjun College of Technology and Science
Abstract :

af

For the reasons of high information stream of video traffics over versatile systems, the remote connection limit neglects to keep up the pace with the interest. There exists a crevice between the interest and the connection limit which brings about poor administration nature of the video gushing over versatile systems which incorporates interruptions and long buffering time. Taking after the distributed computing innovation, we propose two arrangements: AMoV (versatile portable video gushing) and ESoV (proficient social video sharing). A private operator is developed for every portable client in the cloud which conform the video bit rate utilizing versatile video coding system taking into account the arrival estimation of the remote connection condition. ESoV and AMoV make a private go between to give video spilling administrations proficiently for each versatile customer. For a specific customer, AMoV gives her a chance to mystery specialists/middle person adaptively change her/his gushing pour with a versatile video coding technique relied on upon the reaction of connection prevalence. Too, effective social video sharing watches the interpersonal organization colleagues among portable customers and their own middle people attempt to share video satisfied ahead of time. We understand the AMES-Cloud system model to uncover its presentation. It is demonstrated that the secret specialists in the mists can effectively give the versatile gushing, and taking into account the informal organization learning accomplish video sharing.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Scalable Video Coding, Adaptive Video Streaming, Social Video Sharing, Cloud Computing.

Gattu Uma Maheswari,E Ramya."A Structure of Adaptive Mobile Video Streaming and Methodical Social Video Sharing In the Cloud". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.837-841, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1205.pdf,

[1] [1] Y. Li, Y. Zhang, and R. Yuan, “Measurement and analysis of a large scale commercial mobile Internet TV system,” in Proc. ACM Internet Meas. conf., 2011, pp. 209–224. 
[2] A.Zambelli, “IIS smooth streaming technical overview,” Microsoft Corp., 2009. 
[3] Y. Fu, R. Hu, G. Tian, and Z. Wang, “TCP-friendly rate control for streaming service over 3G network,” in Proc. WiCOM, 2006, pp. 1–4.
 [4] K. Tappayuthpijarn, G. Liebl, T. Stockhammer, and E. Steinbach, “Adaptive video streaming over a mobile network with TCP-friendly rate control,” in Proc. IWCMC, 2009, pp. 1325–1329. 
[5] V. Singh and I. D. D. Curcio, “Rate adaptation for conversational 3G video,” in Proc. IEEE INFOCOM Workshop, 2009, pp. 205–211. 
[6] S.Akhshabi, A.C.Begen, and C.Dovrolis, “An experimental evaluation of rate-adaptation algorithms in adaptive streaming over HTTP,” in Proc. ACM MMSys, 2011, pp. 157–168. 
[7] E. Piri, M. Uitto, J. Vehkaper, and T. Sutinen, “Dynamic cross-layer adaptation of scalable video in wireless networking,” in Proc. IEEE GLOBECOM, 2010, pp. 1– 5. 
[8] H. Schwarz, D. Marpe, and T. Wiegand, “Overview of the scalable video coding extension of the H.264/AVC standard,” IEEE Trans. Circuits Syst. Video Technol., vol. 17, no. 9, pp.1103–1120, Sep. 2007. 
[9] M. Wien, R. Cazoulat, A. Graffunder, A. Hutter, and P. Amon, “Real-time system for adaptive video streaming based on SVC,” IEEE Trans. Circuits Syst. Video Technol., vol. 17, no. 9, pp.1227–1237, Sep. 2007. 
[10] P. McDonagh, C. Vallati, A. Pande, and P. Mohapatra, “Quality-oriented scalable video delivery uses H. 264 SVC on an LTE network,” in Proc. WPMC, 2011.
 [11] Z. Huang, C. Mei, L. E. Li, and T. Woo, “CloudStream: Delivering high-quality streaming videos through a cloud-based SVC proxy,” in Proc. IEEE INFOCOM Mini-conf., 2011, pp. 201–205. 
[12] Q. Zhang, L. Cheng, and R. Boutaba, “Cloud computing: State-of-the-art and research challenges,” J. Internet Services Applic., vol. 1, no. 1, pp. 7–18, Apr. 2010.
 [13] D. Niu, H. Xu, B. Li, and S. Zhao, “Qualityassured cloud bandwidth auto-scaling for video-onDemand applications,” in Proc. IEEE INFOCOM,2012, pp. 460– 468. 
[14] F. Wang, J. Liu, and M. Chen, “CALMS: Cloud assisted live media streaming for globalized demands with time/region diversities,” in Proc. IEEE INFOCOM, 2012, pp. 199–207.
 [15] H. T. Dinh, C. Lee, D. Niyato, and P.Wang, “A survey of mobile cloud computing: Architecture, applications, and approaches,” Wiley J. Wireless Communication. Mobile Computing, Oct. 2011. 
[16] S. Chetan, G. Kumar, K. Dinesh, K. Mathew, and M. A. Abhimanyu, “Cloud Computing for Mobile World,” 2010. 
[17] N. Davies, “The case for VM-Based Cloudlets in mobile computing, ”IEEE Pervasive Computing, vol. 8, no. 4, pp. 14–23, 2009. 
[18] B. Aggarwal, N. Spring, and A. Schulman, “Stratus: Energy-efficient mobile communication using cloud support,” in Proc. ACM SIGCOMM, 2010, pp. 477– 478.

Currently there are no Refbacks

Paper Title : A Contemplate on Vampire Attacks in Wireless Ad-Hoc Sensor Networks
Authors : Kumara Swamy, E Ramya,
Affiliations : M.Tech (CSE) Department of Computer Science & Engineering, Arjun College of Technology and Science
Associate Professor, Department of Computer Science & Engineering, Arjun College of Technology and Science
Abstract :

af

Specially appointed low-control remote systems are an energizing exploration bearing in detecting and pervasive processing. Former security work here has concentrated basically on disavowal of correspondence at the steering or medium access control levels. This paper investigates asset exhaustion assaults at the directing convention layer, which for all time handicap systems by rapidly depleting hubs' battery power. These "Vampire" assaults are not particular to a particular convention, yet rather depend on the properties of numerous well known classes of steering conventions. We find that all analyzed conventions are vulnerable to Vampire assaults, which are pulverizing, hard to distinguish, and are anything but difficult to do utilizing as few as one malevolent insider sending just convention agreeable messages. In the most pessimistic scenario, a solitary Vampire can expand system wide vitality use by a variable of O (N), where N in the quantity of system hubs. We talk about systems to moderate these sorts of assaults, including another verification of-idea convention that provably limits the harm created by Vampires amid the parcel sending stage.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Denial of service, security, routing, ad-hoc networks, sensor networks, wireless networks

Kumara Swamy,E Ramya."A Contemplate on Vampire Attacks in Wireless Ad-Hoc Sensor Networks". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.834-836, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1204.pdf,

[1] E Y Vasserman, N Hopper, Vampire Attacks: Draining life from wireless Ad hoc sensor networks, IEEE Transactions on Mobile Computing, volume 12, issue 2, published on feb 2013(pages 318-332) 
[2] Bryan Parno, Mark Luk, Evan Gaustad, and Adrian Perrig, Secure sensor network routing: A clean-slate approach, CoNEXT, 2006. 
[3] INSENS: Intrusion-tolerant routing for wireless sensor networks, Computer Communications 29 (2006), no. 2. 
[4] Imad Aad, Jean-Pierre Hubaux, and Edward W. Knightly, Denial of service resilience in ad hoc networks, MobiCom, 2004. 
[5] Gergely Acs, Levente Buttyan, and Istvan Vajda, Provably secure on demand source routing in mobile ad hoc networks, IEEE Transactions on Mobile Computing 05 (2006), no. 11. 
[6] Jae-Hwan Chang and Leandros Tassiulas, Maximum lifetime routing in wireless sensor networks, IEEE/ACM Transactions on Networking 12 (2004), no. 4.

Currently there are no Refbacks

Paper Title : Robust Module based Information Management
Authors : M Vinaykumar Reddy, S Rajeshwar,
Affiliations : M.Tech (CSE) Department of Computer Science & Engineering, Arjun College of Technology and Science
Associate Professor, Department of Computer Science & Engineering, Arjun College of Technology and Science
Abstract :

af

The current development in support of structuring associate ontology-based knowledge management system is to require advantage of efforts that were created to intend pre-existing knowledge management systems. In our work we have a tendency to expand ancient definitions of modules and that we established new properties of strength that provide suggests that for checking merely that a strong module-based knowledge management systems evolves firmly relating to each schema additionally as knowledge of the reference knowledge management systems. Differing from ancient works, we've thought-about issue of safe personalization of modules that square measure engineered from existing reference knowledge management systems. In our work, we have a tendency to go back the reprocess of reference ontology-based knowledge management systems so as to place up novel knowledge management systems with precise desires. Typical definitions of modules in literature essentially resort to idea of conservative extension of a schema as an alternative for obtaining relating to non-interesting relations of a schema.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


– Data management system, Relations, Robustness, Schema, Personalization

M Vinaykumar Reddy,S Rajeshwar."Robust Module based Information Management". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.831-833, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1203.pdf,

[1] S. Ghilardi, C. Lutz, and F. Wolter, “Did i damage my ontology? a case for conservative extensions in description logics,” in KR, 2006. 
[2] R. Kontchakov, L. Pulina, U. Sattler, T. Schneider, P. Selmer, F. Wolter, and M. Zakharyaschev, “Minimal module extraction from DL-Lite ontologies using QBF solvers,” in IJCAI, 2009. 
[3] Z.Wang, K.Wang, R.W. Topor, and J. Z. Pan, “Forgetting concepts in DL-Lite,” in ESW C, 2008. 
[4] D. Calvanese, G. D. Giacomo, D. Lembo, M. Lenzerini, and R. Rosati, “Tractable reasoning and efficient query answering in description logics: The dllite family,” JAR, vol. 39, no. 3, pp. 385– 429, 2007. 
[5] O. Palombi, G. Bousquet, D. Jospin, S. Hassan, L. Rev´eret, and F. Faure, “My corporis fabrica: A unified ontological, geometrical and mechanical view of human anatomy,” in 3DPH, 2009.

Currently there are no Refbacks

Paper Title : OBD – II and Vehicle Evaporative System: Study on conversion of a fluid into vapour
Authors : Dr. Porag Kalita, ,
Affiliations : Head: Automobile Engineering Department,Vocational Education (+2), M R S Higher Secondary School, Titabor, Jorhat, Assam, India
Abstract :

af

Evaporative system, it is a system meant to prevent the escape of petrol vapors from the fuel tank or carburetor float bowl to the atmosphere while the engine is off. The vapors are stored in a canister or in the crankcase until is started. OBD-II, systems were designed to maintain low emissions of in use vehicles, including light and medium duty vehicles. The OBD-II diagnostic system shall control the air flow of the complete evaporative system. In addition, the diagnostic system shall also monitor the complete evaporative system for the emission of Hydrocarbon vapor into the atmosphere by performing a pressure or vacuum check of the complete evaporate system. From time to time, manufactures may occasionally turn off the evaporative purge system in order to carry out a check.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Anti-icing, Evaporative, ignition timing, reluctance sensor, shut purge valve, Vacuum Check, Venturi, Vapour.

Dr. Porag Kalita."OBD – II and Vehicle Evaporative System: Study on conversion of a fluid into vapour". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.825-830, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1202.pdf,

[1] Seminar On Board Diagnostics – II, by Prof. S. Ganeshan, Oakland University, USA/2000. 
[2] Automotive Service Business, Volume I, a Book by Dr. Porag Kalita. 
[3] Automotive Design problem by K M Agrawal, reprint edition 1995.

Currently there are no Refbacks

Paper Title : Hand Tracking in HCI Framework Intended For Wireless Interface
Authors : Aniket Kumbhar, Vipul Sathe, Aniket Pathak
Affiliations : Department of Computer Engineering BSCOER ,Narhe ,Pune Maharashtra, India
Abstract :

af

Despite significant progress in technology the interaction between human and computer goes traditional way. However, HCI framework introduced various ways to interact. To support the unfamiliar user we are creating platform by use of infrared LEDs and Wii-mote which leads us to sense the hand movement through infrared sensor. Moreover, we are emphasizing on usability in other various fields such as 3D image, gaming to have better and simpler interaction.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


HCI Framework; Wii mote; infrared sensing; IHCI, HID

Aniket Kumbhar,Vipul Sathe,Aniket Pathak,Prof.M.K.Kodmelwar."Hand Tracking in HCI Framework Intended For Wireless Interface". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 12,pp.821-824, December- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1201.pdf,

[1]Renqiang Xie, Xia Sun, Xiang Xia, and Juncheng Cao, ‘Similarity Matching-Based Extensible Hand Gesture Recognition’, IEEE SENSORS JOURNAL, VOL. 15, NO. 6, JUNE 2015 
[2]Thomas Schl¨omer, Benjamin Poppinga, NielsHenze, Susanne Boll, ‘Gesture Recognition with a Wii Controller’, IEEE 64742-65/05/©MAY2005IEEE
 [3]Johnny Chung Lee 1, 2, Scott Hudson 1, Paul Dietz 2,’ Hybrid Infrared and Visible Light Projection for Location Tracking’, IEEE EDEP-OHEK/05/©OCT2010IEEE 
[4] Lu, Xiang Chen, Member, IEEE, Qiang Li,Xu Zhang, Member, IEEE, and Ping Zhou, Member, IEEE, 
[5]A Hand Gesture Recognition Framework and WearableGesture-Based Interaction Prototype for Mobile Devices’,IEEE VOL. 44, NO. 2, APRIL 2014
[6] Thomas Schl¨omer, ‘Gesture Recognition with a WiiController’,2008 http://wiigee.sourceforge

Currently there are no Refbacks

 


Paper Title : Novel Design of Low Power Comparator Using Reversible Gates
Authors : IMMADISETTY SIVA PARVATHI, G.VASANTH RAO,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Assistant Professor, Dept. of ECE Priyadarshini Institute of Technology & Science For Women
Abstract :

af

Reversible logic has shown potential to have extensive applications in emerging technologies such as quantum computing, optical computing, quantum dot cellular automata as well as ultra low power VLSI circuits. The classical logic gates such as AND, OR, EXOR and EXNOR are not reversible. In the existing literature, reversible sequential circuits designs are offered that are improved for the number of the garbage outputs and reversible gates. Minimizing the number of garbage is very noticeable. This paper presents a novel design of reversible comparator using the existing reversible gates and proposed new Reversible BJN gate. All the comparators have been modeled and verified using VHDL and ModelSim. A comparative result is presented in terms of number of gates, number of garbage outputs, number of constant inputs and Quantum cost. The design is useful for the future computing techniques like quantum computers. The proposed designs are implemented using VHDL and functionally investigated using Quartus II simulator.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Advanced computing, Modified Toffoli gate, Reversible arithmetic unit, Reversible logic circuits.

IMMADISETTY SIVA PARVATHI,G.VASANTH RAO."Novel Design of Low Power Comparator Using Reversible Gates". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.887-892, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1136.pdf,

[1] R. Landauer, ‚Irreversibility and Heat Generation in the Computational Process‛, IBM Journal of Research and Development, 5, pp. 183- 191, 1961. 
[2] R. Landauer, ‚Irreversibility and Heat Generation in the Computational Process,‛ IBM Journal of Research and Development, Vol. 5, No. 3, 1961, pp. 183-191. 
[3] G. E. Moore, ‚Cramming More Components onto Integrated Circuits,‛ Electronics, Vol. 38, No. 8, 1965.
[4] C. H. Bennett, ‚Logical Reversibility of Computation,‛ IBM Journal of Research and Development, Vol. 17, 1973, 
[5] M. Mohammadi and M. Eshghi, ‚On Figureures of Merit in Reversible and Quantum Logic Designs,‛ Quantum Information Processing, Vol. 8, No. 4, 2009, pp. 297-318. 
[6] D. Maslov and G. W. Dueck, ‚Improved Quantum Cost for n-Bit Toffoli Gates,‛ IEEE Electronics Letters, Vol.39, No. 25, 2003, pp. 1790-1791. 
[7] V. Vedral, A. Bareno and A. Ekert, ‚Quantum Networks for Elementary Arithmetic Operations,‛ 1995. 
[8] R. Feynman, ‚Quantum Mechanical Computers,‛ Optic News, Vol. 11, 1985, pp. 11-20. 
[9] T. Toffoli, ‚Reversible Computing,‛ Tech memo MIT/ LCS/TM-151, MIT Lab for Comp. Sci, 1980. [10] E. Fredkin and T. Toffoli, ‚Conservative Logic,‛ International Journal of Theoretical Physics, Vol. 21 
[11] H. G. Rangaraju, V. Hegde, K. B. Raja and K. N. Muralidhara, ‚Design of Efficient Reversible Binary Comparator,‛International Conference on Communication Technology and System Design, 7-9 December 2011. 
[12] M. H. Azad Khan Md., ‚Design of Full Adder with Reversible Gate,‛ International Conference on Computer and Information Technology, Dhaka, 27-28 December 2002, pp. 515-519. 
[13] H. R. Bhagyalakshmi and M. K. Venkatesha, ‚Design of a Multifunction BVMF Reversible Logic Gate and Its Applications,‛ International Journal of Computer Applications 
[14] H. Thapliyal and N. Ranganathan, ‚A New Design of the Reversible Subtractor Circuit,‛ 2011 11th IEEE International Conference on Nanotechnology, Portland Marriott, 
[15] B. Dehghan, ‚Survey the Inverse Property of Quantum Gates for Concurrent Error Detection,‛ Journal of Basic and Applied Scientific Research, 2013, pp. 603-608.

Currently there are no Refbacks

Paper Title : ASIC Design of Reversible Full Adder and Multiplier Circuits
Authors : CHADARASUPALLI NAGA LAKSHMI, P T BALAKRISHNA,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Associate Professor, Dept. of ECE Priyadarshini Institute of Technology & Science for Women
Abstract :

af

Reversible logic has become one of the most promising research areas in the past few decades and has found its applications in several technologies; such as low power CMOS, nano-computing and optical computing. The problem of minimizing the number of garbage outputs is an important issue in reversible logic design. In this paper we propose a new 4×4 universal reversible logic gate. The proposed reversible gate can be used to synthesize any given Boolean functions. We also gain better improvements in terms of power and area when compared to conventional adders and multipliers. The implemented designs are simulated using NC launch and synthesized by RTL compiler. We also gain better improvements in terms of power and area when compared to conventional adders and multipliers. The implemented designs are simulated using NC launch and synthesized by RTL compiler. In this paper we have used Peres gate and the proposed Modified HNG (MHNG) gate to construct the reversible fault tolerant multiplier circuit
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Reversible logic, Garbage output, Garbage constant, Quantum Cost

CHADARASUPALLI NAGA LAKSHMI,P T BALAKRISHNA."ASIC Design of Reversible Full Adder and Multiplier Circuits". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.882-886, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1135.pdf,

[1] R. Landauer, “Irreversibility and Heat Generation in the Computational Process”, IBM Journal of Research and Development, 5, pp. 183-191, 1961. 
[2] Prashanth.N.G, Savitha.A.P, M.B.Anandaraju, Nuthan.A.C Design and Synthesis of Fault Tolerant Full Adder/Subtractor Using Reversible Logic Gates (IJERA) Vol. 3, Issue 4, Jul-Aug 2013. 
[3] Adders Md. Saiful Islam, Muhammad Mahbubur Rahman, Zerina begum, and Mohd. Zulfiquar Hafiz. Efficient Approaches for Designing Fault Tolerant Reversible Carry Look-Ahead and Carry-Skip 
[4] Ko-ChiKuon, Chi-WenChou Low power and high speed multiplier design with row by passing and parallel architecture, Microelectronics Journal41 (2010). 
[5] Yvav van Rentergem and Alexis De Vos Optimal Design of a Reversible Full Adder. 17 December 2004. 
[6] Manjeet Singh Sankhwar , Rajesh Khatri Int Design of High Speed Low Power Reversible Logic Adder Using HNG Gate. Journal of Engineering Research and Applications Vol. 4, Issue 1 January 2014. 
[7] Md.Belayet Alli,Md.samlur Rahman,Thmina Parvin ,optimized design of carry skip BCD adder using new FHNG Reversible logic gates (IJCS) july 2012. 
[8] P. Moallema, M. Ehsanpour ,A Novel Design of Reversible Multiplier Circuit June 2013. 
[9] Himanshu Thapliyal and M.B Srinivas, Novel Reversible Multiplier Architecture Using Reversible TSG Gate. 
[10] Himanshu Thapliyal, Saurabh Kotiyal and M.B Srinivas,Novel BCD Adders and Their Reversible Logic Implementation for IEEE 754r Format. 
[11] Md. Saiful Islam, A Novel Quantum Cost Efficient Reversible Full Adder Gate in Nanotechnology. 
[12] J.W. Bruce, M.A. Thornton, L. Shivakumaraiah, P.S. Kokate, and X. Li. Efficient Adder Circuits Based on a Conservative Reversible Logic Gate. 
[13] Parisa Safari , Majid Haghparast , Asgar Azari,A Design of Fault Tolerant Reversible Arithmetic Logic Unit,Life Science Journal 2012. 
[14] Stephen Brown, Zvonko Vranesic, et al.” Fundamentals of Digital Logic with Verilog Design” The McGraw-Hill Companies, Second Edition. 
[15] H. Thapliyal and N. Ranganathan, "Design of Efficient Reversible Binary Subtractions Based on New Reversible Gate," Proc. of the I Computer Society Annual Symposium on VLSI, 2009

Currently there are no Refbacks

Paper Title : Integrity Auditing for Outsourced Dynamic Cloud Data with Group User Revocation
Authors : P.FARZANA, A.HARSHAVARDHAN,
Affiliations : M.Tech (CSE), Priyadarshini Institute of Technology & Science for women’s
Assistant Professor (Dept.of CSE), Priyadarshini Institute of Technology & Science for women’s
Abstract :

af

The imminent of the cloud computing makes storage outsourcing turns into a rising pattern, which advances the privacy for remote data auditing an intriguing issue that showed up in the literature. Recently a few researchers consider the issue of secure and productive public data respectability auditing for shared dynamic data. Be that as it may, these schemes are still not secure against the conspiracy of cloud storage server and revoked group users amid client denial reasonable cloud storage framework. In this paper, we make sense of the understanding attack in the presented system and give an adept public auditing scheme with secure group client repudiation in view of Asymmetric Group Key Agreement and group signature. Our Scheme supports effective dynamic user revocation with public auditing.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Data Sharing, Dynamic Groups, user revocation, public auditing.

P.FARZANA,A.HARSHAVARDHAN."Integrity Auditing for Outsourced Dynamic Cloud Data with Group User Revocation". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.877-881, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1134.pdf,

[1] M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, and M. Zaharia. “A View of Cloud Computing,” Comm. ACM, vol. 53, no. 4, pp. 50-58, Apr.2010. 
[2] S. Kamara and K. Lauter, “Cryptographic Cloud Storage,” Proc. Int’l Conf.Financial Cryptography and Data Security (FC), pp.136- 149, Jan. 2010.
[3] M. Kallahalla, E. Riedel, R. Swaminathan, Q. Wang, and K. Fu, “Plutus: Scalable Secure File Sharing on Untrusted Storage,” Proc. USENIX Conf. File and Storage Technologies, pp. 29-42, 2003. 
[4] E. Goh, H. Shacham, N. Modadugu, and D. Boneh, “Sirius: Securing Remote Untrusted Storage,” Proc. Network and Distributed Systems Security Symp. (NDSS), pp. 131-145, 2003. 
[5] G. Ateniese, K. Fu, M. Green, and S. Hohenberger, “Improved Proxy Re-Encryption Schemes with Applications to Secure Distributed Storage,” Proc. Network and Distributed Systems Security Symp. (NDSS), pp. 29-43, 2005. 
[6] Shucheng Yu, Cong Wang, Kui Ren, and Weijing Lou, “Achieving Secure, Scalable, and Finegrained Data Access Control in Cloud Computing,” Proc. ACM Symp. Information, Computer and Comm. Security, pp. 282-292, 2010. [7] V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-Based Encryption for Fine-Grained Access Control of Encrypted Data,” Proc. ACM Conf. Computer and Comm. Security (CCS), pp. 89-98, 2006
 [8] R. Lu, X. Lin, X. Liang, and X. Shen, “Secure Provenance: The Essential of Bread and Butter of Data Forensics in Cloud Computing,” Proc. ACM Symp. Information, Computer and Comm. Security, pp. 282-292, 2010. 
[9] B. Waters, “Ciphertext-Policy AttributeBased Encryption: An Expressive, Efficient, and Provably Secure Realization,” Proc. Int’l Conf. http://eprint.iacr.org/2008/290.pdf, 2008 [10] Xuefeng Liu, Yuqing Zhang, Boyang Wang, and Jingbo Yang, “Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud,” IEEE Transactions on Parallel and Distributed Systems, vol. 24, no. 6, pp. 1182-1191, June 2013. 
[11] D. Boneh, X. Boyen, and E. Goh, “Hierarchical Identity Based Encryption with Constant Size Ciphertext,” Proc. Ann. Int’l Conf. Theory and Applications of Cryptographic Techniques (EUROCRYPT), pp. 440-456, 2005.
 [12] C. Delerablee, P. Paillier, and D. Pointcheval, “Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ci-phertexts or Decryption Keys,” Proc. First Int’l Conf. Pairing-Based Cryptography, pp. 39-59, 2007.
 [13] Zhongma Zhu, Zemin Jiang, Rui Jiang, “The Attack on Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud,” Proceedings of 2013 International Conference on Information Science and Cloud Computing (ISCC 2013 ), Guangzhou, Dec.7, 2013, pp. 185-189. [14] Lan Zhou, Vijay Varadharajan, and Michael Hitchens, “Achieving Secure Role-Based Access Control on Encrypted Data in Cloud Storage,” IEEE Transactions on Information Forensics and Security, vol. 8, no. 12, pp. 1947-1960, December 2013.
[15] Xukai Zou, Yuan-shun Dai, and Elisa Bertino, “A practical and flexible key management mechanism for trusted collaborative computing,” INFOCOM 2008, pp. 1211-1219. 
[16] M. Nabeel, N. Shang, and E. Bertino, “Privacy preserving policy based content sharing in public clouds,” IEEE Trans. on Know. and Data Eng., vol. 25, no. 11, pp. 2602-2614, 2013.
 [17] Dolev, D., Yao A. C., "On the security of public key protocols", IEEE trans. on Information Theory, vol. IT-29, no. 2, pp. 198–208, 1983 
[18] Boneh Dan, Franklin Matt, “Identitybased encryption from the weil pairing,” Lecture Notes in Computer Science, vol. 2139 LNCS, pp. 213- 229, 2001

Currently there are no Refbacks

Paper Title : Content Leakage Detection for Trusted Delivery Networks using DRM Technology
Authors : LAKSHMANA CHARI, Dr G. RAMA SWAMY,
Affiliations : (M.Tech) CSE, Dept. of Computer Science and Engineering
Professor, Dept. of Computer Science and Engineering Priyadarshini Institute of Technology & Science
Abstract :

af

As the rapid development of broadband technologies and the advancement of high-speed networks, Multimedia streaming applications and services are becoming popular in recent a year, that’s why issue of trusted video delivery to prevent the undesirable content leakage become critical. The protection of the bit stream from unauthorized use, duplication and distribution is the key concern in video streaming services. The conventional Systems addressed this issue by proposing methods based on observation of streamed traffic throughout the network and Digital Rights Management (DRM) is one of the most popular approaches to prevent undesirable contents distribution to unauthorized users. The job of maintaining high detection accuracy while coping with traffic variation in the network is done by conventional system. But detection performance of conventional system degrades to the significant variation of length of the video. To overcoming this issue we are proposing a novel leakage detection of content scheme that is robust to the variation of the length of the video. Thus, we enhance the detection performance of the proposed scheme even in an environment subjected to variation in length of video The effectiveness of proposed scheme is evaluated in terms of variation of video length, delay variation, and packet loss. Also, increased in bandwidth, which enhance the performance of transmission, include a module to enhance the performance of overall system.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Traffic pattern, Streaming content, leakage detection degree of similarity, multimedia streaming, DRM Technology

LAKSHMANA CHARI,Dr G. RAMA SWAMY."Content Leakage Detection for Trusted Delivery Networks using DRM Technology". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.872-876, November - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1133.pdf,

[1] Hiroki Nishiyama, Desmond Fomo, Zubair Md. Fadlullah,, and NeiKato,Fellow,” Traffic Pattern-Based Content Leakage Detection for Trusted Content Delivery Networks” IEEE Transaction on Parallel and Distributed System , Volume 25, No 2 Feb 2014 
[2] K. Ramya, D. RamyaDorai, Dr. M. Rajaram “Tracing Illegal Redistributors of Streaming Contents using Traffic Patterns” IJCA 2011
 [3] S. Amarasing and M. Lertwatechakul, “The Study of Streaming Traffic Behavior,” KKU Eng. J., vol. 33, no. 5, pp. 541-553, Sept./Oct. 2006. 
[4] M. Dobashi, H. Nakayama, N. Kato, Y. Nemoto, and A. Jamalipour, “Traitor Tracing Technology of Streaming Contents Delivery Using Traffic Pattern in Wired/Wireless Environments,” Proc. IEEE Global Telecomm. Conf., pp. 1-5, Nov./Dec. 2006. 
[5] Y. Chu, S.G. Rao, S. Seshan, and H. Zhang, “Enabling Conferencing Applications on the Internet Using an Overlay Multicast Architecture,” Proc. ACM SIGCOMM, pp. 55-67,Aug.
 [6] D. Geiger, A. Gupta, L.A. Costa, and J. Vlontzos, “Dynamic Programming for Detecting, Tracking, and Matching Deformable Contours,” Proc.IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 3, pp. 294-302, Mar. 1995. 
[7] R.S. Naini and Y. Wang, “Sequential Traitor Tracing,” IEEE Trans. Information Theory, vol. 49, no. 5, pp. 1319-1326, May 2003 
[8] O. Adeyinka, “Analysis of IPSec VPNs Performance in a Multimedia Environment,” Proc. Fourth Int’l Conf. Intelligent Environments, pp. 25-30,2008 
[9] A. Asano, H. Nishiyama, and N. Kato, “The Effect of Packet Reordering and Encrypted Traffic on Streaming Content Leakage Detection (Invited Paper),” Proc. Int’l Conf. Computer Comm. Networks (ICCCN ’10), pp. 1- 6, Aug. 2010.

Currently there are no Refbacks

Paper Title : Key-Aggregate Crypto System for Reliable Outsourced Data among Public Cloud
Authors : SHOBAN DEVARAPALLI, R.MADHURI DEVI,
Affiliations : M.Tech (CSE), Priyadrshini Institute of Technology & Management
AssociateProfessor (Dept.of CSE), Priyadrshini Institute of Technology & Management
Abstract :

af

The capacity of in particular sharing encrypted data with divergent to clients through public cloud storage may truly ease security trouble, by plausibility data uncover in the cloud. A key test to plan such encryption thought lies in the very much sorted out administration encryption keys. The favored adaptability of distributing any attaining so as to gather reports with any gathering of clients weight distinctive encryption keys to be utilized for diverse archives. Then again, this includes the need of safely disseminating to clients by a substantial number of keys for both encryption and seeks, and those clients need to advance to store the got keys. The aberrant requirement for secure correspondence, storage, and many-sided quality plainly cause the outlandish methodology. In this paper, we focus on this viable issue, by recommending the novel idea of key aggregate searchable encryption (KASE) and instantiating the thought through a genuine KASE plan, in which a data proprietor needs to share out a solitary key to a client for disseminating an extensive number of reports, and the client needs to display a solitary trapdoor to the cloud for scrutinizing the mutual archives.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


data sharing, Searchable encryption, data privacy, cloud storage

SHOBAN DEVARAPALLI,R.MADHURI DEVI."Key-Aggregate Crypto System for Reliable Outsourced Data among Public Cloud". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.867-871, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1132.pdf,

[1] Baojiang Cui, Zheli Liu and Lingyu Wang : Key-Aggregate Searchable Encryption for Group Data Sharing via Cloud Storage, IEEE Transactions On Computers, Vol. 6, No. 1, January 2014 
[2] R. Lu, X. Lin, X. Liang, and X. Shen, “Secure Provenance: The Essential of Bread and Butter of Data Forensics in Cloud Computing”, Proc. ACM Symp. Information, Computer and Comm.Security, pp. 282-292, 2010. 
[3] X. Liu, Y. Zhang, B. Wang, and J. Yan. “Mona: secure multiowner data sharing for dynamic groups in the cloud”, IEEE Transactions on Parallel and Distributed Systems, 2013, 24(6): 1182- 1191. 
[4] C. Chu, S. Chow,W. Tzeng, et al. “KeyAggregate Cryptosystem for Scalable Data Sharing in Cloud Storage”, IEEE Transactions on Parallel and Distributed Systems, 2014, 25(2): 468-477. 
[5] X. Song, D.Wagner, A. Perrig. “Practical techniques for searches on encrypted data”, IEEE Symposium on Security and Privacy, IEEE Press, pp. 44C55, 2000. 
[6] R. Curtmola, J. Garay, S. Kamara, R. Ostrovsky. “Searchable symmetric encryption: improved definitions and efficient constructions”, In: Proceedings of the 13th ACM conference on Computer and Communications Security, ACM Press, pp. 79-88, 2006. 
[7] P. Van,S. Sedghi, JM. Doumen. “Computationally efficient searchable symmetric encryption”, Secure Data Management, pp.87-100, 2010. 
[8] S. Kamara, C. Papamanthou, T. Roeder. “Dynamic searchable symmetric encryption”, Proceedings of the 2012 ACM conference on Computer and communications security (CCS), ACM, pp. 965- 976, 2012. 
[9] D. Boneh, C. G, R. Ostrovsky, G. Persiano. “Public Key Encryption with Keyword Search”, EUROCRYPT 2004, pp. 506C522,2004. 
[10] Y. Hwang, P. Lee. “Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System”, In: PairingBased Cryptography C Pairing 2007, LNCS, pp. 2- 22, 2007. 
[11] J. Li, Q. Wang, C. Wang. “Fuzzy keyword search over encrypted data in cloud computing”, Proc. IEEE INFOCOM, pp. 1-5, 2010.
[12] C. Bosch, R. Brinkma, P. Hartel. “Conjunctive wildcard search over encrypted data”, Secure Data Management. LNCS, pp. 114- 127, 2011. 
[13] C. Dong, G. Russello, N. Dulay. “Shared and searchable encrypted data for untrusted servers”, Journal of Computer Security, pp. 367-397, 2011. 
[14] F. Zhao, T. Nishide, K. Sakurai. Multi-User Keyword Search Scheme for Secure Data Sharing with Fine-Grained Access Control. Information Security and Cryptology, LNCS, pp. 406-418, 2012.
 [15] J. W. Li, J. Li, X. F. Chen, et al. “Efficient Keyword Search over Encrypted Data with FineGrained Access Control in Hybrid Cloud”, In: Network and System Security 2012, LNCS, pp. 490- 502, 2012. 
[16] J. Li, K. Kim. “Hidden attribute-based signatures without anonymity revocation”, Information Sciences, 180(9): 1681-1689, Elsevier, 2010. 
[17] X.F. Chen, J. Li, X.Y. Huang, J.W. Li, Y. Xiang. “Secure Outsourced Attribute-based Signatures”, IEEE Trans. on Parallel and Distributed Systems, DOI.ieeecomputersociety.org/10.1109/TPDS.2013.1 80, 2013. 
[18] J.Li, X.F. Chen, M.Q. Li, J.W. Li, P. Lee, Wenjing Lou. “Secure Deduplication with Efficient and Reliable Convergent Key Management”, IEEE Transactions on Parallel and Distributed Systems, 25(6): 1615-1625, 2014. 
[19] Z. Liu, Z. Wang, X. Cheng, et al. “Multi-user Searchable Encryption with Coarser-Grained Access Control in Hybrid Cloud”, Fourth International Conference on Emerging Intelligent Data and Web Technologies (EIDWT), IEEE, pp. 249-255, 2013. 
[20] C. Wang, Q. Wang, K. Ren, and W. Lou, “Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing”, Proc. IEEE INFOCOM, pp. 525-533, 2010. 
[21] B. Wang, B. Li, and H. Li, “Knox: PrivacyPreserving Auditing for Shared Data with Large Groups in the Cloud”, Proc. 10th Int’l Conf. Applied Cryptography and Network Security, pp. 507- 525, 2012. 
[22] D. Boneh, C. Gentry, B. Waters.“ Collusion resistant broadcast encryption with short ciphertexts and private keys”, Advances in CryptologyCCRYPTO 2005, pp. 258-275, 2005. 
[23] D. H. Phan, D. Pointcheval, S. F. Shahandashti, et al. “Adaptive CCA broadcast encryption with constant-size secret keys and ciphertexts”, International journal of information security, 12(4):251-265, 2013. 
[24] D. Boneh, B. Lynn, H. Shacham. “Short signatures from the Weil pairing”, Advances in Cryptology ASIACRYPT 2001, pp. 514-532, 2001.

Currently there are no Refbacks

Paper Title : Augmenting Privacy for Cloud users through Advanced Access Control Scheme for MultiAuthority Cloud Storage
Authors : NADAKUDITI MALLIKHARJUNA SWAMY, K.KIRAN KUMAR,
Affiliations : M.Tech (CSE), Priyadrshini Institute of Technology & Management
AssociateProfessor (Dept.of CSE), Priyadrshini Institute of Technology & Management
Abstract :

af

Day to day Cloud Computing is expanding massively because of its favorable position of giving adaptable storage prerequisite. The clients are begun to share their touchy data through the cloud because of its tendency of giving accommodation to clients. The security of the data must be guaranteed to the clients while putting away their subtle elements into the cloud server. In the current work an expressive, proficient and revocable data access control plan for multi-power distributed storage frameworks are proposed to bolster the power access control get from the numerous property powers. The clients the individuals who are having coordinating properties as in the access approach defined in the figure content can recover the whole data content. It intends to permit the clients with qualified credits to unscramble the whole data put away in the cloud server. On the other hand, it can't constrain the clients from accessing the data's which are not accessible to them. That is it can't restrict the data access control to the approved clients. In this work a novel calculation to be specific Security improved Data Access Control Plan is proposed to defeat the issue exist in the current work. In the current work data, access control is constrained to the client from the unapproved clients though in the proposed calculation plan to restrict the data access control to the approved client.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


access control; multi-authority; security; cloud storage

NADAKUDITI MALLIKHARJUNA SWAMY,K.KIRAN KUMAR."Augmenting Privacy for Cloud users through Advanced Access Control Scheme for MultiAuthority Cloud Storage". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.862-866, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1131.pdf,

1. J. Bethencourt, A. Sahai, and B. Waters, “CiphertextPolicy AttributeBased Encryption,” Proc. IEEE Symp. Security and Privacy (SP ’07), pp. 321-334, 2007. 
2. P. Mell and T. Grance, „„The NIST Definition of Cloud Computing,‟ ‟ National Institute of Standards and Technology, Gaithersburg, MD, USA, Tech. Rep., 2009. 
3. A.B. Lewko, T. Okamoto, A. Sahai, K. Takashima, and B.Waters, „Fully Secure Functional Encryption: AttributeBased Encryption and (Hierarchical) Inner Product Encryption,‟ ‟ in Proc. Advances in cryptologyEUROCRYPT’10, 2010, pp. 62-91. 
4. M. Li, S. Yu, Y. Zheng, K. Ren, andW. Lou, „„Scalable and Secure Sharing of Personal Health Records in Cloud Computing Using Attribute-Based Encryption,‟ ‟ IEEE Trans. Parallel Distributed Systems, vol. 24, no. 1, pp. 131-143, Jan. 2013. 
5. S. Yu, C. Wang, K. Ren, and W. Lou, “Attribute Based Data Sharing with Attribute Revocation,” Proc. Fifth ACM Symp. Information, Computer and Comm. Security (ASIACCS ’10), 2010. 
6. J. Hur and D. Noh, “Attribute-based access control with efficient revocation in data outsourcing systems,” IEEE Transactions on Parallel and Distributed Systems, 2010. 
7. S. Ruj, A. Nayak, and I. Stojmenovic, „„DACC: Distributed Access Control in Clouds,‟ ‟ in Proc. 10th IEEE Int’l Conf. TrustCom, 2011, pp. 91-98 
8. G. Wang, Q. Liu, and J. Wu, “Hierarchical attributebased encryption for fine-grained access control in cloud storage services,” in ACM Conference on Computer and Communications Security, E. Al-Shaer, A. D. Keromytis, and V. Shmatikov, Eds. ACM, 2010, pp. 735–737. 
9. C. Dong, G. Russello, and N. Dulay, “Shared and Searchable Encrypted Data for Untrusted Servers,” J. Computer Security, vol. 19, pp. 367- 397, 2010. 
10. D. Boneh and M.K. Franklin, „„Identity-Based Encryption from the Weil Pairing,‟ ‟ in Proc. 21st Ann. Int’l Cryptology Conf.: Advances in Cryptology - CRYPTO’01, 2001, pp. 213-229.

Currently there are no Refbacks

Paper Title : Performance Analysis of High Speed CMOS Full Adder Circuits For Embedded System
Authors : MUDRABOYINA SRINIVASA RAO, BELLAM VARALAKSHMI,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Assistant Professor, Dept. of ECE Priyadarshini Institute of Technology & Management
Abstract :

af

The full Adder is designed using CMOS logic style by dividing it in three modules so that it can be optimized at various levels. First module is an XOR-XNOR circuit, which generates full swing XOR and XNOR outputs simultaneously and have a good driving capability. The main motive is to determine the comparison of power, surface area and complexity of Full adder designs using CMOS Logic Styles. Logic style affects the switching capacitance, transition activity, short circuit current and delay. Various logic styles have been compared taking full adder as a reference circuit and power dissipation and delay as reference parameters. Full adder Design is better compared to conventional design. Transistor Design with respect to power, delay, Power Delay Product Comparison. It is observed that less power is consumed in the Transmission based full adder than the Convention full adder and Pass Transistor full adder.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


CMOS logic style, full adder, high speed, low power.

MUDRABOYINA SRINIVASA RAO,BELLAM VARALAKSHMI."Performance Analysis of High Speed CMOS Full Adder Circuits For Embedded System". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.857-861, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1130.pdf,

[1] N. Weste, and K. Eshranghian, “Principles of CMOS VLSI Design: A System Perspective,” Reading MA: Wesley, 1993. 
[2] Sanjeev Kumar and Manoj Kumar “4-2 Compressor design with New XOR-XNOR Module”, 4th International Conference on Advanced Computing and Communication technologies, pp. 106-111, 2014. 
[3] Meher, P.; Mahapatra, K.K. "Low power noise tolerant domino 1-bit full adder", International Conference on Advances in Energy Conversion Technologies (ICAECT), pp. 125 – 129, 2014 
[4] Vojin G. Oklobdzija, “Simple and Efficient Circuit for Fast VLSI Adder Realization,” IEEE International Symposium on Circuits and Systems Proceedings, 1988, pp. 1-4. 
[5] J.Rabaey, “Digital Integrated Circuits: A Design Prospective,” Prentice- Hall, Englewood Cliffs, NJ, 1996. 
[6] R. Zimmermann and W. Fichtner, “Low-power logic styles: CMOS versus pass-transistor logic,” IEEE Journal of Solid–State Circuits, vol.32, pp.1079-1090, July 1997. 
[7] http://en.wikipedia.org/wiki/CMOS 
[8] Devi, Padma, Ashima Girdher, and Balwinder Singh. "Improved carry select adder with reduced area and low power consumption." International Journal of Computer Applications 3.4 (2010): 14-18. 
[9] D. Radhakrishnan, “Low-voltage low-power CMOS full adder,” IEEE Proc. Circuits Devices Syst., vol. 148, no. 1, pp. 19–24, Feb. 2001. 
[10] S.Veeramachaneni, M.B. Srinivas, “New improved 1-bit full adder cells”, IEEE Conf. Electrical and computer engg. May2007.
 [11] S. Goel, Ashok Kumar and M. A. Bayoumi, “Design of robust, energyefficient full adders for deep-sub micrometer design using Hybrid-CMOS logic style”, IEEE Trans. Very Large Scale Intsgr. (VLSI) Syst., vol. 14, no. 12, Dec. 2006. 
[12] M. Shams, T. K. Darwish, and M. A. Bayoumi, “Performance analysis of low-power 1-bit CMOS full adder cells,” IEEE Transactions on VLSI Systems, vol. 10, pp. 20–29, Feb. 2002. 
[13] Sohan Purohit, Martin Margala, Macro Lanuza and Pasquale Corsonello, “New Performance/Power/ Area Efficient, Reliable Full Adder Design”, GLSVLSI’09, ACM May,2009. 
[14] Kshirsagar, R.V. "Design of low power column bypass multiplier using FPGA", Electronics Computer Technology (ICECT), 2011 3rd International Conference on, On page(s): 431 - 435 Volume: 3, 8-10 April 2011
 [15] Prabhu, A.S.; Elakya, V. "Design of modified low power booth multiplier", International Conference on Computing, Communication and Applications (ICCCA), pp. 1 - 6, 2012.

Currently there are no Refbacks

Paper Title : DRAM based on Self Controllable Voltage Level Technique for Leakage Power in VLSI
Authors : M S V D RAJU KUNAPAREDDY, Y.KONDAIAH,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Associate Professor, Dept. of ECE Priyadarshini Institute of Technology & Management
Abstract :

af

Today trend is circuit characterized by reliability, low power dissipation, low leakage current, low cost and there is required to reduce each of these. Increase of chip complexity is consistently higher for memory circuits. The salient features such as low power, reliable performance, circuit techniques for high speed such as using dynamic circuits, and low leakage current, most of these have get give a better advantage. Power must be added to the portable unit, even when power is available in non-portable applications, the issue of low-power design is becoming critical. Thus, it is evident that methodologies for the design of high-throughput, low-power digital systems are needed. Since there is no additional circuitry needed for power reduction in this circuit design technique, there is no additional circuitry needed for power reduction Here 3T DRAM is implementing with self controllable voltage level (svl) technique is for reducing leakage current in 0.12um technology. The simulation is done by using microwind 3.1 & dsch2 and gives the advantage of reducing the leakage current up to 57%.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


low leakage power, high performance, self controllable voltage level technique, low cost, low power

M S V D RAJU KUNAPAREDDY,Y.KONDAIAH."DRAM based on Self Controllable Voltage Level Technique for Leakage Power in VLSI". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.847-856, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1129.pdf,

1. Frangois Odiot, Hugues Brut, “New Test Structure For High Resozution Leakage Current And Capacitance Measurements In CMOS Imager Appncations,” Proc. 1EEE 2004 Int. Conference On Microelectronic Test Structures, Vol 17, March 2004. 
2. Satoshi Kurihara, Yanuar Z. Arief, Takumi Tsurusaki, Shinya Ohtsuka, “Construction Of Remote Monitoring System For Separative Measurement Of Leakage Current Of Outdoor Insulators,” Proceedings Of The 7th Lntemarional Conference On Properties And Applications Of Dielectric Materials June 1-5 2003 Nagoya. 
3. Rajeev Rao, Student Member, IEEE, Ashish Srivastava, Student Member, IEEE, David Blaauw, Member, IEEE, And Dennis Sylvester, Member, IEEE, ” Statistical Analysis Of Subthreshold Leakage Current For VLSI Circuits,’’ Ieee Transactions On Very Large Scale Integration (Vlsi) Systems, Vol. 12, No. 2, February 2004. 
4. F. Meghnefi, C. Volat And M. Farzaneh, “Temporal And Frequency Analysis Of The Leakage Current Of A Station Post Insulator During Ice Accretion,” IEEE Transactions On Dielectrics And Electrical Insulation Vol. 14, No. 6; December 2007.
 5. Lin Yuan and Gang Qu, “A Combined Gate Replacement Reduction,” Ieee Transactions On Very Large Scale Integration (Vlsi) Systems, Vol. 14, No. 2, February 2006. 
6. Soo Han Choi, Young Hee Park, Chul Hong Park, Sang Hoon Lee, Moon Hyun Yoo1, “Efficient Characterization And Suppression Methodology Of Edge Effects For Leakage Current Reduction Of Sub40nm DRAM Device,” IEEE International Conference On Microelectronic Test Structures, March 22-25, Hiroshima, Japan 2010. 
7. Dongwoo Lee, Student Member, IEEE, David Blaauw, Member, IEEE, And Dennis Sylvester, Member, IEEE, “Gate Oxide Leakage Current Analysis And Reduction For VLSI Circuits,” IEEE Transactions On Very Large Scale Integration (Vlsi) Systems, Vol. 12, No. 2, February 2004 . 
8. N. H. E. Weste, And K. Eshraghian, Editor.“Principles Of Cmos Vlsi Design”, A Systems Perspective, 2nd Ed. Addison-Wesley, 1993. 
9. Chao-Chi Hong, Chang-Yun Chang, Chaung-Yuan Lee, And Jenn-Gwo Hwu, Senior Member, IEEE, “Reduction In Leakage Current Of Low-Temperature Thin-Gate Oxide By Repeated Spike Oxidation Technique,” IEEE Electron Device Letters, Vol. 23, No. 1, January 2002. 
10. Yutaka Kobayashi, Kyoichiro Asayama, Masayuki Oohayashi, Ryoichi Hori, Goro Kitsukawa, And Kiyoo Itoh, “Bipolar Cmos-Merged Technology For A HighSpeed 1 - Mbit Dram,” IEEE Transactions On Electron Devices, Vol. 36, No. 4. April 1989. 
11. Pavan.T.K. Jagannadha Naidu.K Shekar Babu.M,” Implementation Of Delay And Power Monitoring Schemes To Reduce The Power Consumption, Proceedings Of 2011 International Conference On Signal Processing, Communication, Computing And Networking Technologies (ICSCCN 2011).
 12. Mohammad Sharifkhani, Member, IEEE, And Manoj Sachdev, Senior Member, IEEE, “Segmented Virtual Ground Architecture For Low-Power Embedded SRAM, IEEE Transactions On Very Large Scale Integration Systems, Vol.

Currently there are no Refbacks

Paper Title : IMPLEMENTATION OF HARDWARE IP ROUTER BASED ON VLSI
Authors : K RAMA SUBBA RAO, SK. MASTAN BASHA,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Assitant Professor, Dept. of ECE Priyadarshini Institute of Technology & Management
Abstract :

af

A Network-on-chip is a new paradigm in complex system-on-chip designs that provide efficient on chip communication networks. It allows scalable communication and allows decoupling of communication and computation. The data is routed through the networks in terms of packets. We attempts to overcome latency and time reduction issue and can provide multipurpose networking router by means of verilog and it was synthesized in Xilinx 13.2 version, simulated Modelsim 10.0 version. In this paper our attempt is to provide a multipurpose networking router by means of Verilog code, by this we can maintain the same switching speed with more secured way of approach we have even the packet storage buffer on chip being generated by code in our design in the so we call this as the self-independent router called as the VLSI Based router. The three architectures were analyzed for their performance in terms of delay, throughput and latency and we concluded that CDMA router performs better than the other two.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Fictional Coverage, assertions, Randomization, Network-On-Chip,, Register blocks.

K RAMA SUBBA RAO,SK. MASTAN BASHA."IMPLEMENTATION OF HARDWARE IP ROUTER BASED ON VLSI". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.841-846, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1128.pdf,

[1]Channamallikarjuna Mattihalli, Suprith Ron,Naveen Kolla ” VLSI Based Robust Router Architecture” Third International Conference on Intelligent Systems Modelling and Simulation,2012. 
[2]Feng Liang, Luwen Zhang, Shaochong Lei, Guohe Zhang, Kaile Gao, and Bin Liang” Test Patterns of Multiple SIC Vectors: Theory and Application in BIST Schemes” ieee transactions on very large scale integration (vlsi) systems, vol. 21, no. 4, april 2013. 
[3]James Aweya “IP Router Architectures: An Overview”.
 [4]M. SOWMYA C. SHIREESHA G. SWETHA PRAKASH J. PATIL” VLSI Based Robust Router Architecture” .
 [5] M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, “Scalable High Speed IP Routing Lookup,” Proc. ACM SIGCOMM’97, Cannes, France, Sept. 1997. 
[6] V. Srinivasan and G. Varghese, “Faster IP Lookups using Controlled Prefix Expansion,” Proc. ACM SIGMETRICS, May 1998. 
[7] S. Nilsson and G. Karlsson, “Fast Address Look-Up for Internet Routers,” Proc. Of IEEE Broadband Communications’98, April 1998. 
[8]E. Filippi, V. Innocenti, and V. Vercellone, “Address Lookup Solutions for Gigabit Switch/Router,” Proc. Globecom’98, Sydney, Australia, Nov. 1998. 
[9]M. Thottethodi, A. R. Lebeck, and S. S. Mukherjee, "BLAM: ahigh performance routing algorithm for virtual cut-through networks," in Proceedings of the International Parallel and Distributed Processing Symposium 
[10] L. S. Peh and W. J. Dally, "A delay model and speculative architecture for pipelined routers," in Proceedings of the 7thInternational Symposium on High Performance Computer Architecture (HPCA). 
[11] A. V. Yakovlev, A. M. Koelmans, and L. Lavagno, "High-level modeling and design of asynchronous interface logic," IEEEDesign & Test of Computers.
 [12] H. Jingcao and R. Marculescu, "Energy- and performance aware mapping for regular NoC architectures," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 24, pp. 551-562, 2005.
 [13] W. Hangsheng, L. S. Peh, and S. Malik, "A technology-aware and energy oriented topology exploration for on-chip Networks," in Proceedings of the Design, Automation and Test in Europe Conference and Exhibition . 
[14] J. Duato, "A new theory of deadlock-free adaptive routing in wormhole networks," IEEE Transactions on Parallel and Distributed Systems, vol. 4. 
[15] S. Arjun, W. J. Dally, A. K. Gupta, and B. Towles, "GOAL: aload-balanced adaptive routing algorithm for torus networks," in Proceedings of the International Symposium on ComputerArchitecture.

Currently there are no Refbacks

Paper Title : Design and implementation of carry select adder for 128 bit low power
Authors : DOMA ANISHA RANI, AL.SHABNA SAMANTHA TERA,
Affiliations : (M.Tech) VLSI, Dept. of ECE
Associate Professor, Dept. of ECE Priyadarshini Institute of Technology & Management
Abstract :

af

Carry Select Adder is a prompt adder that is employed in processing of data processors for functioning quick arithmetic functions. Carry Select Adder (CSLA) is one of the fastest adders used in many data-processing processors to perform fast arithmetic functions. From the structure of the CSLA, the scope is to reduce the area of CSLA based on the efficient gate-level modification. In this paper 128 bit Regular Linear CSLA, Modified Linear CSLA, Regular Square-root CSLA (SQRT CSLA) and Modified SQRT CSLA architectures have been developed. To decrease area with insignificant speed penalty, set up a multiplexer basis add one circuit was projected. Based on this modification a new modified 32-Bit Square-root CSLA (SQRT CSLA) architecture has been developed. The modified architecture has been developed using Common Boolean Logic (CBL). The area of proposed design illustrates a decrease in support of 128-bit sizes which indicates attainment of method and not an easy trade-off of obstruction for area.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Area efficient, Square-root CSLA (SQRT CSLA), Common Boolean Logic (CBL), Binary to Excess-1 CONVERTER (BEC).

DOMA ANISHA RANI,AL.SHABNA SAMANTHA TERA."Design and implementation of carry select adder for 128 bit low power". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.835-840, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1127.pdf,

[1] Y. He, C. H. Chang, and J. Gu, "An area efficient 64- Bit square Root carry-select adder for low powerApplications, " in Proc. IEEE Int. Symp.Circuits Syst.,vol. 4, pp. 4082-4085, 2005. 
[2] P. Sreenivasulu, K. Srinivasa rao, Malla Reddy and A. Vinay Babu, “Energy and area efficient carry select adder on a reconfigurable hardwware”, International Journal of Engineering Research and Applicaions, vol. 2, Issue. 2, pp. 436-440, Mar 2012.
[3] “Enhanced Area Efficient Architecture for 128 bit Modified CSLA”, R.Priya, J.Senthil Kumar, 2013 
[4] I-Chyn Wey, Cheng-Chen Ho, Yi-Sheng Lin and Chien-Chang Peng, “An area efficient carry select adder design by sharing the common boolean logic term”, Proceedings on the International Multiconference of Engineering and computer scientist, IMECS 2012 
[5] Padma Devi, Ashima Girdher and Balwinder Singh"Improved Carry Select Adder with Reduced Areaand Low Power Consumption, " International Journalof Computer Applications, Vo1.3, No.4, pp. 14- 18,1998. 
[6]Edison A. J and C. S. Manikanda babu, “An efficient CSLA architecture for VLSI hardware implementation”, Interanational Journal for Mechanical and Industrial Engineering, vol. 2, Issue 5, 2012 
[7] B. Ramkumar, H.M. Kittur, and P. M. Karman, "ASICimplementation of modified faster carry save adder, "Eur. J. Sci. Res., vol. 42, no. 1, pp.53-58, 2010 
[8] He, Y. Chang, C. H. and Gu, J. "An Area Efficient 64- Bit Square Root Carry-Select Adder For Low PowerApplications, " in Proc. IEEE Int. Symp. Circuits Syst.,Vol.4, pp. 4082-4085, 2005 
[9]B. Ramkumar and Harish M Kittur, “Low power and area efficient carry select adder”, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 20, no. 2, pp. 371-375, Feb 2012. 
[10] J. M. Rabaey, Digital Integrated Circuits-A Design Perspective, Upper Saddle River, NJ: Prentice-Hall, 2001 
[11]R. Priya and J. Senthilkumar, “Implementation and comparision of effective area efficient architecuture for CSLA”, Proceedings of IEEE InternationalConference on Emerging trends in Computing, Communicaton and Nano Technology, pp. 287-292, 2013 
[12] An Efficient Csla Architecture For Vlsi Hardware Implementation Edison A.J, Mr. C.S.Manikanda Babu, 2012 
[13] Akhilesh Tyagi, "A Reduced-Area Scheme for CarrySelectAdders," IEEE Transactions on Computers,Vo1.42, No.1 0, pp.1l63-1170, 1993. 
[14]B. Ramkumar , Harish M Kittur and P. M. Kannan, “ASIC implementation of modified faster carry save adder”, Eur. J. Sci. Res. , vol. 42, no. 1, pp. 53-58, Jun 2010. 
[15] “An Efficient SQRT Architecture of Carry Select Adder Design by Common Boolean Logic, Ms. S.Manjui, Mr. V. Sornagopae, 2013

Currently there are no Refbacks

Paper Title : Provable Data Possession using IBE in Multi cloud storage
Authors : NALLAMEKALA HEMANTH, K.KIRAN KUMAR,
Affiliations : M.Tech (CSE), Priyadarshini Institute of Technology & Management
Associate Professor ( Dept.of CSE), Priyadarshini Institute of Technology & Management
Abstract :

af

In distributed computing frameworks, information proprietors normally store immense volume information on the cloud servers in this way customers may get to the information from Cloud servers without knowing their areas in this association outsourcing customer information among untrusted cloud servers, dependable check, proficient information outsourcing and framework execution is a testing issue .keeping in mind the end goal to address the above issues we utilize Centralized Cloud Service Provider to enhance the System Performance by decreasing the time unpredictability .Therefore, every Client solicitation is overseen by concentrated Cloud Service Provider. With a specific end goal to give the dependable check amid transferring and downloading User needs to answer the Security Question. Security Questions and Answers are given by client amid the enrollment stage. So amid Uploading/Downloading operation If client is typical then he can answer that security questions on the off chance that he/she is interloper then he/she can't answer that inquiries. In this manner, utilizing this we can give more Security. Additionally, we can give the Security to transferred information and the condensation by utilizing the encryption calculation in this manner we can accomplish productive information out sourcing with information uprightness. Besides, the honesty test convention must be proficient keeping in mind the end goal to spare the verifier's expense.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Provable data possession, proofs of irretrievability, ID-DPDP system.

NALLAMEKALA HEMANTH,K.KIRAN KUMAR."Provable Data Possession using IBE in Multi cloud storage". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.831-834, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1126.pdf,

[1] B. Sotomayor, R. S. Montero, I. M. Llorente, and I. T. Foster, Virtual infrastructure management in private and hybrid clouds,” IEEE Internet Computing, vol. 13, no. 5, pp. 14–22,2009. 
[2] G. Ateniese, R. C. Burns, R. Curtmola, J. Herring, L. Kissner, Z. N. J. Peterson, and D. X. Song, “Provable data possession at untrusted stores,” in ACM Conference on Computer and Communications Security, P. Ning, S. D. C. di Vimercati, and P. F. Syverson, Eds. ACM, 2007, pp. 598–609.
 [3] A. Juels and B. S. K. Jr., “Pors: proofs of retrievability for large files,” in ACMConference on Computer and Communications Security, P. Ning, S. D. C. di Vimercati, and P. F. Syverson, Eds. ACM, 2007, pp. 584–597. 
[4] G. Ateniese, R. D. Pietro, L. V. Mancini, and G. Tsudik, “Scalable and efficient provable data possession,” in Proceedings of the 4th international conference on Security and privacy in communication netowrks, SecureComm, 2008, pp. 1–10.
[5] C. C. Erway, A. K¨upc¸ ¨u, C. Papamanthou, and R. Tamassia, “Dynamic provable data possession,” in ACM Conference on Computer and Communications Security, E. Al-Shaer, S. Jha, and A. D. Keromytis, Eds. ACM, 2009, pp. 213–222.
[6] H. Shacham and B. Waters, “Compact proofs of retrievability,” in ASIACRYPT, ser. Lecture Notes in Computer Science, J. Pieprzyk, Ed., vol. 5350. Springer, 2008, pp. 90–107. 
[7] Q. Wang, C.Wang, J. Li, K. Ren, and W. Lou, “Enabling public verifiability and data dynamics for storage security in cloud computing,” in ESORICS, ser. Lecture Notes in Computer Science, M. Backes and P. Ning, Eds., vol. 5789. Springer, 2009, pp. 355–370. 
[8] Q. Wang, C.Wang, J. Li, K. Ren, and W. Lou, “Enabling public Verifiability and data dynamics for storage security in cloud Computing,” in ESORICS, ser. Lecture Notes in Computer Science, M. Backes and P. Ning, Eds., vol. 5789. Springer, 2009, pp. 355–370. 
[9] Y. Zhu, H. Wang, Z. Hu, G.-J. Ahn, H. Hu, and S. S. Yau, “Dynamic audit services for integrity verification of outsourced Storages in clouds,” in SAC, W. C. Chu, W. E. Wong, M. J. Palakal, and C.-C. Hung, Eds. ACM, 2011, pp. 1550–1557. 
[10] K. D. Bowers, A. Juels, and A. Oprea, “Hail: a highavailability and integrity layer for cloud storage,” in ACM Conference on Computer and Communications Security, E. Al-Shaer, S. Jha, and A. D.Keromytis, Eds. ACM, 2009, pp. 187–198. 
[11] Y. Dodis, S. P. Vadhan, and D. Wichs, “Proofs of retrievability via hardness amplification,” in TCC, ser. Lecture Notes in Computer Science, O. Reingold, Ed., vol. 5444. Springer, 2009, pp. 109–127. 
[12]L. Fortnow, J. Rompel, and M. Sipser, “On the power of multiprover Interactive protocols,” in Theoretical Computer Science, 1988, pp.156–161.

Currently there are no Refbacks

Paper Title : Detecting Illegal Redistribution for Trusted Content Delivery Networks
Authors : VENKATA SATYANARAYANA K, R.MADHURI DEVI,
Affiliations : M.Tech (CSE), Priyadarshini Institute of Technology & Management
Associate Professor ( Dept.of CSE), Priyadarshini Institute of Technology & Management
Abstract :

af

- As of now the ubiquity of sight and sound applications and administrations are taken top position. Hence the issue of conveyance trusted substance turns out to be exceptionally basic i.e. content spillage [1], content ridiculed, and illicit redistribution and bundle misfortune. While tending to these issue and proposing so as to give vigorous spilling execution gushing movement based calculations and avert illicit redistribution of substance between clients to organize which has been finished by unapproved clients. In this paper we have kept up a high location exactness [4] to get content spillage and we are protecting that to send trusted substance to certain destination without outside impact upon substance. Because of absence of gushing execution some time, we lose the information. Along these lines we have drawn consideration over the using so as to gush convention to propose this issue spilling conventions while concentrating on spilling activity in systems. One of the significant issue has been evacuated by this paper is illicit redistribution by proposing method don't influence unique substance.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Streaming content, redistribution, performance, leakage detection, traffic

VENKATA SATYANARAYANA K,R.MADHURI DEVI."Detecting Illegal Redistribution for Trusted Content Delivery Networks". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.826-830, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1125.pdf,

[1] Hiroki Nishiyama, Desmond Fomo, Zubair Md. Fadlullah, and Nei Kato “Traffic Pattern-Based Content Leakage Detection for Trusted Content Delivery Networks” IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,VOL. 25,NO. 2,FEBRUARY 2014. 
[2] Content Leakage Detection by Using TrafficPattern for Trusted Content Delivery NetworksVol. 5 (6) , 7909- 7913, 2014. 
[3] Research on the Traffic Behavior Characteristics ofP2P Streaming MediaISSN 2079-8407Vol. 4, No. 1 Jan 2013. 
[4] K. Matsuda, H. Nakayama, and N. Kato, “A Study on StreamingVideo Detection using Dynamic Traffic Pattern,”IEICETransactions on Communications (Japanese Edition), vol.J19-B,no.02, 2010. 
[5] Z. Yang, H. Ma, and J. Zhang, “A Dynamic Scalable Service ModelforSIP-Based Video Conference,” Proc. Ninth Int’l Conf. ComputerSupportedCooperative Work in DE, pp. 594-599, May 2005. 
[6] O. Adeyinka, “Analysis of IPSec VPNs Performance in a MultimediaEnvironment,” Proc. Fourth Int’l Conf. Intelligent Environments,pp. 25-30, 2008.
[7] E.I. Lin, A.M. Eskicioglu, R.L. Lagendijk, and E.J. Delp, “Advancesin Digital Video Content Protection,” Proc. IEEE, vol. 93, no. 1,pp. 171-183, Jan. 2005. 
[8] Y. Liu, Y. Guo, and C. Liang, “A Survey on Peer-toPeer VideoStreamingSystems,” Peer-to Peer Networking and Applications,vol. 1, no. 1, pp. 18-28, Mar. 2008. 
[9] M. Dobashi, H. Nakayama, N. Kato, Y.Nemoto, and A.Jamalipour, “Traitor Tracing Technology of Streaming ContentsDelivery Using Traffic Pattern in Wired/Wireless Environments,”Proc. IEEE Global Telecomm. Conf., pp. 1-5, Nov./Dec. 2006. 
[10] J. Schwenk and J. Ueberberg, Tracing Traitors using Finite Geometries, manuscript. 
[11] B. Chor, A. Fiat, and M. Naor, Tracing Traitors, Proc. Crypto 94, LNCS 839, Springer-Verlag, Berlin,
 [12] B. Turnbull, “Important legal developments regarding protection of copyrighted content against unauthorized copying,” IEEE Comm. Magazine,vol.39, no.8, pp. 92–100, Aug. 2001.


Currently there are no Refbacks

Paper Title : Revocable Data Access Control in Public Cloud
Authors : ASHOK NAGASAI MANCHALLA, D.RAVIKIRAN,
Affiliations : M.Tech (CSE), Priyadarshini Institute of Technology & Management
Professor ( Dept.of CSE), Priyadarshini Institute of Technology & Management
Abstract :

af

A new suburbanised access management theme for secure information storage in clouds that support anonymous authentication. Throughout this theme, the cloud verifies the credibility of the user whereas not knowing the user’s identity before storing information and in addition has added the feature of access management throughout that entirely valid user’s square measure able to rewrite the hold on knowledge. The theme prevents reply attack and supports creation, modification, and reading the data hold on inside the cloud user and in addition have the address user revocation. Moreover, our authentication and access management theme is suburbanised and durable, in distinction to different access management schemes designed for clouds that square measure centralized. The communication, computation, and storage overheads square measure resembling centralized approaches. If the user does not have credentials to urge the key and incorrectly coming back into key to access the file implies that persona non grata identification activates the system to transfer a faux file to the persona non grata and inform to the administrator of the system thus the land in addition the} user United Nations agency created that file is attempt to access and conjointly hide the attribute and access policy of a user.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Trespasser identification, attribute based encryption, attribute based signature

ASHOK NAGASAI MANCHALLA,D.RAVIKIRAN."Revocable Data Access Control in Public Cloud". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.820-825, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1124.pdf,

[1] S. Ruj, Member, IEEE, M. Stojmenovic, Member, IEEE, and A.Nayak, Senior Member, IEEE"Decentralized Access Control with Anonymous Authentication of Data Stored in Clouds",Feb-2014,pp.384-394 
[2] S. Ruj, M. Stojmenovic, and A. Nayak, “Privacy Preserving AccessControl with Authentication for Securing Data in Clouds,” Proc. IEEE/ACM Int’l Symp.Cluster, Cloud and Grid Computing, pp.556- 563, 2012. 
[3] C. Wang, Q. Wang, K. Ren, N. Cao, and W. Lou, “Toward Secureand Dependable Storage Services in Cloud Computing,” IEEE Trans. Services Computing, vol. 5, no. 2, pp. 220-232, Apr.- June2012.
[4] J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, and W. Lou, “FuzzyKeyword Search Over Encrypted Data in Cloud Computing,” Proc. IEEE INFOCOM, pp. 441-445, 2010. 
[5] S. Kamara and K. Lauter, “Cryptographic Cloud Storage,” Proc.14th Int’l Conf. Financial Cryptography and Data Security, pp. 136-149, 2010. 
[6] H. Li, Y. Dai, L. Tian, and H. Yang, “IdentityBasedAuthentication for Cloud Computing,” Proc. First Int’l Conf. Cloud Computing (CloudCom), pp. 157-166, 2009.
 [7] C. Gentry, “A Fully Homomorphic Encryption Scheme,” PhDdissertation, Stanford Univ., http://www.crypto.stanford.edu/craig,2009. 
[8] R.K.L. Ko, P. Jagadpramana, M. Mowbray, S. Pearson, M.Kirchberg, Q. Liang, and B.S. Lee, “Trustcloud: A Framework for Accountability and Trust in Cloud Computing, ”HP TechnicalReport HPL- 2011- 38,http://www.hpl.hp.com/techreports/2011/HPL2011-38.html, 2013.
 [9] R. Lu, X. Lin, X. Liang, and X. Shen, “Secure Provenance: TheEssential of Bread and Butter of Data Forensics in Cloud Computing,” Proc. Fifth ACM Symp.Information, Computer andComm. Security (ASIACCS), pp. 282- 292, 2010. 
[10] D.F. Ferraiolo and D.R. Kuhn, “Role-Based Access Controls,” Proc.15th Nat’l Computer Security Conf.,

Currently there are no Refbacks

Paper Title : TAST Model for Travel Package Recommendation
Authors : INDLA IRMIYA, K.KIRAN KUMAR,
Affiliations : M.Tech (CSE), Priyadarshini Institute of Technology & Management
Associate Professor ( Dept.of CSE), Priyadarshini Institute of Technology & Management
Abstract :

af

Last few years ago a business needs travel, and generally that's lots of the time for created sensible packages and appropriate to customers. This paper provides a study of exploiting on-line travel info for customized travel package recommendation. A vital challenge on this line is to handle the distinctive characteristics of travel information that differentiate packages from ancient things for recommendation. Period of time has connected within the analysis domain of ITS. Cluster Strategy is used as a prevailing tool of discovering hidden data which will be applied on historical traffic information to predict correct period of time. A vital challenge on this line is to handle the distinctive characteristics of travel information that distinguish travel packages from ancient things for suggestion. This TAST model will represent travel packages and tourists by distributions. In MKC approach, a collection of historical information is portioned into a bunch of meaning sub-classes (also referred to as clusters) supported period of time, frequency of travel of period of time and velocity for specific road phase and time cluster. we tend to extend the TAST model to the TRAST model for capturing the latent relationships among the tourists in every travel cluster. The TAST model, the TRAST model, and also the cocktail recommendation approach on the real-world travel package information. TAST model will effectively capture the distinctive characteristics of the travel information and also the cocktail approach is, thus, rather more effective than ancient recommendation techniques for travel package recommendation.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Tourist Relation Area Season topic (TRAST), Intelligence Transport System (ITS), Modified K Means Clustering (MKC).

INDLA IRMIYA,K.KIRAN KUMAR."TAST Model for Travel Package Recommendation". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.814-819, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1123.pdf,

[1] Chen, M., Chien, S.: Dynamic freeway travel time prediction using probe vehicle data: Link-based vs. Path Research Record, TRB Paper No. 01 
[2] Wei, C.H., Lee, Y.: Development of Freeway Travel Time Models by Integrat-ing Different Sources of Traffic Data. IEEE Transactions on Vehicular Technology 56 (2007) 
[3] Chun-Hsin, W., Chia-Chen, W., Da H.: Travel Time Prediction with Support Vector Regression. In: IEEE Intelligent Transportation Systems Conference (2003)
[4] Kwon, J., Petty, K.: A travel time prediction algorithm scalable to freeway networks with many nodes with arbitrary travel routes. In: Transportation Research Board 84th Annual Meeting, Washington, D.C. (2005).
 [5] Park, D., Rilett, L.: Forecasting multiple times using modular neural networks. J. of Transportation Research Record 1617, 163–170 (1998). 
[6] Park, D., Rilett, L.: Spectral basis neural networks for real time forecasting. J. of Transport Engineering 125(6), 515 [7] Qi Liu, Enhong Chen, HuiXiong, Wu: A Cocktail Approach for Travel Package Recommendation. Trans. Knowl. Data Eng. 26(2): 278 
[8] Q. Liu, Y. Ge, Z. Li, H. Xiong, and E. Chen, “Personalized Travel Package Recommendation,” Data Mining (ICDM ’11), pp. 407 2011. 
[9] F. Ricci, D. Cavada, N. Mirzadeh, and N. Venturini, “Case Recommendations,” Destination Recommendation Systems: Behavioural Foundations and Applications, chapter 6, pp. 67
 [10] Tan, C., Liu, Q., Chen, E., Xiong, H., and Wu, X. 2013. Object oriented Travel Package Recommendation. ACM Trans. Intell. Syst. Technol. 
[11] Y. Ge et al., “Cost-Aware Travel Tour Recommendation,” Proc. 17thACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining(SIGKDD ’11), pp. 983-991, 2011. 
[12] Tariq Mahmooda, Francesco Riccib, Adriano Venturinic, and Wolfram Höpkend, “Adaptive Recommender Systems for Travel Planning 
[13] F. Fouss et al., “Random-Walk Computation of Similarities between Nodes of a Graph with Application to IEEE Trans. Knowledge and Data Eng., vol. 19, no. 3, pp. 355 Mar. 2007.

Currently there are no Refbacks

Paper Title : Typicality Based Content-Boosted Collaborative Filtering Recommendation Framework
Authors : N.SATISH KUMAR, SUJAN BABU VADDE,
Affiliations : M.Tech (CSE), Department of Computer Science & Engineering, NRI Institute of Technology
Assistant Professor, Department of Computer Science & Engineering, NRI Institute of Technology
Abstract :

af

Collaborative filtering (CF) is significant and admired technology for recommender systems. Recommender frameworks have been turned out to be significant means for web online clients to adapt to the information overload and have ended up a standout amongst the most effective and prevalent tools in electronic commerce. Recommending and personalization are critical ways to deal with combating information overload. Machine Learning is an imperative piece of frameworks for these assignments. Collaborative filtering has issues, substance based routines address these issues integrating both is best.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Collaborative Filtering, Content-based Recommender System, Neighbor Selection

N.SATISH KUMAR,SUJAN BABU VADDE."Typicality Based Content-Boosted Collaborative Filtering Recommendation Framework". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.809-813, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1122.pdf,

[1] Z. Huang, H. Chen, and D. Zeng, “Applying Associative Retrieval Techniques to Alleviate the Sparsity Problem in Collaborative Filtering,” ACM Trans. Information Systems, vol. 22, no. 1, pp. 116- 142, 2004. 
[2] G. Adomavicius and A. Tuzhilin, “Toward the Next Generation of Recommender Systems: A Survey of the State-of-the-Art and Possible Extensions,” IEEE Trans. Knowledge and Data Eng., vol. 17, no. 6, pp. 734-749, June 2005. 
[3] K.M. Galotti, Cognitive Psychology In and Out of the Laboratory, third ed. Wadsworth, 2004. 
[4] G.L. Murphy, The Big Book of Concepts. MIT Press, 2002. 
[5] L.W. Barsalou, Cognitive Psychology: An Overview for Cognitive Scientists. Lawrence Erlbaum Assoc., 1992.
 [6] S. Schiffer and S. Steele, Cognition and Representation. Westview Press, 1988. 
[7] D.L. Medin and E.E. Smith, “Concepts and Concept Formation,” Ann. Rev. of Psychology, vol. 35, pp. 113- 138, 1984. 
[8] W. Vanpaemel, G. Storms, and B. Ons, “A Varying Abstraction Model for Categorization,” Proc. Cognitive Science Conf. (CogSci’05), pp. 2277-2282, 2005.

Currently there are no Refbacks

Paper Title : A Study on Secure Data Retrieval for Decentralized DTMN
Authors : P.A.N Chakravarthy , Dasari Vinay Kumar,
Affiliations : M.Tech (CSE), Department of Computer Science & Engineering, NRI Institute of Technology
Assistant Professor, Department of Computer Science & Engineering, NRI Institute of Technology
Abstract :

af

DTMN advancements are getting to be a productive provision that allow remote device passed on by officers to talk with each other and access the classified data or secret data by abusing outside storage nodes. This framework gives the effective situation to approval strategies and the solutions overhaul for secure data recovery in most difficult cases. The most encouraging cryptographic solutions are acquainted with control the access issues called Cipher text-Policy Attribute-Based Encryption. Indisputably the most difficult issues in this state are the prerequisite of endorsement arrangements and the methodologies redesign for secure data recovery. Then again, the issue of applying in decentralized DTMN presents a couple of securities and insurance challenges as to the property disavowal, key escrow, and coordination of characteristics issued from particular forces. In this paper, we propose a protected data recovery arrangement using for decentralized disruptiontolerant network where various key forces manage their properties freely. We display how to apply the proposed part to securely and proficiently deal with the portrayed data scattered in the data scattered in the Interference or disruption tolerant network.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Access control, attribute-based encryption, disruption-tolerant network, multiauthority, secure data retrieval.

P.A.N Chakravarthy ,Dasari Vinay Kumar."A Study on Secure Data Retrieval for Decentralized DTMN". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.804-808, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1121.pdf,

[1] S. Roy and M. Chuah, “Secure data retrieval based on ciphertext policy attribute-based encryption (CPAttribute-Based Encryption) system for the DisruptionTolerant Network’s,” Lehigh CSE Tech. Rep., 2009. 
[2] M. Chuah and P. Yang, “Performance evaluation of content-based information retrieval schemes for DTMNs,” in Proc. IEEE MILCOM, 2007, pp. 1–7.
 [3] M. Kallahalla, E. Riedel, R. Swaminathan, Q. Wang, and K. Fu, “Plutus: Scalable secure file sharing on untrusted storage,” in Proc. Conf. File Storage Technol., 2003, pp. 29–42. 
[4] A. Harrinton and C. Jensen. Cryptographic access control in a distributed file system. In Proceedings of ACM SACMAT, 2003.
 [5] L. Ibraimi, M. Petkovic, S. Nikova, P. Hartel, and W. Jonker, “Mediated ciphertext-policy attribute-based encryption and its application,” in Proc. WISA, 2009, LNCS 5932, pp. 309–323. 
[6] A. Lewko and B. Waters, “Decentralizing attributebased encryption,” Cryptology ePrint Archive: Rep. 2010/351, 2010. 
[7] A. Sahai and B. Waters, “Fuzzy identity-based encryption,” in Proc. Eurocrypt, 2005, pp. 457–473. 
[8] V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-based encryption for fine-grained access control of encrypted data,” in Proc. ACM Conf. Comput. Commun. Security, 2006, pp. 89–98.

Currently there are no Refbacks

Paper Title : Computational Complexity Reduction of OFDM Signals by PTS with Various PAPR Conventional Methods
Authors : BANOTHU RAMESH, MR. B. GIRI RAJU,
Affiliations : M.Tech, DECS, ACE ENGINEERING COLLEGE
Professor, Dept. of ECE, ACE ENGINEERING COLLEGE
Abstract :

af

- In this paper we analyze Partial transmit sequences (PTS),it is one of the most attractive schemes to reduce the Peak-to-Average Power Ratio (PAPR) reduction in Multi-Input Multi-Output Orthogonal Frequency Division Multiplexing (MIMO-OFDM) system with Space Frequency Block Coding (SFBC) is proposed. However, the Optimal PTS (OPTS) scheme requires an exhaustive searching over all combinations of allowed phase factors. Consequently, the computational complexity increases exponentially with the number of the subblocks. Recursive phase weighting (RPW) technique is a novel method whose aim is to reduce computational complexity and achieve the same performance in PAPR reduction as compared to O-PTS.Theoretical analysis and simulation results show that , compared with O-PTS and PTS employing RPW, PTS with AO-RPW method reduces the computational complexity but at the cost of loss of performance for PAPR reduction.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Orthogonal Frequency Division Multiplexing (OFDM) System, Multi-Input Multi-Output Orthogonal Frequency Division Multiplexing (OFDM), Space Frequency Block Code (SFBC), Partial Transmit Sequence (PTS), Peak-to-Average Power Ratio (PAPR)

BANOTHU RAMESH,MR. B. GIRI RAJU."Computational Complexity Reduction of OFDM Signals by PTS with Various PAPR Conventional Methods". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.797-803, November - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1120.pdf,

[1] Wu Y. and Zou W. Y., “Orthogonal frequency division multiplexing: A multi-carrier modulation scheme,” IEEE Trans. Consum. Electron., vol. 41, no. 3, pp. 392–399, Aug. 1995. 
[2] Zou W. Y. and Wu Y., “COFDM: An overview,” IEEE Trans. Broadcast., vol. 41, no. 1, pp. 1–8, Mar. 1995. 
[3] Neill R. O’ and Lopes L. N. “Envelope variations and spectral splatter in clipped multicarrier signals,” in Proc. PMRC’95, Sept. 1995, pp. 71–75.
 [4] Ochiai H. and Imai H., “Performance analysis of deliberately clipped OFDM signals,” IEEE Trans. Commun., Jan. 2002, 50, (1), pp. 89–101.
[5] Ju S. M. and Leung S. H., “Clipping on COFDM with phase on demand,” IEEE Communications Letters, Feb. 2003, 7, (2), pp. 49–51. 
[6] Ren G. L., Zhang H., and Chang Y. L., “A complementary clipping transform technique for the reduction of peak-to-average power ratio of OFDM system,” IEEE Trans. Consumer Electronics, Nov. 2003, 49, (4), pp. 922–926. 
[7] Muller S. H. and Huber J. B., “OFDM with reduced peak-to-average power ratio by optimum combination of partial transmit sequences,” IEE Electronics Letters, Feb. 1997, 33, (5), pp. 36–69.
 [8] Han S. H. and Lee J. H. “PAPR reduction of OFDM signals using a reduced complexity PTS technique,” IEEE Signal Processing Letters, Nov. 2004, 11, (11), pp. 887–890.
[9] Alavi A., Tellambura C., and Fair I., “PAPR reduction of OFDM signals using partial transmit sequence: An optimal approach using sphere decoding,” IEEE Trans. Communications Letters, Nov. 2005, 9, (11), pp. 982– 984.

Currently there are no Refbacks

Paper Title : The Effective Design of Information Sharing System for Human Networks
Authors : KASINDALA DANARAO, G.MINNI,
Affiliations : M.Tech (IT), Department of Computer Science & Engineering
Associate Professor, Department of Computer Science & Engineering, Nimra College of Engineering and Technology, Andhra Pradesh, India
Abstract :

af

In recent times, most mobile applications are for information sharing; mobile devices are increasingly becoming the end points of information consuming and gradually fetching end points of information consuming. Motivated by the new demands of application as well as limitations of existing architecture, we imagine a novel type of energetic networking service known as human networks. A human network design was introduced which a network design that facilitates information is sharing among mobile devices all the way through direct interdevice communication. The system comprises of portable devices that contains wireless communication interfaces. In our work we introduced BSUB, which is an interest motivated system of information sharing for human networks, a content-based publish or else subscribe that attain infrastructure-less communication among mobile devices. The system employs peer to peer communication prototype in human networks, and allows the entire users exchange their interests throughout random contacts. It is proposed for minute to medium sized networks and composed of several devices controlled in a restricted physical area where inter-device communication occasions are plentiful and includes content representation and pub/sub routing; and employs tag-based content description representation.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Information sharing, human network, Mobile devices, B-SUB, Inter-device communication, Users

KASINDALA DANARAO,G.MINNI."The Effective Design of Information Sharing System for Human Networks". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.791-796, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1119.pdf,

[1] R. Zhang, J. Shi, Y. Zhang, and J. Sun, “Secure Cooperative Data Storage and Query Processing in Unattended Tiered Sensor Networks,” Selected Areas in Comm., IEEE J., vol. 30, no. 2, pp. 433-441, Feb. 2012.
 [2] R. Zhang, J. Shi, and Y. Zhang, “Secure Multidimensional Range Queries in Sensor Networks,” Proc. ACM MobiHoc ’09, pp. 197-206, 2009. 
[3] Y. Zhang and S. Zhong, “A Privacy-Preserving Algorithm for Distributed Training of Neural Network Ensembles,” Neural Computing and Applications, pp. 1-14, DOI: 10.1007/s00521-012- 1000-8.
[4] W. Fang, F. Liu, F. Yang, L. Shu, and S. Nishio, “Energy-Efficient Cooperative Communication for Data Transmission in Wireless Sensor Networks,” Consumer Electronics, IEEE Trans., vol. 56, no. 4, pp. 2185-2192, Nov. 2010.
[5] Y. Li, D. Jin, L. Su, and L. Zeng, “Stability and Scalability Properties for Dynamic Content Updates over Delay Tolerant Networks,” Proc. 20th Int’l Conf. Computer Comm. and Networks (ICCCN ’11), pp. 1-6, Aug. 2011. 
[6] G. Sollazzo, M. Musolesi, and C. Mascolo, “TACODTN: a Time-Aware Content-Based Dissemination System for Delay Tolerant Networks,” Proc. ACM First Int’l MobiSys Workshop Mobile Opportunistic Networking (MobiOpp ’07), pp. 83-90, 2007. 
[7] K. Fall, “A Delay-Tolerant Network Architecture for Challenged Internets,” Proc. Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm., pp. 27-34, 2003. 
[8] A. Carzaniga, D.S. Rosenblum, and A.L. Wolf, “Content-Based Addressing and Routing: A General Model and its Application,” 2000. 
[9] P.T. Eugster, P.A. Felber, R. Guerraoui, and A.M. Kermarrec, “The Many Faces of Publish/Subscribe,” ACM Computing Surveys, vol. 35, no. 2, pp. 114-131, 2003.
 [10] A. Carzaniga, D.S. Rosenblum, and A.L. Wolf, “Design and Evaluation of a Wide-Area Event Notification Service,” ACM Trans. Computer Systems, vol. 19, pp. 332-383, Aug. 2001. 
[11] B.H. Bloom, “Space/Time Trade-Offs in Hash Coding with Allowable Errors,” Comm. ACM, vol. 13, no. 7, pp. 422-426, 1970. 
[12] Y. Li, Z. Wang, D. Jin, L. Zeng, and S. Chen, “Collaborative Vehicular Content Dissemination with Directional Antennas,” vol. 11, no. 4, pp. 1301-1306, Apr. 2012.
[13] Y. Li, G. Su, P. Hui, D. Jin, L. Su, and L. Zeng, “Multiple Mobile Data Offloading through Delay Tolerant Networks,” Proc. Sixth ACM Workshop Challenged Networks, pp. 43-48, http://doi. acm.org/10.1145/2030652.2030665, 2011. 
[14] C. Liu and J. Wu, “An Optimal Probabilistic Forwarding Protocol in Delay Tolerant Networks,” Proc. MobiHoc ’09, pp. 105-114, 2009. 
[15] “Twitter,” http://www.twitter.com. 2013. *10+ A. Carzaniga and A.L. Wolf, “Forwarding in a ContentBased Network,” Proc. SIGCOMM ’03, pp. 163-174, 2003.

Currently there are no Refbacks

Paper Title : Study on PASS: A Parallel Activity-Search System
Authors : MADIPADIGA VENKATESH, V .RAMESH,
Affiliations : M.Tech (CS), Department of Computer Science & Engineering
Assistant Professor, Department of Computer Science & Engineering, Sri Indu Institute of Engineering and Technology, R.R Dist Telengana, India
Abstract :

af

In this paper we investigate on set of activities presented via temporal stochastic automata, partitions of activities based on level based events, in this connection our investigation on issues with activity creations on temporal multi-activity graph in order to address this issues as our proposed system how system used PASS architecture with various implementation parts with that coordinates computations across nodes in the cluster and also shown that this algorithms enables to handle both large numbers of observations per second as well as large merged graphs. And also shown Partitioning times vs. TMAG size for different partitioning schemes and TMAG densities (sparseS, dense-D), averaged over number of compute nodes.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Activity detection, temporal stochastic automata, parallel computation.

MADIPADIGA VENKATESH,V .RAMESH."Study on PASS: A Parallel Activity-Search System". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.785-790, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1118.pdf,

[1] M. Albanese, V. Moscato, A. Picariello, V. S. Subrahmanian, and O. Udrea, “Detecting stochastically scheduled activities in video,” in Proc. IJCAI, M. M. Veloso, Ed. San Francisco, CA, USA, 2007, pp. 1802– 1807. 
[2] S. Lühr, H. H. Bui, S. Venkatesh, and G. A. W. West, “Recognition of human activity through hierarchical stochastic learning,” in Proc. PerCom., Fort Worth, TX, USA, Mar. 2003, pp. 416–422. 
[3] T. Duong, H. Bui, D. Phung, and S. Venkatesh, “Activity recognition and abnormality detection with the switching hidden semi-Markov model,” in Proc. IEEE CVPR, Washington, DC, USA, 2005. 
[4] T. V. Duong, D. Q. Phung, H. H. Bui, and S. Venkatesh, “Efficient duration and hierarchical modeling for human activity recognition,” Artif. Intell., vol. 173, no. 7–8, pp. 830–856, May 2009. 
[5] R. Hamid, Y. Huang, and I. Essa, “ARGMode activity recognition using graphical models,” in Proc. IEEE CVPR, Madison, WI, USA, 2003.
[6] M. Albanese, S. Jajodia, A. Pugliese, and V. S. Subrahmanian, “Scalable analysis of attack scenarios,” in Proc. ESORICS, Leuven, Belgium, 2011, pp. 416–433.
 [7] M. L. Fredman and R. E. Tarjan, “Fibonacci heaps and their uses in improved network optimization algorithms,” in Proc. FOCS, 1984, pp. 338–346. 
[8] G. Palshikar and M. Apte, “Collusion set detection using graph clustering,” Data Knowl. Eng., vol. 16, no. 1, pp. 135–164, 2008. 
[9] M. Albanese, A. Pugliese, and V. S. Subrahmanian, “Fast activity detection: Indexing for temporal stochastic automaton-based activity models,” IEEE Trans. Knowl. Data Eng., vol. 25, no. 2, pp. 360–373, Feb. 2013.

Currently there are no Refbacks

Paper Title : Inferring User Search Goals with Feedback Sessions using K-means clustering algorithm
Authors : Dasari Amarendra, Kaveti Kiran Kumar,
Affiliations : M.Tech (CSE), Department of Computer Science & Engineering, NRI Institute of Technology
Assistant Professor, Department of Computer Science & Engineering, NRI Institute of Technology.
Abstract :

af

Recognizing or inferring client's search objective from given query is a difficult job as search engines let users to identify queries simply as a list of keywords which might refer to broad topics, to technical terminology, or even to proper nouns that can be used to guide the search procedure to the significant compilation of documents. In order needs of users are correspond to by queries submitted to search engines and different users have different search goals for a broad topic. Sometimes queries may not exactly represent the user's information needs due to the use of short queries with uncertain terms. thus to get the best results it is necessary to capture different user search goals. These user goals are nothing but information on different aspects of a query that different users want to obtain. The judgment and analysis of user search goals can be improved by the relevant result obtained from search engine and user's feedback. Here, feedback sessions are used to discover different user search goals based on series of both clicked and unclicked URL's. The pseudo-documents are generated to better represent feedback sessions which can reflect the information need of user. With this the original search results are restructured and to evaluate the performance of restructured search results, classified average precision (CAP) is used. This evaluation is used as feedback to select the optimal user search goals.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


User search goals, feedback sessions, pseudo-documents, restructuring search results, classified average precision

Dasari Amarendra,Kaveti Kiran Kumar."Inferring User Search Goals with Feedback Sessions using K-means clustering algorithm". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.780-784, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1117.pdf,

[1] Zheng Lu, Hongyuan Zha, Xiaokang Yang, Weiyao Lin, Zhaohui Zheng, ‚A New Algorithm for Inferring User Search Goals with Feedback Sessions‛,IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 25, NO. 3, MARCH 2013 
[2] U. Lee, Z. Liu, and J. Cho, "Automatic Identification of User Goals in Web Search" , Proc. 14th Int'l Conf. World Wide Web (WWW '05),pp. 391-400, 2005. 
[3] D. Shen, J. Sun, Q. Yang, and Z. Chen, "Building Bridges for Web Query Classification", Proc. 29th Ann. Int'l ACM SIGIR Conf.Research and Development in Information Retrieval (SIGIR '06),pp. 131-138, 2006. 
[4] X. Wang and C.-X Zhai, "Learn from Web Search Logs to Organize Search Results" , Proc. 30th Ann. Int'l ACM SIGIR Conf.Research and Development in Information Retrieval (SIGIR '07),pp. 87-94, 2007. 
[5] H.-J Zeng, Q.-C He, Z. Chen, W.-Y Ma, and J. Ma, "Learning to Cluster Web Search Results" Proc. 27th Ann. Int'l ACM SIGIR Conf. Research and Development in Information Retrieval (SIGIR '04),pp. 210-217, 2004. 
[6] R. Jones and K.L. Klinkner, "Beyond the Session Timeout: Automatic Hierarchical Segmentation of Search Topics in Query Logs" , Proc. 17th ACM Conf. Information and Knowledge Management(CIKM '08), pp. 699-708, 2008. 
[7] S. Beitzel, E. Jensen, A. Chowdhury, and O. Frieder, ‚Varying Approaches to Topical Web Query Classification,‛ Proc. 30th Ann.Int’l ACM SIGIR Conf. Research and Development (SIGIR ’07),pp. 783-784, 2007. 
[8] T. Joachims, ‚Evaluating Retrieval Performance Using Clickthrough Data,‛ Text Mining, J. Franke, G. Nakhaeizadeh, and I. Renz, eds., pp. 79-96, Physica/Springer Verlag, 2003. 
[9] T. Joachims, ‚Optimizing Search Engines Using Clickthrough Data,‛ Proc. Eighth ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining (SIGKDD ’02), pp. 133-142, 2002. 
[10] T. Joachims, L. Granka, B. Pang, H. Hembrooke, and G. Gay,‚Accurately Interpreting Clickthrough Data as Implicit Feedback, Proc. 28th Ann. Int’l ACM SIGIR Conf. Research and Development in Information Retrieval (SIGIR ’05), pp. 154-161, 2005.

Currently there are no Refbacks

Paper Title : A Survey on Dynamic Secure group Data Sharing framework among Public Cloud
Authors : Pathan Jilani, Sayeed Yasin,
Affiliations : (M.Tech) IT, Nimra College of Engineering & Technology
Associate Professor & HOD, Dept of CSE, Nimra College of Engineering & Technology.
Abstract :

af

In cloud computing outsourcing, cluster plus among cloud shoppers could be a noteworthy check, therefore cloud computing provides a token effort and everyone around sorted out the arrangement. Thanks to incessant modification of participation, sharing data Associate in Nursing exceedingly in a very multi-owner manner to an untrusted cloud continues to be its testing issue. During this paper, we have a tendency to project a protected multi-owner data sharing arrange for a dynamic cluster in folks, in general, cloud. By furnishing AES cryptography with convergent key whereas transferring the knowledge, any cloud shopper will safely impart data to others. Within the in the meantime, the capability overhead and cryptography calculation expense of the arrange area unit free with the amount of unacknowledged shoppers. Also, I break down the protection of this arrange with thorough confirmations. One-Time Secret word is one in every of the only and most well-known sorts of confirmation which will be utilized for securing access to accounts. One-Time Passwords area unit of times alluded to as secure and additional grounded sorts of confirmation in an exceedingly multi-owner manner. Broad security and execution examination demonstrates that our projected arrange is deeply productive and fulfills the protection requirements for open cloud-based secure cluster sharing.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Cloud computing, broadcast encryption.

Pathan Jilani,Sayeed Yasin."A Survey on Dynamic Secure group Data Sharing framework among Public Cloud". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.775-779, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1116.pdf,

[1] L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan, “Group formation in large social networks: membership, growth, and evolution,” in ACM SIGKDD2006: Proc. 12th international conference on Knowledge discovery and data mining. ACM, 2006, pp. 44–54. 
[2] A. T. Sherman and D. A. McGrew, “Key establishment in large dynamic groups using one-way function trees,” IEEE Transactions on Software Engineering, vol. 29, no. 5, pp. 444–458, 2003. 
[3] C. K. Wong, M. Gouda, and S. S. Lam, “Secure group communications using key graphs,” IEEE-ACM Transactions on Networking, vol. 8, no. 1, pp. 16–30, 2000. 
[4] M. Steiner, G. Tsudik, and M. Waidner, “Key agreement in dynamic peer groups,” IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 8, pp. 769–780, 2000. 
[5] Y. Kim, A. Perrig, and G. Tsudik, “Group key agreement efficient in communication,” IEEE Transactions on Computers, vol. 53, no. 7, pp. 905–921, 2004. 
[6] W. Yu, Y. Sun, and K. R. Liu, “Optimizing the rekeying cost for contributory group key agreement schemes,” IEEE Transactions on Dependable and Secure Computing, vol. 4, no. 3, pp. 228–242, 2007. 
[7] W. Trappe, Y. Wang, and K. R. Liu, “Resource-aware conference key establishment for heterogeneous networks,” IEEE-ACM Transactions on Networking, vol. 13, no. 1, pp. 134–146, 2005. 
[8] Y. Kim, A. Perrig, and G. Tsudik, “Tree-based group key agreement,” ACM Transactions on Information and System Security (TISSEC), vol. 7, no. 1, pp. 60–96, 2004. 
[9] V.Sathana, J.Shanthini” Enhanced Security System for Dynamic Group in Cloud” International Journal of Advanced Research in Computer Science and Software Engineering, Volume 4, Issue 3, March 2014

Currently there are no Refbacks

Paper Title : Privacy and Protecting Locality based Rewarding method via Redemption System
Authors : K.SRIKANTH, Ms.M.SUJANA,
Affiliations : M.Tech (CSE), Department of Computer Science & Engineering, Malla Reddy College Of Engineering
Assistant Professor, Department of Computer Science & Engineering, Malla Reddy College of Engineering, Maisammaguda (v) I Dhulapally (M), Secunderabad.
Abstract :

af

Theoretical Location is rapidly transforming into the application as area empowered mobile handheld duplicate devices. One class of applications that has yet-to-create is those in which users have a force to lie about their location. These applications can't depend independently on the user’s gadgets to discover and transmit location data in light of the way that users have a helper to swindle. Maybe, such applications require their users to show their locations. Today's mobiles clients neglect to offer a framework to show their current then again past location. In hate of the way that locations based applications have existed for a couple quite a while, affirming the rightness of a customer's declared locations is a test that has pretty much starting late got thought in the investigation bunch. Continued with advances in mobiles frameworks and arranging developments have made a strong business push for locations based applications. Cases fuse area mindful emergency response, locations based notification, and locations in light of entertained. A key test in the wide association of LocationBased Services (LBS) is the security careful organization of locations data. The late work in imparted media content what's more, sensed information made by versatile end-clients is trying settled gauges likewise assumptions in information trust models. A focal issue addresses in this paper is the way by which to fabricate some trust level in the realness of substance made by untrusted locations users. In this it handle the issue of discovering noxious users by putting away IMEI number while user registration. In this way framework saving security in compensating framework that implies redemption system. This number is encoded and put away in central controller. Token distributor and token collector are utilized for remunerating.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Mobile location-based services; security; privacy.

K.SRIKANTH,Ms.M.SUJANA."Privacy and Protecting Locality based Rewarding method via Redemption System". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.771-774, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1115.pdf,

1. Ming Li, “LocaWard: A Security and Privacy Aware Location-Based Rewarding System”, IEEE Transaction on Parallel and Distributed Systems, Vol.25, No. 
2, February 2014. 2. D.W. Gage, Lifelog,”Practical robotic self-awareness and self-knowledge”, Jan.2004. 
3. BugraGedik,”A Customizable k-Anonymity Model for Protecting Location Privacy”. 
4. BugraGedik, ”Protecting Location Privacy with Personalized k- Anonymity: Architecture and Algorithms”, IEEE Transaction on mobile computing, Vol. 7,no. 1, January 2008. 
5. YrjoRaivio, “Mobile Networks as a Two-Sided Platform - Case Open Telco” ,Journal of Theoretical and Applied Electronic Commerce Research ISSN 07181876 Electronic Version Vol 6 /Issue 2 / August 2011/ 77-89 2011. 
6. M. Gruteser and D. Grunewald,“Anonymous Usage of Location-Based Services through Spatial and Temporal Cloaking”, Proc. ACM Intl Conf. Mobile Systems, Applications, and Services (MobiSys 03), 2003. 
7. Naveen Sastry, Secure Verification of Location Claims, ACM 1-58113- 769,San Diego, California, USA, September 19, 2003. 
8. HuiZang and Jean Bolot,“Anonymization of Location Data Does Not Work: A Large-Scale Measurement Study”, MobiCom’11, September 19–23,2011, Las Vegas, Nevada, USA. 
9. SastryDuri, Marco Gruteser, Xuan Liu,.”Framework for security and privacy in automotive telematics”,. In Proceedings of the second international workshop on Mobile commerce, pages 2532. ACM Press, 2002. 
10. M.L. Yiu, C.S. Jensen, X. Huang and H.Lu, ”Space Twits: Managing the Tradeoffs Among Location Privacy, Query Performance and Query Accuracy in Mobile Services”, Proc., 24th Int’l Conf.Data Eng., pp. 366- 375,2008. 
11. M. Gruteser and D. Grunwald,“Anonymous Usage of Location Based Services through Spatial and Temporal Cloaking,”Proc.First Int’l Conf. Mobile Systems, Applications and Services, pp.31-42, 2003 
12. Wanying Luo, “Proving Your Location Without Giving up Your Privacy”, ACM 978-1-4503-0005-6/10/02, February 2223, 2010. 
13. Anonymizer. Anonymizer website.5694 Mission Center Road 426, San Diego,CA92108- 4380,http://www.anonymizer.com, 2000. 
14. M. Talasila, R. Curtmola, and C. Borcea.”Link: Location verification through immediate neighbors knowledge,” Mobile and Ubiquitous Systems: Computing, Networking,and Services, volume 73 Springer Berlin Heidelberg, 2012.
 15. Stefan Saroiu, Alec Wolman, “Enabling New Mobile Applications with Location Proofs”, CM 978-1-60558- 283-2/09/02,February 23-24, 2009.

Currently there are no Refbacks

Paper Title : Privacy-Preserving Public Auditing using TPA for Secure Searchable Cloud Storage data
Authors : G.Dileep Kumar, A.Sreenivasa Rao,
Affiliations : M.Tech (CS), Department of Computer Science & Engineering, Malla Reddy College Of Engineering
Professor, Department of Computer Science & Engineering, Malla Reddy College of Engineering, Maisammaguda (v) I Dhulapally (M), Secunderabad.
Abstract :

af

In this paper, we distinguish the framework prerequisites and difficulties toward accomplishing privacy preserving outsourced cloud data services, usable configuration and basically effective quest plans for scrambled cloud storage. We are exhibiting a general approach for these utilizing searchable encryption methods, which permits scrambled data to be sought by clients without leaking data about the data itself and client's solicitation. Empowering open review capacity for cloud storage is of discriminating significance with the goal that clients can utilize something like a third party auditor (TPA) to check the trustworthiness of outsourced data and can be effortless. To proficiently present a compelling TPA, the examining procedure ought to get no new vulnerabilities towards client data protection, and help to evade extra online weight to client. We propose a protected and productive cloud storage framework supporting privacy preserving open sourced cloud storage data.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Trusted third party auditor (TPA), Cloud Service provider (CSP), data integrity, data authenticity.

G.Dileep Kumar,A.Sreenivasa Rao."Privacy-Preserving Public Auditing using TPA for Secure Searchable Cloud Storage data". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.767-770, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1114.pdf,

[1] S. Zerr, D. Olmedilla, W. Nejdl, and W. Siberski,Top-k Retrieval from a Confidential Index,” Proc. Int’l Conf. Extending Database Technology: Advances in Database Technology (EDBT ’09), 2009. 
[2] J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, and W. Lou, “Fuzzy Keyword Search over Encrypted Data in Cloud Computing,” Proc. IEEE Infocom ’10, 2010. 
[3] N. Cao, C. Wang, K. Ren, and W. Lou, “Privacy Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data,” Proc. IEEE Infocom ’11, 2011. 
[4] C. Wang, K. Ren, S. Yu, K. Mahendra, and R. Urs, “Achieving Usable and Privacy-Assured Similarity Search over Outsourced Cloud Data,” Proc. IEEE INFOCOM, 2012.
 [5] Cong Wang, Ning Cao, KuiRen and Wenjing Lou, “Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data” IEEE Transactions On Parallel And Distributed Systems, Vol. 23, No. 8, August 2012.
[6] Cong Wang, Qian Wang, KuiRen, and Wenjing Lou, "Towards Secure and Dependable Storage Services in Cloud Computing," To appear, IEEE Transactions on Service Computing (TSC). 
[7] A. Boldyreva, N. Chenette, Y. Lee, and A. O’Neill. Order-preserving symmetric encryption. In Proceedings of Eurocrypt'09, volume 5479 of LNCS. Springer, 2009.
 [8] M. Li, S. Yu, N. Cao, and W. Lou. Authorized private keyword search over encrypted data in cloud computing. In Distributed Computing Systems (ICDCS), 2011 31st International Conference on, pages 383–392. IEEE, 2011. International Journal of Application or Innovation in Engineering & Management (IJAIEM) Web Site: www.ijaiem.org Email: [email protected] Volume 3, Issue 7, July 2014 ISSN 2319 - 4847 Volume 3, Issue 7, July 2014 Page 72 
[9] Qian Wang, Cong Wang, Kui Ren, Wenjing Lou, and Jin Li. Enabling public auditability and data dynamics for storage security in cloud computing. Parallel and Distributed Systems, IEEE Transactions on, 22(5):847 – 859, may 2011.
 [10] M. A. Shah, R. Swaminathan, and M. Baker, “Privacy preserving audit and extraction of digital contents,” Cryptology ePrint Archive, Report 2008/186, 2008.
 [11] Q. Wang, C. Wang, J. Li, K. Ren, and W. Lou, “Enabling public verifiability and data dynamics for storage security in cloud computing,” in Proc. of ESORICS’09, volume 5789 of LNCS. Springer-Verlag, Sep. 2009, pp. 355–370.
 [12] A. Juels and J. Burton S. Kaliski, “Pors: Proofs of retrievability for large files,” in Proc. of CCS’07, Alexandria, VA, October 2007, pp. 584– 597.

Currently there are no Refbacks

Paper Title : A Survey on Progressive Packet Arrivals in DTNs Using Dynamic Allocation
Authors : G.KUMARASWAMY, E.CHITTIBABU,
Affiliations : M.Tech (CSE), Department of Computer Science & Engineering, Malla Reddy College Of Engineering
Assistant Professor, Department of Computer Science & Engineering, Malla Reddy College of Engineering, Maisammaguda (v) I Dhulapally (M), Secunderabad.
Abstract :

af

Delay Tolerant Networks (DTNs), also called as intermittently connected mobile networks, are wireless networks in which a fully connected path from source to destination is unlikely to exist. However, effective forwarding based on a limited knowledge of contact behavior of nodes is challenging. When large files need to be transferred from source to destination make all the packets available at the source and transfer the file as small packets. We study the packets arrival at source and analysis their performance. We consider the linear blocks and rateless linear coding to generate redundancy and also for energy constraint .We scheduling the large file into small packets and delivering through multipath to destination, for this we use optimal user centric allocation and scheduling the packets in the receiver side.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Delay tolerant networks, network coding, rate less codes

G.KUMARASWAMY,E.CHITTIBABU."A Survey on Progressive Packet Arrivals in DTNs Using Dynamic Allocation". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.765-766, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1113.pdf,

[1] E. Altman, F. De Pellegrini, and L.Sassatelli, “Dynamic control of coding in delay tolerant networks,” in Proc.2010 IEEE INFOCOM
 [2] E. Altman and F. De Pellegrini,“Forward correction and Fountain codes in delay tolerant networks,”in Proc. 2009 IEEE INFOCOM 
[3] T. Spyropoulos, K. Psounis, and C.Raghavendra, “Efficient routing in intermittently connected mobile networks: the multi-copy case,”ACM/IEEE Trans. . 
[4] E. Altman, T. Bas¸ar, and F. De Pellegrini, “Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks,”in Proc. 2008ACM/ICST Inter-Perf.
[5] J. Metzner, “An improved broadcast retransmission protocol,”IEEETrans. Commun.,
[6] J. Nonnenmacher, E. Biersack, and D. Towsley, “Parity-based loss recovery for reliable multicast transmission,”IEEE/ACM Trans. Netw., 
[7] S. Jain, M. Demmer, R. Patra, and K. Fall, “Using redundancy to cope with failures in a delay tolerant network,”SIGCOMM Comput.Commun. 
[8] Y. Wang, S. Jain, M. Martonosi,and K. Fall, “Erasurecoding based routing for opportunistic networks,” in Proc.2000

Currently there are no Refbacks

Paper Title : A Study on Dynamic Resource Allocation using Virtual Machines for IAAS
Authors : Jella.Kishore, B.Kishore,
Affiliations : M.Tech (CSE), Department of Computer Science & Engineering, Malla Reddy College Of Engineering
Assistant Professor, Department of Computer Science & Engineering, Malla Reddy College of Engineering, Maisammaguda (v) I Dhulapally (M), Secunderabad.
Abstract :

af

Cloud computing allow business customers to scale up and down their resource usage based on needs. Many of the touted gains in the cloud model come from resource multiplexing through virtualization technology. In this paper, we present a system that uses virtualization technology to allocate data center resources dynamically based on application demands and support green computing by optimizing the number of servers in use. We introduce the concept of “skewness” to measure the unevenness’ in the multi-dimensional resource utilization of a server. By minimizing skewness, we can combine different types of workloads nicely and improve the overall utilization of server resources. We develop a set of heuristics that prevent overload in the system effectively while saving energy used. Trace driven simulation and experiment results demonstrate that our algorithm achieves good performance.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Cloud computing, Green computing, Resource, Skewness, Virtual machine.

Jella.Kishore,B.Kishore."A Study on Dynamic Resource Allocation using Virtual Machines for IAAS". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.761-764, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1112.pdf,

[1] M. Armbrust et al., “Above the Clouds: A Berkeley V iew of Cloud Computing,” technical report, Univ. o California, B erkeley, Feb. 2009. 
[2] L. Siegele, “Let It Rise: A Special Report on Corpo rate IT,” The Economist, vol. 389, pp. 3-16, Oct. 2008. 
[3] P. Barham, B. Dragovic, K. Fraser, S. Hand, T. Harris, A. Ho, R. Neugebauer, I. Pratt, and A. Warfield, “Xen and the Art of Virtualization,” Proc. ACM Symp. Operating Systems Principles (SOSP ’03), Oct. 2003E. H. Miller, “A note on refle ctor arrays (Periodical style—Accepted for publication),” IEEE Trans. Antennas Propagat., to be published. 
[4] “Amazon elastic compute cloud (Amazon EC2),” http://aws. amazon.com/ec2/, 2012. 
[5] C. Clark, K. Fraser, S. Hand, J.G. Hansen, E. Jul, C. Limpach, I. Pratt, and A. Warfield, “Live Migration of Virtual Machine s,” Proc. Symp. Networked Systems Design and Implementation (NSDI ’05), May 2005..
 [6] M. Nelson, B.-H. Lim, and G. Hutchins, “Fast Trans parent Migration for Virtual Machines,” Proc. USENIX Ann. Technical Conf., 2005.M. Young, The Techincal Writers Handbook. Mill Valley, CA: University Science, 1989. 
[7] N. Bobroff, A. Kochut, and K. Beaty, “Dynamic Place ment of Virtual Machines for Managing SLA Violations,” Proc. IFIP/I EEE Int’l Symp. Integrated Network Management (IM ’07), 2007 . 
[8] T. Wood, P. Shenoy, A. Venkataramani, and M. Yousif, “Black-Box and Gray-Box Strategies for Virtual Machine Migration,” Proc. Symp. Networked Systems Design and Implementation (NSDI ’07), Apr. 2007.

Currently there are no Refbacks

Paper Title : Social Mining to Progress the Procedure Potency Exploitation MapReduce
Authors : M.Jayasri, S Venkata Narayana,
Affiliations : M.Tech (CSE), Department of Computer Science & Engineering, NRI Institute of Technology
Professor, Department of Computer Science & Engineering, NRI Institute of Technology
Abstract :

af

Graphs are widely employed in massive scale social network analysis. Graph mining more and more necessary in modeling difficult structures like circuits, images, web, biological networks and social networks. The key issues occur during this graph mining are machine potency (CE) and frequent sub graph mining (FSM). Machine potency describes the extent to that the time, effort or potency that use computing technology in IP. Frequent Sub graph Mining is that the mechanism of candidate generation while not duplicates. FSM faces the matter on numeration the instances of the patterns within the dataset and numeration of instances for graphs. The most objective of this project is to handle atomic number 58 and FSM issues. The paper refer to within the reference proposes associate degree formula referred to as Mirage formula to unravel queries exploitation sub graph mining. The planned work focuses on enhancing associate degree unvarying MapReduce based mostly Frequent Sub graph mining formula (MIRAGE) to contemplate optimum machine potency. The check information to be thought-about for this mining formula may be from any domains like medical, text and social data’s (twitter).The major contributions are: associate degree unvarying Map Reduce based mostly frequent sub graph mining formula referred to as MIRAGE won’t to address the frequent sub graph mining drawback. Machine potency is going to be enlarged through MIRAGE formula over Matrix Vector Multiplication. Performance of the MIRAGE are going to be incontestable through totally different artificial likewise as world datasets. The most aim is to improvise the prevailing formula to boost machine potency.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


MapReduce, frequent sub graph mining, Social Mining.

M.Jayasri,S Venkata Narayana."Social Mining to Progress the Procedure Potency Exploitation MapReduce". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.756-761, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1111.pdf,

[1] Mansurul A Bhuiyan and Mohammad Al Hasan, “MIRAGE: An Iterative MapReduce based Frequent Subgraph Mining Algorithm”, ACM Computing Research Repository, arXiv: 1307.5894, Volume 1, 2013. 
[2] Yi-Chen Lo, Hung-CheLai, Cheng-Te Li and Shou-De Lin,” Mining and Generating Large Scaled Social Networks via MapReduce”, Springer-Verlag Advances in Social Networks Analysis and Mining, pp - 1449–1469, 2013. 
[3] SabaSehrish, Grant Mackey, Pengju Shang, Jun Wang and John Bent,”Supporting HPC Analytics Applications with Access Patterns Using Data Restructuringand Data-Centric Scheduling TechniquesinMapReduce” IEEE Transactions on Parallel and Distributed Systems, Volume 24, 2013.

Currently there are no Refbacks

Paper Title : Preserving Data Repossession for Decentralized Disruption-Tolerant Military Networks
Authors : Seelam Sowjanya, Dr Akbar Khan,
Affiliations : (M.Tech) –CSE, Nimra Institute of Science & Technology
Professor, Dept of CSE, Nimra Institute of Science & Technology,
Abstract :

af

Disruption-tolerant network (DTN) advancements are getting to be a productive provision that allow remote device passed on by officers to talk with each other and access the classified data or secret data by abusing outside storage nodes. This framework gives the effective situation to approval strategies and the solutions overhaul for secure data recovery in most difficult cases. The most encouraging cryptographic solutions are acquainted with control the access issues called Cipher text-Policy Attribute-Based Encryption (CP-ABE). The absolute most difficult issues in this situation are the requirement of approval solutions and the approaches upgrade for secure data recovery. On the other hand, the issue of applying CP-ABE in decentralized DTNs presents a few securities and protection challenges as to the attribute revocation, key escrow, and coordination of attributes issued from distinctive powers. In this paper, we propose a safe data recovery plan utilizing CP-ABE for decentralized DTNs where numerous key powers deal with their attributes independently. We exhibit how to apply the proposed component to securely and capably manage the characterized data scattered in the data dispersed in the Interruption or disruption tolerant network.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Access control, attribute-based encryption (ABE), disruption-tolerant network (DTN), multiauthority, secure data retrieval.

Seelam Sowjanya,Dr Akbar Khan."Preserving Data Repossession for Decentralized Disruption-Tolerant Military Networks". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.751-755, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1110.pdf,

[1] S. Roy and M. Chuah, “Secure data retrieval based on ciphertext policy attribute-based encryption (CP ABE) system for the DTNs,” Lehigh CSE Tech. Rep., 2009. 
[2] M. Chuah and P. Yang, “Performance evaluation of content-based information retrieval schemes for DTNs,” in Proc. IEEE MILCOM, 2007, pp. 1–7. 
[3] M. Kallahalla, E. Riedel, R. Swaminathan, Q. Wang, and K. Fu, “Plutus: Scalable secure file sharing on untrusted storage,” in Proc. Conf. File Storage Technol., 2003, pp. 29–42. 
[4] A. Harrinton and C. Jensen. Cryptographic access control in a distributed file system. In Proceedings of ACM SACMAT, 2003.
 [5] L. Ibraimi, M. Petkovic, S. Nikova, P. Hartel, and W. Jonker, “Mediated ciphertext-policy attribute-based encryption and its application,” in Proc. WISA, 2009, LNCS 5932, pp. 309–323.
[6] A. Lewko and B. Waters, “Decentralizing attributebased encryption,” Cryptology ePrint Archive: Rep. 2010/351, 2010. 
[7] A. Sahai and B. Waters, “Fuzzy identity-based encryption,” in Proc. Eurocrypt, 2005, pp. 457–473. 
[8] V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-based encryption for fine-grained access control of encrypted data,” in Proc. ACM Conf. Comput. Commun. Security, 2006, pp. 89–98.

Currently there are no Refbacks

Paper Title : Efficient BER Analysis of OFDM System over Nakagami-m Fading Channel
Authors : INDUGABILLI HEMANTH KUMAR, P.N.VENKATESWARA RAO,
Affiliations : (M.Tech) DECS from VITAM College of Engineering
Assistant Professor, ECE Dept. in VITAM College of Engineering, Andhra Pradesh, India.
Abstract :

af

In this paper we present an efficient technique for the BER of OFDM system over Nakagami–m fading channels, using well known characteristics function based analysis approach. The average BER expressed in terms of the higher transcendental function such as the confluent hyper geometric functions. Our numerical results show that depending on the number of channel taps, the BER performance may degrade with increasing values of Nakagami–m fading parameters. Phase noise causes significant degradiation of performance of the system. The effects of the pahse noise on the performancr of the OFDM sysytems have been analytically evaluated. In this project the BER and MSE performance of the OFDM system over multipath fadding channel was analysed.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Bit Error Rate (BER), Orthogonal Frequency division multiplexing (OFDM) system, Phase noise, RBF (Radial Basis Function) Network , signal to noise ratio (SNR).

INDUGABILLI HEMANTH KUMAR,P.N.VENKATESWARA RAO."Efficient BER Analysis of OFDM System over Nakagami-m Fading Channel". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.745-750, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1109.pdf,

[1] Orlandos Grigoriadis, H. Srikanth Kamath, “BER Calculation Using Mat lab Simulation for OFDM Transmission”, Proc. Of the International multi conference of engineering and computer Scientists, 19-21 March 2008, Hong Kong. 
[2] J. Lee, H.L. Lou, D. Toumpakaris, and J. M. Cioffi, “SNR Analysis of OFDM Systems in the Presence of Carrier Frequency Offset for Fading Channels” IEEE Trans. on wireless commun.vol. 5, no. 12, pp.3360- 3364, Dec. 2006 
[3] Ramjee Prasad, “OFDM for Wireless Communications Systems”, Artech House 2004.
 [4] Popovic, H., Stefanovic, D., Mitic, A., Stefanovic, I., “Some Statistical Characteristics of Nakagami-m Distribution”, 8th International Conf. on Telecom. In Modern Satellite, Cable and Broadcasting Services , 26-28 Sept. 2007 Serbia. 
[5] Marvin K. Simon, Mohamed- Slim Alouini, “Digital Communication over Fading Channels”, John Willy & Sons, 2000.
 [6] John G. Proakis, “Digital Communications,” McGraw-Hill, l995. 
[7] H. Suzuki, “A statistical model for urban multipath propagation”, IEEE Trans. Commun., vol. COM-25, pp. 673-680, July 1977. 
[8] Jin Goog Kim,Tae Joon and Jong Tae Lim, “Channel estimation for OFDM over Fast Rayleigh Fading Channels”, Proceedings of world Academy of science and technology, vol. 21, pp. 455-458, Jan. 2007. 
[9] Jun Lu, Thiang Tjhung,Fumiyuki Adachi and Cheng Li Huang, “BER performance of OFDMMDPSK system in Frequency –Selective Rician Fading with Diversity Reception”, IEEE Trans. On Vehicular Tech. vol. 49, no. 4, pp. 1216-1225, July 2000. 
[10] Yoshiya Miyagaki, N Moinaga, “Error probability Characteristics for CPSK signal in Nakagami fading channel”, IEEE Proc. vol. 26,no. 1, pp.88-100 Jan 1978. 
[11] M.S. Alouini and A. J. Goldsmith, “A unified approach for calculating error rates of linearly modulated signals over generalized fading channels”, IEEE Trans. Commun., vol. 47, no. 9, pp. 1324–1334, Sep. 1998 
[12] A. Annamalai, C. Tellambura, and V. Bhargava, “Unified analysis of equal-gain diversity on Rician and Nakagami fading channels,” in Proc. Wireless Commun. Networking Conf., 1999, pp.10– 14.
 [13] Z. Kang, K. Yao, and F. Lorenzelli, “Nakagami-m fading modeling in the frequency domain for OFDM system analysis”, IEEE Commun. Lett. , vol. 7, no. 10, pp. 484–486, Oct. 2003. [14] Zheng du,Julian Cheng and Norman C. Beaulieu, “Asymptotic BER performance of OFDM in Frequency Selective Nakagami-m Channels”, IEEE Conference on Vehicular Technology, vol. 1, pp. 612- 615,Sept.2004.
 [15] N.C. Beaulieu and J. Cheng, “Precise error rate analysis of bandwidth efficient BPSK in Nakagami fading and co-channel interference”, IEEE Trans. Commun. Vol.52, pp. 149-158, Jan. 2004.
 [16] A. A. Abu-Dayya, N.C. Beaulieu, “Micro diversity on Rician Fading Channels”, IEEE Trans on Commun., vol. 42, no. 6, June 1994.
 [17] I. S. Gradshteyn and I. M. Ryzhik, “Table of Integrals, Series, and Products”, 6th ed. San Diego, CA: Academic, 2000. 
[18] M. Abramowitz and I. A. Stegun, “Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables”, New York: Dover, 1972.
 [19] A. Abdi, H. Hashemi, and S. Nader-Esfahani, “On the PDF of the sum of random vectors”, IEEE Trans. Commun., vol. 48, no. 1, pp. 7–12, Jan. 2000. 
[20] A. Papoulis, “Probability, Random Variables, and Stochastic Processes”, 3rd ed. New York: McGraw-Hill, 1991. 
[21] Marvin K. Simon, Mohamed- Slim Alouini, “A Unified Approach to the Performance Analysis of Digital Communication over Generalized Fading Channels”, Proceedings of IEEE ,vol.86 no.9, pp. 1860-1877, Sep. 1998. 
[22] Zheng du,Julian Cheng and Norman C. Beaulieu, “Accurate Error Rate Performance Analysis of OFDM on Frequency Selective Nakagami-m Fading Channels,” IEEE Trans. on commun..vol. 54, no. 2, pp.319-328, Feb. 2006. 
[23] Neetu Sood, Ajay K Sharma, Moin Uddin, “BER Performance of OFDM-BPSK and -QPSK over Generalized Gamma Fading Channel”, International Journal of Computer Applications, vol. 3, no.6, pp.13-16, June 2010.


Currently there are no Refbacks

Paper Title : Estimate Transient Carrier Frequency offset by using Low Complexity Parametric Estimation Algorithm
Authors : SUDHAKAR BABU KASI, D APPANNA TATAJEE,
Affiliations : (M.Tech) DECS from Vitam College of Engineering
Associate Professor, ECE Dept. in VITAM College of Engineering, Andhra Pradesh, India.
Abstract :

af

- In this paper we are presenting the carrier frequency offset ,the primitive objective of this Paper is to estimate transient carrier frequency offset by using low complexity parametric estimation algorithm. We explore the modeling and estimation of the transient CFO, which is modeled as the response of an under damped second order system. To compensate for the transient CFO, we propose a low complexity parametric estimation algorithm, so in the proposed method we are estimated the CFO by using frequency domain in this method the signal is travelled in parallel so more signals can be send through this method.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


carrier frequency offset, time division duplex (TDD), orthogonal frequency division multiplexing (OFDM)

SUDHAKAR BABU KASI,D APPANNA TATAJEE."Estimate Transient Carrier Frequency offset by using Low Complexity Parametric Estimation Algorithm". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.733-738, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1107.pdf,

[1] P. O. Murphy, “Design, implementation and characterization of a cooperative communications system,” Ph.D thesis, Rice University, Houston, TX, USA, 2010.
 [2] Evolved Universal Terrestrial Radio Access (EUTRA); Physical Channels and Modulation, 3GPP TS 36.211 version 9.1.0 Release 9,Mar. 2010.
[3] Evolved Universal Terrestrial Radio Access (EUTRA); Physical layer procedures, 3GPP TS 36.213 version 10.1.0 Release 10, 2011. 
[4] A. Ghosh, R. Ratasuk, B. Mondal, N. Mangalvedhe, and T. Thomas, “LTE-Advanced: Next-generation wireless broadband technology,” IEEE Wireless Commun., vol. 17, no. 3, pp. 10–22, Jun. 2010.
[5] G. Bradford and J. Laneman, “A survey of implementation efforts and experimental design for cooperative communications,” in Proc. IEEE ICASSP, Dallas, TX, USA, Mar. 2010, pp. 5602– 5605. 
[6] G. Kramer, I. Mari´c, and R. Yates, Cooperative Communications, Foundations and Trends in Networking, vol. 1. Princeton, NJ, USA: Princeton Univ. Press, 2006, No. 3.
[7] D. Astély et al., “LTE: The evolution of mobile broadband,” IEEE Commun. Mag., vol. 47, no. 4, pp. 44–51, Apr. 2009. 
[8] G. Lu, B. Krishnamachari, and C. S. Raghavendra, “An adaptive energyefficient and low-latency MAC for data gathering in wireless sensor networks,” in Proc. 18th Int. Parallel Distrib. Process. Symp., Apr. 2004, p. 224.
[9] W. Ye, J. Heidemann, and D. Estrin, “Medium access control with coordinated adaptive sleeping for wireless sensor networks,” IEEE/ACM Trans. Netw., vol. 12, no. 3, pp. 493– 506, Jun. 2004. 
[10] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A survey on sensor networks,” IEEE Commun. Mag., vol. 40, no. 8, pp. 102–114, Aug. 2005. 
[11] R. E. Erickson and D. Maksimovic, Fundamentals of Power Electronics, 2nd ed. New York, NY, USA: Springer-Verlag, 2001. 
[12] M. T. Zhang, M. M. Jovanovic, and F. C. Lee, “Design considerations for low-voltage on-board dc/dc modules for next generations of data processing circuits,” IEEE Trans. Power Electron., vol. 11, no. 2, pp. 328– 337, Mar. 1996. 
[13] C. Gezgin, “Predicting load transient response of output voltage in dc–dc converters,” in Proc. IEEE Appl. Power Electron. Conf., 2004, pp. 1339–1344. 
[14] P. H. Moose, “A technique for orthogonal frequency division multiplexing frequency offset correction,” IEEE Trans. Communications, vol. 42, no. 10, pp. 2908–2914, Oct. 1994. 
[15] J. J. van de Beek,M. Sandell, and P. O. Borjesson, “ML estimation of time and frequency offset in OFDM systems,” IEEE Trans. Signal Process., vol. 45, no. 7, pp. 1800–1805, Jul. 1997.

Currently there are no Refbacks

Paper Title : Energy Efficient Multiple Access Scheme for Multi-User System with Improved Gain
Authors : DUKKA VENKATARAMANA, CHIRANJEEVULU BAGATHI,
Affiliations : (M.Tech) DECS from Vitam College of Engineering</br>Assistant Professor, ECE Dept. in VITAM College of Engineering, Andhra Pradesh, India.
Abstract :

af

In this paper we demonstrates development of the energy efficiency (EE) of multi-user multiple-input multiple-output (MIMO) orthogonal frequency-division multiple access (OFDMA) system, an Energy-efficient multiple access (EMA) scheme is proposed. It improves EE by selecting either time-division multiple access (TDMA) or spacedivision multiple access (SDMA) based on the no. of users or power consumption. Here, we introduced normalization process for power in OFDM system to improve the power gain. Numerical results verify that the EE and power gain can be significantly improved through the proposed EMA scheme.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Energy efficiency (EE), channel access method, multiple access method, time-division multiple access (TDMA), space-division multiple access (SDMA), orthogonal frequency division multiple access (OFDMA).

DUKKA VENKATARAMANA,CHIRANJEEVULU BAGATHI."Energy Efficient Multiple Access Scheme for Multi-User System with Improved Gain". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.739-743, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1108.pdf,

[1] S. Buzzi and H. V. Poor, “Joint receiver and transmitter optimization for energy-efficient CDMA communications,” IEEE J. Sel. Areas Commun., vol. 26, no. 3, pp. 459–472, Apr. 2008.
 [2] Y. Kim, G. Miao, and T. Hwang, “Energy efficient pilot and link adaptation for mobile users in TDD multi-user MIMO systems,” IEEE Trans. Wireless Commun., vol. 13, no. 1, pp. 382–393, Jan. 2014. 
[3] G. Miao, N. Himayat, and G. Y. Li, “Energyefficient link adaptation in frequency-selective channels,” IEEE Trans. Commun., vol. 58, no. 2, pp. 545–554, Feb. 2010.
[4] C. Isheden and G. P. Fettweis, “Energy-efficient multi-carrier link adaptation with sum ratedependent circuit power,” in Proc. IEEE GLOBECOM, Miami, FL, USA, Dec. 2010, pp. 1–6.
 [5] D. W. K. Ng, E. S. Lo, and R. Schober, “EnergyEfficient Resource Allocation in OFDMA Systems With Large Numbers of Base Station Antennas,” IEEE Trans. Wireless Commun., vol. 11, no. 9, pp. 3292–3304, Sep. 2012.
 [6] S. He, Y. Huang, S. Jin, and L. Yang, “Coordinated beamforming for energy efficient transmission in multicell multiuser systems,” IEEE Trans. Commun., vol. 61, no. 12, pp. 4961–4971, Dec. 2013. 
[7] S. He, Y. Huang, L. Yang, and B. Ottersten, “Coordinated Multicell Multiuser Precoding for Maximizing Weighted sum Energy Efficiency,” IEEE Trans. Signal Process., vol. 62, no. 3, pp. 741– 751, Feb. 2014. 
[8] J. Joung, C. K. Ho, and S. Sun, “Spectral efficiency and energy efficiency of OFDM systems: Impact of power amplifiers and countermeasures,” IEEE J. Sel. Areas Commun., vol. 32, no. 2, pp. 208– 220, Feb. 2014. 
[9] J. Joung, Y. K. Chia, and S. Sun, “Energyefficient, large-scale distributedantenna system (LDAS) for multiple users,” IEEE J. Sel. Topics Signal Process., 2014, (early access articles). 
[10] J. P. Kermoal, L. Schumacher, K. I. Pedersen, P. E. Mogensen, and F. Frederiksen, “A stochastic MIMO radio channel model with experimental validation,” IEEE J. Sel. Areas Commun., vol. 20, no. 6, pp. 1211– 1226, Aug. 2002. 
[11] J. Joung, C. K. Ho, and S. Sun, “Power amplifier switching (PAS) for energy efficient systems,” IEEE Wireless Commun. Lett., vol. 2, no. 1, pp. 14–17, Feb. 2013

Currently there are no Refbacks

Paper Title : A Computational Dynamic Trust Model for User Authorization
Authors : K.S. Harika Hampi, Prof. C.Uma Shankar , Dr. S.Prem Kumar
Affiliations : Pursuing M.Tech, CSE Branch,Dept of CSE
Registar Rastriya Sanskrit Vidyapeetha Tirupathi.Andhra Pradesh,India.
Professor & HOD, Department of computer science and engineering
G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.
Abstract :

af

Improvement of authorization process for protected information access by a large society of users in an open environment is an important problem in today’s Internet world. In this paper we propose a computational dynamic trust model for user authorization, rooted in findings from social science. Unlike most existing computational trust models, this model distinguishes trusting belief in integrity from that in capability in different contexts and accounts for subjectivity in the evaluation of a particular trustee by different trusters. Many Model studies were conducted to evaluate the presentation of the proposed integrity belief model with other trust models from the creative writing for different user behavior patterns. Results showed that the proposed model resulted in higher performance than other models especially in predicting the behavior of unbalanced users.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Authorization, security, trust, social-science

K.S. Harika Hampi,Prof. C.Uma Shankar,Dr. S.Prem Kumar."A Computational Dynamic Trust Model for User Authorization". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.727-732, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1106.pdf,

[1] G.R. Barnes and P.B. Cerrito, “A mathematical model for interpersonal relationships in social networks,” Social Networks, vol. 20, no. 2, pp. 179- 196, 1998.
 [2] R. Brent, Algorithms for Minimization Without Derivatives. Englewood Cliffs, NJ: Prentice-Hall, 1973. 
[3] A. Das, and M.M. Islam. “SecuredTrust: a dynamic trust computation model for secured communication in multiagent systems,” IEEE Trans. Dependable Sec. Comput., vol. 9, no. 2, pp. 261-274, 2012. 
[4] C. Dellarocas, “Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior,” in Proc. 2nd ACM Conference on Electronic Commerce, 2000, pp. 150- 157.
[5] L. Fan et al., “A grid authorization mechanism with dynamic role based on trust model,” Journal of Computational Information Systems, vol. 8, no. 12, pp. 5077-5084, 2012. 
[6] T. Grandison and M. Sloman, “A survey of trust in internet applications,” IEEE Communications Surveys, vol. 3, no. 4, pp. 2-16, 2000.
 [7] J.D. Hamilton, Time Series Analysis. Princeton, NJ: Princeton University Press, 1994. 
[8] J. Hu, Q. Wu, and B. Zhou, “FCTrust: A Robust and Efficient Feedback Credibility-Based Distributed P2P Trust Model,” In Proc. IEEE Ninth Int’l Conf. Young Computer Scientists (ICYCS ’08), 2008, pp. 1963-1968. 
[9] B. Lang, “A Computational Trust Model for Access Control in P2P,” Science China Information Sciences, vol. 53, no. 5, pp. 896-910, May, 2010.
[10] C. Liu and L. Liu, “A trust evaluation model for dynamic authorization,” In Proc. International Conference on Computational Intelligence and Software Engineering (CiSE), 2010, pp. 1-4. 
[11] X. Long, and J. Joshi, “BaRMS: A Bayesian Reputation Management Approach for P2P Systems,” Journal of Information & Knowledge Management, vol. 10, no. 3, pp. 341-349, 2011. 
[12]S. Ma and J. He, “A Multi-dimension dynamic trust evaluation model based on GA,” In Proc. 2nd International Workshop on Intelligent Systems and Applications, 2010, pp. 1-4. 
[13] S. Marsh, “Formalizing Trust as a Concept,” Ph.D. dissertation, Dept . Comp. Science and Math., Univ. Stirling, U.K., 1994. 
[14] P. Matt, M. Morge and F. Toni, “Combining Statistics and Arguments to Compute Trust,” In Proc. AAMAS, 2010, pp. 209-216.
 [15] D. McKnight, V. Choudhury and C. Kacmar, “Developing and validating trust measures for ecommerce: an integrative topology,” Information Systems Research, vol. 13, no. 3, pp. 334-359, September, 2002. [16] D. McKnight and N.L. Chervany, “Conceptualizing trust: a typology and e-commerce customer relationship model,” In Proc. HICSS-34, 2001.
 [17] W. Mendenhall and R.J. Beaver, Introduction to Probability and Statistics. Boston, MA: PWS-Kent Pub. Co., 1991. 
[18] A. Nagarajan and V. Varadharajan, “Dynamic trust enhanced security model for trusted platform based services,” Future Generation Computer Systems, vol. 27, pp. 564-573, 2011. 
[19] J.M. Pujol, R. Sangesa and J. Delgado, “Extracting reputation in multi agent systems by means of social network topology,” In Proc. AAMAS, 2002, pp. 467-474. 
[20] J. Sabater and C. Sierra, “Social ReGreT, a reputation model based on social relations,” ACM SIGecom Exchanges, vol. 3, no. 1, pp. 44-56, 2002. 
[21] F. Skopik, D. Schall and S. Dustdar, “Modeling and mining of dynamic trust in complex serviceoriented systems,” Information Systems, vol. 35, pp. 735-757, 2010. 
[22] F.E. Walter, S. Battiston and F. Schweitzer, “Personalized and Dynamic Trust in Social Networks,” In Proc. ACM Conference on Recommender Systems (RecSys’09), 2009, pp. 197- 204. 
[23] X. Wang and L. Wang, “P2P Recommendation Trust Model,” In Proc. IEEE Eighth Int’l Conf. Intelligent Systems Design and Applications (ISDA ’08), 2008, pp. 591-595. 
[24] B. Yu and M.P. Singh, “An evidential model of distributed reputation management,” In Proc. AAMAS, 2002, pp. 294-301. 
[25] Y. Zhang, S. Chen and G. Yang, “SFTrust: A Double Trust Metric Based Trust Model in Unstructured P2P Systems,” In Proc. IEEE Int’l Symp. Parallel and Distributed Processing (ISPDP ’09), 2009, pp. 1-7.

Currently there are no Refbacks

Paper Title : Audit Free Cloud Storage via Deniable attribute based Encryption
Authors : C.Anusha, M.Srilakshmi, Dr. S.Prem Kumar
Affiliations : Pursuing M.Tech, CSE Branch, Dept of CSE
Assistant Professor, Department of Computer Science and Engineering
Professor & HOD, Department of computer science and engineering, G.Pullaiah College of Engineering and Technology, Kurnool, Andhra Pradesh, India.
Abstract :

af

Cloud storage services have grow popularly. For the importance reason of privacy, many cloud storage encryption schemas has been proposed to secure the data from those who do not have access. All such schemes assumes that cloud storage providers are secure and cannot be hacked. However in practice, some authorities may compel cloud storage providers to make public user secrets and confidential data. We consider the problem of building a secure cloud storage service on top of a public cloud infrastructure where the service provider is not completely trusted by the customer. In this paper a new cloud storage encryption schema is proposed which allows cloud storage providers to protect user privacy. Since authorities cannot tell the obtained secrets are true or false, the cloud storage providers ensure that the user privacy is still securely provided. The proposed schemes believe cloud storage service providers or trusted third parties handling key management are trusted and cannot be hacked. Some times may intercept the communication between users and cloud storage providers and then compel storage providers to release user secrets by using government power or other means. In this case the encrypted data are assumed to be known and storage providers are requested to release user secrets. The proposed Deniable CP-ABE scheme is to build an Audit free cloud storage service. The deniability feature makes coercion invalid, and the ABE property ensures secure cloud data sharing with a fine grained access controlled mechanism.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


cloud storage, service providers, key management, attributes based Encryption, Deniable Encryption process.

C.Anusha,M.Srilakshmi,Dr. S.Prem Kumar."Audit Free Cloud Storage via Deniable attribute based Encryption". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.722-726, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1105.pdf,

[1] A. Sahai and B. Waters, “Fuzzy identity-based encryption,” in Eurocrypt, 2005, pp. 457–473. 
[2] V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-based encryption for fine-grained access control of encrypted data,” in ACM Conference on Computer and Communications Security, 2006, pp. 89–98.  
[3] J. Bethencourt, A. Sahai, and B. Waters, “Ciphertext-policy attribute-based encryption,” in IEEE Symposium on Security and Privacy, 2007, pp. 321–334. 
[4] B. Waters, “Ciphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization,” in Public Key Cryptography, 2011, pp. 53–70.
 [5] A. Sahai, H. Seyalioglu, and B. Waters, “Dynamic credentials and ciphertext delegation for attribute-based encryption,” in Crypto, 2012, pp. 199–217. 
[6] S. Hohenberger and B. Waters, “Attribute-based encryption with fast decryption,” in Public Key Cryptography, 2013, pp. 162–179. 
[7] P. K. Tysowski and M. A. Hasan, “Hybrid attribute- and reencryption-based key management for secure and scalable mobile applications in clouds.” IEEE T. Cloud Computing, pp. 172–186, 2013.
 [8] Wired. (2014) Spam suspect uses google docs; fbi happy. [Online]. Available: http://www.wired.com/2010/04/cloud-warrant/
 [9] Wikipedia. (2014) Global surveillance disclosures (2013present). [Online]. Available: http://en.wikipedia.org/wiki/Global surveillance disclosures (2013-present)

Currently there are no Refbacks

Paper Title : Reverse Super Edge-Magic Labeling on W-trees
Authors : S. Sharief Basha, ,
Affiliations : Applied Algebra Division, School of Advanced Sciences, VIT University, Vellore 632 014, Tamilnadu, India.
Abstract :

af

A reverse edge-magic labeling of a graph G is a one-to-one map f from V(G) E(G) on to the integers {1,2,3,…., } with the property that , there is an integer constant c such that f(xy)-{f(x)+f(y)}=c for any (x,y) ∈ E(G) . If f (V(G)) = {1,2,3,… } then the reverse edge – magic labeling is called reverse super edge-magic labeling . In this paper we formulate reverse super edge-magic labeling on w-trees.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Reverse super edge-magic labeling, w-graph, and w-tree

S. Sharief Basha."Reverse Super Edge-Magic Labeling on W-trees". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.719-721, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1104.pdf,

1. H.Enomoto,A.S.Llado, T.Nagamigawa and G.Ringle, Super edge-magic graphs,SUT J.Math, 34(1980), 105-109. 
2. GallianJ.A, A dynamic survey of graph labeling, Electronic J. Combinatorics 5 (1998) #DS6. 
3. Javid.M, Hussain.M, Ali.k, Dar.K.H, Super edge-magic total labeling on w-trees, Utilitas Math., 86(2011), 183-191. 
4. A.Kotzig and A.Rosa, Magic valuations of finite graphs, Canad. Math. Bull. 13 (1970), 451-461. 
5. Krishnappa H.K., Kishor Kottapalli, V.Ch. Venkaiah “On vertex magic total labeling of Complete graphs” AKCE Journal of Graphs and Combin, 6 No.1(2009) pp.143-154. 
6. MacDougall J. A, Mirka Miller, Slamin & W.D. Wallis, Vertex-magic total labeling of graphs, Utilitas Math. 61 (2002), 68-76. 
7. Sharief Basha S and Madhusudhan Reddy K, (2014), Reverse Magic Strength of Festoon Trees, Italian Journal of Pure and Applied Mathematics, No: 33, 191-200.
 8. Swaminathan V. and P. Jeyanthi, On super vertex-magic labeling, J. Discuss. Math. Sciences & Cryptography, 8 (2005) 217-224. 
9. Swaminathan V. and P. Jeyanthi, Super vertexmagic labeling, Indian J. Pure and Appl. Math., 34 (2003) 935-939. 
10. Venkata Ramana S and Sharief Basha S , (2010) On Reverse Super Edge- Magic labeling of Graphs, International Review of Pure and Applied Mathematics, 6(1), 181-188. 
11. D.B. West, an introduction to Graph Theory, Prentice – Hall (1996).

Currently there are no Refbacks

Paper Title : OBD-II: Power train and Emission Control in Passenger Vehicles
Authors : DR. PORAG KALITA, Ph.D. (Auto. Engg.) , ,
Affiliations : HEAD - Automobile Engineering Department, Vocational Education (+2), M R S Higher Secondary School, Govt. of Assam. Titabor, Jorhat, ASSAM, INDIA.
Abstract :

af

OBD-II provides additional information to engineer for diagnosis and repair of emissions related problems. OBD-II, standardizes on the amount of memory (Freeze Frame) it uses to store the readings of the vehicle sensor when it logs on emission related Intermittent Trouble code (IT). The intent of OBD-II, systems is to detect most vehicle malfunctions when performance of a power train component or system deteriorates to the point that the vehicle’s HC emission exceed standard. The vehicle operator is notified at the time when the vehicle begins to marginally exceed emission standards, by illuminating the Malfunctions Indicator Light (MIL).
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Crank angle Idle Air Control Valve, Malfunctions Indicator Light (MIL), Mass Air Flow (MAF) sensor. Power train, Tractive Resistance, UBHC Emission, etc.

DR. PORAG KALITA, Ph.D. (Auto. Engg.) ."OBD-II: Power train and Emission Control in Passenger Vehicles". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.713-718, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1103.pdf,

[1] Proceeding of SAE International Total Life Cycle Conference & Exposition in Michigan, USA, 2000. 
[2] SAE paper no. 2000-01-1477 by Dr.Porag Kalita, M R S Higher Secondary School, Titabor, Assam, India.
[3] Seminar On Board Diagnostics – II, by Prof. S. Ganeshan, Oakland University, USA/2000.

Currently there are no Refbacks

Paper Title : Experimental Study on Automobile Clutch Plate Juddering
Authors : DR. PORAG KALITA, Ph.D. (Auto. Engg.) , ,
Affiliations : HEAD - Automobile Engineering Department, Vocational Education (+2), M R S Higher Secondary School, Govt. of Assam. Titabor, Jorhat, ASSAM, INDIA.
Abstract :

af

The coupling of two working parts, for example two shaft, in such a way as to permit connection or disconnection at will without the necessity of bringing both parts to rest, and when connected to transmit the required amount of power without sign is known as Clutch and or, the friction or hydraulic actuated mechanism used for coupling two shafts or similar parts, one or which drives and the other of when is driven by the Clutch. Clutch plate assembly has three principal components i.e. Flywheel, Clutch plate and Pressure Plate. The device used is the Clutch which transmits the rotary motion of the engine to the transmission, which required by the driver and located between the engine and the gear box and which it connects and disconnects the two units smoothly without shock. As per the theory of the Clutch, first assumption is used in case of problems involving power absorption by friction. Second assumption is used in case of problems involving power transmission by friction between the surfaces.
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


Axial Load, Clutch plate, Clutch plate wearing, Clutch Slippage, Excessive vehicle weight Torque converter, Flywheel, Manual transmission, etc

DR. PORAG KALITA, Ph.D. (Auto. Engg.) ."Experimental Study on Automobile Clutch Plate Juddering". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.705-710, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1102.pdf,

[1]. Basic Auto motive engineering by Prof. C.P. Nakra, India. 
[2]. Automotive Design problem by K M Agrawal, India.
[3]. Proceeding of SAE 2001 India Mobility Conference & Exposition, USA 
[4]. Service Manual of Brakes India. 
[5]. Service Manual of Telco. 
[6]. Service Manual of Maruti. 
[7]. Course materials in Telco workshop Manager Training Programme in Jamshedpur, 1992. Reference No. 8805 770642 
[8] Automotive Service Business, a book by Dr. Porag Kalita,

Currently there are no Refbacks

Paper Title : Design and Simulation of High Speed Low Power CMOS Comparator
Authors : A.Rajeswari, T.Venkatarao,
Affiliations : (M.Tech) DECS Branch, Department of ECE
Asst.Professor, Department of ECE Vignan's Nirula Iinstitute of Technology & Science for Women Pedapalakaluru, Guntur, Andhra Pradesh, India
Abstract :

af

In high-speed high-resolution analog to digital converters, comparators have a key role in quality of performance. High power consumption and delay is one of the drawbacks of these circuits which can be reduced by using suitable architectures. Many versions of comparator are proposed to achieve desirable output in sub-micron and deep submicron design technologies. Back to-back inverter in the latch stage is replaced with dual-input single output differential amplifier. This topology completely removes the noise that is present in the input. The structure shows lower power dissipation and higher speed than the conventional comparators. The circuit is simulated with 0.8V DC supply voltage and 250 MHz clock frequency. The proposed circuit analyses the Inverter based differential amplifier design compared to double tail comparator is a less delay and controls the power dissipation. Finally output results shown by using T-Spice tool in TSMC018
:NOT ASSIGNED
DOI Link : NOT ASSIGNED


CMOS comparator, low power, High Speed, Analog-to-Digital Converter and Tanner EDA tool

A.Rajeswari,T.Venkatarao."Design and Simulation of High Speed Low Power CMOS Comparator". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.699-704, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1101.pdf,

[1] B. Goll and H. Zimmermann, “A comparator with reduced delay time in 65-nm CMOS for supply voltages down to 0.65,” IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 56, no. 11, pp. 810–814, Nov. 2009. 
[2] S. U. Ay, “A sub-1 volt 10-bit supply boosted SAR ADC design in standard CMOS,” Int. J. Analog Integer. Circuits Signal Process, vol. 66, no. 2, pp. 213–221, Feb. 2011. 
[3] A. Mesgarani, M. N. Alam, F. Z. Nelson, and S. U. Ay, “Supply boosting technique for designing very lowvoltage mixed-signal circuits in standard CMOS,” in Proc. IEEE Int. Midwest Symp. Circuits Syst. Dig. Tech. Papers, Aug. 2010, pp. 893–896. 
[4] B. J. Blalock, “Body-driving as a Low-Voltage Analog Design Technique for CMOS technology,” in Proc. IEEE Southwest Symp. Mixed-Signal Design, Feb. 2000, pp. 113–118. 
[5] M. Maymandi- Nejad and M. Sachdev, “1-bit quantiser with rail to rail input range for sub-1V __ modulators,” IEEE Electron. Lett, vol. 39, no. 12, pp. 894– 895, Jan. 2003. 
[6] Y. Okaniwa, H. Tamura, M. Kibune, D. Yamazaki, T.-S. Cheung, J. Ogawa, N. Tzartzanis, W. W. Walker, and T. Kuroda, “A 40Gb/s CMOS clocked comparator with bandwidth modulation technique,” IEEE J. Solid-State Circuits, vol. 40, no. 8, pp. 1680– 1687, Aug. 2005.
 [7] B. Goll and H. Zimmermann, “A 0.12 μm CMOS comparator requiring 0.5V at 600MHz and 1.5V at 6 GHz,” in Proc. IEEE Int. Solid-State Circuits Conf., Dig. Tech. Papers, Feb. 2007, pp. 316–317. 
[8] B. Goll and H. Zimmermann, “A 65nm CMOS comparator with modified latch to achieve 7GHz/1.3mW at 1.2V and 700MHz/47μW at 0.6V,” in Proc. IEEE Int. Solid-State Circuits Conf. Dig. Tech. Papers, Feb. 2009, pp. 328–329.
 [9] B. Goll and H. Zimmermann, “Low-power 600MHz comparator for 0.5 V supply voltage in 0.12 μm CMOS,” IEEE Electron. Lett, vol. 43, no. 7, pp. 388–390, Mar. 2007. 
[10] D. Shinkel, E. Mensink, E. Klumperink, E. van Tuijl, and B. Nauta, “A double-tail latch-type voltage sense amplifier with 18ps Setup Hold time,” in Proc. IEEE Int. Solid-State Circuits Conf., Dig. Tech. Papers, Feb. 2007, pp. 314–315.

Currently there are no Refbacks

 


Paper Title : Optimized control of Induction Heating System
Authors : Mrs. Asawari Dudwadkar , Dr. (Mrs.) Sayle Gha,
Affiliations : JJT University, Rajasthan, Asst. Prof., VESIT,Mumbai, India
Abstract :

af

In this paper a simple power and frequency control scheme is proposed for high power/high frequency Induction heating for Typical Heavy Industrial Applications like Induction Welding & Annealing which require operating on 100 kW / 100 kHz. The Proposed PI controller controls the load parameter values of R and L and thereby controls the resonance frequency of the whole model. The control scheme has the advantages of not only wide power regulation range but also ease of control output power. Also, it can achieve the stable and efficient Zero-Voltage-Switching in whole load range. The proposed method is described in detail and its validity is verified through simulink model. The model achieves proper power control for load ranging from 80 kW to 100kw.
:-NA-
DOI Link : NA


Induction heating, power control, PI controller

Mrs. Asawari Dudwadkar , Dr. (Mrs.) Sayle Gharge, “Optimized control of Induction Heating System”, International Journal Of Computer Engineering In Research Trends, 4(1):67-71, January-2017. [InnoSpace-2017:Special Edition]

[1] N. Mohan, T.M.Undeland, W.P.Robbins, “Power Electronic-Converters, Applications and Design", Second edition, John Wiley & Sons Inc., 1995.

[2]   O. Lucía, O. Jiménez, L. A. Barragán, I. Urriza, J. M
Burdío and D. Navarro, "System-on-programmable-           chip-based versatile modulation architecture applied to domestic induction heating," Industrial electronics, 2009. IECON '09. 35th Annual Conference of IEEE, Porto, 2009, pp. 2880-2885

[3] N. S. Bayindir, O. Kukrer and M. Yakup, "DSP-based PLL-controlled 50-100 kHz 20 kW high-frequency induction heating system for surface hardening and  welding applications," in IEE Proceedings – Electric Power Applications, vol. 150, no. 3, pp. 365-371,May 2003.

[4] J. Martis and P. Vorel, "Apparatus for induction heating 2.5 kW using a series resonant circuit," Mechatronics - Mechatronika (ME), 2014 16th International Conference on, Brno, 2014, pp. 130-135.

[5] T. Mishima, C. Takami and M. Nakaoka, "A New          Current Phasor-Controlled ZVS Twin Half-Bridge High-Frequency Resonant Inverter for Induction  Heating," in IEEE Transactions on Industrial Electronics, vol. 61, no. 5, pp. 2531-2545,May2014.

[6]   A. Amrhein and J. S. J. Lai, "A transformer-coupled,          Series-resonant topology for the induction heating of          aluminum cookware," 2015 9th International          Conference on Power Electronics and ECCE Asia          (ICPE-ECCE Asia), Seoul, 2015, pp. 1234-1239.

[7]   B. Saha and R. Y. Kim, "High Power Density Series          Resonant Inverter Using an Auxiliary Switched           Capacitor Cell for Induction Heating Applications,” In IEEE Transactions on Power Electronics, vol. 29   No. 4, pp. 1909-1918,April2014.

 [8] V. Esteveet al., "Improving the Reliability of             Series Resonant Inverters for Induction Heating             Applications," in IEEE Transactions on Industrial             Electronics, vol. 61, no. 5, pp. 2564-2572, May 2014. 

There are currently no refbacks

Paper Title : Bike Rider’s Safety Measures Using Helmet as a Key
Authors : Sanjeev Sahu, Lokesh Yadav, K Diwakar, Vibhor William
Affiliations : Mechatronics Engineering Department Chhatrapati Shivaji Institute of Technology Durg-491001, Chhattisgarh, India
Abstract :

af

Background/Objectives: The basic idea of the project is to make the helmet so smart that without wearing it the driver won’t be able to start the bike, so that it can ensure the safety of the riders. The main purpose of the project is to encourage wearing helmet. Method: The system design will be such that without wearing the helmet the rider cannot start two wheelers. The helmet will be connected to vehicle key ignition systems which will be electronically controlled. The smart helmet will be having micro switches fitted inside it, which will act as our switch for on/off ignition. It consist of a RF transmitter and an RF receiver system, the bike will not get started without wearing helmet by the driver, as the rider wear helmet an RF signals radiate from the transmitter and once these RF signals get sensed by the receiver placed in the ignition switch on the bike, bike will get started. Findings: People prefer motorcycles over the car as it is much cheaper to run, easier to repair, easier to park and flexible in traffic. In India more than 37 million people are using two wheelers. Since usage is high accident percentage of two wheelers are also high compared to four wheelers. Motorcycles have a higher rate of fatal accidents than trucks and buses. According to Ministry of Road Transport and Highways, Government of India there are around 1,44,391 bike accidents occurred in 2015 due to which 1,35,343 were injured and 36,803 were killed. Fatal injuries to the brain are an important reason behind deaths due to the road accidents. Therefore, a person riding a two wheeler must wear a helmet in order to protect his skull. Studies show that usage of helmet can save accident death by 30 to 40 percent. The risk of death is 2.5 times more among riders not wearing a helmet compared with those wearing a helmet. Riders wearing a helmet have a greater probability of survival during an accident. This project aims for accident avoidance, safety and security of bike riders. Applications: This can be used to minimize the accidents and casualties during riding can be used in broadcasting a message among the youth about the road safety and also a number of cases of violating traffic rules can be reduced.
:-NA-
DOI Link : NA


Smart Helmet, RF Module, Encoder/Decoder IC, Bike Authentication, Micro Switches, Keyless Bike, Relay Operation, Motor Driver IC, Bike Theft Prevention.

Sanjeev Sahu, Lokesh Yadav, K Diwakar, Vibhor William, “Bike Rider’s Safety Measures Using Helmet as a Key”, International Journal Of Computer Engineering In Research Trends, 4(1):61-66, January-2017. [InnoSpace-2017:Special Edition]

1.	Annual Report on ‘Road Accidents in India – 2015’, Transport Research Wing, Ministry of Road Transport and Highways, Government of India, New Delhi.

2.	Status Report on ‘Road Safety in India – 2015’, Transportation Research & Injury Prevention Programme (TRIPP), Indian Institute of Technology, New Delhi.

3.	Nitin Agarwal, Anshul Kumar Singh, Pushpendra Pratap Singh, Rajesh Sahani, Smart Helmet, International Journal of Engg. & Technology (IRJET) Vol. 2 Issue 2 ISSN (Online): 2395‐0056 (Print): 2395-0072 (May 2015).

4.	Manjesh N, Prof. 	Sudarshan Raju C H, Safety measures for two wheelers by Smart Helmet, International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 National Conference on Developments, Advances & Trends in Engineering Sciences (NCDATES), 09th & 10th January 2015.

5.	Amitava Das, Priti Das, Soumitra Goswami, Smart Helmet For Indian Bike Riders, Eleventh IRF International Conference, ISBN: 978-93-84209-47-6, 17th August 2014, Chennai, India.

6.	Ravi Nandu and Kuldeep Singh, Smart Helmet For Two-Wheelers, Advances in Automobile Engineering, ISSN: 2167-7670, Vol. 3 Issue 2, Department of Automobile Engineering, SRM University, Kattankulathur, Chennai, India.

7.	Manasi Penta, Monali Jadhav and Priyanka Girme, Bike Rider’s Safety Using Helmet, International Journal of Electrical Electronic Engineering and Telecommunications (IJEETC) ISSN: 2319-2518, Vol. 4, No. 2, Department of Electronics and Telecommunication, Dr. D Y Patil Technical Campus, Charoli (BK), Pune, India. 

There are currently no refbacks

Paper Title : Link quality based Ant based Routing Algorithm (LARA) in MANETs
Authors : C.V.Anchugam, Dr.K.Thangadurai,
Affiliations : Link quality based Ant based Routing Algorithm (LARA) in MANETs
Abstract :

af

Recently a new method is developed to handle the problem of routing in ad hoc network and overcomes the shortcomings of the classical methods; these methods are based on swarm intelligence inspired from biological swarms, such as ants in order to solve some complex problems such as finding food or optimizing route to food in real insect swarms. One of the most known routing algorithms for MANETs, as described Ant based Routing Algorithm (ARA) suffers from some limitations within the pheromone computing since it has not taken the necessary consideration to the characteristics of MANETs such as mobility and the medium constraint. Therefore, in our proposed enhancement to ARA called Link quality based ARA (LARA), it can be included the link quality in route selection and probability computing which have considerably improved the network performance and the system lifetime.
:-NA-
DOI Link : NA


MANETs, LARA, Routing, Link quality, Swarm Intelligence, Cross-layer.

C.V.Anchugam, Dr.K.Thangadurai, “Link quality based Ant based Routing Algorithm (LARA) in MANETs”, International Journal Of Computer Engineering In Research Trends, 4(1):52-60, January-2017. [InnoSpace-2017:Special Edition]

[1].	Al Agha K., Pujolle G., Vivier G., “Reseaux de mobiles et reseaux sans fil“, 2nd edition, Eyrolles, 2005. 
[2].	Basagni S., Chlamtac I., Syrotiuk V. R., Woodward B. A., “A Distance Routing Effect Algorithm for Mobility (DREAM)”, In Proceedings ACM/IEEE Mobicom, pages 76-84, October 1998.   
[3].	Camp, T., Boleng, J., Williams, B., Wilcox, L., Navidi, W.,  “Performance comparison of two location based routing protocols for ad hoc networks”, INFOCOM 2002, Twenty-First Annual joint conference of the IEEE Computer and Communications Societies, Proceedings, IEEE, Volume. 3, 2002,  pp. 1678 –168. 
[4].	Clausen T., Jacquet P., Viennot L., “Comparative Study of Routing Protocols for Mobile Ad hoc Networks”, Med-Hoc-Net’02, Sardegna, Italy, September 2002. 

[5].	Daniel Camara, Antonio Alfredo F. Loureiro, “A Novel Routing Algorithm for Hoc Networks”, Baltzer Journal of Telecommunications Systems, 18:1-3, Kluwer Academic Publishers, 2001, pp. 85-100.    
[6].	DiCaro G., Dorigo M., “Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks”, Proceedings PPSN V - Fifth International Conference on Parallel Problem Solving from Nature, Amsterdam, Holland, September 27-30, 1998, pp. 673-682.    
[7].	Gerharz M.L, De Waal C., Frank M., Martini P., “Link Stability in Mobile Wireless Ad Hoc Networks”, Proceedings of the 27th Annual IEEE Conference on Local Computer Networks (LCN), Tampa, Florida, November 2002.  
[8].	Gunes M., Sorges U., Bouazisi I., “ARA - the Ant Colony Based routing Algorithm for MANETs”, Proceedings ICPP Workshop on Ad hoc Networks, Vancouver, Canada, 2002, pp. 7985.  
[9].	Heusse M., Snyers D., Guérin S., Kuntz P., "Adaptive agent-driven routing and load balancing in communication network", Proceedings ANTS'98,First International Workshop on Ant Colony Optimization, Brussels, Belgium, October 15-16, 1998.   
[10].	Iwata A., Chiang C.-C., Pei G., Gerla M., Chen T.-W., "Scalable Routing Strategies for Ad Hoc Wireless Networks", IEEE Journal on Selected Areas in Communications, Special Issue on Ad-Hoc Networks, Aug. 1999, pp.1369-1379.   
[11].	Jacquet, Paul Muhlethaler, Amir Qayyum, Anis Laouiti, Laurent Viennot, Thomas Clausen, “Optimized Link State Routing Protocol”, Internet Draft, draft-ietf-manet-olsr-04.txt, work in progress, June 2001.   
[12].	Jagannathan Sarangapani, “Wireless Ad Hoc and Sensor Networks Protocols”, Performance, and Control”, Taylor & Francis Group, LLC, 2007. 
[13].	Jiang M., Li J., Tay Y. C., “Cluster Based Routing Protocol (CBRP)”, Functional Specification Internet Draft, draft-ietf-manet-cbrp.txt, work in progress, June 1999. 
[14].	Jinyang Li, John Janotti, Douglas S. J. De Coutu, David R. Karger, Robert Morris. “A Scalable Location Service for Geographic Ad Hoc Routing”, M.I.T. Laboratory for Computer Science.   
[15].	Johnson D., Maltz D., Y-C. Hu, Jetcheva J., “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks”, Internet Draft, draft-ietf-manet-dsr-09.txt, work in progress, April 2003. 
[16].	Ko Y.-B., V. N. H. “Location-Aided Routing in mobile Ad hoc networks”, In Proceeding ACM/IEEE Mobicom, October 1998, pp. 66-75. 
[17].	Mesut Gunes et. al, “ARA - the ant-colony based routing algorithm for MANETs”, In Stephan Olariu, Proceedings of the 2002 ICPP Workshop on Ad Hoc Networks (IWAHN 2002), IEEE Computer Society Press, August 2002, pp. 79-85. 
[18].	Navid Nikaein, Christian Bonnet, Neda Nikaein. “Hybrid Ad Hoc Routing Protocol – HARP”, proceeding of IST 2001: International Symposium on Telecommunications.  
[19].	Park V., Corson S., ”TORA (Temporally-Ordered Routing Algorithm routing protocol)”,  Internet Draft, draft-IETF-MANET-TORA-spec- 03.txt, work in progress, June 2001. 
[20].	Perkins C., Royer E., Das S., “Ad hoc On-demand Distance Vector (AODV) Routing”, Internet Draft, draft-ietf-manet-aodv-11.txt, work in progress, Aug 2002. 
[21].	Perkins C. E., Bhagwat P., “Highly Dynamic Destination-Sequenced Distance Vector (DSDV) for Mobile Computers”, Proceedings of the SIGCOMM 1994 Conference on Communications Architectures, Protocols and Applications, Aug 1994, pp 234-244.  
[22].	Siva Ram Nurthy C.,  Manoj B.S., “Ad hoc wireless networks Architectures and Protocols”, le Prentice Hall, 2004. 
[23].	Sridhar K. N., Lillykutty J., Rajeev S., “Performance Evaluation and Enhancement of Link Stability Based Routing for MANETs”, lst International Workshop on Mobile and Wireless Networking (MWN 2004), Montreal, Quebec, Canada, August 15, 2004.    
[24].	Tsu-Wei Chen, Mario Gerla, "Global State Routing: A New Routing Scheme for Ad hoc Wireless Networks", Proceedings IEEE ICC'98.   
[25].	White T., "Swarm intelligence and problem solving in telecommunications", Canadian Artificial Intelligence Magazine, Spring, 1997.    
[26].	White T., "Routing with swarm intelligence", Technical Report SCE-97-15, Systems and Computer Engineering Department, Carleton University, September, 1997.    
[27].	Zygmunt J. Haas, Marc R. Pearlman, Prince Samar, “The Bordercast Resolution Protocol (BRP)”, Internet Draft, draft- ietf-manet-zone-zrp-04.txt, work in progress, July 2002. 

There are currently no refbacks

Paper Title : A Comparative Study of Discovering Frequent Subgraphs – Approaches and Techniques
Authors : B.Senthilkumaran, Dr.K.Thangadurai,
Affiliations : P.G. and Research,Department of Computer Science, Government Arts College (Autonomous), Karur-05.
Abstract :

af

Graph mining is an important research vertical and recently the usage of graphs has become increasingly imperative in modeling problematic complex structures such as electrical circuits, chemical compounds, protein structures, bioinformatics, social networks, workflow diagrams, and XML documents. Plethora of graph mining algorithms has been developed and the primary objective of this paper is to present a detailed survey regarding the approaches and techniques employed to find the issues and complexities involved.
:-NA-
DOI Link : NA


Graph, Mining, complex structure, techniques, modelling

B.Senthilkumaran, Dr.K.Thangadurai, “A Comparative Study of Discovering Frequent Subgraphs – Approaches and Techniques”, International Journal Of Computer Engineering In Research Trends, 4(1):41-45, January-2017. [InnoSpace-2017:Special Edition]

1] Chen, M.S., Han,J.and Yu,P.S. 1996 Data mining – An overview from database perspective, IEEE Transaction on knowledge and data engineering 8 , 866-883
[2] Alm, E. and Arkin, A.P. 2003. Biological Networks, Current Opinion in Structural Biology 13(2), 193– 202.
[3] Nijssen, S. and Kok, J., Faster association rules for multiple relations. In IJCAI’01:  Seventeenth International Joint Conference on Artificial Intelligence, 2001, vol. 2, pp. 891–896.
[4] Chuntao Jiang, Frans Coenen and Michele Zito, A Survey of Frequent Sub-graph Mining Algorithms:The Knowledge Engineering Review, Vol. 00:0, 1–31.c 2004.
[5] A. Inokuchi, T.Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In PKDD’00.
[6] J. Huan, W.Wang, and J. Prins. Efficient mining of frequent subgraph in the presence of isomorphism. UNC computer science technique report TR03-021, 2003.  
[7] J. Huan, W. Wang, J. Prins, and J. Yang. Spin: Mining maximal frequent sub-graphs from graph databases. UNC Technical Report TR04-018, 2004.  
[8] M. Kuramochi and G. Karypis. Grew-a scalable frequent subgraph discovery algorithm. In ICDM, pages 439–442,2004.
[9] ZhaonianZou, Jianzhong Li, Hong Gao, and Shuo Zhang : Frequent Subgraph Patterns from Uncertain Graph Data. IEEE Transactions On Knowledge And Data Engineering, Vol. 22, No. 9, September 2010.
[10] L. T. Thomas, S. R. Valluri, and K. Karlapalem. Margin:Maximal frequent subgraph mining. Proc. 6th IEEE Int’l Conf. Data mining (ICDM ’06), pp. 1097-1101, 2006.
[11] Inokuchi, A., Washio, T., Nishimura, K. and Motoda, H. 2002. A Fast Algorithm for Mining Frequent Connected Subgraphs, Technical Report RT0448, IBM Research, Tokyo Research Laboratory, Japan.
[12] Huan, J., Wang, W. and Prins, J. 2003. Efficient Mining of Frequent Subgraph in the Presence of Isomorphism, In Proceedings of the 2003 International Conference on Data Mining, 549-552.


There are currently no refbacks

Paper Title : Detection and area calculation of brain tumour from MRI images using MATLAB
Authors : Suman Das, Nashra Nazim Siddiqui, Nehal Kriti and Surya Prakash Tamang
Affiliations : Sikkim Manipal Institute of Technology, Sikkim-737132, India
Abstract :

af

The main objective of our task is to recognize a tumour and its quantifications from a particular MRI scan of a brain image using digital image processing techniques. The motivation of our work is to provide an efficient algorithm for detecting the brain tumour and calculating its growth. This research describes the proposed strategy to detect & extraction of brain tumour from patient’s MRI scan images of the brain. This method incorporates with some noise removal functions, segmentation and morphological operations which are the basic concepts of image processing. Detection and extraction of tumour from MRI scan images of the brain is done by using MATLAB software.
:-NA-
DOI Link : NA


MRI, Brain Tumour, digital image processing, segmentation, morphology, MATLAB.

Suman Das, Nashra Nazim Siddiqui, Nehal Kriti, Surya Prakash Tamang, “Detection and area calculation of brain tumour from MRI images using MATLAB”, International Journal Of Computer Engineering In Research Trends, 4(1):37-40, January-2017. [InnoSpace-2017:Special Edition]

[1]	 Dou, W., Ruan, S., Chen, Y., Bloyet, D., and Constans, J. M. (2007), “A framework of fuzzy information fusion for segmentation of brain tumor tissues on MR images”, Image and Vision Computing, 25:164–171. 
[2]	 T.Logeswari and M.Karnan, “An Improved Implementation of Brain Tumor Detection Using Segmentation Based on Hierarchical Self Organizing Map”, International Journal of Computer Theory and Engineering, Vol. 2, No. 4, August, 2010,pp.1793-8201. 
[3]	 R. Rajeswari and P. Anandhakumar, “Segmentation and Identification of Brain Tumor MRI Image with Radix4 FFT Techniques”, European Journal of Scientific Research, Vol.52 No.1 (2011), pp.100-109.
[4]	 S.Murugavalli, V.Rajamani, “A high speed parallel fuzzy c-mean algorithm for brain tumor segmentation”, ”BIME Journal”, Vol no: 06, Issue(1), Dec.,2006.
[5]	 Oelze, M.L,Zachary, J.F. , O'Brien, W.D., Jr., Differentiation of tumor types in vivo by scatterer property estimates and parametric images using ultrasound backscatter , on page(s) :1014 - 1017 Vol.1, 5-8 Oct. 2003. 
[6]	 T. Logeswari and M. Karnan, An improved implementation of brain tumor detection using segmentation based on soft computing, Second International Conference on Communication Software and Networks, 2010. ICCSN‟10.Page(s): 147-151. 
[7]	Devos, A, Lukas, L.,Does the combination of magnetic resonance imaging and spectroscopic imaging improve the classification of brain tumours?? On Page(s): 407 – 410, Engineering in Medicine and Biology Society, 2004. IEMBS '04. 26th Annual International Conference of the IEEE, 1-5 Sept. 2004.
[8]	Mohammad Shajib Khadem, “MRI Brain image segmentation using graph cuts”, Master of Science Thesis in Communication Engineering, Department of Signals and Systems, Chalmers University Of Technology, Goteborg, Sweden, 2010. 


There are currently no refbacks

Paper Title : Design of a System to Import Common Information of an Applicant from a Centralized Database While Filling Online Recruitment Application Form
Authors : Govind Prasad Arya, Devendra Prasad,
Affiliations : Uttarakhand Technical University, Dehradun, Assistant Professor in Computer Science & Engineering Department, Shivalik College of Engineering, Dehradun, India
Abstract :

af

In the past recruitment application forms were filled on papers by the candidates and then the filled forms were sent to the recruitment organization through postal services. But in current scenario most of the recruitment organizations are providing the facility of filling application forms online to the candidates. The candidate fills various application forms on regular basis due to higher degree of unemployment. It takes quite long to fill an application form as so many information like name, father’s name, mother’s name, date of birth, gender, addresses, qualification details, work experience has to be filled by candidate every time while filling the application forms of each recruitment organization. Sometimes the candidate has to fill the same information multiple times due to improper internet connectivity. It is also difficult to fill an application form using mobile because of the complex application interface. The applicants who have good computer knowledge may be comfortable with the filling of such complex forms online but it is very tedious task for a candidate having little knowledge of computer. In this research paper we propose a system that will import the common information of an applicant from a centralized database while filling recruitment application forms of various organizations. It will minimize the overheads of filling online application form. The applicants will be able to fill application form by a single click on import button available on the GUI interface of an online application form. The applicants who have basic knowledge of computer system will also be able to fill their recruitment application forms using proposed system. Methods/Statistical analysis: We feel the problem personally while filling online recruitment application forms. Every time the candidates have to fill the same set of information which is time consuming. Findings: The common information of the candidates can be stored in a centralized database from which the candidate can import his/her data while filling online application forms. Improvements/Applications: We have proposed a system for filling of common information of candidates in online application form using a centralized database which contains common information of candidates. Using the system we can save our time by importing of common information from the centralized database
:-NA-
DOI Link : NA


Online Services, IT Professionals, Software Engineering, Online Application Form, Import Information, Centralized Database, Online Application form from centralized database.

Govind Prasad Arya, Devendra Prasad, “Design of a System to Import Common Information of an Applicant from a Centralized Database While Filling Online Recruitment Application Form ”, International Journal Of Computer Engineering In Research Trends, 4(1):30-32, January-2017. [InnoSpace-2017:Special Edition]

-NA-

There are currently no refbacks

Paper Title : Felicitation of cloths for poor & needy people of villages in India
Authors : Govind Prasad Arya, Deepa Arya, Devendra Prasad
Affiliations : Uttarakhand Technical University, Dehradun, Assistant Professor in Computer Science & Engineering Department, Shivalik College of Engineering, Dehradun, India
Abstract :

af

The food, cloths & houses are the basic needs of pupils. There are a number of people in the world were those living below poverty lines. They have not proper food to eat, clothes to cover their bodies and homes to live. The government is felicitating the poor and needy peoples in a number of ways. Indian government provides different types of RASHAN CARDS to the Indian families on the basis of various annual incomes i.e BPL, APL, KhadyaSuraksha cards to avail them basic foods. There are so many schemes to provide economic help to construct their homes like Indira AawasYogana. Besides these there are various schemes to provide employments to the poor people for their survival. In this research paper, we proposed a scheme/system that felicitates the need of cloth, shoes to the poor & needy peoples of any age of uttarakhand in initial stage & for the other states in further stages. Using the proposed system we collect unused/old cloth, shoes from capable (rich) peoples as a donation and after processing (tailoring, washing & packaging) distribute them to the needy peoples on a regular basis. The system will specially concentrate on children, woman of villages & be free from caste, region, religion. Methods/Statistical analysis: We collect the data from the villages of uttarakhand. A lot of poor people are not capable to buy sufficient cloths for them or for their children. We find the same situation in the rural area of Uttar Pradesh (U.P) also. Findings: Although the government is facilitating food, houses to the poor & needy peoples still there is a need of cloths to the poor peoples of the India, especially in the rural area. The proposed scheme will contribute to the betterment of society. Improvements/Applications: We have proposed a scheme for felicitation of cloth. The model is shown in below mentioned figure.
:-NA-
DOI Link : NA


Felicitation of cloth, Poor & needy people, Problems in rural areas, Donation of cloth, Help for poor children, Social work.

Govind Prasad Arya, Deepa Arya, Devendra Prasad, “Felicitation of cloths for poor & needy people of villages in India”, International Journal Of Computer Engineering In Research Trends, 4(1):33-36, January-2017. [InnoSpace-2017:Special Edition]

[1]https://en.wikipedia.org/wiki/List_of_government_schemes_in_India, Wikipedia Portal.
[2]http://india.gov.in/my-government/schemes, A government of India Portal.
[3]http://blogs.reuters.com/india/2013/07/23/a-look-at-some-of-indias-cheap-food-schemes/
byAdityaKalra, July, 2013.

There are currently no refbacks

Paper Title : New Method for Automatic Detection of Brain Tumor in Multimodal Brain Magnetic Resonance Images
Authors : Bhima K, Jagan A,
Affiliations : BVRIT Narsapur, Telangana, India.
Abstract :

af

Brain tumor is a one of the severe life altering disease and analysis of brain imaging is a most important task of visualizing the brain inner anatomical structures, analyzing brain tumor and surgical planning. Magnetic Resonance Imaging is used to diagnose a variety of diseases in the brain and it is found to be much superior to other techniques especially for brain tissues. The main advantage is that the soft tissue differentiation is extremely high for MRI. Image processing plays vital role in medical image analysis and Image segmentation is a most conman technique for analysis of MR imaging in many clinical applications. The parallel segmentation methods and techniques are expressed for the automatic detection of tumor in multimodal brain MR Image by existing state-of-art methods. However the specific results are not being projected and established in the similar researches. Hence, this proposed work tackles about automatic segmentation and detection of tumor in multimodal brain MR images. The main aim of the proposed work to achieve high segmentation accuracy and detection of tumor in the multimodal brain MR images and it was demonstrated in multimodal brain MR Images, viz. FLAIR MRI, T1 MRI, MRI and T2 MRI. The relative performance of the Proposed Method is demonstrated over existing methods using real brain MRI and open brain MRI data sets.
:-NA-
DOI Link : NA


Brain Tumor, Watershed Method, FCMC method, Proposed Method, Bilateral Filter, Brain MR Image.

Bhima K, Jagan A, “New Method for Automatic Detection of Brain Tumor in Multimodal Brain Magnetic Resonance Images ”, International Journal Of Computer Engineering In Research Trends, 4(1):26-29, January-2017. [InnoSpace-2017:Special Edition]

1)	N Van . Porz, "Multi-modalodal glioblastoma segmentation: Man versus machine", PLOS ONE, vol. 9, pp. e96873, 2014.
2)	S. Bauer, R. Wiest, L.-P. Nolte and M. Reyes, "A survey of MRI-based medical image analysis for brain tumor studies", Phys. Med. Biol., vol. 58, no. 13, pp. R97-R129, 2013.
3)	L. Weizman, "Automatic segmentation, internal classification, and follow-up of optic pathway gliomas in MRI", Med. Image Anal., vol. 16, no. 1, pp. 177-188, 2012.
4)	S. Ahmed, K. M. Iftekharuddin and A. Vossough, "Efficacy of texture, shape, and intensity feature fusion for posterior-fossa tumor segmentation in MRI", IEEE Trans. Inf. Technol. Biomed., vol. 15, no. 2, pp. 206-213, 2011.
5)	Jin Liu, Min Li, Jianxin Wang, Fangxiang Wu, Tianming Liu, and Yi Pan,A Survey of MRI-Based Brain Tumor Segmentation Methods, TSINGHUA SCIENCE AND TECHNOLOGY, Volume 19, Number 6, December 2014.
6)	J. B. T. M. Roerdink and A. Meijster, “The watershed transform: Definitions, lgorithms and parallelization strategies,” Fundamenta Informaticae,vol. 41, pp. 187–228, 2000.
7)	Gang Li , Improved watershed segmentation with optimal scale based on ordered dither halftone and mutual information, Page(s) 296 - 300, Computer Science and Information Technology (ICCSIT), 2010, 3rd IEEE International Conference, 9-11 July 2011.
8)	Benson. C. C, Deepa V, Lajish V. L and Kumar Rajamani, "Brain Tumor Segmentation from MR Brain Images using Improved Fuzzy c-Means Clustering and Watershed Algorithm",  Intl. Conference on Advances in Computing, Communications and Informatics (ICACCI), Sept. 21-24, 2016, Jaipur, India.
9)	L´aszl´o Szil´agyi,L´aszl´o Lefkovits and Bal´azs Beny´o, "Automatic Brain Tumor Segmentation in Multispectral MRI Volumes Using a Fuzzy c-Means Cascade Algorithm",  12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD),2015.
10)	G.-C. Lin, W.-J. Wang, C.-C. Kang and C.-M. Wang, Multispectral mr images segmentation based on fuzzy knowledge and modified seeded region growing, Magnetic Resonance Imaging, vol. 30, no. 2, pp. 230-246, 2012.
11)	NageswaraReddy P, C.P.V.N.J.Mohan Rao, Ch.Satyanarayana, Optimal Segmentation Framework for Detection of Brain Anomalies, I.J. Engineering and Manufacturing, 2016, 6, 26-37.

There are currently no refbacks

Paper Title : A Study on Online Chatting and Blogging among Teens Age in Southwest Part of Nigeria and Its Impact: A Digital Dividend
Authors : Oyebola Blessed Olalekan, Ajayi Adeola,
Affiliations : Department of Computer Engineering Technology, Gateway (ICT) Polytechnic Saapade, Nigeria, 2Institute for Entrepreneurship and Development Studies Obafemi Awolowo University, Nigeria
Abstract :

af

The study surveyed the use of the Internet and social networking media as digital dividend among undergraduate students in Nigerian Polytechnic. A total of 700 questionnaires were distributed using a frequency count and percentage to select the respondents. A total of 527 questionnaires was retrieved were used for the survey. The findings revealed a high percentage use Internet and social networking media. The access point for them is mobile phones. The institution, though linked to the Internet is yet to provide access to students. Respondents subscribed for the access time through their pocket money. The use of the Internet among the students has affected the use of the school library because they claimed they got everything they needed to get in the library from the internet. Some problems they face in their use of the Internet include slowness of the server, electricity for charging their mobile phones and payment for the access time. The study recommends that the polytechnic should provide good access points for students and make it available in the library too.
:-NA-
DOI Link : NA


Access, Internet, Networking;, Social, Student, Telecommunication.

Oyebola Blessed Olalekan, Ajayi Adeola, “A Study on Online Chatting and Blogging among Teens Age in Southwest Part of Nigeria and Its Impact: A Digital Dividend”, International Journal Of Computer Engineering In Research Trends, 4(1):21-25, January-2017. [InnoSpace-2017:Special Edition]