Observables and Correlation Functions in OSp Invariant String Field Theory

We define BRST invariant observables in the OSp invariant closed string field theory for bosonic strings. We evaluate correlation functions of these observables and show that the S-matrix elements derived from them coincide with those of the light-cone gauge string field theory.Comment: 23 page

Solving the At-Most-Once Problem with Nearly Optimal Effectiveness

We present and analyze a wait-free deterministic algorithm for solving the at-most-once problem: how m shared-memory fail-prone processes perform asynchronously n jobs at most once. Our algorithmic strategy provides for the first time nearly optimal effectiveness, which is a measure that expresses the total number of jobs completed in the worst case. The effectiveness of our algorithm equals n-2m+2. This is up to an additive factor of m close to the known effectiveness upper bound n-m+1 over all possible algorithms and improves on the previously best known deterministic solutions that have effectiveness only n-log m o(n). We also present an iterative version of our algorithm that for any $m = O\left(\sqrt[3+\epsilon]{n/\log n}\right)$ is both effectiveness-optimal and work-optimal, for any constant $\epsilon > 0$. We then employ this algorithm to provide a new algorithmic solution for the Write-All problem which is work optimal for any $m=O\left(\sqrt[3+\epsilon]{n/\log n}\right)$.Comment: Updated Version. A Brief Announcement was published in PODC 2011. An Extended Abstract was published in the proceeding of ICDCN 2012. A full version was published in Theoretical Computer Science, Volume 496, 22 July 2013, Pages 69 - 8

Understanding Predication in Conceptual Spaces

We argue that a cognitive semantics has to take into account the possibly partial information that a cognitive agent has of the world. After discussing Gärdenfors's view of objects in conceptual spaces, we offer a number of viable treatments of partiality of information and we formalize them by means of alternative predicative logics. Our analysis shows that understanding the nature of simple predicative sentences is crucial for a cognitive semantics

Maturity status effects on torque and muscle architecture of young soccer players

This study investigated the effects of maturity status on knee extensor torque and vastus lateralis architecture of young soccer players. Thirty-four males aged 13–18 years were divided into two groups: pubescent (PUB, n = 15) and postpubescent (POSP, n = 19). Torque by angle interaction was established for absolute [F(2.649, 84.771) = 9.066, p < 0.05] and relative to body mass [F(2.704, 86.533) = 4.050, p < 0.05] isometric torque with the POSP group showing greater values. Muscle volume torque-angle relationship was similar between groups. Absolute, relative to body mass, and relative to muscle volume concentric and eccentric torque-velocity relationship showed a nonsignificant interaction but a significant group effect in favour the POSP group for absolute and concentric torque relative to body mass. Torque-angle and torque-velocity relationship normalized by body mass allometric exponents showed a non-significant interactions and group effects. Muscle thickness (3.6 ± 0.6 vs. 3.8 ± 0.6 cm), fascicle length (8.3 ± 1.4 vs. 8.9 ± 1.6 cm) and pennation angle (15.0 ± 2.3 vs. 14.3 ± 3.2 degrees) was similar between PUB and POSP groups, respectively. Maturity status did not show a significant effect on muscle architecture and on isometric and dynamic torques when allometrically normalized

Using ACL2 to Verify Loop Pipelining in Behavioral Synthesis

Behavioral synthesis involves compiling an Electronic System-Level (ESL) design into its Register-Transfer Level (RTL) implementation. Loop pipelining is one of the most critical and complex transformations employed in behavioral synthesis. Certifying the loop pipelining algorithm is challenging because there is a huge semantic gap between the input sequential design and the output pipelined implementation making it infeasible to verify their equivalence with automated sequential equivalence checking techniques. We discuss our ongoing effort using ACL2 to certify loop pipelining transformation. The completion of the proof is work in progress. However, some of the insights developed so far may already be of value to the ACL2 community. In particular, we discuss the key invariant we formalized, which is very different from that used in most pipeline proofs. We discuss the needs for this invariant, its formalization in ACL2, and our envisioned proof using the invariant. We also discuss some trade-offs, challenges, and insights developed in course of the project.Comment: In Proceedings ACL2 2014, arXiv:1406.123