Dynamic load sharing in heavy vehicle suspensions - further analysis of the equalisation effects of larger air lines

This paper provides details on comparative testing of axle-to-chassis forces of two heavy vehicles (HVs) based on an experimental programme carried out in 2007. Dynamic forces at the air springs were measured against speed and roughness values for the test roads used. One goal of that programme was to determine whether dynamic axle-to-chassis forces could be reduced by using larger-than-standard diameter longitudinal air lines. This paper presents a portion of the methodology, analysis and results from that programme. Two analytical techniques and their results are presented. The first uses correlation coefficients of the forces between air springs and the second is a student’s t-test. These were used to determine the causality surrounding improved dynamic load sharing between heavy vehicle air springs with larger air lines installed longitudinally compared with the standard sized air lines installed on the majority of air-sprung heavy vehicles.

Computational simulation of the early stage of bone healing under different configurations of locking compression plates

Flexible fixation or the so-called ‘biological fixation’ has been shown to encourage the formation of fracture callus, leading to better healing outcomes. However, the nature of the relationship between the degree of mechanical stability provided by a flexible fixation and the optimal healing outcomes has not been fully understood. In this study, we have developed a validated quantitative model to predict how cells in fracture callus might respond to change in their mechanical microenvironment due to different configurations of locking compression plate (LCP) in clinical practice, particularly in the early stage of healing. The model predicts that increasing flexibility of the LCP by changing the bone–plate distance (BPD) or the plate working length (WL) could enhance interfragmentary strain in the presence of a relatively large gap size (.3 mm). Furthermore, conventional LCP normally results in asymmetric tissue development during early stage of callus formation, and the increase of BPD or WL is insufficient to alleviate this problem.

Information systems development outsourcing : the role of control configurations

The Control Theory has provided a useful theoretical foundation for Information Systems development outsourcing (ISD-outsourcing) to examine the co-ordination between the client and the vendor. Recent research identified two control mechanisms: structural (structure of the control mode) and process (the process through which the control mode is enacted). Yet, the Control Theory research to-date does not describe the ways in which the two control mechanisms can be combined to ensure project success. Grounded in case study data of eight ISD-outsourcing projects, we derive three ‘control configurations’; i) aligned, ii) negotiated, and 3) self-managed, which describe the combinative patterns of structural and process control mechanisms within and across control modes.

Power sharing control with frequency droop in a hybrid microgrid

A microgrid may contain a large number of distributed generators (DGs). These DGs can be either inertial or non-inertial, either dispatchable or non-dispatchable. Moreover, the DGs may operate in plug and play fashion. The combination of these various types of operation makes the microgrid control a challenging task, especially when the microgrid operates in an autonomous mode. In this paper, a new control algorithm for converter interfaced (dispatchable) DG is proposed which facilitates smooth operation in a hybrid microgrid containing inertial and non-inertial DGs. The control algorithm works satisfactorily even when some of the DGs operate in plug and play mode. The proposed strategy is validated through PSCAD simulation studies.

Creating and sharing : teens' information practices in digital communities

Introduction In a connected world youth are participating in digital content creating communities. This paper introduces a description of teens' information practices in digital content creating and sharing communities. Method The research design was a constructivist grounded theory methodology. Seventeen interviews with eleven teens were collected and observation of their digital communities occurred over a two-year period. Analysis The data were analysed iteratively to describe teens' interactions with information through open and then focused coding. Emergent categories were shared with participants to confirm conceptual categories. Focused coding provided connections between conceptual categories resulting in the theory, which was also shared with participants for feedback. Results The paper posits a substantive theory of teens' information practices as they create and share content. It highlights that teens engage in the information actions of accessing, evaluating, and using information. They experienced information in five ways: participation, information, collaboration, process, and artefact. The intersection of enacting information actions and experiences of information resulted in five information practices: learning community, negotiating aesthetic, negotiating control, negotiating capacity, and representing knowledge. Conclusion This study contributes to our understanding of youth information actions, experiences, and practices. Further research into these communities might indicate what information practices are foundational to digital communities.

Control, operation and power sharing among parallel converter-interfaced DERs in a microgrid in the presence of unbalanced and harmonic loads

This paper demonstrates power management and control of DERs in an autonomous MG. The paper focuses on the control and performance of converter-interfaced DERs in voltage controlled mode. Several case studies are considered for a MG based on the different types of loads supplied by the MG (i.e. balanced three-phase, unbalanced, single-phase and harmonic loads). DERs are controlled by adjusting the voltage magnitude and angle in their converter output through droop control, in a decentralized concept. Based on this control method, DERs can successfully share the total demand of the MG in the presence of any type of loads. This includes proper total power sharing, unbalanced power sharing as well as harmonic power sharing, depending on the load types. The efficacy of the proposed power control, sharing and management among DERs in a microgrid is validated through extensive simulation studies using PSCAD/EMTDC.

Social media and tacit knowledge sharing : physicians' perspectives and experiences

Tacit knowledge sharing amongst physicians is known to have a significant impact on the quality of medical decisions. This thesis posits that social media can provide new opportunities for tacit knowledge sharing amongst physicians, and demonstrates this by presenting findings from a review of relevant literature and a qualitative survey conducted with physicians. Using thematic analysis, the study revealed five major themes and over twenty sub-themes as potential contributions of social media to tacit knowledge flow amongst physicians.

Distributed public-key cryptography from weak secrets

We introduce the notion of distributed password-based public-key cryptography, where a virtual high-entropy private key is implicitly defined as a concatenation of low-entropy passwords held in separate locations. The users can jointly perform private-key operations by exchanging messages over an arbitrary channel, based on their respective passwords, without ever sharing their passwords or reconstituting the key. Focusing on the case of ElGamal encryption as an example, we start by formally defining ideal functionalities for distributed public-key generation and virtual private-key computation in the UC model. We then construct efficient protocols that securely realize them in either the RO model (for efficiency) or the CRS model (for elegance). We conclude by showing that our distributed protocols generalize to a broad class of “discrete-log”-based public-key cryptosystems, which notably includes identity-based encryption. This opens the door to a powerful extension of IBE with a virtual PKG made of a group of people, each one memorizing a small portion of the master key.

Quantum direct secret sharing with efficient eavesdropping-check and authentication based on distributed fountain codes

We propose to use a simple and effective way to achieve secure quantum direct secret sharing. The proposed scheme uses the properties of fountain codes to allow a realization of the physical conditions necessary for the implementation of no-cloning principle for eavesdropping-check and authentication. In our scheme, to achieve a variety of security purposes, nonorthogonal state particles are inserted in the transmitted sequence carrying the secret shares to disorder it. However, the positions of the inserted nonorthogonal state particles are not announced directly, but are obtained by sending degrees and positions of a sequence that are pre-shared between Alice and each Bob. Moreover, they can confirm that whether there exists an eavesdropper without exchanging classical messages. Most importantly, without knowing the positions of the inserted nonorthogonal state particles and the sequence constituted by the first particles from every EPR pair, the proposed scheme is shown to be secure.

Decomposition construction for secret sharing schemes with graph access structures in polynomial time

The purpose of this paper is to describe a new decomposition construction for perfect secret sharing schemes with graph access structures. The previous decomposition construction proposed by Stinson is a recursive method that uses small secret sharing schemes as building blocks in the construction of larger schemes. When the Stinson method is applied to the graph access structures, the number of such “small” schemes is typically exponential in the number of the participants, resulting in an exponential algorithm. Our method has the same flavor as the Stinson decomposition construction; however, the linear programming problem involved in the construction is formulated in such a way that the number of “small” schemes is polynomial in the size of the participants, which in turn gives rise to a polynomial time construction. We also show that if we apply the Stinson construction to the “small” schemes arising from our new construction, both have the same information rate.

Lattice-based threshold changeability for standard shamir sectret-sharing schemes

We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the dealer and the shareholders. Previous solutions to this problem require one to start off with a nonstandard scheme designed specifically for this purpose, or to have communication between shareholders. In contrast, we show how to increase the threshold parameter of the standard Shamir secret-sharing scheme without communication between the shareholders. Our technique can thus be applied to existing Shamir schemes even if they were set up without consideration to future threshold increases. Our method is a new positive cryptographic application for lattice reduction algorithms, inspired by recent work on lattice-based list decoding of Reed-Solomon codes with noise bounded in the Lee norm. We use fundamental results from the theory of lattices (geometry of numbers) to prove quantitative statements about the information-theoretic security of our construction. These lattice-based security proof techniques may be of independent interest.

Technique for evaluating photo sharing interfaces with the early prototypes - group simulation

User evaluations using paper prototypes commonly lack social context. The Group simulation technique described in this paper offers a solution to this problem. The study introduces an early-phase participatory design technique targeted for small groups. The proposed technique is used for evaluating an interface, which enables group work in photo collection creation. Three groups of four users, 12 in total, took part in a simulation session where they tested a low-fidelity design concept that included their own personal photo content from an event that their group attended together. The users’ own content was used to evoke natural experiences. Our results indicate that the technique helped users to naturally engage with the prototype in the session. The technique is suggested to be suitable for evaluating other early-phase concepts and to guide design solutions, especially with the concepts that include users’ personal content and enable content sharing.

Geo-locked photo sharing on mobile devices

We introduce the idea of geo-locking through a mobile phone based photo sharing application called Picalilly (figure 1). Using its geo-locking feature, Picalilly allows its users to manually define geographical boundaries for sharing photos -- limiting sharing within user-defined boundaries as well as facilitating open sharing between strangers within such boundaries. To explore the potential of geo-locking, we carried out a small scale field trial of Picalilly involving two groups of students, who were part of a two-week long introduction program at a university. Our preliminary results show that Picalilly facilitated 1) sharing of 'places' and 2) localized explorations.

Active security in multiparty computation over black-box groups

Most previous work on unconditionally secure multiparty computation has focused on computing over a finite field (or ring). Multiparty computation over other algebraic structures has not received much attention, but is an interesting topic whose study may provide new and improved tools for certain applications. At CRYPTO 2007, Desmedt et al introduced a construction for a passive-secure multiparty multiplication protocol for black-box groups, reducing it to a certain graph coloring problem, leaving as an open problem to achieve security against active attacks. We present the first n-party protocol for unconditionally secure multiparty computation over a black-box group which is secure under an active attack model, tolerating any adversary structure Δ satisfying the Q 3 property (in which no union of three subsets from Δ covers the whole player set), which is known to be necessary for achieving security in the active setting. Our protocol uses Maurer’s Verifiable Secret Sharing (VSS) but preserves the essential simplicity of the graph-based approach of Desmedt et al, which avoids each shareholder having to rerun the full VSS protocol after each local computation. A corollary of our result is a new active-secure protocol for general multiparty computation of an arbitrary Boolean circuit.