Descriptional complexity of concurrent processes (preliminary version)

2005 ◽  
pp. 601-611
Author(s):  
Giora Slutzki
Keyword(s):  
Descriptional Complexity ◽  
Preliminary Version ◽  
Concurrent Processes

The Hierarchical Model of Exercise Dependence

2015 ◽  
Vol 36 (4) ◽  
pp. 247-257 ◽  
Author(s):  
Gayatri Kotbagi ◽  
Laurence Kern ◽  
Lucia Romo ◽  
Ramesh Pathare
Keyword(s):  
Factor Analysis ◽  
Confirmatory Factor Analysis ◽  
Physical Exercise ◽  
Exploratory Factor Analysis ◽  
Convergent Validity ◽  
Large Population ◽  
Assessment Tools ◽  
Negative Consequences ◽  
Confirmatory Factor ◽  
Preliminary Version

Abstract. Physical exercise when done excessively may have negative consequences on physical and psychological wellbeing. There exist many scales to measure this phenomenon. The purpose of this article is to create a scale measuring the problematic practice of physical exercise (PPPE Scale) by combining two assessment tools already existing in the field of exercise dependency but anchored in different approaches (EDS-R and EDQ). This research consists of three studies carried out on three independent sample populations. The first study (N = 341) tested the construct validity (exploratory factor analysis); the second study (N = 195) tested the structural validity (confirmatory factor analysis) and the third study (N = 104) tested the convergent validity (correlations) of the preliminary version of the PPPE scale. Exploratory factor analysis identified six distinct dimensions associated with exercise dependency. Furthermore, confirmatory factor analysis validated a second order model consisting of 25 items with six dimensions and four sub-dimensions. The convergent validity of this scale with other constructs (GLTEQ, EAT26, and The Big Five Inventory [BFI]) is satisfactory. The preliminary version of the PPPE must be administered to a large population to refine its psychometric properties and develop scoring norms.

Fault-Tolerant Key Distribution (Preliminary Version)

1993 ◽  
Author(s):  
Michael Reiter ◽  
Kenneth Birman ◽  
Robert van Renesse
Keyword(s):  
Fault Tolerant ◽  
Key Distribution ◽  
Preliminary Version

Corrections for "On the lengths of proofs in the propositional calculus preliminary version"

1974 ◽  
Vol 6 (3) ◽  
pp. 15-22 ◽  
Author(s):  
Stephen Cook ◽  
Robert Reckhow
Keyword(s):  
Propositional Calculus ◽  
Preliminary Version

scholarly journals Six shades lighter: a bit-serial implementation of the AES family

2021 ◽  
Author(s):  
Sergio Roldán Lombardía ◽  
Fatih Balli ◽  
Subhadeep Banik
Keyword(s):  
Block Cipher ◽  
Block Ciphers ◽  
Authenticated Encryption ◽  
Current Standard ◽  
Asic Circuit ◽  
The Family ◽  
Encryption And Decryption ◽  
Preliminary Version ◽  
Reduction In Area ◽  
Bit Serial

AbstractRecently, cryptographic literature has seen new block cipher designs such as , or that aim to be more lightweight than the current standard, i.e., . Even though family of block ciphers were designed two decades ago, they still remain as the de facto encryption standard, with being the most widely deployed variant. In this work, we revisit the combined one-in-all implementation of the family, namely both encryption and decryption of each as a single ASIC circuit. A preliminary version appeared in Africacrypt 2019 by Balli and Banik, where the authors design a byte-serial circuit with such functionality. We improve on their work by reducing the size of the compact circuit to 2268 GE through 1-bit-serial implementation, which achieves 38% reduction in area. We also report stand-alone bit-serial versions of the circuit, targeting only a subset of modes and versions, e.g., and . Our results imply that, in terms of area, and can easily compete with the larger members of recently designed family, e.g., , . Thus, our implementations can be used interchangeably inside authenticated encryption candidates such as , or in place of .

Modelling Nondeterministic Concurrent Processes with Event Structures

1991 ◽  
Vol 14 (1) ◽  
pp. 39-73
Author(s):  
Rita Loogen ◽  
Ursula Goltz
Keyword(s):  
Dynamic Behaviour ◽  
Partially Ordered Sets ◽  
Parallel Composition ◽  
Ordered Sets ◽  
Communicating Sequential Processes ◽  
Partially Ordered ◽  
Event Structures ◽  
Transition Relation ◽  
Concurrent Processes ◽  
Sequential Processes

We present a non-interleaving model for non deterministic concurrent processes that is based on labelled event structures. We define operators on labelled event structures like parallel composition, nondeterministic combination, choice, prefixing and hiding. These operators correspond to the operations of the “Theory of Communicating Sequential Processes” (TCSP). Infinite processes are defined using the metric approach. The dynamic behaviour of event structures is defined by a transition relation which describes the execution of partially ordered sets of actions, abstracting from internal events.

On Play by Means of Computing Machines (Preliminary Version).

1988 ◽  
Vol 53 (2) ◽  
pp. 669
Author(s):  
William J. Rapaport ◽  
Nimrod Megiddo ◽  
Avi Wigderson ◽  
Haim Gaifman ◽  
Silvio Micali ◽  
...  
Keyword(s):  
Preliminary Version ◽  
Computing Machines

Synchronization of asynchronous concurrent processes using cellular automata

1989 ◽  
Vol 11 (2) ◽  
pp. 163-169
Author(s):  
E Adamides ◽  
Ph Tsalides ◽  
A Thanailakis
Keyword(s):  
Cellular Automata ◽  
Concurrent Processes

scholarly journals Modeling the Complete Otto Cycle-Preliminary Version

1977 ◽  
Author(s):  
Frank J. Zeleznik ◽  
Bonnie J. Mcbride
Keyword(s):  
Otto Cycle ◽  
Preliminary Version
Sign in / Sign up

Export Citation Format

Share Document