Query: It's Different: Insights into home energy consumption in India

Relevant passages:
Non-Intrusive Load Monitoring Using Prior Models of General Appliance Types <=SEP=> Non-intrusive appliance load monitoring is the process of disaggregating a household’s total electricity consumption into its contributing appliances. In this paper we propose an approach by which individual appliances can be iteratively separated from an aggregate load. Unlike existing approaches, our approach does not require training data to be collected by sub-metering individual appliances, nor does it assume complete knowledge of the appliances present in the household. Instead, we propose an approach in which prior models of general appliance types are tuned to specific appliance instances using only signatures extracted from the aggregate load. The tuned appliance models are then used to estimate each appliance’s load, which is subsequently subtracted from the aggregate load. This process is applied iteratively until all appliances for which prior behaviour models are known have been disaggregated. This paper summarises the contribution described in full in [9].

The hitchhiker's guide to successful residential sensing deployments <=SEP=> Homes are rich with information about people's energy consumption, medical health, and personal or family functions. In this paper, we present our experiences deploying large-scale residential sensing systems in over 20 homes. Deploying small-scale systems in homes can be deceptively easy, but in our deployments we encountered a phase transition in which deployment effort increases dramatically as residential deployments scale up in terms of 1) the number of nodes, 2) the length of time, and 3) the number of houses. In this paper, we distill our experiences down to a set of guidelines and design principles to help future deployments avoid the potential pitfalls of large-scale sensing in homes.

Duty-cycling buildings aggressively: The next frontier in HVAC control <=SEP=> Buildings are known to be the largest consumers of electricity in the United States, and often times the dominant energy consumer is the HVAC system. Despite this fact, in most buildings the HVAC system is run using primitive static control algorithms based on fixed work schedules causing wasted energy during periods of low occupancy. In this paper we present a novel control architecture that uses occupancy sensing to guide the operation of a building HVAC system. We show how we can enable aggressive duty-cycling of building HVAC systems — that is, turn them ON or OFF — to save energy while meeting building performance requirements using inexpensive sensing and control methods. We have deployed our occupancy sensor network across an entire floor of a university building and our data shows several periods of low occupancy with significant opportunities to save energy over normal HVAC schedules. Furthermore, by interfacing with the building Energy Management System (EMS) directly and using real-time occupancy data collected by our occupancy nodes, we measure electrical energy savings of 9.54% to 15.73% and thermal energy savings of 7.59% to 12.85% for the HVAC system by controlling just one floor of our four floor building.

AMPds: A public dataset for load disaggregation and eco-feedback research <=SEP=> A home-based intelligent energy conservation system needs to know what appliances (or loads) are being used in the home and when they are being used in order to provide intelligent feedback or to make intelligent decisions. This analysis task is known as load disaggregation or non-intrusive load monitoring (NILM). The datasets used for NILM research generally contain real power readings, with the data often being too coarse for more sophisticated analysis algorithms, and often covering too short a time period. We present the Almanac of Minutely Power dataset (AMPds) for load disaggregation research; it contains one year of data that includes 11 measurements at one minute intervals for 21 sub-meters. AMPds also includes natural gas and water consumption data. Finally, we use AMPds to present findings from our own load disaggregation algorithm to show that current, rather than real power, is a more effective measure for NILM.

REDD : A Public Data Set for Energy Disaggregation Research <=SEP=> Energy and sustainability issues raise a large number of problems that can be tackled using approaches from data mining and machine learning, but traction of such problems has been slow due to the lack of publicly available data. In this paper we present the Reference Energy Disaggregation Data Set (REDD), a freely available data set containing detailed power usage information from several homes, which is aimed at furthering research on energy disaggregation (the task of determining the component appliance contributions from an aggregated electricity signal). We discuss past approaches to disaggregation and how they have influenced our design choices in collecting data, we describe the hardware and software setups for the data collection, and we present initial benchmark disaggregation results using a well-known Factorial Hidden Markov Model (FHMM) technique.

Time Expression Recognition Using a Constituent-based Tagging Scheme <=SEP=> Wefind from four datasets that time expressions are formed by loose structure and the words used to express time information can differentiate time expressions from common text. The findings drive us to design a learning method named TOMN to model time expressions. TOMN defines a constituent-based tagging scheme named TOMN scheme with four tags, namely T, O, M, and N, indicating the constituents of time expression, namely Time token,Modifier,Numeral, and the words Outside time expression. In modeling, TOMN assigns a word with a TOMN tag under conditional random fields with minimal features. Essentially, our constituent-based TOMN scheme overcomes the problem of inconsistent tag assignment that is caused by the conventional position-based tagging schemes (e.g., BIO scheme and BILOU scheme). Experiments show that TOMN is equally or more effective than state-of-the-art methods on various datasets, and much more robust on cross-datasets. Moreover, our analysis can explain many empirical observations in other works about time expression recognition and named entity recognition. ACM Reference Format: Xiaoshi Zhong and Erik Cambria. 2018. Time Expression Recognition Using a Constituent-based Tagging Scheme. In Proceedings of The Web Conference 2018 (WWW’18). ACM, New York, NY, USA, 10 pages. https://doi.org/10. 1145/3178876.3185997

Are educational computer microgames engaging and effective for knowledge acquisition at high-schools ? A quasi-experimental study <=SEP=> Curricular schooling can benefit from the usage of educational computer games, but it is difficult to integrate them in the formal schooling system. Here, we investigate one possible approach to this integration, which capitalizes on using a micro-game that can be played with a teacher’s guidance as a supplement after a traditional expository lecture followed by a debriefing. The game’s purpose is to reinforce and integrate part of the knowledge learnt during the lecture. We investigated feasibility of this approach in a quasi-experimental study in 70 min long seminars on the topic of animal learning at 5 classes at 4 different high-schools in the Czech Republic. Each class was divided to two groups randomly. After an expository lecture, the game group played a game called Orbis Pictus Bestialis while the control group received an extra lecture that used media-rich materials. The time allotment was the same in both groups. We investigated the immediate and one month delayed effects of the game on students’ knowledge reinforced and integrated by the game as well as on knowledge learnt during the expository lecture but not strengthened by the game. We also investigated students’ overall appeal towards the seminar and its perceived educational value. Data from 100 students were analysed. The results showed that a) the game-playing is comparable to the traditional form of teaching concerning immediate knowledge gains and has a significant medium positive effect size regarding retention, b) the gameplaying is not detrimental to information transmitted in the expository lecture but not strengthened by the game, c) perceived educational value and the overall appeal were high in the game group, nevertheless the perceived educational value was slightly lower in the game group comparing to the traditional group. Our results suggest that the proposed approach of harnessing educational computer games at high-schools is promising. 2011 Elsevier Ltd. All rights reserved.

Digital Comics Image Indexing Based on Deep Learning <=SEP=> The digital comic book market is growing every year now, mixing digitized and digital-born comics. Digitized comics suffer from a limited automatic content understanding which restricts online content search and reading applications. This study shows how to combine state-of-the-art image analysis methods to encode and index images into an XML-like text file. Content description file can then be used to automatically split comic book images into sub-images corresponding to panels easily indexable with relevant information about their respective content. This allows advanced search in keywords said by specific comic characters, action and scene retrieval using natural language processing. We get down to panel, balloon, text, comic character and face detection using traditional approaches and breakthrough deep learning models, and also text recognition using LSTM model. Evaluations on a dataset composed of online library content are presented, and a new public dataset is also proposed.

Piecewise 3D Euler spirals <=SEP=> 3D Euler spirals are visually pleasing, due to their property of having their curvature and their torsion change linearly with arc-length. This paper presents a novel algorithm for fitting piecewise 3D Euler spirals to 3D curves with G2 continuity and torsion continuity. The algorithm can also handle sharp corners. Our piecewise representation is invariant to similarity transformations and it is close to the input curves up to an error tolerance.

Legged Robots That Balance <=SEP=> 

A 600MS/s 30mW 0.13µm CMOS ADC array achieving over 60dB SFDR with adaptive digital equalization <=SEP=> At high conversion speed, time interleaving provides a viable way of achieving analog-to-digital conversion with low power consumption, especially when combined with the successive-approximation-register (SAR) architecture that is known to scale well in CMOS technology. In this work, we showcase a digital background-equalization technique to treat the path-mismatch problem as well as individual ADC nonlinearities in time-interleaved SAR ADC arrays. This approach was first introduced to calibrate the linearity errors in pipelined ADCs [1], and subsequently extended to treat SAR ADCs [2]. In this prototype, we demonstrate the effectiveness of this technique in a compact SAR ADC array, which achieves 7.5 ENOB and a 65dB SFDR at 600MS/s while dissipating 23.6mW excluding the on-chip DLL, and exhibiting one of the best conversion FOMs among ADCs with similar sample rates and resolutions [3].

Deep Transfer Learning for Person Re-Identification <=SEP=> Person re-identification (Re-ID) poses an inevitable challenge to deep learning: how to learn a robust deep model with millions of parameters on a small training set of few or no labels. In this paper, two deep transfer learning methods are proposed to address the training data sparsity problem, respectively from the supervised and unsupervised settings. First, a two-stepped fine-tuning strategy with proxy classifier learning is developed to transfer knowledge from auxiliary datasets. Second, given an unlabelled Re-Iddataset, an unsupervised deep transfer learning model is proposed based on a co-training strategy. Extensive experiments show that the proposed models achieve a good performance of deep Re-ID models.

3 D Indoor Object Recognition by Holistic Scene Understanding <=SEP=> In this project, we jointly solve the problem of indoor object recognition and scene classification. The joint problem is modeled by a Conditional Random Field (CRF). Specifically, we implement unary potential on scene appearance, unary potential on object appearance, and binary potential on geometry between objects. The two appearance potentials are obtained by training two neural networks respectively and extracting features from them. Binary potential on object-object geometry relationship is inferred by projecting one object onto the other one’s surface and perceiving the overlap. Other potentials include object cuboid geometry, binary potential on scene-object concurrence, and binary potential on object-object concurrence. Experiments on the challenging NYU-RGBD v2 dataset show that the approach of jointly solving object detection and scene classification problems by integrating several feature representations achieves better performance than vanilla classification. Meanwhile, improving the potentials on scene appearance and object-object geometry relationship achieve fairly satisfactory improvements compared with the performance in [12]. We achieve object recognition precision of 0.3859 and scene classification accuracy of 0.6208 among 21 classes of objects and 13 classes of scenes. Both improve obviously comparing to 0.3829 and 0.6086 in baseline [12]. This result is also comparable to the state-of-art method implemented on the identical dataset [18].

CAVE-SOM: Immersive visual data mining using 3D Self-Organizing Maps <=SEP=> Data mining techniques are becoming indispensable as the amount and complexity of available data is rapidly growing. Visual data mining techniques attempt to include a human observer in the loop and leverage human perception for knowledge extraction. This is commonly allowed by performing a dimensionality reduction into a visually easy-to-perceive 2D space, which might result in significant loss of important spatial and topological information. To address this issue, this paper presents the design and implementation of a unique 3D visual data mining framework - CAVE-SOM. The CAVE-SOM system couples the Self-Organizing Map (SOM) algorithm with the immersive Cave Automated Virtual Environment (CAVE). The main advantages of the CAVE-SOM system are: i) utilizing a 3D SOM to perform dimensionality reduction of large multi-dimensional datasets, ii) immersive visualization of the trained 3D SOM, iii) ability to explore and interact with the multi-dimensional data in an intuitive and natural way. The CAVE-SOM system uses multiple visualization modes to guide the visual data mining process, for instance the data histograms, U-matrix, connections, separations, uniqueness and the input space view. The implemented CAVE-SOM framework was validated on several benchmark problems and then successfully applied to analysis of wind-power generation data. The knowledge extracted using the CAVE-SOM system can be used for further informed decision making and machine learning.

Experimental Results of High-Efficiency Resonant Coupling Wireless Power Transfer Using a Variable Coupling Method <=SEP=> We experimentally demonstrate that the efficiency of wireless power transfer utilizing resonant coupling is improved by applying the “matching condition.” The `matching condition' is extracted from an equivalent circuit model of a magnetically coupled wireless power transfer system. This condition is achieved by varying the coupling factor between the source (load) and the internal resonator. Applying this technique results in efficiency improvements of 46.2% and 29.3% at distances of 60 cm and 1 m, respectively. The maximum efficiency is 92.5% at 15 cm. A circuit model based on the extracted parameters of the resonators produces results similar to the experimental data.

Augmented reality-based exergames for rehabilitation <=SEP=> Rehabilitation for stroke afflicted patients, through exercises tailored for individual needs, aims at relearning basic motor skills, especially in the extremities. Rehabilitation through Augmented Reality (AR) based games engage and motivate patients to perform exercises which, otherwise, maybe boring and monotonic. Also, mirror therapy allows users to observe one's own movements in the game providing them with good visual feedback. This paper presents an augmented reality based system for rehabilitation by playing four interactive, cognitive and fun Exergames (exercise and gaming).
 The system uses low-cost RGB-D cameras such as Microsoft Kinect V2 to capture and generate 3D model of the person by extracting him/her from the entire captured data and immersing it in different interactive virtual environments. Animation based limb movement enhancement along with cognitive aspects incorporated in the game can help in positive reinforcement, progressive challenges and motion improvement. Recording module of the toolkit allows future reference and facilitates feedback from the physician. 10 able-bodied users, 2 psychological experts and 2 Physical Medicine and Rehabilitation physicians evaluated the user experience and usability aspects of the exergames. Results obtained shows the games to be fun and realistic, and at the same time engaging and motivating for performing exercises.

Improved Named Entity Translation and Bilingual Named Entity Extraction <=SEP=> Translation of named entities (NE), including proper names, temporal and numerical expressions, is very important in multilingual natural language processing, like crosslingual information retrieval and statistical machine translation. In this paper we present an integrated approach to extract a named entity translation dictionary from a bilingual corpus while at the same time improving the named entity annotation quality.Starting from a bilingual corpus where the named entities are extracted independently for each language, a statistical alignment model is used to align the named entities. An iterative process is applied to extract named entity pairs with higher alignment probability. This leads to a smaller but cleaner named entity translation dictionary and also to a significant improvement of the monolingual named entity annotation quality for both languages. Experimental result shows that the dictionary size is reduced by 51.8% and the annotation quality is improved from70.03 to 78.15 for Chinese and 73.38 to 81.46 in terms of F-score.

Benchmarking Neural Network Robustness to Common Corruptions and Surface Variations <=SEP=> In this paper we establish rigorous benchmarks for image classifier robustness. Our first benchmark, IMAGENET-C, standardizes and expands the corruption robustness topic, while showing which classifiers are preferable in safety-critical applications. Unlike recent robustness research, this benchmark evaluates performance on commonplace corruptions not worst-case adversarial corruptions. We find that there are negligible changes in relative corruption robustness from AlexNet to ResNet classifiers, and we discover ways to enhance corruption robustness. Then we propose a new dataset called ICONS-50 which opens research on a new kind of robustness, surface variation robustness. With this dataset we evaluate the frailty of classifiers on new styles of known objects and unexpected instances of known classes. We also demonstrate two methods that improve surface variation robustness. Together our benchmarks may aid future work toward networks that learn fundamental class structure and also robustly generalize.

Zero-Field Readout Electronics for Planar Fluxgate Sensors Without Compensation Coil <=SEP=> A simple and sensitive readout electronics for planar fluxgate sensors is presented. The system exploits the sense coils to directly generate the compensation static field avoiding the additional coil/s required in standard closed loop configuration, thus providing clear advantages in terms of size and cost. Moreover, feedback configurations are known to provide better linearity and stability of the system. The sensitivity of the developed demonstration system can be easily set from 13.3 to 104.9 mV/μT with nonlinearity ranging from 0.17% to 0.38% of the measuring interval, whereas the corresponding measuring intervals vary from ±301 to ±38 μT. The measuring uncertainty, the noise field spectral density, and the system bandwidth have been estimated in 12.2 nT, ≈ 10&nbsp;nT/√{Hz}, and ≈1.5 Hz, respectively. The proposed measuring instrument is extremely easy to use and versatile. Moreover, due to the use of commercially available ferromagnetic material and the simple and via-less design, the proposed fluxgate sensor results in a very low cost and reliable device.

Efficient Keyword-Aware Representative Travel Route Recommendation <=SEP=> With the popularity of social media (e.g., Facebook and Flicker), users can easily share their check-in records and photos during their trips. In view of the huge number of user historical mobility records in social media, we aim to discover travel experiences to facilitate trip planning. When planning a trip, users always have specific preferences regarding their trips. Instead of restricting users to limited query options such as locations, activities, or time periods, we consider arbitrary text descriptions as keywords about personalized requirements. Moreover, a diverse and representative set of recommended travel routes is needed. Prior works have elaborated on mining and ranking existing routes from check-in data. To meet the need for automatic trip organization, we claim that more features of Places of Interest (POIs) should be extracted. Therefore, in this paper, we propose an efficient Keyword-aware Representative Travel Route framework that uses knowledge extraction from users’ historical mobility records and social interactions. Explicitly, we have designed a keyword extraction module to classify the POI-related tags, for effective matching with query keywords. We have further designed a route reconstruction algorithm to construct route candidates that fulfill the requirements. To provide befitting query results, we explore Representative Skyline concepts, that is, the Skyline routes which best describe the trade-offs among different POI features. To evaluate the effectiveness and efficiency of the proposed algorithms, we have conducted extensive experiments on real location-based social network datasets, and the experiment results show that our methods do indeed demonstrate good performance compared to state-of-the-art works.

Sudoku as a SAT Problem <=SEP=> Sudoku is a very simple and well-known puzzle that has achieved international popularity in the recent past. This paper addresses the problem of encoding Sudoku puzzles into conjunctive normal form (CNF), and subsequently solving them using polynomial-time propositional satisfiability (SAT) inference techniques. We introduce two straightforward SAT encodings for Sudoku: the minimal encoding and the extended encoding. The minimal encoding suffices to characterize Sudoku puzzles, whereas the extended encoding adds redundant clauses to the minimal encoding. Experimental results demonstrate that, for thousands of very hard puzzles, inference techniques struggle to solve these puzzles when using the minimal encoding. However, using the extended encoding, unit propagation is able to solve about half of our set of puzzles. Nonetheless, for some puzzles more sophisticated inference techniques are required.

Variational Inference using Implicit Distributions <=SEP=> Generative adversarial networks (GANs) have given us a great tool to fit implicit generative models to data. Implicit distributions are ones we can sample from easily, and take derivatives of samples with respect to model parameters. These models are highly expressive and we argue they can prove just as useful for variational inference (VI) as they are for generative modelling. Several papers have proposed GAN-like algorithms for inference, however, connections to the theory of VI are not always well understood. This paper provides a unifying review of existing algorithms establishing connections between variational autoencoders, adversarially learned inference, operator VI, GAN-based image reconstruction, and more. Secondly, the paper provides a framework for building new algorithms: depending on the way the variational bound is expressed we introduce prior-contrastive and jointcontrastive methods, and show practical inference algorithms based on either density ratio estimation or denoising.

Hand3D: Hand Pose Estimation using 3D Neural Network <=SEP=> We propose a novel 3D neural network architecture for 3D hand pose estimation from a single depth image. Different from previous works that mostly run on 2D depth image domain and require intermediate or post process to bring in the supervision from 3D space, we convert the depth map to a 3D volumetric representation, and feed it into a 3D convolutional neural network(CNN) to directly produce the pose in 3D requiring no further process. Our system does not require the ground truth reference point for initialization, and our network architecture naturally integrates both local feature and global context in 3D space. To increase the coverage of the hand pose space of the training data, we render synthetic depth image by transferring hand pose from existing real image datasets. We evaluation our algorithm on two public benchmarks and achieve the state-ofthe-art performance. The synthetic hand pose dataset will be available.

"If It Matters, I Can Explain It": Social Desirability of Knowledge Increases the Illusion of Explanatory Depth <=SEP=> This paper explores whether social desirability affects the illusion of explanatory depth (IEOD) by comparing the magnitude of this illusion in topics with different levels of social desirability within several domains. This question was chosen because prior literature shows that social expectations about how much a person should know about a certain topic affect the magnitude of the IOED. Previous research shows also that social desirability has an effect on a similar illusion related to argumentation, and that the IOED is affected by the way a person thinks knowledge is distributed in his or her social group. In order to do so, 184 participants were assigned randomly to three knowledge domains (history, economics, and devices) and in each domain they rated their understanding of a high-desirability and a low-desirability topic following a standard IOED procedure. Results show that social desirability has an effect on the IOED magnitude and that overestimation of understanding varies among domains. Particularly, participants tend to overestimate their understanding of high desirability topics only. This effect was stronger in the historical domain.

Behavioral oscillation in priming: competing perceptual predictions conveyed in alternating theta-band rhythms. <=SEP=> The brain constantly creates perceptual predictions about forthcoming stimuli to guide perception efficiently. Abundant studies have demonstrated that perceptual predictions modulate sensory activities depending on whether the actual inputs are consistent with one particular prediction. In real-life contexts, however, multiple and even conflicting predictions might concurrently exist to be tested, requiring a multiprediction coordination process. It remains largely unknown how multiple hypotheses are conveyed and harmonized to guide moment-by-moment perception. Based on recent findings revealing that multiple locations are sampled alternatively in various phase of attentional rhythms, we hypothesize that this oscillation-based temporal organization mechanism may also underlie the multiprediction coordination process. To address the issue, we used well established priming paradigms in combination with a time-resolved behavioral approach to investigate the fine temporal dynamics of the multiprediction harmonization course in human subjects. We first replicate classical priming effects in slowly developing trends of priming time courses. Second, after removing the typical priming patterns, we reveal a new theta-band (∼4 Hz) oscillatory component in the priming behavioral data regardless of whether the prime was masked. Third, we show that these theta-band priming oscillations triggered by congruent and incongruent primes are in an out-of-phase relationship. These findings suggest that perceptual predictions return to low-sensory areas not continuously but recurrently in a theta-band rhythm (every 200-300 ms) and that multiple predictions are dynamically coordinated in time by being conveyed in different phases of the theta-band oscillations to achieve dissociated but temporally organized neural representations.

The Impact of Experimental Setup in Prepaid Churn Prediction for Mobile Telecommunications: What to Predict, for Whom and Does the Customer Experience Matter? <=SEP=> Prepaid customers in mobile telecommunications are not bound by a contract and can therefore change operators (‘churn’) at their convenience and without notification. This makes the task of predicting prepaid churn both challenging and financially rewarding. This paper presents an explorative, real world study of prepaid churn modeling by varying the experimental setup on three dimensions: data, outcome definition and population sample. Firstly, we add Customer Experience Management (CEM) data to data traditionally used for prepaid churn prediction. Secondly, we vary the outcome definition of prepaid churn. Thirdly, we alter the sample of the customers included, based on their inactivity period at the time of recording. While adding CEM parameters did not influence the predictability of churn, one variation on the sample and especially a particular change in the outcome definition had a substantial

Singularity detection and processing with wavelets <=SEP=> Most of a signal information is often carried by irregular structures and transient phenomena. The mathematical characterization of singularities with Lipschitz exponents is explained. Theorems are reviewed that estimate local Lipschitz exponents of functions from the evolution across scales of their wavelet transform. It is then proven that the local maxima of the wavelet transform modulus detect the locations of irregular structures and provide numerical procedures to compute their Lipschitz exponents. The wavelet transform of singularities with fast oscillations have a particular behavior that is studied separately. The local frequency of such oscillations are measured from the wavelet transform modulus maxima. It has been shown numerically that oneand two-dimensional signals can be reconstructed, with a good approximation, from the local maxima of their wavelet transform modulus. As an application, an algorithm is developed that removes white noises from signals by analyzing the evolution of the wavelet transform maxima across scales. In two-dimensions, the wavelet transform maxima indicate the location of edges in images. The denoising algorithm is extended for image enhancement.

A Comparative Study of Staff Removal Algorithms <=SEP=> This paper presents a quantitative comparison of different algorithms for the removal of stafflines from music images. It contains a survey of previously proposed algorithms and suggests a new skeletonization-based approach. We define three different error metrics, compare the algorithms with respect to these metrics, and measure their robustness with respect to certain image defects. Our test images are computer-generated scores on which we apply various image deformations typically found in real-world data. In addition to modern western music notation, our test set also includes historic music notation such as mensural notation and lute tablature. Our general approach and evaluation methodology is not specific to staff removal but applicable to other segmentation problems as well.

Real-Time Object Detection and Recognition System Using OpenCV via SURF Algorithm in Emgu CV for Robotic Handling in Libraries <=SEP=> 

PUSHOVER ANALYSIS OF A MULTISTORIED BUILDING <=SEP=> To model the advanced behaviour of reinforced concrete analytically in its non-linear zone is difficult. This has led engineers in the past to believe heavily on empirical formulas that were derived from numerous experiments for the design of reinforced concrete structures. For structural design and assessment of reinforced concrete members, the nonlinear analysis has become a vital tool. The method can be used to study the behaviour of reinforced concrete structures as well as force redistribution. This analysis of the nonlinear response of RC structures to be distributed out in an exceedingly routine fashion. It helps within the investigation of the behaviour of the structure below completely different loading conditions and also the cracks pattern. In the present study, the non-linear response of RCC frame using the loading has been carried out with the intention to investigate the relative importance of many factors in the non-linear analysis of RCC frames. The structure was modelled and analyzed in STAAD Pro V8i, SAP2000 and designed manually. The description of the reinforcement was done in AutoCAD 2010. Keywordsmulti-storied building, STAAD PRO, Floor plan, SAP 2000, Push over analysis.