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.

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.

Using emotion to diversify document rankings

The aim of this paper is to investigate the role of emotion features in diversifying document rankings to improve the effectiveness of Information Retrieval (IR) systems. For this purpose, two approaches are proposed to consider emotion features for diversification, and they are empirically tested on the TREC 678 Interactive Track collection. The results show that emotion features are capable of enhancing retrieval effectiveness.

Multi-party computation with conversion of secret sharing

Classical results in unconditionally secure multi-party computation (MPC) protocols with a passive adversary indicate that every n-variate function can be computed by n participants, such that no set of size t < n/2 participants learns any additional information other than what they could derive from their private inputs and the output of the protocol. We study unconditionally secure MPC protocols in the presence of a passive adversary in the trusted setup (‘semi-ideal’) model, in which the participants are supplied with some auxiliary information (which is random and independent from the participant inputs) ahead of the protocol execution (such information can be purchased as a “commodity” well before a run of the protocol). We present a new MPC protocol in the trusted setup model, which allows the adversary to corrupt an arbitrary number t < n of participants. Our protocol makes use of a novel subprotocol for converting an additive secret sharing over a field to a multiplicative secret sharing, and can be used to securely evaluate any n-variate polynomial G over a field F, with inputs restricted to non-zero elements of F. The communication complexity of our protocol is O(ℓ · n 2) field elements, where ℓ is the number of non-linear monomials in G. Previous protocols in the trusted setup model require communication proportional to the number of multiplications in an arithmetic circuit for G; thus, our protocol may offer savings over previous protocols for functions with a small number of monomials but a large number of multiplications.

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.

Interactions between organizational culture, trustworthiness, and mechanisms for inter-project knowledge sharing

This research used a multiple-case study approach to empirically investigate the complex relationship between factors influencing inter-project knowledge sharing—trustworthiness, organizational culture, and knowledge-sharing mechanisms. Adopting a competing values framework, we found evidence of patterns existing between the type of culture, on the project management unit level, and project managers’ perceptions of valuing trustworthy behaviors and the way they share knowledge, on the individual level. We also found evidence for mutually reinforcing the effect of trust and clan culture, which shape tacit knowledge-sharing behaviors.

Verifiable multi-secret sharing schemes for multiple threshold access structures

A multi-secret sharing scheme allows several secrets to be shared amongst a group of participants. In 2005, Shao and Cao developed a verifiable multi-secret sharing scheme where each participant’s share can be used several times which reduces the number of interactions between the dealer and the group members. In addition some secrets may require a higher security level than others involving the need for different threshold values. Recently Chan and Chang designed such a scheme but their construction only allows a single secret to be shared per threshold value. In this article we combine the previous two approaches to design a multiple time verifiable multi-secret sharing scheme where several secrets can be shared for each threshold value. Since the running time is an important factor for practical applications, we will provide a complexity comparison of our combined approach with respect to the previous schemes.

The effectiveness of information-sharing interventions as a means to reduce anxiety in families waiting for surgical patients undergoing an elective surgical procedure : a systematic review protocol

Review question/objective What are the most effective information sharing strategies used to reduce anxiety in families of patients undergoing elective surgery? This review seeks to synthesize the best available evidence in relation to the most effective information-sharing intervention to reduce anxiety for families waiting for patients undergoing an elective surgical procedure. The specific objectives are to review the effectiveness of evidence of interventions designed to reduce the anxiety of families waiting whilst their loved one undergoes a surgical intervention. A variety of interventions exist and include surgical nurse liaison services, intraoperative reporting either by face-to-face or telephone delivery, informational cards, visual information screens, and intraoperative paging devices for families. Inclusion criteria Types of participants All studies of family members over 18 years of age waiting for patients undergoing an elective surgical procedure will be included, including those waiting for both adult and paediatric patients. Studies of families waiting for other patient populations, eg emergency surgery, chemotherapy or intensive care patients will be excluded. Types of intervention(s)/phenomena of interest All information-sharing Interventions for families of patients undergoing an elective surgical procedure will be included, including but not limited to: surgical nurse liaison services, in-person intraoperative reporting, visual information screens, paging devices, informational cards and telephone delivery of intraoperative progress reports. Interventions that take place during the intraoperative phase of care only will be included in the review. Preadmission information sharing interventions will be excluded. Types of outcomes The outcomes of interest include: Primary outcome: the level of anxiety amongst family members or close relatives whilst waiting for patients undergoing surgery, as measured by a validated instrument (such as the S-Anxiety portion of the State-Trait Anxiety Inventory).4 Secondary outcomes: family satisfaction and other measurements that may be considered indicators of stress and anxiety, such as mean arterial pressure (MAP) and heart rate.

Automatic inference of driving task demand from visual cues of emotion and attention

Sensing the mental, physical and emotional demand of a driving task is of primary importance in road safety research and for effectively designing in-vehicle information systems (IVIS). Particularly, the need of cars capable of sensing and reacting to the emotional state of the driver has been repeatedly advocated in the literature. Algorithms and sensors to identify patterns of human behavior, such as gestures, speech, eye gaze and facial expression, are becoming available by using low cost hardware: This paper presents a new system which uses surrogate measures such as facial expression (emotion) and head pose and movements (intention) to infer task difficulty in a driving situation. 11 drivers were recruited and observed in a simulated driving task that involved several pre-programmed events aimed at eliciting emotive reactions, such as being stuck behind slower vehicles, intersections and roundabouts, and potentially dangerous situations. The resulting system, combining face expressions and head pose classification, is capable of recognizing dangerous events (such as crashes and near misses) and stressful situations (e.g. intersections and way giving) that occur during the simulated drive.

Cheating immune secret sharing

We consider secret sharing with binary shares. This model allows us to use the well developed theory of cryptographically strong boolean functions. We prove that for given secret sharing, the average cheating probability over all cheating and original vectors, i.e., ρ ¯= 1 n ⋅ 2 −n ∑ n c=1 ∑ α∈Vn ρ c,α , satisfies ρ ¯⩾ 1 2 , and the equality holds ⇔ ρc,α satisfies ρc,α = 1/2 for every cheating vector δc and every original vector α. In this case the secret sharing is said to be cheating immune. We further establish a relationship between cheating-immune secret sharing and cryptographic criteria of boolean functions. This enables us to construct cheating-immune secret sharing.