scholarly journals Time-Coordinated Signatures

2017 ◽  
Author(s):  
Santi J. Vives

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,

Entropy ◽  
2020 ◽  
Vol 22 (4) ◽  
pp. 407 ◽  
Author(s):  
Dominik Weikert ◽  
Sebastian Mai ◽  
Sanaz Mostaghim

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.


2015 ◽  
Vol 71 (11) ◽  
pp. 1638-1645 ◽  
Author(s):  
E. M. da Silva ◽  
D. M. Morita ◽  
A. C. M. Lima ◽  
L. Girard Teixeira

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.


Author(s):  
Yuan Yao ◽  
Natasha Alechina ◽  
Brian Logan ◽  
John Thangarajah

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.


2019 ◽  
Vol 100 (9) ◽  
pp. 1653-1664
Author(s):  
Casey E. Davenport

AbstractAtmospheric dynamics can represent a significant hurdle for students; the need to successfully apply concepts from calculus and physics, as well as the sometimes counterintuitive nature of fluid flow, combine to produce frustration and suboptimal learning. Additionally, there is often an emphasis on equation derivations and theory, rather than real-world applications. A new approach for teaching atmospheric dynamics, known as worked examples, is discussed herein. This pedagogy resolves identified challenges in a few ways: 1) reducing the cognitive load of students by explicitly demonstrating (via an expert-constructed guide) how mathematics and physics are applied to the atmosphere; 2) utilizing (as much as appropriate) real-world scenarios to demonstrate how equations explain what we observe; and 3) providing opportunities for students to critically examine the scenario, the relevant math and physics, and the underlying theory via a series of self-explanation prompts throughout the example. This study provides detailed information on the creation and implementation of worked examples in the two-semester atmospheric dynamics course sequence at the University of North Carolina at Charlotte. Comparisons in performance between students who took the course as a traditional lecture and derivation-based course and those who were subject to the worked examples pedagogy identify significant improvements with the new approach, especially for first-semester dynamics. Students also express deep satisfaction with the hands-on, application-based pedagogy.


2010 ◽  
Vol 10 (4-6) ◽  
pp. 417-432 ◽  
Author(s):  
VíTOR SANTOS COSTA ◽  
INÊS DUTRA ◽  
RICARDO ROCHA

AbstractOne of the main advantages of Logic Programming (LP) is that it provides an excellent framework for the parallel execution of programs. In this work we investigate novel techniques to efficiently exploit parallelism from real-world applications in low cost multi-core architectures. To achieve these goals, we revive and redesign the YapOr system to exploit or-parallelism based on a multi-threaded implementation. Our new approach takes full advantage of the state-of-the-art fast and optimized YAP Prolog engine and shares the underlying execution environment, scheduler and most of the data structures used to support YapOr's model. Initial experiments with our new approach consistently achieve almost linear speedups for most of the applications, proving itself as a good alternative for exploiting implicit parallelism in the currently available low cost multi-core architectures.


2020 ◽  
Vol 34 (03) ◽  
pp. 2442-2449
Author(s):  
Yi Zhou ◽  
Jingwei Xu ◽  
Zhenyu Guo ◽  
Mingyu Xiao ◽  
Yan Jin

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.


Author(s):  
Corey Brettschneider

How should a liberal democracy respond to hate groups and others that oppose the ideal of free and equal citizenship? The democratic state faces the hard choice of either protecting the rights of hate groups and allowing their views to spread, or banning their views and violating citizens' rights to freedoms of expression, association, and religion. Avoiding the familiar yet problematic responses to these issues, this book proposes a new approach called value democracy. The theory of value democracy argues that the state should protect the right to express illiberal beliefs, but the state should also engage in democratic persuasion when it speaks through its various expressive capacities: publicly criticizing, and giving reasons to reject, hate-based or other discriminatory viewpoints. Distinguishing between two kinds of state action—expressive and coercive—the book contends that public criticism of viewpoints advocating discrimination based on race, gender, or sexual orientation should be pursued through the state's expressive capacities as speaker, educator, and spender. When the state uses its expressive capacities to promote the values of free and equal citizenship, it engages in democratic persuasion. By using democratic persuasion, the state can both respect rights and counter hateful or discriminatory viewpoints. The book extends this analysis from freedom of expression to the freedoms of religion and association, and shows that value democracy can uphold the protection of these freedoms while promoting equality for all citizens.


Sign in / Sign up

Export Citation Format

Share Document