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.

Police officer in-vehicle discomfort : appointments carriage method and vehicle seat features

Musculoskeletal pain is commonly reported by police officers. A potential cause of officer discomfort is a mismatch between vehicle seats and the method used for carrying appointments. Twenty-five police officers rated their discomfort while seated in: (1) a standard police vehicle seat, and (2) a vehicle seat custom-designed for police use. Discomfort was recorded in both seats while wearing police appointments on: (1) a traditional appointments belt, and (2) a load-bearing vest / belt combination (LBV). Sitting in the standard vehicle seat and carrying appointments on a traditional appointments belt were both associated with significantly elevated discomfort. Four vehicle seat features were most implicated as contributing to discomfort: back rest bolster prominence; lumbar region support; seat cushion width; and seat cushion bolster depth. Authorising the carriage of appointments using a LBV is a lower cost solution with potential to reduce officer discomfort. Furthermore, the introduction of custom-designed vehicle seats should be considered.

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.

De-Identification of health records using Anonym: Effectiveness and robustness across datasets

Objective Evaluate the effectiveness and robustness of Anonym, a tool for de-identifying free-text health records based on conditional random fields classifiers informed by linguistic and lexical features, as well as features extracted by pattern matching techniques. De-identification of personal health information in electronic health records is essential for the sharing and secondary usage of clinical data. De-identification tools that adapt to different sources of clinical data are attractive as they would require minimal intervention to guarantee high effectiveness. Methods and Materials The effectiveness and robustness of Anonym are evaluated across multiple datasets, including the widely adopted Integrating Biology and the Bedside (i2b2) dataset, used for evaluation in a de-identification challenge. The datasets used here vary in type of health records, source of data, and their quality, with one of the datasets containing optical character recognition errors. Results Anonym identifies and removes up to 96.6% of personal health identifiers (recall) with a precision of up to 98.2% on the i2b2 dataset, outperforming the best system proposed in the i2b2 challenge. The effectiveness of Anonym across datasets is found to depend on the amount of information available for training. Conclusion Findings show that Anonym compares to the best approach from the 2006 i2b2 shared task. It is easy to retrain Anonym with new datasets; if retrained, the system is robust to variations of training size, data type and quality in presence of sufficient training data.

Epidemiological and molecular features of dengue virus type-1 in New Caledonia, South Pacific, 2001–2013

Background The epidemiology of dengue in the South Pacific has been characterized by transmission of a single dominant serotype for 3–5 years, with subsequent replacement by another serotype. From 2001 to 2008 only DENV-1 was reported in the Pacific. In 2008, DENV-4 emerged and quickly displaced DENV-1 in the Pacific, except in New Caledonia (NC) where DENV-1 and DENV-4 co-circulated in 2008–2009. During 2012–2013, another DENV-1 outbreak occurred in NC, the third DENV-1 outbreak in a decade. Given that dengue is a serotype-specific immunizing infection, the recurrent outbreaks of a single serotype within a 10-year period was unexpected. Findings This study aimed to inform this phenomenon by examining the phylogenetic characteristics of the DENV-1 viruses in NC and other Pacific islands between 2001 and 2013. As a result, we have demonstrated that NC experienced introductions of viruses from both the Pacific (genotype IV) and South-east Asia (genotype I). Moreover, whereas genotype IV and I were co-circulating at the beginning of 2012, we observed that from the second half of 2012, i.e. during the major DENV-1 outbreak, all analyzed viruses were genotype I suggesting that a genotype switch occurred. Conclusions Repeated outbreaks of the same dengue serotype, as observed in NC, is uncommon in the Pacific islands. Why the earlier DENV-1 outbreaks did not induce sufficient herd immunity is unclear, and likely multifactorial, but the robust vector control program may have played a role by limiting transmission and thus maintaining a large susceptible pool in the population. Keywords: Dengue; Phylogeny; Genotype; Epidemics; New Caledonia

Features-pooling blind jpeg image steganalysis

In this research, we introduce a new blind steganalysis in detecting grayscale JPEG images. Features-pooling method is employed to extract the steganalytic features and the classification is done by using neural network. Three different steganographic models are tested and classification results are compared to the five state-of-the-art blind steganalysis.

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.

Making YAWL and SmartPM interoperate : managing highly dynamic processes by exploiting automatic adaptation features

In the last years, the trade-o between exibility and sup- port has become a leading issue in work ow technology. In this paper we show how an imperative modeling approach used to de ne stable and well-understood processes can be complemented by a modeling ap- proach that enables automatic process adaptation and exploits planning techniques to deal with environmental changes and exceptions that may occur during process execution. To this end, we designed and imple- mented a Custom Service that allows the Yawl execution environment to delegate the execution of subprocesses and activities to the SmartPM execution environment, which is able to automatically adapt a process to deal with emerging changes and exceptions. We demonstrate the fea- sibility and validity of the approach by showing the design and execution of an emergency management process de ned for train derailments.

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.

Computation of ECG signal features using MCMC modelling in software and FPGA reconfigurable hardware

Computational optimisation of clinically important electrocardiogram signal features, within a single heart beat, using a Markov-chain Monte Carlo (MCMC) method is undertaken. A detailed, efficient data-driven software implementation of an MCMC algorithm has been shown. Initially software parallelisation is explored and has been shown that despite the large amount of model parameter inter-dependency that parallelisation is possible. Also, an initial reconfigurable hardware approach is explored for future applicability to real-time computation on a portable ECG device, under continuous extended use.

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.

Cheating prevention in linear secret sharing

Cheating detection in linear secret sharing is considered. The model of cheating extends the Tompa-Woll attack and includes cheating during multiple (unsuccessful) recovery of the secret. It is shown that shares in most linear schemes can be split into subshares. Subshares can be used by participants to trade perfectness of the scheme with cheating prevention. Evaluation of cheating prevention is given in the context of different strategies applied by cheaters.

Cheating prevention in secret sharing over GF(pt)

The work investigates cheating prevention in secret sharing. It is argued that cheating is immune against cheating if the cheaters gain no advantage over honest participants by submitting invalid shares to the combiner. This work addresses the case when shares and the secret are taken from GF(pt). Two models are considered. The first one examines the case when cheaters consistently submit always invalid shares. The second modeldeal s with cheaters who submit a mixture of valid and invalid shares. For these two models, cheating immunity is defined, properties of cheating immune secret sharing are investigated and their constructions are given.

Constructions of cheating immune secret sharing

The work addresses the problem of cheating prevention in secret sharing. Two cheating scenarios are considered. In the first one, the cheaters always submit invalid shares to the combiner. In the second one, the cheaters collectively decide which shares are to be modified so the combiner gets a mixture of valid and invalid shares from the cheaters. The secret scheme is said to be k-cheating immune if any group of k cheaters has no advantage over honest participants. The paper investigates cryptographic properties of the defining function of secret sharing so the scheme is k-cheating immune. Constructions of secret sharing immune against k cheaters are given.

Generalised cumulative arrays in secret sharing

Cumulative arrays have played an important role in the early development of the secret sharing theory. They have not been subject to extensive study so far, as the secret sharing schemes built on them generally result in much larger sizes of shares, when compared with other conventional approaches. Recent works in threshold cryptography show that cumulative arrays may be the appropriate building blocks in non-homomorphic threshold cryptosystems where the conventional secret sharing methods are generally of no use. In this paper we study several extensions of cumulative arrays and show that some of these extensions significantly improve the performance of conventional cumulative arrays. In particular, we derive bounds on generalised cumulative arrays and show that the constructions based on perfect hash families are asymptotically optimal. We also introduce the concept of ramp perfect hash families as a generalisation of perfect hash families for the study of ramp secret sharing schemes and ramp cumulative arrays.