21,691 research outputs found
Diaspora tourism and well-being: a eudaimonic view
This study explored the links between diaspora tourism and SWB (subjective well-being) through the lens of eudaimonia and identified six themes through which this highly nuanced travel behaviour strengthens tourists’ SWB. Within the diaspora tourism context, the linkages between SWB and tourism can be rich and insightful considering important themes of personal growth, self/ancestral acceptance, interested in further exploration, feel related and connected, capability to return, and meaning in life. This research note recommends further in-depth studies on SWB and tourism by combining both hedonic and eudaimonic views
Oblivious RAM with O((log N)3) worst-case cost
LNCS v. 7073 entitled: Advances in Cryptology – ASIACRYPT 2011Oblivious RAM is a useful primitive that allows a client to hide its data access patterns from an untrusted server in storage outsourcing applications. Until recently, most prior works on Oblivious RAM aim to optimize its amortized cost, while suffering from linear or even higher worst-case cost. Such poor worst-case behavior renders these schemes impractical in realistic settings, since a data access request can occasionally be blocked waiting for an unreasonably large number of operations to complete.
This paper proposes novel Oblivious RAM constructions that achieves poly-logarithmic worst-case cost, while consuming constant client-side storage. To achieve the desired worst-case asymptotic performance, we propose a novel technique in which we organize the O-RAM storage into a binary tree over data buckets, while moving data blocks obliviously along tree edges.postprin
Differential isospin-fractionation in dilute asymmetric nuclear matter
The differential isospin-fractionation (IsoF) during the liquid-gas phase
transition in dilute asymmetric nuclear matter is studied as a function of
nucleon momentum. Within a self-consistent thermal model it is shown that the
neutron/proton ratio of the gas phase becomes {\it smaller} than that of the
liquid phase for energetic nucleons, although the gas phase is overall more
neutron-rich. Clear indications of the differential IsoF consistent with the
thermal model predictions are demonstrated within a transport model for
heavy-ion reactions. Future comparisons with experimental data will allow us to
extract critical information about the momentum dependence of the isovector
strong interaction.Comment: Rapid Communication, Phys. Rev. C (2007) in pres
Finding diamonds in the rough: Targeted Sub-threshold Search for Strongly-lensed Gravitational-wave Events
Strong gravitational lensing of gravitational waves can produce duplicate
signals separated in time with different amplitudes. We consider the case in
which strong lensing produces identifiable gravitational-wave events and weaker
sub-threshold signals hidden in the noise background. We present a search
method for the sub-threshold signals using reduced template banks targeting
specific confirmed gravitational-wave events. We apply the method to all events
from Advanced LIGO's first and second observing run O1/O2. Using GW150914 as an
example, we show that the method effectively reduces the noise background and
raises the significance of (near-) sub-threshold triggers. In the case of
GW150914, we can improve the sensitive distance by . Finally,
we present the top possible lensed candidates for O1/O2 gravitational-wave
events that passed our nominal significance threshold of False-Alarm-Rate days
Throughput Maximization in Multiprocessor Speed-Scaling
We are given a set of jobs that have to be executed on a set of
speed-scalable machines that can vary their speeds dynamically using the energy
model introduced in [Yao et al., FOCS'95]. Every job is characterized by
its release date , its deadline , its processing volume if
is executed on machine and its weight . We are also given a budget
of energy and our objective is to maximize the weighted throughput, i.e.
the total weight of jobs that are completed between their respective release
dates and deadlines. We propose a polynomial-time approximation algorithm where
the preemption of the jobs is allowed but not their migration. Our algorithm
uses a primal-dual approach on a linearized version of a convex program with
linear constraints. Furthermore, we present two optimal algorithms for the
non-preemptive case where the number of machines is bounded by a fixed
constant. More specifically, we consider: {\em (a)} the case of identical
processing volumes, i.e. for every and , for which we
present a polynomial-time algorithm for the unweighted version, which becomes a
pseudopolynomial-time algorithm for the weighted throughput version, and {\em
(b)} the case of agreeable instances, i.e. for which if and only
if , for which we present a pseudopolynomial-time algorithm. Both
algorithms are based on a discretization of the problem and the use of dynamic
programming
Digital Affordances and Digital Capabilities: Evidence from Six AI Startups
Many digital startups fail in their pursuit of niche business value for three reasons: underdeveloped digital affordances, inadequate digital capabilities, and perhaps most importantly, a misalignment between digital affordances and digital capabilities. Digital affordances depict the potential involvement of digital technologies by groups in value creation while digital capabilities represent the ability to leverage and make changes to digital resources to fulfil specific objectives (e.g., affordance actualization). Based on insights derived from a longitudinal in-depth case study of six AI startups, we propose a co-evolution framework that illustrates several iterative loops between digital capabilities and digital affordances. Our analysis also reveals key properties of digital affordances and digital capabilities. Specifically, we find that digital startups with mutually reinforcing digital affordances and digital capabilities are most likely to succeed. We also develop a typology of digital startups using a 2 by 2 affordance-capability matrix
Geometrically Reduced Number of Protein Ground State Candidates
Geometrical properties of protein ground states are studied using an
algebraic approach. It is shown that independent from inter-monomer
interactions, the collection of ground state candidates for any folded protein
is unexpectedly small: For the case of a two-parameter Hydrophobic-Polar
lattice model for -mers, the number of these candidates grows only as .
Moreover, the space of the interaction parameters of the model breaks up into
well-defined domains, each corresponding to one ground state candidate, which
are separated by sharp boundaries. In addition, by exact enumeration, we show
there are some sequences which have one absolute unique native state. These
absolute ground states have perfect stability against change of inter-monomer
interaction potential.Comment: 9 page, 4 ps figures are include
Energetic Components of Cooperative Protein Folding
A new lattice protein model with a four-helix bundle ground state is analyzed
by a parameter-space Monte Carlo histogram technique to evaluate the effects of
an extensive variety of model potentials on folding thermodynamics. Cooperative
helical formation and contact energies based on a 5-letter alphabet are found
to be insufficient to satisfy calorimetric and other experimental criteria for
two-state folding. Such proteinlike behaviors are predicted, however, by models
with polypeptide-like local conformational restrictions and
environment-dependent hydrogen bonding-like interactions.Comment: 11 pages, 4 postscripts figures, Phys. Rev. Lett. (in press
- …