You are looking at all articles with the topic "Systems". We found 53 matches.

Hint: To view all topics, click here. Too see the most popular topics, click here instead.

🔗 Biography 🔗 Systems 🔗 Biography/arts and entertainment

John Gall (September 18, 1925 – December 15, 2014) was an American author and retired pediatrician. Gall is known for his 1975 book General systemantics: an essay on how systems work, and especially how they fail..., a critique of systems theory. One of the statements from this book has become known as Gall's law.

🔗 Physics 🔗 Systems 🔗 Systems/Dynamical systems

In mathematics and physics, the Poincaré recurrence theorem states that certain dynamical systems will, after a sufficiently long but finite time, return to a state arbitrarily close to (for continuous state systems), or exactly the same as (for discrete state systems), their initial state.

The Poincaré recurrence time is the length of time elapsed until the recurrence. This time may vary greatly depending on the exact initial state and required degree of closeness. The result applies to isolated mechanical systems subject to some constraints, e.g., all particles must be bound to a finite volume. The theorem is commonly discussed in the context of ergodic theory, dynamical systems and statistical mechanics. Systems to which the Poincaré recurrence theorem applies are called conservative systems.

The theorem is named after Henri Poincaré, who discussed it in 1890 and proved by Constantin Carathéodory using measure theory in 1919.

🔗 Computer science 🔗 Systems 🔗 Systems/Scientific modeling

In 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.g., vehicle routing and internet routing. The burgeoning activity in this field has led to conferences dedicated solely to Artificial Ants, and to numerous commercial applications by specialized companies such as AntOptima.

As an example, Ant colony optimization is a class of optimization algorithms modeled on the actions of an ant colony. Artificial 'ants' (e.g. simulation agents) locate optimal solutions by moving through a parameter space representing all possible solutions. Real ants lay down pheromones directing each other to resources while exploring their environment. The simulated 'ants' similarly record their positions and the quality of their solutions, so that in later simulation iterations more ants locate better solutions. One variation on this approach is the bees algorithm, which is more analogous to the foraging patterns of the honey bee, another social insect.

This algorithm is a member of the ant colony algorithms family, in swarm intelligence methods, and it constitutes some metaheuristic optimizations. Initially proposed by Marco Dorigo in 1992 in his PhD thesis, the first algorithm was aiming to search for an optimal path in a graph, based on the behavior of ants seeking a path between their colony and a source of food. The original idea has since diversified to solve a wider class of numerical problems, and as a result, several problems have emerged, drawing on various aspects of the behavior of ants. From a broader perspective, ACO performs a model-based search and shares some similarities with estimation of distribution algorithms.

🔗 Systems 🔗 Systems/Chaos theory

In mathematics, the lakes of Wada (和田の湖, Wada no mizuumi) are three disjoint connected open sets of the plane or open unit square with the counterintuitive property that they all have the same boundary. In other words, for any point selected on the boundary of one of the lakes, the other two lakes' boundaries also contain that point.

More than two sets with the same boundary are said to have the Wada property; examples include Wada basins in dynamical systems. This property is rare in real-world systems.

The lakes of Wada were introduced by Kunizō Yoneyama (1917, page 60), who credited the discovery to Takeo Wada. His construction is similar to the construction by Brouwer (1910) of an indecomposable continuum, and in fact it is possible for the common boundary of the three sets to be an indecomposable continuum.

🔗 Computing 🔗 Physics 🔗 Systems 🔗 Systems/Cybernetics

Bremermann's limit, named after Hans-Joachim Bremermann, is a limit on the maximum rate of computation that can be achieved in a self-contained system in the material universe. It is derived from Einstein's mass-energy equivalency and the Heisenberg uncertainty principle, and is c²/h ≈ 1.36 × 10⁵⁰ bits per second per kilogram. This value is important when designing cryptographic algorithms, as it can be used to determine the minimum size of encryption keys or hash values required to create an algorithm that could never be cracked by a brute-force search.

For example, a computer with the mass of the entire Earth operating at the Bremermann's limit could perform approximately 10⁷⁵ mathematical computations per second. If one assumes that a cryptographic key can be tested with only one operation, then a typical 128-bit key could be cracked in under 10⁻³⁶ seconds. However, a 256-bit key (which is already in use in some systems) would take about two minutes to crack. Using a 512-bit key would increase the cracking time to approaching 10⁷² years, without increasing the time for encryption by more than a constant factor (depending on the encryption algorithms used).

The limit has been further analysed in later literature as the maximum rate at which a system with energy spread ${\displaystyle \Delta E}$ can evolve into an orthogonal and hence distinguishable state to another, ${\displaystyle \Delta t={\frac {\pi \hbar }{2\Delta E}}.}$ In particular, Margolus and Levitin have shown that a quantum system with average energy E takes at least time ${\displaystyle \Delta t={\frac {\pi \hbar }{2E}}}$ to evolve into an orthogonal state. However, it has been shown that access to quantum memory in principle allows computational algorithms that require arbitrarily small amount of energy/time per one elementary computation step.

🔗 Biography 🔗 Religion 🔗 Philosophy 🔗 Systems 🔗 Biography/science and academia 🔗 Systems/Cybernetics 🔗 Philosophy/Philosophers 🔗 Alternative Views 🔗 Buddhism 🔗 Religion/Interfaith 🔗 Chile

Francisco Javier Varela García (September 7, 1946 – May 28, 2001) was a Chilean biologist, philosopher, cybernetician, and neuroscientist who, together with his mentor Humberto Maturana, is best known for introducing the concept of autopoiesis to biology, and for co-founding the Mind and Life Institute to promote dialog between science and Buddhism.

🔗 Mathematics 🔗 Physics 🔗 Systems 🔗 Systems/Dynamical systems

The Abelian sandpile model, also known as the Bak–Tang–Wiesenfeld model, was the first discovered example of a dynamical system displaying self-organized criticality. It was introduced by Per Bak, Chao Tang and Kurt Wiesenfeld in a 1987 paper.

The model is a cellular automaton. In its original formulation, each site on a finite grid has an associated value that corresponds to the slope of the pile. This slope builds up as "grains of sand" (or "chips") are randomly placed onto the pile, until the slope exceeds a specific threshold value at which time that site collapses transferring sand into the adjacent sites, increasing their slope. Bak, Tang, and Wiesenfeld considered process of successive random placement of sand grains on the grid; each such placement of sand at a particular site may have no effect, or it may cause a cascading reaction that will affect many sites.

The model has since been studied on the infinite lattice, on other (non-square) lattices, and on arbitrary graphs (including directed multigraphs). It is closely related to the dollar game, a variant of the chip-firing game introduced by Biggs.

🔗 Computing 🔗 Systems 🔗 Business 🔗 Engineering 🔗 Systems/Systems engineering

Parkinson's law of triviality is C. Northcote Parkinson's 1957 argument that members of an organization give disproportionate weight to trivial issues. Parkinson provides the example of a fictional committee whose job was to approve the plans for a nuclear power plant spending the majority of its time on discussions about relatively minor but easy-to-grasp issues, such as what materials to use for the staff bike shed, while neglecting the proposed design of the plant itself, which is far more important and a far more difficult and complex task.

The law has been applied to software development and other activities. The terms bicycle-shed effect, bike-shed effect, and bike-shedding were coined as metaphors to illuminate the law of triviality; it was popularised in the Berkeley Software Distribution community by the Danish software developer Poul-Henning Kamp in 1999 and has spread from there to the whole software industry.

🔗 Computer science 🔗 Mathematics 🔗 Systems 🔗 Cryptography 🔗 Cryptography/Computer science 🔗 Systems/Operations research

The knapsack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items. The problem often arises in resource allocation where the decision makers have to choose from a set of non-divisible projects or tasks under a fixed budget or time constraint, respectively.

The knapsack problem has been studied for more than a century, with early works dating as far back as 1897. The name "knapsack problem" dates back to the early works of mathematician Tobias Dantzig (1884–1956), and refers to the commonplace problem of packing the most valuable or useful items without overloading the luggage.

🔗 Systems 🔗 Politics 🔗 Socialism 🔗 Sociology 🔗 Globalization

World-systems theory (also known as world-systems analysis or the world-systems perspective) is a multidisciplinary, macro-scale approach to world history and social change which emphasizes the world-system (and not nation states) as the primary (but not exclusive) unit of social analysis.

"World-system" refers to the inter-regional and transnational division of labor, which divides the world into core countries, semi-periphery countries, and the periphery countries. Core countries focus on higher skill, capital-intensive production, and the rest of the world focuses on low-skill, labor-intensive production and extraction of raw materials. This constantly reinforces the dominance of the core countries. Nonetheless, the system has dynamic characteristics, in part as a result of revolutions in transport technology, and individual states can gain or lose their core (semi-periphery, periphery) status over time. This structure is unified by the division of labour. It is a world-economy rooted in a capitalist economy. For a time, certain countries become the world hegemon; during the last few centuries, as the world-system has extended geographically and intensified economically, this status has passed from the Netherlands, to the United Kingdom and (most recently) to the United States.

World-systems theory has been examined by many political theorists and sociologists to explain the reasons for the rise and fall of nations, income inequality, social unrest, and imperialism.