Global optimizationGlobal optimization is a branch of applied mathematics and numerical analysis that attempts to find the global minima or maxima of a function or a set of functions on a given set. It is usually described as a minimization problem because the maximization of the real-valued function is equivalent to the minimization of the function . Given a possibly nonlinear and non-convex continuous function with the global minima and the set of all global minimizers in , the standard minimization problem can be given as that is, finding and a global minimizer in ; where is a (not necessarily convex) compact set defined by inequalities .
Sustainable urbanismSustainable urbanism is both the study of cities and the practices to build them (urbanism), that focuses on promoting their long term viability by reducing consumption, waste and harmful impacts on people and place while enhancing the overall well-being of both people and place. Well-being includes the physical, ecological, economic, social, health and equity factors, among others, that comprise cities and their populations.
Convex preferencesIn economics, convex preferences are an individual's ordering of various outcomes, typically with regard to the amounts of various goods consumed, with the property that, roughly speaking, "averages are better than the extremes". The concept roughly corresponds to the concept of diminishing marginal utility without requiring utility functions. Comparable to the greater-than-or-equal-to ordering relation for real numbers, the notation below can be translated as: 'is at least as good as' (in preference satisfaction).
15-minute cityThe 15-minute city (FMC or 15mC) is an urban planning concept in which most daily necessities and services, such as work, shopping, education, healthcare, and leisure can be easily reached by a 15-minute walk or bike ride from any point in the city. This approach aims to reduce car dependency, promote healthy and sustainable living, and improve wellbeing and quality of life for city dwellers.
Power steeringPower steering is a system for reducing a driver's effort to turn a steering wheel of a motor vehicle, by using a power source to assist steering. Hydraulic or electric actuators add controlled energy to the steering mechanism, so the driver can provide less effort to turn the steered wheels when driving at typical speeds, and reduce considerably the physical effort necessary to turn the wheels when a vehicle is stopped or moving slowly. Power steering can also be engineered to provide some artificial feedback of forces acting on the steered wheels.
InfillIn urban planning, infill, or in-fill, is the rededication of land in an urban environment, usually open-space, to new construction. Infill also applies, within an urban polity, to construction on any undeveloped land that is not on the urban margin. The slightly broader term "land recycling" is sometimes used instead. Infill has been promoted as an economical use of existing infrastructure and a remedy for urban sprawl. Its detractors view it as overloading urban services, including increased traffic congestion and pollution, and decreasing urban green-space.
ZoningZoning is a method of urban planning in which a municipality or other tier of government divides land into areas called zones, each of which has a set of regulations for new development that differs from other zones. Zones may be defined for a single use (e.g. residential, industrial), they may combine several compatible activities by use, or in the case of form-based zoning, the differing regulations may govern the density, size and shape of allowed buildings whatever their use.
Weak solutionIn mathematics, a weak solution (also called a generalized solution) to an ordinary or partial differential equation is a function for which the derivatives may not all exist but which is nonetheless deemed to satisfy the equation in some precisely defined sense. There are many different definitions of weak solution, appropriate for different classes of equations. One of the most important is based on the notion of distributions.
Interactive proof systemIn computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties: a prover and a verifier. The parties interact by exchanging messages in order to ascertain whether a given string belongs to a language or not. The prover possesses unlimited computational resources but cannot be trusted, while the verifier has bounded computation power but is assumed to be always honest.
Dining philosophers problemIn computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. It was originally formulated in 1965 by Edsger Dijkstra as a student exam exercise, presented in terms of computers competing for access to tape drive peripherals. Soon after, Tony Hoare gave the problem its present form. Five philosophers dine together at the same table. Each philosopher has their own plate at the table.
