@article{11100, abstract = {Eukaryotic cell function depends on the physical separation of nucleoplasmic and cytoplasmic components by the nuclear envelope (NE). Molecular communication between the two compartments involves active, signal-mediated trafficking, a function that is exclusively performed by nuclear pore complexes (NPCs). The individual NPC components and the mechanisms that are involved in nuclear trafficking are well documented and have become textbook knowledge. However, in addition to their roles as nuclear gatekeepers, NPC components-nucleoporins-have been shown to have critical roles in chromatin organization and gene regulation. These findings have sparked new enthusiasm to study the roles of this multiprotein complex in nuclear organization and explore novel functions that in some cases appear to go beyond a role in transport. Here, we discuss our present view of NPC biogenesis, which is tightly linked to proper cell cycle progression and cell differentiation. In addition, we summarize new data suggesting that NPCs represent dynamic hubs for the integration of gene regulation and nuclear transport processes.}, author = {Capelson, M. and Doucet, C. and HETZER, Martin W}, isbn = {9781936113071}, issn = {0091-7451}, journal = {Cold Spring Harbor Symposia on Quantitative Biology}, keywords = {Genetics, Molecular Biology, Biochemistry}, pages = {585--597}, publisher = {Cold Spring Harbor Laboratory Press}, title = {{Nuclear pore complexes: Guardians of the nuclear genome}}, doi = {10.1101/sqb.2010.75.059}, volume = {75}, year = {2011}, } @article{112, abstract = {Particle beams are important tools for probing atomic and molecular interactions. Here we demonstrate that particle beams also offer a unique opportunity to investigate interactions in macroscopic systems, such as granular media. Motivated by recent experiments on streams of grains that exhibit liquid-like breakup into droplets, we use molecular dynamics simulations to investigate the evolution of a dense stream of macroscopic spheres accelerating out of an opening at the bottom of a reservoir. We show how nanoscale details associated with energy dissipation during collisions modify the stream\'s macroscopic behavior. We find that inelastic collisions collimate the stream, while the presence of short-range attractive interactions drives structure formation. Parameterizing the collision dynamics by the coefficient of restitution (i.e., the ratio of relative velocities before and after impact) and the strength of the cohesive interaction, we map out a spectrum of behaviors that ranges from gaslike jets in which all grains drift apart to liquid-like streams that break into large droplets containing hundreds of grains. We also find a new, intermediate regime in which small aggregates form by capture from the gas phase, similar to what can be observed in molecular beams. Our results show that nearly all aspects of stream behavior are closely related to the velocity gradient associated with vertical free fall. Led by this observation, we propose a simple energy balance model to explain the droplet formation process. The qualitative as well as many quantitative features of the simulations and the model compare well with available experimental data and provide a first quantitative measure of the role of attractions in freely cooling granular streams.}, author = {Waitukaitis, Scott R and Grütjen, Helge and Royer, John and Jaeger, Heinrich}, journal = {Physical Review E}, number = {5}, publisher = {American Physical Society}, title = {{Droplet and cluster formation in freely falling granular streams}}, doi = {10.1103/PhysRevE.83.051302}, volume = {83}, year = {2011}, } @article{11673, abstract = {Given only the URL of a Web page, can we identify its topic? We study this problem in detail by exploring a large number of different feature sets and algorithms on several datasets. We also show that the inherent overlap between topics and the sparsity of the information in URLs makes this a very challenging problem. Web page classification without a page’s content is desirable when the content is not available at all, when a classification is needed before obtaining the content, or when classification speed is of utmost importance. For our experiments we used five different corpora comprising a total of about 3 million (URL, classification) pairs. We evaluated several techniques for feature generation and classification algorithms. The individual binary classifiers were then combined via boosting into metabinary classifiers. We achieve typical F-measure values between 80 and 85, and a typical precision of around 86. The precision can be pushed further over 90 while maintaining a typical level of recall between 30 and 40.}, author = {Baykan, Eda and Henzinger, Monika H and Marian, Ludmila and Weber, Ingmar}, issn = {1559-114X}, journal = {ACM Transactions on the Web}, keywords = {Topic classification, URL, ODP}, number = {3}, publisher = {Association for Computing Machinery}, title = {{A comprehensive study of features and algorithms for URL-based topic classification}}, doi = {10.1145/1993053.1993057}, volume = {5}, year = {2011}, } @article{11760, abstract = {We study a novel load balancing problem that arises in web search engines. The problem is a combination of an offline assignment problem, where files need to be (copied and) assigned to machines, and an online load balancing problem, where requests ask for specific files and need to be assigned to a corresponding machine, whose load is increased by this. We present simple deterministic algorithms for this problem and exhibit an interesting trade-off between the available space to make file copies and the obtainable makespan. We also give non-trivial lower bounds for a large class of deterministic algorithms and present a randomized algorithm that beats these bounds with high probability.}, author = {Dütting, Paul and Henzinger, Monika H and Weber, Ingmar}, issn = {0020-0190}, journal = {Information Processing Letters}, number = {4}, pages = {178--183}, publisher = {Elsevier}, title = {{Offline file assignments for online load balancing}}, doi = {10.1016/j.ipl.2010.11.022}, volume = {111}, year = {2011}, } @inproceedings{11796, abstract = {The design of truthful auctions that approximate the optimal expected revenue is a central problem in algorithmic mechanism design. 30 years after Myerson’s characterization of Bayesian optimal auctions in single-parameter domains [8], characterizing but also providing efficient mechanisms for multi-parameter domains still remains a very important unsolved problem. Our work improves upon recent results in this area, introducing new techniques for tackling the problem, while also combining and extending recently introduced tools. In particular we give the first approximation algorithms for Bayesian auctions with multiple heterogeneous items when bidders have additive valuations, budget constraints and general matroid feasibility constraints.}, author = {Henzinger, Monika H and Vidali, Angelina}, booktitle = {19th Annual European Symposium on Algorithms}, isbn = {9783642237188}, issn = {1611-3349}, location = {Saarbrücken, Germany}, pages = {192–202}, publisher = {Springer Nature}, title = {{Multi-parameter mechanism design under budget and matroid constraints}}, doi = {10.1007/978-3-642-23719-5_17}, volume = {6942}, year = {2011}, }