[{"month":"09","oa":1,"extern":"1","_id":"18415","quality_controlled":"1","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","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"}],"date_published":"2015-09-01T00:00:00Z","publication_identifier":{"issn":["0162-8828"],"eissn":["1939-3539"]},"citation":{"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>","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.","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>","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.","short":"P. Sprechmann, A.M. Bronstein, G. Sapiro, IEEE Transactions on Pattern Analysis and Machine Intelligence 37 (2015) 1821–1833."},"doi":"10.1109/tpami.2015.2392779","scopus_import":"1","type":"journal_article","fulldoi":"https://doi.org/10.1109/tpami.2015.2392779","publication_status":"published","intvolume":"        37","day":"01","external_id":{"arxiv":["1212.3631"],"pmid":["26353129"]},"issue":"9","oa_version":"Preprint","arxiv":1,"article_processing_charge":"No","title":"Learning efficient sparse and low rank models","pmid":1,"date_created":"2024-10-15T11:20:55Z","publisher":"IEEE","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2015","author":[{"last_name":"Sprechmann","full_name":"Sprechmann, P.","first_name":"P."},{"orcid":"0000-0001-9699-8730","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein","full_name":"Bronstein, Alexander","first_name":"Alexander"},{"first_name":"G.","last_name":"Sapiro","full_name":"Sapiro, G."}],"status":"public","volume":37,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1212.3631","open_access":"1"}],"language":[{"iso":"eng"}],"date_updated":"2024-12-18T11:40:35Z","page":"1821-1833"},{"volume":37,"status":"public","author":[{"last_name":"Eynard","full_name":"Eynard, Davide","first_name":"Davide"},{"full_name":"Kovnatsky, Artiom","last_name":"Kovnatsky","first_name":"Artiom"},{"first_name":"Michael M.","full_name":"Bronstein, Michael M.","last_name":"Bronstein"},{"first_name":"Klaus","full_name":"Glashoff, Klaus","last_name":"Glashoff"},{"orcid":"0000-0001-9699-8730","first_name":"Alexander","full_name":"Bronstein, Alexander","last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6"}],"year":"2015","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","page":"2505-2517","date_updated":"2024-12-12T14:08:46Z","language":[{"iso":"eng"}],"oa_version":"None","issue":"12","external_id":{"pmid":["26539854"]},"publisher":"IEEE","date_created":"2024-10-15T11:20:55Z","pmid":1,"title":"Multimodal manifold snalysis by simultaneous diagonalization of Laplacians","article_processing_charge":"No","scopus_import":"1","doi":"10.1109/tpami.2015.2408348","citation":{"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>","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.","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.","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.","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>."},"publication_identifier":{"issn":["0162-8828"],"eissn":["1939-3539"]},"date_published":"2015-12-01T00:00:00Z","day":"01","intvolume":"        37","fulldoi":"https://doi.org/10.1109/tpami.2015.2408348","publication_status":"published","type":"journal_article","extern":"1","_id":"18416","month":"12","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."}],"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","quality_controlled":"1"},{"day":"01","intvolume":"        34","publication_status":"published","fulldoi":"https://doi.org/10.1111/cgf.12454","type":"journal_article","date_published":"2015-02-01T00:00:00Z","scopus_import":"1","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.","short":"S. Korman, R. Litman, S. Avidan, A.M. Bronstein, Computer Graphics Forum 34 (2015) 2–13.","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>.","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>","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.","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>"},"publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"doi":"10.1111/cgf.12454","quality_controlled":"1","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"}],"publication":"Computer Graphics Forum","extern":"1","_id":"18424","oa":1,"month":"02","date_updated":"2024-12-19T10:12:48Z","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1403.6637","open_access":"1"}],"page":"2-13","status":"public","author":[{"first_name":"Simon","full_name":"Korman, Simon","last_name":"Korman"},{"first_name":"Roee","last_name":"Litman","full_name":"Litman, Roee"},{"first_name":"Shai","full_name":"Avidan, Shai","last_name":"Avidan"},{"orcid":"0000-0001-9699-8730","last_name":"Bronstein","full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander"}],"year":"2015","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","volume":34,"title":"Probably approximately symmetric: Fast rigid symmetry detection with global guarantees","article_processing_charge":"No","publisher":"Wiley","date_created":"2024-10-15T11:20:55Z","external_id":{"arxiv":["1403.6637"]},"arxiv":1,"oa_version":"Preprint","issue":"1"},{"article_processing_charge":"No","title":"Recent trends, applications, and perspectives in 3D shape similarity assessment","quality_controlled":"1","date_created":"2024-10-15T11:20:55Z","publication":"Computer Graphics Forum","publisher":"Wiley","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."}],"oa_version":"None","issue":"6","month":"09","extern":"1","_id":"18425","fulldoi":"https://doi.org/10.1111/cgf.12734","publication_status":"published","language":[{"iso":"eng"}],"type":"journal_article","day":"01","intvolume":"        35","date_updated":"2024-12-19T13:44:16Z","page":"87-119","year":"2015","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_published":"2015-09-01T00:00:00Z","status":"public","author":[{"first_name":"S.","last_name":"Biasotti","full_name":"Biasotti, S."},{"full_name":"Cerri, A.","last_name":"Cerri","first_name":"A."},{"first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","last_name":"Bronstein","full_name":"Bronstein, Alexander","orcid":"0000-0001-9699-8730"},{"first_name":"M.","full_name":"Bronstein, M.","last_name":"Bronstein"}],"volume":35,"publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"doi":"10.1111/cgf.12734","citation":{"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.","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>","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>","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.","short":"S. Biasotti, A. Cerri, A.M. Bronstein, M. Bronstein, Computer Graphics Forum 35 (2015) 87–119."},"scopus_import":"1"},{"date_updated":"2024-12-19T10:48:50Z","main_file_link":[{"url":"https://doi.org/10.1364/OE.23.024547","open_access":"1"}],"language":[{"iso":"eng"}],"page":"24547 - 24556","author":[{"last_name":"Haim","full_name":"Haim, Harel","first_name":"Harel"},{"orcid":"0000-0001-9699-8730","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","last_name":"Bronstein"},{"full_name":"Marom, Emanuel","last_name":"Marom","first_name":"Emanuel"}],"status":"public","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2015","volume":23,"title":"Computational multi-focus imaging combining sparse model with color dependent phase mask","article_processing_charge":"No","publisher":"Optica Publishing Group","date_created":"2024-10-15T11:20:55Z","issue":"19","oa_version":"Published Version","intvolume":"        23","day":"10","type":"journal_article","publication_status":"published","fulldoi":"https://doi.org/10.1364/oe.23.024547","date_published":"2015-09-10T00:00:00Z","scopus_import":"1","publication_identifier":{"eissn":["1094-4087"]},"citation":{"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>.","short":"H. Haim, A.M. Bronstein, E. Marom, Optics Express 23 (2015) 24547–24556.","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>","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.","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>"},"doi":"10.1364/oe.23.024547","quality_controlled":"1","publication":"Optics Express","extern":"1","_id":"18436","month":"09","oa":1},{"type":"conference","main_file_link":[{"url":"https://doi.org/10.4108/eai.14-10-2015.2261657","open_access":"1"}],"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.4108/eai.14-10-2015.2261657","publication_status":"published","date_updated":"2024-12-19T13:36:57Z","day":"22","citation":{"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.","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>","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>","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>.","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>.","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.","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."},"publication_identifier":{"isbn":["9781631900884"]},"doi":"10.4108/eai.14-10-2015.2261657","scopus_import":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2015","author":[{"first_name":"Qiang","last_name":"Qiu","full_name":"Qiu, Qiang"},{"first_name":"Zhuoqing","last_name":"Chang","full_name":"Chang, Zhuoqing"},{"full_name":"Draelos, Mark","last_name":"Draelos","first_name":"Mark"},{"last_name":"Chen","full_name":"Chen, Jie","first_name":"Jie"},{"orcid":"0000-0001-9699-8730","first_name":"Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","full_name":"Bronstein, Alexander","last_name":"Bronstein"},{"first_name":"Guillermo","full_name":"Sapiro, Guillermo","last_name":"Sapiro"}],"date_published":"2015-12-22T00:00:00Z","status":"public","publication":"Proceedings of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare","date_created":"2024-10-15T11:20:55Z","publisher":"ICST","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."}],"article_processing_charge":"No","quality_controlled":"1","title":"Low-cost gaze and pulse analysis using realsense","month":"12","oa":1,"oa_version":"Published Version","extern":"1","_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"}},{"department":[{"_id":"LaEr"}],"date_published":"2015-08-01T00:00:00Z","citation":{"ama":"Erdös L, Yau H. Gap universality of generalized Wigner and β ensembles. <i>Journal of the European Mathematical Society</i>. 2015;17(8):1927-2036. doi:<a href=\"https://doi.org/10.4171/JEMS/548\">10.4171/JEMS/548</a>","ieee":"L. Erdös and H. Yau, “Gap universality of generalized Wigner and β ensembles,” <i>Journal of the European Mathematical Society</i>, vol. 17, no. 8. EMS Press, pp. 1927–2036, 2015.","apa":"Erdös, L., &#38; Yau, H. (2015). Gap universality of generalized Wigner and β ensembles. <i>Journal of the European Mathematical Society</i>. EMS Press. <a href=\"https://doi.org/10.4171/JEMS/548\">https://doi.org/10.4171/JEMS/548</a>","ista":"Erdös L, Yau H. 2015. Gap universality of generalized Wigner and β ensembles. Journal of the European Mathematical Society. 17(8), 1927–2036.","short":"L. Erdös, H. Yau, Journal of the European Mathematical Society 17 (2015) 1927–2036.","chicago":"Erdös, László, and Horng Yau. “Gap Universality of Generalized Wigner and β Ensembles.” <i>Journal of the European Mathematical Society</i>. EMS Press, 2015. <a href=\"https://doi.org/10.4171/JEMS/548\">https://doi.org/10.4171/JEMS/548</a>.","mla":"Erdös, László, and Horng Yau. “Gap Universality of Generalized Wigner and β Ensembles.” <i>Journal of the European Mathematical Society</i>, vol. 17, no. 8, EMS Press, 2015, pp. 1927–2036, doi:<a href=\"https://doi.org/10.4171/JEMS/548\">10.4171/JEMS/548</a>."},"doi":"10.4171/JEMS/548","scopus_import":"1","publication_status":"published","fulldoi":"https://doi.org/10.4171/JEMS/548","type":"journal_article","day":"01","intvolume":"        17","oa":1,"month":"08","_id":"1508","quality_controlled":"1","publist_id":"5669","publication":"Journal of the European Mathematical Society","abstract":[{"text":"We consider generalized Wigner ensembles and general β-ensembles with analytic potentials for any β ≥ 1. The recent universality results in particular assert that the local averages of consecutive eigenvalue gaps in the bulk of the spectrum are universal in the sense that they coincide with those of the corresponding Gaussian β-ensembles. In this article, we show that local averaging is not necessary for this result, i.e. we prove that the single gap distributions in the bulk are universal. In fact, with an additional step, our result can be extended to any C4(ℝ) potential.","lang":"eng"}],"year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","author":[{"orcid":"0000-0001-5366-9603","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László","last_name":"Erdös"},{"last_name":"Yau","full_name":"Yau, Horng","first_name":"Horng"}],"volume":17,"isi":1,"das_tickbox":"1","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1211.3786"}],"date_updated":"2026-07-06T11:55:30Z","page":"1927 - 2036","external_id":{"arxiv":["1211.3786"],"isi":["000360822900003"]},"oa_version":"Preprint","issue":"8","arxiv":1,"article_processing_charge":"No","title":"Gap universality of generalized Wigner and β ensembles","date_created":"2018-12-11T11:52:26Z","publisher":"EMS Press"},{"article_number":"20","date_updated":"2026-07-06T13:24:05Z","language":[{"iso":"eng"}],"das_tickbox":"1","license":"https://creativecommons.org/licenses/by-nd/4.0/","isi":1,"volume":11,"status":"public","author":[{"first_name":"Soham","full_name":"Chakraborty, Soham","last_name":"Chakraborty"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Sezgin, Ali","last_name":"Sezgin","first_name":"Ali"},{"first_name":"Viktor","last_name":"Vafeiadis","full_name":"Vafeiadis, Viktor"}],"corr_author":"1","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"International Federation for Computational Logic","date_created":"2018-12-11T11:54:15Z","related_material":{"record":[{"id":"2328","relation":"earlier_version","status":"public"}]},"title":"Aspect-oriented linearizability proofs","pubrep_id":"390","article_processing_charge":"No","ec_funded":1,"file_date_updated":"2020-07-14T12:45:17Z","ddc":["000"],"tmp":{"short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png"},"oa_version":"Published Version","issue":"1","external_id":{"isi":["000353193000019"]},"project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"}],"day":"01","intvolume":"        11","publication_status":"published","fulldoi":"https://doi.org/10.2168/LMCS-11(1:20)2015","type":"journal_article","has_accepted_license":"1","file":[{"content_type":"application/pdf","file_size":380203,"date_updated":"2020-07-14T12:45:17Z","relation":"main_file","creator":"system","access_level":"open_access","date_created":"2018-12-12T10:11:27Z","checksum":"7370e164d0a731f442424a92669efc34","file_name":"IST-2015-390-v1+1_1502.07639.pdf","file_id":"4881"}],"scopus_import":"1","citation":{"ieee":"S. Chakraborty, T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” <i>Logical Methods in Computer Science</i>, vol. 11, no. 1. International Federation for Computational Logic, 2015.","apa":"Chakraborty, S., Henzinger, T. A., Sezgin, A., &#38; Vafeiadis, V. (2015). Aspect-oriented linearizability proofs. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">https://doi.org/10.2168/LMCS-11(1:20)2015</a>","ama":"Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs. <i>Logical Methods in Computer Science</i>. 2015;11(1). doi:<a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">10.2168/LMCS-11(1:20)2015</a>","chicago":"Chakraborty, Soham, Thomas A Henzinger, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented Linearizability Proofs.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2015. <a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">https://doi.org/10.2168/LMCS-11(1:20)2015</a>.","mla":"Chakraborty, Soham, et al. “Aspect-Oriented Linearizability Proofs.” <i>Logical Methods in Computer Science</i>, vol. 11, no. 1, 20, International Federation for Computational Logic, 2015, doi:<a href=\"https://doi.org/10.2168/LMCS-11(1:20)2015\">10.2168/LMCS-11(1:20)2015</a>.","ista":"Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. 2015. Aspect-oriented linearizability proofs. Logical Methods in Computer Science. 11(1), 20.","short":"S. Chakraborty, T.A. Henzinger, A. Sezgin, V. Vafeiadis, Logical Methods in Computer Science 11 (2015)."},"doi":"10.2168/LMCS-11(1:20)2015","date_published":"2015-04-01T00:00:00Z","article_type":"original","department":[{"_id":"ToHe"}],"abstract":[{"text":"Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on the identification of the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates. In response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof. ","lang":"eng"}],"publist_id":"5271","publication":"Logical Methods in Computer Science","quality_controlled":"1","_id":"1832","oa":1,"month":"04"},{"page":"121 - 133","date_updated":"2026-07-06T13:27:53Z","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1504.08259","open_access":"1"}],"isi":1,"volume":9135,"status":"public","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus"},{"first_name":"Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","full_name":"Otop, Jan"}],"year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","date_created":"2018-12-11T11:53:01Z","related_material":{"record":[{"id":"5438","status":"public","relation":"earlier_version"},{"status":"public","relation":"later_version","id":"465"}]},"OA_place":"repository","pubrep_id":"321","title":"Edit distance for pushdown automata","article_processing_charge":"No","ec_funded":1,"arxiv":1,"oa_version":"Preprint","issue":"Part II","external_id":{"arxiv":["1504.08259"],"isi":["000364317900010"]},"project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"},{"grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"},{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"day":"01","intvolume":"      9135","fulldoi":"https://doi.org/10.1007/978-3-662-47666-6_10","publication_status":"published","type":"conference","scopus_import":"1","publication_identifier":{"isbn":["978-3-662-47665-9"]},"doi":"10.1007/978-3-662-47666-6_10","alternative_title":["LNCS"],"citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” In <i>42nd International Colloquium on Automata, Languages, and Programming</i>, 9135:121–33. Springer Nature, 2015. <a href=\"https://doi.org/10.1007/978-3-662-47666-6_10\">https://doi.org/10.1007/978-3-662-47666-6_10</a>.","mla":"Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” <i>42nd International Colloquium on Automata, Languages, and Programming</i>, vol. 9135, no. Part II, Springer Nature, 2015, pp. 121–33, doi:<a href=\"https://doi.org/10.1007/978-3-662-47666-6_10\">10.1007/978-3-662-47666-6_10</a>.","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, in:, 42nd International Colloquium on Automata, Languages, and Programming, Springer Nature, 2015, pp. 121–133.","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata. 42nd International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 9135, 121–133.","ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” in <i>42nd International Colloquium on Automata, Languages, and Programming</i>, Kyoto, Japan, 2015, vol. 9135, no. Part II, pp. 121–133.","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &#38; Otop, J. (2015). Edit distance for pushdown automata. In <i>42nd International Colloquium on Automata, Languages, and Programming</i> (Vol. 9135, pp. 121–133). Kyoto, Japan: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-47666-6_10\">https://doi.org/10.1007/978-3-662-47666-6_10</a>","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown automata. In: <i>42nd International Colloquium on Automata, Languages, and Programming</i>. Vol 9135. Springer Nature; 2015:121-133. doi:<a href=\"https://doi.org/10.1007/978-3-662-47666-6_10\">10.1007/978-3-662-47666-6_10</a>"},"date_published":"2015-07-01T00:00:00Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"abstract":[{"lang":"eng","text":"The edit distance between two words w1, w2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w1 to w2. The edit distance generalizes to languages L1,L2, where the edit distance is the minimal number k such that for every word from L1 there exists a word in L2 with edit distance at most k. We study the edit distance computation problem between pushdown automata and their subclasses. The problem of computing edit distance to pushdown automata is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for deciding whether, for a given threshold k, the edit distance from a pushdown automaton to a finite automaton is at most k."}],"publist_id":"5556","publication":"42nd International Colloquium on Automata, Languages, and Programming","quality_controlled":"1","acknowledgement":"This research was funded in part by the European Research Council (ERC) under\r\ngrant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF) projects\r\nS11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), FWF Grant No P23499-\r\nN23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph\r\nGames), and MSR faculty fellows award.","_id":"1610","oa":1,"month":"07","conference":{"start_date":"2015-07-06","location":"Kyoto, Japan","end_date":"2015-07-10","name":"ICALP: Automata, Languages and Programming"},"OA_type":"green"},{"status":"public","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"last_name":"Komárková","full_name":"Komárková, Zuzana","first_name":"Zuzana"},{"orcid":"0000-0002-8122-2881","first_name":"Jan","full_name":"Kretinsky, Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"}],"year":"2015","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"date_updated":"2026-07-06T13:26:26Z","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.15479/AT:IST-2015-318-v1-1","open_access":"1"}],"page":"244 - 256","external_id":{"isi":["000380427100024"]},"ec_funded":1,"oa_version":"Preprint","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","article_processing_charge":"No","publisher":"IEEE","date_created":"2018-12-11T11:53:18Z","OA_place":"repository","related_material":{"record":[{"id":"5429","relation":"earlier_version","status":"public"},{"status":"public","relation":"earlier_version","id":"5435"},{"relation":"later_version","status":"public","id":"466"}]},"date_published":"2015-07-01T00:00:00Z","series_title":"LICS","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"scopus_import":"1","doi":"10.1109/LICS.2015.32","citation":{"chicago":"Chatterjee, Krishnendu, Zuzana Komárková, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” LICS. IEEE, 2015. <a href=\"https://doi.org/10.1109/LICS.2015.32\">https://doi.org/10.1109/LICS.2015.32</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IEEE, 2015, pp. 244–56, doi:<a href=\"https://doi.org/10.1109/LICS.2015.32\">10.1109/LICS.2015.32</a>.","short":"K. Chatterjee, Z. Komárková, J. Kretinsky, (2015) 244–256.","ista":"Chatterjee K, Komárková Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes. , 244–256.","ieee":"K. Chatterjee, Z. Komárková, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes.” IEEE, pp. 244–256, 2015.","apa":"Chatterjee, K., Komárková, Z., &#38; Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE. <a href=\"https://doi.org/10.1109/LICS.2015.32\">https://doi.org/10.1109/LICS.2015.32</a>","ama":"Chatterjee K, Komárková Z, Kretinsky J. Unifying two views on multiple mean-payoff objectives in Markov decision processes. 2015:244-256. doi:<a href=\"https://doi.org/10.1109/LICS.2015.32\">10.1109/LICS.2015.32</a>"},"alternative_title":["LICS"],"day":"01","publication_status":"published","fulldoi":"https://doi.org/10.1109/LICS.2015.32","type":"conference","project":[{"call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"},{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","grant_number":"291734"}],"OA_type":"green","conference":{"start_date":"2015-07-06","location":"Kyoto, Japan","end_date":"2015-07-10","name":"LICS: Logic in Computer Science"},"_id":"1657","oa":1,"month":"07","quality_controlled":"1","acknowledgement":"A Technical Report of this paper is available at DOI: 10.15479/AT:IST-2015-318-v1-1\r\n","abstract":[{"lang":"eng","text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. There exist two different views: (i) ~the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) ~the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector. We consider optimization with respect to both objectives at once, thus unifying the existing semantics. Precisely, the goal is to optimize the expectation while ensuring the satisfaction constraint. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., Ensure certain probabilistic guarantee). Our main results are as follows: First, we present algorithms for the decision problems, which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Second, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem. "}],"publist_id":"5493"},{"language":[{"iso":"eng"}],"date_updated":"2026-07-06T13:26:26Z","page":"51","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Zuzana","full_name":"Komarkova, Zuzana","last_name":"Komarkova"},{"first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","last_name":"Kretinsky","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881"}],"status":"public","pubrep_id":"327","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5429"},{"id":"1657","relation":"later_version","status":"public"},{"relation":"later_version","status":"public","id":"466"}]},"date_created":"2018-12-12T11:39:19Z","publisher":"IST Austria","ddc":["004"],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:53Z","type":"technical_report","fulldoi":"https://doi.org/10.15479/AT:IST-2015-318-v2-1","publication_status":"published","day":"23","department":[{"_id":"KrCh"}],"date_published":"2015-02-23T00:00:00Z","doi":"10.15479/AT:IST-2015-318-v2-1","citation":{"ama":"Chatterjee K, Komarkova Z, Kretinsky J. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">10.15479/AT:IST-2015-318-v2-1</a>","ieee":"K. Chatterjee, Z. Komarkova, and J. Kretinsky, <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria, 2015.","apa":"Chatterjee, K., Komarkova, Z., &#38; Kretinsky, J. (2015). <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">https://doi.org/10.15479/AT:IST-2015-318-v2-1</a>","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 51p.","short":"K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.","chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">https://doi.org/10.15479/AT:IST-2015-318-v2-1</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v2-1\">10.15479/AT:IST-2015-318-v2-1</a>."},"publication_identifier":{"issn":["2664-1690"]},"alternative_title":["IST Austria Technical Report"],"file":[{"relation":"main_file","date_updated":"2020-07-14T12:46:53Z","file_size":717630,"content_type":"application/pdf","date_created":"2018-12-12T11:54:03Z","access_level":"open_access","creator":"system","file_name":"IST-2015-318-v2+1_main.pdf","checksum":"75284adec80baabdfe71ff9ebbc27445","file_id":"5525"}],"has_accepted_license":"1","abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. \r\nThere have been two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector.  \r\nWe consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).\r\nOur main results are algorithms for the decision problem which are always polynomial in the size of the MDP.\r\nWe also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Finally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.","lang":"eng"}],"month":"02","oa":1,"_id":"5435"},{"date_published":"2015-01-12T00:00:00Z","department":[{"_id":"KrCh"}],"has_accepted_license":"1","file":[{"date_created":"2018-12-12T11:54:11Z","access_level":"open_access","creator":"system","file_size":689863,"content_type":"application/pdf","relation":"main_file","date_updated":"2020-07-14T12:46:52Z","file_id":"5533","checksum":"e4869a584567c506349abda9c8ec7db3","file_name":"IST-2015-318-v1+1_main.pdf"}],"alternative_title":["IST Austria Technical Report"],"doi":"10.15479/AT:IST-2015-318-v1-1","publication_identifier":{"issn":["2664-1690"]},"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">10.15479/AT:IST-2015-318-v1-1</a>.","chicago":"Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">https://doi.org/10.15479/AT:IST-2015-318-v1-1</a>.","short":"K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.","ista":"Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple mean-payoff objectives in Markov decision processes, IST Austria, 41p.","apa":"Chatterjee, K., Komarkova, Z., &#38; Kretinsky, J. (2015). <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">https://doi.org/10.15479/AT:IST-2015-318-v1-1</a>","ieee":"K. Chatterjee, Z. Komarkova, and J. Kretinsky, <i>Unifying two views on multiple mean-payoff objectives in Markov decision processes</i>. IST Austria, 2015.","ama":"Chatterjee K, Komarkova Z, Kretinsky J. <i>Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-318-v1-1\">10.15479/AT:IST-2015-318-v1-1</a>"},"day":"12","type":"technical_report","publication_status":"published","fulldoi":"https://doi.org/10.15479/AT:IST-2015-318-v1-1","_id":"5429","month":"01","oa":1,"abstract":[{"text":"We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives. \r\nThere have been two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector.  \r\nWe consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics.\r\nOur problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).\r\nOur main results are algorithms for the decision problem which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions.\r\nFinally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.","lang":"eng"}],"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Komarkova, Zuzana","last_name":"Komarkova","first_name":"Zuzana"},{"orcid":"0000-0002-8122-2881","full_name":"Kretinsky, Jan","last_name":"Kretinsky","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","date_updated":"2026-07-06T13:26:26Z","language":[{"iso":"eng"}],"page":"41","file_date_updated":"2020-07-14T12:46:52Z","ddc":["004"],"oa_version":"Published Version","pubrep_id":"318","title":"Unifying two views on multiple mean-payoff objectives in Markov decision processes","publisher":"IST Austria","related_material":{"record":[{"relation":"later_version","status":"public","id":"5435"},{"id":"1657","status":"public","relation":"later_version"},{"id":"466","relation":"later_version","status":"public"}]},"date_created":"2018-12-12T11:39:17Z"},{"date_created":"2018-12-12T11:39:20Z","related_material":{"record":[{"status":"public","relation":"later_version","id":"1610"},{"status":"public","relation":"later_version","id":"465"}]},"publisher":"IST Austria","pubrep_id":"334","title":"Edit distance for pushdown automata","ddc":["004"],"oa_version":"Published Version","file_date_updated":"2020-07-14T12:46:55Z","page":"15","language":[{"iso":"eng"}],"date_updated":"2026-07-06T13:27:53Z","year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-4783-0389","first_name":"Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","full_name":"Ibsen-Jensen, Rasmus"},{"last_name":"Otop","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"}],"abstract":[{"text":"The edit distance between two words w1, w2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w1 to w2. The edit distance generalizes to languages L1, L2, where the edit distance is the minimal number k such that for every word from L1 there exists a word in L2 with edit distance at most k. We study the edit distance computation problem between pushdown automata and their subclasses.\r\nThe problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for deciding whether, for a given threshold k, the edit distance from a pushdown automaton to a finite automaton is at most k. ","lang":"eng"}],"oa":1,"month":"05","_id":"5438","publication_status":"published","fulldoi":"https://doi.org/10.15479/AT:IST-2015-334-v1-1","type":"technical_report","day":"05","alternative_title":["IST Austria Technical Report"],"citation":{"ieee":"K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, <i>Edit distance for pushdown automata</i>. IST Austria, 2015.","apa":"Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &#38; Otop, J. (2015). <i>Edit distance for pushdown automata</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2015-334-v1-1\">https://doi.org/10.15479/AT:IST-2015-334-v1-1</a>","ama":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. <i>Edit Distance for Pushdown Automata</i>. IST Austria; 2015. doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-334-v1-1\">10.15479/AT:IST-2015-334-v1-1</a>","mla":"Chatterjee, Krishnendu, et al. <i>Edit Distance for Pushdown Automata</i>. IST Austria, 2015, doi:<a href=\"https://doi.org/10.15479/AT:IST-2015-334-v1-1\">10.15479/AT:IST-2015-334-v1-1</a>.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. <i>Edit Distance for Pushdown Automata</i>. IST Austria, 2015. <a href=\"https://doi.org/10.15479/AT:IST-2015-334-v1-1\">https://doi.org/10.15479/AT:IST-2015-334-v1-1</a>.","ista":"Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for pushdown automata, IST Austria, 15p.","short":"K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit Distance for Pushdown Automata, IST Austria, 2015."},"doi":"10.15479/AT:IST-2015-334-v1-1","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","file":[{"access_level":"open_access","creator":"system","date_created":"2018-12-12T11:53:56Z","date_updated":"2020-07-14T12:46:55Z","relation":"main_file","content_type":"application/pdf","file_size":422573,"file_id":"5518","file_name":"IST-2015-334-v1+1_report.pdf","checksum":"8a5f2d77560e552af87eb1982437a43b"}],"department":[{"_id":"KrCh"}],"date_published":"2015-05-05T00:00:00Z"},{"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","fulldoi":"https://doi.org/10.1109/LICS.2015.34","type":"conference","day":"01","doi":"10.1109/LICS.2015.34","citation":{"ama":"Chatterjee K, Henzinger M, Loitzenbauer V. Improved algorithms for one-pair and k-pair Streett objectives. In: <i>Proceedings - Symposium on Logic in Computer Science</i>. Vol 2015-July. IEEE; 2015. doi:<a href=\"https://doi.org/10.1109/LICS.2015.34\">10.1109/LICS.2015.34</a>","ieee":"K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for one-pair and k-pair Streett objectives,” in <i>Proceedings - Symposium on Logic in Computer Science</i>, Kyoto, Japan, 2015, vol. 2015–July.","apa":"Chatterjee, K., Henzinger, M., &#38; Loitzenbauer, V. (2015). Improved algorithms for one-pair and k-pair Streett objectives. In <i>Proceedings - Symposium on Logic in Computer Science</i> (Vol. 2015–July). Kyoto, Japan: IEEE. <a href=\"https://doi.org/10.1109/LICS.2015.34\">https://doi.org/10.1109/LICS.2015.34</a>","short":"K. Chatterjee, M. Henzinger, V. Loitzenbauer, in:, Proceedings - Symposium on Logic in Computer Science, IEEE, 2015.","ista":"Chatterjee K, Henzinger M, Loitzenbauer V. 2015. Improved algorithms for one-pair and k-pair Streett objectives. Proceedings - Symposium on Logic in Computer Science. LICS: Logic in Computer Science vol. 2015–July, 7174888.","chicago":"Chatterjee, Krishnendu, Monika Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.” In <i>Proceedings - Symposium on Logic in Computer Science</i>, Vol. 2015–July. IEEE, 2015. <a href=\"https://doi.org/10.1109/LICS.2015.34\">https://doi.org/10.1109/LICS.2015.34</a>.","mla":"Chatterjee, Krishnendu, et al. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.” <i>Proceedings - Symposium on Logic in Computer Science</i>, vol. 2015–July, 7174888, IEEE, 2015, doi:<a href=\"https://doi.org/10.1109/LICS.2015.34\">10.1109/LICS.2015.34</a>."},"scopus_import":"1","department":[{"_id":"KrCh"}],"date_published":"2015-07-01T00:00:00Z","publist_id":"5489","publication":"Proceedings - Symposium on Logic in Computer Science","abstract":[{"text":"The computation of the winning set for one-pair Streett objectives and for k-pair Streett objectives in (standard) graphs as well as in game graphs are central problems in computer-aided verification, with application to the verification of closed systems with strong fairness conditions, the verification of open systems, checking interface compatibility, well-formed ness of specifications, and the synthesis of reactive systems. We give faster algorithms for the computation of the winning set for (1) one-pair Streett objectives (aka parity-3 problem) in game graphs and (2) for k-pair Streett objectives in graphs. For both problems this represents the first improvement in asymptotic running time in 15 years.","lang":"eng"}],"acknowledgement":"K. C. is supported by the Austrian Science Fund (FWF): P23499-N23 and S11407-N23 (RiSE), an ERC Start Grant (279307: Graph Games), and a Microsoft Faculty Fellows Award. M. H. is supported by the Austrian Science Fund (FWF): P23499-N23 and the Vienna Science and Technology Fund (WWTF) grant ICT10-002. V. L. is supported by the Vienna Science and Technology Fund (WWTF) grant ICT10-002. The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement no. 340506.","quality_controlled":"1","oa":1,"month":"07","_id":"1661","conference":{"end_date":"2015-07-10","name":"LICS: Logic in Computer Science","start_date":"2015-07-06","location":"Kyoto, Japan"},"article_number":"7174888","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://eprints.cs.univie.ac.at/4368/"}],"date_updated":"2026-07-06T13:28:05Z","volume":"2015-July","isi":1,"year":"2015","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","author":[{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"first_name":"Veronika","full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer"}],"date_created":"2018-12-11T11:53:19Z","related_material":{"record":[{"id":"464","relation":"later_version","status":"public"}]},"publisher":"IEEE","article_processing_charge":"No","title":"Improved algorithms for one-pair and k-pair Streett objectives","oa_version":"Submitted Version","ec_funded":1,"external_id":{"isi":["000380427100026"]}},{"article_number":"e1004541","license":"https://creativecommons.org/licenses/by/4.0/","language":[{"iso":"eng"}],"date_updated":"2026-07-06T13:54:28Z","volume":11,"isi":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2015","author":[{"last_name":"Gómez Sicilia","full_name":"Gómez Sicilia, Àngel","first_name":"Àngel"},{"first_name":"Mateusz K","id":"2F74BCDE-F248-11E8-B48F-1D18A9856A87","full_name":"Sikora, Mateusz K","last_name":"Sikora"},{"first_name":"Marek","full_name":"Cieplak, Marek","last_name":"Cieplak"},{"first_name":"Mariano","full_name":"Carrión Vázquez, Mariano","last_name":"Carrión Vázquez"}],"status":"public","related_material":{"record":[{"relation":"research_data","status":"public","id":"9714"}]},"date_created":"2018-12-11T11:52:45Z","publisher":"Public Library of Science","article_processing_charge":"No","pubrep_id":"478","title":"An exploration of the universe of polyglutamine structures","issue":"10","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa_version":"Published Version","ddc":["570"],"file_date_updated":"2020-07-14T12:45:02Z","external_id":{"isi":["000364399700067"]},"type":"journal_article","fulldoi":"https://doi.org/10.1371/journal.pcbi.1004541","publication_status":"published","intvolume":"        11","day":"23","doi":"10.1371/journal.pcbi.1004541","citation":{"apa":"Gómez Sicilia, À., Sikora, M. K., Cieplak, M., &#38; Carrión Vázquez, M. (2015). An exploration of the universe of polyglutamine structures. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1004541\">https://doi.org/10.1371/journal.pcbi.1004541</a>","ieee":"À. Gómez Sicilia, M. K. Sikora, M. Cieplak, and M. Carrión Vázquez, “An exploration of the universe of polyglutamine structures,” <i>PLoS Computational Biology</i>, vol. 11, no. 10. Public Library of Science, 2015.","ama":"Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. An exploration of the universe of polyglutamine structures. <i>PLoS Computational Biology</i>. 2015;11(10). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004541\">10.1371/journal.pcbi.1004541</a>","chicago":"Gómez Sicilia, Àngel, Mateusz K Sikora, Marek Cieplak, and Mariano Carrión Vázquez. “An Exploration of the Universe of Polyglutamine Structures.” <i>PLoS Computational Biology</i>. Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pcbi.1004541\">https://doi.org/10.1371/journal.pcbi.1004541</a>.","mla":"Gómez Sicilia, Àngel, et al. “An Exploration of the Universe of Polyglutamine Structures.” <i>PLoS Computational Biology</i>, vol. 11, no. 10, e1004541, Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004541\">10.1371/journal.pcbi.1004541</a>.","short":"À. Gómez Sicilia, M.K. Sikora, M. Cieplak, M. Carrión Vázquez, PLoS Computational Biology 11 (2015).","ista":"Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. 2015. An exploration of the universe of polyglutamine structures. PLoS Computational Biology. 11(10), e1004541."},"scopus_import":"1","file":[{"checksum":"8b67d729be663bfc9af04bfd94459655","file_name":"IST-2016-478-v1+1_journal.pcbi.1004541.pdf","file_id":"5207","file_size":1412511,"content_type":"application/pdf","relation":"main_file","date_updated":"2020-07-14T12:45:02Z","date_created":"2018-12-12T10:16:21Z","access_level":"open_access","creator":"system"}],"has_accepted_license":"1","department":[{"_id":"CaHe"}],"date_published":"2015-10-23T00:00:00Z","publication":"PLoS Computational Biology","publist_id":"5605","abstract":[{"lang":"eng","text":"Deposits of misfolded proteins in the human brain are associated with the development of many neurodegenerative diseases. Recent studies show that these proteins have common traits even at the monomer level. Among them, a polyglutamine region that is present in huntingtin is known to exhibit a correlation between the length of the chain and the severity as well as the earliness of the onset of Huntington disease. Here, we apply bias exchange molecular dynamics to generate structures of polyglutamine expansions of several lengths and characterize the resulting independent conformations. We compare the properties of these conformations to those of the standard proteins, as well as to other homopolymeric tracts. We find that, similar to the previously studied polyvaline chains, the set of possible transient folds is much broader than the set of known-to-date folds, although the conformations have different structures. We show that the mechanical stability is not related to any simple geometrical characteristics of the structures. We demonstrate that long polyglutamine expansions result in higher mechanical stability than the shorter ones. They also have a longer life span and are substantially more prone to form knotted structures. The knotted region has an average length of 35 residues, similar to the typical threshold for most polyglutamine-related diseases. Similarly, changes in shape and mechanical stability appear once the total length of the peptide exceeds this threshold of 35 glutamine residues. We suggest that knotted conformers may also harm the cellular machinery and thus lead to disease."}],"acknowledgement":"We acknowledge the support by the EU Joint Programme in Neurodegenerative Diseases (JPND AC14/00037) project. The project is supported through the following funding organisations under the aegis of JPND—www.jpnd.eu: Ireland, HRB; Poland, National Science Centre; and Spain, ISCIII. ","quality_controlled":"1","month":"10","oa":1,"_id":"1566"},{"article_processing_charge":"No","title":"An exploration of the universe of polyglutamine structures - submission to PLOS journals","related_material":{"record":[{"id":"1566","relation":"used_in_publication","status":"public"}]},"date_created":"2021-07-23T12:05:28Z","publisher":"Public Library of Science","month":"10","oa_version":"Published Version","_id":"9714","type":"research_data_reference","fulldoi":"https://doi.org/10.1371/journal.pcbi.1004541.s001","date_updated":"2026-07-06T13:54:29Z","day":"23","department":[{"_id":"CaHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","author":[{"first_name":"Àngel","full_name":"Gómez Sicilia, Àngel","last_name":"Gómez Sicilia"},{"last_name":"Sikora","full_name":"Sikora, Mateusz K","id":"2F74BCDE-F248-11E8-B48F-1D18A9856A87","first_name":"Mateusz K"},{"first_name":"Marek","full_name":"Cieplak, Marek","last_name":"Cieplak"},{"last_name":"Carrión Vázquez","full_name":"Carrión Vázquez, Mariano","first_name":"Mariano"}],"date_published":"2015-10-23T00:00:00Z","status":"public","doi":"10.1371/journal.pcbi.1004541.s001","citation":{"ista":"Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. 2015. An exploration of the universe of polyglutamine structures - submission to PLOS journals, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pcbi.1004541.s001\">10.1371/journal.pcbi.1004541.s001</a>.","short":"À. Gómez Sicilia, M.K. Sikora, M. Cieplak, M. Carrión Vázquez, (2015).","mla":"Gómez Sicilia, Àngel, et al. <i>An Exploration of the Universe of Polyglutamine Structures - Submission to PLOS Journals</i>. Public Library of Science, 2015, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004541.s001\">10.1371/journal.pcbi.1004541.s001</a>.","chicago":"Gómez Sicilia, Àngel, Mateusz K Sikora, Marek Cieplak, and Mariano Carrión Vázquez. “An Exploration of the Universe of Polyglutamine Structures - Submission to PLOS Journals.” Public Library of Science, 2015. <a href=\"https://doi.org/10.1371/journal.pcbi.1004541.s001\">https://doi.org/10.1371/journal.pcbi.1004541.s001</a>.","ama":"Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. An exploration of the universe of polyglutamine structures - submission to PLOS journals. 2015. doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1004541.s001\">10.1371/journal.pcbi.1004541.s001</a>","apa":"Gómez Sicilia, À., Sikora, M. K., Cieplak, M., &#38; Carrión Vázquez, M. (2015). An exploration of the universe of polyglutamine structures - submission to PLOS journals. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1004541.s001\">https://doi.org/10.1371/journal.pcbi.1004541.s001</a>","ieee":"À. Gómez Sicilia, M. K. Sikora, M. Cieplak, and M. Carrión Vázquez, “An exploration of the universe of polyglutamine structures - submission to PLOS journals.” Public Library of Science, 2015."}},{"project":[{"call_identifier":"FP7","grant_number":"622033","_id":"255F06BE-B435-11E9-9278-68D0E5697425","name":"Persistent Homology - Images, Data and Maps"}],"type":"journal_article","fulldoi":"https://doi.org/10.1137/140993934","publication_status":"published","intvolume":"        14","day":"01","publication_identifier":{"eissn":["1536-0040"]},"doi":"10.1137/140993934","citation":{"ama":"Knipl D, Pilarczyk P, Röst G. Rich bifurcation structure in a two patch vaccination model. <i>SIAM Journal on Applied Dynamical Systems</i>. 2015;14(2):980-1017. doi:<a href=\"https://doi.org/10.1137/140993934\">10.1137/140993934</a>","ieee":"D. Knipl, P. Pilarczyk, and G. Röst, “Rich bifurcation structure in a two patch vaccination model,” <i>SIAM Journal on Applied Dynamical Systems</i>, vol. 14, no. 2. Society for Industrial and Applied Mathematics, pp. 980–1017, 2015.","apa":"Knipl, D., Pilarczyk, P., &#38; Röst, G. (2015). Rich bifurcation structure in a two patch vaccination model. <i>SIAM Journal on Applied Dynamical Systems</i>. Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/140993934\">https://doi.org/10.1137/140993934</a>","ista":"Knipl D, Pilarczyk P, Röst G. 2015. Rich bifurcation structure in a two patch vaccination model. SIAM Journal on Applied Dynamical Systems. 14(2), 980–1017.","short":"D. Knipl, P. Pilarczyk, G. Röst, SIAM Journal on Applied Dynamical Systems 14 (2015) 980–1017.","chicago":"Knipl, Diána, Pawel Pilarczyk, and Gergely Röst. “Rich Bifurcation Structure in a Two Patch Vaccination Model.” <i>SIAM Journal on Applied Dynamical Systems</i>. Society for Industrial and Applied Mathematics, 2015. <a href=\"https://doi.org/10.1137/140993934\">https://doi.org/10.1137/140993934</a>.","mla":"Knipl, Diána, et al. “Rich Bifurcation Structure in a Two Patch Vaccination Model.” <i>SIAM Journal on Applied Dynamical Systems</i>, vol. 14, no. 2, Society for Industrial and Applied Mathematics, 2015, pp. 980–1017, doi:<a href=\"https://doi.org/10.1137/140993934\">10.1137/140993934</a>."},"scopus_import":"1","department":[{"_id":"HeEd"}],"article_type":"original","date_published":"2015-01-01T00:00:00Z","publication":"SIAM Journal on Applied Dynamical Systems","publist_id":"5616","abstract":[{"text":"We show that incorporating spatial dispersal of individuals into a simple vaccination epidemic model may give rise to a model that exhibits rich dynamical behavior. Using an SIVS (susceptible-infected-vaccinated-susceptible) model as a basis, we describe the spread of an infectious disease in a population split into two regions. In each subpopulation, both forward and backward bifurcations can occur. This implies that for disconnected regions the two-patch system may admit several steady states. We consider traveling between the regions and investigate the impact of spatial dispersal of individuals on the model dynamics. We establish conditions for the existence of multiple nontrivial steady states in the system, and we study the structure of the equilibria. The mathematical analysis reveals an unusually rich dynamical behavior, not normally found in the simple epidemic models. In addition to the disease-free equilibrium, eight endemic equilibria emerge from backward transcritical and saddle-node bifurcation points, forming an interesting bifurcation diagram. Stability of steady states, their bifurcations, and the global dynamics are investigated with analytical tools, numerical simulations, and rigorous set-oriented numerical computations.","lang":"eng"}],"acknowledgement":"Institute of Science and Technology Austria, Am Campus 1, 3400 Klosterneuburg, Austria (pawel.pilarczyk@ist.ac.at). This author’s work was partially supported by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement 622033, by Fundo Europeu de Desenvolvimento Regional (FEDER) through COMPETE—Programa Operacional Factores de Competitividade (POFC), by the Portuguese national funds through Funda ̧caoparaaCiˆencia e a Tecnologia (FCT) in the framework of the research project FCOMP-01-0124-FEDER-010645 (ref. FCT PTDC/MAT/098871/2008), and by European Research Council through StG 259559 in the framework of the EPIDELAY project.","quality_controlled":"1","month":"01","oa":1,"_id":"1555","page":"980 - 1017","main_file_link":[{"open_access":"1","url":"http://discovery.ucl.ac.uk/1473750/1/99393.pdf"}],"das_tickbox":"1","language":[{"iso":"eng"}],"date_updated":"2026-07-06T13:59:25Z","volume":14,"isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","author":[{"first_name":"Diána","last_name":"Knipl","full_name":"Knipl, Diána"},{"first_name":"Pawel","id":"3768D56A-F248-11E8-B48F-1D18A9856A87","last_name":"Pilarczyk","full_name":"Pilarczyk, Pawel"},{"full_name":"Röst, Gergely","last_name":"Röst","first_name":"Gergely"}],"status":"public","date_created":"2018-12-11T11:52:42Z","publisher":"Society for Industrial and Applied Mathematics","article_processing_charge":"No","title":"Rich bifurcation structure in a two patch vaccination model","issue":"2","ddc":["510"],"oa_version":"Published Version","ec_funded":1,"external_id":{"isi":["000357310400015"]}},{"_id":"1525","month":"11","oa":1,"OA_type":"gold","abstract":[{"lang":"eng","text":"Based on 16 recommendations, efforts should be made to achieve the following goal: By 2025, all scholarly publication activity in Austria should be Open Access. In other words, the final versions of all scholarly publications resulting from the support of public resources must be freely accessible on the Internet without delay (Gold Open Access). The resources required to meet this obligation shall be provided to the authors, or the cost of the publication venues shall be borne directly by the research organisations."}],"publication":"VÖB Mitteilungen","publist_id":"5648","quality_controlled":"1","scopus_import":"1","has_accepted_license":"1","file":[{"file_id":"5317","file_name":"IST-2016-720-v1+1_OANA_OA-Empfehlungen_12-11-2015.pdf","checksum":"a495fe253bbc7615b1d60e9e85c94408","date_created":"2018-12-12T10:17:59Z","creator":"system","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:45:00Z","content_type":"application/pdf","file_size":931707}],"doi":"10.5281/zenodo.33178","citation":{"chicago":"Bauer, Bruno, Guido Blechl, Christoph Bock, Patrick Danowski, Andreas Ferus, Anton Graschopf, Thomas König, et al. “Arbeitsgruppe „Nationale Strategie“ Des Open Access Network Austria OANA.” <i>VÖB Mitteilungen</i>. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2015. <a href=\"https://doi.org/10.5281/zenodo.33178\">https://doi.org/10.5281/zenodo.33178</a>.","mla":"Bauer, Bruno, et al. “Arbeitsgruppe „Nationale Strategie“ Des Open Access Network Austria OANA.” <i>VÖB Mitteilungen</i>, vol. 68, no. 3, Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2015, pp. 580–607, doi:<a href=\"https://doi.org/10.5281/zenodo.33178\">10.5281/zenodo.33178</a>.","short":"B. Bauer, G. Blechl, C. Bock, P. Danowski, A. Ferus, A. Graschopf, T. König, K. Mayer, F. Reckling, K. Rieck, P. Seitz, H. Stöger, E. Welzig, VÖB Mitteilungen 68 (2015) 580–607.","ista":"Bauer B, Blechl G, Bock C, Danowski P, Ferus A, Graschopf A, König T, Mayer K, Reckling F, Rieck K, Seitz P, Stöger H, Welzig E. 2015. Arbeitsgruppe „Nationale Strategie“ des Open Access Network Austria OANA. VÖB Mitteilungen. 68(3), 580–607.","apa":"Bauer, B., Blechl, G., Bock, C., Danowski, P., Ferus, A., Graschopf, A., … Welzig, E. (2015). Arbeitsgruppe „Nationale Strategie“ des Open Access Network Austria OANA. <i>VÖB Mitteilungen</i>. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare. <a href=\"https://doi.org/10.5281/zenodo.33178\">https://doi.org/10.5281/zenodo.33178</a>","ieee":"B. Bauer <i>et al.</i>, “Arbeitsgruppe „Nationale Strategie“ des Open Access Network Austria OANA,” <i>VÖB Mitteilungen</i>, vol. 68, no. 3. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, pp. 580–607, 2015.","ama":"Bauer B, Blechl G, Bock C, et al. Arbeitsgruppe „Nationale Strategie“ des Open Access Network Austria OANA. <i>VÖB Mitteilungen</i>. 2015;68(3):580-607. doi:<a href=\"https://doi.org/10.5281/zenodo.33178\">10.5281/zenodo.33178</a>"},"article_type":"original","date_published":"2015-11-12T00:00:00Z","department":[{"_id":"E-Lib"}],"intvolume":"        68","day":"12","type":"journal_article","publication_status":"published","fulldoi":"https://doi.org/10.5281/zenodo.33178","file_date_updated":"2020-07-14T12:45:00Z","issue":"3","oa_version":"Published Version","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ddc":["020"],"publisher":"Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare","OA_place":"publisher","date_created":"2018-12-11T11:52:31Z","title":"Arbeitsgruppe „Nationale Strategie“ des Open Access Network Austria OANA","pubrep_id":"720","article_processing_charge":"No","volume":68,"author":[{"full_name":"Bauer, Bruno","last_name":"Bauer","first_name":"Bruno"},{"full_name":"Blechl, Guido","last_name":"Blechl","first_name":"Guido"},{"full_name":"Bock, Christoph","last_name":"Bock","first_name":"Christoph"},{"orcid":"0000-0002-6026-4409","last_name":"Danowski","full_name":"Danowski, Patrick","id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","first_name":"Patrick"},{"first_name":"Andreas","full_name":"Ferus, Andreas","last_name":"Ferus"},{"first_name":"Anton","last_name":"Graschopf","full_name":"Graschopf, Anton"},{"last_name":"König","full_name":"König, Thomas","first_name":"Thomas"},{"first_name":"Katja","last_name":"Mayer","full_name":"Mayer, Katja"},{"last_name":"Reckling","full_name":"Reckling, Falk","first_name":"Falk"},{"first_name":"Katharina","last_name":"Rieck","full_name":"Rieck, Katharina"},{"full_name":"Seitz, Peter","last_name":"Seitz","first_name":"Peter"},{"full_name":"Stöger, Herwig","last_name":"Stöger","first_name":"Herwig"},{"first_name":"Elvira","full_name":"Welzig, Elvira","last_name":"Welzig"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","page":"580 - 607","date_updated":"2026-07-07T06:11:42Z","language":[{"iso":"eng"}],"das_tickbox":"1"},{"scopus_import":"1","doi":"10.1016/j.ipl.2014.09.001","citation":{"short":"B. Bérard, K. Chatterjee, N. Sznajder, Information Processing Letters 115 (2015) 52–59.","ista":"Bérard B, Chatterjee K, Sznajder N. 2015. Probabilistic opacity for Markov decision processes. Information Processing Letters. 115(1), 52–59.","chicago":"Bérard, Béatrice, Krishnendu Chatterjee, and Nathalie Sznajder. “Probabilistic Opacity for Markov Decision Processes.” <i>Information Processing Letters</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">https://doi.org/10.1016/j.ipl.2014.09.001</a>.","mla":"Bérard, Béatrice, et al. “Probabilistic Opacity for Markov Decision Processes.” <i>Information Processing Letters</i>, vol. 115, no. 1, Elsevier, 2015, pp. 52–59, doi:<a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">10.1016/j.ipl.2014.09.001</a>.","ama":"Bérard B, Chatterjee K, Sznajder N. Probabilistic opacity for Markov decision processes. <i>Information Processing Letters</i>. 2015;115(1):52-59. doi:<a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">10.1016/j.ipl.2014.09.001</a>","ieee":"B. Bérard, K. Chatterjee, and N. Sznajder, “Probabilistic opacity for Markov decision processes,” <i>Information Processing Letters</i>, vol. 115, no. 1. Elsevier, pp. 52–59, 2015.","apa":"Bérard, B., Chatterjee, K., &#38; Sznajder, N. (2015). Probabilistic opacity for Markov decision processes. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ipl.2014.09.001\">https://doi.org/10.1016/j.ipl.2014.09.001</a>"},"date_published":"2015-01-01T00:00:00Z","department":[{"_id":"KrCh"}],"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF"},{"grant_number":"S11407","call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"day":"01","intvolume":"       115","publication_status":"published","fulldoi":"https://doi.org/10.1016/j.ipl.2014.09.001","type":"journal_article","_id":"2034","oa":1,"month":"01","abstract":[{"lang":"eng","text":"Opacity is a generic security property, that has been defined on (non-probabilistic) transition systems and later on Markov chains with labels. For a secret predicate, given as a subset of runs, and a function describing the view of an external observer, the value of interest for opacity is a measure of the set of runs disclosing the secret. We extend this definition to the richer framework of Markov decision processes, where non-deterministicchoice is combined with probabilistic transitions, and we study related decidability problems with partial or complete observation hypotheses for the schedulers. We prove that all questions are decidable with complete observation and ω-regular secrets. With partial observation, we prove that all quantitative questions are undecidable but the question whether a system is almost surely non-opaquebecomes decidable for a restricted class of ω-regular secrets, as well as for all ω-regular secrets under finite-memory schedulers."}],"publist_id":"5025","publication":"Information Processing Letters","quality_controlled":"1","isi":1,"volume":115,"status":"public","author":[{"first_name":"Béatrice","last_name":"Bérard","full_name":"Bérard, Béatrice"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Sznajder, Nathalie","last_name":"Sznajder","first_name":"Nathalie"}],"year":"2015","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"52 - 59","date_updated":"2026-07-07T13:10:27Z","language":[{"iso":"eng"}],"das_tickbox":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.4225"}],"ec_funded":1,"arxiv":1,"oa_version":"Preprint","issue":"1","external_id":{"arxiv":["1407.4225"],"isi":["000345478700010"]},"publisher":"Elsevier","date_created":"2018-12-11T11:55:20Z","title":"Probabilistic opacity for Markov decision processes","article_processing_charge":"No"},{"date_updated":"2026-07-07T13:12:13Z","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","language":[{"iso":"eng"}],"das_tickbox":"1","page":"28 - 43","author":[{"orcid":"0000-0003-2361-3953","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","full_name":"Paixao, Tiago","last_name":"Paixao","first_name":"Tiago"},{"first_name":"Golnaz","full_name":"Badkobeh, Golnaz","last_name":"Badkobeh"},{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","last_name":"Barton","first_name":"Nicholas H"},{"first_name":"Doğan","full_name":"Çörüş, Doğan","last_name":"Çörüş"},{"last_name":"Dang","full_name":"Dang, Duccuong","first_name":"Duccuong"},{"last_name":"Friedrich","full_name":"Friedrich, Tobias","first_name":"Tobias"},{"first_name":"Per","last_name":"Lehre","full_name":"Lehre, Per"},{"first_name":"Dirk","full_name":"Sudholt, Dirk","last_name":"Sudholt"},{"first_name":"Andrew","full_name":"Sutton, Andrew","last_name":"Sutton"},{"orcid":"0000-0002-6873-2967","id":"42302D54-F248-11E8-B48F-1D18A9856A87","full_name":"Trubenova, Barbora","last_name":"Trubenova","first_name":"Barbora"}],"corr_author":"1","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2015","isi":1,"volume":383,"title":"Toward a unifying framework for evolutionary processes","pubrep_id":"483","article_processing_charge":"No","publisher":"Elsevier","date_created":"2018-12-11T11:52:37Z","external_id":{"isi":["000362056300005"]},"file_date_updated":"2020-07-14T12:45:01Z","ec_funded":1,"oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"ddc":["570"],"intvolume":"       383","day":"21","type":"journal_article","fulldoi":"https://doi.org/10.1016/j.jtbi.2015.07.011","publication_status":"published","project":[{"call_identifier":"FP7","grant_number":"618091","_id":"25B1EC9E-B435-11E9-9278-68D0E5697425","name":"Speed of Adaptation in Population Genetics and Evolutionary Computation"},{"_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","grant_number":"250152"}],"date_published":"2015-10-21T00:00:00Z","department":[{"_id":"NiBa"},{"_id":"CaGu"}],"scopus_import":"1","file":[{"file_name":"IST-2016-483-v1+1_1-s2.0-S0022519315003409-main.pdf","checksum":"33b60ecfea60764756a9ee9df5eb65ca","file_id":"5244","relation":"main_file","date_updated":"2020-07-14T12:45:01Z","content_type":"application/pdf","file_size":595307,"date_created":"2018-12-12T10:16:53Z","creator":"system","access_level":"open_access"}],"has_accepted_license":"1","citation":{"mla":"Paixao, Tiago, et al. “Toward a Unifying Framework for Evolutionary Processes.” <i>Journal of Theoretical Biology</i>, vol. 383, Elsevier, 2015, pp. 28–43, doi:<a href=\"https://doi.org/10.1016/j.jtbi.2015.07.011\">10.1016/j.jtbi.2015.07.011</a>.","chicago":"Paixao, Tiago, Golnaz Badkobeh, Nicholas H Barton, Doğan Çörüş, Duccuong Dang, Tobias Friedrich, Per Lehre, Dirk Sudholt, Andrew Sutton, and Barbora Trubenova. “Toward a Unifying Framework for Evolutionary Processes.” <i>Journal of Theoretical Biology</i>. Elsevier, 2015. <a href=\"https://doi.org/10.1016/j.jtbi.2015.07.011\">https://doi.org/10.1016/j.jtbi.2015.07.011</a>.","ista":"Paixao T, Badkobeh G, Barton NH, Çörüş D, Dang D, Friedrich T, Lehre P, Sudholt D, Sutton A, Trubenova B. 2015. Toward a unifying framework for evolutionary processes. Journal of Theoretical Biology. 383, 28–43.","short":"T. Paixao, G. Badkobeh, N.H. Barton, D. Çörüş, D. Dang, T. Friedrich, P. Lehre, D. Sudholt, A. Sutton, B. Trubenova, Journal of Theoretical Biology 383 (2015) 28–43.","ieee":"T. Paixao <i>et al.</i>, “Toward a unifying framework for evolutionary processes,” <i>Journal of Theoretical Biology</i>, vol. 383. Elsevier, pp. 28–43, 2015.","apa":"Paixao, T., Badkobeh, G., Barton, N. H., Çörüş, D., Dang, D., Friedrich, T., … Trubenova, B. (2015). Toward a unifying framework for evolutionary processes. <i>Journal of Theoretical Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jtbi.2015.07.011\">https://doi.org/10.1016/j.jtbi.2015.07.011</a>","ama":"Paixao T, Badkobeh G, Barton NH, et al. Toward a unifying framework for evolutionary processes. <i>Journal of Theoretical Biology</i>. 2015;383:28-43. doi:<a href=\"https://doi.org/10.1016/j.jtbi.2015.07.011\">10.1016/j.jtbi.2015.07.011</a>"},"doi":"10.1016/j.jtbi.2015.07.011","quality_controlled":"1","abstract":[{"text":"The theory of population genetics and evolutionary computation have been evolving separately for nearly 30 years. Many results have been independently obtained in both fields and many others are unique to its respective field. We aim to bridge this gap by developing a unifying framework for evolutionary processes that allows both evolutionary algorithms and population genetics models to be cast in the same formal framework. The framework we present here decomposes the evolutionary process into its several components in order to facilitate the identification of similarities between different models. In particular, we propose a classification of evolutionary operators based on the defining properties of the different components. We cast several commonly used operators from both fields into this common framework. Using this, we map different evolutionary and genetic algorithms to different evolutionary regimes and identify candidates with the most potential for the translation of results between the fields. This provides a unified description of evolutionary processes and represents a stepping stone towards new tools and results to both fields. ","lang":"eng"}],"publication":"Journal of Theoretical Biology","publist_id":"5629","_id":"1542","month":"10","oa":1}]