An Epitome of Multi Secret Sharing Schemes for General Access Structure

Secret sharing schemes are widely used now a days in various applications, which need more security, trust and reliability. In secret sharing scheme, the secret is divided among the participants and only authorized set of participants can recover the secret by combining their shares. The authorized set of participants are called access structure of the scheme. In Multi-Secret Sharing Scheme (MSSS), k different secrets are distributed among the participants, each one according to an access structure. Multi-secret sharing schemes have been studied extensively by the cryptographic community. Number of schemes are proposed for the threshold multi-secret sharing and multi-secret sharing according to generalized access structure with various features. In this survey we explore the important constructions of multi-secret sharing for the generalized access structure with their merits and demerits. The features like whether shares can be reused, participants can be enrolled or dis-enrolled efficiently, whether shares have to modified in the renewal phase etc., are considered for the evaluation

On The Center Sets and Center Numbers of Some Graph Classes

For a set $S$ of vertices and the vertex $v$ in a connected graph $G$, $\displaystyle\max_{x \in S}d(x,v)$ is called the $S$-eccentricity of $v$ in $G$. The set of vertices with minimum $S$-eccentricity is called the $S$-center of $G$. Any set $A$ of vertices of $G$ such that $A$ is an $S$-center for some set $S$ of vertices of $G$ is called a center set. We identify the center sets of certain classes of graphs namely, Block graphs, $K_{m,n}$, $K_n-e$, wheel graphs, odd cycles and symmetric even graphs and enumerate them for many of these graph classes. We also introduce the concept of center number which is defined as the number of distinct center sets of a graph and determine the center number of some graph classes

Constraints on the Physical Parameters of TeV Blazars

We consider the constraints on the physical parameters of a homogeneous SSC model that can be derived from the spectral shape and variability of TeV blazars. Assuming that the relativistic electron spectrum is a broken power law, where the break energy $\gamma_b$ is a free parameter, we write the analytical formulae that allow to connect the physical parameters of the model to observable quantities. The constraints can be summarized in a plane where the coordinates are the Doppler factor and the magnetic field. The consistency between the break energy and the balance between cooling and escape and the interpretation of the soft photon lags measured in some sources as radiative cooling times are treated as additional independent constraints. We apply themethod to the case of three well known blazars, PKS 2155-304, Mrk 421 and Mrk 501.Comment: 36 pages, incl. 6 figures in PS format, AAS LaTeX, to be published in ApJ, Dec 199

A multi-strategy approach for location mining in tweets: AUT NLP Group entry for ALTA-2014 shared task

This paper describes the strategy and the results of a location mining system used for the ALTA-2014 shared task competition. The task required the participants to identify the location mentions in 1003 Twitter test messages given a separate annotated training set of 2000 messages. We present an architecture that uses a basic named entity recognizer in conjunction with various rule-based modules and knowledge infusion to achieve an average F score of 0.747 which won the second place in the competition. We used the pre-trained Stanford NER which gives us an F score of 0.532 and used an ensemble of other techniques to reach the 0.747 value. The other major source of location resolver was the DBpedia location list which was used to identify a large percentage of locations with an individual F-score of 0.935