Visual secret sharing by using generalized random grids is a novel approach for generating nonexpansible shares by artfully utilizing various random variables. Stacking the shares together, secret image can be revealed. This paper proposes a 2 out of 3 visual multiple secret sharing method using generalized random grids. Three secret images (A, B, C) are used for generating three non-expansible...

In bagging Bre94a] one uses bootstrap replicates of the training set Efr79, ET93] to improve a learning algorithm's performance, often by tens of percent. This paper presents several ways that stacking Wol92b, Bre92] can be used in concert with the bootstrap procedure to achieve a further improvement on the performance of bagging for some regression problems. In particular, in some of the work ...

Carbohydrate-aromatic interactions are highly relevant for many biological processes. Nevertheless, experimental data in aqueous solution relating structure and energetics for sugar-arene stacking interactions are very scarce. Here, we evaluate how structural variations in a monosaccharide including carboxyl, N-acetyl, fluorine, and methyl groups affect stacking interactions with aromatic DNA b...

the use of appropriate level of theories for studying weak interactions such as 8-8 stackinginteractions of aromatic molecules has been an important aspect, since the high level methods havelimitations for application to large molecules. the differences in the stacking energies of variousaromatic molecular structures are found significant. it is also very important for identifying the mostfavor...

High level ab initio methods have been used to study stacking interactions in ten unique base pair steps both in A-RNA and in B-DNA duplexes. The protocol for selection of geometries based on molecular dynamics (MD) simulations is proposed, and its suitability is demonstrated by comparison with stacking in steps at fiber diffraction geometries. It is shown that fiber diffraction geometries are ...

The stacking interaction of nucleic acid bases is studied by molecular dynamic simulation in the ApA, ApC, CpA and CpC ribodinucleoside monophosphates. The rate of stacking was analyzed during the molecular dynamic simulation using three geometry parameters – the distance between the nitrogen atoms of nucleic acid bases linked to sugar with the glysosidic bond and by two angles that depend on m...

Engagement in work through information and communication technology from places other than a corporate office, often referred to as telework, is simultaneously transforming work and life. In order to support successful adoption of telework by organizations it is important to move away from research stacking up evidence for or against telework. Instead what is required is a more nuanced examinat...

We describe a new sequential learning scheme called “stacked sequential learning”. Stacked sequential learning is a meta-learning algorithm, in which an arbitrary base learner is augmented so as make it aware of the labels of nearby examples. We evaluate the method on several “sequential partitioning problems”, which are characterized by long runs of identical labels. We demonstrate that on the...

Given a collection of n opaque unit disks in the plane, we want to find a stacking order for them that maximizes their visible perimeter, the total length of all pieces of their boundaries visible from above. We prove that if the centers of the disks form a dense point set, i.e., the ratio of their maximum to their minimum distance is O(n), then there is a stacking order for which the visible p...

T-BOX is a new way of visualizing the temporal relations in TimeML graphs. Currently, TimeML’s temporal relations are usually presented as rows in a table or as directed labeled edges in a graph. I will argue that neither mode of representation scales up nicely when bigger documents are considered and that both make it harder than necessary to get a quick picture of what the temporal structure ...