Modeling Human, Social, Cultural or Behavioral Events for Real World Applications: Results and Implications from the State Stability Project

2009 ◽  
Author(s):  
Anne Russell ◽  
Mark Clark
Keyword(s):  
Real World ◽  
The State ◽  
Real World Applications

scholarly journals Particle Swarm Contour Search Algorithm

Entropy ◽  
2020 ◽  
Vol 22 (4) ◽  
pp. 407 ◽  
Author(s):  
Dominik Weikert ◽  
Sebastian Mai ◽  
Sanaz Mostaghim
Keyword(s):  
Image Processing ◽  
Real World ◽  
State Of The Art ◽  
Search Algorithm ◽  
Particle Swarm ◽  
Search Space ◽  
Local Information ◽  
The State ◽  
Complete Knowledge ◽  
Real World Applications

In this article, we present a new algorithm called Particle Swarm Contour Search (PSCS)—a Particle Swarm Optimisation inspired algorithm to find object contours in 2D environments. Currently, most contour-finding algorithms are based on image processing and require a complete overview of the search space in which the contour is to be found. However, for real-world applications this would require a complete knowledge about the search space, which may not be always feasible or possible. The proposed algorithm removes this requirement and is only based on the local information of the particles to accurately identify a contour. Particles search for the contour of an object and then traverse alongside using their known information about positions in- and out-side of the object. Our experiments show that the proposed PSCS algorithm can deliver comparable results as the state-of-the-art.

scholarly journals Time-Coordinated Signatures

2017 ◽  
Author(s):  
Santi J. Vives
Keyword(s):  
Real World ◽  
The State ◽  
New Approach ◽  
Real World Applications

Hash-based signatures are typically stateful: they need to keep a state with the number of past signatures to know which values have been already used and cannot be reused. If the memory storing the state fails, the security would degrade. Some implementations solve the problem by using a number of secret values so large that the probability of picking the same at random is negligible, but this solution can make the signatures impractical for some real world applications. This paper proposes a new approach to hash-based signatures: we show that it is possible to derive their state entirely from time, without the need to keep a state with the number of past signatures,

Manufacturing ceramic bricks with polyaluminum chloride (PAC) sludge from a water treatment plant

2015 ◽  
Vol 71 (11) ◽  
pp. 1638-1645 ◽  
Author(s):  
E. M. da Silva ◽  
D. M. Morita ◽  
A. C. M. Lima ◽  
L. Girard Teixeira
Keyword(s):  
Water Treatment ◽  
Water Absorption ◽  
Real World ◽  
Laboratory Tests ◽  
Research Work ◽  
Treatment Plant ◽  
Water Treatment Plant ◽  
The State ◽  
Polyaluminum Chloride ◽  
Real World Applications

The objective of this research work is to assess the viability of manufacturing ceramic bricks with sludge from a water treatment plant (WTP) for use in real-world applications. Sludge was collected from settling tanks at the Bolonha WTP, which is located in Belém, capital of the state of Pará, Brazil. After dewatering in drainage beds, sludge was added to the clay at a local brickworks at different mass percentages (7.6, 9.0, 11.7, 13.9 and 23.5%). Laboratory tests were performed on the bricks to assess their resistance to compression, water absorption, dimensions and visual aspects. Percentages of 7.6, 9.0, 11.7 and 13.9% (w/w) of WTP sludge presented good results in terms of resistance, which indicates that technically, ceramic bricks can be produced by incorporating up to 13.9% of WTP sludge.

scholarly journals Intention Progression under Uncertainty

2020 ◽  
Author(s):  
Yuan Yao ◽  
Natasha Alechina ◽  
Brian Logan ◽  
John Thangarajah
Keyword(s):  
Monte Carlo ◽  
Real World ◽  
The State ◽  
Perfect Information ◽  
Tree Search ◽  
Monte Carlo Tree Search ◽  
Real World Applications ◽  
State Of The Environment ◽  
Environment Condition

A key problem in Belief-Desire-Intention agents is how an agent progresses its intentions, i.e., which plans should be selected and how the execution of these plans should be interleaved so as to achieve the agent’s goals. Previous approaches to the intention progression problem assume the agent has perfect information about the state of the environment. However, in many real-world applications, an agent may be uncertain about whether an environment condition holds, and hence whether a particular plan is applicable or an action is executable. In this paper, we propose SAU, a Monte-Carlo Tree Search (MCTS)-based scheduler for intention progression problems where the agent’s beliefs are uncertain. We evaluate the performance of our approach experimentally by varying the degree of uncertainty in the agent’s beliefs. The results suggest that SAU is able to successfully achieve the agent’s goals even in settings where there is significant uncertainty in the agent’s beliefs.

scholarly journals Enumerating Maximal k-Plexes with Worst-Case Time Guarantee

2020 ◽  
Vol 34 (03) ◽  
pp. 2442-2449
Author(s):  
Yi Zhou ◽  
Jingwei Xu ◽  
Zhenyu Guo ◽  
Mingyu Xiao ◽  
Yan Jin
Keyword(s):  
Community Detection ◽  
Real World ◽  
State Of The Art ◽  
Real Life ◽  
The State ◽  
Enumeration Algorithm ◽  
Worst Case ◽  
Running Time ◽  
Real World Applications ◽  
First Time

The problem of enumerating all maximal cliques in a graph is a key primitive in a variety of real-world applications such as community detection and so on. However, in practice, communities are rarely formed as cliques due to data noise. Hence, k-plex, a subgraph in which any vertex is adjacent to all but at most k vertices, is introduced as a relaxation of clique. In this paper, we investigate the problem of enumerating all maximal k-plexes and present FaPlexen, an enumeration algorithm which integrates the “pivot” heuristic and new branching schemes. To our best knowledge, for the first time, FaPlexen lists all maximal k-plexes with provably worst-case running time O(n2γn) in a graph with n vertices, where γ < 2. Then, we propose another algorithm CommuPlex which non-trivially extends FaPlexen to find all maximal k-plexes of prescribed size for community detection in massive real-life networks. We finally carry out experiments on both real and synthetic graphs and demonstrate that our algorithms run much faster than the state-of-the-art algorithms.

scholarly journals Electronic Phenomena of Transition Metal Oxides

Crystals ◽  
2021 ◽  
Vol 11 (3) ◽  
pp. 256
Author(s):  
Christian Rodenbücher ◽  
Kristof Szot
Keyword(s):  
Solid State ◽  
Transition Metal ◽  
Metal Oxides ◽  
Real World ◽  
Transition Metal Oxides ◽  
Major Research ◽  
Research Fields ◽  
Real World Applications

Transition metal oxides with ABO3 or BO2 structures have become one of the major research fields in solid state science, as they exhibit an impressive variety of unusual and exotic phenomena with potential for their exploitation in real-world applications [...]

Sign in / Sign up

Export Citation Format

Share Document