scholarly journals Comparative Similarity, Tree Automata, and Diophantine Equations

Author(s):  
Mikhail Sheremet ◽  
Dmitry Tishkovsky ◽  
Frank Wolter ◽  
Michael Zakharyaschev
2020 ◽  
Vol 4 (1) ◽  
pp. 51-63
Author(s):  
Peter Neuhaus ◽  
Chris Jumonville ◽  
Rachel A. Perry ◽  
Roman Edwards ◽  
Jake L. Martin ◽  
...  

AbstractTo assess the comparative similarity of squat data collected as they wore a robotic exoskeleton, female athletes (n=14) did two exercise bouts spaced 14 days apart. Data from their exoskeleton workout was compared to a session they did with free weights. Each squat workout entailed a four-set, four-repetition paradigm with 60-second rest periods. Sets for each workout involved progressively heavier (22.5, 34, 45.5, 57 kg) loads. The same physiological, perceptual, and exercise performance dependent variables were measured and collected from both workouts. Per dependent variable, Pearson correlation coefficients, t-tests, and Cohen's d effect size compared the degree of similarity between values obtained from the exoskeleton and free weight workouts. Results show peak O2, heart rate, and peak force data produced the least variability. In contrast, far more inter-workout variability was noted for peak velocity, peak power, and electromyography (EMG) values. Overall, an insufficient amount of comparative similarity exists for data collected from both workouts. Due to the limited data similarity, the exoskeleton does not exhibit an acceptable degree of validity. Likely the cause for the limited similarity was due to the brief amount of familiarization subjects had to the exoskeleton prior to actual data collection. A familiarization session that accustomed subjects to squats done with the exoskeleton prior to actual data collection may have considerably improved the validity of data obtained from that device.


2015 ◽  
Vol 3 (2) ◽  
Author(s):  
Jayashree Nair ◽  
T. Padma

This paper describes an authentication scheme that uses Diophantine equations based generation of the secret locations to embed the authentication and recovery watermark in the DWT sub-bands. The security lies in the difficulty of finding a solution to the Diophantine equation. The scheme uses the content invariant features of the image as a self-authenticating watermark and a quantized down sampled approximation of the original image as a recovery watermark for visual authentication, both embedded securely using secret locations generated from solution of the Diophantine equations formed from the PQ sequences. The scheme is mildly robust to Jpeg compression and highly robust to Jpeg2000 compression. The scheme also ensures highly imperceptible watermarked images as the spatio –frequency properties of DWT are utilized to embed the dual watermarks.


1981 ◽  
Vol 4 (1) ◽  
pp. 19-34
Author(s):  
Ryszard Danecki

Closure properties of binary ETOL-languages are investigated by means of multiple tree automata. Decidability of the equivalence problem of deterministic binary ETOL-systems is proved.


1989 ◽  
Vol 12 (4) ◽  
pp. 571-585
Author(s):  
E. Fachini ◽  
A. Maggiolo Schettini ◽  
G. Resta ◽  
D. Sangiorgi

We prove that the classes of languages accepted by systolic automata over t-ary trees (t-STA) are always either equal or incomparable if one varies t. We introduce systolic tree automata with base (T(b)-STA), a subclass of STA with interesting properties of modularity, and we give a necessary and sufficient condition for the equivalence between a T(b)-STA and a t-STA, for a given base b. Finally, we show that the stability problem for T(b)-ST A is decidible.


Sign in / Sign up

Export Citation Format

Share Document