Combinatorial design of key distribution mechanisms for wireless sensor networks

Key distribution is one of the most challenging security issues in wireless sensor networks where sensor nodes are randomly scattered over a hostile territory. In such a sensor deployment scenario, there will be no prior knowledge of post deployment configuration. For security solutions requiring pairwise keys, it is impossible to decide how to distribute key pairs to sensor nodes before the deployment. Existing approaches to this problem are to assign more than one key, namely a key-chain, to each node. Key-chains are randomly drawn from a key-pool. Either two neighboring nodes have a key in common in their key-chains, or there is a path, called key-path, among these two nodes where each pair of neighboring nodes on this path has a key in common. Problem in such a solution is to decide on the key-chain size and key-pool size so that every pair of nodes can establish a session key directly or through a path with high probability. The size of the key-path is the key factor for the efficiency of the design. This paper presents novel, deterministic and hybrid approaches based on Combinatorial Design for key distribution. In particular, several block design techniques are considered for generating the key-chains and the key-pools.

Finding additional semantic entity information for search engines

Entity-oriented search has become an essential component of modern search engines. It focuses on retrieving a list of entities or information about the specific entities instead of documents. In this paper, we study the problem of finding entity related information, referred to as attribute-value pairs, that play a significant role in searching target entities. We propose a novel decomposition framework combining reduced relations and the discriminative model, Conditional Random Field (CRF), for automatically finding entity-related attribute-value pairs from free text documents. This decomposition framework allows us to locate potential text fragments and identify the hidden semantics, in the form of attribute-value pairs for user queries. Empirical analysis shows that the decomposition framework outperforms pattern-based approaches due to its capability of effective integration of syntactic and semantic features.

Temporal summation of intrinsically photosensitive retinal ganglion cell (ipRGC) contributions to the human pupil.

Purpose: IpRGCs mediate non-image forming functions including photoentrainment and the pupil light reflex (PLR). Temporal summation increases visual sensitivity and decreases temporal resolution for image forming vision, but the summation properties of nonimage forming vision are unknown. We investigated the temporal summation of inner (ipRGC) and outer (rod/cone) retinal inputs to the PLR. Method: The consensual PLR of the left eye was measured in six participants with normal vision using a Maxwellian view infrared pupillometer. Temporal summation was investigated using a double-pulse protocol (100 ms stimulus pairs; 0–1024 ms inter-stimulus interval, ISI) presented to the dilated fellow right eye (Tropicamide 1%). Stimulus lights (blue λmax = 460 nm; red λmax = 638 nm) biased activity to inneror outer retinal inputs to non-image forming vision. Temporal summation was measured suprathreshold (15.2 log photons.cm−2.s−1 at the cornea) and subthreshold (11.4 log photons.cm−2.s−1 at the cornea). Results: RM-ANOVAs showed the suprathreshold and subthreshold 6 second post illumination pupil response (PIPR: expressed as percentage baseline diameter) did not significantly vary for red or blue stimuli (p > .05). The PIPR for a subthreshold red 16 ms double-pulse control condition did not significantly differ with ISI (p > .05). The maximum constriction amplitude for red and blue 100 ms double- pulse stimuli did not significantly vary with ISI (p > .05). Conclusion: The non-significant changes in suprathreshold PIPR and subthreshold maximum pupil constriction indicate that inner retinal ipRGC inputs and outer retinal photoreceptor inputs to the PLR do not show temporal summation. The results suggest a fundamental difference between the temporal summation characteristics of image forming and non-image forming vision.

Decentralized detector generation in cooperative intrusion detection system

We consider Cooperative Intrusion Detection System (CIDS) which is a distributed AIS-based (Artificial Immune System) IDS where nodes collaborate over a peer-to-peer overlay network. The AIS uses the negative selection algorithm for the selection of detectors (e.g., vectors of features such as CPU utilization, memory usage and network activity). For better detection performance, selection of all possible detectors for a node is desirable but it may not be feasible due to storage and computational overheads. Limiting the number of detectors on the other hand comes with the danger of missing attacks. We present a scheme for the controlled and decentralized division of detector sets where each IDS is assigned to a region of the feature space. We investigate the trade-off between scalability and robustness of detector sets. We address the problem of self-organization in CIDS so that each node generates a distinct set of the detectors to maximize the coverage of the feature space while pairs of nodes exchange their detector sets to provide a controlled level of redundancy. Our contribution is twofold. First, we use Symmetric Balanced Incomplete Block Design, Generalized Quadrangles and Ramanujan Expander Graph based deterministic techniques from combinatorial design theory and graph theory to decide how many and which detectors are exchanged between which pair of IDS nodes. Second, we use a classical epidemic model (SIR model) to show how properties from deterministic techniques can help us to reduce the attack spread rate.

Combinatorial design of key distribution mechanisms for wireless sensor networks

Key distribution is one of the most challenging security issues in wireless sensor networks where sensor nodes are randomly scattered over a hostile territory. In such a sensor deployment scenario, there will be no prior knowledge of post deployment configuration. For security solutions requiring pair wise keys, it is impossible to decide how to distribute key pairs to sensor nodes before the deployment. Existing approaches to this problem are to assign more than one key, namely a key-chain, to each node. Key-chains are randomly drawn from a key-pool. Either two neighbouring nodes have a key in common in their key-chains, or there is a path, called key-path, among these two nodes where each pair of neighbouring nodes on this path has a key in common. Problem in such a solution is to decide on the key-chain size and key-pool size so that every pair of nodes can establish a session key directly or through a path with high probability. The size of the key-path is the key factor for the efficiency of the design. This paper presents novel, deterministic and hybrid approaches based on Combinatorial Design for key distribution. In particular, several block design techniques are considered for generating the key-chains and the key-pools. Comparison to probabilistic schemes shows that our combinatorial approach produces better connectivity with smaller key-chain sizes.

Prediction of IBD based on population history for fine gene mapping

A novel multiple regression method (RM) is developed to predict identity-by-descent probabilities at a locus L (IBDL), among individuals without pedigree, given information on surrounding markers and population history. These IBDL probabilities are a function of the increase in linkage disequilibrium (LD) generated by drift in a homogeneous population over generations. Three parameters are sufficient to describe population history: effective population size (Ne), number of generations since foundation (T), and marker allele frequencies among founders (p). IBD L are used in a simulation study to map a quantitative trait locus (QTL) via variance component estimation. RM is compared to a coalescent method (CM) in terms of power and robustness of QTL detection. Differences between RM and CM are small but significant. For example, RM is more powerful than CM in dioecious populations, but not in monoecious populations. Moreover, RM is more robust than CM when marker phases are unknown or when there is complete LD among founders or Ne is wrong, and less robust when p is wrong. CM utilises all marker haplotype information, whereas RM utilises information contained in each individual marker and all possible marker pairs but not in higher order interactions. RM consists of a family of models encompassing four different population structures, and two ways of using marker information, which contrasts with the single model that must cater for all possible evolutionary scenarios in CM.

Vibrational spectroscopy of natural cave mineral monetite CaHPO4 and the synthetic analog

Monetite is a phosphate mineral formed by the reaction of the chemicals in bat guano with calcite substrates and is commonly found in caves. The analog of the mineral monetite CaHPO4 has been synthesized and the Raman and infrared spectra of the natural monetite originating from the Murra-el-elevyn Cave, Eucla, Western Australia, compared. Monetite is characterized by a complex set of phosphate bands that arise because of two sets of pairs of phosphate units in the unit cell. Raman and infrared bands are assigned to HPO4(2-), OH stretching and bending vibrations. Infrared bands at 1346 and 1402 cm−1 are assigned to POH deformation modes. Vibrational spectroscopy confirms the presence of monetite in the cave system.

A framework for a dense matching algorithm : Results using matching metrics and order statistic filters

An algorithm for computing dense correspondences between images of a stereo pair or image sequence is presented. The algorithm can make use of both standard matching metrics and the rank and census filters, two filters based on order statistics which have been applied to the image matching problem. Their advantages include robustness to radiometric distortion and amenability to hardware implementation. Results obtained using both real stereo pairs and a synthetic stereo pair with ground truth were compared. The rank and census filters were shown to significantly improve performance in the case of radiometric distortion. In all cases, the results obtained were comparable to, if not better than, those obtained using standard matching metrics. Furthermore, the rank and census have the additional advantage that their computational overhead is less than these metrics. For all techniques tested, the difference between the results obtained for the synthetic stereo pair, and the ground truth results was small.

Order statistic filters for image matching

The rank and census are two filters based on order statistics which have been applied to the image matching problem for stereo pairs. Advantages of these filters include their robustness to radiometric distortion and small amounts of random noise, and their amenability to hardware implementation. In this paper, a new matching algorithm is presented, which provides an overall framework for matching, and is used to compare the rank and census techniques with standard matching metrics. The algorithm was tested using both real stereo pairs and a synthetic pair with ground truth. The rank and census filters were shown to significantly improve performance in the case of radiometric distortion. In all cases, the results obtained were comparable to, if not better than, those obtained using standard matching metrics. Furthermore, the rank and census have the additional advantage that their computational overhead is less than these metrics. For all techniques tested, the difference between the results obtained for the synthetic stereo pair, and the ground truth results was small.

Multipurpose identity-based signcryption : a Swiss army knife for identity-based cryptography

Identity-Based (IB) cryptography is a rapidly emerging approach to public-key cryptography that does not require principals to pre-compute key pairs and obtain certificates for their public keys— instead, public keys can be arbitrary identifiers such as email addresses, while private keys are derived at any time by a trusted private key generator upon request by the designated principals. Despite the flurry of recent results on IB encryption and signature, some questions regarding the security and efficiency of practicing IB encryption (IBE) and signature (IBS) as a joint IB signature/encryption (IBSE) scheme with a common set of parameters and keys, remain unanswered. We first propose a stringent security model for IBSE schemes. We require the usual strong security properties of: (for confidentiality) indistinguishability against adaptive chosen-ciphertext attacks, and (for nonrepudiation) existential unforgeability against chosen-message insider attacks. In addition, to ensure as strong as possible ciphertext armoring, we also ask (for anonymity) that authorship not be transmitted in the clear, and (for unlinkability) that it remain unverifiable by anyone except (for authentication) by the legitimate recipient alone. We then present an efficient IBSE construction, based on bilinear pairings, that satisfies all these security requirements, and yet is as compact as pairing-based IBE and IBS in isolation. Our scheme is secure, compact, fast and practical, offers detachable signatures, and supports multirecipient encryption with signature sharing for maximum scalability.

2-(4-Aminobenzenesulfonamido)-4,6-dimetylpyrimidin-1-ium 2-carboxy-4,6-dinitrophenolate

In the structure of the of the phenolate salt of the sulfa drug sulfamethazine with 3,5-dinitrosalicylic acid, C12H15N4O2S+ C7H3N2O7-, the dihedral angle between the pyrimidine and phenyl rings of the cation is 59.70(17)\%. Cation--anion hydrogen-bonding interactions involving pyrimidine N+-H...O(carboxyl) and amine N-H...O(carboxyl) pairs give a cyclic R2/2(8) motif while secondary N-H...O hydrogen bonds between the aniline group and both sulfone and nitro O-atom acceptors give a two-dimensional structure extending along (001).

Experimental and modelling investigation of monolayer development with clustering

Standard differential equation–based models of collective cell behaviour, such as the logistic growth model, invoke a mean–field assumption which is equivalent to assuming that individuals within the population interact with each other in proportion to the average population density. Implementing such assumptions implies that the dynamics of the system are unaffected by spatial structure, such as the formation of patches or clusters within the population. Recent theoretical developments have introduced a class of models, known as moment dynamics models, which aim to account for the dynamics of individuals, pairs of individuals, triplets of individuals and so on. Such models enable us to describe the dynamics of populations with clustering, however, little progress has been made with regard to applying moment dynamics models to experimental data. Here, we report new experimental results describing the formation of a monolayer of cells using two different cell types: 3T3 fibroblast cells and MDA MB 231 breast cancer cells. Our analysis indicates that the 3T3 fibroblast cells are relatively motile and we observe that the 3T3 fibroblast monolayer forms without clustering. Alternatively, the MDA MB 231 cells are less motile and we observe that the MDA MB 231 monolayer formation is associated with significant clustering. We calibrate a moment dynamics model and a standard mean–field model to both data sets. Our results indicate that the mean–field and moment dynamics models provide similar descriptions of the 3T3 fibroblast monolayer formation whereas these two models give very different predictions for the MDA MD 231 monolayer formation. These outcomes indicate that standard mean–field models of collective cell behaviour are not always appropriate and that care ought to be exercised when implementing such a model.

Hybrid graphene/titania nanocomposite : interface charge transfer, hole doping, and sensitization for visible light response

We demonstrated for the first time by large-scale ab initio calculations that a graphene/titania interface in the ground electronic state forms a charge-transfer complex due to the large difference of work functions between graphene and titania, leading to substantial hole doping in graphene. Interestingly, electrons in the upper valence band can be directly excited from graphene to the conduction band, that is, the 3d orbitals of titania, under visible light irradiation. This should yield well-separated electron−hole pairs, with potentially high photocatalytic or photovoltaic performance in hybrid graphene and titania nanocomposites. Experimental wavelength-dependent photocurrent generation of the graphene/titania photoanode demonstrated noticeable visible light response and evidently verified our ab initio prediction.

An evaluation of corpus-driven measures of medical concept similarity for information retrieval

Measures of semantic similarity between medical concepts are central to a number of techniques in medical informatics, including query expansion in medical information retrieval. Previous work has mainly considered thesaurus-based path measures of semantic similarity and has not compared different corpus-driven approaches in depth. We evaluate the effectiveness of eight common corpus-driven measures in capturing semantic relatedness and compare these against human judged concept pairs assessed by medical professionals. Our results show that certain corpus-driven measures correlate strongly (approx 0.8) with human judgements. An important finding is that performance was significantly affected by the choice of corpus used in priming the measure, i.e., used as evidence from which corpus-driven similarities are drawn. This paper provides guidelines for the implementation of semantic similarity measures for medical informatics and concludes with implications for medical information retrieval.

Character in the workplace : self directedness mediates harm avoidance in the prediction of job performance

The purpose of this study was to test a model of the relationship between temperament, character and job performance, in order to better understand the cause of stable individual differences in job performance. Personality was conceptualized in terms of Cloninger, Svrakic and Przybeck’s (1993) theoretical framework of personality. It was expected that Self Directedness (character) would mediate Harm Avoidance and Persistence (temperament) in the prediction of job performance. In order to test the hypotheses, a sample of 94 employee/supervisor pairs was recruited from several organizations across Australia. Participants completed a number of questionnaires online, regarding their personality traits (completed by employees) and Job Performance (completed by Supervisors). Consistent with the hypothesis, Self Directedness was found to be a moderate, direct predictor of job performance. Also consistent with the hypothesis, Self Directedness mediated Harm Avoidance in the prediction of job performance. Results show that character (Self Directedness) is important in the prediction of job performance, and also suggests that fearful, avoidant individuals are less likely to perform well in the workplace, based on their low level of character development.