Urban historyUrban history is a field of history that examines the historical nature of cities and towns, and the process of urbanization. The approach is often multidisciplinary, crossing boundaries into fields like social history, architectural history, urban sociology, urban geography, business history, and archaeology. Urbanization and industrialization were popular themes for 20th-century historians, often tied to an implicit model of modernization, or the transformation of rural traditional societies.
Urban areaAn urban area, built-up area or urban agglomeration is a human settlement with a high population-density and an infrastructure of built environment. This is the core of a metropolitan statistical area in the United States, if it contains a population of more than 50,000. Urban areas originate through urbanization, and researchers categorize them as cities, towns, conurbations or suburbs. In urbanism, the term "urban area" contrasts to rural areas such as villages and hamlets; in urban sociology or urban anthropology it contrasts with natural environment.
Planned communityA planned community, planned city, planned town, or planned settlement is any community that was carefully planned from its inception and is typically constructed on previously undeveloped land. This contrasts with settlements that evolve in a more organic fashion. The term new town refers to planned communities of the new towns movement in particular, mainly in the United Kingdom. It was also common in the European colonization of the Americas to build according to a plan either on fresh ground or on the ruins of earlier Native American villages.
Cutting-plane methodIn mathematical optimization, the cutting-plane method is any of a variety of optimization methods that iteratively refine a feasible set or objective function by means of linear inequalities, termed cuts. Such procedures are commonly used to find integer solutions to mixed integer linear programming (MILP) problems, as well as to solve general, not necessarily differentiable convex optimization problems. The use of cutting planes to solve MILP was introduced by Ralph E. Gomory.
Web frameworkA web framework (WF) or web application framework (WAF) is a software framework that is designed to support the development of web applications including web services, web resources, and web APIs. Web frameworks provide a standard way to build and deploy web applications on the World Wide Web. Web frameworks aim to automate the overhead associated with common activities performed in web development. For example, many web frameworks provide libraries for database access, templating frameworks, and session management, and they often promote code reuse.
Ant colony optimization algorithmsIn computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. Artificial ants stand for multi-agent methods inspired by the behavior of real ants. The pheromone-based communication of biological ants is often the predominant paradigm used. Combinations of artificial ants and local search algorithms have become a method of choice for numerous optimization tasks involving some sort of graph, e.
Principles of intelligent urbanismPrinciples of intelligent urbanism (PIU) is a theory of urban planning composed of a set of ten axioms intended to guide the formulation of city plans and urban designs. They are intended to reconcile and integrate diverse urban planning and management concerns. These axioms include environmental sustainability, heritage conservation, appropriate technology, infrastructure-efficiency, placemaking, social access, transit-oriented development, regional integration, human scale, and institutional integrity.
Spring FrameworkThe Spring Framework is an application framework and inversion of control container for the Java platform. The framework's core features can be used by any Java application, but there are extensions for building web applications on top of the Java EE (Enterprise Edition) platform. The framework does not impose any specific programming model.. The framework has become popular in the Java community as an addition to the Enterprise JavaBeans (EJB) model. The Spring Framework is open source.
Interprocedural optimizationInterprocedural optimization (IPO) is a collection of compiler techniques used in computer programming to improve performance in programs containing many frequently used functions of small or medium length. IPO differs from other compiler optimizations by analyzing the entire program as opposed to a single function or block of code. IPO seeks to reduce or eliminate duplicate calculations and inefficient use of memory and to simplify iterative sequences such as loops.
Optimizing compilerIn computing, an optimizing compiler is a compiler that tries to minimize or maximize some attributes of an executable computer program. Common requirements are to minimize a program's execution time, memory footprint, storage size, and power consumption (the last three being popular for portable computers). Compiler optimization is generally implemented using a sequence of optimizing transformations, algorithms which take a program and transform it to produce a semantically equivalent output program that uses fewer resources or executes faster.