[{"publication_status":"published","ec_funded":1,"day":"07","alternative_title":["EPTCS"],"month":"10","abstract":[{"lang":"eng","text":"An automaton with advice is a finite state automaton which has access to an additional fixed infinite string called an advice tape. We refine the Myhill-Nerode theorem to characterize the languages of finite strings that are accepted by automata with advice. We do the same for tree automata with advice."}],"doi":"10.4204/EPTCS.96.18","publist_id":"7325","status":"public","language":[{"iso":"eng"}],"intvolume":"        96","page":"238 - 246","publisher":"Open Publishing Association","file":[{"creator":"system","checksum":"56277f95edc9d531fa3bdc5f9579fda8","relation":"main_file","file_id":"5152","date_created":"2018-12-12T10:15:31Z","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:46:35Z","file_size":97736,"file_name":"IST-2018-944-v1+1_2012_Rubin_A_Myhill.pdf"}],"department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T08:01:04Z","oa_version":"Published Version","author":[{"full_name":"Kruckman, Alex","first_name":"Alex","last_name":"Kruckman"},{"last_name":"Rubin","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","full_name":"Rubin, Sasha","first_name":"Sasha"},{"last_name":"Sheridan","full_name":"Sheridan, John","first_name":"John"},{"first_name":"Ben","full_name":"Zax, Ben","last_name":"Zax"}],"oa":1,"citation":{"chicago":"Kruckman, Alex, Sasha Rubin, John Sheridan, and Ben Zax. “A Myhill Nerode Theorem for Automata with Advice.” In <i>Proceedings GandALF 2012</i>, 96:238–46. Open Publishing Association, 2012. <a href=\"https://doi.org/10.4204/EPTCS.96.18\">https://doi.org/10.4204/EPTCS.96.18</a>.","short":"A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012, Open Publishing Association, 2012, pp. 238–246.","ama":"Kruckman A, Rubin S, Sheridan J, Zax B. A Myhill Nerode theorem for automata with advice. In: <i>Proceedings GandALF 2012</i>. Vol 96. Open Publishing Association; 2012:238-246. doi:<a href=\"https://doi.org/10.4204/EPTCS.96.18\">10.4204/EPTCS.96.18</a>","ieee":"A. Kruckman, S. Rubin, J. Sheridan, and B. Zax, “A Myhill Nerode theorem for automata with advice,” in <i>Proceedings GandALF 2012</i>, Napoli, Italy, 2012, vol. 96, pp. 238–246.","apa":"Kruckman, A., Rubin, S., Sheridan, J., &#38; Zax, B. (2012). A Myhill Nerode theorem for automata with advice. In <i>Proceedings GandALF 2012</i> (Vol. 96, pp. 238–246). Napoli, Italy: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.96.18\">https://doi.org/10.4204/EPTCS.96.18</a>","mla":"Kruckman, Alex, et al. “A Myhill Nerode Theorem for Automata with Advice.” <i>Proceedings GandALF 2012</i>, vol. 96, Open Publishing Association, 2012, pp. 238–46, doi:<a href=\"https://doi.org/10.4204/EPTCS.96.18\">10.4204/EPTCS.96.18</a>.","ista":"Kruckman A, Rubin S, Sheridan J, Zax B. 2012. A Myhill Nerode theorem for automata with advice. Proceedings GandALF 2012. GandALF: Games, Automata, Logics and Formal Verification, EPTCS, vol. 96, 238–246."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","pubrep_id":"944","type":"conference","scopus_import":1,"file_date_updated":"2020-07-14T12:46:35Z","_id":"495","year":"2012","volume":96,"publication":"Proceedings GandALF 2012","date_created":"2018-12-11T11:46:47Z","ddc":["004"],"date_published":"2012-10-07T00:00:00Z","title":"A Myhill Nerode theorem for automata with advice","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"quality_controlled":"1","conference":{"name":"GandALF: Games, Automata, Logics and Formal Verification","end_date":"2012-09-08","start_date":"2012-09-06","location":"Napoli, Italy"},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"}},{"scopus_import":1,"publist_id":"7324","doi":"10.1109/LICS.2012.65","abstract":[{"lang":"eng","text":"We study the expressive power of logical interpretations on the class of scattered trees, namely those with countably many infinite branches. Scattered trees can be thought of as the tree analogue of scattered linear orders. Every scattered tree has an ordinal rank that reflects the structure of its infinite branches. We prove, roughly, that trees and orders of large rank cannot be interpreted in scattered trees of small rank. We consider a quite general notion of interpretation: each element of the interpreted structure is represented by a set of tuples of subsets of the interpreting tree. Our trees are countable, not necessarily finitely branching, and may have finitely many unary predicates as labellings. We also show how to replace injective set-interpretations in (not necessarily scattered) trees by 'finitary' set-interpretations."}],"_id":"496","status":"public","ec_funded":1,"oa":1,"author":[{"first_name":"Alexander","full_name":"Rabinovich, Alexander","last_name":"Rabinovich"},{"last_name":"Rubin","first_name":"Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","full_name":"Rubin, Sasha"}],"citation":{"apa":"Rabinovich, A., &#38; Rubin, S. (2012). Interpretations in trees with countably many branches. Presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia: IEEE. <a href=\"https://doi.org/10.1109/LICS.2012.65\">https://doi.org/10.1109/LICS.2012.65</a>","mla":"Rabinovich, Alexander, and Sasha Rubin. <i>Interpretations in Trees with Countably Many Branches</i>. 6280474, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/LICS.2012.65\">10.1109/LICS.2012.65</a>.","ista":"Rabinovich A, Rubin S. 2012. Interpretations in trees with countably many branches. LICS: Symposium on Logic in Computer Science, LICS, , 6280474.","ieee":"A. Rabinovich and S. Rubin, “Interpretations in trees with countably many branches,” presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia, 2012.","chicago":"Rabinovich, Alexander, and Sasha Rubin. “Interpretations in Trees with Countably Many Branches.” IEEE, 2012. <a href=\"https://doi.org/10.1109/LICS.2012.65\">https://doi.org/10.1109/LICS.2012.65</a>.","short":"A. Rabinovich, S. Rubin, in:, IEEE, 2012.","ama":"Rabinovich A, Rubin S. Interpretations in trees with countably many branches. In: IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/LICS.2012.65\">10.1109/LICS.2012.65</a>"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"01","department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T08:01:05Z","oa_version":"Preprint","publication_status":"published","month":"01","type":"conference","alternative_title":["LICS"],"quality_controlled":"1","title":"Interpretations in trees with countably many branches","date_published":"2012-01-01T00:00:00Z","project":[{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"publisher":"IEEE","conference":{"end_date":"2012-06-28","start_date":"2012-06-25","location":"Dubrovnik, Croatia","name":"LICS: Symposium on Logic in Computer Science"},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arise.or.at/pubpdf/Interpretations_in_Trees_with_Countably_Many_Branches.pdf","open_access":"1"}],"year":"2012","date_created":"2018-12-11T11:46:47Z","article_number":"6280474"},{"date_updated":"2023-02-23T12:23:32Z","oa_version":"Published Version","file":[{"creator":"system","checksum":"f1b0dd99240800db2d7dbf9b5131fe5e","relation":"main_file","file_id":"4712","date_created":"2018-12-12T10:08:50Z","access_level":"open_access","date_updated":"2020-07-14T12:46:35Z","content_type":"application/pdf","file_size":471236,"file_name":"IST-2018-943-v1+1_2012_Chatterjee_Faster_Algorithms.pdf"}],"department":[{"_id":"KrCh"}],"citation":{"ieee":"K. Chatterjee, S. Chaubal, and P. Kamath, “Faster algorithms for alternating refinement relations,” presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France, 2012, vol. 16, pp. 167–182.","ama":"Chatterjee K, Chaubal S, Kamath P. Faster algorithms for alternating refinement relations. In: Vol 16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:167-182. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">10.4230/LIPIcs.CSL.2012.167</a>","short":"K. Chatterjee, S. Chaubal, P. Kamath, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–182.","chicago":"Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. “Faster Algorithms for Alternating Refinement Relations,” 16:167–82. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">https://doi.org/10.4230/LIPIcs.CSL.2012.167</a>.","ista":"Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations. EACSL: European Association for Computer Science Logic, LIPIcs, vol. 16, 167–182.","apa":"Chatterjee, K., Chaubal, S., &#38; Kamath, P. (2012). Faster algorithms for alternating refinement relations (Vol. 16, pp. 167–182). Presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">https://doi.org/10.4230/LIPIcs.CSL.2012.167</a>","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Alternating Refinement Relations</i>. Vol. 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–82, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">10.4230/LIPIcs.CSL.2012.167</a>."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Chaubal","first_name":"Siddhesh","full_name":"Chaubal, Siddhesh"},{"full_name":"Kamath, Pritish","first_name":"Pritish","last_name":"Kamath"}],"oa":1,"pubrep_id":"943","type":"conference","file_date_updated":"2020-07-14T12:46:35Z","scopus_import":1,"_id":"497","year":"2012","volume":16,"ddc":["004"],"date_created":"2018-12-11T11:46:48Z","project":[{"call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"title":"Faster algorithms for alternating refinement relations","date_published":"2012-09-01T00:00:00Z","quality_controlled":"1","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"conference":{"name":"EACSL: European Association for Computer Science Logic","end_date":"2012-09-06","start_date":"2012-09-03","location":"Fontainebleau, France"},"publication_status":"published","day":"01","ec_funded":1,"alternative_title":["LIPIcs"],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"5378"}]},"month":"09","doi":"10.4230/LIPIcs.CSL.2012.167","abstract":[{"lang":"eng","text":"One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires O(n 3·m) time as compared to the previous known O(n 6)-time algorithm, where n is the number of states and m is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires O(m2)-time as compared to the previous known O((n·m)2)-time algorithm, where n is the number of states and m is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm. © Krishnendu Chatterjee, Siddhesh Chaubal, and Pritish Kamath."}],"publist_id":"7323","status":"public","language":[{"iso":"eng"}],"intvolume":"        16","page":"167 - 182","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"department":[{"_id":"NiBa"}],"file":[{"relation":"main_file","checksum":"233007138606aca5a2f75f7ae1742f43","creator":"system","access_level":"open_access","date_created":"2018-12-12T10:10:33Z","file_id":"4821","file_name":"IST-2018-942-v1+1_Pickup_et_al-2012-Evolutionary_Applications.pdf","file_size":396136,"date_updated":"2020-07-14T12:46:35Z","content_type":"application/pdf"}],"date_updated":"2021-01-12T08:01:06Z","oa_version":"Published Version","oa":1,"author":[{"last_name":"Pickup","full_name":"Pickup, Melinda","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","first_name":"Melinda","orcid":"0000-0001-6118-0541"},{"last_name":"Field","id":"419049E2-F248-11E8-B48F-1D18A9856A87","full_name":"Field, David","first_name":"David","orcid":"0000-0002-4014-8478"},{"last_name":"Rowell","first_name":"David","full_name":"Rowell, David"},{"first_name":"Andrew","full_name":"Young, Andrew","last_name":"Young"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Pickup M, Field D, Rowell D, Young A. Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. <i>Evolutionary Applications</i>. 2012;5(8):913-924. doi:<a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">10.1111/j.1752-4571.2012.00284.x</a>","short":"M. Pickup, D. Field, D. Rowell, A. Young, Evolutionary Applications 5 (2012) 913–924.","chicago":"Pickup, Melinda, David Field, David Rowell, and Andrew Young. “Predicting Local Adaptation in Fragmented Plant Populations: Implications for Restoration Genetics.” <i>Evolutionary Applications</i>. Wiley-Blackwell, 2012. <a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">https://doi.org/10.1111/j.1752-4571.2012.00284.x</a>.","ieee":"M. Pickup, D. Field, D. Rowell, and A. Young, “Predicting local adaptation in fragmented plant populations: Implications for restoration genetics,” <i>Evolutionary Applications</i>, vol. 5, no. 8. Wiley-Blackwell, pp. 913–924, 2012.","ista":"Pickup M, Field D, Rowell D, Young A. 2012. Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. Evolutionary Applications. 5(8), 913–924.","apa":"Pickup, M., Field, D., Rowell, D., &#38; Young, A. (2012). Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. <i>Evolutionary Applications</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">https://doi.org/10.1111/j.1752-4571.2012.00284.x</a>","mla":"Pickup, Melinda, et al. “Predicting Local Adaptation in Fragmented Plant Populations: Implications for Restoration Genetics.” <i>Evolutionary Applications</i>, vol. 5, no. 8, Wiley-Blackwell, 2012, pp. 913–24, doi:<a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">10.1111/j.1752-4571.2012.00284.x</a>."},"has_accepted_license":"1","pubrep_id":"942","type":"journal_article","file_date_updated":"2020-07-14T12:46:35Z","_id":"498","year":"2012","volume":5,"publication":"Evolutionary Applications","date_created":"2018-12-11T11:46:48Z","ddc":["576"],"title":"Predicting local adaptation in fragmented plant populations: Implications for restoration genetics","date_published":"2012-12-01T00:00:00Z","quality_controlled":"1","tmp":{"image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"acknowledgement":"We thank Graham Pickup, David Steer, Linda Broadhurst, Lan Li and Carole Elliott for technical assistance. The New\r\nSouth Wales Department of Environment and Climate Change, ACT Parks, Conservation and Lands and the\r\nDepartment of Sustainability and Environment in Victoria provided permits for seed and soil collection. We thank\r\nSpencer C. H. Barrett for comments that improved the quality of the manuscript.\r\n","publication_status":"published","day":"01","month":"12","issue":"8","publist_id":"7322","doi":"10.1111/j.1752-4571.2012.00284.x","abstract":[{"lang":"eng","text":"Understanding patterns and correlates of local adaptation in heterogeneous landscapes can provide important information in the selection of appropriate seed sources for restoration. We assessed the extent of local adaptation of fitness components in 12 population pairs of the perennial herb Rutidosis leptorrhynchoides (Asteraceae) and examined whether spatial scale (0.7-600 km), environmental distance, quantitative (QST) and neutral (FST) genetic differentiation, and size of the local and foreign populations could predict patterns of adaptive differentiation. Local adaptation varied among populations and fitness components. Including all population pairs, local adaptation was observed for seedling survival, but not for biomass, while foreign genotype advantage was observed for reproduction (number of inflorescences). Among population pairs, local adaptation increased with QST and local population size for biomass. QST was associated with environmental distance, suggesting ecological selection for phenotypic divergence. However, low FST and variation in population structure in small populations demonstrates the interaction of gene flow and drift in constraining local adaptation in R. leptorrhynchoides. Our study indicates that for species in heterogeneous landscapes, collecting seed from large populations from similar environments to candidate sites is likely to provide the most appropriate seed sources for restoration."}],"status":"public","language":[{"iso":"eng"}],"intvolume":"         5","page":"913 - 924","publisher":"Wiley-Blackwell"},{"department":[{"_id":"MiSi"}],"file":[{"file_size":986566,"date_updated":"2020-07-14T12:46:36Z","content_type":"application/pdf","file_name":"2012_CellBiology_Sixt.pdf","date_created":"2019-02-12T09:03:09Z","file_id":"5957","access_level":"open_access","creator":"kschuh","relation":"main_file","checksum":"45c02be33ebd99fc3077d60b9c90bdfa"}],"oa_version":"Published Version","date_updated":"2021-01-12T08:01:11Z","oa":1,"author":[{"last_name":"Sixt","orcid":"0000-0002-6620-9179","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K"}],"has_accepted_license":"1","citation":{"short":"M.K. Sixt, Journal of Cell Biology 197 (2012) 347–349.","ama":"Sixt MK. Cell migration: Fibroblasts find a new way to get ahead. <i>Journal of Cell Biology</i>. 2012;197(3):347-349. doi:<a href=\"https://doi.org/10.1083/jcb.201204039\">10.1083/jcb.201204039</a>","chicago":"Sixt, Michael K. “Cell Migration: Fibroblasts Find a New Way to Get Ahead.” <i>Journal of Cell Biology</i>. Rockefeller University Press, 2012. <a href=\"https://doi.org/10.1083/jcb.201204039\">https://doi.org/10.1083/jcb.201204039</a>.","ieee":"M. K. Sixt, “Cell migration: Fibroblasts find a new way to get ahead,” <i>Journal of Cell Biology</i>, vol. 197, no. 3. Rockefeller University Press, pp. 347–349, 2012.","ista":"Sixt MK. 2012. Cell migration: Fibroblasts find a new way to get ahead. Journal of Cell Biology. 197(3), 347–349.","mla":"Sixt, Michael K. “Cell Migration: Fibroblasts Find a New Way to Get Ahead.” <i>Journal of Cell Biology</i>, vol. 197, no. 3, Rockefeller University Press, 2012, pp. 347–49, doi:<a href=\"https://doi.org/10.1083/jcb.201204039\">10.1083/jcb.201204039</a>.","apa":"Sixt, M. K. (2012). Cell migration: Fibroblasts find a new way to get ahead. <i>Journal of Cell Biology</i>. Rockefeller University Press. <a href=\"https://doi.org/10.1083/jcb.201204039\">https://doi.org/10.1083/jcb.201204039</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","scopus_import":1,"file_date_updated":"2020-07-14T12:46:36Z","_id":"506","year":"2012","article_processing_charge":"No","volume":197,"publication":"Journal of Cell Biology","date_created":"2018-12-11T11:46:51Z","ddc":["570"],"title":"Cell migration: Fibroblasts find a new way to get ahead","date_published":"2012-04-30T00:00:00Z","quality_controlled":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"publication_status":"published","day":"30","month":"04","issue":"3","publist_id":"7314","doi":"10.1083/jcb.201204039","status":"public","language":[{"iso":"eng"}],"intvolume":"       197","page":"347 - 349","article_type":"original","publisher":"Rockefeller University Press"},{"date_created":"2018-12-12T11:38:59Z","ddc":["000","005"],"page":"33","year":"2012","language":[{"iso":"eng"}],"publisher":"IST Austria","title":"Mean-payoff pushdown games","date_published":"2012-07-02T00:00:00Z","alternative_title":["IST Austria Technical Report"],"pubrep_id":"10","month":"07","related_material":{"record":[{"relation":"later_version","id":"2956","status":"public"}]},"type":"technical_report","file":[{"checksum":"a03c08c1589dbb0c96183a8bcf3ab240","relation":"main_file","creator":"system","access_level":"open_access","file_id":"5522","date_created":"2018-12-12T11:54:00Z","file_name":"IST-2012-002_IST-2012-0002.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:38Z","file_size":592098}],"department":[{"_id":"KrCh"}],"oa_version":"Published Version","publication_status":"published","date_updated":"2023-02-23T11:05:50Z","oa":1,"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Velner, Yaron","first_name":"Yaron","last_name":"Velner"}],"has_accepted_license":"1","citation":{"apa":"Chatterjee, K., &#38; Velner, Y. (2012). <i>Mean-payoff pushdown games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">https://doi.org/10.15479/AT:IST-2012-0002</a>","mla":"Chatterjee, Krishnendu, and Yaron Velner. <i>Mean-Payoff Pushdown Games</i>. IST Austria, 2012, doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">10.15479/AT:IST-2012-0002</a>.","ista":"Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p.","ieee":"K. Chatterjee and Y. Velner, <i>Mean-payoff pushdown games</i>. IST Austria, 2012.","chicago":"Chatterjee, Krishnendu, and Yaron Velner. <i>Mean-Payoff Pushdown Games</i>. IST Austria, 2012. <a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">https://doi.org/10.15479/AT:IST-2012-0002</a>.","short":"K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.","ama":"Chatterjee K, Velner Y. <i>Mean-Payoff Pushdown Games</i>. IST Austria; 2012. doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">10.15479/AT:IST-2012-0002</a>"},"day":"02","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"5377","status":"public","publication_identifier":{"issn":["2664-1690"]},"doi":"10.15479/AT:IST-2012-0002","file_date_updated":"2020-07-14T12:46:38Z","abstract":[{"lang":"eng","text":"Two-player games on graphs are central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work we consider solving recursive game graphs (or pushdown game graphs) that can model the control flow of sequential programs with recursion. While pushdown games have been studied before with qualitative objectives, such as reachability and ω-regular objectives, in this work we study for the first time such games with the most well-studied quantitative objective, namely, mean-payoff objectives. In pushdown games two types of strategies are relevant: (1) global strategies, that depend on the entire global history; and (2) modular strategies, that have only local memory and thus do not depend on the context of invocation, but only on the history of the current invocation of the module. Our main results are as follows: (1) One-player pushdown games with mean-payoff objectives under global strategies are decidable in polynomial time. (2) Two- player pushdown games with mean-payoff objectives under global strategies are undecidable. (3) One-player pushdown games with mean-payoff objectives under modular strategies are NP- hard. (4) Two-player pushdown games with mean-payoff objectives under modular strategies can be solved in NP (i.e., both one-player and two-player pushdown games with mean-payoff objectives under modular strategies are NP-complete). We also establish the optimal strategy complexity showing that global strategies for mean-payoff objectives require infinite memory even in one-player pushdown games; and memoryless modular strategies are sufficient in two- player pushdown games. Finally we also show that all the problems have the same complexity if the stack boundedness condition is added, where along with the mean-payoff objective the player must also ensure that the stack height is bounded."}]},{"doi":"10.15479/AT:IST-2012-0001","abstract":[{"text":"One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires O(n3 · m) time as compared to the previous known O(n6)-time algorithm, where n is the number of states and m is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires O(m2)-time as compared to the previous known O((n · m)2)-time algorithm, where n is the number of states and m is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:39Z","status":"public","_id":"5378","publication_identifier":{"issn":["2664-1690"]},"date_updated":"2023-02-23T12:21:38Z","oa_version":"Published Version","publication_status":"published","department":[{"_id":"KrCh"}],"file":[{"file_name":"IST-2012-0001_IST-2012-0001.pdf","file_size":394256,"content_type":"application/pdf","date_updated":"2020-07-14T12:46:39Z","access_level":"open_access","date_created":"2018-12-12T11:53:28Z","file_id":"5489","relation":"main_file","checksum":"ec8d1857cc7095d3de5107a0162ced37","creator":"system"}],"day":"04","citation":{"chicago":"Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. <i>Faster Algorithms for Alternating Refinement Relations</i>. IST Austria, 2012. <a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">https://doi.org/10.15479/AT:IST-2012-0001</a>.","short":"K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement Relations, IST Austria, 2012.","ama":"Chatterjee K, Chaubal S, Kamath P. <i>Faster Algorithms for Alternating Refinement Relations</i>. IST Austria; 2012. doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">10.15479/AT:IST-2012-0001</a>","ieee":"K. Chatterjee, S. Chaubal, and P. Kamath, <i>Faster algorithms for alternating refinement relations</i>. IST Austria, 2012.","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Alternating Refinement Relations</i>. IST Austria, 2012, doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">10.15479/AT:IST-2012-0001</a>.","apa":"Chatterjee, K., Chaubal, S., &#38; Kamath, P. (2012). <i>Faster algorithms for alternating refinement relations</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">https://doi.org/10.15479/AT:IST-2012-0001</a>","ista":"Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations, IST Austria, 21p."},"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"last_name":"Chaubal","first_name":"Siddhesh","full_name":"Chaubal, Siddhesh"},{"full_name":"Kamath, Pritish","first_name":"Pritish","last_name":"Kamath"}],"alternative_title":["IST Austria Technical Report"],"pubrep_id":"14","type":"technical_report","month":"07","related_material":{"record":[{"status":"public","id":"497","relation":"later_version"}]},"date_published":"2012-07-04T00:00:00Z","title":"Faster algorithms for alternating refinement relations","publisher":"IST Austria","year":"2012","language":[{"iso":"eng"}],"ddc":["000","005"],"date_created":"2018-12-12T11:38:59Z","page":"21"},{"date_created":"2018-12-12T11:39:06Z","ddc":["000"],"page":"13","year":"2012","language":[{"iso":"eng"}],"publisher":"IST Austria","date_published":"2012-07-23T00:00:00Z","title":"Approximating marginals using discrete energy minimization","alternative_title":["IST Austria Technical Report"],"pubrep_id":"36","related_material":{"record":[{"status":"public","id":"3124","relation":"earlier_version"}]},"month":"07","type":"technical_report","department":[{"_id":"VlKo"},{"_id":"ChLa"}],"file":[{"creator":"system","checksum":"7e0ba85ad123b13223aaf6cdde2d288c","relation":"main_file","date_updated":"2020-07-14T12:46:44Z","content_type":"application/pdf","file_size":618744,"file_name":"IST-2012-0003_IST-2012-0003.pdf","file_id":"5490","date_created":"2018-12-12T11:53:29Z","access_level":"open_access"}],"date_updated":"2023-02-23T11:13:22Z","oa_version":"Published Version","publication_status":"published","oa":1,"author":[{"last_name":"Korc","id":"476A2FD6-F248-11E8-B48F-1D18A9856A87","first_name":"Filip","full_name":"Korc, Filip"},{"last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Lampert, Christoph","last_name":"Lampert"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","day":"23","citation":{"mla":"Korc, Filip, et al. <i>Approximating Marginals Using Discrete Energy Minimization</i>. IST Austria, 2012, doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0003\">10.15479/AT:IST-2012-0003</a>.","apa":"Korc, F., Kolmogorov, V., &#38; Lampert, C. (2012). <i>Approximating marginals using discrete energy minimization</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2012-0003\">https://doi.org/10.15479/AT:IST-2012-0003</a>","ista":"Korc F, Kolmogorov V, Lampert C. 2012. Approximating marginals using discrete energy minimization, IST Austria, 13p.","ieee":"F. Korc, V. Kolmogorov, and C. Lampert, <i>Approximating marginals using discrete energy minimization</i>. IST Austria, 2012.","chicago":"Korc, Filip, Vladimir Kolmogorov, and Christoph Lampert. <i>Approximating Marginals Using Discrete Energy Minimization</i>. IST Austria, 2012. <a href=\"https://doi.org/10.15479/AT:IST-2012-0003\">https://doi.org/10.15479/AT:IST-2012-0003</a>.","short":"F. Korc, V. Kolmogorov, C. Lampert, Approximating Marginals Using Discrete Energy Minimization, IST Austria, 2012.","ama":"Korc F, Kolmogorov V, Lampert C. <i>Approximating Marginals Using Discrete Energy Minimization</i>. IST Austria; 2012. doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0003\">10.15479/AT:IST-2012-0003</a>"},"_id":"5396","status":"public","publication_identifier":{"issn":["2664-1690"]},"file_date_updated":"2020-07-14T12:46:44Z","doi":"10.15479/AT:IST-2012-0003","abstract":[{"lang":"eng","text":"We consider the problem of inference in agraphical model with binary variables. While in theory it is arguably preferable to compute marginal probabilities, in practice researchers often use MAP inference due to the availability of efficient discrete optimization algorithms. We bridge the gap between the two approaches by introducing the Discrete  Marginals technique in which approximate marginals are obtained by minimizing an objective function with unary and pair-wise terms over a discretized domain. This allows the use of techniques originally devel-oped for MAP-MRF inference and learning. We explore two ways to set up the objective function - by discretizing the Bethe free energy and by learning it  from training data. Experimental results show that for certain types of graphs a learned function can out-perform the  Bethe approximation. We also establish a link between the Bethe free energy and submodular functions."}]},{"ddc":["020"],"date_created":"2018-12-12T11:39:06Z","language":[{"iso":"eng"}],"year":"2012","publisher":"IST Austria","date_published":"2012-11-12T00:00:00Z","title":"Actual state of research data @ ISTAustria","type":"report","month":"11","pubrep_id":"103","day":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Porsche J. 2012. Actual state of research data @ ISTAustria, IST Austria,p.","apa":"Porsche, J. (2012). <i>Actual state of research data @ ISTAustria</i>. IST Austria.","mla":"Porsche, Jana. <i>Actual State of Research Data @ ISTAustria</i>. IST Austria, 2012.","short":"J. Porsche, Actual State of Research Data @ ISTAustria, IST Austria, 2012.","ama":"Porsche J. <i>Actual State of Research Data @ ISTAustria</i>. IST Austria; 2012.","chicago":"Porsche, Jana. <i>Actual State of Research Data @ ISTAustria</i>. IST Austria, 2012.","ieee":"J. Porsche, <i>Actual state of research data @ ISTAustria</i>. IST Austria, 2012."},"has_accepted_license":"1","oa":1,"author":[{"first_name":"Jana","id":"3252EDC2-F248-11E8-B48F-1D18A9856A87","full_name":"Porsche, Jana","last_name":"Porsche"}],"date_updated":"2020-07-14T23:04:49Z","oa_version":"Published Version","publication_status":"published","department":[{"_id":"E-Lib"}],"file":[{"checksum":"e0a7c041eea1ca4b70ab6f9ec5177f4e","relation":"main_file","creator":"system","access_level":"open_access","file_id":"5472","date_created":"2018-12-12T11:53:11Z","file_name":"IST-2012-103-v1+1_Actual_state_of_research_data_@_IST_Austria.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:44Z","file_size":238544}],"status":"public","_id":"5398","abstract":[{"text":"This document is created as a part of the project “Repository for Research Data on IST Austria”. It summarises the actual state of research data at IST Austria, based on survey results. It supports the choice of appropriate software, which would best fit the requirements of their users, the researchers.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:44Z"},{"publisher":"Springer Berlin Heidelberg","intvolume":"      7561","page":"107-121","language":[{"iso":"eng"}],"status":"public","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783642333859","9783642333866"]},"doi":"10.1007/978-3-642-33386-6_10","publication_status":"published","place":"Berlin, Heidelberg","ec_funded":1,"series_title":"LNCS","conference":{"end_date":"2012-10-06","start_date":"2012-10-03","location":"Thiruvananthapuram, Kerala, India","name":"ATVA 2012"},"project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425"}],"date_published":"2012-01-01T00:00:00Z","title":"Improved Single Pass Algorithms for Resolution Proof Reduction","quality_controlled":"1","ddc":["005"],"date_created":"2018-12-18T13:01:46Z","year":"2012","publication":"Automated Technology for Verification and Analysis","article_processing_charge":"No","volume":7561,"_id":"5745","file_date_updated":"2020-07-14T12:47:10Z","pubrep_id":"180","type":"book_chapter","oa_version":"None","date_updated":"2023-09-05T14:15:29Z","department":[{"_id":"ToHe"}],"file":[{"content_type":"application/pdf","date_updated":"2020-07-14T12:47:10Z","file_size":465502,"file_name":"2012_ATVA_Gupta.pdf","file_id":"5746","date_created":"2018-12-18T13:07:35Z","access_level":"open_access","creator":"dernst","checksum":"68415837a315de3cc4d120f6019d752c","relation":"main_file"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ama":"Gupta A. Improved Single Pass Algorithms for Resolution Proof Reduction. In: <i>Automated Technology for Verification and Analysis</i>. Vol 7561. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2012:107-121. doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">10.1007/978-3-642-33386-6_10</a>","short":"A. Gupta, in:, Automated Technology for Verification and Analysis, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 107–121.","chicago":"Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.” In <i>Automated Technology for Verification and Analysis</i>, 7561:107–21. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">https://doi.org/10.1007/978-3-642-33386-6_10</a>.","ieee":"A. Gupta, “Improved Single Pass Algorithms for Resolution Proof Reduction,” in <i>Automated Technology for Verification and Analysis</i>, vol. 7561, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 107–121.","ista":"Gupta A. 2012.Improved Single Pass Algorithms for Resolution Proof Reduction. In: Automated Technology for Verification and Analysis. vol. 7561, 107–121.","mla":"Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.” <i>Automated Technology for Verification and Analysis</i>, vol. 7561, Springer Berlin Heidelberg, 2012, pp. 107–21, doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">10.1007/978-3-642-33386-6_10</a>.","apa":"Gupta, A. (2012). Improved Single Pass Algorithms for Resolution Proof Reduction. In <i>Automated Technology for Verification and Analysis</i> (Vol. 7561, pp. 107–121). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">https://doi.org/10.1007/978-3-642-33386-6_10</a>"},"has_accepted_license":"1","author":[{"first_name":"Ashutosh","full_name":"Gupta, Ashutosh","last_name":"Gupta"}],"oa":1},{"quality_controlled":"1","title":"An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets","date_published":"2012-05-01T00:00:00Z","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"publication":"Procedia Technology","volume":4,"year":"2012","ddc":["000"],"date_created":"2019-01-17T11:54:21Z","file_date_updated":"2020-07-14T12:47:12Z","_id":"5839","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Biswas, Ranita, and Jaya Sil. “An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets.” <i>Procedia Technology</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.protcy.2012.05.134\">https://doi.org/10.1016/j.protcy.2012.05.134</a>.","ama":"Biswas R, Sil J. An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets. <i>Procedia Technology</i>. 2012;4:820-824. doi:<a href=\"https://doi.org/10.1016/j.protcy.2012.05.134\">10.1016/j.protcy.2012.05.134</a>","short":"R. Biswas, J. Sil, Procedia Technology 4 (2012) 820–824.","ieee":"R. Biswas and J. Sil, “An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets,” <i>Procedia Technology</i>, vol. 4. Elsevier, pp. 820–824, 2012.","apa":"Biswas, R., &#38; Sil, J. (2012). An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets. <i>Procedia Technology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.protcy.2012.05.134\">https://doi.org/10.1016/j.protcy.2012.05.134</a>","mla":"Biswas, Ranita, and Jaya Sil. “An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets.” <i>Procedia Technology</i>, vol. 4, Elsevier, 2012, pp. 820–24, doi:<a href=\"https://doi.org/10.1016/j.protcy.2012.05.134\">10.1016/j.protcy.2012.05.134</a>.","ista":"Biswas R, Sil J. 2012. An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets. Procedia Technology. 4, 820–824."},"author":[{"last_name":"Biswas","orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","full_name":"Biswas, Ranita","first_name":"Ranita"},{"last_name":"Sil","full_name":"Sil, Jaya","first_name":"Jaya"}],"oa":1,"oa_version":"Published Version","date_updated":"2021-01-12T08:03:43Z","file":[{"date_updated":"2020-07-14T12:47:12Z","content_type":"application/pdf","file_size":305426,"file_name":"2012_Procedia_Biswas.pdf","file_id":"5863","date_created":"2019-01-21T07:28:06Z","access_level":"open_access","creator":"dernst","checksum":"ba0185986b151d8c11201f48cd505ceb","relation":"main_file"}],"type":"journal_article","publisher":"Elsevier","language":[{"iso":"eng"}],"page":"820-824","intvolume":"         4","abstract":[{"lang":"eng","text":"Canny's edge detection algorithm is a classical and robust method for edge detection in gray-scale images. The two \r\nsignificant features of this method are introduction of NMS (Non-Maximum Suppression) and double thresholding of \r\nthe  gradient  image.  Due  to  poor  illumination,  the  region  boundaries  in  an  image  may  become  vague,  creating  \r\nuncertainties  in  the  gradient  image.  In  this  paper,  we  have  proposed  an  algorithm  based  on  the  concept  of  type-2  fuzzy  sets  to  handle  uncertainties  that  automatically  selects  the  threshold  values  needed  to  segment  the  gradient image using classical Canny’s edge detection algorithm. The results show that our algorithm works significantly well on different benchmark images as well as medical images (hand radiography images). "}],"doi":"10.1016/j.protcy.2012.05.134","publication_identifier":{"issn":["2212-0173"]},"status":"public","day":"01","extern":"1","publication_status":"published","month":"05"},{"date_published":"2012-04-13T00:00:00Z","title":"Activator-mediator binding stabilizes RNA polymerase II orientation within the human mediator-RNA polymerase II-TFIIF assembly","publisher":"Elsevier","publication":"Journal of Molecular Biology","article_processing_charge":"No","language":[{"iso":"eng"}],"volume":417,"year":"2012","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4582759/","open_access":"1"}],"page":"387 - 394","date_created":"2018-12-11T11:47:24Z","intvolume":"       417","publist_id":"7208","abstract":[{"lang":"eng","text":"The human Mediator complex controls RNA polymerase II (pol II) function in ways that remain incompletely understood. Activator-Mediator binding alters Mediator structure, and these activator-induced structural shifts appear to play key roles in regulating transcription. A recent cryo-electron microscopy (EM) analysis revealed that pol II adopted a stable orientation within a Mediator-pol II-TFIIF assembly in which Mediator was bound to the activation domain of viral protein 16 (VP16). Whereas TFIIF was shown to be important for orienting pol II within this assembly, the potential role of the activator was not assessed. To determine how activator binding might affect pol II orientation, we isolated human Mediator-pol II-TFIIF complexes in which Mediator was not bound to an activator. Cryo-EM analysis of this assembly, coupled with pol II crystal structure docking, revealed that pol II binds Mediator at the same general location; however, in contrast to VP16-bound Mediator, pol II does not appear to stably orient in the absence of an activator. Variability in pol II orientation might be important mechanistically, perhaps to enable sense and antisense transcription at human promoters. Because Mediator interacts extensively with pol II, these results suggest that Mediator structural shifts induced by activator binding help stably orient pol II prior to transcription initiation."}],"doi":"10.1016/j.jmb.2012.02.014","issue":"5","status":"public","_id":"596","citation":{"ista":"Bernecky C, Taatjes D. 2012. Activator-mediator binding stabilizes RNA polymerase II orientation within the human mediator-RNA polymerase II-TFIIF assembly. Journal of Molecular Biology. 417(5), 387–394.","mla":"Bernecky, Carrie, and Dylan Taatjes. “Activator-Mediator Binding Stabilizes RNA Polymerase II Orientation within the Human Mediator-RNA Polymerase II-TFIIF Assembly.” <i>Journal of Molecular Biology</i>, vol. 417, no. 5, Elsevier, 2012, pp. 387–94, doi:<a href=\"https://doi.org/10.1016/j.jmb.2012.02.014\">10.1016/j.jmb.2012.02.014</a>.","apa":"Bernecky, C., &#38; Taatjes, D. (2012). Activator-mediator binding stabilizes RNA polymerase II orientation within the human mediator-RNA polymerase II-TFIIF assembly. <i>Journal of Molecular Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jmb.2012.02.014\">https://doi.org/10.1016/j.jmb.2012.02.014</a>","ama":"Bernecky C, Taatjes D. Activator-mediator binding stabilizes RNA polymerase II orientation within the human mediator-RNA polymerase II-TFIIF assembly. <i>Journal of Molecular Biology</i>. 2012;417(5):387-394. doi:<a href=\"https://doi.org/10.1016/j.jmb.2012.02.014\">10.1016/j.jmb.2012.02.014</a>","short":"C. Bernecky, D. Taatjes, Journal of Molecular Biology 417 (2012) 387–394.","chicago":"Bernecky, Carrie, and Dylan Taatjes. “Activator-Mediator Binding Stabilizes RNA Polymerase II Orientation within the Human Mediator-RNA Polymerase II-TFIIF Assembly.” <i>Journal of Molecular Biology</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.jmb.2012.02.014\">https://doi.org/10.1016/j.jmb.2012.02.014</a>.","ieee":"C. Bernecky and D. Taatjes, “Activator-mediator binding stabilizes RNA polymerase II orientation within the human mediator-RNA polymerase II-TFIIF assembly,” <i>Journal of Molecular Biology</i>, vol. 417, no. 5. Elsevier, pp. 387–394, 2012."},"day":"13","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","extern":"1","oa":1,"author":[{"orcid":"0000-0003-0893-7036","first_name":"Carrie A","id":"2CB9DFE2-F248-11E8-B48F-1D18A9856A87","full_name":"Bernecky, Carrie A","last_name":"Bernecky"},{"last_name":"Taatjes","full_name":"Taatjes, Dylan","first_name":"Dylan"}],"date_updated":"2021-01-12T08:05:21Z","publication_status":"published","oa_version":"None","type":"journal_article","month":"04"},{"_id":"6136","external_id":{"pmid":["22388961"]},"type":"journal_article","date_updated":"2021-01-12T08:06:17Z","oa_version":"Submitted Version","citation":{"chicago":"Busch, Karl Emanuel, Patrick Laurent, Zoltan Soltesz, Robin Joseph Murphy, Olivier Faivre, Berthold Hedwig, Martin Thomas, Heather L Smith, and Mario de Bono. “Tonic Signaling from O2 Sensors Sets Neural Circuit Activity and Behavioral State.” <i>Nature Neuroscience</i>. Springer Nature, 2012. <a href=\"https://doi.org/10.1038/nn.3061\">https://doi.org/10.1038/nn.3061</a>.","ama":"Busch KE, Laurent P, Soltesz Z, et al. Tonic signaling from O2 sensors sets neural circuit activity and behavioral state. <i>Nature Neuroscience</i>. 2012;15(4):581-591. doi:<a href=\"https://doi.org/10.1038/nn.3061\">10.1038/nn.3061</a>","short":"K.E. Busch, P. Laurent, Z. Soltesz, R.J. Murphy, O. Faivre, B. Hedwig, M. Thomas, H.L. Smith, M. de Bono, Nature Neuroscience 15 (2012) 581–591.","ieee":"K. E. Busch <i>et al.</i>, “Tonic signaling from O2 sensors sets neural circuit activity and behavioral state,” <i>Nature Neuroscience</i>, vol. 15, no. 4. Springer Nature, pp. 581–591, 2012.","mla":"Busch, Karl Emanuel, et al. “Tonic Signaling from O2 Sensors Sets Neural Circuit Activity and Behavioral State.” <i>Nature Neuroscience</i>, vol. 15, no. 4, Springer Nature, 2012, pp. 581–91, doi:<a href=\"https://doi.org/10.1038/nn.3061\">10.1038/nn.3061</a>.","apa":"Busch, K. E., Laurent, P., Soltesz, Z., Murphy, R. J., Faivre, O., Hedwig, B., … de Bono, M. (2012). Tonic signaling from O2 sensors sets neural circuit activity and behavioral state. <i>Nature Neuroscience</i>. Springer Nature. <a href=\"https://doi.org/10.1038/nn.3061\">https://doi.org/10.1038/nn.3061</a>","ista":"Busch KE, Laurent P, Soltesz Z, Murphy RJ, Faivre O, Hedwig B, Thomas M, Smith HL, de Bono M. 2012. Tonic signaling from O2 sensors sets neural circuit activity and behavioral state. Nature Neuroscience. 15(4), 581–591."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Busch","full_name":"Busch, Karl Emanuel","first_name":"Karl Emanuel"},{"last_name":"Laurent","full_name":"Laurent, Patrick","first_name":"Patrick"},{"last_name":"Soltesz","first_name":"Zoltan","full_name":"Soltesz, Zoltan"},{"first_name":"Robin Joseph","full_name":"Murphy, Robin Joseph","last_name":"Murphy"},{"last_name":"Faivre","first_name":"Olivier","full_name":"Faivre, Olivier"},{"last_name":"Hedwig","first_name":"Berthold","full_name":"Hedwig, Berthold"},{"last_name":"Thomas","first_name":"Martin","full_name":"Thomas, Martin"},{"last_name":"Smith","full_name":"Smith, Heather L","first_name":"Heather L"},{"orcid":"0000-0001-8347-0443","first_name":"Mario","full_name":"de Bono, Mario","id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","last_name":"de Bono"}],"oa":1,"date_published":"2012-03-04T00:00:00Z","title":"Tonic signaling from O2 sensors sets neural circuit activity and behavioral state","quality_controlled":"1","date_created":"2019-03-20T14:23:30Z","year":"2012","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3564487/","open_access":"1"}],"publication":"Nature Neuroscience","volume":15,"status":"public","pmid":1,"publication_identifier":{"issn":["1097-6256","1546-1726"]},"issue":"4","doi":"10.1038/nn.3061","abstract":[{"text":"Tonic receptors convey stimulus duration and intensity and are implicated in homeostatic control. However, how tonic homeostatic signals are generated and how they reconfigure neural circuits and modify animal behavior is poorly understood. Here we show that Caenorhabditis elegans O2-sensing neurons are tonic receptors that continuously signal ambient [O2] to set the animal's behavioral state. Sustained signaling relied on a Ca2+ relay involving L-type voltage-gated Ca2+ channels, the ryanodine and the inositol-1,4,5-trisphosphate receptors. Tonic activity evoked continuous neuropeptide release, which helps elicit the enduring behavioral state associated with high [O2]. Sustained O2 receptor signaling was propagated to downstream neural circuits, including the hub interneuron RMG. O2 receptors evoked similar locomotory states at particular O2 concentrations, regardless of previous d[O2]/dt. However, a phasic component of the URX receptors' response to high d[O2]/dt, as well as tonic-to-phasic transformations in downstream interneurons, enabled transient reorientation movements shaped by d[O2]/dt. Our results highlight how tonic homeostatic signals can generate both transient and enduring behavioral change.","lang":"eng"}],"month":"03","publication_status":"published","day":"04","extern":"1","publisher":"Springer Nature","intvolume":"        15","page":"581-591","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"article_type":"original","page":"63-78","intvolume":"         8","publisher":"B. Verkin Institute for Low Temperature Physics and Engineering","day":"01","publication_status":"published","acknowledgement":"This work is supported by the Austrian Science Fund (FWF), Project P22025-N18.\r\n","isi":1,"month":"01","abstract":[{"lang":"eng","text":"First we note that the best polynomial approximation to vertical bar x vertical bar on the set, which consists of an interval on the positive half-axis and a point on the negative half-axis, can be given by means of the classical Chebyshev polynomials. Then we explore the cases when a solution of the related problem on two intervals can be given in elementary functions."}],"issue":"1","publication_identifier":{"issn":["1812-9471"]},"status":"public","publication":"Journal of Mathematical Physics, Analysis, Geometry","volume":8,"article_processing_charge":"No","main_file_link":[{"url":"http://mi.mathnet.ru/eng/jmag525","open_access":"1"}],"year":"2012","date_created":"2019-06-27T08:16:56Z","quality_controlled":"1","title":"Elementary solutions of the Bernstein problem on two intervals","date_published":"2012-01-01T00:00:00Z","citation":{"apa":"Pausinger, F. (2012). Elementary solutions of the Bernstein problem on two intervals. <i>Journal of Mathematical Physics, Analysis, Geometry</i>. B. Verkin Institute for Low Temperature Physics and Engineering.","mla":"Pausinger, Florian. “Elementary Solutions of the Bernstein Problem on Two Intervals.” <i>Journal of Mathematical Physics, Analysis, Geometry</i>, vol. 8, no. 1, B. Verkin Institute for Low Temperature Physics and Engineering, 2012, pp. 63–78.","ista":"Pausinger F. 2012. Elementary solutions of the Bernstein problem on two intervals. Journal of Mathematical Physics, Analysis, Geometry. 8(1), 63–78.","ieee":"F. Pausinger, “Elementary solutions of the Bernstein problem on two intervals,” <i>Journal of Mathematical Physics, Analysis, Geometry</i>, vol. 8, no. 1. B. Verkin Institute for Low Temperature Physics and Engineering, pp. 63–78, 2012.","chicago":"Pausinger, Florian. “Elementary Solutions of the Bernstein Problem on Two Intervals.” <i>Journal of Mathematical Physics, Analysis, Geometry</i>. B. Verkin Institute for Low Temperature Physics and Engineering, 2012.","short":"F. Pausinger, Journal of Mathematical Physics, Analysis, Geometry 8 (2012) 63–78.","ama":"Pausinger F. Elementary solutions of the Bernstein problem on two intervals. <i>Journal of Mathematical Physics, Analysis, Geometry</i>. 2012;8(1):63-78."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"author":[{"last_name":"Pausinger","orcid":"0000-0002-8379-3768","full_name":"Pausinger, Florian","first_name":"Florian","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Published Version","date_updated":"2023-10-16T09:41:31Z","department":[{"_id":"HeEd"}],"type":"journal_article","scopus_import":"1","external_id":{"isi":["000301173600004"]},"_id":"6588"},{"quality_controlled":0,"date_published":"2012-08-01T00:00:00Z","title":"Prym varieties of spectral covers","publisher":"University of Warwick","publication":"Geometry and Topology","volume":16,"year":"2012","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1012.4748"}],"page":"1609 - 1638","intvolume":"        16","date_created":"2018-12-11T11:52:13Z","doi":"10.2140/gt.2012.16.1609","abstract":[{"lang":"eng","text":"Given a possibly reducible and non-reduced spectral cover π: X → C over a smooth projective complex curve C we determine the group of connected components of the Prym variety Prym(X/C). As an immediate application we show that the finite group of n-torsion points of the Jacobian of C acts trivially on the cohomology of the twisted SL n-Higgs moduli space up to the degree which is predicted by topological mirror symmetry. In particular this yields a new proof of a result of Harder-Narasimhan, showing that this finite group acts trivially on the cohomology of the twisted SL n stable bundle moduli space."}],"publist_id":"5726","issue":"3","status":"public","_id":"1471","citation":{"ista":"Hausel T, Pauly C. 2012. Prym varieties of spectral covers. Geometry and Topology. 16(3), 1609–1638.","mla":"Hausel, Tamás, and Christian Pauly. “Prym Varieties of Spectral Covers.” <i>Geometry and Topology</i>, vol. 16, no. 3, University of Warwick, 2012, pp. 1609–38, doi:<a href=\"https://doi.org/10.2140/gt.2012.16.1609\">10.2140/gt.2012.16.1609</a>.","apa":"Hausel, T., &#38; Pauly, C. (2012). Prym varieties of spectral covers. <i>Geometry and Topology</i>. University of Warwick. <a href=\"https://doi.org/10.2140/gt.2012.16.1609\">https://doi.org/10.2140/gt.2012.16.1609</a>","ieee":"T. Hausel and C. Pauly, “Prym varieties of spectral covers,” <i>Geometry and Topology</i>, vol. 16, no. 3. University of Warwick, pp. 1609–1638, 2012.","ama":"Hausel T, Pauly C. Prym varieties of spectral covers. <i>Geometry and Topology</i>. 2012;16(3):1609-1638. doi:<a href=\"https://doi.org/10.2140/gt.2012.16.1609\">10.2140/gt.2012.16.1609</a>","short":"T. Hausel, C. Pauly, Geometry and Topology 16 (2012) 1609–1638.","chicago":"Hausel, Tamás, and Christian Pauly. “Prym Varieties of Spectral Covers.” <i>Geometry and Topology</i>. University of Warwick, 2012. <a href=\"https://doi.org/10.2140/gt.2012.16.1609\">https://doi.org/10.2140/gt.2012.16.1609</a>."},"day":"01","oa":1,"author":[{"full_name":"Tamas Hausel","first_name":"Tamas","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","last_name":"Hausel"},{"full_name":"Pauly, Christian","first_name":"Christian","last_name":"Pauly"}],"extern":1,"date_updated":"2021-01-12T06:50:58Z","publication_status":"published","type":"journal_article","month":"08"},{"extern":1,"oa":1,"author":[{"last_name":"De Cataldo","full_name":"De Cataldo, Mark A","first_name":"Mark"},{"first_name":"Tamas","full_name":"Tamas Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","last_name":"Hausel"},{"first_name":"Luca","full_name":"Migliorini, Luca","last_name":"Migliorini"}],"day":"01","citation":{"ieee":"M. De Cataldo, T. Hausel, and L. Migliorini, “Topology of hitchin systems and Hodge theory of character varieties: The case A 1,” <i>Annals of Mathematics</i>, vol. 175, no. 3. Princeton University Press, pp. 1329–1407, 2012.","chicago":"De Cataldo, Mark, Tamás Hausel, and Luca Migliorini. “Topology of Hitchin Systems and Hodge Theory of Character Varieties: The Case A 1.” <i>Annals of Mathematics</i>. Princeton University Press, 2012. <a href=\"https://doi.org/10.4007/annals.2012.175.3.7\">https://doi.org/10.4007/annals.2012.175.3.7</a>.","short":"M. De Cataldo, T. Hausel, L. Migliorini, Annals of Mathematics 175 (2012) 1329–1407.","ama":"De Cataldo M, Hausel T, Migliorini L. Topology of hitchin systems and Hodge theory of character varieties: The case A 1. <i>Annals of Mathematics</i>. 2012;175(3):1329-1407. doi:<a href=\"https://doi.org/10.4007/annals.2012.175.3.7\">10.4007/annals.2012.175.3.7</a>","mla":"De Cataldo, Mark, et al. “Topology of Hitchin Systems and Hodge Theory of Character Varieties: The Case A 1.” <i>Annals of Mathematics</i>, vol. 175, no. 3, Princeton University Press, 2012, pp. 1329–407, doi:<a href=\"https://doi.org/10.4007/annals.2012.175.3.7\">10.4007/annals.2012.175.3.7</a>.","apa":"De Cataldo, M., Hausel, T., &#38; Migliorini, L. (2012). Topology of hitchin systems and Hodge theory of character varieties: The case A 1. <i>Annals of Mathematics</i>. Princeton University Press. <a href=\"https://doi.org/10.4007/annals.2012.175.3.7\">https://doi.org/10.4007/annals.2012.175.3.7</a>","ista":"De Cataldo M, Hausel T, Migliorini L. 2012. Topology of hitchin systems and Hodge theory of character varieties: The case A 1. Annals of Mathematics. 175(3), 1329–1407."},"publication_status":"published","acknowledgement":"Mark Andrea A. de Cataldo was partially supported by N.S.A. and N.S.F. Tamás Hausel was supported by a Royal Society University Research Fellowship. Luca Migliorini was partially supported by PRIN 2007 project \"Spazi di moduli e teoria di Lie\"","date_updated":"2021-01-12T06:50:59Z","month":"05","type":"journal_article","abstract":[{"text":"For G = GL 2, PGL 2, SL 2 we prove that the perverse filtration associated with the Hitchin map on the rational cohomology of the moduli space of twisted G-Higgs bundles on a compact Riemann surface C agrees with the weight filtration on the rational cohomology of the twisted G character variety of C when the cohomologies are identified via non-Abelian Hodge theory. The proof is accomplished by means of a study of the topology of the Hitchin map over the locus of integral spectral curves.","lang":"eng"}],"doi":"10.4007/annals.2012.175.3.7","publist_id":"5727","issue":"3","_id":"1472","status":"public","volume":175,"publication":"Annals of Mathematics","main_file_link":[{"url":"http://arxiv.org/abs/1004.1420","open_access":"1"}],"year":"2012","page":"1329 - 1407","date_created":"2018-12-11T11:52:13Z","intvolume":"       175","quality_controlled":0,"title":"Topology of hitchin systems and Hodge theory of character varieties: The case A 1","date_published":"2012-05-01T00:00:00Z","publisher":"Princeton University Press"},{"related_material":{"record":[{"status":"public","id":"2968","relation":"used_in_publication"}]},"month":"06","type":"research_data_reference","department":[{"_id":"NiBa"}],"date_updated":"2025-05-28T11:56:58Z","oa_version":"Published Version","oa":1,"author":[{"first_name":"Konrad","full_name":"Lohse, Konrad","last_name":"Lohse"},{"full_name":"Barton, Nicholas H","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","last_name":"Barton"},{"last_name":"Stone","full_name":"Stone, Graham","first_name":"Graham"},{"last_name":"Melika","full_name":"Melika, George","first_name":"George"}],"day":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Lohse, K., Barton, N. H., Stone, G., &#38; Melika, G. (2012). Data from: A likelihood-based comparison of population histories in a parasitoid guild. Dryad. <a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">https://doi.org/10.5061/DRYAD.0G0FS</a>","mla":"Lohse, Konrad, et al. <i>Data from: A Likelihood-Based Comparison of Population Histories in a Parasitoid Guild</i>. Dryad, 2012, doi:<a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">10.5061/DRYAD.0G0FS</a>.","ista":"Lohse K, Barton NH, Stone G, Melika G. 2012. Data from: A likelihood-based comparison of population histories in a parasitoid guild, Dryad, <a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">10.5061/DRYAD.0G0FS</a>.","chicago":"Lohse, Konrad, Nicholas H Barton, Graham Stone, and George Melika. “Data from: A Likelihood-Based Comparison of Population Histories in a Parasitoid Guild.” Dryad, 2012. <a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">https://doi.org/10.5061/DRYAD.0G0FS</a>.","short":"K. Lohse, N.H. Barton, G. Stone, G. Melika, (2012).","ama":"Lohse K, Barton NH, Stone G, Melika G. Data from: A likelihood-based comparison of population histories in a parasitoid guild. 2012. doi:<a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">10.5061/DRYAD.0G0FS</a>","ieee":"K. Lohse, N. H. Barton, G. Stone, and G. Melika, “Data from: A likelihood-based comparison of population histories in a parasitoid guild.” Dryad, 2012."},"_id":"13075","status":"public","abstract":[{"text":"Little is known about the stability of trophic relationships in complex natural communities over evolutionary timescales. Here, we use sequence data from 18 nuclear loci to reconstruct and compare the intraspecific histories of major Pleistocene refugial populations in the Middle East, the Balkans and Iberia in a guild of four Chalcid parasitoids (Cecidostiba fungosa, C. semifascia, Hobbya stenonota and Mesopolobus amaenus) all attacking Cynipid oak galls. We develop a likelihood method to numerically estimate models of divergence between three populations from multilocus data. We investigate the power of this framework on simulated data, and - using triplet alignments of intronic loci - quantify the support for all possible divergence relationships between refugial populations in the four parasitoids. Although an East to West order of population divergence has highest support in all but one species, we cannot rule out alternative population tree topologies. Comparing the estimated times of population splits between species, we find that one species, M. amaenus, has a significantly older history than the rest of the guild and must have arrived in central Europe at least one glacial cycle prior to other guild members. This suggests that although all four species may share a common origin in the East, they expanded westwards into Europe at different times.","lang":"eng"}],"doi":"10.5061/DRYAD.0G0FS","date_created":"2023-05-23T17:01:02Z","ddc":["570"],"main_file_link":[{"url":"https://doi.org/10.5061/dryad.0g0fs","open_access":"1"}],"year":"2012","article_processing_charge":"No","tmp":{"short":"CC0 (1.0)","image":"/images/cc_0.png","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)"},"publisher":"Dryad","date_published":"2012-06-08T00:00:00Z","title":"Data from: A likelihood-based comparison of population histories in a parasitoid guild"},{"title":"Dynamically self-assembling carriers enable guiding of diamagnetic particles by weak magnets","date_published":"2012-11-26T00:00:00Z","keyword":["Colloid and Surface Chemistry","Biochemistry","General Chemistry","Catalysis"],"quality_controlled":"1","year":"2012","publication":"Journal of the American Chemical Society","article_processing_charge":"No","volume":134,"date_created":"2023-08-01T09:47:42Z","external_id":{"pmid":["23181449"]},"scopus_import":"1","_id":"13407","oa_version":"Published Version","date_updated":"2023-08-08T07:51:10Z","citation":{"ieee":"O. Chovnik, R. Balgley, J. R. Goldman, and R. Klajn, “Dynamically self-assembling carriers enable guiding of diamagnetic particles by weak magnets,” <i>Journal of the American Chemical Society</i>, vol. 134, no. 48. American Chemical Society, pp. 19564–19567, 2012.","ama":"Chovnik O, Balgley R, Goldman JR, Klajn R. Dynamically self-assembling carriers enable guiding of diamagnetic particles by weak magnets. <i>Journal of the American Chemical Society</i>. 2012;134(48):19564-19567. doi:<a href=\"https://doi.org/10.1021/ja309633v\">10.1021/ja309633v</a>","short":"O. Chovnik, R. Balgley, J.R. Goldman, R. Klajn, Journal of the American Chemical Society 134 (2012) 19564–19567.","chicago":"Chovnik, Olga, Renata Balgley, Joel R. Goldman, and Rafal Klajn. “Dynamically Self-Assembling Carriers Enable Guiding of Diamagnetic Particles by Weak Magnets.” <i>Journal of the American Chemical Society</i>. American Chemical Society, 2012. <a href=\"https://doi.org/10.1021/ja309633v\">https://doi.org/10.1021/ja309633v</a>.","ista":"Chovnik O, Balgley R, Goldman JR, Klajn R. 2012. Dynamically self-assembling carriers enable guiding of diamagnetic particles by weak magnets. Journal of the American Chemical Society. 134(48), 19564–19567.","apa":"Chovnik, O., Balgley, R., Goldman, J. R., &#38; Klajn, R. (2012). Dynamically self-assembling carriers enable guiding of diamagnetic particles by weak magnets. <i>Journal of the American Chemical Society</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/ja309633v\">https://doi.org/10.1021/ja309633v</a>","mla":"Chovnik, Olga, et al. “Dynamically Self-Assembling Carriers Enable Guiding of Diamagnetic Particles by Weak Magnets.” <i>Journal of the American Chemical Society</i>, vol. 134, no. 48, American Chemical Society, 2012, pp. 19564–67, doi:<a href=\"https://doi.org/10.1021/ja309633v\">10.1021/ja309633v</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chovnik, Olga","first_name":"Olga","last_name":"Chovnik"},{"last_name":"Balgley","full_name":"Balgley, Renata","first_name":"Renata"},{"full_name":"Goldman, Joel R.","first_name":"Joel R.","last_name":"Goldman"},{"last_name":"Klajn","first_name":"Rafal","full_name":"Klajn, Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b"}],"type":"journal_article","publisher":"American Chemical Society","language":[{"iso":"eng"}],"intvolume":"       134","article_type":"original","page":"19564-19567","issue":"48","doi":"10.1021/ja309633v","abstract":[{"text":"We show that diamagnetic particles can be remotely manipulated by a magnet by the reversible adsorption of dual-responsive, light-switchable/superparamagnetic nanoparticles down to their surface. Adsorption occurs upon exposure to UV light, and can be reversed thermally or by ambient light. The dynamic self-assembly of thin films of the dual-responsive nanoparticles induces attractive interactions between diamagnetic particles. We demonstrate that catalytic amounts of the dual-responsive nanoparticles are sufficient to magnetically guide and deliver the diamagnetic particles to desired locations, where they can then be released by disassembling the dynamic layers of superparamagnetic nanoparticles with visible light.","lang":"eng"}],"pmid":1,"status":"public","publication_identifier":{"issn":["0002-7863"],"eissn":["1520-5126"]},"publication_status":"published","day":"26","extern":"1","month":"11"},{"quality_controlled":"1","title":"Metallic nanobowls by galvanic replacement reaction on heterodimeric nanoparticles","date_published":"2012-03-12T00:00:00Z","keyword":["Biomaterials","Biotechnology","General Materials Science","General Chemistry"],"publication":"Small","volume":8,"article_processing_charge":"No","year":"2012","date_created":"2023-08-01T09:47:55Z","scopus_import":"1","external_id":{"pmid":["22392681"]},"_id":"13408","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Ridelman Y, Singh G, Popovitz-Biro R, Wolf SG, Das S, Klajn R. 2012. Metallic nanobowls by galvanic replacement reaction on heterodimeric nanoparticles. Small. 8(5), 654–660.","apa":"Ridelman, Y., Singh, G., Popovitz-Biro, R., Wolf, S. G., Das, S., &#38; Klajn, R. (2012). Metallic nanobowls by galvanic replacement reaction on heterodimeric nanoparticles. <i>Small</i>. Wiley. <a href=\"https://doi.org/10.1002/smll.201101882\">https://doi.org/10.1002/smll.201101882</a>","mla":"Ridelman, Yonatan, et al. “Metallic Nanobowls by Galvanic Replacement Reaction on Heterodimeric Nanoparticles.” <i>Small</i>, vol. 8, no. 5, Wiley, 2012, pp. 654–60, doi:<a href=\"https://doi.org/10.1002/smll.201101882\">10.1002/smll.201101882</a>.","short":"Y. Ridelman, G. Singh, R. Popovitz-Biro, S.G. Wolf, S. Das, R. Klajn, Small 8 (2012) 654–660.","ama":"Ridelman Y, Singh G, Popovitz-Biro R, Wolf SG, Das S, Klajn R. Metallic nanobowls by galvanic replacement reaction on heterodimeric nanoparticles. <i>Small</i>. 2012;8(5):654-660. doi:<a href=\"https://doi.org/10.1002/smll.201101882\">10.1002/smll.201101882</a>","chicago":"Ridelman, Yonatan, Gurvinder Singh, Ronit Popovitz-Biro, Sharon G. Wolf, Sanjib Das, and Rafal Klajn. “Metallic Nanobowls by Galvanic Replacement Reaction on Heterodimeric Nanoparticles.” <i>Small</i>. Wiley, 2012. <a href=\"https://doi.org/10.1002/smll.201101882\">https://doi.org/10.1002/smll.201101882</a>.","ieee":"Y. Ridelman, G. Singh, R. Popovitz-Biro, S. G. Wolf, S. Das, and R. Klajn, “Metallic nanobowls by galvanic replacement reaction on heterodimeric nanoparticles,” <i>Small</i>, vol. 8, no. 5. Wiley, pp. 654–660, 2012."},"author":[{"last_name":"Ridelman","full_name":"Ridelman, Yonatan","first_name":"Yonatan"},{"last_name":"Singh","full_name":"Singh, Gurvinder","first_name":"Gurvinder"},{"last_name":"Popovitz-Biro","first_name":"Ronit","full_name":"Popovitz-Biro, Ronit"},{"last_name":"Wolf","first_name":"Sharon G.","full_name":"Wolf, Sharon G."},{"first_name":"Sanjib","full_name":"Das, Sanjib","last_name":"Das"},{"last_name":"Klajn","first_name":"Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","full_name":"Klajn, Rafal"}],"date_updated":"2023-08-08T07:55:10Z","oa_version":"None","type":"journal_article","publisher":"Wiley","language":[{"iso":"eng"}],"page":"654-660","article_type":"original","intvolume":"         8","abstract":[{"text":"Well-defined metallic nanobowls can be prepared by extending the concept of a protecting group to colloidal synthesis. Magnetic nanoparticles are employed as “protecting groups” during the galvanic replacement of silver with gold. The replacement reaction is accompanied by spontantous dissociation of the protecting groups, leaving behind metallic nanobowls.","lang":"eng"}],"doi":"10.1002/smll.201101882","issue":"5","publication_identifier":{"issn":["1613-6810"],"eissn":["1613-6829"]},"status":"public","pmid":1,"day":"12","extern":"1","publication_status":"published","month":"03"},{"month":"11","publication_status":"published","acknowledgement":"This  research  was  supported  by  the  Canadian  NSERC grant   RGPIN   341819-07,    the   ERC   Advanced   Grant QUAREM, and the Austrian Science Fund NFN RiSE.","ec_funded":1,"day":"01","status":"public","doi":"10.1145/2393596.2393664","publist_id":"5826","abstract":[{"text":"Software model checking, as an undecidable problem, has three possible outcomes: (1) the program satisfies the specification, (2) the program does not satisfy the specification, and (3) the model checker fails. The third outcome usually manifests itself in a space-out, time-out, or one component of the verification tool giving up; in all of these failing cases, significant computation is performed by the verification tool before the failure, but no result is reported. We propose to reformulate the model-checking problem as follows, in order to have the verification tool report a summary of the performed work even in case of failure: given a program and a specification, the model checker returns a condition Ψ - usually a state predicate - such that the program satisfies the specification under the condition Ψ - that is, as long as the program does not leave the states in which Ψ is satisfied. In our experiments, we investigated as one major application of conditional model checking the sequential combination of model checkers with information passing. We give the condition that one model checker produces, as input to a second conditional model checker, such that the verification problem for the second is restricted to the part of the state space that is not covered by the condition, i.e., the second model checker works on the problems that the first model checker could not solve. Our experiments demonstrate that repeated application of conditional model checkers, passing information from one model checker to the next, can significantly improve the verification results and performance, i.e., we can now verify programs that we could not verify before.","lang":"eng"}],"article_number":"57","language":[{"iso":"eng"}],"publisher":"ACM","type":"conference","department":[{"_id":"ToHe"}],"oa_version":"Preprint","date_updated":"2021-01-12T06:50:18Z","author":[{"last_name":"Beyer","first_name":"Dirk","full_name":"Beyer, Dirk"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"last_name":"Keremoglu","full_name":"Keremoglu, Mehmet","first_name":"Mehmet"},{"last_name":"Wendler","first_name":"Philipp","full_name":"Wendler, Philipp"}],"oa":1,"citation":{"ista":"Beyer D, Henzinger TA, Keremoglu M, Wendler P. 2012. Conditional model checking: A technique to pass information between verifiers. Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering. FSE: Foundations of Software Engineering, 57.","apa":"Beyer, D., Henzinger, T. A., Keremoglu, M., &#38; Wendler, P. (2012). Conditional model checking: A technique to pass information between verifiers. In <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>. Cary, NC, USA: ACM. <a href=\"https://doi.org/10.1145/2393596.2393664\">https://doi.org/10.1145/2393596.2393664</a>","mla":"Beyer, Dirk, et al. “Conditional Model Checking: A Technique to Pass Information between Verifiers.” <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>, 57, ACM, 2012, doi:<a href=\"https://doi.org/10.1145/2393596.2393664\">10.1145/2393596.2393664</a>.","ieee":"D. Beyer, T. A. Henzinger, M. Keremoglu, and P. Wendler, “Conditional model checking: A technique to pass information between verifiers,” in <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>, Cary, NC, USA, 2012.","ama":"Beyer D, Henzinger TA, Keremoglu M, Wendler P. Conditional model checking: A technique to pass information between verifiers. In: <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>. ACM; 2012. doi:<a href=\"https://doi.org/10.1145/2393596.2393664\">10.1145/2393596.2393664</a>","short":"D. Beyer, T.A. Henzinger, M. Keremoglu, P. Wendler, in:, Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering, ACM, 2012.","chicago":"Beyer, Dirk, Thomas A Henzinger, Mehmet Keremoglu, and Philipp Wendler. “Conditional Model Checking: A Technique to Pass Information between Verifiers.” In <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>. ACM, 2012. <a href=\"https://doi.org/10.1145/2393596.2393664\">https://doi.org/10.1145/2393596.2393664</a>."},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"1384","scopus_import":1,"date_created":"2018-12-11T11:51:42Z","year":"2012","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1109.6926"}],"publication":"Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering","conference":{"location":"Cary, NC, USA","start_date":"2012-11-11","end_date":"2012-11-16","name":"FSE: Foundations of Software Engineering"},"title":"Conditional model checking: A technique to pass information between verifiers","date_published":"2012-11-01T00:00:00Z","project":[{"call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"quality_controlled":"1"}]