[{"extern":"1","_id":"18415","intvolume":"        37","language":[{"iso":"eng"}],"type":"journal_article","publication_identifier":{"issn":["0162-8828"],"eissn":["1939-3539"]},"publisher":"IEEE","issue":"9","author":[{"full_name":"Sprechmann, P.","first_name":"P.","last_name":"Sprechmann"},{"full_name":"Bronstein, Alexander","first_name":"Alexander","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein"},{"last_name":"Sapiro","full_name":"Sapiro, G.","first_name":"G."}],"quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1212.3631","open_access":"1"}],"external_id":{"pmid":["26353129"],"arxiv":["1212.3631"]},"article_processing_charge":"No","title":"Learning efficient sparse and low rank models","date_created":"2024-10-15T11:20:55Z","publication_status":"published","page":"1821-1833","doi":"10.1109/tpami.2015.2392779","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"}],"citation":{"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. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2015;37(9):1821-1833. doi:<a href=\"https://doi.org/10.1109/tpami.2015.2392779\">10.1109/tpami.2015.2392779</a>","ieee":"P. Sprechmann, A. M. Bronstein, and G. Sapiro, “Learning efficient sparse and low rank models,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 37, no. 9. IEEE, pp. 1821–1833, 2015.","chicago":"Sprechmann, P., Alex M. Bronstein, and G. Sapiro. “Learning Efficient Sparse and Low Rank Models.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/tpami.2015.2392779\">https://doi.org/10.1109/tpami.2015.2392779</a>.","mla":"Sprechmann, P., et al. “Learning Efficient Sparse and Low Rank Models.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 37, no. 9, IEEE, 2015, pp. 1821–33, doi:<a href=\"https://doi.org/10.1109/tpami.2015.2392779\">10.1109/tpami.2015.2392779</a>.","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.","apa":"Sprechmann, P., Bronstein, A. M., &#38; Sapiro, G. (2015). Learning efficient sparse and low rank models. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/tpami.2015.2392779\">https://doi.org/10.1109/tpami.2015.2392779</a>"},"oa_version":"Preprint","pmid":1,"status":"public","month":"09","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","arxiv":1,"date_published":"2015-09-01T00:00:00Z","oa":1,"date_updated":"2024-12-18T11:40:35Z","volume":37,"scopus_import":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2015","day":"01"},{"publication_identifier":{"eissn":["1939-3539"],"issn":["0162-8828"]},"intvolume":"        37","_id":"18416","extern":"1","type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","author":[{"full_name":"Eynard, Davide","first_name":"Davide","last_name":"Eynard"},{"first_name":"Artiom","full_name":"Kovnatsky, Artiom","last_name":"Kovnatsky"},{"full_name":"Bronstein, Michael M.","first_name":"Michael M.","last_name":"Bronstein"},{"last_name":"Glashoff","full_name":"Glashoff, Klaus","first_name":"Klaus"},{"first_name":"Alexander","full_name":"Bronstein, Alexander","last_name":"Bronstein","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"}],"publisher":"IEEE","issue":"12","title":"Multimodal manifold snalysis by simultaneous diagonalization of Laplacians","article_processing_charge":"No","external_id":{"pmid":["26539854"]},"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."}],"doi":"10.1109/tpami.2015.2408348","publication_status":"published","page":"2505-2517","status":"public","month":"12","oa_version":"None","citation":{"mla":"Eynard, Davide, et al. “Multimodal Manifold Snalysis by Simultaneous Diagonalization of Laplacians.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 37, no. 12, IEEE, 2015, pp. 2505–17, doi:<a href=\"https://doi.org/10.1109/tpami.2015.2408348\">10.1109/tpami.2015.2408348</a>.","chicago":"Eynard, Davide, Artiom Kovnatsky, Michael M. Bronstein, Klaus Glashoff, and Alex M. Bronstein. “Multimodal Manifold Snalysis by Simultaneous Diagonalization of Laplacians.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2015. <a href=\"https://doi.org/10.1109/tpami.2015.2408348\">https://doi.org/10.1109/tpami.2015.2408348</a>.","apa":"Eynard, D., Kovnatsky, A., Bronstein, M. M., Glashoff, K., &#38; Bronstein, A. M. (2015). Multimodal manifold snalysis by simultaneous diagonalization of Laplacians. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/tpami.2015.2408348\">https://doi.org/10.1109/tpami.2015.2408348</a>","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.","ama":"Eynard D, Kovnatsky A, Bronstein MM, Glashoff K, Bronstein AM. Multimodal manifold snalysis by simultaneous diagonalization of Laplacians. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2015;37(12):2505-2517. doi:<a href=\"https://doi.org/10.1109/tpami.2015.2408348\">10.1109/tpami.2015.2408348</a>","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.","ieee":"D. Eynard, A. Kovnatsky, M. M. Bronstein, K. Glashoff, and A. M. Bronstein, “Multimodal manifold snalysis by simultaneous diagonalization of Laplacians,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 37, no. 12. IEEE, pp. 2505–2517, 2015."},"pmid":1,"date_updated":"2024-12-12T14:08:46Z","volume":37,"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","date_published":"2015-12-01T00:00:00Z","year":"2015","day":"01","scopus_import":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","day":"01","year":"2015","oa":1,"date_published":"2015-02-01T00:00:00Z","arxiv":1,"publication":"Computer Graphics Forum","volume":34,"date_updated":"2024-12-19T10:12:48Z","oa_version":"Preprint","citation":{"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.","apa":"Korman, S., Litman, R., Avidan, S., &#38; Bronstein, A. M. (2015). Probably approximately symmetric: Fast rigid symmetry detection with global guarantees. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.12454\">https://doi.org/10.1111/cgf.12454</a>","chicago":"Korman, Simon, Roee Litman, Shai Avidan, and Alex M. Bronstein. “Probably Approximately Symmetric: Fast Rigid Symmetry Detection with Global Guarantees.” <i>Computer Graphics Forum</i>. Wiley, 2015. <a href=\"https://doi.org/10.1111/cgf.12454\">https://doi.org/10.1111/cgf.12454</a>.","mla":"Korman, Simon, et al. “Probably Approximately Symmetric: Fast Rigid Symmetry Detection with Global Guarantees.” <i>Computer Graphics Forum</i>, vol. 34, no. 1, Wiley, 2015, pp. 2–13, doi:<a href=\"https://doi.org/10.1111/cgf.12454\">10.1111/cgf.12454</a>.","ieee":"S. Korman, R. Litman, S. Avidan, and A. M. Bronstein, “Probably approximately symmetric: Fast rigid symmetry detection with global guarantees,” <i>Computer Graphics Forum</i>, 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.","ama":"Korman S, Litman R, Avidan S, Bronstein AM. Probably approximately symmetric: Fast rigid symmetry detection with global guarantees. <i>Computer Graphics Forum</i>. 2015;34(1):2-13. doi:<a href=\"https://doi.org/10.1111/cgf.12454\">10.1111/cgf.12454</a>"},"month":"02","status":"public","publication_status":"published","page":"2-13","doi":"10.1111/cgf.12454","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"}],"date_created":"2024-10-15T11:20:55Z","external_id":{"arxiv":["1403.6637"]},"title":"Probably approximately symmetric: Fast rigid symmetry detection with global guarantees","article_processing_charge":"No","issue":"1","publisher":"Wiley","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.1403.6637"}],"quality_controlled":"1","author":[{"first_name":"Simon","full_name":"Korman, Simon","last_name":"Korman"},{"last_name":"Litman","full_name":"Litman, Roee","first_name":"Roee"},{"first_name":"Shai","full_name":"Avidan, Shai","last_name":"Avidan"},{"last_name":"Bronstein","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","full_name":"Bronstein, Alexander"}],"type":"journal_article","language":[{"iso":"eng"}],"intvolume":"        34","_id":"18424","extern":"1","publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]}},{"scopus_import":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2024-10-15T11:20:55Z","year":"2015","day":"01","publication":"Computer Graphics Forum","date_published":"2015-09-01T00:00:00Z","date_updated":"2024-12-19T13:44:16Z","title":"Recent trends, applications, and perspectives in 3D shape similarity assessment","article_processing_charge":"No","volume":35,"oa_version":"None","publisher":"Wiley","citation":{"chicago":"Biasotti, S., A. Cerri, Alex M. Bronstein, and M. Bronstein. “Recent Trends, Applications, and Perspectives in 3D Shape Similarity Assessment.” <i>Computer Graphics Forum</i>. Wiley, 2015. <a href=\"https://doi.org/10.1111/cgf.12734\">https://doi.org/10.1111/cgf.12734</a>.","mla":"Biasotti, S., et al. “Recent Trends, Applications, and Perspectives in 3D Shape Similarity Assessment.” <i>Computer Graphics Forum</i>, vol. 35, no. 6, Wiley, 2015, pp. 87–119, doi:<a href=\"https://doi.org/10.1111/cgf.12734\">10.1111/cgf.12734</a>.","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.","apa":"Biasotti, S., Cerri, A., Bronstein, A. M., &#38; Bronstein, M. (2015). Recent trends, applications, and perspectives in 3D shape similarity assessment. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.12734\">https://doi.org/10.1111/cgf.12734</a>","short":"S. Biasotti, A. Cerri, A.M. Bronstein, M. Bronstein, Computer Graphics Forum 35 (2015) 87–119.","ama":"Biasotti S, Cerri A, Bronstein AM, Bronstein M. Recent trends, applications, and perspectives in 3D shape similarity assessment. <i>Computer Graphics Forum</i>. 2015;35(6):87-119. doi:<a href=\"https://doi.org/10.1111/cgf.12734\">10.1111/cgf.12734</a>","ieee":"S. Biasotti, A. Cerri, A. M. Bronstein, and M. Bronstein, “Recent trends, applications, and perspectives in 3D shape similarity assessment,” <i>Computer Graphics Forum</i>, vol. 35, no. 6. Wiley, pp. 87–119, 2015."},"issue":"6","quality_controlled":"1","author":[{"first_name":"S.","full_name":"Biasotti, S.","last_name":"Biasotti"},{"first_name":"A.","full_name":"Cerri, A.","last_name":"Cerri"},{"orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein","full_name":"Bronstein, Alexander","first_name":"Alexander"},{"last_name":"Bronstein","full_name":"Bronstein, M.","first_name":"M."}],"status":"public","month":"09","page":"87-119","intvolume":"        35","publication_status":"published","_id":"18425","extern":"1","type":"journal_article","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","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."}],"doi":"10.1111/cgf.12734","publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]}},{"type":"journal_article","language":[{"iso":"eng"}],"page":"24547 - 24556","intvolume":"        23","publication_status":"published","_id":"18436","extern":"1","publication_identifier":{"eissn":["1094-4087"]},"doi":"10.1364/oe.23.024547","issue":"19","publisher":"Optica Publishing Group","oa_version":"Published Version","citation":{"ama":"Haim H, Bronstein AM, Marom E. Computational multi-focus imaging combining sparse model with color dependent phase mask. <i>Optics Express</i>. 2015;23(19):24547-24556. doi:<a href=\"https://doi.org/10.1364/oe.23.024547\">10.1364/oe.23.024547</a>","short":"H. Haim, A.M. Bronstein, E. Marom, Optics Express 23 (2015) 24547–24556.","ieee":"H. Haim, A. M. Bronstein, and E. Marom, “Computational multi-focus imaging combining sparse model with color dependent phase mask,” <i>Optics Express</i>, vol. 23, no. 19. Optica Publishing Group, pp. 24547–24556, 2015.","chicago":"Haim, Harel, Alex M. Bronstein, and Emanuel Marom. “Computational Multi-Focus Imaging Combining Sparse Model with Color Dependent Phase Mask.” <i>Optics Express</i>. Optica Publishing Group, 2015. <a href=\"https://doi.org/10.1364/oe.23.024547\">https://doi.org/10.1364/oe.23.024547</a>.","mla":"Haim, Harel, et al. “Computational Multi-Focus Imaging Combining Sparse Model with Color Dependent Phase Mask.” <i>Optics Express</i>, vol. 23, no. 19, Optica Publishing Group, 2015, pp. 24547–56, doi:<a href=\"https://doi.org/10.1364/oe.23.024547\">10.1364/oe.23.024547</a>.","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.","apa":"Haim, H., Bronstein, A. M., &#38; Marom, E. (2015). Computational multi-focus imaging combining sparse model with color dependent phase mask. <i>Optics Express</i>. Optica Publishing Group. <a href=\"https://doi.org/10.1364/oe.23.024547\">https://doi.org/10.1364/oe.23.024547</a>"},"status":"public","month":"09","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1364/OE.23.024547"}],"quality_controlled":"1","author":[{"full_name":"Haim, Harel","first_name":"Harel","last_name":"Haim"},{"full_name":"Bronstein, Alexander","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","last_name":"Bronstein"},{"last_name":"Marom","first_name":"Emanuel","full_name":"Marom, Emanuel"}],"oa":1,"date_published":"2015-09-10T00:00:00Z","publication":"Optics Express","title":"Computational multi-focus imaging combining sparse model with color dependent phase mask","article_processing_charge":"No","volume":23,"date_updated":"2024-12-19T10:48:50Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2024-10-15T11:20:55Z","scopus_import":"1","day":"10","year":"2015"},{"conference":{"start_date":"2015-10-14","end_date":"2015-10-16","location":"London, United Kingdom","name":"5th EAI International Conference on Wireless Mobile Communication and Healthcare - Transforming Healthcare through Innovations in Mobile and Wireless Technologies"},"year":"2015","day":"22","scopus_import":"1","date_created":"2024-10-15T11:20:55Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-12-19T13:36:57Z","article_processing_charge":"No","title":"Low-cost gaze and pulse analysis using realsense","publication":"Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare","date_published":"2015-12-22T00:00:00Z","oa":1,"author":[{"full_name":"Qiu, Qiang","first_name":"Qiang","last_name":"Qiu"},{"last_name":"Chang","first_name":"Zhuoqing","full_name":"Chang, Zhuoqing"},{"first_name":"Mark","full_name":"Draelos, Mark","last_name":"Draelos"},{"first_name":"Jie","full_name":"Chen, Jie","last_name":"Chen"},{"last_name":"Bronstein","orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","full_name":"Bronstein, Alexander"},{"last_name":"Sapiro","full_name":"Sapiro, Guillermo","first_name":"Guillermo"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4108/eai.14-10-2015.2261657"}],"status":"public","month":"12","citation":{"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.","apa":"Qiu, Q., Chang, Z., Draelos, M., Chen, J., Bronstein, A. M., &#38; Sapiro, G. (2015). Low-cost gaze and pulse analysis using realsense. In <i>Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare</i>. London, United Kingdom: ICST. <a href=\"https://doi.org/10.4108/eai.14-10-2015.2261657\">https://doi.org/10.4108/eai.14-10-2015.2261657</a>","chicago":"Qiu, Qiang, Zhuoqing Chang, Mark Draelos, Jie Chen, Alex M. Bronstein, and Guillermo Sapiro. “Low-Cost Gaze and Pulse Analysis Using Realsense.” In <i>Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare</i>. ICST, 2015. <a href=\"https://doi.org/10.4108/eai.14-10-2015.2261657\">https://doi.org/10.4108/eai.14-10-2015.2261657</a>.","mla":"Qiu, Qiang, et al. “Low-Cost Gaze and Pulse Analysis Using Realsense.” <i>Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare</i>, ICST, 2015, doi:<a href=\"https://doi.org/10.4108/eai.14-10-2015.2261657\">10.4108/eai.14-10-2015.2261657</a>.","ieee":"Q. Qiu, Z. Chang, M. Draelos, J. Chen, A. M. Bronstein, and G. Sapiro, “Low-cost gaze and pulse analysis using realsense,” in <i>Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare</i>, London, United Kingdom, 2015.","ama":"Qiu Q, Chang Z, Draelos M, Chen J, Bronstein AM, Sapiro G. Low-cost gaze and pulse analysis using realsense. In: <i>Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare</i>. ICST; 2015. doi:<a href=\"https://doi.org/10.4108/eai.14-10-2015.2261657\">10.4108/eai.14-10-2015.2261657</a>","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."},"oa_version":"Published Version","publisher":"ICST","abstract":[{"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.","lang":"eng"}],"doi":"10.4108/eai.14-10-2015.2261657","publication_identifier":{"isbn":["9781631900884"]},"extern":"1","_id":"18439","publication_status":"published","language":[{"iso":"eng"}],"type":"conference"},{"pubrep_id":"822","title":"Excitement about inhibitory presynaptic terminals","article_processing_charge":"No","external_id":{"isi":["000351319000002"]},"file":[{"relation":"main_file","checksum":"d1808550e376a0eca2a950fda017cfa6","date_updated":"2020-07-14T12:45:19Z","file_id":"5192","date_created":"2018-12-12T10:16:07Z","file_size":411832,"access_level":"open_access","file_name":"IST-2017-822-v1+1_Perspective_Fig__Final.pdf","content_type":"application/pdf","creator":"system"},{"relation":"main_file","date_updated":"2020-07-14T12:45:19Z","checksum":"a279f4ae61e6c8f33d68f69a0d02097d","file_size":100769,"file_name":"IST-2017-822-v1+2_Perspective_Final2.pdf","access_level":"open_access","content_type":"application/pdf","file_id":"5193","date_created":"2018-12-12T10:16:07Z","creator":"system"}],"publist_id":"5256","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"corr_author":"1","date_created":"2018-12-11T11:54:19Z","license":"https://creativecommons.org/licenses/by-nc/4.0/","intvolume":"        85","_id":"1845","type":"journal_article","language":[{"iso":"eng"}],"quality_controlled":"1","author":[{"first_name":"David H","full_name":"Vandael, David H","last_name":"Vandael","orcid":"0000-0001-7577-1676","id":"3AE48E0A-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-4710-2082","id":"31FFEE2E-F248-11E8-B48F-1D18A9856A87","last_name":"Espinoza Martinez","full_name":"Espinoza Martinez, Claudia ","first_name":"Claudia "},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","last_name":"Jonas","full_name":"Jonas, Peter M","first_name":"Peter M"}],"publisher":"Elsevier","department":[{"_id":"PeJo"}],"issue":"6","date_updated":"2025-09-23T08:44:39Z","volume":85,"publication":"Neuron","isi":1,"oa":1,"file_date_updated":"2020-07-14T12:45:19Z","ddc":["570"],"date_published":"2015-03-18T00:00:00Z","year":"2015","has_accepted_license":"1","day":"18","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","doi":"10.1016/j.neuron.2015.03.006","abstract":[{"text":"Based on extrapolation from excitatory synapses, it is often assumed that depletion of the releasable pool of synaptic vesicles is the main factor underlying depression at inhibitory synapses. In this issue of Neuron, using subcellular patch-clamp recording from inhibitory presynaptic terminals, Kawaguchi and Sakaba (2015) show that at Purkinje cell-deep cerebellar nuclei neuron synapses, changes in presynaptic action potential waveform substantially contribute to synaptic depression. Based on extrapolation from excitatory synapses, it is often assumed that depletion of the releasable pool of synaptic vesicles is the main factor underlying depression at inhibitory synapses. In this issue of Neuron, using subcellular patch-clamp recording from inhibitory presynaptic terminals, Kawaguchi and Sakaba (2015) show that at Purkinje cell-deep cerebellar nuclei neuron synapses, changes in presynaptic action potential waveform substantially contribute to synaptic depression.","lang":"eng"}],"publication_status":"published","page":"1149 - 1151","month":"03","status":"public","oa_version":"Published Version","citation":{"ista":"Vandael DH, Espinoza Martinez C, Jonas PM. 2015. Excitement about inhibitory presynaptic terminals. Neuron. 85(6), 1149–1151.","apa":"Vandael, D. H., Espinoza Martinez, C., &#38; Jonas, P. M. (2015). Excitement about inhibitory presynaptic terminals. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2015.03.006\">https://doi.org/10.1016/j.neuron.2015.03.006</a>","chicago":"Vandael, David H, Claudia  Espinoza Martinez, and Peter M Jonas. “Excitement about Inhibitory Presynaptic Terminals.” <i>Neuron</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.neuron.2015.03.006\">https://doi.org/10.1016/j.neuron.2015.03.006</a>.","mla":"Vandael, David H., et al. “Excitement about Inhibitory Presynaptic Terminals.” <i>Neuron</i>, vol. 85, no. 6, Elsevier, 2015, pp. 1149–51, doi:<a href=\"https://doi.org/10.1016/j.neuron.2015.03.006\">10.1016/j.neuron.2015.03.006</a>.","ieee":"D. H. Vandael, C. Espinoza Martinez, and P. M. Jonas, “Excitement about inhibitory presynaptic terminals,” <i>Neuron</i>, vol. 85, no. 6. Elsevier, pp. 1149–1151, 2015.","short":"D.H. Vandael, C. Espinoza Martinez, P.M. Jonas, Neuron 85 (2015) 1149–1151.","ama":"Vandael DH, Espinoza Martinez C, Jonas PM. Excitement about inhibitory presynaptic terminals. <i>Neuron</i>. 2015;85(6):1149-1151. doi:<a href=\"https://doi.org/10.1016/j.neuron.2015.03.006\">10.1016/j.neuron.2015.03.006</a>"}},{"corr_author":"1","date_created":"2018-12-11T11:54:20Z","publist_id":"5255","file":[{"relation":"main_file","checksum":"fb4037ddc4fc05f33080dd3547ede350","date_updated":"2020-07-14T12:45:19Z","date_created":"2020-05-15T08:57:44Z","file_id":"7854","content_type":"application/pdf","file_size":488482,"file_name":"2015_ActaInfo_Benes.pdf","access_level":"open_access","creator":"dernst"}],"article_type":"original","external_id":{"isi":["000351160200008"]},"article_processing_charge":"No","title":"Refinement checking on parametric modal transition systems","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"publisher":"Springer","issue":"2-3","author":[{"last_name":"Beneš","first_name":"Nikola","full_name":"Beneš, Nikola"},{"first_name":"Jan","full_name":"Kretinsky, Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8122-2881"},{"full_name":"Larsen, Kim","first_name":"Kim","last_name":"Larsen"},{"last_name":"Möller","first_name":"Mikael","full_name":"Möller, Mikael"},{"full_name":"Sickert, Salomon","first_name":"Salomon","last_name":"Sickert"},{"last_name":"Srba","first_name":"Jiří","full_name":"Srba, Jiří"}],"quality_controlled":"1","_id":"1846","intvolume":"        52","ec_funded":1,"language":[{"iso":"eng"}],"type":"journal_article","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","has_accepted_license":"1","year":"2015","day":"01","isi":1,"publication":"Acta Informatica","date_published":"2015-04-01T00:00:00Z","ddc":["000"],"oa":1,"file_date_updated":"2020-07-14T12:45:19Z","date_updated":"2025-09-23T10:33:12Z","volume":52,"citation":{"apa":"Beneš, N., Kretinsky, J., Larsen, K., Möller, M., Sickert, S., &#38; Srba, J. (2015). Refinement checking on parametric modal transition systems. <i>Acta Informatica</i>. Springer. <a href=\"https://doi.org/10.1007/s00236-015-0215-4\">https://doi.org/10.1007/s00236-015-0215-4</a>","ista":"Beneš N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. 2015. Refinement checking on parametric modal transition systems. Acta Informatica. 52(2–3), 269–297.","mla":"Beneš, Nikola, et al. “Refinement Checking on Parametric Modal Transition Systems.” <i>Acta Informatica</i>, vol. 52, no. 2–3, Springer, 2015, pp. 269–97, doi:<a href=\"https://doi.org/10.1007/s00236-015-0215-4\">10.1007/s00236-015-0215-4</a>.","chicago":"Beneš, Nikola, Jan Kretinsky, Kim Larsen, Mikael Möller, Salomon Sickert, and Jiří Srba. “Refinement Checking on Parametric Modal Transition Systems.” <i>Acta Informatica</i>. Springer, 2015. <a href=\"https://doi.org/10.1007/s00236-015-0215-4\">https://doi.org/10.1007/s00236-015-0215-4</a>.","ieee":"N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, and J. Srba, “Refinement checking on parametric modal transition systems,” <i>Acta Informatica</i>, vol. 52, no. 2–3. Springer, pp. 269–297, 2015.","ama":"Beneš N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. Refinement checking on parametric modal transition systems. <i>Acta Informatica</i>. 2015;52(2-3):269-297. doi:<a href=\"https://doi.org/10.1007/s00236-015-0215-4\">10.1007/s00236-015-0215-4</a>","short":"N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, J. Srba, Acta Informatica 52 (2015) 269–297."},"oa_version":"Submitted Version","month":"04","status":"public","page":"269 - 297","publication_status":"published","abstract":[{"text":"Modal transition systems (MTS) is a well-studied specification formalism of reactive systems supporting a step-wise refinement methodology. Despite its many advantages, the formalism as well as its currently known extensions are incapable of expressing some practically needed aspects in the refinement process like exclusive, conditional and persistent choices. We introduce a new model called parametric modal transition systems (PMTS) together with a general modal refinement notion that overcomes many of the limitations. We investigate the computational complexity of modal and thorough refinement checking on PMTS and its subclasses and provide a direct encoding of the modal refinement problem into quantified Boolean formulae, allowing us to employ state-of-the-art QBF solvers for modal refinement checking. The experiments we report on show that the feasibility of refinement checking is more influenced by the degree of nondeterminism rather than by the syntactic restrictions on the types of formulae allowed in the description of the PMTS.","lang":"eng"}],"doi":"10.1007/s00236-015-0215-4"},{"external_id":{"isi":["000350813400003"]},"article_processing_charge":"No","title":"ABP1: Finally docking","corr_author":"1","date_created":"2018-12-11T11:54:20Z","publist_id":"5254","_id":"1847","intvolume":"         8","language":[{"iso":"eng"}],"type":"journal_article","publisher":"Elsevier","department":[{"_id":"JiFr"}],"issue":"3","author":[{"last_name":"Grones","id":"399876EC-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","full_name":"Grones, Peter"},{"first_name":"Jiřĺ","full_name":"Friml, Jiřĺ","last_name":"Friml","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","publication":"Molecular Plant","acknowledgement":"This work was supported by the European Research Council (project ERC-2011-StG-20101109-PSDP), European Social Fund (CZ.1.07/2.3.00/20.0043), and the Czech Science Foundation GAČR (GA13-40637S).","isi":1,"date_published":"2015-03-02T00:00:00Z","date_updated":"2025-09-23T07:30:08Z","volume":8,"scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2015","day":"02","publication_status":"published","page":"356 - 358","doi":"10.1016/j.molp.2014.12.013","citation":{"apa":"Grones, P., &#38; Friml, J. (2015). ABP1: Finally docking. <i>Molecular Plant</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.molp.2014.12.013\">https://doi.org/10.1016/j.molp.2014.12.013</a>","ista":"Grones P, Friml J. 2015. ABP1: Finally docking. Molecular Plant. 8(3), 356–358.","mla":"Grones, Peter, and Jiří Friml. “ABP1: Finally Docking.” <i>Molecular Plant</i>, vol. 8, no. 3, Elsevier, 2015, pp. 356–58, doi:<a href=\"https://doi.org/10.1016/j.molp.2014.12.013\">10.1016/j.molp.2014.12.013</a>.","chicago":"Grones, Peter, and Jiří Friml. “ABP1: Finally Docking.” <i>Molecular Plant</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.molp.2014.12.013\">https://doi.org/10.1016/j.molp.2014.12.013</a>.","ieee":"P. Grones and J. Friml, “ABP1: Finally docking,” <i>Molecular Plant</i>, vol. 8, no. 3. Elsevier, pp. 356–358, 2015.","short":"P. Grones, J. Friml, Molecular Plant 8 (2015) 356–358.","ama":"Grones P, Friml J. ABP1: Finally docking. <i>Molecular Plant</i>. 2015;8(3):356-358. doi:<a href=\"https://doi.org/10.1016/j.molp.2014.12.013\">10.1016/j.molp.2014.12.013</a>"},"oa_version":"None","status":"public","month":"03"},{"day":"01","year":"2015","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","volume":137,"date_updated":"2025-09-23T08:46:31Z","oa":1,"date_published":"2015-09-01T00:00:00Z","isi":1,"publication":"International Journal of Cancer","month":"09","status":"public","pmid":1,"oa_version":"Submitted Version","citation":{"mla":"Schwamb, Bettina, et al. “FAM96A Is a Novel Pro-Apoptotic Tumor Suppressor in Gastrointestinal Stromal Tumors.” <i>International Journal of Cancer</i>, vol. 137, no. 6, Wiley, 2015, pp. 1318–29, doi:<a href=\"https://doi.org/10.1002/ijc.29498\">10.1002/ijc.29498</a>.","chicago":"Schwamb, Bettina, Robert Pick, Sara Fernández, Kirsten Völp, Jan Heering, Volker Dötsch, Susanne Bösser, et al. “FAM96A Is a Novel Pro-Apoptotic Tumor Suppressor in Gastrointestinal Stromal Tumors.” <i>International Journal of Cancer</i>. Wiley, 2015. <a href=\"https://doi.org/10.1002/ijc.29498\">https://doi.org/10.1002/ijc.29498</a>.","apa":"Schwamb, B., Pick, R., Fernández, S., Völp, K., Heering, J., Dötsch, V., … Zörnig, M. (2015). FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors. <i>International Journal of Cancer</i>. Wiley. <a href=\"https://doi.org/10.1002/ijc.29498\">https://doi.org/10.1002/ijc.29498</a>","ista":"Schwamb B, Pick R, Fernández S, Völp K, Heering J, Dötsch V, Bösser S, Jung J, Beinoravičiute Kellner R, Wesely J, Zörnig I, Hammerschmidt M, Nowak M, Penzel R, Zatloukal K, Joos S, Rieker R, Agaimy A, Söder S, Reid Lombardo K, Kendrick M, Bardsley M, Hayashi Y, Asuzu D, Syed S, Ördög T, Zörnig M. 2015. FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors. International Journal of Cancer. 137(6), 1318–1329.","short":"B. Schwamb, R. Pick, S. Fernández, K. Völp, J. Heering, V. Dötsch, S. Bösser, J. Jung, R. Beinoravičiute Kellner, J. Wesely, I. Zörnig, M. Hammerschmidt, M. Nowak, R. Penzel, K. Zatloukal, S. Joos, R. Rieker, A. Agaimy, S. Söder, K. Reid Lombardo, M. Kendrick, M. Bardsley, Y. Hayashi, D. Asuzu, S. Syed, T. Ördög, M. Zörnig, International Journal of Cancer 137 (2015) 1318–1329.","ama":"Schwamb B, Pick R, Fernández S, et al. FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors. <i>International Journal of Cancer</i>. 2015;137(6):1318-1329. doi:<a href=\"https://doi.org/10.1002/ijc.29498\">10.1002/ijc.29498</a>","ieee":"B. Schwamb <i>et al.</i>, “FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors,” <i>International Journal of Cancer</i>, vol. 137, no. 6. Wiley, pp. 1318–1329, 2015."},"abstract":[{"text":"The ability to escape apoptosis is a hallmark of cancer-initiating cells and a key factor of resistance to oncolytic therapy. Here, we identify FAM96A as a ubiquitous, evolutionarily conserved apoptosome-activating protein and investigate its potential pro-apoptotic tumor suppressor function in gastrointestinal stromal tumors (GISTs). Interaction between FAM96A and apoptotic peptidase activating factor 1 (APAF1) was identified in yeast two-hybrid screen and further studied by deletion mutants, glutathione-S-transferase pull-down, co-immunoprecipitation and immunofluorescence. Effects of FAM96A overexpression and knock-down on apoptosis sensitivity were examined in cancer cells and zebrafish embryos. Expression of FAM96A in GISTs and histogenetically related cells including interstitial cells of Cajal (ICCs), “fibroblast-like cells” (FLCs) and ICC stem cells (ICC-SCs) was investigated by Northern blotting, reverse transcription—polymerase chain reaction, immunohistochemistry and Western immunoblotting. Tumorigenicity of GIST cells and transformed murine ICC-SCs stably transduced to re-express FAM96A was studied by xeno- and allografting into immunocompromised mice. FAM96A was found to bind APAF1 and to enhance the induction of mitochondrial apoptosis. FAM96A protein or mRNA was dramatically reduced or lost in 106 of 108 GIST samples representing three independent patient cohorts. Whereas ICCs, ICC-SCs and FLCs, the presumed normal counterparts of GIST, were found to robustly express FAM96A protein and mRNA, FAM96A expression was much reduced in tumorigenic ICC-SCs. Re-expression of FAM96A in GIST cells and transformed ICC-SCs increased apoptosis sensitivity and diminished tumorigenicity. Our data suggest FAM96A is a novel pro-apoptotic tumor suppressor that is lost during GIST tumorigenesis.","lang":"eng"}],"doi":"10.1002/ijc.29498","publication_status":"published","page":"1318 - 1329","publist_id":"5253","date_created":"2018-12-11T11:54:20Z","title":"FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors","article_processing_charge":"No","external_id":{"isi":["000357808900012"],"pmid":["25716227"]},"article_type":"original","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4497860/","open_access":"1"}],"quality_controlled":"1","author":[{"last_name":"Schwamb","full_name":"Schwamb, Bettina","first_name":"Bettina"},{"full_name":"Pick, Robert","first_name":"Robert","last_name":"Pick"},{"last_name":"Fernández","first_name":"Sara","full_name":"Fernández, Sara"},{"last_name":"Völp","first_name":"Kirsten","full_name":"Völp, Kirsten"},{"last_name":"Heering","full_name":"Heering, Jan","first_name":"Jan"},{"full_name":"Dötsch, Volker","first_name":"Volker","last_name":"Dötsch"},{"first_name":"Susanne","full_name":"Bösser, Susanne","last_name":"Bösser"},{"full_name":"Jung, Jennifer","first_name":"Jennifer","last_name":"Jung"},{"last_name":"Beinoravičiute Kellner","first_name":"Rasa","full_name":"Beinoravičiute Kellner, Rasa"},{"full_name":"Wesely, Josephine","first_name":"Josephine","last_name":"Wesely"},{"first_name":"Inka","full_name":"Zörnig, Inka","last_name":"Zörnig"},{"last_name":"Hammerschmidt","first_name":"Matthias","full_name":"Hammerschmidt, Matthias"},{"first_name":"Matthias","full_name":"Nowak, Matthias","last_name":"Nowak","id":"30845DAA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Penzel","first_name":"Roland","full_name":"Penzel, Roland"},{"last_name":"Zatloukal","first_name":"Kurt","full_name":"Zatloukal, Kurt"},{"full_name":"Joos, Stefan","first_name":"Stefan","last_name":"Joos"},{"last_name":"Rieker","first_name":"Ralf","full_name":"Rieker, Ralf"},{"full_name":"Agaimy, Abbas","first_name":"Abbas","last_name":"Agaimy"},{"last_name":"Söder","full_name":"Söder, Stephan","first_name":"Stephan"},{"first_name":"Kmarie","full_name":"Reid Lombardo, Kmarie","last_name":"Reid Lombardo"},{"last_name":"Kendrick","full_name":"Kendrick, Michael","first_name":"Michael"},{"full_name":"Bardsley, Michael","first_name":"Michael","last_name":"Bardsley"},{"first_name":"Yujiro","full_name":"Hayashi, Yujiro","last_name":"Hayashi"},{"last_name":"Asuzu","first_name":"David","full_name":"Asuzu, David"},{"first_name":"Sabriya","full_name":"Syed, Sabriya","last_name":"Syed"},{"last_name":"Ördög","first_name":"Tamás","full_name":"Ördög, Tamás"},{"last_name":"Zörnig","first_name":"Martin","full_name":"Zörnig, Martin"}],"issue":"6","publisher":"Wiley","department":[{"_id":"LifeSc"}],"type":"journal_article","language":[{"iso":"eng"}],"intvolume":"       137","_id":"1848"},{"citation":{"short":"E. Himschoot, T. Beeckman, J. Friml, S. Vanneste, Biochimica et Biophysica Acta - Molecular Cell Research 1853 (2015) 2168–2172.","ama":"Himschoot E, Beeckman T, Friml J, Vanneste S. Calcium is an organizer of cell polarity in plants. <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>. 2015;1853(9):2168-2172. doi:<a href=\"https://doi.org/10.1016/j.bbamcr.2015.02.017\">10.1016/j.bbamcr.2015.02.017</a>","ieee":"E. Himschoot, T. Beeckman, J. Friml, and S. Vanneste, “Calcium is an organizer of cell polarity in plants,” <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>, vol. 1853, no. 9. Elsevier, pp. 2168–2172, 2015.","chicago":"Himschoot, Ellie, Tom Beeckman, Jiří Friml, and Steffen Vanneste. “Calcium Is an Organizer of Cell Polarity in Plants.” <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.bbamcr.2015.02.017\">https://doi.org/10.1016/j.bbamcr.2015.02.017</a>.","mla":"Himschoot, Ellie, et al. “Calcium Is an Organizer of Cell Polarity in Plants.” <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>, vol. 1853, no. 9, Elsevier, 2015, pp. 2168–72, doi:<a href=\"https://doi.org/10.1016/j.bbamcr.2015.02.017\">10.1016/j.bbamcr.2015.02.017</a>.","ista":"Himschoot E, Beeckman T, Friml J, Vanneste S. 2015. Calcium is an organizer of cell polarity in plants. Biochimica et Biophysica Acta - Molecular Cell Research. 1853(9), 2168–2172.","apa":"Himschoot, E., Beeckman, T., Friml, J., &#38; Vanneste, S. (2015). Calcium is an organizer of cell polarity in plants. <i>Biochimica et Biophysica Acta - Molecular Cell Research</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.bbamcr.2015.02.017\">https://doi.org/10.1016/j.bbamcr.2015.02.017</a>"},"oa_version":"None","month":"09","status":"public","publication_status":"published","page":"2168 - 2172","abstract":[{"text":"Cell polarity is a fundamental property of pro- and eukaryotic cells. It is necessary for coordination of cell division, cell morphogenesis and signaling processes. How polarity is generated and maintained is a complex issue governed by interconnected feed-back regulations between small GTPase signaling and membrane tension-based signaling that controls membrane trafficking, and cytoskeleton organization and dynamics. Here, we will review the potential role for calcium as a crucial signal that connects and coordinates the respective processes during polarization processes in plants. This article is part of a Special Issue entitled: 13th European Symposium on Calcium.","lang":"eng"}],"doi":"10.1016/j.bbamcr.2015.02.017","scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2015","day":"01","publication":"Biochimica et Biophysica Acta - Molecular Cell Research","isi":1,"acknowledgement":"The contributing authors were supported by the Ghent University Special Research Fund (to E.H.), the Interuniversity Attraction Poles Programme (IAP VI/33 and IUAP P7/29 ‘MARS’), the European Research Council (project ERC-2011-StG-20101109-PSDP, to J.F.), and the Research Foundation Flanders (to S.V.).","date_published":"2015-09-01T00:00:00Z","date_updated":"2025-09-23T08:04:01Z","volume":1853,"publisher":"Elsevier","department":[{"_id":"JiFr"}],"issue":"9","author":[{"first_name":"Ellie","full_name":"Himschoot, Ellie","last_name":"Himschoot"},{"last_name":"Beeckman","full_name":"Beeckman, Tom","first_name":"Tom"},{"full_name":"Friml, Jiřĺ","first_name":"Jiřĺ","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","last_name":"Friml"},{"full_name":"Vanneste, Steffen","first_name":"Steffen","last_name":"Vanneste"}],"quality_controlled":"1","_id":"1849","intvolume":"      1853","language":[{"iso":"eng"}],"type":"journal_article","date_created":"2018-12-11T11:54:21Z","publist_id":"5252","external_id":{"isi":["000359960400028"]},"article_processing_charge":"No","title":"Calcium is an organizer of cell polarity in plants"},{"oa_version":"Submitted Version","citation":{"ista":"Novak S, Cremer S. 2015. Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates. Journal of Theoretical Biology. 372(5), 54–64.","apa":"Novak, S., &#38; Cremer, S. (2015). Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates. <i>Journal of Theoretical Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jtbi.2015.02.018\">https://doi.org/10.1016/j.jtbi.2015.02.018</a>","chicago":"Novak, Sebastian, and Sylvia Cremer. “Fungal Disease Dynamics in Insect Societies: Optimal Killing Rates and the Ambivalent Effect of High Social Interaction Rates.” <i>Journal of Theoretical Biology</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.jtbi.2015.02.018\">https://doi.org/10.1016/j.jtbi.2015.02.018</a>.","mla":"Novak, Sebastian, and Sylvia Cremer. “Fungal Disease Dynamics in Insect Societies: Optimal Killing Rates and the Ambivalent Effect of High Social Interaction Rates.” <i>Journal of Theoretical Biology</i>, vol. 372, no. 5, Elsevier, 2015, pp. 54–64, doi:<a href=\"https://doi.org/10.1016/j.jtbi.2015.02.018\">10.1016/j.jtbi.2015.02.018</a>.","ieee":"S. Novak and S. Cremer, “Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates,” <i>Journal of Theoretical Biology</i>, vol. 372, no. 5. Elsevier, pp. 54–64, 2015.","ama":"Novak S, Cremer S. Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates. <i>Journal of Theoretical Biology</i>. 2015;372(5):54-64. doi:<a href=\"https://doi.org/10.1016/j.jtbi.2015.02.018\">10.1016/j.jtbi.2015.02.018</a>","short":"S. Novak, S. Cremer, Journal of Theoretical Biology 372 (2015) 54–64."},"status":"public","month":"05","page":"54 - 64","publication_status":"published","abstract":[{"lang":"eng","text":"Entomopathogenic fungi are potent biocontrol agents that are widely used against insect pests, many of which are social insects. Nevertheless, theoretical investigations of their particular life history are scarce. We develop a model that takes into account the main distinguishing features between traditionally studied diseases and obligate killing pathogens, like the (biocontrol-relevant) insect-pathogenic fungi Metarhizium and Beauveria. First, obligate killing entomopathogenic fungi produce new infectious particles (conidiospores) only after host death and not yet on the living host. Second, the killing rates of entomopathogenic fungi depend strongly on the initial exposure dosage, thus we explicitly consider the pathogen load of individual hosts. Further, we make the model applicable not only to solitary host species, but also to group living species by incorporating social interactions between hosts, like the collective disease defences of insect societies. Our results identify the optimal killing rate for the pathogen that minimises its invasion threshold. Furthermore, we find that the rate of contact between hosts has an ambivalent effect: dense interaction networks between individuals are considered to facilitate disease outbreaks because of increased pathogen transmission. In social insects, this is compensated by their collective disease defences, i.e., social immunity. For the type of pathogens considered here, we show that even without social immunity, high contact rates between live individuals dilute the pathogen in the host colony and hence can reduce individual pathogen loads below disease-causing levels."}],"doi":"10.1016/j.jtbi.2015.02.018","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","day":"07","year":"2015","has_accepted_license":"1","oa":1,"file_date_updated":"2020-07-14T12:45:19Z","ddc":["576"],"date_published":"2015-05-07T00:00:00Z","publication":"Journal of Theoretical Biology","isi":1,"volume":372,"date_updated":"2025-09-23T08:54:35Z","issue":"5","publisher":"Elsevier","department":[{"_id":"NiBa"},{"_id":"SyCr"}],"quality_controlled":"1","author":[{"last_name":"Novak","orcid":"0000-0002-2519-824X","id":"461468AE-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastian","full_name":"Novak, Sebastian"},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","last_name":"Cremer","full_name":"Cremer, Sylvia","first_name":"Sylvia"}],"type":"journal_article","language":[{"iso":"eng"}],"intvolume":"       372","ec_funded":1,"_id":"1850","project":[{"name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425"},{"grant_number":"243071","_id":"25DC711C-B435-11E9-9278-68D0E5697425","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","call_identifier":"FP7"}],"date_created":"2018-12-11T11:54:21Z","corr_author":"1","file":[{"relation":"main_file","date_updated":"2020-07-14T12:45:19Z","checksum":"3c0dcacc900bc45cc65a453dfda4ca43","access_level":"open_access","file_name":"IST-2015-329-v1+1_manuscript.pdf","file_size":1546914,"content_type":"application/pdf","file_id":"5326","date_created":"2018-12-12T10:18:07Z","creator":"system"}],"publist_id":"5251","external_id":{"isi":["000353311700006"]},"title":"Fungal disease dynamics in insect societies: Optimal killing rates and the ambivalent effect of high social interaction rates","article_processing_charge":"No","pubrep_id":"329"},{"intvolume":"        69","ec_funded":1,"_id":"1851","type":"journal_article","language":[{"iso":"eng"}],"project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"issn":["0014-3820"],"eissn":["1558-5646"]},"publisher":"Wiley","department":[{"_id":"NiBa"},{"_id":"KrCh"}],"issue":"4","quality_controlled":"1","author":[{"full_name":"Priklopil, Tadeas","first_name":"Tadeas","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87","last_name":"Priklopil"},{"full_name":"Kisdi, Eva","first_name":"Eva","last_name":"Kisdi"},{"last_name":"Gyllenberg","full_name":"Gyllenberg, Mats","first_name":"Mats"}],"external_id":{"pmid":["25662095"],"isi":["000353236000014"]},"article_type":"original","title":"Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating","article_processing_charge":"No","corr_author":"1","date_created":"2018-12-11T11:54:21Z","file":[{"relation":"main_file","checksum":"1e8be0b1d7598a78cd2623d8ee8e7798","date_updated":"2020-07-14T12:45:19Z","file_id":"7855","date_created":"2020-05-15T09:05:34Z","file_size":967214,"file_name":"2015_Evolution_Priklopil.pdf","access_level":"open_access","content_type":"application/pdf","creator":"dernst"}],"publist_id":"5249","publication_status":"published","page":"1015 - 1026","doi":"10.1111/evo.12618","abstract":[{"lang":"eng","text":"We consider mating strategies for females who search for males sequentially during a season of limited length. We show that the best strategy rejects a given male type if encountered before a time-threshold but accepts him after. For frequency-independent benefits, we obtain the optimal time-thresholds explicitly for both discrete and continuous distributions of males, and allow for mistakes being made in assessing the correct male type. When the benefits are indirect (genes for the offspring) and the population is under frequency-dependent ecological selection, the benefits depend on the mating strategy of other females as well. This case is particularly relevant to speciation models that seek to explore the stability of reproductive isolation by assortative mating under frequency-dependent ecological selection. We show that the indirect benefits are to be quantified by the reproductive values of couples, and describe how the evolutionarily stable time-thresholds can be found. We conclude with an example based on the Levene model, in which we analyze the evolutionarily stable assortative mating strategies and the strength of reproductive isolation provided by them."}],"oa_version":"Submitted Version","citation":{"ieee":"T. Priklopil, E. Kisdi, and M. Gyllenberg, “Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating,” <i>Evolution</i>, vol. 69, no. 4. Wiley, pp. 1015–1026, 2015.","ama":"Priklopil T, Kisdi E, Gyllenberg M. Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating. <i>Evolution</i>. 2015;69(4):1015-1026. doi:<a href=\"https://doi.org/10.1111/evo.12618\">10.1111/evo.12618</a>","short":"T. Priklopil, E. Kisdi, M. Gyllenberg, Evolution 69 (2015) 1015–1026.","apa":"Priklopil, T., Kisdi, E., &#38; Gyllenberg, M. (2015). Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating. <i>Evolution</i>. Wiley. <a href=\"https://doi.org/10.1111/evo.12618\">https://doi.org/10.1111/evo.12618</a>","ista":"Priklopil T, Kisdi E, Gyllenberg M. 2015. Evolutionarily stable mating decisions for sequentially searching females and the stability of reproductive isolation by assortative mating. Evolution. 69(4), 1015–1026.","mla":"Priklopil, Tadeas, et al. “Evolutionarily Stable Mating Decisions for Sequentially Searching Females and the Stability of Reproductive Isolation by Assortative Mating.” <i>Evolution</i>, vol. 69, no. 4, Wiley, 2015, pp. 1015–26, doi:<a href=\"https://doi.org/10.1111/evo.12618\">10.1111/evo.12618</a>.","chicago":"Priklopil, Tadeas, Eva Kisdi, and Mats Gyllenberg. “Evolutionarily Stable Mating Decisions for Sequentially Searching Females and the Stability of Reproductive Isolation by Assortative Mating.” <i>Evolution</i>. Wiley, 2015. <a href=\"https://doi.org/10.1111/evo.12618\">https://doi.org/10.1111/evo.12618</a>."},"pmid":1,"month":"02","status":"public","publication":"Evolution","isi":1,"file_date_updated":"2020-07-14T12:45:19Z","oa":1,"date_published":"2015-02-09T00:00:00Z","ddc":["570"],"date_updated":"2025-09-22T14:27:30Z","volume":69,"scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2015","has_accepted_license":"1","day":"09"},{"day":"03","year":"2015","has_accepted_license":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","volume":84,"date_updated":"2025-09-23T07:26:24Z","oa":1,"file_date_updated":"2020-07-14T12:45:19Z","date_published":"2015-03-03T00:00:00Z","ddc":["570"],"publication":"Journal of Animal Ecology","isi":1,"acknowledgement":"We thank J.R. de Miranda, L. De Smet and D. de Graaf for supplying qRT-PCR and MLPA positive controls, respectively, in the form of plasmids. This work was supported by the Insect Pollinators Initiative (IPI grants BB/1000100/1 and BB/I000151/1). The IPI is funded jointly by the Biotechnology and Biological Sciences Research Council, the Department for Environment, Food and Rural Affairs, the Natural Environment Research Council, The Scottish Government and The Wellcome Trust, under the Living with Environmental Change Partnership.","month":"03","status":"public","related_material":{"record":[{"relation":"research_data","id":"9720","status":"public"}]},"pmid":1,"oa_version":"Published Version","citation":{"ama":"Mcmahon D, Fürst M, Caspar J, Theodorou P, Brown M, Paxton R. A sting in the spit: Widespread cross-infection of multiple RNA viruses across wild and managed bees. <i>Journal of Animal Ecology</i>. 2015;84(3):615-624. doi:<a href=\"https://doi.org/10.1111/1365-2656.12345\">10.1111/1365-2656.12345</a>","short":"D. Mcmahon, M. Fürst, J. Caspar, P. Theodorou, M. Brown, R. Paxton, Journal of Animal Ecology 84 (2015) 615–624.","ieee":"D. Mcmahon, M. Fürst, J. Caspar, P. Theodorou, M. Brown, and R. Paxton, “A sting in the spit: Widespread cross-infection of multiple RNA viruses across wild and managed bees,” <i>Journal of Animal Ecology</i>, vol. 84, no. 3. Wiley, pp. 615–624, 2015.","chicago":"Mcmahon, Dino, Matthias Fürst, Jesicca Caspar, Panagiotis Theodorou, Mark Brown, and Robert Paxton. “A Sting in the Spit: Widespread Cross-Infection of Multiple RNA Viruses across Wild and Managed Bees.” <i>Journal of Animal Ecology</i>. Wiley, 2015. <a href=\"https://doi.org/10.1111/1365-2656.12345\">https://doi.org/10.1111/1365-2656.12345</a>.","mla":"Mcmahon, Dino, et al. “A Sting in the Spit: Widespread Cross-Infection of Multiple RNA Viruses across Wild and Managed Bees.” <i>Journal of Animal Ecology</i>, vol. 84, no. 3, Wiley, 2015, pp. 615–24, doi:<a href=\"https://doi.org/10.1111/1365-2656.12345\">10.1111/1365-2656.12345</a>.","ista":"Mcmahon D, Fürst M, Caspar J, Theodorou P, Brown M, Paxton R. 2015. A sting in the spit: Widespread cross-infection of multiple RNA viruses across wild and managed bees. Journal of Animal Ecology. 84(3), 615–624.","apa":"Mcmahon, D., Fürst, M., Caspar, J., Theodorou, P., Brown, M., &#38; Paxton, R. (2015). A sting in the spit: Widespread cross-infection of multiple RNA viruses across wild and managed bees. <i>Journal of Animal Ecology</i>. Wiley. <a href=\"https://doi.org/10.1111/1365-2656.12345\">https://doi.org/10.1111/1365-2656.12345</a>"},"doi":"10.1111/1365-2656.12345","abstract":[{"lang":"eng","text":"Summary: Declining populations of bee pollinators are a cause of concern, with major repercussions for biodiversity loss and food security. RNA viruses associated with honeybees represent a potential threat to other insect pollinators, but the extent of this threat is poorly understood. This study aims to attain a detailed understanding of the current and ongoing risk of emerging infectious disease (EID) transmission between managed and wild pollinator species across a wide range of RNA viruses. Within a structured large-scale national survey across 26 independent sites, we quantify the prevalence and pathogen loads of multiple RNA viruses in co-occurring managed honeybee (Apis mellifera) and wild bumblebee (Bombus spp.) populations. We then construct models that compare virus prevalence between wild and managed pollinators. Multiple RNA viruses associated with honeybees are widespread in sympatric wild bumblebee populations. Virus prevalence in honeybees is a significant predictor of virus prevalence in bumblebees, but we remain cautious in speculating over the principle direction of pathogen transmission. We demonstrate species-specific differences in prevalence, indicating significant variation in disease susceptibility or tolerance. Pathogen loads within individual bumblebees may be high and in the case of at least one RNA virus, prevalence is higher in wild bumblebees than in managed honeybee populations. Our findings indicate widespread transmission of RNA viruses between managed and wild bee pollinators, pointing to an interconnected network of potential disease pressures within and among pollinator species. In the context of the biodiversity crisis, our study emphasizes the importance of targeting a wide range of pathogens and defining host associations when considering potential drivers of population decline."}],"publication_status":"published","page":"615 - 624","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file":[{"file_id":"5350","date_created":"2018-12-12T10:18:29Z","file_name":"IST-2016-460-v1+1_McMahon_et_al-2015-Journal_of_Animal_Ecology.pdf","file_size":1823045,"access_level":"open_access","content_type":"application/pdf","creator":"system","relation":"main_file","checksum":"542a0b9b07e78050a81b35f26f0b82da","date_updated":"2020-07-14T12:45:19Z"}],"publist_id":"5245","date_created":"2018-12-11T11:54:23Z","license":"https://creativecommons.org/licenses/by/4.0/","title":"A sting in the spit: Widespread cross-infection of multiple RNA viruses across wild and managed bees","article_processing_charge":"No","pubrep_id":"460","external_id":{"pmid":["25646973"],"isi":["000353405300004"]},"article_type":"original","quality_controlled":"1","author":[{"full_name":"Mcmahon, Dino","first_name":"Dino","last_name":"Mcmahon"},{"last_name":"Fürst","orcid":"0000-0002-3712-925X","id":"393B1196-F248-11E8-B48F-1D18A9856A87","first_name":"Matthias","full_name":"Fürst, Matthias"},{"first_name":"Jesicca","full_name":"Caspar, Jesicca","last_name":"Caspar"},{"full_name":"Theodorou, Panagiotis","first_name":"Panagiotis","last_name":"Theodorou"},{"full_name":"Brown, Mark","first_name":"Mark","last_name":"Brown"},{"last_name":"Paxton","first_name":"Robert","full_name":"Paxton, Robert"}],"issue":"3","publisher":"Wiley","department":[{"_id":"SyCr"}],"type":"journal_article","language":[{"iso":"eng"}],"intvolume":"        84","_id":"1855"},{"oa":1,"date_published":"2015-02-01T00:00:00Z","arxiv":1,"publication":"Journal of the ACM","isi":1,"volume":62,"date_updated":"2025-09-23T09:33:01Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","day":"01","year":"2015","publication_status":"published","doi":"10.1145/2699430","abstract":[{"lang":"eng","text":"The traditional synthesis question given a specification asks for the automatic construction of a system that satisfies the specification, whereas often there exists a preference order among the different systems that satisfy the given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if it generates a higher expected value. We solve the following optimal synthesis problem: given an omega-regular specification, a Markov chain that describes the distribution of inputs, and a weighted automaton that measures how well a system satisfies the given specification under the input assumption, synthesize a system that optimizes the measured value. For safety specifications and quantitative measures that are defined by mean-payoff automata, the optimal synthesis problem reduces to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be achieved in polynomial time. For general omega-regular specifications along with mean-payoff automata, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives. Our algorithm constructs optimal strategies that consist of two memoryless strategies and a counter. The counter is in general not bounded. To obtain a finite-state system, we show how to construct an ε-optimal strategy with a bounded counter, for all ε &gt; 0. Furthermore, we show how to decide in polynomial time if it is possible to construct an optimal finite-state system (i.e., a system without a counter) for a given specification. We have implemented our approach and the underlying algorithms in a tool that takes qualitative and quantitative specifications and automatically constructs a system that satisfies the qualitative specification and optimizes the quantitative specification, if such a system exists. We present some experimental results showing optimal systems that were automatically generated in this way."}],"oa_version":"Preprint","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments.” <i>Journal of the ACM</i>. ACM, 2015. <a href=\"https://doi.org/10.1145/2699430\">https://doi.org/10.1145/2699430</a>.","mla":"Chatterjee, Krishnendu, et al. “Measuring and Synthesizing Systems in Probabilistic Environments.” <i>Journal of the ACM</i>, vol. 62, no. 1, 9, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2699430\">10.1145/2699430</a>.","ista":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2015. Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. 62(1), 9.","apa":"Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Singh, R. (2015). Measuring and synthesizing systems in probabilistic environments. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2699430\">https://doi.org/10.1145/2699430</a>","short":"K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, Journal of the ACM 62 (2015).","ama":"Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing systems in probabilistic environments. <i>Journal of the ACM</i>. 2015;62(1). doi:<a href=\"https://doi.org/10.1145/2699430\">10.1145/2699430</a>","ieee":"K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” <i>Journal of the ACM</i>, vol. 62, no. 1. ACM, 2015."},"status":"public","month":"02","related_material":{"record":[{"id":"3864","status":"public","relation":"earlier_version"}]},"external_id":{"arxiv":["1004.0739"],"isi":["000350563000009"]},"title":"Measuring and synthesizing systems in probabilistic environments","article_processing_charge":"No","date_created":"2018-12-11T11:54:23Z","publist_id":"5244","type":"journal_article","language":[{"iso":"eng"}],"intvolume":"        62","ec_funded":1,"_id":"1856","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"issue":"1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publisher":"ACM","main_file_link":[{"url":"https://arxiv.org/abs/1004.0739","open_access":"1"}],"article_number":"9","quality_controlled":"1","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"first_name":"Barbara","full_name":"Jobstmann, Barbara","last_name":"Jobstmann"},{"last_name":"Singh","first_name":"Rohit","full_name":"Singh, Rohit"}]},{"day":"01","year":"2015","conference":{"start_date":"2015-06-07","end_date":"2015-06-12","location":"Boston, MA, United States","name":"CVPR: Computer Vision and Pattern Recognition"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","date_updated":"2025-06-11T07:19:52Z","oa":1,"arxiv":1,"date_published":"2015-06-01T00:00:00Z","status":"public","month":"06","oa_version":"Preprint","citation":{"mla":"Pentina, Anastasia, et al. <i>Curriculum Learning of Multiple Tasks</i>. IEEE, 2015, pp. 5492–500, doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7299188\">10.1109/CVPR.2015.7299188</a>.","chicago":"Pentina, Anastasia, Viktoriia Sharmanska, and Christoph Lampert. “Curriculum Learning of Multiple Tasks,” 5492–5500. IEEE, 2015. <a href=\"https://doi.org/10.1109/CVPR.2015.7299188\">https://doi.org/10.1109/CVPR.2015.7299188</a>.","apa":"Pentina, A., Sharmanska, V., &#38; Lampert, C. (2015). Curriculum learning of multiple tasks (pp. 5492–5500). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2015.7299188\">https://doi.org/10.1109/CVPR.2015.7299188</a>","ista":"Pentina A, Sharmanska V, Lampert C. 2015. Curriculum learning of multiple tasks. CVPR: Computer Vision and Pattern Recognition, 5492–5500.","short":"A. Pentina, V. Sharmanska, C. Lampert, in:, IEEE, 2015, pp. 5492–5500.","ama":"Pentina A, Sharmanska V, Lampert C. Curriculum learning of multiple tasks. In: IEEE; 2015:5492-5500. doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7299188\">10.1109/CVPR.2015.7299188</a>","ieee":"A. Pentina, V. Sharmanska, and C. Lampert, “Curriculum learning of multiple tasks,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States, 2015, pp. 5492–5500."},"abstract":[{"lang":"eng","text":"Sharing information between multiple tasks enables algorithms to achieve good generalization performance even from small amounts of training data. However, in a realistic scenario of multi-task learning not all tasks are equally related to each other, hence it could be advantageous to transfer information only between the most related tasks. In this work we propose an approach that processes multiple tasks in a sequence with sharing between subsequent tasks instead of solving all tasks jointly. Subsequently, we address the question of curriculum learning of tasks, i.e. finding the best order of tasks to be learned. Our approach is based on a generalization bound criterion for choosing the task order that optimizes the average expected classification performance over all tasks. Our experimental results show that learning multiple related tasks sequentially can be more effective than learning them jointly, the order in which tasks are being solved affects the overall performance, and that our model is able to automatically discover the favourable order of tasks. "}],"doi":"10.1109/CVPR.2015.7299188","page":"5492 - 5500","publication_status":"published","publist_id":"5243","date_created":"2018-12-11T11:54:23Z","corr_author":"1","title":"Curriculum learning of multiple tasks","article_processing_charge":"No","external_id":{"arxiv":["1412.1353"]},"main_file_link":[{"url":"http://arxiv.org/abs/1412.1353","open_access":"1"}],"quality_controlled":"1","author":[{"id":"42E87FC6-F248-11E8-B48F-1D18A9856A87","last_name":"Pentina","full_name":"Pentina, Anastasia","first_name":"Anastasia"},{"first_name":"Viktoriia","full_name":"Sharmanska, Viktoriia","last_name":"Sharmanska","orcid":"0000-0003-0192-9308","id":"2EA6D09E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","last_name":"Lampert"}],"publisher":"IEEE","department":[{"_id":"ChLa"}],"type":"conference","language":[{"iso":"eng"}],"_id":"1857"},{"title":"Predicting the future behavior of a time-varying probability distribution","date_updated":"2024-10-09T20:56:24Z","external_id":{"arxiv":["1406.5362"]},"oa":1,"date_published":"2015-10-15T00:00:00Z","arxiv":1,"day":"15","conference":{"location":"Boston, MA, United States","name":"CVPR: Computer Vision and Pattern Recognition","start_date":"2015-06-07","end_date":"2015-06-12"},"year":"2015","publist_id":"5241","date_created":"2018-12-11T11:54:24Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","scopus_import":1,"doi":"10.1109/CVPR.2015.7298696","abstract":[{"text":"We study the problem of predicting the future, though only in the probabilistic sense of estimating a future state of a time-varying probability distribution. This is not only an interesting academic problem, but solving this extrapolation problem also has many practical application, e.g. for training classifiers that have to operate under time-varying conditions. Our main contribution is a method for predicting the next step of the time-varying distribution from a given sequence of sample sets from earlier time steps. For this we rely on two recent machine learning techniques: embedding probability distributions into a reproducing kernel Hilbert space, and learning operators by vector-valued regression. We illustrate the working principles and the practical usefulness of our method by experiments on synthetic and real data. We also highlight an exemplary application: training a classifier in a domain adaptation setting without having access to examples from the test time distribution at training time.","lang":"eng"}],"type":"conference","language":[{"iso":"eng"}],"page":"942 - 950","publication_status":"published","_id":"1858","status":"public","month":"10","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1406.5362"}],"quality_controlled":"1","author":[{"last_name":"Lampert","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Lampert, Christoph"}],"department":[{"_id":"ChLa"}],"publisher":"IEEE","oa_version":"Preprint","citation":{"short":"C. Lampert, in:, IEEE, 2015, pp. 942–950.","ama":"Lampert C. Predicting the future behavior of a time-varying probability distribution. In: IEEE; 2015:942-950. doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7298696\">10.1109/CVPR.2015.7298696</a>","ieee":"C. Lampert, “Predicting the future behavior of a time-varying probability distribution,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States, 2015, pp. 942–950.","mla":"Lampert, Christoph. <i>Predicting the Future Behavior of a Time-Varying Probability Distribution</i>. IEEE, 2015, pp. 942–50, doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7298696\">10.1109/CVPR.2015.7298696</a>.","chicago":"Lampert, Christoph. “Predicting the Future Behavior of a Time-Varying Probability Distribution,” 942–50. IEEE, 2015. <a href=\"https://doi.org/10.1109/CVPR.2015.7298696\">https://doi.org/10.1109/CVPR.2015.7298696</a>.","apa":"Lampert, C. (2015). Predicting the future behavior of a time-varying probability distribution (pp. 942–950). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2015.7298696\">https://doi.org/10.1109/CVPR.2015.7298696</a>","ista":"Lampert C. 2015. Predicting the future behavior of a time-varying probability distribution. CVPR: Computer Vision and Pattern Recognition, 942–950."}},{"corr_author":"1","date_created":"2018-12-11T11:54:24Z","publist_id":"5240","external_id":{"arxiv":["1408.6804"]},"article_processing_charge":"No","title":"A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle","publisher":"IEEE","department":[{"_id":"VlKo"},{"_id":"ChLa"}],"author":[{"full_name":"Shah, Neel","first_name":"Neel","id":"31ABAF80-F248-11E8-B48F-1D18A9856A87","last_name":"Shah"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir"},{"full_name":"Lampert, Christoph","first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1408.6804"}],"_id":"1859","ec_funded":1,"language":[{"iso":"eng"}],"type":"conference","project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7"},{"name":"Discrete Optimization in Computer Vision: Theory and Practice","call_identifier":"FP7","grant_number":"616160","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Boston, MA, USA","name":"CVPR: Computer Vision and Pattern Recognition","start_date":"2015-06-07","end_date":"2015-06-12"},"year":"2015","day":"01","arxiv":1,"date_published":"2015-06-01T00:00:00Z","oa":1,"date_updated":"2025-06-11T07:20:12Z","citation":{"ieee":"N. Shah, V. Kolmogorov, and C. Lampert, “A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA, 2015, pp. 2737–2745.","ama":"Shah N, Kolmogorov V, Lampert C. A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle. In: IEEE; 2015:2737-2745. doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7298890\">10.1109/CVPR.2015.7298890</a>","short":"N. Shah, V. Kolmogorov, C. Lampert, in:, IEEE, 2015, pp. 2737–2745.","apa":"Shah, N., Kolmogorov, V., &#38; Lampert, C. (2015). A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle (pp. 2737–2745). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2015.7298890\">https://doi.org/10.1109/CVPR.2015.7298890</a>","ista":"Shah N, Kolmogorov V, Lampert C. 2015. A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle. CVPR: Computer Vision and Pattern Recognition, 2737–2745.","mla":"Shah, Neel, et al. <i>A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm for Training Structural SVMs with a Costly Max-Oracle</i>. IEEE, 2015, pp. 2737–45, doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7298890\">10.1109/CVPR.2015.7298890</a>.","chicago":"Shah, Neel, Vladimir Kolmogorov, and Christoph Lampert. “A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm for Training Structural SVMs with a Costly Max-Oracle,” 2737–45. IEEE, 2015. <a href=\"https://doi.org/10.1109/CVPR.2015.7298890\">https://doi.org/10.1109/CVPR.2015.7298890</a>."},"oa_version":"Preprint","status":"public","month":"06","page":"2737 - 2745","publication_status":"published","abstract":[{"text":"Structural support vector machines (SSVMs) are amongst the best performing models for structured computer vision tasks, such as semantic image segmentation or human pose estimation. Training SSVMs, however, is computationally costly, because it requires repeated calls to a structured prediction subroutine (called \\emph{max-oracle}), which has to solve an optimization problem itself, e.g. a graph cut.\r\nIn this work, we introduce a new algorithm for SSVM training that is more efficient than earlier techniques when the max-oracle is computationally expensive, as it is frequently the case in computer vision tasks. The main idea is to (i) combine the recent stochastic Block-Coordinate Frank-Wolfe algorithm with efficient hyperplane caching, and (ii) use an automatic selection rule for deciding whether to call the exact max-oracle or to rely on an approximate one based on the cached hyperplanes.\r\nWe show experimentally that this strategy leads to faster convergence to the optimum with respect to the number of requires oracle calls, and that this translates into faster convergence with respect to the total runtime when the max-oracle is slow compared to the other steps of the algorithm. ","lang":"eng"}],"doi":"10.1109/CVPR.2015.7298890"},{"status":"public","month":"06","main_file_link":[{"open_access":"1","url":"http://www.cv-foundation.org/openaccess/content_cvpr_2015/papers/Royer_Classifier_Adaptation_at_2015_CVPR_paper.pdf"}],"quality_controlled":"1","author":[{"first_name":"Amélie","full_name":"Royer, Amélie","last_name":"Royer"},{"last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","full_name":"Lampert, Christoph"}],"oa_version":"Submitted Version","department":[{"_id":"ChLa"}],"publisher":"IEEE","citation":{"mla":"Royer, Amélie, and Christoph Lampert. <i>Classifier Adaptation at Prediction Time</i>. IEEE, 2015, pp. 1401–09, doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7298746\">10.1109/CVPR.2015.7298746</a>.","chicago":"Royer, Amélie, and Christoph Lampert. “Classifier Adaptation at Prediction Time,” 1401–9. IEEE, 2015. <a href=\"https://doi.org/10.1109/CVPR.2015.7298746\">https://doi.org/10.1109/CVPR.2015.7298746</a>.","apa":"Royer, A., &#38; Lampert, C. (2015). Classifier adaptation at prediction time (pp. 1401–1409). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2015.7298746\">https://doi.org/10.1109/CVPR.2015.7298746</a>","ista":"Royer A, Lampert C. 2015. Classifier adaptation at prediction time. CVPR: Computer Vision and Pattern Recognition, 1401–1409.","ama":"Royer A, Lampert C. Classifier adaptation at prediction time. In: IEEE; 2015:1401-1409. doi:<a href=\"https://doi.org/10.1109/CVPR.2015.7298746\">10.1109/CVPR.2015.7298746</a>","short":"A. Royer, C. Lampert, in:, IEEE, 2015, pp. 1401–1409.","ieee":"A. Royer and C. Lampert, “Classifier adaptation at prediction time,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States, 2015, pp. 1401–1409."},"abstract":[{"text":"Classifiers for object categorization are usually evaluated by their accuracy on a set of i.i.d. test examples. This provides us with an estimate of the expected error when applying the classifiers to a single new image. In real application, however, classifiers are rarely only used for a single image and then discarded. Instead, they are applied sequentially to many images, and these are typically not i.i.d. samples from a fixed data distribution, but they carry dependencies and their class distribution varies over time. In this work, we argue that the phenomenon of correlated data at prediction time is not a nuisance, but a blessing in disguise. We describe a probabilistic method for adapting classifiers at prediction time without having to retrain them. We also introduce a framework for creating realistically distributed image sequences, which offers a way to benchmark classifier adaptation methods, such as the one we propose. Experiments on the ILSVRC2010 and ILSVRC2012 datasets show that adapting object classification systems at prediction time can significantly reduce their error rate, even with no additional human feedback.","lang":"eng"}],"doi":"10.1109/CVPR.2015.7298746","project":[{"name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425","grant_number":"308036"}],"type":"conference","language":[{"iso":"eng"}],"page":"1401 - 1409","ec_funded":1,"publication_status":"published","_id":"1860","day":"01","year":"2015","conference":{"start_date":"2015-06-07","end_date":"2015-06-12","location":"Boston, MA, United States","name":"CVPR: Computer Vision and Pattern Recognition"},"publist_id":"5239","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:54:24Z","scopus_import":1,"title":"Classifier adaptation at prediction time","date_updated":"2021-01-12T06:53:41Z","oa":1,"date_published":"2015-06-01T00:00:00Z"},{"external_id":{"isi":["000354789200002"]},"article_processing_charge":"No","title":"Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks","date_created":"2018-12-11T11:54:25Z","publist_id":"5238","language":[{"iso":"eng"}],"type":"journal_article","_id":"1861","intvolume":"        25","issue":"2","department":[{"_id":"ToHe"},{"_id":"GaTk"}],"publisher":"ACM","author":[{"full_name":"Ruess, Jakob","first_name":"Jakob","orcid":"0000-0003-1615-3282","id":"4A245D00-F248-11E8-B48F-1D18A9856A87","last_name":"Ruess"},{"full_name":"Lygeros, John","first_name":"John","last_name":"Lygeros"}],"quality_controlled":"1","article_number":"8","date_published":"2015-02-01T00:00:00Z","acknowledgement":"HYCON2; EC; European Commission\r\n","publication":"ACM Transactions on Modeling and Computer Simulation","isi":1,"volume":25,"date_updated":"2025-09-23T09:36:19Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","day":"01","year":"2015","publication_status":"published","doi":"10.1145/2688906","abstract":[{"lang":"eng","text":"Continuous-time Markov chains are commonly used in practice for modeling biochemical reaction networks in which the inherent randomness of themolecular interactions cannot be ignored. This has motivated recent research effort into methods for parameter inference and experiment design for such models. The major difficulty is that such methods usually require one to iteratively solve the chemical master equation that governs the time evolution of the probability distribution of the system. This, however, is rarely possible, and even approximation techniques remain limited to relatively small and simple systems. An alternative explored in this article is to base methods on only some low-order moments of the entire probability distribution. We summarize the theory behind such moment-based methods for parameter inference and experiment design and provide new case studies where we investigate their performance."}],"citation":{"chicago":"Ruess, Jakob, and John Lygeros. “Moment-Based Methods for Parameter Inference and Experiment Design for Stochastic Biochemical Reaction Networks.” <i>ACM Transactions on Modeling and Computer Simulation</i>. ACM, 2015. <a href=\"https://doi.org/10.1145/2688906\">https://doi.org/10.1145/2688906</a>.","mla":"Ruess, Jakob, and John Lygeros. “Moment-Based Methods for Parameter Inference and Experiment Design for Stochastic Biochemical Reaction Networks.” <i>ACM Transactions on Modeling and Computer Simulation</i>, vol. 25, no. 2, 8, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2688906\">10.1145/2688906</a>.","ista":"Ruess J, Lygeros J. 2015. Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks. ACM Transactions on Modeling and Computer Simulation. 25(2), 8.","apa":"Ruess, J., &#38; Lygeros, J. (2015). Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks. <i>ACM Transactions on Modeling and Computer Simulation</i>. ACM. <a href=\"https://doi.org/10.1145/2688906\">https://doi.org/10.1145/2688906</a>","short":"J. Ruess, J. Lygeros, ACM Transactions on Modeling and Computer Simulation 25 (2015).","ama":"Ruess J, Lygeros J. Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks. <i>ACM Transactions on Modeling and Computer Simulation</i>. 2015;25(2). doi:<a href=\"https://doi.org/10.1145/2688906\">10.1145/2688906</a>","ieee":"J. Ruess and J. Lygeros, “Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks,” <i>ACM Transactions on Modeling and Computer Simulation</i>, vol. 25, no. 2. ACM, 2015."},"oa_version":"None","month":"02","status":"public"}]