Ravi (Ravinder) Prakash G
Senior Professor Research, BMS Institute of Technology & Management, Dodaballapur Road, Avalahalli Yelahanka, Bengaluru, India, , , **[1]. Ravi Prakash G, Kiran M and Saikat Mukherjee. 2014. On Randomized Preference Limitation Protocol for Quantifiable Shuffle and Sort Behavioral Implications in MapReduce Programming Model. Parallel & Cloud Computing 3, Issue 1, 1-14. [2]. Greenlaw, R. and Kantabutra. 2008. On the parallel complexity of hierarchical clustering and CC-complete problems. Complexity 14, 18-28. (doi:10.1002/cplx.20238) [3]. Ravi (Ravinder) Prakash G, Kiran M. 2014. On The Least Economical MapReduce Sets for Summarization Expressions. International Journal of Computer Applications 94, 13-20. (doi: 10.5120/16354-5732) [4]. Amazon Elastic MapReduce. https://aws.amazon.com/elasticmapreduce/ [5]. Steven M. LaValle. 2006. Planning Algorithms. Cambridge University Press, New York, NY, USA. [6]. N. Ailon, B. Chazelle, S. Comandur, D. Liu. 2007. Estimating the Distance to a Monotone Function. Random Structures and Algorithms 31, 371-383. (doi:10.1002/rsa.20167) [7]. A. Gavish, Abraham Lempel. 1996. Match-length functions for data compression. IEEE Transactions on Information Theory 42, 1375-1380. (doi:10.1109/18.532879) [8]. Michael Drmota. 2009. Random Trees: An Interplay between Combinatorics and Probability (1st ed.). Springer Publishing Company, Incorporated.. [9]. Ping Wah Wong. 1997. Rate distortion efficiency of subband coding with crossband prediction. IEEE Transactions on Information Theory 43, 352-356. (doi:10.1109/18.567761) [10]. A. Lafourcade, Alexander Vardy. 1996. Optimal sectionalization of a trellis. IEEE Transactions on Information Theory 42, 689-703. (doi: 10.1109/18.490504) [11]. T.M. Cover. 1998. Comments on Broadcast Channels. IEEE Transactions on Information Theory 44, 2524-2530. (doi: 10.1109/18.720547) [12]. A. Lapidoth and P. Narayan. 1998. Reliable Communication Under Channel Uncertainty. IEEE Transactions on Information Theory 44, 2148-2177. (doi:10.1109/18.720535) [13]. David K. Ruch, Patrick J. Van Fleet, (October 2009). Wavelet Theory: An Elementary Approach with Applications, 504 pages pages, SBN: 978-0-470-38840-2. [14]. Alexander Schrijver, 2004, Combinatorial Optimization Polyhedra and Efficiency, Volume A-C, Algorithms and Combinatorics 24, Pages: CIV, 1879, Springer-Verlag, ISBN 978-3-540-44389-6. [15]. Leo Breiman. 1993. Hinging hyperplanes for regression, classification, and function approximation. IEEE Transactions on Information Theory 39, 999-1013. (doi:10.1109/18.256506) [16]. S. R. Kulkarni, D. N.C. Tse. 1994. A paradigm for class identification problems. IEEE Transactions on Information Theory 40, 696-705. (doi:10.1109/18.335881) [17]. Donald Miner, Adam Shook, 2013, "MapReduce Design Patterns" O’Reilly Media, Inc.: 978-1-449-32717-0. [18]. Rudolf F. Ahlswede, Zhen Zhang. 1994. On multiuser write-efficient memories. IEEE Transactions on Information Theory 40, 674-686. (doi:10.1109/18.335880) [19]. B. Chazelle. 2000. The Discrepancy Method: Randomness and Complexity. Cambridge University Press. 978-0-521-77093-9. [20]. B. Chazelle, A. Lvov. 2001. A Trace Bound for the Hereditary Discrepancy. Discrete Computational. Geom. 26, 221-231. (doi:10.1007/s00454-001-0030-2) [21]. B. Chazelle, A. Lvov. 2001. The Discrepancy of Boxes in Higher Dimension. Discrete Computational. Geom. 25, 519-524. (doi:10.1007/s00454-001-0014-2) [22]. B. Chazelle, J. Matoušek, M. Sharir. 1995. An Elementary Approach to Lower Bounds in Geometric Discrepancy. Discrete Comput. Geom. 13, 363-381. (doi:10.1007/BF02574050) [23]. E. Arikan. 1994. An upper bound on the zero-error list-coding capacity. IEEE Transactions on Information Theory 40, 1237-1240. (doi:10.1109/18.335947) [24]. B. Chazelle, H. Edelsbrunner, L.J. Guibas, M. Sharir. 1991. A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications. Theoretical Computer Science 84, 77-105. (doi:10.1016/0304-3975(91)90261-Y) [25]. Ravi (Ravinder) Prakash G, (September 2016) “Necessary & Sufficient Conditions for Consistency of Bipartite Matching Polyhedral Path Expressions to their Resizable Hadoop Cluster Complexity” International Journal of Latest Technology in Engineering, Management & Applied Science, Volume 5, Issue IX, September 2016, Pages: 07-25., ISSN 2278-2540 [26]. B. Chazelle. 1999. Discrepancy Bounds for Geometric Set Systems with Square Incidence Matrices. Advances in Discrete and Computational Geometry, Contemporary Mathematics AMS 223, 103-107. [27]. B. Chazelle. 2004. The Discrepancy Method in Computational Geometry. Handbook of Discrete and Computational Geometry, CRC Press 44, 983-996. [28]. Fadika, Z.; Govindaraju, M. 2010. LEMO-MR: Low Overhead and Elastic MapReduce Implementation Optimized for Memory and CPU-Intensive Applications. IEEE Second International Conference on Cloud Computing Technology and Science (CloudCom), 1-8. (doi:10.1109/CloudCom.2010.45) [29]. Fadika, Z.; Govindaraju, M. 2011. DELMA: Dynamically Elastic MapReduce Framework for CPU-Intensive Applications. 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid), 454-463. (doi: 10.1109/CCGrid.2011.71) [30]. Iordache, A.; Morin, C.; Parlavantzas, N.; Feller, E.; Riteau, P. 2013. Resilin: Elastic MapReduce over Multiple Clouds. 13th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid), 261-268. (doi:10.1109/CCGrid.2013.48) [31]. XiaoyongXu; Maolin Tang. 2013. A comparative study of the semi-elastic and fully-elastic mapreduce models. IEEE International Conference on Granular Computing (GrC), 380-385. (doi:10.1109/GrC.2013.6740440) [32]. Wei Xiang Goh; Kian-Lee Tan. 2014. Elastic MapReduce Execution. 14th IEEE/ACM, International Symposium on Cluster, Cloud and Grid Computing (CCGrid), 216-225. (doi:10.1109/CCGrid.2014.14) [33]. B. Chazelle, W. Mulzer. 2011. Computing Hereditary Convex Structures. Discrete Comput. Geom. 45, 796-823. (doi:10.1007/s00454-011-9346-8) [34]. B. Chazelle, H. Edelsbrunner, M. Grigni, L.J. Guibas, M. Sharir, E. Welzl. 1995. Improved Bounds on Weak ε-Nets for Convex Sets. Discrete Comput. Geom. 13, 1-15. (doi:10.1007/BF02574025) [35]. David P. Williamson, David B. Shmoys. 2011. The Design of Approximation Algorithms.Cambridge University Press, 978-0-521-19527-0. [36]. Oded Goldreich. 2008. Computational Complexity: A Conceptual Perspective.Cambridge University Press, 978-0-521-88473-0. [37]. Sanjeev Arora, Boaz Barak. 2009. Computational Complexity: A Modern Approach.Cambridge University Press, 978-0-521-42426-4. [38]. Dimitri P. Bertsekas, Convex Optimization Algorithms, Athena Scientific, Hardcover Edition ISBN: 1-886529-28-0, 978-1-886529-28-1, Publication: February, 2015, 576 pages. [39]. Philippe Flajolet and Robert Sedgewick. 2009. Analytic Combinatorics (1 ed.). Cambridge University Press, New York, NY, USA. [40]. Patrick Van Flee, (January 2008). Discrete Wavelet Transformations: An Elementary Approach with Applications, 572 pages, ISBN: 978-0-470-18311-3.. [41]. Kevin P. Murphy. 2012. Machine Learning: A Probabilistic Perspective. The MIT Press. [42]. Koller and Nir Friedman. 2009. Probabilistic Graphical Models: Principles and Techniques - Adaptive Computation and Machine Learning. The MIT Press**, , **Ravi (Ravinder) Prakash G "Necessary & Sufficient Conditions for Consistency of Bipartite Matching Polyhedral Shortest Path Unit Length expressions to their Resizable Hadoop Cluster Complexity" International Journal of Latest Technology in Engineering, Management & Applied Science-IJLTEMAS vol.5 issue 11, pp.16-34 2016**, , **For Full Text Click here**[](https://ijltemas.in/DigitalLibrary/Vol.5Issue11/16-34.pdf "Necessary & Sufficient Conditions for Consistency of, Bipartite Matching Polyhedral Shortest Path Unit, Length expressions to their Resizable Hadoop Cluster, Complexity") **Share on Social media** , , , , , ## [Deflection Analysis of High Rise Concrete Buildings for Wind and Seismic Loads Using Bracing Systems for Plan Irregularities Using ETABS](https://ijltemas.in/DigitalLibrary/Vol.5Issue11/35-38.pdf)
Page No.: 35-38
- [Abstract](#tab-21), - [Authors](#tab-22), - [References](#tab-23), - [Cite](#tab-24), - [Full Text & Share](#tab-25), , **Deflection is the degree of displacement of a structural element under a load, either by an angle or distance. For a structure, such as buildings, dams, etc., deflection plays a major role in determining the stability of a structure. The more the structure is deflected, the higher the structure is susceptible to risk of damage. So, bracing systems are used to reduce the deflections in a structure. A typical 20 and 30 storeyed buildings are considered with four distinct plan shapes such as square, rectangle, plus and a T shape within an area of 40m x 40m having a span of 4m. Each building is analysed for Wind and Earthquake loads using the load combinations provided in IS code book. Three bracing types, a concrete shear wall system, steel X-bracing system and a combination of both shear wall and X-bracing for lower and upper half of the structure are used. These bracings are placed around the building with six different placement combinations, such as, bracing provided for lifts and corners of the building, etc., These buildings are analysed using ETABS software and the deflections for all the building shapes, floor, bracings and load combinations are recorded and plotted in graphs to compare and determine which combination is efficient against deflections for the given loads. A deflection for rectangular building is lesser than square building along shorter base dimension and is higher along longer base side.**