A new model for the structure of the DACs and SACs regions in the Oe and Be stellar atmospheres

In this paper we present a new mathematical model for the density regions where a specific spectral line and its SACs/DACs are created in the Oe and Be stellar atmospheres. In the calculations of final spectral line function we consider that the main reasons of the line broadening are the rotation of the density regions creating the spectral line and its DACs/SACs, as well as the random motions of the ions. This line function is able to reproduce the spectral feature and it enables us to calculate some important physical parameters, such as the rotational, the radial and the random velocities, the Full Width at Half Maximum, the Gaussian deviation, the optical depth, the column density and the absorbed or emitted energy. Additionally, we can calculate the percentage of the contribution of the rotational velocity and the ions' random motions of the DACs/SACs regions to the line broadening. Finally, we present two tests and three short applications of the proposed model.Comment: 9 pages, 5 figures, accepted for publication in PAS

TARANET: Traffic-Analysis Resistant Anonymity at the NETwork layer

Modern low-latency anonymity systems, no matter whether constructed as an overlay or implemented at the network layer, offer limited security guarantees against traffic analysis. On the other hand, high-latency anonymity systems offer strong security guarantees at the cost of computational overhead and long delays, which are excessive for interactive applications. We propose TARANET, an anonymity system that implements protection against traffic analysis at the network layer, and limits the incurred latency and overhead. In TARANET's setup phase, traffic analysis is thwarted by mixing. In the data transmission phase, end hosts and ASes coordinate to shape traffic into constant-rate transmission using packet splitting. Our prototype implementation shows that TARANET can forward anonymous traffic at over 50~Gbps using commodity hardware

Detecting malware with information complexity

Malware concealment is the predominant strategy for malware propagation. Black hats create variants of malware based on polymorphism and metamorphism. Malware variants, by definition, share some information. Although the concealment strategy alters this information, there are still patterns on the software. Given a zoo of labelled malware and benign-ware, we ask whether a suspect program is more similar to our malware or to our benign-ware. Normalized Compression Distance (NCD) is a generic metric that measures the shared information content of two strings. This measure opens a new front in the malware arms race, one where the countermeasures promise to be more costly for malware writers, who must now obfuscate patterns as strings qua strings, without reference to execution, in their variants. Our approach classifies disk-resident malware with 97.4% accuracy and a false positive rate of 3%. We demonstrate that its accuracy can be improved by combining NCD with the compressibility rates of executables using decision forests, paving the way for future improvements. We demonstrate that malware reported within a narrow time frame of a few days is more homogeneous than malware reported over two years, but that our method still classifies the latter with 95.2% accuracy and a 5% false positive rate. Due to its use of compression, the time and computation cost of our method is nontrivial. We show that simple approximation techniques can improve its running time by up to 63%. We compare our results to the results of applying the 59 anti-malware programs used on the VirusTotal website to our malware. Our approach outperforms each one used alone and matches that of all of them used collectively

The complex structure of the Mg II {\lambda\lambda} 2795.523, 2802.698 {\AA} regions of 64 Be stars

Here is studied the presence of absorption components shifted to the violet or the red side of the main spectral line (satellite, or discrete absorption components, i.e. SACs or DACs), in Mg II resonance lines' regions in Be stars and their kinematical characteristics. Namely our objective is to check if exists a common physical structure for the atmospheric regions creating SACs or DACs of the Mg II resonance lines. In order to do this, a statistical study of the Mg II {\lambda \lambda} 2792.523, 2802.698 {\AA} lines in the spectra of 64 Be stars of all spectral subtypes and luminosity classes is performed. We found that the absorption atmospherical regions where the Mg II resonance lines originated may be formed of several independent density layers of matter which rotate with different velocities. It is attempted also to separate SACs and DACs according to low or high radial velocity. The emission lines were detected only in the earliest and latest spectral subtypes.Comment: 18 pages, 12 figures, accepted for publication in PAS

Selenium-dependent antioxidant enzymes: Actions and properties of selenoproteins

Unlike other essential trace elements that interact with proteins in the form of cofactors, selenium (Se) becomes co-translationally incorporated into the polypeptide chain as part of 21st naturally occurring amino acid, selenocysteine (Sec), encoded by the UGA codon. Any protein that includes Sec in its polypeptide chain is defined as selenoprotein. Members of the selenoproteins family exert various functions and their synthesis depends on specific cofactors and on dietary Se. The Se intake in productive animals such as chickens affect nutrient utilization, production performances, antioxidative status and responses of the immune system. Although several functions of selenoproteins are unknown, many disorders are related to alterations in selenoprotein expression or activity. Selenium insufficiency and polymorphisms or mutations in selenoproteins’ genes and synthesis cofactors are involved in the pathophysiology of many diseases, including cardiovascular disorders, immune dysfunctions, cancer, muscle and bone disorders, endocrine functions and neurological disorders. Finally, heavy metal poisoning decreases mRNA levels of selenoproteins and increases mRNA levels of inflammatory factors, underlying the antagonistic effect of Se. This review is an update on Se dependent antioxidant enzymes, presenting the current state of the art and is focusing on results obtained mainly in chicken

Reconciling Utility with Privacy in Genomics

Direct-to-consumer genetic testing makes it possible for everyone to learn their genome sequences. In order to contribute to medical research, a growing number of people publish their genomic data on the Web, sometimes under their real identities. However, this is at odds not only with their own privacy but also with the privacy of their relatives. The genomes of relatives being highly correlated, some family members might be opposed to revealing any of the family's genomic data. In this paper, we study the trade-off between utility and privacy in genomics. We focus on the most relevant kind of variants, namely single nucleotide polymorphisms (SNPs). We take into account the fact that the SNPs of an individual contain information about the SNPs of his family members and that SNPs are correlated with each other. Furthermore, we assume that SNPs can have different utilities in medical research and different levels of sensitivity for individuals. We propose an obfuscation mechanism that enables the genomic data to be publicly available for research, while protecting the genomic privacy of the individuals in a family. Our genomic-privacy preserving mechanism relies upon combinatorial optimization and graphical models to optimize utility and meet privacy requirements. We also present an extension of the optimization algorithm to cope with the non-linear constraints induced by the correlations between SNPs. Our results on real data show that our proposed technique maximizes the utility for genomic research and satisfies family members' privacy constraints

Ultraviolet Spectrophotometry of Variable Early-Type Be and B stars Derived from High-Resolution IUE Data

High-dispersion IUE data encode significant information about aggregate line absorptions that cannot be conveniently extracted from individual spectra. We apply a new technique in which fluxes from each echelle order of a short wavelength IUE spectrum are binned together to construct low-resolution spectra of a rapidly varying B or Be star. The ratio of binned spectra obtained bright- star and faint-star phases contains information about the mechanism responsible for a star's variability, such as from pulsations or occultations of the star by ejected matter. We model the variations caused by these mechanism by means of model atmosphere and absorbing-slab codes. Line absorptions strength changes are sensitive to conditions in circumstellar clouds with T = 8,000--13,000K. To demonstrate proofs of concept, we construct spectral ratios for circumstellar structures associated with flux variability in various Be stars: (1) Vela X1 has bow-shock wind trailing its neutron star companion and shows signatures of gas at 13,000K or 26,000K medium in different sectors, (2) 88 Her undergoes episodic outbursts as its UV flux fades, followed a year later by a dimming in visible wavelengths, a result of a gray opacity that dominates as the shell expands and cools, and (3) zeta Tau and 60 Cyg exhibit periodic spectrum and flux changes, which match model absorptions for occulting clouds. Also, ratioed UV spectra of strongly pulsating stars show unique spectrophotometric signatures which can be simulated with models. An analysis of ratioed spectra obtained for a typical sample of 18 classical Be stars known to have rapid periodic flux variations indicates that 13 of them have ratioed spectra which are relatively featureless or have signatures of pulsation. Ratioed spectra of 3 others in the sample are consistent with the presence of co-rotating clouds.Comment: Latex 49 dbl-spaced pages plus 9 figures. Accepted by ApJ. Files available at ftp://nobel.stsci.edu/pub/uv

UC Updatable Databases and Applications

We define an ideal functionality \Functionality_{\UD} and a construction \mathrm{\Pi_{\UD}} for an updatable database (\UD). \UD is a two-party protocol between an updater and a reader. The updater sets the database and updates it at any time throughout the protocol execution. The reader computes zero-knowledge (ZK) proofs of knowledge of database entries. These proofs prove that a value is stored at a certain position in the database, without revealing the position or the value. (Non-)updatable databases are implicitly used as building block in priced oblivious transfer, privacy-preserving billing and other privacy-preserving protocols. Typically, in those protocols the updater signs each database entry, and the reader proves knowledge of a signature on a database entry. Updating the database requires a revocation mechanism to revoke signatures on outdated database entries. Our construction \mathrm{\Pi_{\UD}} uses a non-hiding vector commitment (NHVC) scheme. The updater maps the database to a vector and commits to the database. This commitment can be updated efficiently at any time without needing a revocation mechanism. ZK proofs for reading a database entry have communication and amortized computation cost independent of the database size. Therefore, \mathrm{\Pi_{\UD}} is suitable for large databases. We implement \mathrm{\Pi_{\UD}} and our timings show that it is practical. In existing privacy-preserving protocols, a ZK proof of a database entry is intertwined with other tasks, e.g., proving further statements about the value read from the database or the position where it is stored. \Functionality_{\UD} allows us to improve modularity in protocol design by separating those tasks. We show how to use \Functionality_{\UD} as building block of a hybrid protocol along with other functionalities

Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs

We construct a pairing based simulation-extractable SNARK (SE-SNARK) that consists of only 3 group elements and has highly efficient verification. By formally linking SE-SNARKs to signatures of knowledge, we then obtain a succinct signature of knowledge consisting of only 3 group elements. SE-SNARKs enable a prover to give a proof that they know a witness to an instance in a manner which is: (1) succinct - proofs are short and verifier computation is small; (2) zero-knowledge - proofs do not reveal the witness; (3) simulation-extractable - it is only possible to prove instances to which you know a witness, even when you have already seen a number of simulated proofs. We also prove that any pairing based signature of knowledge or SE-NIZK argument must have at least 3 group elements and 2 verification equations. Since our constructions match these lower bounds, we have the smallest size signature of knowledge and the smallest size SE-SNARK possible