Log in || Register editor@ijlret.com

Vol. 03, No. 01 [January 2017]

Country :: India
Page Number :: 01-14
Self compacting concrete requires no external or internal compaction as it is leveled and compacted under its own weight. Self compacting concrete is highly engineered concrete with much higher fluidity without segregation and bleeding. The three main requirement of self compacting concrete are filling ability, passing ability and resistance to segregation. Plenty of availability natural resources in the past have become a dream for present day engineering society due to large scale consumptions. To overcome the problem of scarcity of natural aggregates and to save the environment from the pollution of dumping, civil engineers opined that there is significance potential for reuse of slag in value added application to maximize economic and environment benefit. Here an attempt has been made in this investigation to determine the strength characteristics of slag for application in self compacting concrete (SCC). It is found that ACI-1985 predicts closely to the test values while the others overestimate in 7 days test. The predicated values by Yun Wang Choi (2004) and Hueste et al (2004) overestimate while ACI-1985, ACI-1992, and ACI-1995 underestimate the test results in 28 days. Flexural strength is found to be increasing with increasing in the percentage of slag. ACI-1992,overestimate the values, IS-456-2000 and ACI-1985 well predicts the test values while Foster F Z-1995 underestimates the values.
[1]. EFNARC, "Specifications and Guidelines for Self-Compacting Concrete", EFNARC, UK (www.efnarc.org), pp. 1-32, February 2002.
[2]. Song, A. J. and Kang, G. Shanxi Jiaocheng Yiwang. practice of ferroalloy production in an environment-friendly and recycling. Ferroalloys Works, China,2011.
[3]. Okamura H, Ouchi M. "Self-compacting concrete. Development, present use and future" First International RILEM symposium on self-compacting concrete. Rilem Publications s.a.r.l., pp. 3–14, 1999.
[4]. Nan Su, Kung-Chung Hsu and His-Wen Chai, "A simple mix design method for self-compacting concrete" Cement and Concrete Research, 31, pp. 1799–1807, 2001.
[5]. Bertil Persson, "A comparison between mechanical properties of self-compacting concrete and the corresponding properties of normal concrete" Cement and Concrete Research, 31, pp. 193-198, 2001.

Paper Title :: MARKET BASKET ANALYSIS FOR DATA MINING: concepts and techniques
Author Name :: P. ARPITHA
Country :: India
Page Number :: 15-20
Data mining (DM), also called Knowledge-Discovery in Databases (KDD), is the process of automatically searching large volumes of data for patterns using specific DM technique. The efficient discovery of previously unknown, valid, potentially useful, understandable patterns in large datasets. The analysis of (often large) observational data sets to find unsuspected relationships and to summarize the data in novel ways that are both understandable and useful to the data owner. Association rule mining represents a data mining technique and its goal is to find interesting association or correlation relationships among a large set of data items. With massive amounts of data continuously being collected and stored in databases, many companies are becoming interested in mining association rules from their databases to increase their profits. For example, the discovery of interesting association relationships among huge amounts of business transaction records can help catalog design, cross marketing, loss leader analysis, and other business decision making processes. If/then statements that help uncover relationships between seemingly unrelated data in a relational database or other information repository A typical example of association rule mining is market basket analysis. This process analyzes customer buying habits by finding associations between the different items that customers place in their "shopping baskets" using confidence and support factors.
Key words: data mining, association rule, market basket analysis, knowledge discovery, support and confidence factors.
[1]. Jiawei Han and Micheline Kamber, "Data Mining: Concepts and Techniques", 2 edition (4 Jun 2006)
[2]. Gordon S. Linoff and Michael J. Berry, "Data Mining Techniques: For Marketing, Sales, and Customer Relationship Management", 3rd Edition edition (1 April 2011)
[3]. Vipin Kumar and Mahesh Joshi, "Tutorial on High Performance Data Mining ", 1999
[4]. Rakesh Agrawal, Rama krishnan Srikan, "Fast Algorithms for Mining Association Rules", Proc VLDB, 1994
[5]. Rakesh Agrawal and Ramakrishna Srikant Fast algorithms for mining association rules in large databases. Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, pages 487-499, Santiago, Chile, September 1994.

Paper Title :: Application of A* and GA for Path Planning of Mobile Robots: A Comparative Study
Author Name :: Deepanjali Mundari || Madhusmita Panda
Country :: India
Page Number :: 21-27
In this paper there is a comparative study of different algorithms for path planning of a mobile robot to successfully reach a target in a known environment. The algorithms are A*Algorithm and Genetic Algorithm (GA) respectively which allows a mobile robot to navigate through static obstacles and find the path in order to reach target without collision. Here the mobile robot concerned is an AUV. The above strategy is designed in a 2-D grid map form of known environment and static obstacles. When the mission is executed it is necessary to plan an optimal or feasible path for itself avoiding obstructions on its way and minimise a cost such as computational time and path distance. The algorithms are implemented in Matlab and the results are compared.
Keywords: Path Planning, A*Algorithm, Genetic Algorithm, Mobile robot, AUV
[1]. J. Barraquand, J. C. Latombe and B. Langlois, "Numerical Potential Field Techniques for Robot Path Planning," IEEE Transaction on System,Man and Cybernetics, vol. 22, no. 2, March,1992.
[2]. Y. H. Lui and S. Arimoto, "Computation of the Tangent Graph of Polygonal obstacles by Moving line processing," IEEE Transaction on Robotics and Automation, vol. 10, no. 6, Dec,1994.
[3]. O. Takahashi and R. J. Schilling, "Motion Planning in a plane using generalised Voronoi Diagrams," IEEE Transactions on Robotics and Automation, vol. 5, no. 2, April,1987
[4]. R. Zhou and E. A. Hansen, "Breadth First Heuristic Search," Elsevier, Artificial Intelligence, pp. 385- 408, 2006.
[5]. R. E.Korf, "Depth First Iterative Deepening :An optimal Admissible Tree Search," Elsevier, vol. Artificial Intelligence 27, pp. 97-109, 1985.

Author Name :: Dr. H. Lilly Beaulah || Mrs. Latha P S || Mrs. Subaira A S
Country :: India
Page Number :: 28-41
Data has become an essential part of every Economy, Production, Organization, Business function and individual. The amount of data in world is growing day by day because of use of internet, Smartphone, social network, fine tuning of ubiquitous computing and many other technological advancements. Big Data is a term used to identify the datasets that whose size is beyond the ability of typical database software tools to store, manage and analyses. Generally size of the data is Petabyte and Exabyte. Most of the data is partly structured, unstructured or semi structured and it is heterogeneous in nature. Due to its specific nature, Big Data is stored in distributed file system architectures. Hadoop and HDFS by Apache are widely used for storing and managing Big Data. In the same way, Cloud computing has changed the entire process that distributed computing used to present e.g. Grid computing, server client computing. Cloud computing security is an important aspect of quality of service from cloud service providers. Security concerns arise as soon as one begins to run applications beyond the designated firewall and move closer towards the public domain. In violation of security in any component in the cloud can be disaster for the organization (the customer) as well as for the provider. Likewise using the cloud storage, users store their data on the cloud without the burden of data storage and maintenance and services and high-quality applications from a shared pool of configurable computing resources. Cryptography is probably the most important aspect of communications security and is becoming increasingly important as a basic building block for computer security, as data sharing is an important functionality in cloud storage. As a result in this paper, we propose a new approach towards big data in secured cloud computing along with efficient system for scalable data sharing to develop and enhance smart cities.
[1]. On technical security issues in cloud computing , Meiko Jensen etal, 2009
[2]. Cloud computing security issues and challenges, Balachandran reddy et al, 2009
[3]. Cloud Computing security issues and challenges Kresimir Popovic, et al, 2010
[4]. Dikaiakos, M.D., Katsaros, D., Mehra, P., et al.: Cloud Computing: Distributed Internet Computing for IT and Scientific Research 13, 10–13 (2009)
[5]. Amazon Web Services. Amazon Virtual private Cloud, http://aws.amazon.com/vpc/

Paper Title :: A Virtual Ground Based SRAM Cell with NBTI Recovery Boosting
Author Name :: R.ILAIYARAJA || S. SedhuMadhavan || M.Sumathi
Country :: India
Page Number :: 42-48
SRAM are the most promising high speed memory elements which are used in most of the Processors and controllers. Although the effect of leakage currents in SRAM memories is a great problem for the future architectures. In this paper we are going to redesign the SRAM for the purpose of more power & area reduction than the existing type of designs as well as the new design which is combined of NBTI Stability Improvement with read Error Reduction Logic and with Process Variation Tolerance Effect is Proposed and it‟s compared with the existing technologies & the nanometer technology. The simulations were carried out using Tanner EDA Tools. The Simulations are done under TSMC018 technology rules.
Keywords: NBTI Reduction, Recovery Boosting, SRAM Design, Process Variation Tolerance.
[1]. Saumya Jain, K. Santhosh , Manisha Pattanaik , Balwinder Raj, "A 10-T SRAM cell with Inbuilt Charge Sharing for Dynamic Power Reduction" IEEE J. of Solid-State Circuits, 2013
[2]. International Technology Roadmap for Semiconductors 2011, http://www.itrs.net/Common/2011ITRS/Home2011.htm.
[3]. N.K. Shukla, S. Birla, M. pattanaik, "Speed and Leakage Power Tradeoff in Various SRAM Circuits," International Journal of Computer and Electrical Engineering, Vol. 3, No. 2, April, 2011
[4]. J. Chang, D. Mohapatra, K. Roy, "A Priority-Based 6T/8T Hybrid SRAM Architecture for Aggressive Voltage Scaling in Video Applications," IEEE Transactions On Circuits And Systems For Video Technology, Vol. 21, no. 2, pp.101-112, Feb. 2011.
[5]. N. Verma, A.P. Chandrakasan, "A 256 kb 65 nm 8T Subthreshold SRAM Employing Sense-Amplifier Redundancy," IEEE J. of Solid-State Circuits, vol.43, no.1, pp.141-149, Jan. 2008.

Author Name :: Dr. Mai Van Nam || Dr. Vuong Quoc Duy
Country :: Vietnam
Page Number :: 49-58
The paper used ARIMA model to predict the change of stock price of Vinamilk joint-stock company. The stock price data have investigated from 2006 to 2015. Because this chain of figures was non-constant, we made most difference of the figures. Then, we got new chain of figure whose fluctuation trended around the average. Also, when looking into auto-correlation diagram and partial correlation diagram, after making the most difference, we got figure chain that had stationary because the figure fluctuated around the fixed average. Then, we continually used stata 12 software and determined ARIMA (0,1,1) model was the most suitable model to predict stock price of Vinamilk joint-stock company in the future. The results showed that the stock price of Vinamilk joint-stock company have tended to increase and stable in the next few years, with the increase level from 100 to 140. The result can be used as foundation for the investors who can feel secure for investigating for this stock.
Keywords: stock price, predict, ARIMA model, Box - Jenkins methodology
[1]. Vu Thi Guong (2012), "Panel Data Mining applied in predicting the stock price" Master Thesis, Technology Communication College.
[2]. Mai Văn Nam, Pham Le Thong, Le Tan Nghiem va Nguyen Van Ngan, 2004.Econometrics. Ho Chi Minh, Statistical Publication.
Website :
[3]. http://www.academia.edu/7745654/Tuy%E1%BB%83n_%E1%BB%A8NG_D%E1%BB%A4NG_M%C3%94_H%C3%8CNH_ARIMA_%C4%90%E1%BB%82_D%E1%BB%B0_B%C3%81O_VNINDEX_APPLICATION_OF_ARIMA_MODEL_TO_FORECAST_VNINDEX_GVHD_TS._V%C3%B5_Th%E1%BB%8B_Th%C3%BAy_
[4]. http://hocthuat.vn/tai-lieu/ung-dung-mo-hinh-arima-de-du-bao-vn-index-20682
[5]. http://www.baomoi.com/du-bao-tang-truong-va-lam-phat-nam-2014-va-2015/c/13640168.epi

Country :: India
Page Number :: 59-62
Desalination methods are used to convert saline/brackish water to drinkable freshwater. Major processes use either thermal energy (conventional distillation) or pressure energy (Reverse osmosis). Different methods of desalination are discussed and their influence on overall water production has been highlighted. With the increase in appreciation for a green technology, desalination methods using renewable/waste energy are drawing significant attention in recent years
Keywords: Desalination, Distillation, MED MSF and Thermal method.
[1]. Water, The Power, Promise, and Turmoil of NorthAmerica's Fresh Water, National Geographic Special Edition, November 1993.
[2]. A.A. Alawadhi, Regional Report on Desalination-GCC Countries, in: Proceedings of the IDA World Congress on Desalination and Water Reuse,Manama, Bahrain, March 8–13, pp. 2002.
[3]. Drinking Water from the Sea, Middle East Electricity,April 2005, pp. 21–22.
[4]. IDA Desalting Inventory 2004: DesalinationBusiness Stabilized on a High Level, Int. Desal. Water Reuse, 14 (2) (2004) 14–17.
[5]. IDA Desalination Inventory Report, No. 17, InternationalDesalination Association, Topsfield, MA,USA.

Paper Title :: Estimation of position and orientation of the target point from image information for robot controlling
Author Name :: Anish Mon T.S || Prof. A.R Peter
Country :: India
Page Number :: 63-68
This paper presents the aspects of finding the coordinates of the robot end-effector target point. In manufacturing industries were using robots for many applications like assembling, drilling etc.in this processes object recognition, object tracking are necessary operations to perform. Object tracking in this area constitutes an important issue for vision assisted robot control. This paper describes the real time computation of relative pose estimation of robot end effector with respect to the targeted objects using image information and an algorithm to find position and orientation of the target. The algorithm should use as few feature points as possible during estimation such as centre of gravity (cog) of blobs, pixel coordinates in the image plane. The pose estimation is done through Dementhon linear approach and the iterations are done to get the pose of the objects till converges to the solution with lower error vector.
Keywords: pose, eye in hand, perspective projection.
[1]. Wen-Fang Xie1, Zheng Li1, Claude Perron2 and Xiao-Wei Tu1, Switching Control of Image Based Visual Servoing in an Eye-in-Hand System using Laser Pointer,
[2]. Baird, H.S. 1985. Model-Based Image Matching Using Location.MIT Press: Cambridge, MA.
[3]. Beis, J.S. and Lowe, D.G. 1999.
[4]. Indexing without invariants in 3D object recognition. IEEE Trans. Pattern Analysis and MachineIntelligence, 21(10):1000–1015
[5]. Beveridge, J.R. and Riseman, E.M. 1995. Optimal geometric modelmatching under full 3D perspective. Computer Vision and Image Understanding, 61(3):351-364.

Copyright © 2015 IJLRET. All Right Reseverd Home   Editorial Board   Current Issue   Contact Us