Morphological transformation of the old city of Beijing after 1949

The old city of Beijing has been recognized as the greatest masterpiece of urban planning and urban design. However, since 1949 it has experienced extensive and fast constructions and demolitions, a large number of papers argued that physical and social structure of old city of Beijing has been fading away. In order to find a proper way to protect and redevelop the old Beijing city, it could be better to answer the questions that what is the essence of urban morphology of the Old Beijing (the city before 1950s) and further how it has been transformed during last 50 years since 1949. The paper tried to provide a whole spatial morphology of the old city of Beijing and its transformation from the perspective of space syntax, a syntactical and topological approach. Based on which, it argued syntactical representation of the Old Beijing could give the light on the dual spatial structures, both for ceremony and for everyday life. Further, it argued that the transformation of syntactical morphology of the old city of Beijing had been on the way to make the spatial configuration more intelligibility for every day life since 1949. However, the continued large scale regeneration and urban extension have begun to impair the vitality of the old city due to both weakening spatial synergy and damaging compactness

The role of space in the emergence of conceived urban areas

A city is usually made up of numerous different named areas but how these areas are defined is problematic. Lynch (1961) suggests that the sense of urban areas are mainly determined by thematic continuities consisting of spatial characteristics, such as the width of street, building type, colour, texture, façade detail and so on, and also gives a hypothesis that the image of urban area could be gradually developed and conceived through the network of sequences, a sense of interconnectedness at any level or in any direction. Rossi (1984) also argues that urban areas, identified as the study areas in his book, can be defined or described by their location in the city, their imprint on the ground, their topographic limits and their physical appearance which he sees as representing a consistent mode of living, involving a whole historic process of urban growth and differentiation. Both suggest, in effect, that there might be objective correlates for concepts of name areas, but little research since has taken this idea further. Here we ask if studies of cities as spatial configurations, using the techniques of space syntax, might throw light on these questions. Are there perhaps correlates between named areas and configurational properties? The paper first reviews syntactic methods applied in the past in defining different areas. These are for the most part based on spatial properties of the area itself, rather than the properties of the context, which prima facie seems likely to be a factor in how areas are defined. A new technique is then proposed for exploring properties of the context. Each axial line is taken as the root of a graph, and the numbers of axial lines found with increasing radius from the root is calculated, and expressed as a rate of change. This rate of change value is then assigned to the original axial line and expressed through bands of colour. The results show strong areal effects, in that groups of neighbouring lines tend to have similar 2 colouring, and in many cases these suggest natural areas. However the areas defined vary with the rate of change at different radii, with larger areas being identified by large radii. This technique is applied to the central areas of Beijing and London, and the results compared to known named areas. It further visually compares the area structure sketched in the Lynch’s case study of Boston with the area structure generated from spatial configuration of Boston, as a possible first step towards a cognitive dimension. Finally, it is suggested that what is being identified through this technique is not an area boundary in the normal sense, but what we might call a fuzzy boundary arising from the relation between the configurations of space within and outside the area. It further argues that the spatial definition of urban area could be more influenced by the external structure of the area, which might be called as exogenetic effect

Viscous compressible flow direct and inverse computation and illustrations

An algorithm for laminar and turbulent viscous compressible two dimensional flows is presented. For the application of precise boundary conditions over an arbitrary body surface, a body-fitted coordinate system is used in the physical plane. A thin-layer approximation of tne Navier-Stokes equations is introduced to keep the viscous terms relatively simple. The flow field computation is performed in the transformed plane. A factorized, implicit scheme is used to facilitate the computation. Sample calculations, for Couette flow, developing pipe flow, an isolated airflow, two dimensional compressor cascade flow, and segmental compressor blade design are presented. To a certain extent, the effective use of the direct solver depends on the user's skill in setting up the gridwork, the time step size and the choice of the artificial viscosity. The design feature of the algorithm, an iterative scheme to correct geometry for a specified surface pressure distribution, works well for subsonic flows. A more elaborate correction scheme is required in treating transonic flows where local shock waves may be involved

A self-learning particle swarm optimizer for global optimization problems

Copyright @ 2011 IEEE. All Rights Reserved. This article was made available through the Brunel Open Access Publishing Fund.Particle swarm optimization (PSO) has been shown as an effective tool for solving global optimization problems. So far, most PSO algorithms use a single learning pattern for all particles, which means that all particles in a swarm use the same strategy. This monotonic learning pattern may cause the lack of intelligence for a particular particle, which makes it unable to deal with different complex situations. This paper presents a novel algorithm, called self-learning particle swarm optimizer (SLPSO), for global optimization problems. In SLPSO, each particle has a set of four strategies to cope with different situations in the search space. The cooperation of the four strategies is implemented by an adaptive learning framework at the individual level, which can enable a particle to choose the optimal strategy according to its own local fitness landscape. The experimental study on a set of 45 test functions and two real-world problems show that SLPSO has a superior performance in comparison with several other peer algorithms.This work was supported by the Engineering and Physical Sciences Research Council of U.K. under Grants EP/E060722/1 and EP/E060722/2

Computer-aided Circuit Analysis Semiannual Report, May 15 - Nov. 14, 1966

Digital computer aided circuit analysis and desig

Computer-aided circuit analysis Annual report, May 15, 1965 - May 14, 1966

Research on digital computer aided analysis of electric circuit

A bibliography on digital computer-aided circuit analysis and design

Digital computer-aided electric logic circuit analysis and design bibliograph