Results 11  20
of
1,229
Convection phenomena in loosefill attics
 Proceedings of the 7 th Symposium Building Physics in the Nordic Countries, Reykjavík: Icelandic Building Research Institute and KTH  Building Technology
, 2005
"... Convection phenomenon inside the insulation materials that are representing porous media may be responsible for important increase of the heat flow density through the building element, when the climatic conditions are very cold. A numerical study based on CFD software simulations is performed in or ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
in order to find out the conditions for which the convection onsets and furthermore to quantify its influence on the Uvalue of the building element – that is a loosefill attic. The geometry of the grid is very close to a 2D cut in a real attic. The most significant heat transfer phenomena present
Constraint tightness and looseness versus local and global consistency
 Journal of the ACM
, 1997
"... Constraint networks are a simple representation and reasoning framework with diverse applications. In this paper, weidentify two new complementary properties on the restrictiveness of the constraints in a network constraint tightness and constraint loosenessand we show their usefulness for estimat ..."
Abstract

Cited by 25 (1 self)
 Add to MetaCart
in a backtrackfree manner. The condition can be useful in applications where a knowledge base will be queried over and over and the preprocessing costs can be amortized over many queries. We also present a su cient condition for local consistency, based on constraint looseness, that is straightforward
LEARNING LOOSELY CONNECTED MARKOV RANDOM
"... We consider the structure learning problem for graphical models that we call loosely connected Markov random fields, in which the number of short paths between any pair of nodes is small, and present a new conditional independence test based algorithm for learning the underlying graph structure. Th ..."
Abstract
 Add to MetaCart
We consider the structure learning problem for graphical models that we call loosely connected Markov random fields, in which the number of short paths between any pair of nodes is small, and present a new conditional independence test based algorithm for learning the underlying graph structure
TUNNELING IN LOOSELY CEMENTED SAND LAYER /
"... The essential factor to successful conduct tunneling in loosely cemented sand layer / stiff clay is to sustain the inherent strength of the surrounding rock after excavation. To achieve this goal, an effective support system must be installed timely so as to confine the convergence of the tunnel as ..."
Abstract
 Add to MetaCart
The essential factor to successful conduct tunneling in loosely cemented sand layer / stiff clay is to sustain the inherent strength of the surrounding rock after excavation. To achieve this goal, an effective support system must be installed timely so as to confine the convergence of the tunnel
Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs
 ELECTRON. J. COMBIN
, 2012
"... In the random kuniform hypergraph H (k) n,p of order n, each possible ktuple appears independently with probability p. A loose Hamilton cycle is a cycle of order n in which every pair of consecutive edges intersects in a single vertex. It was shown by Frieze that if p> c(log n)/n2 for some abso ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
In the random kuniform hypergraph H (k) n,p of order n, each possible ktuple appears independently with probability p. A loose Hamilton cycle is a cycle of order n in which every pair of consecutive edges intersects in a single vertex. It was shown by Frieze that if p> c(log n)/n2 for some
MINIMUM VERTEX DEGREE CONDITIONS FOR LOOSE HAMILTON CYCLES IN 3UNIFORM HYPERGRAPHS
"... We investigate minimum vertex degree conditions for 3uniform hypergraphs which ensure the existence of loose Hamilton cycles. A loose Hamilton cycle is a spanning cycle in which consecutive edges intersect in a single vertex. We prove that every 3uniform nvertex (n even) hypergraph H with minim ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We investigate minimum vertex degree conditions for 3uniform hypergraphs which ensure the existence of loose Hamilton cycles. A loose Hamilton cycle is a spanning cycle in which consecutive edges intersect in a single vertex. We prove that every 3uniform nvertex (n even) hypergraph H
Loose tweets: an analysis of privacy leaks on twitter
 in Proceedings of the 10th annual ACM workshop on Privacy in the electronic society, ser. WPES ’11
, 2011
"... Twitter has become one of the most popular microblogging sites for people to broadcast (or “tweet”) their thoughts to the world in 140 characters or less. Since these messages are available for public consumption, one may expect these tweets not to contain private or incriminating information. Never ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
plans, tweeting under the influence of alcohol, and revealing medical conditions. Second, using this characterization we build automatic classifiers to detect incriminating tweets for these three topics in real time in order to demonstrate the real threat posed to users by, e.g., burglars and law
UNDRAINED INSTABILITY OF LOOSE SAND UNDER PLANESTRAIN CONDITIONS AND ITS ENGINEERING
, 2007
"... When a loose sand specimen is loaded under an undrained condition, it may become unstable leading to a static liquefaction beahviour. Static liquefaction or instability of loose sand under undrained conditions is one of the most frequent causes of flow failures in granular soil slopes. However, th ..."
Abstract
 Add to MetaCart
When a loose sand specimen is loaded under an undrained condition, it may become unstable leading to a static liquefaction beahviour. Static liquefaction or instability of loose sand under undrained conditions is one of the most frequent causes of flow failures in granular soil slopes. However
Loose Synchronization for LargeScale Networked Systems
 Proceedings of the USENIX Annual Technical Conference (USENIX
, 2006
"... Traditionally, synchronization barriers ensure that no cooperating process advances beyond a specified point until all processes have reached that point. In heterogeneous largescale distributed computing environments, with unreliable network links and machines that may become overloaded and unrespo ..."
Abstract

Cited by 18 (8 self)
 Add to MetaCart
and unresponsive, traditional barrier semantics are too strict to be effective for a range of emerging applications. In this paper, we explore several relaxations, and introduce a partial barrier, a synchronization primitive designed to enhance liveness in loosely coupled networked systems. Partial barriers
Results 11  20
of
1,229