@inbook{2924, author = {Criminisi, Antonio and Cross, Geoffrey and Blake, Andrew and Vladimir Kolmogorov}, booktitle = {Markov Random Fields for Vision and Image Processing}, editor = {Blake, Andrew and Kohli, Pushmeet and Rother, Carsten}, publisher = {Massachusetts Institute of Technology Press}, title = {{Bilayer Segmentation of Video}}, year = {2011}, } @inbook{2925, author = {Rother, Carsten and Vladimir Kolmogorov and Boykov, Yuri and Blake, Andrew}, booktitle = {Markov Random Fields for Vision and Image Processing}, editor = {Blake, Andrew and Kohli, Pushmeet and Rother, Carsten}, publisher = {Massachusetts Institute of Technology Press}, title = {{Interactive Foreground Extraction using graph cut}}, year = {2011}, } @inbook{2935, author = {Boykov, Yuri and Vladimir Kolmogorov}, booktitle = {Markov Random Fields for Vision and Image Processing}, editor = {Blake, Andrew and Kohli, Pushmeet and Rother, Carsten}, pages = {31 -- 50}, publisher = {Massachusetts Institute of Technology Press}, title = {{Basic graph cut algorithms}}, year = {2011}, } @inproceedings{2960, abstract = {Traditional statistical methods for the confidentiality protection for statistical databases do not scale well to deal with GWAS (genome-wide association studies) databases and external information on them. The more recent concept of differential privacy, introduced by the cryptographic community, is an approach which provides a rigorous definition of privacy with meaningful privacy guarantees in the presence of arbitrary external information. Building on such notions, we propose new methods to release aggregate GWAS data without compromising an individual's privacy. We present methods for releasing differentially private minor allele frequencies, chi-square statistics and p-values. We compare these approaches on simulated data and on a GWAS study of canine hair length involving 685 dogs. We also propose a privacy-preserving method for finding genome-wide associations based on a differentially private approach to penalized logistic regression.}, author = {Fienberg, Stephen E and Slavkovic, Aleksandra and Caroline Uhler}, publisher = {IEEE}, title = {{Privacy Preserving GWAS Data Sharing}}, doi = {10.1109/ICDMW.2011.140}, year = {2011}, } @article{2961, abstract = {Rapid research progress in genotyping techniques have allowed large genome-wide association studies. Existing methods often focus on determining associations between single loci and a specic phenotype. However, a particular phenotype is usually the result of complex relationships between multiple loci and the environment. In this paper, we describe a two-stage method for detecting epistasis by combining the traditionally used single-locus search with a search for multiway interactions. Our method is based on an extended version of Fisher's exact test. To perform this test, a Markov chain is constructed on the space of multidimensional contingency tables using the elements of a Markov basis as moves. We test our method on simulated data and compare it to a two-stage logistic regression method and to a fully Bayesian method, showing that we are able to detect the interacting loci when other methods fail to do so. Finally, we apply our method to a genome-wide data set consisting of 685 dogs and identify epistasis associated with canine hair length for four pairs of single nucleotide polymorphisms (SNPs).}, author = {Malaspinas, Anna-Sapfo and Caroline Uhler}, journal = {Journal of Algebraic Statistics}, number = {1}, pages = {36 -- 53}, publisher = {Public Knowledge Project}, title = {{Detecting epistasis via Markov bases}}, doi = {http://dx.doi.org/10.18409/jas.v2i1.27}, volume = {2}, year = {2011}, } @inproceedings{2975, abstract = {Zero-knowledge proofs of knowledge (ZK-PoK) for discrete logarithms and related problems are indispensable for practical cryptographic protocols. Recently, Camenisch, Kiayias, and Yung provided a specification language (the CKY-language) for such protocols which allows for a modular design and protocol analysis: for every zero-knowledge proof specified in this language, protocol designers are ensured that there exists an efficient protocol which indeed proves the specified statement. However, the protocols resulting from their compilation techniques only satisfy the classical notion of ZK-PoK, which is not retained are when they used as building blocks for higher-level applications or composed with other protocols. This problem can be tackled by moving to the Universal Composability (UC) framework, which guarantees retention of security when composing protocols in arbitrary ways. While there exist generic transformations from $\Sigma$-protocols to UC-secure protocols, these transformation are often too inefficient for practice. In this paper we introduce a specification language akin to the CKY-language and a compiler such that the resulting protocols are UC-secure and efficient. To this end, we propose an extension of the UC-framework addressing the issue that UC-secure zero-knowledge proofs are by definition proofs of knowledge, and state a special composition theorem which allows one to use the weaker -- but more efficient and often sufficient -- notion of proofs of membership in the UC-framework. We believe that our contributions enable the design of practically efficient protocols that are UC-secure and thus themselves can be used as building blocks.}, author = {Camenisch, Jan and Stephan Krenn and Shoup, Victor}, editor = {Lee, Dong Hoon and Wang, Xiaoyun}, pages = {449 -- 467}, publisher = {Springer}, title = {{A Framework for Practical Universally Composable Zero-Knowledge Protocols}}, doi = {10.1007/978-3-642-25385-0}, volume = {7073}, year = {2011}, } @inproceedings{2976, abstract = {Side channel attacks on cryptographic systems exploit information gained from physical implementations rather than theoretical weaknesses of a scheme. In recent years, major achievements were made for the class of so called access-driven cache attacks. Such attacks exploit the leakage of the memory locations accessed by a victim process. In this paper we consider the AES block cipher and present an attack which is capable of recovering the full secret key in almost realtime for AES-128, requiring only a very limited number of observed encryptions. Unlike previous attacks, we do not require any information about the plaintext (such as its distribution, etc.). Moreover, for the first time, we also show how the plaintext can be recovered without having access to the ciphertext at all. It is the first working attack on AES implementations using compressed tables. There, no efficient techniques to identify the beginning of AES rounds is known, which is the fundamental assumption underlying previous attacks. We have a fully working implementation of our attack which is able to recover AES keys after observing as little as 100 encryptions. It works against the OpenSSL 0.9.8n implementation of AES on Linux systems. Our spy process does not require any special privileges beyond those of a standard Linux user. A contribution of probably independent interest is a denial of service attack on the task scheduler of current Linux systems (CFS), which allows one to observe (on average) every single memory access of a victim process.}, author = {Gullasch, David and Bangerter, Endre and Stephan Krenn}, pages = {490 -- 505}, publisher = {IEEE}, title = {{Cache Games - Bringing Access-Based Cache Attacks on AES to Practice}}, doi = {10.1109/SP.2011.22}, year = {2011}, } @inproceedings{2977, abstract = {Cryptographic two-party protocols are used ubiquitously in everyday life. While some of these protocols are easy to understand and implement (e.g., key exchange or transmission of encrypted data), many of them are much more complex (e.g., e-banking and e-voting applications, or anonymous authentication and credential systems). For a software engineer without appropriate cryptographic skills the implementation of such protocols is often difficult, time consuming and error-prone. For this reason, a number of compilers supporting programmers have been published in recent years. However, they are either designed for very specific cryptographic primitives (e.g., zero-knowledge proofs of knowledge), or they only offer a very low level of abstraction and thus again demand substantial mathematical and cryptographic skills from the programmer. Finally, some of the existing compilers do not produce executable code, but only metacode which has to be instantiated with mathematical libraries, encryption routines, etc. before it can actually be used. In this paper we present a cryptographically aware compiler which is equally useful to cryptographers who want to benchmark protocols designed on paper, and to programmers who want to implement complex security sensitive protocols without having to understand all subtleties. Our tool offers a high level of abstraction and outputs well-structured and documented Java code. We believe that our compiler can contribute to shortening the development cycles of cryptographic applications and to reducing their error-proneness.}, author = {Bangerter, Endre and Stephan Krenn and Seifriz, Martial and Ultes-Nitsche, Ulrich}, editor = {Venter, Hein S. and Coetzee, Marijke and Loock, Marianne}, publisher = {IEEE}, title = {{cPLC - A Cryptographic Programming Language and Compiler}}, doi = {10.1109/ISSA.2011.6027533}, year = {2011}, } @article{3082, abstract = {Shoot branching is one of the major determinants of plant architecture. Polar auxin transport in stems is necessary for the control of bud outgrowth by a dominant apex. Here, we show that following decapitation in pea (Pisum sativum L.), the axillary buds establish directional auxin export by subcellular polarization of PIN auxin transporters. Apical auxin application on the decapitated stem prevents this PIN polarization and canalization of laterally applied auxin. These results support a model in which the apical and lateral auxin sources compete for primary channels of auxin transport in the stem to control the outgrowth of axillary buds.}, author = {Balla, Jozef and Kalousek, Petr and Reinöhl, Vilém and Jirí Friml and Procházka, Stanislav}, journal = {Plant Journal}, number = {4}, pages = {571 -- 577}, publisher = {Wiley-Blackwell}, title = {{Competitive canalization of PIN dependent auxin flow from axillary buds controls pea bud outgrowth}}, doi = {10.1111/j.1365-313X.2010.04443.x}, volume = {65}, year = {2011}, } @article{3083, author = {Robinson, David G and Scheuring, David and Naramoto, Satoshi and Jirí Friml}, journal = {Plant Cell}, number = {3}, pages = {846 -- 849}, publisher = {American Society of Plant Biologists}, title = {{ARF1 localizes to the golgi and the trans Golgi network}}, doi = {10.1105/tpc.110.082099}, volume = {23}, year = {2011}, } @article{3084, abstract = { A central question in developmental biology concerns the mechanism of generation and maintenance of cell polarity, because these processes are essential for many cellular functions and multicellular development [1]. In plants, cell polarity has an additional role in mediating directional transport of the plant hormone auxin that is crucial for multiple developmental processes [2-4]. In addition, plant cells have a complex extracellular matrix, the cell wall [5, 6], whose role in regulating cellular processes, including cell polarity, is unexplored. We have found that polar distribution of PIN auxin transporters [7] in plant cells is maintained by connections between polar domains at the plasma membrane and the cell wall. Genetic and pharmacological interference with cellulose, the major component of the cell wall, or mechanical interference with the cell wall disrupts these connections and leads to increased lateral diffusion and loss of polar distribution of PIN transporters for the phytohormone auxin. Our results reveal a plant-specific mechanism for cell polarity maintenance and provide a conceptual framework for modulating cell polarity and plant development via endogenous and environmental manipulations of the cellulose-based extracellular matrix.}, author = {Feraru, Elena and Feraru, Mugurel I and Kleine-Vehn, Jürgen and Martinière, Alexandre and Mouille, Grégory and Vanneste, Steffen and Vernhettes, Samantha and Runions, John and Jirí Friml}, journal = {Current Biology}, number = {4}, pages = {338 -- 343}, publisher = {Cell Press}, title = {{PIN polarity maintenance by the cell wall in Arabidopsis}}, doi = {10.1016/j.cub.2011.01.036}, volume = {21}, year = {2011}, } @article{3085, abstract = {Phototropism is an adaptation response, through which plants grow towards the light. It involves light perception and asymmetric distribution of the plant hormone auxin. Here we identify a crucial part of the mechanism for phototropism, revealing how light perception initiates auxin redistribution that leads to directional growth. We show that light polarizes the cellular localization of the auxin efflux carrier PIN3 in hypocotyl endodermis cells, resulting in changes in auxin distribution and differential growth. In the dark, high expression and activity of the PINOID (PID) kinase correlates with apolar targeting of PIN3 to all cell sides. Following illumination, light represses PINOID transcription and PIN3 is polarized specifically to the inner cell sides by GNOM ARF GTPase GEF (guanine nucleotide exchange factor)-dependent trafficking. Thus, differential trafficking at the shaded and illuminated hypocotyl side aligns PIN3 polarity with the light direction, and presumably redirects auxin flow towards the shaded side, where auxin promotes growth, causing hypocotyls to bend towards the light. Our results imply that PID phosphorylation-dependent recruitment of PIN proteins into distinct trafficking pathways is a mechanism to polarize auxin fluxes in response to different environmental and endogenous cues.}, author = {Ding, Zhaojun and Galván-Ampudia, Carlos S and Demarsy, Emilie and Łangowski, Łukasz and Kleine-Vehn, Jürgen and Fan, Yuanwei and Morita, Miyo T and Tasaka, Masao and Fankhauser, Christian and Offringa, Remko and Jirí Friml}, journal = {Nature Cell Biology}, number = {4}, pages = {447 -- 453}, publisher = {Nature Publishing Group}, title = {{Light-mediated polarization of the PIN3 auxin transporter for the phototropic response in Arabidopsis}}, doi = {10.1038/ncb2208}, volume = {13}, year = {2011}, } @article{12649, abstract = {Physically based hydrological models describe natural processes more accurately than conceptual models but require extensive data sets to produce accurate results. To identify the value of different data sets for improving the performance of the distributed hydrological model TOPKAPI we combine a multivariable validation technique with Monte Carlo simulations. The study is carried out in the snow and ice-dominated Rhonegletscher basin, as these types of mountainous basins are generally the most critical with respect to data availability and sensitivity to climate fluctuations. Each observational data set is used individually and in combination with the other data sets to determine a subset of best parameter combinations out of 10,000 Monte Carlos runs performed with randomly generated parameter sets. We validate model results against discharge, glacier mass balance, and satellite snow cover images for a 14 year time period (1994–2007). While the use of all data sets combined provides the best overall model performance (defined by the concurrent best agreement of simulated discharge, snow cover and mass balance with their respective measurements), the use of one or two variables for constraining the model results in poorer performance. Using only one data set for constraining the model glacier mass balance proved to be the most efficient observation leading to the best overall model performance. Our main result is that a combination of discharge and satellite snow cover images is best for improving model performance, since the volumetric information of discharge data and the spatial information of snow cover images are complementary.}, author = {Finger, David and Pellicciotti, Francesca and Konz, Markus and Rimkus, Stefan and Burlando, Paolo}, issn = {0043-1397}, journal = {Water Resources Research}, number = {7}, publisher = {American Geophysical Union}, title = {{The value of glacier mass balance, satellite snow cover images, and hourly discharge for improving the performance of a physically based distributed hydrological model}}, doi = {10.1029/2010wr009824}, volume = {47}, year = {2011}, } @inbook{12650, abstract = {Streamflow is a hydrological variable measured at a defined river cross-section; it spatially integrates the runoff generating processes in the contributing watershed, including precipitation and air temperature. Trends in streamflow are progressive changes in the time series of streamflow that can be detected with statistical methods and their statistical significance can be assessed. Mountainous regions are particularly vulnerable to streamflow change because of their high specific runoff and the sensitivity to the distribution of precipitation and air temperature, and the processes of snow accumulation and melt.}, author = {Molnar, Peter and Burlando, Paolo and Pellicciotti, Francesca}, booktitle = {Encyclopedia of Snow, Ice and Glaciers}, editor = {Singh, Vijay and Singh, Pratap and Haritashya, Umesh}, isbn = {978-90-481-2641-5}, issn = {1871-756X}, pages = {1084--1089}, publisher = {Springer Nature}, title = {{Streamflow Trends in Mountainous Regions}}, doi = {10.1007/978-90-481-2642-2_543}, year = {2011}, } @article{12651, abstract = {Temperature data from three Automatic Weather Stations and twelve Temperature Loggers are used to investigate the spatiotemporal variability of temperature over a glacier, its main atmospheric controls, the suitability of extrapolation techniques and their effect on melt modeling. We use data collected on Juncal Norte Glacier, central Chile, during one ablation season. We examine temporal and spatial variability in lapse rates (LRs), together with alternative statistical interpolation methods. The main control over the glacier thermal regime is the development of a katabatic boundary layer (KBL). Katabatic wind occurs at night and in the morning and is eroded in the afternoon. LRs reveal strong diurnal variability, with steeper LRs during the day when the katabatic wind weakens and shallower LRs during the night and morning. We suggest that temporally variable LRs should be used to account for the observed change. They tend to be steeper than equivalent constant LRs, and therefore result in a reduction in simulated melt compared to use of constant LRs when extrapolating from lower to higher elevations. In addition to the temporal variability, the temperature-elevation relationship varies also in space. Differences are evident between local LRs and including such variability in melt modeling affects melt simulations. Extrapolation methods based on the spatial variability of the observations after removal of the elevation trend, such as Inverse Distance Weighting or Kriging, do not seem necessary for simulations of gridded temperature data over a glacier.}, author = {Petersen, L. and Pellicciotti, Francesca}, issn = {0148-0227}, journal = {Journal of Geophysical Research: Atmospheres}, keywords = {Paleontology, Space and Planetary Science, Earth and Planetary Sciences (miscellaneous), Atmospheric Science, Earth-Surface Processes, Geochemistry and Petrology, Soil Science, Water Science and Technology, Ecology, Aquatic Science, Forestry, Oceanography, Geophysics}, number = {D23}, publisher = {American Geophysical Union}, title = {{Spatial and temporal variability of air temperature on a melting glacier: Atmospheric controls, extrapolation methods and their effect on melt modeling, Juncal Norte Glacier, Chile}}, doi = {10.1029/2011jd015842}, volume = {116}, year = {2011}, } @article{12652, abstract = {We explore the robustness and transferability of parameterizations of cloud radiative forcing used in glacier melt models at two sites in the Swiss Alps. We also look at the rationale behind some of the most commonly used approaches, and explore the relationship between cloud transmittance and several standard meteorological variables. The 2 m air-temperature diurnal range is the best predictor of variations in cloud transmittance. However, linear and exponential parameterizations can only explain 30–50% of the observed variance in computed cloud transmittance factors. We examine the impact of modelled cloud transmittance factors on both solar radiation and ablation rates computed with an enhanced temperature-index model. The melt model performance decreases when modelled radiation is used, the reduction being due to an underestimation of incoming solar radiation on clear-sky days. The model works well under overcast conditions. We also seek alternatives to the use of in situ ground data. However, outputs from an atmospheric model (2.2 km horizontal resolution) do not seem to provide an alternative to the parameterizations of cloud radiative forcing based on observations of air temperature at glacier automatic weather stations. Conversely, the correct definition of overcast conditions is important.}, author = {Pellicciotti, Francesca and Raschle, Thomas and Huerlimann, Thomas and Carenzo, Marco and Burlando, Paolo}, issn = {1727-5652}, journal = {Journal of Glaciology}, number = {202}, pages = {367--381}, publisher = {Cambridge University Press}, title = {{Transmission of solar radiation through clouds on melting glaciers: A comparison of parameterizations and their impact on melt modelling}}, doi = {10.3189/002214311796406013}, volume = {57}, year = {2011}, } @article{1299, abstract = {Recent experiments have shown that motion detection in Drosophila starts with splitting the visual input into two parallel channels encoding brightness increments (ON) or decrements (OFF). This suggests the existence of either two (ON-ON, OFF-OFF) or four (for all pairwise interactions) separate motion detectors. To decide between these possibilities, we stimulated flies using sequences of ON and OFF brightness pulses while recording from motion-sensitive tangential cells. We found direction-selective responses to sequences of same sign (ON-ON, OFF-OFF), but not of opposite sign (ON-OFF, OFF-ON), refuting the existence of four separate detectors. Based on further measurements, we propose a model that reproduces a variety of additional experimental data sets, including ones that were previously interpreted as support for four separate detectors. Our experiments and the derived model mark an important step in guiding further dissection of the fly motion detection circuit.}, author = {Eichner, Hubert and Maximilian Jösch and Schnell, Bettina and Reiff, Dierk F and Borst, Alexander}, journal = {Neuron}, number = {6}, pages = {1155 -- 1164}, publisher = {Elsevier}, title = {{Internal structure of the fly elementary motion detector}}, doi = {10.1016/j.neuron.2011.03.028}, volume = {70}, year = {2011}, } @inbook{2098, abstract = {This chapter presents a method for real-time animation of highly detailed facial expressions based on sparse motion captures data and a limited set of static example poses. The method for real-time animation of highly detailed facial expressions decomposes geometry into large-scale motion and fine-scale details, such as expression wrinkles. Both large- and fine-scale deformation algorithms run entirely on the GPU, and our implementation based on CUDA achieves an overall performance of about 30 fps. The face conveys the most relevant visual characteristics of human identity and expression. Hence, realistic facial animations or interactions with virtual avatars are important for storytelling and gameplay. However, current approaches are either computationally expensive, require very specialized capture hardware, or are extremely labor intensive. At runtime, given an arbitrary facial expression, the algorithm computes the skin strain from the relative distance between marker points and derives fine-scale corrections for the largescale deformation. During gameplay only the sparse set of marker-point positions is transmitted to the GPU. The face animation is entirely computed on the GPU where the resulting mesh can directly be used as input for the rendering stages. This data can be easily obtained by traditional capture hardware. The proposed in-game algorithm is fast. It also is easy to implement and maps well onto programmable GPUs.}, author = {Bernd Bickel and Lang, Manuel}, booktitle = {GPU Computing Gems Emerald Edition}, pages = {413 -- 426}, publisher = {Science Direct}, title = {{From sparse mocap to highly detailed facial animation}}, doi = {10.1016/B978-0-12-384988-5.00027-9}, year = {2011}, } @article{2099, abstract = {We present a new technique for passive and markerless facial performance capture based on anchor frames. Our method starts with high resolution per-frame geometry acquisition using state-of-theart stereo reconstruction, and proceeds to establish a single triangle mesh that is propagated through the entire performance. Leveraging the fact that facial performances often contain repetitive subsequences, we identify anchor frames as those which contain similar facial expressions to a manually chosen reference expression. Anchor frames are automatically computed over one or even multiple performances. We introduce a robust image-space tracking method that computes pixel matches directly from the reference frame to all anchor frames, and thereby to the remaining frames in the sequence via sequential matching. This allows us to propagate one reconstructed frame to an entire sequence in parallel, in contrast to previous sequential methods. Our anchored reconstruction approach also limits tracker drift and robustly handles occlusions and motion blur. The parallel tracking and mesh propagation offer low computation times. Our technique will even automatically match anchor frames across different sequences captured on different occasions, propagating a single mesh to all performances.}, author = {Beeler, Thabo and Hahn, Fabian and Bradley, Derek J and Bernd Bickel and Beardsley, Paul A and Gotsman, Craig and Sumner, Robert W and Groß, Markus S}, journal = {ACM Transactions on Graphics}, number = {4}, publisher = {ACM}, title = {{High-quality passive facial performance capture using anchor frames}}, doi = {10.1145/2010324.1964970}, volume = {30}, year = {2011}, } @inproceedings{2100, abstract = {Acquiring panoramic images using stitching takes a lot of time and moving objects may cause ghosting. It is also difficult to obtain a full spherical panorama, because the downward picture cannot be captured while the camera is mounted on the tripod.}, author = {Pfeil, Jonas and Hildebrand, Kristian and Gremzow, Carsten and Bernd Bickel and Alexa, Marc}, publisher = {ACM}, title = {{Throwable panoramic ball camera}}, doi = {10.1145/2073370.2073373}, year = {2011}, }