Seismic rehabilitation provides existing buildings with more resistance to seismic activity, ground motion, or geotechnical failure due to earthquakes. Performance-based rehabilitation is a general concept through which the retrofitting criteria are defined regarding to performance objectives when the structural and nonstructural members are subject to different levels of earthquake hazards. In...

Masonry towers, located in seismic zones, are vulnerable and prone to damages up compromise their stability. The scatter of data on the mechanical properties masonry, geometry boundary conditions determine a lack building knowledge expected behaviour. Therefore assessment capacity represents critical task. This paper contributes issue analysis masonry focusing meaningful case study: St.Silvestr...

History records that Aceh has been hit by earthquakes several times, including the largest recorded, on December 26, 2004 with a magnitude of 9.3 SR. In connection history disasters have occurred, there is need for safety and disaster preparedness. It very important to conduct feasibility study existing public buildings used in preparedness vulnerability against earthquakes. The type building d...

We consider so-called “incremental” dynamic programming algorithms, and are interested in the number of subproblems produced by them. The standard dynamic programming algorithm for the n-dimensional Knapsack problem is incremental, produces nK subproblems and nK relations (wires) between the subproblems, where K is the capacity of the knapsack. We show that any incremental algorithm for this pr...

Endurance time (ET) method is a relatively new performance-based earthquake method for structural evaluation and design. In this method, the structure is subjected to a gradually intensifying accelorogram(s) and its performance is assessed based on the maximum time duration that it can meet the specified performance objectives. Using moment-resisting and braced frames which are rehabilitated by...

Dominance-based rough sets approach (DRSA) is an effective tool to deal with information with preference-ordered attribute domains and decision classes. Any information system may evolve when new objects enter into or old objects get out. Approximations of DRSA need update for decision analysis or other relative tasks. Incremental updating is a feasible and effective technique to update approxi...

Incremental K-means and DBSCAN are two very important and popular clustering techniques for today‟s large dynamic databases (Data warehouses, WWW and so on) where data are changed at random fashion. The performance of the incremental K-means and the incremental DBSCAN are different with each other based on their time analysis characteristics. Both algorithms are efficient compare to their exist...

Dynamic test generation consists of running a programwhile simultaneously executing the program symbolically in order to gather constrains on inputs from conditional statements encountered along the execution. Those constraints are then systematically negated and solved with a constraint solver, generating new test inputs to exercise different execution paths of the program. This process is rep...

Planning by Incremental Dynamic Programming Richard S. Sutton GTE Laboratories Incorporated Waltham, MA 02254 [email protected] Abstract This paper presents the basic results and ideas of dynamic programming as they relate most directly to the concerns of planning in AI. These form the theoretical basis for the incremental planning methods used in the integrated architecture Dyna. These incrementa...