[{"publication_identifier":{"eissn":["2381-8549"],"eisbn":["9781479957514"]},"conference":{"location":"Paris, France","start_date":"2014-10-27","name":"IEEE International Conference on Image Processing","end_date":"2014-10-30"},"publication":"2014 IEEE International Conference on Image Processing (ICIP)","quality_controlled":"1","year":"2015","date_published":"2015-01-29T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.1109/icip.2014.7025264","publisher":"IEEE","date_created":"2024-10-15T11:20:54Z","status":"public","article_processing_charge":"No","extern":"1","author":[{"last_name":"Menashe","full_name":"Menashe, Ohad","first_name":"Ohad"},{"orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","full_name":"Bronstein, Alexander","last_name":"Bronstein"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","type":"conference","abstract":[{"text":"We propose a method and a prototype imaging system for real-time reconstruction of volumetric piecewise-smooth scattering media. The volume is illuminated by a sequence of structured binary patterns emitted from a fan beam projector, and the scattered light is collected by a two-dimensional sensor, thus creating an under-complete set of compressed measurements. We show a fixed-complexity and latency reconstruction algorithm capable of estimating the scattering coefficients in real-time. We also show a simple greedy algorithm for learning the optimal illumination patterns. Our results demonstrate faithful reconstruction from highly compressed measurements. Furthermore, a method for compressed registration of the measured volume to a known template is presented, showing excellent alignment with just a single projection. Though our prototype system operates in visible light, the presented methodology is suitable for fast x-ray scattering imaging, in particular in real-time vascular medical imaging.","lang":"eng"}],"article_number":"7025264","oa_version":"None","publication_status":"published","citation":{"ista":"Menashe O, Bronstein AM. 2015. Real-time compressed imaging of scattering volumes. 2014 IEEE International Conference on Image Processing (ICIP). IEEE International Conference on Image Processing, 7025264.","mla":"Menashe, Ohad, and Alex M. Bronstein. “Real-Time Compressed Imaging of Scattering Volumes.” 2014 IEEE International Conference on Image Processing (ICIP), 7025264, IEEE, 2015, doi:10.1109/icip.2014.7025264.","chicago":"Menashe, Ohad, and Alex M. Bronstein. “Real-Time Compressed Imaging of Scattering Volumes.” In 2014 IEEE International Conference on Image Processing (ICIP). IEEE, 2015. https://doi.org/10.1109/icip.2014.7025264.","short":"O. Menashe, A.M. Bronstein, in:, 2014 IEEE International Conference on Image Processing (ICIP), IEEE, 2015.","ieee":"O. Menashe and A. M. Bronstein, “Real-time compressed imaging of scattering volumes,” in 2014 IEEE International Conference on Image Processing (ICIP), Paris, France, 2015.","apa":"Menashe, O., & Bronstein, A. M. (2015). Real-time compressed imaging of scattering volumes. In 2014 IEEE International Conference on Image Processing (ICIP). Paris, France: IEEE. https://doi.org/10.1109/icip.2014.7025264","ama":"Menashe O, Bronstein AM. Real-time compressed imaging of scattering volumes. In: 2014 IEEE International Conference on Image Processing (ICIP). IEEE; 2015. doi:10.1109/icip.2014.7025264"},"date_updated":"2024-12-04T13:56:28Z","month":"01","day":"29","scopus_import":"1","title":"Real-time compressed imaging of scattering volumes","_id":"18400"},{"article_processing_charge":"No","extern":"1","date_published":"2015-12-10T00:00:00Z","language":[{"iso":"eng"}],"doi":"10.1109/icip.2015.7351256","publisher":"IEEE","date_created":"2024-10-15T11:20:54Z","status":"public","publication":"2015 IEEE International Conference on Image Processing (ICIP)","quality_controlled":"1","year":"2015","publication_identifier":{"eisbn":["9781479983391"]},"conference":{"location":"Quebec City, QC, Canada","start_date":"2015-09-27","name":"IEEE International Conference on Image Processing","end_date":"2015-09-30"},"_id":"18401","month":"12","day":"10","scopus_import":"1","title":"Intel realsense = Real low cost gaze","type":"conference","abstract":[{"text":"Intel's newly-announced low-cost RealSense 3D camera claims significantly better precision than other currently available low-cost platforms and is expected to become ubiquitous in laptops and mobile devices starting this year. In this paper, we demonstrate for the first time that the RealSense camera can be easily converted into a real low-cost gaze tracker. Gaze has become increasingly relevant as an input for human-computer interaction due to its association with attention. It is also critical in clinical mental health diagnosis. We present a novel 3D gaze and fixation tracker based on the eye surface geometry captured with the RealSense 3D camera. First, eye surface 3D point clouds are segmented to extract the pupil center and iris using registered infrared images. With non-ellipsoid eye surface and single fixation point assumptions, pupil centers and iris normal vectors are used to first estimate gaze (for each eye), and then a single fixation point for both eyes simultaneously using a RANSAC-based approach. With a simple learned bias field correction model, the fixation tracker demonstrates mean error of approximately 1 cm at 20-30 cm, which is sufficiently adequate for gaze and fixation tracking in human-computer interaction and mental health diagnosis applications.","lang":"eng"}],"article_number":"7351256","publication_status":"published","oa_version":"None","date_updated":"2024-12-05T08:13:05Z","citation":{"chicago":"Draelos, Mark, Qiang Qiu, Alex M. Bronstein, and Guillermo Sapiro. “Intel Realsense = Real Low Cost Gaze.” In 2015 IEEE International Conference on Image Processing (ICIP). IEEE, 2015. https://doi.org/10.1109/icip.2015.7351256.","ista":"Draelos M, Qiu Q, Bronstein AM, Sapiro G. 2015. Intel realsense = Real low cost gaze. 2015 IEEE International Conference on Image Processing (ICIP). IEEE International Conference on Image Processing, 7351256.","mla":"Draelos, Mark, et al. “Intel Realsense = Real Low Cost Gaze.” 2015 IEEE International Conference on Image Processing (ICIP), 7351256, IEEE, 2015, doi:10.1109/icip.2015.7351256.","short":"M. Draelos, Q. Qiu, A.M. Bronstein, G. Sapiro, in:, 2015 IEEE International Conference on Image Processing (ICIP), IEEE, 2015.","ieee":"M. Draelos, Q. Qiu, A. M. Bronstein, and G. Sapiro, “Intel realsense = Real low cost gaze,” in 2015 IEEE International Conference on Image Processing (ICIP), Quebec City, QC, Canada, 2015.","ama":"Draelos M, Qiu Q, Bronstein AM, Sapiro G. Intel realsense = Real low cost gaze. In: 2015 IEEE International Conference on Image Processing (ICIP). IEEE; 2015. doi:10.1109/icip.2015.7351256","apa":"Draelos, M., Qiu, Q., Bronstein, A. M., & Sapiro, G. (2015). Intel realsense = Real low cost gaze. In 2015 IEEE International Conference on Image Processing (ICIP). Quebec City, QC, Canada: IEEE. https://doi.org/10.1109/icip.2015.7351256"},"author":[{"last_name":"Draelos","full_name":"Draelos, Mark","first_name":"Mark"},{"first_name":"Qiang","last_name":"Qiu","full_name":"Qiu, Qiang"},{"orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","full_name":"Bronstein, Alexander","last_name":"Bronstein"},{"last_name":"Sapiro","full_name":"Sapiro, Guillermo","first_name":"Guillermo"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"author":[{"first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov"}],"oa_version":"Preprint","date_updated":"2025-09-22T14:33:14Z","intvolume":" 37","abstract":[{"lang":"eng","text":"We propose a new family of message passing techniques for MAP estimation in graphical models which we call Sequential Reweighted Message Passing (SRMP). Special cases include well-known techniques such as Min-Sum Diffusion (MSD) and a faster Sequential Tree-Reweighted Message Passing (TRW-S). Importantly, our derivation is simpler than the original derivation of TRW-S, and does not involve a decomposition into trees. This allows easy generalizations. The new family of algorithms can be viewed as a generalization of TRW-S from pairwise to higher-order graphical models. We test SRMP on several real-world problems with promising results."}],"title":"A new look at reweighted message passing","day":"01","OA_type":"green","isi":1,"department":[{"_id":"VlKo"}],"project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","grant_number":"616160","call_identifier":"FP7"}],"ec_funded":1,"related_material":{"record":[{"relation":"earlier_version","id":"2273","status":"public"}]},"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","main_file_link":[{"url":"http://arxiv.org/abs/1309.5655","open_access":"1"}],"date_created":"2018-12-11T11:54:18Z","status":"public","article_processing_charge":"No","OA_place":"repository","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","citation":{"ieee":"V. Kolmogorov, “A new look at reweighted message passing,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 5. IEEE, pp. 919–930, 2015.","apa":"Kolmogorov, V. (2015). A new look at reweighted message passing. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2014.2363465","ama":"Kolmogorov V. A new look at reweighted message passing. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2015;37(5):919-930. doi:10.1109/TPAMI.2014.2363465","short":"V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence 37 (2015) 919–930.","ista":"Kolmogorov V. 2015. A new look at reweighted message passing. IEEE Transactions on Pattern Analysis and Machine Intelligence. 37(5), 919–930.","mla":"Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 5, IEEE, 2015, pp. 919–30, doi:10.1109/TPAMI.2014.2363465.","chicago":"Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2015. https://doi.org/10.1109/TPAMI.2014.2363465."},"volume":37,"type":"journal_article","corr_author":"1","publist_id":"5261","arxiv":1,"scopus_import":"1","month":"05","_id":"1841","external_id":{"isi":["000352533000002"],"arxiv":["1309.5655"]},"page":"919 - 930","quality_controlled":"1","year":"2015","oa":1,"language":[{"iso":"eng"}],"doi":"10.1109/TPAMI.2014.2363465","date_published":"2015-05-01T00:00:00Z","publisher":"IEEE","issue":"5","article_type":"original"},{"external_id":{"pmid":["26353129"],"arxiv":["1212.3631"]},"page":"1821-1833","quality_controlled":"1","year":"2015","oa":1,"language":[{"iso":"eng"}],"doi":"10.1109/tpami.2015.2392779","publisher":"IEEE","date_published":"2015-09-01T00:00:00Z","issue":"9","extern":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","citation":{"mla":"Sprechmann, P., et al. “Learning Efficient Sparse and Low Rank Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 9, IEEE, 2015, pp. 1821–33, doi:10.1109/tpami.2015.2392779.","chicago":"Sprechmann, P., Alex M. Bronstein, and G. Sapiro. “Learning Efficient Sparse and Low Rank Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2015. https://doi.org/10.1109/tpami.2015.2392779.","ista":"Sprechmann P, Bronstein AM, Sapiro G. 2015. Learning efficient sparse and low rank models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 37(9), 1821–1833.","short":"P. Sprechmann, A.M. Bronstein, G. Sapiro, IEEE Transactions on Pattern Analysis and Machine Intelligence 37 (2015) 1821–1833.","ama":"Sprechmann P, Bronstein AM, Sapiro G. Learning efficient sparse and low rank models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2015;37(9):1821-1833. doi:10.1109/tpami.2015.2392779","apa":"Sprechmann, P., Bronstein, A. M., & Sapiro, G. (2015). Learning efficient sparse and low rank models. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/tpami.2015.2392779","ieee":"P. Sprechmann, A. M. Bronstein, and G. Sapiro, “Learning efficient sparse and low rank models,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 9. IEEE, pp. 1821–1833, 2015."},"volume":37,"type":"journal_article","arxiv":1,"pmid":1,"month":"09","scopus_import":"1","_id":"18415","publication_identifier":{"eissn":["1939-3539"],"issn":["0162-8828"]},"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","date_created":"2024-10-15T11:20:55Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1212.3631"}],"status":"public","article_processing_charge":"No","author":[{"last_name":"Sprechmann","full_name":"Sprechmann, P.","first_name":"P."},{"full_name":"Bronstein, Alexander","last_name":"Bronstein","orcid":"0000-0001-9699-8730","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"first_name":"G.","full_name":"Sapiro, G.","last_name":"Sapiro"}],"oa_version":"Preprint","date_updated":"2024-12-18T11:40:35Z","intvolume":" 37","abstract":[{"text":"Parsimony, including sparsity and low rank, has been shown to successfully model data in numerous machine learning and signal processing tasks. Traditionally, such modeling approaches rely on an iterative algorithm that minimizes an objective function with parsimony-promoting terms. The inherently sequential structure and data-dependent complexity and latency of iterative optimization constitute a major limitation in many applications requiring real-time performance or involving large-scale data. Another limitation encountered by these modeling techniques is the difficulty of their inclusion in discriminative learning scenarios. In this work, we propose to move the emphasis from the model to the pursuit algorithm, and develop a process-centric view of parsimonious modeling, in which a learned deterministic fixed-complexity pursuit process is used in lieu of iterative optimization. We show a principled way to construct learnable pursuit process architectures for structured sparse and robust low rank models, derived from the iteration of proximal descent algorithms. These architectures learn to approximate the exact parsimonious representation at a fraction of the complexity of the standard optimization methods. We also show that appropriate training regimes allow to naturally extend parsimonious models to discriminative settings. State-of-the-art results are demonstrated on several challenging problems in image and audio processing with several orders of magnitude speed-up compared to the exact optimization algorithms.","lang":"eng"}],"title":"Learning efficient sparse and low rank models","day":"01"},{"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","publication_identifier":{"eissn":["1939-3539"],"issn":["0162-8828"]},"article_processing_charge":"No","status":"public","date_created":"2024-10-15T11:20:55Z","abstract":[{"lang":"eng","text":"We construct an extension of spectral and diffusion geometry to multiple modalities through simultaneous diagonalization of Laplacian matrices. This naturally extends classical data analysis tools based on spectral geometry, such as diffusion maps and spectral clustering. We provide several synthetic and real examples of manifold learning, object classification, and clustering, showing that the joint spectral geometry better captures the inherent structure of multi-modal data. We also show the relation of many previous approaches for multimodal manifold analysis to our framework."}],"intvolume":" 37","date_updated":"2024-12-12T14:08:46Z","oa_version":"None","author":[{"last_name":"Eynard","full_name":"Eynard, Davide","first_name":"Davide"},{"last_name":"Kovnatsky","full_name":"Kovnatsky, Artiom","first_name":"Artiom"},{"last_name":"Bronstein","full_name":"Bronstein, Michael M.","first_name":"Michael M."},{"first_name":"Klaus","last_name":"Glashoff","full_name":"Glashoff, Klaus"},{"orcid":"0000-0001-9699-8730","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","last_name":"Bronstein"}],"day":"01","title":"Multimodal manifold snalysis by simultaneous diagonalization of Laplacians","year":"2015","quality_controlled":"1","page":"2505-2517","external_id":{"pmid":["26539854"]},"extern":"1","issue":"12","language":[{"iso":"eng"}],"doi":"10.1109/tpami.2015.2408348","publisher":"IEEE","date_published":"2015-12-01T00:00:00Z","type":"journal_article","volume":37,"citation":{"short":"D. Eynard, A. Kovnatsky, M.M. Bronstein, K. Glashoff, A.M. Bronstein, IEEE Transactions on Pattern Analysis and Machine Intelligence 37 (2015) 2505–2517.","ista":"Eynard D, Kovnatsky A, Bronstein MM, Glashoff K, Bronstein AM. 2015. Multimodal manifold snalysis by simultaneous diagonalization of Laplacians. IEEE Transactions on Pattern Analysis and Machine Intelligence. 37(12), 2505–2517.","mla":"Eynard, Davide, et al. “Multimodal Manifold Snalysis by Simultaneous Diagonalization of Laplacians.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 12, IEEE, 2015, pp. 2505–17, doi:10.1109/tpami.2015.2408348.","chicago":"Eynard, Davide, Artiom Kovnatsky, Michael M. Bronstein, Klaus Glashoff, and Alex M. Bronstein. “Multimodal Manifold Snalysis by Simultaneous Diagonalization of Laplacians.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2015. https://doi.org/10.1109/tpami.2015.2408348.","ama":"Eynard D, Kovnatsky A, Bronstein MM, Glashoff K, Bronstein AM. Multimodal manifold snalysis by simultaneous diagonalization of Laplacians. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2015;37(12):2505-2517. doi:10.1109/tpami.2015.2408348","apa":"Eynard, D., Kovnatsky, A., Bronstein, M. M., Glashoff, K., & Bronstein, A. M. (2015). Multimodal manifold snalysis by simultaneous diagonalization of Laplacians. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/tpami.2015.2408348","ieee":"D. Eynard, A. Kovnatsky, M. M. Bronstein, K. Glashoff, and A. M. Bronstein, “Multimodal manifold snalysis by simultaneous diagonalization of Laplacians,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 12. IEEE, pp. 2505–2517, 2015."},"publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"18416","scopus_import":"1","month":"12","pmid":1},{"publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"publication":"Computer Graphics Forum","date_created":"2024-10-15T11:20:55Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1403.6637"}],"status":"public","article_processing_charge":"No","author":[{"first_name":"Simon","full_name":"Korman, Simon","last_name":"Korman"},{"first_name":"Roee","full_name":"Litman, Roee","last_name":"Litman"},{"first_name":"Shai","full_name":"Avidan, Shai","last_name":"Avidan"},{"full_name":"Bronstein, Alexander","last_name":"Bronstein","orcid":"0000-0001-9699-8730","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"}],"oa_version":"Preprint","date_updated":"2024-12-19T10:12:48Z","intvolume":" 34","abstract":[{"text":"We present a fast algorithm for global rigid symmetry detection with approximation guarantees. The algorithm is guaranteed to find the best approximate symmetry of a given shape, to within a user-specified threshold, with very high probability. Our method uses a carefully designed sampling of the transformation space, where each transformation is efficiently evaluated using a sublinear algorithm. We prove that the density of the sampling depends on the total variation of the shape, allowing us to derive formal bounds on the algorithm's complexity and approximation quality. We further investigate different volumetric shape representations (in the form of truncated distance transforms), and in such a way control the total variation of the shape and hence the sampling density and the runtime of the algorithm. A comprehensive set of experiments assesses the proposed method, including an evaluation on the eight categories of the COSEG data set. This is the first large-scale evaluation of any symmetry detection technique that we are aware of.","lang":"eng"}],"title":"Probably approximately symmetric: Fast rigid symmetry detection with global guarantees","day":"01","external_id":{"arxiv":["1403.6637"]},"page":"2-13","quality_controlled":"1","year":"2015","oa":1,"doi":"10.1111/cgf.12454","publisher":"Wiley","language":[{"iso":"eng"}],"date_published":"2015-02-01T00:00:00Z","issue":"1","extern":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","citation":{"ama":"Korman S, Litman R, Avidan S, Bronstein AM. Probably approximately symmetric: Fast rigid symmetry detection with global guarantees. Computer Graphics Forum. 2015;34(1):2-13. doi:10.1111/cgf.12454","apa":"Korman, S., Litman, R., Avidan, S., & Bronstein, A. M. (2015). Probably approximately symmetric: Fast rigid symmetry detection with global guarantees. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.12454","ieee":"S. Korman, R. Litman, S. Avidan, and A. M. Bronstein, “Probably approximately symmetric: Fast rigid symmetry detection with global guarantees,” Computer Graphics Forum, vol. 34, no. 1. Wiley, pp. 2–13, 2015.","short":"S. Korman, R. Litman, S. Avidan, A.M. Bronstein, Computer Graphics Forum 34 (2015) 2–13.","ista":"Korman S, Litman R, Avidan S, Bronstein AM. 2015. Probably approximately symmetric: Fast rigid symmetry detection with global guarantees. Computer Graphics Forum. 34(1), 2–13.","mla":"Korman, Simon, et al. “Probably Approximately Symmetric: Fast Rigid Symmetry Detection with Global Guarantees.” Computer Graphics Forum, vol. 34, no. 1, Wiley, 2015, pp. 2–13, doi:10.1111/cgf.12454.","chicago":"Korman, Simon, Roee Litman, Shai Avidan, and Alex M. Bronstein. “Probably Approximately Symmetric: Fast Rigid Symmetry Detection with Global Guarantees.” Computer Graphics Forum. Wiley, 2015. https://doi.org/10.1111/cgf.12454."},"volume":34,"type":"journal_article","arxiv":1,"scopus_import":"1","month":"02","_id":"18424"},{"publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"page":"87-119","year":"2015","quality_controlled":"1","publication":"Computer Graphics Forum","status":"public","date_created":"2024-10-15T11:20:55Z","issue":"6","date_published":"2015-09-01T00:00:00Z","publisher":"Wiley","doi":"10.1111/cgf.12734","language":[{"iso":"eng"}],"extern":"1","article_processing_charge":"No","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Biasotti","full_name":"Biasotti, S.","first_name":"S."},{"first_name":"A.","full_name":"Cerri, A.","last_name":"Cerri"},{"first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","last_name":"Bronstein","full_name":"Bronstein, Alexander"},{"last_name":"Bronstein","full_name":"Bronstein, M.","first_name":"M."}],"intvolume":" 35","date_updated":"2024-12-19T13:44:16Z","citation":{"ieee":"S. Biasotti, A. Cerri, A. M. Bronstein, and M. Bronstein, “Recent trends, applications, and perspectives in 3D shape similarity assessment,” Computer Graphics Forum, vol. 35, no. 6. Wiley, pp. 87–119, 2015.","ama":"Biasotti S, Cerri A, Bronstein AM, Bronstein M. Recent trends, applications, and perspectives in 3D shape similarity assessment. Computer Graphics Forum. 2015;35(6):87-119. doi:10.1111/cgf.12734","apa":"Biasotti, S., Cerri, A., Bronstein, A. M., & Bronstein, M. (2015). Recent trends, applications, and perspectives in 3D shape similarity assessment. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.12734","short":"S. Biasotti, A. Cerri, A.M. Bronstein, M. Bronstein, Computer Graphics Forum 35 (2015) 87–119.","mla":"Biasotti, S., et al. “Recent Trends, Applications, and Perspectives in 3D Shape Similarity Assessment.” Computer Graphics Forum, vol. 35, no. 6, Wiley, 2015, pp. 87–119, doi:10.1111/cgf.12734.","chicago":"Biasotti, S., A. Cerri, Alex M. Bronstein, and M. Bronstein. “Recent Trends, Applications, and Perspectives in 3D Shape Similarity Assessment.” Computer Graphics Forum. Wiley, 2015. https://doi.org/10.1111/cgf.12734.","ista":"Biasotti S, Cerri A, Bronstein AM, Bronstein M. 2015. Recent trends, applications, and perspectives in 3D shape similarity assessment. Computer Graphics Forum. 35(6), 87–119."},"publication_status":"published","oa_version":"None","abstract":[{"text":"The recent introduction of 3D shape analysis frameworks able to quantify the deformation of a shape into another in terms of the variation of real functions yields a new interpretation of the 3D shape similarity assessment and opens new perspectives. Indeed, while the classical approaches to similarity mainly quantify it as a numerical score, map-based methods also define (dense) shape correspondences. After presenting in detail the theoretical foundations underlying these approaches, we classify them by looking at their most salient features, including the kind of structure and invariance properties they capture, as well as the distances and the output modalities according to which the similarity between shapes is assessed and returned. We also review the usage of these methods in a number of 3D shape application domains, ranging from matching and retrieval to annotation and segmentation. Finally, the most promising directions for future research developments are discussed.","lang":"eng"}],"type":"journal_article","volume":35,"title":"Recent trends, applications, and perspectives in 3D shape similarity assessment","scopus_import":"1","month":"09","day":"01","_id":"18425"},{"extern":"1","article_processing_charge":"No","oa":1,"status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1364/OE.23.024547"}],"date_created":"2024-10-15T11:20:55Z","issue":"19","doi":"10.1364/oe.23.024547","date_published":"2015-09-10T00:00:00Z","publisher":"Optica Publishing Group","language":[{"iso":"eng"}],"year":"2015","quality_controlled":"1","publication":"Optics Express","publication_identifier":{"eissn":["1094-4087"]},"page":"24547 - 24556","_id":"18436","title":"Computational multi-focus imaging combining sparse model with color dependent phase mask","scopus_import":"1","month":"09","day":"10","citation":{"short":"H. Haim, A.M. Bronstein, E. Marom, Optics Express 23 (2015) 24547–24556.","chicago":"Haim, Harel, Alex M. Bronstein, and Emanuel Marom. “Computational Multi-Focus Imaging Combining Sparse Model with Color Dependent Phase Mask.” Optics Express. Optica Publishing Group, 2015. https://doi.org/10.1364/oe.23.024547.","mla":"Haim, Harel, et al. “Computational Multi-Focus Imaging Combining Sparse Model with Color Dependent Phase Mask.” Optics Express, vol. 23, no. 19, Optica Publishing Group, 2015, pp. 24547–56, doi:10.1364/oe.23.024547.","ista":"Haim H, Bronstein AM, Marom E. 2015. Computational multi-focus imaging combining sparse model with color dependent phase mask. Optics Express. 23(19), 24547–24556.","ieee":"H. Haim, A. M. Bronstein, and E. Marom, “Computational multi-focus imaging combining sparse model with color dependent phase mask,” Optics Express, vol. 23, no. 19. Optica Publishing Group, pp. 24547–24556, 2015.","ama":"Haim H, Bronstein AM, Marom E. Computational multi-focus imaging combining sparse model with color dependent phase mask. Optics Express. 2015;23(19):24547-24556. doi:10.1364/oe.23.024547","apa":"Haim, H., Bronstein, A. M., & Marom, E. (2015). Computational multi-focus imaging combining sparse model with color dependent phase mask. Optics Express. Optica Publishing Group. https://doi.org/10.1364/oe.23.024547"},"intvolume":" 23","date_updated":"2024-12-19T10:48:50Z","oa_version":"Published Version","publication_status":"published","volume":23,"type":"journal_article","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Haim, Harel","last_name":"Haim","first_name":"Harel"},{"last_name":"Bronstein","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","orcid":"0000-0001-9699-8730"},{"first_name":"Emanuel","full_name":"Marom, Emanuel","last_name":"Marom"}]},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Qiang","full_name":"Qiu, Qiang","last_name":"Qiu"},{"first_name":"Zhuoqing","last_name":"Chang","full_name":"Chang, Zhuoqing"},{"full_name":"Draelos, Mark","last_name":"Draelos","first_name":"Mark"},{"first_name":"Jie","last_name":"Chen","full_name":"Chen, Jie"},{"full_name":"Bronstein, Alexander","last_name":"Bronstein","orcid":"0000-0001-9699-8730","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"},{"last_name":"Sapiro","full_name":"Sapiro, Guillermo","first_name":"Guillermo"}],"citation":{"short":"Q. Qiu, Z. Chang, M. Draelos, J. Chen, A.M. Bronstein, G. Sapiro, in:, Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare, ICST, 2015.","chicago":"Qiu, Qiang, Zhuoqing Chang, Mark Draelos, Jie Chen, Alex M. Bronstein, and Guillermo Sapiro. “Low-Cost Gaze and Pulse Analysis Using Realsense.” In Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare. ICST, 2015. https://doi.org/10.4108/eai.14-10-2015.2261657.","ista":"Qiu Q, Chang Z, Draelos M, Chen J, Bronstein AM, Sapiro G. 2015. Low-cost gaze and pulse analysis using realsense. Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare. 5th EAI International Conference on Wireless Mobile Communication and Healthcare - Transforming Healthcare through Innovations in Mobile and Wireless Technologies.","mla":"Qiu, Qiang, et al. “Low-Cost Gaze and Pulse Analysis Using Realsense.” Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare, ICST, 2015, doi:10.4108/eai.14-10-2015.2261657.","ama":"Qiu Q, Chang Z, Draelos M, Chen J, Bronstein AM, Sapiro G. Low-cost gaze and pulse analysis using realsense. In: Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare. ICST; 2015. doi:10.4108/eai.14-10-2015.2261657","apa":"Qiu, Q., Chang, Z., Draelos, M., Chen, J., Bronstein, A. M., & Sapiro, G. (2015). Low-cost gaze and pulse analysis using realsense. In Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare. London, United Kingdom: ICST. https://doi.org/10.4108/eai.14-10-2015.2261657","ieee":"Q. Qiu, Z. Chang, M. Draelos, J. Chen, A. M. Bronstein, and G. Sapiro, “Low-cost gaze and pulse analysis using realsense,” in Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare, London, United Kingdom, 2015."},"date_updated":"2024-12-19T13:36:57Z","publication_status":"published","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Intel’s newly-announced low-cost and high precision RealSense 3D (RGBD) camera is becoming ubiquitous in laptops and mobile devices starting this year, opening the door for new applications in the mobile health arena. In this paper, we demonstrate how the Intel RealSense 3D camera can be used for low-cost gaze tracking and passive pulse rate estimation. We develop a novel 3D gaze and fixation tracker based on the eye surface geometry as well as an illumination invariant pulse rate estimation method using near-infrared images captured with RealSense. We achieve a mean error of 1cm at 20 − 30cm for the gaze tracker and 2.26bpm (beats per minute) for pulse estimation, which is adequate in many medical applications, demonstrating the great potential of novel consumer-grade RGBD technology in mobile health."}],"type":"conference","title":"Low-cost gaze and pulse analysis using realsense","day":"22","scopus_import":"1","month":"12","_id":"18439","conference":{"start_date":"2015-10-14","location":"London, United Kingdom","end_date":"2015-10-16","name":"5th EAI International Conference on Wireless Mobile Communication and Healthcare - Transforming Healthcare through Innovations in Mobile and Wireless Technologies"},"publication_identifier":{"isbn":["9781631900884"]},"year":"2015","quality_controlled":"1","publication":"Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare","oa":1,"status":"public","date_created":"2024-10-15T11:20:55Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4108/eai.14-10-2015.2261657"}],"doi":"10.4108/eai.14-10-2015.2261657","date_published":"2015-12-22T00:00:00Z","language":[{"iso":"eng"}],"publisher":"ICST","extern":"1","article_processing_charge":"No"},{"page":"6148-6162","publication_identifier":{"issn":["0962-1083"]},"publication":"Molecular Ecology","quality_controlled":"1","year":"2015","doi":"10.1111/mec.13452","language":[{"iso":"eng"}],"date_published":"2015-12-10T00:00:00Z","publisher":"Wiley","main_file_link":[{"url":"https://doi.org/10.1111/mec.13452","open_access":"1"}],"date_created":"2020-04-30T10:51:01Z","oa":1,"status":"public","article_processing_charge":"No","article_type":"original","extern":"1","author":[{"first_name":"Anna W.","full_name":"Santure, Anna W.","last_name":"Santure"},{"last_name":"Poissant","full_name":"Poissant, Jocelyn","first_name":"Jocelyn"},{"first_name":"Isabelle","last_name":"De Cauwer","full_name":"De Cauwer, Isabelle"},{"first_name":"Kees","last_name":"van Oers","full_name":"van Oers, Kees"},{"first_name":"Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","orcid":"0000-0001-8982-8813","last_name":"Robinson","full_name":"Robinson, Matthew Richard"},{"last_name":"Quinn","full_name":"Quinn, John L.","first_name":"John L."},{"full_name":"Groenen, Martien A. M.","last_name":"Groenen","first_name":"Martien A. M."},{"first_name":"Marcel E.","full_name":"Visser, Marcel E.","last_name":"Visser"},{"full_name":"Sheldon, Ben C.","last_name":"Sheldon","first_name":"Ben C."},{"first_name":"Jon","full_name":"Slate, Jon","last_name":"Slate"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Currently, there is much debate on the genetic architecture of quantitative traits in wild populations. Is trait variation influenced by many genes of small effect or by a few genes of major effect? Where is additive genetic variation located in the genome? Do the same loci cause similar phenotypic variation in different populations? Great tits (Parus major) have been studied extensively in long‐term studies across Europe and consequently are considered an ecological ‘model organism’. Recently, genomic resources have been developed for the great tit, including a custom SNP chip and genetic linkage map. In this study, we used a suite of approaches to investigate the genetic architecture of eight quantitative traits in two long‐term study populations of great tits—one in the Netherlands and the other in the United Kingdom. Overall, we found little evidence for the presence of genes of large effects in either population. Instead, traits appeared to be influenced by many genes of small effect, with conservative estimates of the number of contributing loci ranging from 31 to 310. Despite concordance between population‐specific heritabilities, we found no evidence for the presence of loci having similar effects in both populations. While population‐specific genetic architectures are possible, an undetected shared architecture cannot be rejected because of limited power to map loci of small and moderate effects. This study is one of few examples of genetic architecture analysis in replicated wild populations and highlights some of the challenges and limitations researchers will face when attempting similar molecular quantitative genetic studies in free‐living populations."}],"type":"journal_article","volume":24,"oa_version":"Published Version","publication_status":"published","citation":{"ista":"Santure AW, Poissant J, De Cauwer I, van Oers K, Robinson MR, Quinn JL, Groenen MAM, Visser ME, Sheldon BC, Slate J. 2015. Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations. Molecular Ecology. 24, 6148–6162.","chicago":"Santure, Anna W., Jocelyn Poissant, Isabelle De Cauwer, Kees van Oers, Matthew Richard Robinson, John L. Quinn, Martien A. M. Groenen, Marcel E. Visser, Ben C. Sheldon, and Jon Slate. “Replicated Analysis of the Genetic Architecture of Quantitative Traits in Two Wild Great Tit Populations.” Molecular Ecology. Wiley, 2015. https://doi.org/10.1111/mec.13452.","mla":"Santure, Anna W., et al. “Replicated Analysis of the Genetic Architecture of Quantitative Traits in Two Wild Great Tit Populations.” Molecular Ecology, vol. 24, Wiley, 2015, pp. 6148–62, doi:10.1111/mec.13452.","short":"A.W. Santure, J. Poissant, I. De Cauwer, K. van Oers, M.R. Robinson, J.L. Quinn, M.A.M. Groenen, M.E. Visser, B.C. Sheldon, J. Slate, Molecular Ecology 24 (2015) 6148–6162.","ieee":"A. W. Santure et al., “Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations,” Molecular Ecology, vol. 24. Wiley, pp. 6148–6162, 2015.","ama":"Santure AW, Poissant J, De Cauwer I, et al. Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations. Molecular Ecology. 2015;24:6148-6162. doi:10.1111/mec.13452","apa":"Santure, A. W., Poissant, J., De Cauwer, I., van Oers, K., Robinson, M. R., Quinn, J. L., … Slate, J. (2015). Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations. Molecular Ecology. Wiley. https://doi.org/10.1111/mec.13452"},"date_updated":"2021-01-12T08:15:12Z","intvolume":" 24","day":"10","month":"12","title":"Replicated analysis of the genetic architecture of quantitative traits in two wild great tit populations","_id":"7739"},{"date_updated":"2021-01-12T08:15:12Z","intvolume":" 282","oa_version":"Published Version","article_number":"20150689","abstract":[{"lang":"eng","text":"Phenotypes expressed in a social context are not only a function of the individual, but can also be shaped by the phenotypes of social partners. These social effects may play a major role in the evolution of cooperative breeding if social partners differ in the quality of care they provide and if individual carers adjust their effort in relation to that of other carers. When applying social effects models to wild study systems, it is also important to explore sources of individual plasticity that could masquerade as social effects. We studied offspring provisioning rates of parents and helpers in a wild population of long-tailed tits Aegithalos caudatus using a quantitative genetic framework to identify these social effects and partition them into genetic, permanent environment and current environment components. Controlling for other effects, individuals were consistent in their provisioning effort at a given nest, but adjusted their effort based on who was in their social group, indicating the presence of social effects. However, these social effects differed between years and social contexts, indicating a current environment effect, rather than indicating a genetic or permanent environment effect. While this study reveals the importance of examining environmental and genetic sources of social effects, the framework we present is entirely general, enabling a greater understanding of potentially important social effects within any ecological population."}],"author":[{"full_name":"Adams, Mark James","last_name":"Adams","first_name":"Mark James"},{"id":"E5D42276-F5DA-11E9-8E24-6303E6697425","first_name":"Matthew Richard","orcid":"0000-0001-8982-8813","last_name":"Robinson","full_name":"Robinson, Matthew Richard"},{"last_name":"Mannarelli","full_name":"Mannarelli, Maria-Elena","first_name":"Maria-Elena"},{"first_name":"Ben J.","full_name":"Hatchwell, Ben J.","last_name":"Hatchwell"}],"title":"Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird","day":"07","publication":"Proceedings of the Royal Society B: Biological Sciences","publication_identifier":{"issn":["0962-8452","1471-2954"]},"article_processing_charge":"No","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1098/rspb.2015.0689"}],"date_created":"2020-04-30T10:58:07Z","citation":{"apa":"Adams, M. J., Robinson, M. R., Mannarelli, M.-E., & Hatchwell, B. J. (2015). Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird. Proceedings of the Royal Society B: Biological Sciences. The Royal Society. https://doi.org/10.1098/rspb.2015.0689","ama":"Adams MJ, Robinson MR, Mannarelli M-E, Hatchwell BJ. Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird. Proceedings of the Royal Society B: Biological Sciences. 2015;282(1810). doi:10.1098/rspb.2015.0689","ieee":"M. J. Adams, M. R. Robinson, M.-E. Mannarelli, and B. J. Hatchwell, “Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird,” Proceedings of the Royal Society B: Biological Sciences, vol. 282, no. 1810. The Royal Society, 2015.","short":"M.J. Adams, M.R. Robinson, M.-E. Mannarelli, B.J. Hatchwell, Proceedings of the Royal Society B: Biological Sciences 282 (2015).","chicago":"Adams, Mark James, Matthew Richard Robinson, Maria-Elena Mannarelli, and Ben J. Hatchwell. “Social Genetic and Social Environment Effects on Parental and Helper Care in a Cooperatively Breeding Bird.” Proceedings of the Royal Society B: Biological Sciences. The Royal Society, 2015. https://doi.org/10.1098/rspb.2015.0689.","mla":"Adams, Mark James, et al. “Social Genetic and Social Environment Effects on Parental and Helper Care in a Cooperatively Breeding Bird.” Proceedings of the Royal Society B: Biological Sciences, vol. 282, no. 1810, 20150689, The Royal Society, 2015, doi:10.1098/rspb.2015.0689.","ista":"Adams MJ, Robinson MR, Mannarelli M-E, Hatchwell BJ. 2015. Social genetic and social environment effects on parental and helper care in a cooperatively breeding bird. Proceedings of the Royal Society B: Biological Sciences. 282(1810), 20150689."},"publication_status":"published","type":"journal_article","volume":282,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7741","month":"07","pmid":1,"year":"2015","quality_controlled":"1","external_id":{"pmid":["26063846"]},"extern":"1","article_type":"original","oa":1,"issue":"1810","language":[{"iso":"eng"}],"date_published":"2015-07-07T00:00:00Z","publisher":"The Royal Society","doi":"10.1098/rspb.2015.0689"},{"date_created":"2020-04-30T10:58:23Z","status":"public","publisher":"Springer Nature","language":[{"iso":"eng"}],"doi":"10.1038/ng.3401","date_published":"2015-09-14T00:00:00Z","issue":"11","article_type":"original","extern":"1","article_processing_charge":"No","page":"1357-1362","publication_identifier":{"issn":["1061-4036","1546-1718"]},"quality_controlled":"1","year":"2015","publication":"Nature Genetics","title":"Population genetic differentiation of height and body mass index across Europe","day":"14","month":"09","_id":"7742","author":[{"orcid":"0000-0001-8982-8813","first_name":"Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","full_name":"Robinson, Matthew Richard","last_name":"Robinson"},{"full_name":"Hemani, Gibran","last_name":"Hemani","first_name":"Gibran"},{"first_name":"Carolina","last_name":"Medina-Gomez","full_name":"Medina-Gomez, Carolina"},{"full_name":"Mezzavilla, Massimo","last_name":"Mezzavilla","first_name":"Massimo"},{"full_name":"Esko, Tonu","last_name":"Esko","first_name":"Tonu"},{"last_name":"Shakhbazov","full_name":"Shakhbazov, Konstantin","first_name":"Konstantin"},{"first_name":"Joseph E","full_name":"Powell, Joseph E","last_name":"Powell"},{"first_name":"Anna","last_name":"Vinkhuyzen","full_name":"Vinkhuyzen, Anna"},{"first_name":"Sonja I","last_name":"Berndt","full_name":"Berndt, Sonja I"},{"first_name":"Stefan","full_name":"Gustafsson, Stefan","last_name":"Gustafsson"},{"first_name":"Anne E","last_name":"Justice","full_name":"Justice, Anne E"},{"first_name":"Bratati","last_name":"Kahali","full_name":"Kahali, Bratati"},{"last_name":"Locke","full_name":"Locke, Adam E","first_name":"Adam E"},{"first_name":"Tune H","full_name":"Pers, Tune H","last_name":"Pers"},{"full_name":"Vedantam, Sailaja","last_name":"Vedantam","first_name":"Sailaja"},{"first_name":"Andrew R","last_name":"Wood","full_name":"Wood, Andrew R"},{"last_name":"van Rheenen","full_name":"van Rheenen, Wouter","first_name":"Wouter"},{"first_name":"Ole A","last_name":"Andreassen","full_name":"Andreassen, Ole A"},{"first_name":"Paolo","full_name":"Gasparini, Paolo","last_name":"Gasparini"},{"last_name":"Metspalu","full_name":"Metspalu, Andres","first_name":"Andres"},{"full_name":"Berg, Leonard H van den","last_name":"Berg","first_name":"Leonard H van den"},{"first_name":"Jan H","full_name":"Veldink, Jan H","last_name":"Veldink"},{"full_name":"Rivadeneira, Fernando","last_name":"Rivadeneira","first_name":"Fernando"},{"full_name":"Werge, Thomas M","last_name":"Werge","first_name":"Thomas M"},{"last_name":"Abecasis","full_name":"Abecasis, Goncalo R","first_name":"Goncalo R"},{"last_name":"Boomsma","full_name":"Boomsma, Dorret I","first_name":"Dorret I"},{"first_name":"Daniel I","full_name":"Chasman, Daniel I","last_name":"Chasman"},{"full_name":"de Geus, Eco J C","last_name":"de Geus","first_name":"Eco J C"},{"last_name":"Frayling","full_name":"Frayling, Timothy M","first_name":"Timothy M"},{"last_name":"Hirschhorn","full_name":"Hirschhorn, Joel N","first_name":"Joel N"},{"last_name":"Hottenga","full_name":"Hottenga, Jouke Jan","first_name":"Jouke Jan"},{"first_name":"Erik","last_name":"Ingelsson","full_name":"Ingelsson, Erik"},{"first_name":"Ruth J F","full_name":"Loos, Ruth J F","last_name":"Loos"},{"first_name":"Patrik K E","full_name":"Magnusson, Patrik K E","last_name":"Magnusson"},{"full_name":"Martin, Nicholas G","last_name":"Martin","first_name":"Nicholas G"},{"full_name":"Montgomery, Grant W","last_name":"Montgomery","first_name":"Grant W"},{"first_name":"Kari E","last_name":"North","full_name":"North, Kari E"},{"first_name":"Nancy L","full_name":"Pedersen, Nancy L","last_name":"Pedersen"},{"first_name":"Timothy D","last_name":"Spector","full_name":"Spector, Timothy D"},{"first_name":"Elizabeth K","full_name":"Speliotes, Elizabeth K","last_name":"Speliotes"},{"first_name":"Michael E","full_name":"Goddard, Michael E","last_name":"Goddard"},{"last_name":"Yang","full_name":"Yang, Jian","first_name":"Jian"},{"last_name":"Visscher","full_name":"Visscher, Peter M","first_name":"Peter M"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","oa_version":"None","intvolume":" 47","citation":{"ama":"Robinson MR, Hemani G, Medina-Gomez C, et al. Population genetic differentiation of height and body mass index across Europe. Nature Genetics. 2015;47(11):1357-1362. doi:10.1038/ng.3401","apa":"Robinson, M. R., Hemani, G., Medina-Gomez, C., Mezzavilla, M., Esko, T., Shakhbazov, K., … Visscher, P. M. (2015). Population genetic differentiation of height and body mass index across Europe. Nature Genetics. Springer Nature. https://doi.org/10.1038/ng.3401","ieee":"M. R. Robinson et al., “Population genetic differentiation of height and body mass index across Europe,” Nature Genetics, vol. 47, no. 11. Springer Nature, pp. 1357–1362, 2015.","short":"M.R. Robinson, G. Hemani, C. Medina-Gomez, M. Mezzavilla, T. Esko, K. Shakhbazov, J.E. Powell, A. Vinkhuyzen, S.I. Berndt, S. Gustafsson, A.E. Justice, B. Kahali, A.E. Locke, T.H. Pers, S. Vedantam, A.R. Wood, W. van Rheenen, O.A. Andreassen, P. Gasparini, A. Metspalu, L.H. van den Berg, J.H. Veldink, F. Rivadeneira, T.M. Werge, G.R. Abecasis, D.I. Boomsma, D.I. Chasman, E.J.C. de Geus, T.M. Frayling, J.N. Hirschhorn, J.J. Hottenga, E. Ingelsson, R.J.F. Loos, P.K.E. Magnusson, N.G. Martin, G.W. Montgomery, K.E. North, N.L. Pedersen, T.D. Spector, E.K. Speliotes, M.E. Goddard, J. Yang, P.M. Visscher, Nature Genetics 47 (2015) 1357–1362.","mla":"Robinson, Matthew Richard, et al. “Population Genetic Differentiation of Height and Body Mass Index across Europe.” Nature Genetics, vol. 47, no. 11, Springer Nature, 2015, pp. 1357–62, doi:10.1038/ng.3401.","chicago":"Robinson, Matthew Richard, Gibran Hemani, Carolina Medina-Gomez, Massimo Mezzavilla, Tonu Esko, Konstantin Shakhbazov, Joseph E Powell, et al. “Population Genetic Differentiation of Height and Body Mass Index across Europe.” Nature Genetics. Springer Nature, 2015. https://doi.org/10.1038/ng.3401.","ista":"Robinson MR, Hemani G, Medina-Gomez C, Mezzavilla M, Esko T, Shakhbazov K, Powell JE, Vinkhuyzen A, Berndt SI, Gustafsson S, Justice AE, Kahali B, Locke AE, Pers TH, Vedantam S, Wood AR, van Rheenen W, Andreassen OA, Gasparini P, Metspalu A, Berg LH van den, Veldink JH, Rivadeneira F, Werge TM, Abecasis GR, Boomsma DI, Chasman DI, de Geus EJC, Frayling TM, Hirschhorn JN, Hottenga JJ, Ingelsson E, Loos RJF, Magnusson PKE, Martin NG, Montgomery GW, North KE, Pedersen NL, Spector TD, Speliotes EK, Goddard ME, Yang J, Visscher PM. 2015. Population genetic differentiation of height and body mass index across Europe. Nature Genetics. 47(11), 1357–1362."},"date_updated":"2021-01-12T08:15:13Z","type":"journal_article","volume":47,"abstract":[{"text":"Across-nation differences in the mean values for complex traits are common1,2,3,4,5,6,7,8, but the reasons for these differences are unknown. Here we find that many independent loci contribute to population genetic differences in height and body mass index (BMI) in 9,416 individuals across 14 European countries. Using discovery data on over 250,000 individuals and unbiased effect size estimates from 17,500 sibling pairs, we estimate that 24% (95% credible interval (CI) = 9%, 41%) and 8% (95% CI = 4%, 16%) of the captured additive genetic variance for height and BMI, respectively, reflect population genetic differences. Population genetic divergence differed significantly from that in a null model (height, P < 3.94 × 10−8; BMI, P < 5.95 × 10−4), and we find an among-population genetic correlation for tall and slender individuals (r = −0.80, 95% CI = −0.95, −0.60), consistent with correlated selection for both phenotypes. Observed differences in height among populations reflected the predicted genetic means (r = 0.51; P < 0.001), but environmental differences across Europe masked genetic differentiation for BMI (P < 0.58).","lang":"eng"}]},{"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"},{"first_name":"Justin","full_name":"Kopinsky, Justin","last_name":"Kopinsky"},{"first_name":"Jerry","full_name":"Li, Jerry","last_name":"Li"},{"first_name":"Nir","full_name":"Shavit, Nir","last_name":"Shavit"}],"type":"conference","abstract":[{"text":"High-performance concurrent priority queues are essential for applications such as task scheduling and discrete event simulation. Unfortunately, even the best performing implementations do not scale past a number of threads in the single digits. This is because of the sequential bottleneck in accessing the elements at the head of the queue in order to perform a DeleteMin operation. In this paper, we present the SprayList, a scalable priority queue with relaxed ordering semantics. Starting from a non-blocking SkipList, the main innovation behind our design is that the DeleteMin operations avoid a sequential bottleneck by "spraying" themselves onto the head of the SkipList list in a coordinated fashion. The spraying is implemented using a carefully designed random walk, so that DeleteMin returns an element among the first O(plog3p) in the list, with high probability, where p is the number of threads. We prove that the running time of a DeleteMin operation is O(log3p), with high probability, independent of the size of the list. Our experiments show that the relaxed semantics allow the data structure to scale for high thread counts, comparable to a classic unordered SkipList. Furthermore, we observe that, for reasonably parallel workloads, the scalability benefits of relaxation considerably outweigh the additional work due to out-of-order execution.","lang":"eng"}],"citation":{"chicago":"Alistarh, Dan-Adrian, Justin Kopinsky, Jerry Li, and Nir Shavit. “The SprayList: A Scalable Relaxed Priority Queue.” In Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 11–20. ACM, 2015. https://doi.org/10.1145/2688500.2688523.","mla":"Alistarh, Dan-Adrian, et al. “The SprayList: A Scalable Relaxed Priority Queue.” Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, ACM, 2015, pp. 11–20, doi:10.1145/2688500.2688523.","ista":"Alistarh D-A, Kopinsky J, Li J, Shavit N. 2015. The SprayList: A scalable relaxed priority queue. Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP: Principles and Practice of Parallel Pogramming, 11–20.","short":"D.-A. Alistarh, J. Kopinsky, J. Li, N. Shavit, in:, Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, ACM, 2015, pp. 11–20.","apa":"Alistarh, D.-A., Kopinsky, J., Li, J., & Shavit, N. (2015). The SprayList: A scalable relaxed priority queue. In Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 11–20). San Francisco, CA, United States: ACM. https://doi.org/10.1145/2688500.2688523","ama":"Alistarh D-A, Kopinsky J, Li J, Shavit N. The SprayList: A scalable relaxed priority queue. In: Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. ACM; 2015:11-20. doi:10.1145/2688500.2688523","ieee":"D.-A. Alistarh, J. Kopinsky, J. Li, and N. Shavit, “The SprayList: A scalable relaxed priority queue,” in Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Francisco, CA, United States, 2015, pp. 11–20."},"date_updated":"2026-05-18T12:40:58Z","publication_status":"published","oa_version":"None","month":"01","scopus_import":"1","day":"24","publist_id":"6878","title":"The SprayList: A scalable relaxed priority queue","_id":"776","OA_type":"closed access","publication_identifier":{"isbn":["9781450332057"]},"page":"11 - 20","conference":{"end_date":"2015-02-11","name":"PPoPP: Principles and Practice of Parallel Pogramming","start_date":"2015-02-07","location":"San Francisco, CA, United States"},"publication":"Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","year":"2015","quality_controlled":"1","acknowledgement":"Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and the Oracle\r\nand Intel corporations.","publisher":"ACM","doi":"10.1145/2688500.2688523","date_published":"2015-01-24T00:00:00Z","language":[{"iso":"eng"}],"status":"public","date_created":"2018-12-11T11:48:26Z","article_processing_charge":"No","extern":"1"},{"_id":"7765","month":"06","day":"04","title":"The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior","abstract":[{"text":"We introduce a principle unique to disordered solids wherein the contribution of any bond to one global perturbation is uncorrelated with its contribution to another. Coupled with sufficient variability in the contributions of different bonds, this “independent bond-level response” paves the way for the design of real materials with unusual and exquisitely tuned properties. To illustrate this, we choose two global perturbations: compression and shear. By applying a bond removal procedure that is both simple and experimentally relevant to remove a very small fraction of bonds, we can drive disordered spring networks to both the incompressible and completely auxetic limits of mechanical behavior.","lang":"eng"}],"volume":114,"type":"journal_article","article_number":"225501","publication_status":"published","oa_version":"None","citation":{"ama":"Goodrich CP, Liu AJ, Nagel SR. The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior. Physical Review Letters. 2015;114(22). doi:10.1103/physrevlett.114.225501","apa":"Goodrich, C. P., Liu, A. J., & Nagel, S. R. (2015). The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior. Physical Review Letters. American Physical Society. https://doi.org/10.1103/physrevlett.114.225501","ieee":"C. P. Goodrich, A. J. Liu, and S. R. Nagel, “The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior,” Physical Review Letters, vol. 114, no. 22. American Physical Society, 2015.","short":"C.P. Goodrich, A.J. Liu, S.R. Nagel, Physical Review Letters 114 (2015).","chicago":"Goodrich, Carl Peter, Andrea J. Liu, and Sidney R. Nagel. “The Principle of Independent Bond-Level Response: Tuning by Pruning to Exploit Disorder for Global Behavior.” Physical Review Letters. American Physical Society, 2015. https://doi.org/10.1103/physrevlett.114.225501.","ista":"Goodrich CP, Liu AJ, Nagel SR. 2015. The principle of independent bond-level response: Tuning by pruning to exploit disorder for global behavior. Physical Review Letters. 114(22), 225501.","mla":"Goodrich, Carl Peter, et al. “The Principle of Independent Bond-Level Response: Tuning by Pruning to Exploit Disorder for Global Behavior.” Physical Review Letters, vol. 114, no. 22, 225501, American Physical Society, 2015, doi:10.1103/physrevlett.114.225501."},"date_updated":"2021-01-12T08:15:23Z","intvolume":" 114","author":[{"orcid":"0000-0002-1307-5074","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","first_name":"Carl Peter","full_name":"Goodrich, Carl Peter","last_name":"Goodrich"},{"full_name":"Liu, Andrea J.","last_name":"Liu","first_name":"Andrea J."},{"full_name":"Nagel, Sidney R.","last_name":"Nagel","first_name":"Sidney R."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","article_type":"original","extern":"1","publisher":"American Physical Society","language":[{"iso":"eng"}],"date_published":"2015-06-04T00:00:00Z","doi":"10.1103/physrevlett.114.225501","issue":"22","date_created":"2020-04-30T11:41:08Z","status":"public","publication":"Physical Review Letters","quality_controlled":"1","year":"2015","publication_identifier":{"issn":["0031-9007","1079-7114"]}},{"title":"Disordered surface vibrations in jammed sphere packings","month":"02","day":"15","_id":"7766","author":[{"full_name":"Sussman, Daniel M.","last_name":"Sussman","first_name":"Daniel M."},{"full_name":"Goodrich, Carl Peter","last_name":"Goodrich","orcid":"0000-0002-1307-5074","first_name":"Carl Peter","id":"EB352CD2-F68A-11E9-89C5-A432E6697425"},{"first_name":"Andrea J.","last_name":"Liu","full_name":"Liu, Andrea J."},{"last_name":"Nagel","full_name":"Nagel, Sidney R.","first_name":"Sidney R."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","oa_version":"None","intvolume":" 11","date_updated":"2021-01-12T08:15:23Z","citation":{"apa":"Sussman, D. M., Goodrich, C. P., Liu, A. J., & Nagel, S. R. (2015). Disordered surface vibrations in jammed sphere packings. Soft Matter. Royal Society of Chemistry. https://doi.org/10.1039/c4sm02905d","ama":"Sussman DM, Goodrich CP, Liu AJ, Nagel SR. Disordered surface vibrations in jammed sphere packings. Soft Matter. 2015;11(14):2745-2751. doi:10.1039/c4sm02905d","ieee":"D. M. Sussman, C. P. Goodrich, A. J. Liu, and S. R. Nagel, “Disordered surface vibrations in jammed sphere packings,” Soft Matter, vol. 11, no. 14. Royal Society of Chemistry, pp. 2745–2751, 2015.","short":"D.M. Sussman, C.P. Goodrich, A.J. Liu, S.R. Nagel, Soft Matter 11 (2015) 2745–2751.","mla":"Sussman, Daniel M., et al. “Disordered Surface Vibrations in Jammed Sphere Packings.” Soft Matter, vol. 11, no. 14, Royal Society of Chemistry, 2015, pp. 2745–51, doi:10.1039/c4sm02905d.","ista":"Sussman DM, Goodrich CP, Liu AJ, Nagel SR. 2015. Disordered surface vibrations in jammed sphere packings. Soft Matter. 11(14), 2745–2751.","chicago":"Sussman, Daniel M., Carl Peter Goodrich, Andrea J. Liu, and Sidney R. Nagel. “Disordered Surface Vibrations in Jammed Sphere Packings.” Soft Matter. Royal Society of Chemistry, 2015. https://doi.org/10.1039/c4sm02905d."},"abstract":[{"lang":"eng","text":"We study the vibrational properties near a free surface of disordered spring networks derived from jammed sphere packings. In bulk systems, without surfaces, it is well understood that such systems have a plateau in the density of vibrational modes extending down to a frequency scale ω*. This frequency is controlled by ΔZ = 〈Z〉 − 2d, the difference between the average coordination of the spheres and twice the spatial dimension, d, of the system, which vanishes at the jamming transition. In the presence of a free surface we find that there is a density of disordered vibrational modes associated with the surface that extends far below ω*. The total number of these low-frequency surface modes is controlled by ΔZ, and the profile of their decay into the bulk has two characteristic length scales, which diverge as ΔZ−1/2 and ΔZ−1 as the jamming transition is approached."}],"type":"journal_article","volume":11,"date_created":"2020-04-30T11:41:23Z","status":"public","publisher":"Royal Society of Chemistry","doi":"10.1039/c4sm02905d","language":[{"iso":"eng"}],"date_published":"2015-02-15T00:00:00Z","issue":"14","article_type":"original","extern":"1","article_processing_charge":"No","page":"2745-2751","publication_identifier":{"issn":["1744-683X","1744-6848"]},"quality_controlled":"1","year":"2015","publication":"Soft Matter"},{"publication_status":"published","article_number":"032706","oa_version":"None","intvolume":" 91","date_updated":"2021-01-12T08:15:24Z","citation":{"apa":"van Drongelen, R., Pal, A., Goodrich, C. P., & Idema, T. (2015). Collective dynamics of soft active particles. Physical Review E. American Physical Society. https://doi.org/10.1103/physreve.91.032706","ama":"van Drongelen R, Pal A, Goodrich CP, Idema T. Collective dynamics of soft active particles. Physical Review E. 2015;91(3). doi:10.1103/physreve.91.032706","ieee":"R. van Drongelen, A. Pal, C. P. Goodrich, and T. Idema, “Collective dynamics of soft active particles,” Physical Review E, vol. 91, no. 3. American Physical Society, 2015.","ista":"van Drongelen R, Pal A, Goodrich CP, Idema T. 2015. Collective dynamics of soft active particles. Physical Review E. 91(3), 032706.","mla":"van Drongelen, Ruben, et al. “Collective Dynamics of Soft Active Particles.” Physical Review E, vol. 91, no. 3, 032706, American Physical Society, 2015, doi:10.1103/physreve.91.032706.","chicago":"Drongelen, Ruben van, Anshuman Pal, Carl Peter Goodrich, and Timon Idema. “Collective Dynamics of Soft Active Particles.” Physical Review E. American Physical Society, 2015. https://doi.org/10.1103/physreve.91.032706.","short":"R. van Drongelen, A. Pal, C.P. Goodrich, T. Idema, Physical Review E 91 (2015)."},"abstract":[{"lang":"eng","text":"We present a model of soft active particles that leads to a rich array of collective behavior found also in dense biological swarms of bacteria and other unicellular organisms. Our model uses only local interactions, such as Vicsek-type nearest-neighbor alignment, short-range repulsion, and a local boundary term. Changing the relative strength of these interactions leads to migrating swarms, rotating swarms, and jammed swarms, as well as swarms that exhibit run-and-tumble motion, alternating between migration and either rotating or jammed states. Interestingly, although a migrating swarm moves slower than an individual particle, the diffusion constant can be up to three orders of magnitude larger, suggesting that collective motion can be highly advantageous, for example, when searching for food."}],"volume":91,"type":"journal_article","author":[{"first_name":"Ruben","full_name":"van Drongelen, Ruben","last_name":"van Drongelen"},{"first_name":"Anshuman","full_name":"Pal, Anshuman","last_name":"Pal"},{"orcid":"0000-0002-1307-5074","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","first_name":"Carl Peter","full_name":"Goodrich, Carl Peter","last_name":"Goodrich"},{"first_name":"Timon","full_name":"Idema, Timon","last_name":"Idema"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"7767","title":"Collective dynamics of soft active particles","day":"01","month":"03","quality_controlled":"1","year":"2015","publication":"Physical Review E","publication_identifier":{"issn":["1539-3755","1550-2376"]},"article_type":"original","extern":"1","article_processing_charge":"No","date_created":"2020-04-30T11:41:38Z","status":"public","publisher":"American Physical Society","language":[{"iso":"eng"}],"date_published":"2015-03-01T00:00:00Z","doi":"10.1103/physreve.91.032706","issue":"3"},{"_id":"777","publist_id":"6879","title":"Streaming min-max hypergraph partitioning","day":"01","month":"01","citation":{"ama":"Alistarh D-A, Iglesias J, Vojnović M. Streaming min-max hypergraph partitioning. In: Vol 2015-January. Neural Information Processing Systems; 2015:1900-1908.","apa":"Alistarh, D.-A., Iglesias, J., & Vojnović, M. (2015). Streaming min-max hypergraph partitioning (Vol. 2015–January, pp. 1900–1908). Presented at the NIPS: Neural Information Processing Systems, Montréal, Canada: Neural Information Processing Systems.","ieee":"D.-A. Alistarh, J. Iglesias, and M. Vojnović, “Streaming min-max hypergraph partitioning,” presented at the NIPS: Neural Information Processing Systems, Montréal, Canada, 2015, vol. 2015–January, pp. 1900–1908.","ista":"Alistarh D-A, Iglesias J, Vojnović M. 2015. Streaming min-max hypergraph partitioning. NIPS: Neural Information Processing Systems vol. 2015–January, 1900–1908.","mla":"Alistarh, Dan-Adrian, et al. Streaming Min-Max Hypergraph Partitioning. Vol. 2015–January, Neural Information Processing Systems, 2015, pp. 1900–08.","chicago":"Alistarh, Dan-Adrian, Jennifer Iglesias, and Milan Vojnović. “Streaming Min-Max Hypergraph Partitioning,” 2015–January:1900–1908. Neural Information Processing Systems, 2015.","short":"D.-A. Alistarh, J. Iglesias, M. Vojnović, in:, Neural Information Processing Systems, 2015, pp. 1900–1908."},"date_updated":"2026-05-19T08:39:02Z","publication_status":"published","oa_version":"None","type":"conference","volume":"2015-January","abstract":[{"lang":"eng","text":"In many applications, the data is of rich structure that can be represented by a hypergraph, where the data items are represented by vertices and the associations among items are represented by hyperedges. Equivalently, we are given an input bipartite graph with two types of vertices: items, and associations (which we refer to as topics). We consider the problem of partitioning the set of items into a given number of components such that the maximum number of topics covered by a component is minimized. This is a clustering problem with various applications, e.g. partitioning of a set of information objects such as documents, images, and videos, and load balancing in the context of modern computation platforms.Inthis paper, we focus on the streaming computation model for this problem, in which items arrive online one at a time and each item must be assigned irrevocably to a component at its arrival time. Motivated by scalability requirements, we focus on the class of streaming computation algorithms with memory limited to be at most linear in the number of components. We show that a greedy assignment strategy is able to recover a hidden co-clustering of items under a natural set of recovery conditions. We also report results of an extensive empirical evaluation, which demonstrate that this greedy strategy yields superior performance when compared with alternative approaches."}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"},{"first_name":"Jennifer","full_name":"Iglesias, Jennifer","last_name":"Iglesias"},{"full_name":"Vojnović, Milan","last_name":"Vojnović","first_name":"Milan"}],"extern":"1","article_processing_charge":"No","status":"public","main_file_link":[{"url":"http://papers.nips.cc/paper/5897-streaming-min-max-hypergraph-partitioning"}],"date_created":"2018-12-11T11:48:27Z","date_published":"2015-01-01T00:00:00Z","publisher":"Neural Information Processing Systems","language":[{"iso":"eng"}],"year":"2015","conference":{"location":"Montréal, Canada","start_date":"2015-12-07","end_date":"2015-12-12","name":"NIPS: Neural Information Processing Systems"},"publication_identifier":{"isbn":["9781510825024"]},"page":"1900 - 1908"},{"year":"2015","publication":"arXiv","external_id":{"arxiv":["1510.08820"]},"extern":"1","article_processing_charge":"No","date_created":"2020-04-30T12:16:18Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1510.08820"}],"status":"public","oa":1,"language":[{"iso":"eng"}],"doi":"10.48550/arXiv.1510.08820","date_published":"2015-10-29T00:00:00Z","publication_status":"submitted","oa_version":"Preprint","article_number":"1510.08820","date_updated":"2025-06-26T10:26:40Z","citation":{"ieee":"C. P. Goodrich, “Unearthing the anticrystal: Criticality in the linear response of disordered solids,” arXiv. .","ama":"Goodrich CP. Unearthing the anticrystal: Criticality in the linear response of disordered solids. arXiv. doi:10.48550/arXiv.1510.08820","apa":"Goodrich, C. P. (n.d.). Unearthing the anticrystal: Criticality in the linear response of disordered solids. arXiv. https://doi.org/10.48550/arXiv.1510.08820","short":"C.P. Goodrich, ArXiv (n.d.).","ista":"Goodrich CP. Unearthing the anticrystal: Criticality in the linear response of disordered solids. arXiv, 1510.08820.","chicago":"Goodrich, Carl Peter. “Unearthing the Anticrystal: Criticality in the Linear Response of Disordered Solids.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1510.08820.","mla":"Goodrich, Carl Peter. “Unearthing the Anticrystal: Criticality in the Linear Response of Disordered Solids.” ArXiv, 1510.08820, doi:10.48550/arXiv.1510.08820."},"type":"preprint","abstract":[{"lang":"eng","text":"The fact that a disordered material is not constrained in its properties in\r\nthe same way as a crystal presents significant and yet largely untapped\r\npotential for novel material design. However, unlike their crystalline\r\ncounterparts, disordered solids are not well understood. One of the primary\r\nobstacles is the lack of a theoretical framework for thinking about disorder\r\nand its relation to mechanical properties. To this end, we study an idealized\r\nsystem of frictionless athermal soft spheres that, when compressed, undergoes a\r\njamming phase transition with diverging length scales and clean power-law\r\nsignatures. This critical point is the cornerstone of a much larger \"jamming\r\nscenario\" that has the potential to provide the essential theoretical\r\nfoundation necessary for a unified understanding of the mechanics of disordered\r\nsolids. We begin by showing that jammed sphere packings have a valid linear\r\nregime despite the presence of \"contact nonlinearities.\" We then investigate\r\nthe critical nature of the transition, focusing on diverging length scales and\r\nfinite-size effects. Next, we argue that jamming plays the same role for\r\ndisordered solids as the perfect crystal plays for crystalline solids. Not only\r\ncan it be considered an idealized starting point for understanding disordered\r\nmaterials, but it can even influence systems that have a relatively high amount\r\nof crystalline order. The behavior of solids can thus be thought of as existing\r\non a spectrum, with the perfect crystal and the jamming transition at opposing\r\nends. Finally, we introduce a new principle wherein the contribution of an\r\nindividual bond to one global property is independent of its contribution to\r\nanother. This principle allows the different global responses of a disordered\r\nsystem to be manipulated independently and provides a great deal of flexibility\r\nin designing materials with unique, textured and tunable properties."}],"author":[{"id":"EB352CD2-F68A-11E9-89C5-A432E6697425","first_name":"Carl Peter","orcid":"0000-0002-1307-5074","last_name":"Goodrich","full_name":"Goodrich, Carl Peter"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"green","_id":"7779","title":"Unearthing the anticrystal: Criticality in the linear response of disordered solids","arxiv":1,"day":"29","month":"10"},{"title":"Inherent limitations of hybrid transactional memory","day":"01","alternative_title":["LNCS"],"author":[{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"},{"first_name":"Justin","full_name":"Kopinsky, Justin","last_name":"Kopinsky"},{"first_name":"Petr","full_name":"Kuznetsov, Petr","last_name":"Kuznetsov"},{"full_name":"Ravi, Srivatsan","last_name":"Ravi","first_name":"Srivatsan"},{"first_name":"Nir","last_name":"Shavit","full_name":"Shavit, Nir"}],"intvolume":" 9363","date_updated":"2023-02-23T13:17:35Z","oa_version":"None","abstract":[{"text":"Several Hybrid Transactional Memory (HyTM) schemes have recently been proposed to complement the fast, but best-effort nature of Hardware Transactional Memory (HTM) with a slow, reliable software backup. However, the costs of providing concurrency between hardware and software transactions in HyTM are still not well understood. In this paper, we propose a general model for HyTM implementations, which captures the ability of hardware transactions to buffer memory accesses. The model allows us to formally quantify and analyze the amount of overhead (instrumentation) caused by the potential presence of software transactions.We prove that (1) it is impossible to build a strictly serializable HyTM implementation that has both uninstrumented reads and writes, even for very weak progress guarantees, and (2) the instrumentation cost incurred by a hardware transaction in any progressive opaque HyTM is linear in the size of the transaction’s data set.We further describe two implementations which exhibit optimal instrumentation costs for two different progress conditions. In sum, this paper proposes the first formal HyTM model and captures for the first time the trade-off between the degree of hardware-software TM concurrency and the amount of instrumentation overhead.","lang":"eng"}],"status":"public","main_file_link":[{"url":"https://arxiv.org/abs/1405.5689","open_access":"1"}],"date_created":"2018-12-11T11:48:27Z","acknowledgement":"P. Kuznetsov-The author is supported by the Agence Nationale de la Recherche, ANR-14-CE35-0010-01, project DISCMAT. N. Shavit-Support is gratfeully acknowledgedfrom the National Science Foundation under grants CCF-1217921, CCF-1201926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and the Oracle and Intel corporations.","article_processing_charge":"No","conference":{"name":"DISC: Distributed Computing"},"publist_id":"6880","arxiv":1,"month":"01","_id":"778","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"D.-A. Alistarh, J. Kopinsky, P. Kuznetsov, S. Ravi, N. Shavit, in:, Springer, 2015, pp. 185–199.","chicago":"Alistarh, Dan-Adrian, Justin Kopinsky, Petr Kuznetsov, Srivatsan Ravi, and Nir Shavit. “Inherent Limitations of Hybrid Transactional Memory,” 9363:185–99. Springer, 2015. https://doi.org/10.1007/978-3-662-48653-5_13.","mla":"Alistarh, Dan-Adrian, et al. Inherent Limitations of Hybrid Transactional Memory. Vol. 9363, Springer, 2015, pp. 185–99, doi:10.1007/978-3-662-48653-5_13.","ista":"Alistarh D-A, Kopinsky J, Kuznetsov P, Ravi S, Shavit N. 2015. Inherent limitations of hybrid transactional memory. DISC: Distributed Computing, LNCS, vol. 9363, 185–199.","ieee":"D.-A. Alistarh, J. Kopinsky, P. Kuznetsov, S. Ravi, and N. Shavit, “Inherent limitations of hybrid transactional memory,” presented at the DISC: Distributed Computing, 2015, vol. 9363, pp. 185–199.","ama":"Alistarh D-A, Kopinsky J, Kuznetsov P, Ravi S, Shavit N. Inherent limitations of hybrid transactional memory. In: Vol 9363. Springer; 2015:185-199. doi:10.1007/978-3-662-48653-5_13","apa":"Alistarh, D.-A., Kopinsky, J., Kuznetsov, P., Ravi, S., & Shavit, N. (2015). Inherent limitations of hybrid transactional memory (Vol. 9363, pp. 185–199). Presented at the DISC: Distributed Computing, Springer. https://doi.org/10.1007/978-3-662-48653-5_13"},"publication_status":"published","type":"conference","volume":9363,"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-48653-5_13","publisher":"Springer","date_published":"2015-01-01T00:00:00Z","extern":"1","external_id":{"arxiv":["1405.5689"]},"page":"185 - 199","year":"2015","quality_controlled":"1"},{"title":"ThreadScan: Automatic and scalable memory reclamation","publist_id":"6876","day":"13","month":"06","_id":"779","author":[{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian"},{"full_name":"Matveev, Alexander","last_name":"Matveev","first_name":"Alexander"},{"full_name":"Leiserson, William","last_name":"Leiserson","first_name":"William"},{"first_name":"Nir","last_name":"Shavit","full_name":"Shavit, Nir"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","publication_status":"published","citation":{"ieee":"D.-A. Alistarh, A. Matveev, W. Leiserson, and N. Shavit, “ThreadScan: Automatic and scalable memory reclamation,” presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, 2015, vol. 2015–June, pp. 123–132.","apa":"Alistarh, D.-A., Matveev, A., Leiserson, W., & Shavit, N. (2015). ThreadScan: Automatic and scalable memory reclamation (Vol. 2015–June, pp. 123–132). Presented at the SPAA: Symposium on Parallelism in Algorithms and Architectures, ACM. https://doi.org/10.1145/2755573.2755600","ama":"Alistarh D-A, Matveev A, Leiserson W, Shavit N. ThreadScan: Automatic and scalable memory reclamation. In: Vol 2015-June. ACM; 2015:123-132. doi:10.1145/2755573.2755600","short":"D.-A. Alistarh, A. Matveev, W. Leiserson, N. Shavit, in:, ACM, 2015, pp. 123–132.","ista":"Alistarh D-A, Matveev A, Leiserson W, Shavit N. 2015. ThreadScan: Automatic and scalable memory reclamation. SPAA: Symposium on Parallelism in Algorithms and Architectures vol. 2015–June, 123–132.","chicago":"Alistarh, Dan-Adrian, Alexander Matveev, William Leiserson, and Nir Shavit. “ThreadScan: Automatic and Scalable Memory Reclamation,” 2015–June:123–32. ACM, 2015. https://doi.org/10.1145/2755573.2755600.","mla":"Alistarh, Dan-Adrian, et al. ThreadScan: Automatic and Scalable Memory Reclamation. Vol. 2015–June, ACM, 2015, pp. 123–32, doi:10.1145/2755573.2755600."},"date_updated":"2023-02-23T12:35:42Z","type":"conference","abstract":[{"lang":"eng","text":"The concurrent memory reclamation problem is that of devising a way for a deallocating thread to verify that no other concurrent threads hold references to a memory block being deallocated. To date, in the absence of automatic garbage collection, there is no satisfactory solution to this problem; existing tracking methods like hazard pointers, reference counters, or epoch-based techniques like RCU, are either prohibitively expensive or require significant programming expertise, to the extent that implementing them efficiently can be worthy of a publication. None of the existing techniques are automatic or even semi-automated. In this paper, we take a new approach to concurrent memory reclamation: instead of manually tracking access to memory locations as done in techniques like hazard pointers, or restricting shared accesses to specific epoch boundaries as in RCU, our algorithm, called ThreadScan, leverages operating system signaling to automatically detect which memory locations are being accessed by concurrent threads. Initial empirical evidence shows that ThreadScan scales surprisingly well and requires negligible programming effort beyond the standard use of Malloc and Free."}],"volume":"2015-June","date_created":"2018-12-11T11:48:27Z","status":"public","doi":"10.1145/2755573.2755600","language":[{"iso":"eng"}],"publisher":"ACM","date_published":"2015-06-13T00:00:00Z","acknowledgement":"Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and the Oracle corporation. In particular, we would like to thank Dave Dice, Alex Kogan, and Mark Moir from the Oracle Scalable Synchronization Research Group for very useful feedback on earlier drafts of this paper.","extern":"1","article_processing_charge":"No","conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures"},"page":"123 - 132","year":"2015","related_material":{"record":[{"status":"public","id":"6001","relation":"later_version"}]}}]