Learning Agility: The Nexus Between Learning Organization, Transformative Learning, and Adaptive Performance

The purpose of this study is to establish a model of learning agility that is connected with transformative learning and the double-loop learning of organizational learning. Also, this study aims to identify the mediating role of learning agility on the relationship between learning organization, transformative learning, and adaptive performance

Concurrent π\pi-vector fields and energy beta-change

The present paper deals with an \emph{intrinsic} investigation of the notion of a concurrent $\pi$-vector field on the pullback bundle of a Finsler manifold $(M,L)$. The effect of the existence of a concurrent $\pi$-vector field on some important special Finsler spaces is studied. An intrinsic investigation of a particular $\beta$-change, namely the energy $\beta$-change ($\widetilde{L}^{2}(x,y)=L^{2}(x,y)+ B^{2}(x,y) with \ B:=g(\bar{\zeta},\bar{\eta})$;$\bar{\zeta} $being a concurrent$\pi$-vector field), is established. The relation between the two Barthel connections$\Gamma$and$\widetilde{\Gamma}$, corresponding to this change, is found. This relation, together with the fact that the Cartan and the Barthel connections have the same horizontal and vertical projectors, enable us to study the energy$\beta$-change of the fundamental linear connection in Finsler geometry: the Cartan connection, the Berwald connection, the Chern connection and the Hashiguchi connection. Moreover, the change of their curvature tensors is concluded. It should be pointed out that the present work is formulated in a prospective modern coordinate-free form.Comment: 27 pages, LaTex file, Some typographical errors corrected, Some formulas simpifie

What is the topology of a Schwarzschild black hole?

We investigate the topology of Schwarzschild's black hole through the immersion of this space-time in spaces of higher dimension. Through the immersions of Kasner and Fronsdal we calculate the extension of the Schwarzschild's black hole.Comment: 7 pages. arXiv admin note: substantial text overlap with arXiv:1102.446

The combinatorics of generalised cumulative arrays.

In this paper we present a combinatorial analysis of generalised cumulative arrays. These are structures that are associated with a monotone collections of subsets of a base set and have properties that find application in areas of information security. We propose a number of basic measures of efficiency of a generalised cumulative array and then study fundamental bounds on their parameters. We then look at a number of construction techniques and show that the problem of finding good generalised cumulative arrays is closely related to the problem of finding boolean expressions with special properties

The complications of ‘hiring a hubby’: gender relations and the commoditisation of home maintenance in New Zealand

This paper examines the commoditization of traditionally male domestic tasks through interviews with handymen who own franchises in the company ‘Hire a Hubby’ in New Zealand and homeowners who have paid for home repair tasks to be done. Discussions of the commoditization of traditionally female tasks in the home have revealed the emotional conflicts of paying others to care as well as the exploitative and degrading conditions that often arise when work takes place behind closed doors. By examining the working conditions and relationships involved when traditionally male tasks are paid for, this paper raises important questions about the valuing of reproductive labour and the production of gendered identities. The paper argues that while working conditions and rates of pay for ‘hubbies’ are better than those for people undertaking commoditized forms of traditionally female domestic labour, the negotiation of this work is still complex and implicated in gendered relations and identities. Working on the home was described by interviewees as an expression of care for family and a performance of the ‘right’ way to be a ‘Kiwi bloke’ and a father. Paying others to do this labour can imply a failure in a duty of care and in the performance of masculinity

Secure Multiparty Computation from SGX

International audienceIsolated Execution Environments (IEE) offered by novel commodity hardware such as Intel's SGX deployed in Skylake processors permit executing software in a protected environment that shields it from a malicious operating system; it also permits a remote user to obtain strong interactive attestation guarantees on both the code running in an IEE and its input/output behaviour. In this paper we show how IEEs provide a new path to constructing general secure multiparty computation (MPC) protocols. Our protocol is intuitive and elegant: it uses code within an IEE to play the role of a trusted third party (TTP), and the attestation guarantees of SGX to bootstrap secure communications between participants and the TTP. In our protocol the load of communications and computations on participants only depends on the size of each party's inputs and outputs and is thus small and independent from the intricacy of the functionality to be computed. The remaining computational load-essentially that of computing the functionality-is moved to an untrusted party running an IEE-enabled machine, an appealing feature for Cloud-based scenarios. However, as often the case even with the simplest cryptographic protocols, we found that there is a large gap between this intuitively appealing solution and a protocol with rigorous security guarantees. We bridge this gap through a comprehensive set of results that include: i. a detailed construction of a protocol for secure computation for arbitrary functionalities; ii. formal security definitions for the security of the overall protocol and that of its components; and iii. a modular security analysis of our protocol that relies on a novel notion of labeled attested computation. We implemented and extensively evaluated our solution on SGX-enabled hardware, providing detailed measurements of our protocol as well as comparisons with software-only MPC solutions. Furthermore, we show the cost induced by using constant-time, i.e., timing side channel resilient, code in our implementation

On the Theory of Killing Orbits in Space-Time

This paper gives a theoretical discussion of the orbits and isotropies which arise in a space-time which admits a Lie algebra of Killing vector fields. The submanifold structure of the orbits is explored together with their induced Killing vector structure. A general decomposition of a space-time in terms of the nature and dimension of its orbits is given and the concept of stability and instability for orbits introduced. A general relation is shown linking the dimensions of the Killing algebra, the orbits and the isotropies. The well-behaved nature of "stable" orbits and the possible miss-behaviour of the "unstable" ones is pointed out and, in particular, the fact that independent Killing vector fields in space-time may not induce independent such vector fields on unstable orbits. Several examples are presented to exhibit these features. Finally, an appendix is given which revisits and attempts to clarify the well-known theorem of Fubini on the dimension of Killing orbits.Comment: Latex, 19 pages, no figur

Solving Problems of Practice in Education

The authors identify and discuss the many complexities involved in the translation of scientific information in the social sciences into forms usable for solving problems of practice in education. As a means of appropriately handling these complexities and the issues that arise, they prescribe a series of stages to be followed from the advent of a practitioner's situational problem to the design of a response to it. They assert that unless the process of translation is conducted with the prescribed level of understanding, appreciation, and rigor, the application of knowledge will be inaccurate.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/68934/2/10.1177_107554708400600103.pd

Fast multi-computations with integer similarity strategy

Abstract. Multi-computations in finite groups, such as multiexponentiations and multi-scalar multiplications, are very important in ElGamallike public key cryptosystems. Algorithms to improve multi-computations can be classified into two main categories: precomputing methods and recoding methods. The first one uses a table to store the precomputed values, and the second one finds a better binary signed-digit (BSD) representation. In this article, we propose a new integer similarity strategy for multi-computations. The proposed strategy can aid with precomputing methods or recoding methods to further improve the performance of multi-computations. Based on the integer similarity strategy, we propose two efficient algorithms to improve the performance for BSD sparse forms. The performance factor can be improved from 1.556 to 1.444 and to 1.407, respectively