Semiparametric estimation of count regression models

This paper develops a semiparametric estimation approach for mixed count regression models based on series expansion for the unknown density of the unobserved heterogeneity. We use the generalized Laguerre series expansion around a gamma baseline density to model unobserved heterogeneity in a Poisson mixture model. We establish the consistency of the estimator and present a computational strategy to implement the proposed estimation techniques in the standard count model as well as in truncated, censored, and zero-inflated count regression models. Monte Carlo evidence shows that the finite sample behavior of the estimator is quite good. The paper applies the method to a model of individual shopping behavior. © 1999 Elsevier Science S.A. All rights reserved.

Imputing a continuous income variable from a bracketed income variable with special attention to missing observations

This paper proposes a method, based on polychotomous discrete choice methods, to impute a continuous measure of income when only a bracketed measure of income is available and for only a subset of the obsevations. The method is shown to perform well with CP5 data. © 1991.

Molecular basis for enhancement of the meiotic DMC1 recombinase by RAD51 associated protein 1 (RAD51AP1)

Homologous recombination is needed for meiotic chromosome segregation, genome maintenance, and tumor suppression. RAD51AP1 (RAD51 associated protein 1) has been shown to interact with and enhance the recombinase activity of RAD51. Accordingly, genetic ablation of RAD51AP1 leads to enhanced sensitivity to and also chromosome aberrations upon DNA damage, demonstrating a role for RAD51AP1 in mitotic homologous recombination. Here we show physical association of RAD51AP1 with the meiosis-specific recombinase DMC1 and a stimulatory effect of RAD51AP1 on the DMC1-mediated D-loop reaction. Mechanistic studies have revealed that RAD51AP1 enhances the ability of the DMC1 presynaptic filament to capture the duplex-DNA partner and to assemble the synaptic complex, in which the recombining DNA strands are homologously aligned. We also provide evidence that functional cooperation is dependent on complex formation between DMC1 and RAD51AP1 and that distinct epitopes in RAD51AP1 mediate interactions with RAD51 and DMC1. Finally, we show that RAD51AP1 is expressed in mouse testes, and that RAD51AP1 foci colocalize with a subset of DMC1 foci in spermatocytes. These results suggest that RAD51AP1 also serves an important role in meiotic homologous recombination.

Defining and Accounting for Fundraising Income and Expenses

Charities' fundraising financial transactions should be reported in the interests of accountability, and the report should be publicly available. However, research shows that at present there is little consistency in how fundraising is defined or in how such transactions are reported, and little guidance from accounting standards. This report examines whether the current reporting of fundraising in annual financial statements by Australian charities is fit for the purposes of informing the donating public and other stakeholders, whether through the Australian Charities and Not-for-profits Commission’s registry strategy or through other means such as private ratings agencies. The authors endeavour to suggest a way forward if it is not.

Cholesterol regulates Syntaxin 6 trafficking at trans-Golgi network endosomal boundaries.

Inhibition of cholesterol export from late endosomes causes cellular cholesterol imbalance, including cholesterol depletion in the trans-Golgi network (TGN). Here, using Chinese hamster ovary (CHO) Niemann-Pick type C1 (NPC1) mutant cell lines and human NPC1 mutant fibroblasts, we show that altered cholesterol levels at the TGN/endosome boundaries trigger Syntaxin 6 (Stx6) accumulation into VAMP3, transferrin, and Rab11-positive recycling endosomes (REs). This increases Stx6/VAMP3 interaction and interferes with the recycling of αVβ3 and α5β1 integrins and cell migration, possibly in a Stx6-dependent manner. In NPC1 mutant cells, restoration of cholesterol levels in the TGN, but not inhibition of VAMP3, restores the steady-state localization of Stx6 in the TGN. Furthermore, elevation of RE cholesterol is associated with increased amounts of Stx6 in RE. Hence, the fine-tuning of cholesterol levels at the TGN-RE boundaries together with a subset of cholesterol-sensitive SNARE proteins may play a regulatory role in cell migration and invasion.

Effect of pupil dilation and constriction on the distribution of bit errors within the iris

Texture information in the iris image is not uniform in discriminatory information content for biometric identity verification. The bits in an iris code obtained from the image differ in their consistency from one sample to another for the same identity. In this work, errors in bit strings are systematically analysed in order to investigate the effect of light-induced and drug-induced pupil dilation and constriction on the consistency of iris texture information. The statistics of bit errors are computed for client and impostor distributions as functions of radius and angle. Under normal conditions, a V-shaped radial trend of decreasing bit errors towards the central region of the iris is obtained for client matching, and it is observed that the distribution of errors as a function of angle is uniform. When iris images are affected by pupil dilation or constriction the radial distribution of bit errors is altered. A decreasing trend from the pupil outwards is observed for constriction, whereas a more uniform trend is observed for dilation. The main increase in bit errors occurs closer to the pupil in both cases.

A pilot study on affective classification of facial images for emerging news topics

The proliferation of news reports published in online websites and news information sharing among social media users necessitates effective techniques for analysing the image, text and video data related to news topics. This paper presents the first study to classify affective facial images on emerging news topics. The proposed system dynamically monitors and selects the current hot (of great interest) news topics with strong affective interestingness using textual keywords in news articles and social media discussions. Images from the selected hot topics are extracted and classified into three categorized emotions, positive, neutral and negative, based on facial expressions of subjects in the images. Performance evaluations on two facial image datasets collected from real-world resources demonstrate the applicability and effectiveness of the proposed system in affective classification of facial images in news reports. Facial expression shows high consistency with the affective textual content in news reports for positive emotion, while only low correlation has been observed for neutral and negative. The system can be directly used for applications, such as assisting editors in choosing photos with a proper affective semantic for a certain topic during news report preparation.

A non-malleable group key exchange protocol robust against active insiders

In this paper we make progress towards solving an open problem posed by Katz and Yung at CRYPTO 2003. We propose the first protocol for key exchange among n ≥2k+1 parties which simultaneously achieves all of the following properties: 1. Key Privacy (including forward security) against active attacks by group outsiders, 2. Non-malleability — meaning in particular that no subset of up to k corrupted group insiders can ‘fix’ the agreed key to a desired value, and 3. Robustness against denial of service attacks by up to k corrupted group insiders. Our insider security properties above are achieved assuming the availability of a reliable broadcast channel.

Robust and reversible numerical set watermarking

Numeric sets can be used to store and distribute important information such as currency exchange rates and stock forecasts. It is useful to watermark such data for proving ownership in case of illegal distribution by someone. This paper analyzes the numerical set watermarking model presented by Sion et. al in “On watermarking numeric sets”, identifies it’s weaknesses, and proposes a novel scheme that overcomes these problems. One of the weaknesses of Sion’s watermarking scheme is the requirement to have a normally-distributed set, which is not true for many numeric sets such as forecast figures. Experiments indicate that the scheme is also susceptible to subset addition and secondary watermarking attacks. The watermarking model we propose can be used for numeric sets with arbitrary distribution. Theoretical analysis and experimental results show that the scheme is strongly resilient against sorting, subset selection, subset addition, distortion, and secondary watermarking attacks.

Shared generation of pseudo-random functions

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0⩽tsubset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where fsi(·)'s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali–Sidney scheme is a special case of this general construction. We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

Shared generation of pseudo-random functions with cumulative maps

In Crypto’95, Micali and Sidney proposed a method for shared generation of a pseudo-random function f(·) among n players in such a way that for all the inputs x, any u players can compute f(x) while t or fewer players fail to do so, where 0 ≤ t < u ≤ n. The idea behind the Micali-Sidney scheme is to generate and distribute secret seeds S = s1, . . . , sd of a poly-random collection of functions, among the n players, each player gets a subset of S, in such a way that any u players together hold all the secret seeds in S while any t or fewer players will lack at least one element from S. The pseudo-random function is then computed as where f s i (·)’s are poly-random functions. One question raised by Micali and Sidney is how to distribute the secret seeds satisfying the above condition such that the number of seeds, d, is as small as possible. In this paper, we continue the work of Micali and Sidney. We first provide a general framework for shared generation of pseudo-random function using cumulative maps. We demonstrate that the Micali-Sidney scheme is a special case of this general construction.We then derive an upper and a lower bound for d. Finally we give a simple, yet efficient, approximation greedy algorithm for generating the secret seeds S in which d is close to the optimum by a factor of at most u ln 2.

Detection of sinkhole attack in wireless sensor networks

Generally wireless sensor networks rely of many-to-one communication approach for data gathering. This approach is extremely susceptible to sinkhole attack, where an intruder attracts surrounding nodes with unfaithful routing information, and subsequently presents selective forwarding or change the data that carry through it. A sinkhole attack causes an important threat to sensor networks and it should be considered that the sensor nodes are mostly spread out in open areas and of weak computation and battery power. In order to detect the intruder in a sinkhole attack this paper suggests an algorithm which firstly finds a group of suspected nodes by analyzing the consistency of data. Then, the intruder is recognized efficiently in the group by checking the network flow information. The proposed algorithm's performance has been evaluated by using numerical analysis and simulations. Therefore, accuracy and efficiency of algorithm would be verified.

Robust multiple-sensing-modality data fusion using Gaussian Process Implicit Surfaces

The ability to build high-fidelity 3D representations of the environment from sensor data is critical for autonomous robots. Multi-sensor data fusion allows for more complete and accurate representations. Furthermore, using distinct sensing modalities (i.e. sensors using a different physical process and/or operating at different electromagnetic frequencies) usually leads to more reliable perception, especially in challenging environments, as modalities may complement each other. However, they may react differently to certain materials or environmental conditions, leading to catastrophic fusion. In this paper, we propose a new method to reliably fuse data from multiple sensing modalities, including in situations where they detect different targets. We first compute distinct continuous surface representations for each sensing modality, with uncertainty, using Gaussian Process Implicit Surfaces (GPIS). Second, we perform a local consistency test between these representations, to separate consistent data (i.e. data corresponding to the detection of the same target by the sensors) from inconsistent data. The consistent data can then be fused together, using another GPIS process, and the rest of the data can be combined as appropriate. The approach is first validated using synthetic data. We then demonstrate its benefit using a mobile robot, equipped with a laser scanner and a radar, which operates in an outdoor environment in the presence of large clouds of airborne dust and smoke.

Legislative impact on the mortgagee’s exercise of power of sale : the need for rationalisation

Throughout Australia, regulation of the power of sale is highly inconsistent. In response to the uncertain nature of the mortgagee’s duty at common law, many legislatures have intervened. As a result, there has been a proliferation of statutory formula conferring varying degrees of protection on mortgagors. The differences in approach indicate a lack of consensus as to the best method of regulation. This article exposes the extent of the inconsistency and provides a comparative assessment of the various provisions with reference to the policy concerns that underpin legislative intervention. The article identifies a number of deficiencies associated with existing provisions and concludes that mortgagees and mortgagors alike would benefit from improved clarity and consistency. To that end, the article proposes a model provision that seeks to address the deficiencies identified.

Influence and increased funding in Canadian public libraries : the case of Alberta in fiscal year 2009–10

This exploratory case study examined the role of social influence in the decision-making process to increase public library funding in the Canadian province of Alberta in the 2009–10 fiscal year. Using Robert Cialdini’s theory of factors of influence (i.e., commitment and consistency, authority, liking, social proof, scarcity, and reciprocity) as a framework for analysis, findings show that consistency and commitment and authority were relevant and that liking was also important. These findings are consistent with Cialdini’s theory, which suggests that the quality of relationships is one factor that can most strongly influence a decision maker. This study gives insight into the factors motivating those involved in public library funding allocation decisions. No prior studies have examined the construct of influence in decision making about funding for public libraries at any level of government.