Professional learning and work-based learning: divergence in rhetoric, convergence in reality

Original article can be found at: http://ijl.cgpublisher.com/Peer reviewe

Characteristic and Ehrhart polynomials

Let A be a subspace arrangement and let chi(A,t) be the characteristic polynomial of its intersection lattice L(A). We show that if the subspaces in A are taken from L(B_n), where B_n is the type B Weyl arrangement, then chi(A,t) counts a certain set of lattice points. One can use this result to study the partial factorization of chi(A,t) over the integers and the coefficients of its expansion in various bases for the polynomial ring R[t]. Next we prove that the characteristic polynomial of any Weyl hyperplane arrangement can be expressed in terms of an Ehrhart quasi-polynomial for its affine Weyl chamber. Note that our first result deals with all subspace arrangements embedded in B_n while the second deals with all finite Weyl groups but only their hyperplane arrangements.Comment: 16 pages, 1 figure, Latex, to be published in J. Alg. Combin. see related papers at http://www.math.msu.edu/~saga

The nu sub 2 band CHD3; ground state parameters for CHD3 from combination differences

The nu sub 2 fundamental band of CHD3, centered near 2143/cm, was recorded at a resolution of 0.015-0.25/cm. Analysis of ground state combination differences yielded well-determined values for the ground state molecular parameters for CHD3. These parameters were used in the determination of the alpha and beta molecular parameters for nu sub 2

A Logic for Non-Deterministic Parallel Abstract State Machines

We develop a logic which enables reasoning about single steps of non-deterministic parallel Abstract State Machines (ASMs). Our logic builds upon the unifying logic introduced by Nanchen and St\"ark for reasoning about hierarchical (parallel) ASMs. Our main contribution to this regard is the handling of non-determinism (both bounded and unbounded) within the logical formalism. Moreover, we do this without sacrificing the completeness of the logic for statements about single steps of non-deterministic parallel ASMs, such as invariants of rules, consistency conditions for rules, or step-by-step equivalence of rules.Comment: arXiv admin note: substantial text overlap with arXiv:1602.0748

A Probabilistic Approach for Assessing the Significance of Contextual Variables in Nonparametric Frontier Models: an Application for Brazilian Banks

This article presents an empirical application illustrating the use of a nonparametric frontier model relying on a probabilistic definition of the production frontier. The significance of the variable nonperforming loans in productive efficiency is assessed, for a sample of Brazilian banks, using the concepts of condicional and unconditional efficiency measures, in a context where it is not necessary to impose any particular distribution for the production data. The analysis is robust relative to the assumptions of separability.

Laboratory studies, analysis, and interpretation of the spectra of hydrocarbons present in planetary atmospheres including cyanoacetylene, acetylene, propane, and ethane

Combining broadband Fourier transform spectrometers (FTS) from the McMath facility at NSO and from NRC in Ottawa and narrow band TDL data from the laboratories with computational physics techniques has produced a broad range of results for the study of planetary atmospheres. Motivation for the effort flows from the Voyager/IRIS observations and the needs of Voyager analysis for laboratory results. In addition, anticipation of the Cassini mission adds incentive to pursue studies of observed and potentially observable constituents of planetary atmospheres. Current studies include cyanoacetylene, acetylene, propane, and ethane. Particular attention is devoted to cyanoacetylen (H3CN) which is observed in the atmosphere of Titan. The results of a high resolution infrared laboratory study of the line positions of the 663, 449, and 22.5/cm fundamental bands are presented. Line position, reproducible to better than 5 MHz for the first two bands, are available for infrared astrophysical searches. Intensity and broadening studies are in progress. Acetylene is a nearly ubiquitous atmospheric constituent of the outer planets and Titan due to the nature of methane photochemistry. Results of ambient temperature absolute intensity measurements are presented for the fundamental and two two-quantum hotband in the 730/cm region. Low temperature hotband intensity and linewidth measurements are planned

Trustee: Full Privacy Preserving Vickrey Auction on top of Ethereum

The wide deployment of tokens for digital assets on top of Ethereum implies the need for powerful trading platforms. Vickrey auctions have been known to determine the real market price of items as bidders are motivated to submit their own monetary valuations without leaking their information to the competitors. Recent constructions have utilized various cryptographic protocols such as ZKP and MPC, however, these approaches either are partially privacy-preserving or require complex computations with several rounds. In this paper, we overcome these limits by presenting Trustee as a Vickrey auction on Ethereum which fully preserves bids' privacy at relatively much lower fees. Trustee consists of three components: a front-end smart contract deployed on Ethereum, an Intel SGX enclave, and a relay to redirect messages between them. Initially, the enclave generates an Ethereum account and ECDH key-pair. Subsequently, the relay publishes the account's address and ECDH public key on the smart contract. As a prerequisite, bidders are encouraged to verify the authenticity and security of Trustee by using the SGX remote attestation service. To participate in the auction, bidders utilize the ECDH public key to encrypt their bids and submit them to the smart contract. Once the bidding interval is closed, the relay retrieves the encrypted bids and feeds them to the enclave that autonomously generates a signed transaction indicating the auction winner. Finally, the relay submits the transaction to the smart contract which verifies the transaction's authenticity and the parameters' consistency before accepting the claimed auction winner. As part of our contributions, we have made a prototype for Trustee available on Github for the community to review and inspect it. Additionally, we analyze the security features of Trustee and report on the transactions' gas cost incurred on Trustee smart contract.Comment: Presented at Financial Cryptography and Data Security 2019, 3rd Workshop on Trusted Smart Contract

Concurrent Computing with Shared Replicated Memory

The behavioural theory of concurrent systems states that any concurrent system can be captured by a behaviourally equivalent concurrent Abstract State Machine (cASM). While the theory in general assumes shared locations, it remains valid, if different agents can only interact via messages, i.e. sharing is restricted to mailboxes. There may even be a strict separation between memory managing agents and other agents that can only access the shared memory by sending query and update requests to the memory agents. This article is dedicated to an investigation of replicated data that is maintained by a memory management subsystem, whereas the replication neither appears in the requests nor in the corresponding answers. We show how the behaviour of a concurrent system with such a memory management can be specified using concurrent communicating ASMs. We provide several refinements of a high-level ground model addressing different replication policies and internal messaging between data centres. For all these refinements we analyse their effects on the runs such that decisions concerning the degree of consistency can be consciously made.Comment: 23 page

Concurrent abstract state machines

n/

The Generic Model of Computation

Over the past two decades, Yuri Gurevich and his colleagues have formulated axiomatic foundations for the notion of algorithm, be it classical, interactive, or parallel, and formalized them in the new generic framework of abstract state machines. This approach has recently been extended to suggest a formalization of the notion of effective computation over arbitrary countable domains. The central notions are summarized herein.Comment: In Proceedings DCM 2011, arXiv:1207.682