1,768 research outputs found

    OT 060420: A Seemingly Optical Transient Recorded by All-Sky Cameras

    Get PDF
    We report on a ~5th magnitude flash detected for approximately 10 minutes by two CONCAM all-sky cameras located in Cerro Pachon - Chile and La Palma - Spain. A third all-sky camera, located in Cerro Paranal - Chile did not detect the flash, and therefore the authors of this paper suggest that the flash was a series of cosmic-ray hits, meteors, or satellite glints. Another proposed hypothesis is that the flash was an astronomical transient with variable luminosity. In this paper we discuss bright optical transient detection using fish-eye all-sky monitors, analyze the apparently false-positive optical transient, and propose possible causes to false optical transient detection in all-sky cameras.Comment: 7 figures, 3 tables, accepted PAS

    Fourier-based Function Secret Sharing with General Access Structure

    Full text link
    Function secret sharing (FSS) scheme is a mechanism that calculates a function f(x) for x in {0,1}^n which is shared among p parties, by using distributed functions f_i:{0,1}^n -> G, where G is an Abelian group, while the function f:{0,1}^n -> G is kept secret to the parties. Ohsawa et al. in 2017 observed that any function f can be described as a linear combination of the basis functions by regarding the function space as a vector space of dimension 2^n and gave new FSS schemes based on the Fourier basis. All existing FSS schemes are of (p,p)-threshold type. That is, to compute f(x), we have to collect f_i(x) for all the distributed functions. In this paper, as in the secret sharing schemes, we consider FSS schemes with any general access structure. To do this, we observe that Fourier-based FSS schemes by Ohsawa et al. are compatible with linear secret sharing scheme. By incorporating the techniques of linear secret sharing with any general access structure into the Fourier-based FSS schemes, we show Fourier-based FSS schemes with any general access structure.Comment: 12 page

    Toward 'socially constructive' social constructions of leadership

    Get PDF
    In their introductory editorial essay for this special issue, David Grant and Gail Fairhurst have done us a great service by valiantly producing a "Sailing Guide" to the Social Construction of Leadership (Fairhurst & Grant, 2010). As with rounding the Capes, this is not a task for the faint of heart. A sailing guide is designed to provide vital knowledge about a particular sea or coast, providing us with charts, warnings about potential hazards and an indication where we might find safe havens in a storm. Their sailing guide does this to great effect as it skilfully "boxes the compass" by revealing all of the potential directions that one might set one‟s sail by if one was sufficiently foolhardy to embark on a cruise of the social construction of leadership

    One loop renormalization for the axial Ward-Takahashi identity in Domain-wall QCD

    Get PDF
    We calculate one-loop correction to the axial Ward-Takahashi identity given by Furman and Shamir in domain-wall QCD. It is shown perturbatively that the renormalized axial Ward-Takahashi identity is satisfied without fine tuning and the ``conserved'' axial current receives no renormalization, giving ZA=1Z_A=1. This fact will simplify the calculation of the pion decay constant in numerical simulations since the decay constant defined by this current needs no lattice renormalization factor.Comment: 16 pages, 3 axodraw.sty figure

    Edge-weighting of gene expression graphs

    Get PDF
    In recent years, considerable research efforts have been directed to micro-array technologies and their role in providing simultaneous information on expression profiles for thousands of genes. These data, when subjected to clustering and classification procedures, can assist in identifying patterns and providing insight on biological processes. To understand the properties of complex gene expression datasets, graphical representations can be used. Intuitively, the data can be represented in terms of a bipartite graph, with weighted edges corresponding to gene-sample node couples in the dataset. Biologically meaningful subgraphs can be sought, but performance can be influenced both by the search algorithm, and, by the graph-weighting scheme and both merit rigorous investigation. In this paper, we focus on edge-weighting schemes for bipartite graphical representation of gene expression. Two novel methods are presented: the first is based on empirical evidence; the second on a geometric distribution. The schemes are compared for several real datasets, assessing efficiency of performance based on four essential properties: robustness to noise and missing values, discrimination, parameter influence on scheme efficiency and reusability. Recommendations and limitations are briefly discussed
    corecore