[{"scopus_import":"1","article_processing_charge":"No","day":"01","article_type":"original","citation":{"apa":"Pokharel, M., Zhao, H., Modic, K. A., Ren, Z., & Opeil, C. (2014). Magnetic properties of hot-pressed FeSb2. IEEE Transactions on Magnetics. Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/TMAG.2013.2292607","ieee":"M. Pokharel, H. Zhao, K. A. Modic, Z. Ren, and C. Opeil, “Magnetic properties of hot-pressed FeSb2,” IEEE Transactions on Magnetics, vol. 50, no. 5. Institute of Electrical and Electronics Engineers, 2014.","ista":"Pokharel M, Zhao H, Modic KA, Ren Z, Opeil C. 2014. Magnetic properties of hot-pressed FeSb2. IEEE Transactions on Magnetics. 50(5), 6675864.","ama":"Pokharel M, Zhao H, Modic KA, Ren Z, Opeil C. Magnetic properties of hot-pressed FeSb2. IEEE Transactions on Magnetics. 2014;50(5). doi:10.1109/TMAG.2013.2292607","chicago":"Pokharel, Mani, Huaizhou Zhao, Kimberly A Modic, Zhifeng Ren, and Cyril Opeil. “Magnetic Properties of Hot-Pressed FeSb2.” IEEE Transactions on Magnetics. Institute of Electrical and Electronics Engineers, 2014. https://doi.org/10.1109/TMAG.2013.2292607.","short":"M. Pokharel, H. Zhao, K.A. Modic, Z. Ren, C. Opeil, IEEE Transactions on Magnetics 50 (2014).","mla":"Pokharel, Mani, et al. “Magnetic Properties of Hot-Pressed FeSb2.” IEEE Transactions on Magnetics, vol. 50, no. 5, 6675864, Institute of Electrical and Electronics Engineers, 2014, doi:10.1109/TMAG.2013.2292607."},"publication":"IEEE Transactions on Magnetics","date_published":"2014-05-01T00:00:00Z","type":"journal_article","issue":"5","abstract":[{"text":"We report on the magnetic properties of a hot-pressed FeSb 2 sample. We find a significant increase in the magnetic susceptibility in our sample when compared with the values previously reported for the polycrystalline sample. The pronounced Curie tail at low temperature corresponds to 0.2% of Fe 2+ impurities per mole. In the intrinsic conductivity region, the susceptibility due to free carriers shows thermally activated behavior and is consistent with the data reported for single crystal FeSb 2 . Based on our data and analysis, while the enhanced magnetic susceptibility in our sample comes mainly from a small amount of unreacted Fe, the contribution from the enhanced carrier density due to lattice and strain defects arising from the ball milling process is also significant. Existence of an unreacted Fe phase is evidenced by small coercivity values of ~100 observed at 50 and 300 K.","lang":"eng"}],"intvolume":" 50","title":"Magnetic properties of hot-pressed FeSb2","status":"public","_id":"11750","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","publication_identifier":{"issn":["0018-9464"],"eissn":["1941-0069"]},"month":"05","quality_controlled":"1","language":[{"iso":"eng"}],"doi":"10.1109/TMAG.2013.2292607","article_number":"6675864","extern":"1","publisher":"Institute of Electrical and Electronics Engineers","publication_status":"published","year":"2014","volume":50,"date_created":"2022-08-08T08:26:02Z","date_updated":"2022-08-11T09:51:22Z","author":[{"full_name":"Pokharel, Mani","first_name":"Mani","last_name":"Pokharel"},{"full_name":"Zhao, Huaizhou","first_name":"Huaizhou","last_name":"Zhao"},{"full_name":"Modic, Kimberly A","first_name":"Kimberly A","last_name":"Modic","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","orcid":"0000-0001-9760-3147"},{"last_name":"Ren","first_name":"Zhifeng","full_name":"Ren, Zhifeng"},{"full_name":"Opeil, Cyril","last_name":"Opeil","first_name":"Cyril"}]},{"quality_controlled":"1","external_id":{"arxiv":["1409.2139"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1409.2139"}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-44777-2_22","conference":{"location":"Wroclaw, Poland","start_date":"2014-09-08","end_date":"2014-09-10","name":"ESA: Annual European Symposium on Algorithms"},"publication_identifier":{"issn":["0302-9743"],"isbn":["978-366244776-5"]},"month":"09","publisher":"Springer Nature","publication_status":"published","year":"2014","volume":8737,"date_updated":"2023-02-13T11:16:24Z","date_created":"2022-08-11T10:41:47Z","author":[{"full_name":"Charikar, Moses","last_name":"Charikar","first_name":"Moses"},{"full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Nguyễn, Huy L.","last_name":"Nguyễn","first_name":"Huy L."}],"extern":"1","page":"260 - 271","citation":{"mla":"Charikar, Moses, et al. “Online Bipartite Matching with Decomposable Weights.” 22nd Annual European Symposium on Algorithms, vol. 8737, Springer Nature, 2014, pp. 260–71, doi:10.1007/978-3-662-44777-2_22.","short":"M. Charikar, M.H. Henzinger, H.L. Nguyễn, in:, 22nd Annual European Symposium on Algorithms, Springer Nature, 2014, pp. 260–271.","chicago":"Charikar, Moses, Monika H Henzinger, and Huy L. Nguyễn. “Online Bipartite Matching with Decomposable Weights.” In 22nd Annual European Symposium on Algorithms, 8737:260–71. Springer Nature, 2014. https://doi.org/10.1007/978-3-662-44777-2_22.","ama":"Charikar M, Henzinger MH, Nguyễn HL. Online bipartite matching with decomposable weights. In: 22nd Annual European Symposium on Algorithms. Vol 8737. Springer Nature; 2014:260-271. doi:10.1007/978-3-662-44777-2_22","ista":"Charikar M, Henzinger MH, Nguyễn HL. 2014. Online bipartite matching with decomposable weights. 22nd Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LNCS, vol. 8737, 260–271.","apa":"Charikar, M., Henzinger, M. H., & Nguyễn, H. L. (2014). Online bipartite matching with decomposable weights. In 22nd Annual European Symposium on Algorithms (Vol. 8737, pp. 260–271). Wroclaw, Poland: Springer Nature. https://doi.org/10.1007/978-3-662-44777-2_22","ieee":"M. Charikar, M. H. Henzinger, and H. L. Nguyễn, “Online bipartite matching with decomposable weights,” in 22nd Annual European Symposium on Algorithms, Wroclaw, Poland, 2014, vol. 8737, pp. 260–271."},"publication":"22nd Annual European Symposium on Algorithms","date_published":"2014-09-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01","intvolume":" 8737","title":"Online bipartite matching with decomposable weights","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11789","oa_version":"Preprint","alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"We study a weighted online bipartite matching problem: G(V 1, V 2, E) is a weighted bipartite graph where V 1 is known beforehand and the vertices of V 2 arrive online. The goal is to match vertices of V 2 as they arrive to vertices in V 1, so as to maximize the sum of weights of edges in the matching. If assignments to V 1 cannot be changed, no bounded competitive ratio is achievable. We study the weighted online matching problem with free disposal, where vertices in V 1 can be assigned multiple times, but only get credit for the maximum weight edge assigned to them over the course of the algorithm. For this problem, the greedy algorithm is 0.5-competitive and determining whether a better competitive ratio is achievable is a well known open problem.\r\n\r\nWe identify an interesting special case where the edge weights are decomposable as the product of two factors, one corresponding to each end point of the edge. This is analogous to the well studied related machines model in the scheduling literature, although the objective functions are different. For this case of decomposable edge weights, we design a 0.5664 competitive randomized algorithm in complete bipartite graphs. We show that such instances with decomposable weights are non-trivial by establishing upper bounds of 0.618 for deterministic and 0.8 for randomized algorithms.\r\n\r\nA tight competitive ratio of 1 − 1/e ≈ 0.632 was known previously for both the 0-1 case as well as the case where edge weights depend on the offline vertices only, but for these cases, reassignments cannot change the quality of the solution. Beating 0.5 for weighted matching where reassignments are necessary has been a significant challenge. We thus give the first online algorithm with competitive ratio strictly better than 0.5 for a non-trivial case of weighted matching with free disposal."}]},{"article_processing_charge":"No","publication_identifier":{"issn":["0302-9743"]},"month":"12","day":"01","scopus_import":"1","language":[{"iso":"eng"}],"date_published":"2014-12-01T00:00:00Z","doi":"10.1007/978-3-319-13129-0_4","conference":{"name":"WINE: International Conference on Web and Internet Economics","location":"Beijing, China","start_date":"2014-12-14","end_date":"2014-12-17"},"page":"44 - 57","quality_controlled":"1","citation":{"mla":"Cigler, Luděk, et al. “Limiting Price Discrimination When Selling Products with Positive Network Externalities.” 10th International Conference of Web and Internet Economics, vol. 8877, Springer Nature, 2014, pp. 44–57, doi:10.1007/978-3-319-13129-0_4.","short":"L. Cigler, W. Dvořák, M.H. Henzinger, M. Starnberger, in:, 10th International Conference of Web and Internet Economics, Springer Nature, 2014, pp. 44–57.","chicago":"Cigler, Luděk, Wolfgang Dvořák, Monika H Henzinger, and Martin Starnberger. “Limiting Price Discrimination When Selling Products with Positive Network Externalities.” In 10th International Conference of Web and Internet Economics, 8877:44–57. Springer Nature, 2014. https://doi.org/10.1007/978-3-319-13129-0_4.","ama":"Cigler L, Dvořák W, Henzinger MH, Starnberger M. Limiting price discrimination when selling products with positive network externalities. In: 10th International Conference of Web and Internet Economics. Vol 8877. Springer Nature; 2014:44-57. doi:10.1007/978-3-319-13129-0_4","ista":"Cigler L, Dvořák W, Henzinger MH, Starnberger M. 2014. Limiting price discrimination when selling products with positive network externalities. 10th International Conference of Web and Internet Economics. WINE: International Conference on Web and Internet Economics, LNCS, vol. 8877, 44–57.","apa":"Cigler, L., Dvořák, W., Henzinger, M. H., & Starnberger, M. (2014). Limiting price discrimination when selling products with positive network externalities. In 10th International Conference of Web and Internet Economics (Vol. 8877, pp. 44–57). Beijing, China: Springer Nature. https://doi.org/10.1007/978-3-319-13129-0_4","ieee":"L. Cigler, W. Dvořák, M. H. Henzinger, and M. Starnberger, “Limiting price discrimination when selling products with positive network externalities,” in 10th International Conference of Web and Internet Economics, Beijing, China, 2014, vol. 8877, pp. 44–57."},"publication":"10th International Conference of Web and Internet Economics","extern":"1","abstract":[{"lang":"eng","text":"Assume a seller wants to sell a digital product in a social network where a buyer’s valuation of the item has positive network externalities from her neighbors that already have the item. The goal of the seller is to maximize his revenue. Previous work on this problem [7] studies the case where clients are offered the item in sequence and have to pay personalized prices. This is highly infeasible in large scale networks such as the Facebook graph: (1) Offering items to the clients one after the other consumes a large amount of time, and (2) price-discrimination of clients could appear unfair to them and result in negative client reaction or could conflict with legal requirements.\r\n\r\nWe study a setting dealing with these issues. Specifically, the item is offered in parallel to multiple clients at the same time and at the same price. This is called a round. We show that with O(logn) rounds, where n is the number of clients, a constant factor of the revenue with price discrimination can be achieved and that this is not possible with o(logn) rounds. Moreover we show that it is APX-hard to maximize the revenue and we give constant factor approximation algorithms for various further settings of limited price discrimination."}],"alternative_title":["LNCS"],"type":"conference","oa_version":"None","volume":8877,"date_created":"2022-08-11T10:58:44Z","date_updated":"2023-02-13T11:18:30Z","author":[{"full_name":"Cigler, Luděk","first_name":"Luděk","last_name":"Cigler"},{"first_name":"Wolfgang","last_name":"Dvořák","full_name":"Dvořák, Wolfgang"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger"},{"last_name":"Starnberger","first_name":"Martin","full_name":"Starnberger, Martin"}],"intvolume":" 8877","publisher":"Springer Nature","status":"public","publication_status":"published","title":"Limiting price discrimination when selling products with positive network externalities","_id":"11790","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2014"},{"doi":"10.1002/2014GL059229","date_published":"2014-05-16T00:00:00Z","language":[{"iso":"eng"}],"publication":"Geophysical Research Letters","citation":{"apa":"Altshuler, E., Torres, H., González_Pita, A., Sánchez, C. G., Pérez Penichet, C., Waitukaitis, S. R., & Hidalgo, R. (2014). Settling into dry granular media in different gravities. Geophysical Research Letters. Wiley-Blackwell. https://doi.org/10.1002/2014GL059229","ieee":"E. Altshuler et al., “Settling into dry granular media in different gravities,” Geophysical Research Letters, vol. 41, no. 9. Wiley-Blackwell, pp. 3032–3037, 2014.","ista":"Altshuler E, Torres H, González_Pita A, Sánchez CG, Pérez Penichet C, Waitukaitis SR, Hidalgo R. 2014. Settling into dry granular media in different gravities. Geophysical Research Letters. 41(9), 3032–3037.","ama":"Altshuler E, Torres H, González_Pita A, et al. Settling into dry granular media in different gravities. Geophysical Research Letters. 2014;41(9):3032-3037. doi:10.1002/2014GL059229","chicago":"Altshuler, Ernesto, H Torres, A González_Pita, Colina G Sánchez, Carlos Pérez Penichet, Scott R Waitukaitis, and Rauól Hidalgo. “Settling into Dry Granular Media in Different Gravities.” Geophysical Research Letters. Wiley-Blackwell, 2014. https://doi.org/10.1002/2014GL059229.","short":"E. Altshuler, H. Torres, A. González_Pita, C.G. Sánchez, C. Pérez Penichet, S.R. Waitukaitis, R. Hidalgo, Geophysical Research Letters 41 (2014) 3032–3037.","mla":"Altshuler, Ernesto, et al. “Settling into Dry Granular Media in Different Gravities.” Geophysical Research Letters, vol. 41, no. 9, Wiley-Blackwell, 2014, pp. 3032–37, doi:10.1002/2014GL059229."},"quality_controlled":"1","page":"3032 - 3037","month":"05","day":"16","author":[{"first_name":"Ernesto","last_name":"Altshuler","full_name":"Altshuler, Ernesto"},{"first_name":"H","last_name":"Torres","full_name":"Torres, H"},{"full_name":"González_Pita, A","first_name":"A","last_name":"González_Pita"},{"last_name":"Sánchez","first_name":"Colina G","full_name":"Sánchez, Colina G"},{"last_name":"Pérez Penichet","first_name":"Carlos","full_name":"Pérez Penichet, Carlos"},{"last_name":"Waitukaitis","first_name":"Scott R","orcid":"0000-0002-2299-3176","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","full_name":"Waitukaitis, Scott R"},{"last_name":"Hidalgo","first_name":"Rauól","full_name":"Hidalgo, Rauól"}],"date_updated":"2021-01-12T06:48:53Z","date_created":"2018-12-11T11:44:43Z","volume":41,"oa_version":"None","acknowledgement":"The Spanish MINECO project FIS2011-26675, the PIUNA program (U. Navarra), and the Project 29942WL (Fonds de Solidarité Prioritaire France-Cuba) have partially supported this research. ","_id":"118","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","year":"2014","title":"Settling into dry granular media in different gravities","publication_status":"published","status":"public","intvolume":" 41","publisher":"Wiley-Blackwell","abstract":[{"lang":"eng","text":"While the penetration of objects into granular media is well-studied, there is little understanding of how objects settle in gravities, geff, different from that of Earth - a scenario potentially relevant to the geomorphology of planets and asteroids and also to their exploration using man-made devices. By conducting experiments in an accelerating frame, we explore geff ranging from 0.4 g to 1.2 g. Surprisingly, we find that the rest depth is independent of geff and also that the time required for the object to come to rest scales like geff-1/2. With discrete element modeling simulations, we reproduce the experimental results and extend the range of geff to objects as small as asteroids and as large as Jupiter. Our results shed light on the initial stage of sedimentation into dry granular media across a range of celestial bodies and also have implications for the design of man-made, extraterrestrial vehicles and structures. Key Points The settling depth in granular media is independent of gravity The settling time scales like g-1/2 Layering driven by granular sedimentation should be similar."}],"publist_id":"7936","issue":"9","extern":"1","type":"journal_article"},{"doi":"10.1109/focs.2014.24","conference":{"name":"FOCS: Annual Symposium on Foundations of Computer Science","location":"Philadelphia, PA, United States","start_date":"2014-10-18","end_date":"2014-10-21"},"language":[{"iso":"eng"}],"external_id":{"arxiv":["1402.0054"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1402.0054","open_access":"1"}],"quality_controlled":"1","publication_identifier":{"issn":["0272-5428"],"eisbn":["978-1-4799-6517-5"]},"month":"10","related_material":{"record":[{"relation":"later_version","status":"public","id":"11768"}]},"author":[{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"last_name":"Krinninger","first_name":"Sebastian","full_name":"Krinninger, Sebastian"},{"first_name":"Danupon","last_name":"Nanongkai","full_name":"Nanongkai, Danupon"}],"date_created":"2022-08-16T08:14:33Z","date_updated":"2023-02-21T16:27:34Z","year":"2014","publisher":"Institute of Electrical and Electronics Engineers","publication_status":"published","extern":"1","date_published":"2014-10-01T00:00:00Z","citation":{"chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” In 55th Annual Symposium on Foundations of Computer Science, 146–55. Institute of Electrical and Electronics Engineers, 2014. https://doi.org/10.1109/focs.2014.24.","mla":"Henzinger, Monika H., et al. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.” 55th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2014, pp. 146–55, doi:10.1109/focs.2014.24.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 55th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2014, pp. 146–155.","ista":"Henzinger MH, Krinninger S, Nanongkai D. 2014. Decremental single-source shortest paths on undirected graphs in near-linear total update time. 55th Annual Symposium on Foundations of Computer Science. FOCS: Annual Symposium on Foundations of Computer Science, 146–155.","apa":"Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014). Decremental single-source shortest paths on undirected graphs in near-linear total update time. In 55th Annual Symposium on Foundations of Computer Science (pp. 146–155). Philadelphia, PA, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/focs.2014.24","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source shortest paths on undirected graphs in near-linear total update time,” in 55th Annual Symposium on Foundations of Computer Science, Philadelphia, PA, United States, 2014, pp. 146–155.","ama":"Henzinger MH, Krinninger S, Nanongkai D. Decremental single-source shortest paths on undirected graphs in near-linear total update time. In: 55th Annual Symposium on Foundations of Computer Science. Institute of Electrical and Electronics Engineers; 2014:146-155. doi:10.1109/focs.2014.24"},"publication":"55th Annual Symposium on Foundations of Computer Science","page":"146-155","article_processing_charge":"No","day":"01","scopus_import":"1","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11855","title":"Decremental single-source shortest paths on undirected graphs in near-linear total update time","status":"public","abstract":[{"lang":"eng","text":"The decremental single-source shortest paths (SSSP) problem concerns maintaining the distances between a given source node s to every node in an n-node m-edge graph G undergoing edge deletions. While its static counterpart can be easily solved in near-linear time, this decremental problem is much more challenging even in the undirected unweighted case. In this case, the classic O(mn) total update time of Even and Shiloach (JACM 1981) has been the fastest known algorithm for three decades. With the loss of a (1 + ε)-approximation factor, the running time was recently improved to O(n 2+o(1) ) by Bernstein and Roditty (SODA 2011), and more recently to O(n 1.8+o(1) + m 1+o(1) ) by Henzinger, Krinninger, and Nanongkai (SODA 2014). In this paper, we finally bring the running time of this case down to near-linear: We give a (1 + ε)-approximation algorithm with O(m 1+o(1) ) total update time, thus obtaining near-linear time. Moreover, we obtain O(m 1+o(1) log W) time for the weighted case, where the edge weights are integers from 1 to W. The only prior work on weighted graphs in o(mn log W) time is the O(mn 0.986 log W)-time algorithm by Henzinger, Krinninger, and Nanongkai (STOC 2014) which works for the general weighted directed case. In contrast to the previous results which rely on maintaining a sparse emulator, our algorithm relies on maintaining a so-called sparse (d, ε)-hop set introduced by Cohen (JACM 2000) in the PRAM literature. A (d, ε)-hop set of a graph G = (V, E) is a set E' of weighted edges such that the distance between any pair of nodes in G can be (1 + ε)-approximated by their d-hop distance (given by a path containing at most d edges) on G'=(V, E∪E'). Our algorithm can maintain an (n o(1) , ε)-hop set of near-linear size in near-linear time under edge deletions. It is the first of its kind to the best of our knowledge. To maintain the distances on this hop set, we develop a monotone bounded-hop Even-Shiloach tree. It results from extending and combining the monotone Even-Shiloach tree of Henzinger, Krinninger, and Nanongkai (FOCS 2013) with the bounded-hop SSSP technique of Bernstein (STOC 2013). These two new tools might be of independent interest."}],"type":"conference"},{"month":"05","day":"01","publication_identifier":{"issn":["0737-8017"],"isbn":["978-145032710-7"]},"article_processing_charge":"No","scopus_import":"1","conference":{"end_date":"2014-06-03","start_date":"2014-05-31","location":"New York, NY, United States","name":"STOC: Symposium on Theory of Computing"},"doi":"10.1145/2591796.2591869","date_published":"2014-05-01T00:00:00Z","language":[{"iso":"eng"}],"publication":"46th Annual ACM Symposium on Theory of Computing","citation":{"ista":"Henzinger MH, Krinninger S, Nanongkai D. 2014. Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. 46th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 674–683.","apa":"Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014). Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. In 46th Annual ACM Symposium on Theory of Computing. New York, NY, United States: Association for Computing Machinery. https://doi.org/10.1145/2591796.2591869","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs,” in 46th Annual ACM Symposium on Theory of Computing, New York, NY, United States, 2014.","ama":"Henzinger MH, Krinninger S, Nanongkai D. Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. In: 46th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2014. doi:10.1145/2591796.2591869","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs.” In 46th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, 2014. https://doi.org/10.1145/2591796.2591869.","mla":"Henzinger, Monika H., et al. “Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs.” 46th Annual ACM Symposium on Theory of Computing, 674–683, Association for Computing Machinery, 2014, doi:10.1145/2591796.2591869.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 46th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2014."},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.07959"}],"external_id":{"arxiv":["1504.07959"]},"quality_controlled":"1","abstract":[{"text":"We consider dynamic algorithms for maintaining Single-Source Reachability (SSR) and approximate Single-Source Shortest Paths (SSSP) on n-node m-edge directed graphs under edge deletions (decremental algorithms). The previous fastest algorithm for SSR and SSSP goes back three decades to Even and Shiloach (JACM 1981); it has O(1) query time and O(mn) total update time (i.e., linear amortized update time if all edges are deleted). This algorithm serves as a building block for several other dynamic algorithms. The question whether its total update time can be improved is a major, long standing, open problem.\r\n\r\nIn this paper, we answer this question affirmatively. We obtain a randomized algorithm which, in a simplified form, achieves an Õ(mn0.984) expected total update time for SSR and (1 + ε)-approximate SSSP, where Õ(·) hides poly log n. We also extend our algorithm to achieve roughly the same running time for Strongly Connected Components (SCC), improving the algorithm of Roditty and Zwick (FOCS 2002), and an algorithm that improves the Õ (mn log W)-time algorithm of Bernstein (STOC 2013) for approximating SSSP on weighted directed graphs, where the edge weights are integers from 1 to W. All our algorithms have constant query time in the worst case.","lang":"eng"}],"extern":"1","article_number":"674 - 683","type":"conference","author":[{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"last_name":"Krinninger","first_name":"Sebastian","full_name":"Krinninger, Sebastian"},{"last_name":"Nanongkai","first_name":"Danupon","full_name":"Nanongkai, Danupon"}],"date_created":"2022-08-16T09:41:57Z","date_updated":"2023-02-17T11:18:52Z","oa_version":"Preprint","year":"2014","_id":"11870","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication_status":"published","title":"Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs","publisher":"Association for Computing Machinery"},{"article_processing_charge":"No","publication_identifier":{"isbn":["978-1-61197-338-9"],"eisbn":["978-1-61197-340-2"]},"day":"01","month":"01","scopus_import":"1","date_published":"2014-01-01T00:00:00Z","doi":"10.1137/1.9781611973402.79","conference":{"name":"SODA: Symposium on Discrete Algorithms","end_date":"2014-01-07","location":"Portland, OR, United States","start_date":"2014-01-05"},"language":[{"iso":"eng"}],"citation":{"ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “A subquadratic-time algorithm for decremental single-source shortest paths,” in 25th Annual ACM-SIAM Symposium on Discrete Algorithms, Portland, OR, United States, 2014, pp. 1053–1072.","apa":"Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2014). A subquadratic-time algorithm for decremental single-source shortest paths. In 25th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1053–1072). Portland, OR, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973402.79","ista":"Henzinger MH, Krinninger S, Nanongkai D. 2014. A subquadratic-time algorithm for decremental single-source shortest paths. 25th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1053–1072.","ama":"Henzinger MH, Krinninger S, Nanongkai D. A subquadratic-time algorithm for decremental single-source shortest paths. In: 25th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2014:1053-1072. doi:10.1137/1.9781611973402.79","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths.” In 25th Annual ACM-SIAM Symposium on Discrete Algorithms, 1053–72. Society for Industrial and Applied Mathematics, 2014. https://doi.org/10.1137/1.9781611973402.79.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 25th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2014, pp. 1053–1072.","mla":"Henzinger, Monika H., et al. “A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths.” 25th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2014, pp. 1053–72, doi:10.1137/1.9781611973402.79."},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1137/1.9781611973402.79"}],"publication":"25th Annual ACM-SIAM Symposium on Discrete Algorithms","page":"1053-1072","quality_controlled":"1","abstract":[{"lang":"eng","text":"We study dynamic (1 + ∊)-approximation algorithms for the single-source shortest paths problem in an unweighted undirected n-node m-edge graph under edge deletions. The fastest algorithm for this problem is an algorithm with O(n2+o(1)) total update time and constant query time by Bernstein and Roditty (SODA 2011). In this paper, we improve the total update time to O(n1.8+o(1) + m1+o(1)) while keeping the query time constant. This running time is essentially tight when m = Ω(n1.8) since we need Ω(m) time even in the static setting. For smaller values of m, the running time of our algorithm is subquadratic, and is the first that breaks through the quadratic time barrier.\r\n\r\nIn obtaining this result, we develop a fast algorithm for what we call center cover data structure. We also make non-trivial extensions to our previous techniques called lazy-update and monotone Even-Shiloach trees (ICALP 2013 and FOCS 2013). As by-products of our new techniques, we obtain two new results for the decremental all-pairs shortest-paths problem. Our first result is the first approximation algorithm whose total update time is faster than Õ(mn) for all values of m. Our second result is a new trade-off between the total update time and the additive approximation guarantee."}],"extern":"1","type":"conference","author":[{"first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"first_name":"Sebastian","last_name":"Krinninger","full_name":"Krinninger, Sebastian"},{"full_name":"Nanongkai, Danupon","first_name":"Danupon","last_name":"Nanongkai"}],"oa_version":"Published Version","date_created":"2022-08-16T12:58:31Z","date_updated":"2023-02-17T11:58:42Z","_id":"11876","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2014","publisher":"Society for Industrial and Applied Mathematics","status":"public","publication_status":"published","title":"A subquadratic-time algorithm for decremental single-source shortest paths"},{"publication_identifier":{"eisbn":["978-1-61197-373-0"],"isbn":["978-1-61197-374-7"]},"month":"01","doi":"10.1137/1.9781611973730.54","conference":{"name":"SODA: Symposium on Discrete Algorithms","end_date":"2015-01-06","start_date":"2015-01-04","location":"San Diego, CA, United States"},"language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1412.1318"}],"external_id":{"arxiv":["1412.1318"]},"quality_controlled":"1","extern":"1","related_material":{"record":[{"relation":"later_version","status":"public","id":"11890"}]},"author":[{"full_name":"Bhattacharya, Sayan","last_name":"Bhattacharya","first_name":"Sayan"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger"},{"full_name":"Italiano, Giuseppe F.","first_name":"Giuseppe F.","last_name":"Italiano"}],"date_created":"2022-08-16T12:36:42Z","date_updated":"2023-02-21T16:32:06Z","year":"2014","publisher":"Society for Industrial and Applied Mathematics","publication_status":"published","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2014-01-01T00:00:00Z","citation":{"chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” In 26th Annual ACM-SIAM Symposium on Discrete Algorithms, 785–804. Society for Industrial and Applied Mathematics, 2014. https://doi.org/10.1137/1.9781611973730.54.","mla":"Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” 26th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2014, pp. 785–804, doi:10.1137/1.9781611973730.54.","short":"S. Bhattacharya, M.H. Henzinger, G.F. Italiano, in:, 26th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2014, pp. 785–804.","ista":"Bhattacharya S, Henzinger MH, Italiano GF. 2014. Deterministic fully dynamic data structures for vertex cover and matching. 26th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 785–804.","ieee":"S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully dynamic data structures for vertex cover and matching,” in 26th Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States, 2014, pp. 785–804.","apa":"Bhattacharya, S., Henzinger, M. H., & Italiano, G. F. (2014). Deterministic fully dynamic data structures for vertex cover and matching. In 26th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 785–804). San Diego, CA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973730.54","ama":"Bhattacharya S, Henzinger MH, Italiano GF. Deterministic fully dynamic data structures for vertex cover and matching. In: 26th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2014:785-804. doi:10.1137/1.9781611973730.54"},"publication":"26th Annual ACM-SIAM Symposium on Discrete Algorithms","page":"785-804","abstract":[{"text":"We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph in time per update. In particular, for minimum vertex cover we provide deterministic data structures for maintaining a (2 + ε) approximation in O(log n/ε2) amortized time per update. For maximum matching, we show how to maintain a (3 + e) approximation in O(m1/3/ε2) amortized time per update, and a (4 + ε) approximation in O(m1/3/ε2) worst-case time per update. Our data structure for fully dynamic minimum vertex cover is essentially near-optimal and settles an open problem by Onak and Rubinfeld [13].","lang":"eng"}],"type":"conference","oa_version":"Preprint","_id":"11875","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Deterministic fully dynamic data structures for vertex cover and matching"},{"day":"30","publication":"APS Physics, Physical Review Letters","citation":{"ama":"Waitukaitis SR, Lee V, Pierson J, Forman S, Jaeger H. Size-dependent same-material tribocharging in insulating grains. APS Physics, Physical Review Letters. 2014;112(21). doi:10.1103/PhysRevLett.112.218001","ieee":"S. R. Waitukaitis, V. Lee, J. Pierson, S. Forman, and H. Jaeger, “Size-dependent same-material tribocharging in insulating grains,” APS Physics, Physical Review Letters, vol. 112, no. 21. American Physical Society, 2014.","apa":"Waitukaitis, S. R., Lee, V., Pierson, J., Forman, S., & Jaeger, H. (2014). Size-dependent same-material tribocharging in insulating grains. APS Physics, Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.112.218001","ista":"Waitukaitis SR, Lee V, Pierson J, Forman S, Jaeger H. 2014. Size-dependent same-material tribocharging in insulating grains. APS Physics, Physical Review Letters. 112(21), 218001.","short":"S.R. Waitukaitis, V. Lee, J. Pierson, S. Forman, H. Jaeger, APS Physics, Physical Review Letters 112 (2014).","mla":"Waitukaitis, Scott R., et al. “Size-Dependent Same-Material Tribocharging in Insulating Grains.” APS Physics, Physical Review Letters, vol. 112, no. 21, 218001, American Physical Society, 2014, doi:10.1103/PhysRevLett.112.218001.","chicago":"Waitukaitis, Scott R, Victor Lee, James Pierson, Steven Forman, and Heinrich Jaeger. “Size-Dependent Same-Material Tribocharging in Insulating Grains.” APS Physics, Physical Review Letters. American Physical Society, 2014. https://doi.org/10.1103/PhysRevLett.112.218001."},"date_published":"2014-05-30T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"Observations of flowing granular matter have suggested that same-material tribocharging depends on particle size, typically rendering large grains positive and small ones negative. Models assuming the transfer of trapped electrons can account for this trend, but have not been validated. Tracking individual grains in an electric field, we show quantitatively that charge is transferred based on size between materially identical grains. However, the surface density of trapped electrons, measured independently by thermoluminescence techniques, is orders of magnitude too small to account for the scale of charge transferred. This reveals that trapped electrons are not a necessary ingredient for same-material tribocharging."}],"issue":"21","_id":"119","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Size-dependent same-material tribocharging in insulating grains","status":"public","intvolume":" 112","oa_version":"Submitted Version","month":"05","oa":1,"external_id":{"arxiv":["1309.2578"]},"main_file_link":[{"url":"https://arxiv.org/abs/1309.2578","open_access":"1"}],"quality_controlled":"1","doi":"10.1103/PhysRevLett.112.218001","language":[{"iso":"eng"}],"article_number":"218001","publist_id":"7935","extern":"1","acknowledgement":"This work was supported by the NSF through DMR-1309611. Access to the shared experimental facilities provided by the NSF-supported Chicago MRSEC (DMR-0820054) is gratefully acknowledged. S. L. F. and J. L. P. acknowledge funding from UIC NSF Grants No. 0850830 and No. 0602308. S. R. W. acknowledges support from a University of Chicago Millikan Fellowship and from Mrs. Joan Winstein through the Winstein Prize for Instrumentation.","year":"2014","publication_status":"published","publisher":"American Physical Society","author":[{"full_name":"Waitukaitis, Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2299-3176","first_name":"Scott R","last_name":"Waitukaitis"},{"full_name":"Lee, Victor","last_name":"Lee","first_name":"Victor"},{"last_name":"Pierson","first_name":"James","full_name":"Pierson, James"},{"full_name":"Forman, Steven","first_name":"Steven","last_name":"Forman"},{"full_name":"Jaeger, Heinrich","last_name":"Jaeger","first_name":"Heinrich"}],"date_created":"2018-12-11T11:44:44Z","date_updated":"2021-01-12T06:48:58Z","volume":112},{"publication":"Developmental Cell","citation":{"ama":"Hofbauer HF, Schopf FH, Schleifer H, et al. Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids. Developmental Cell. 2014;29(6):P729-739. doi:10.1016/j.devcel.2014.04.025","ista":"Hofbauer HF, Schopf FH, Schleifer H, Knittelfelder OL, Pieber B, Rechberger GN, Wolinski H, Gaspar ML, Kappe CO, Stadlmann J, Mechtler K, Zenz A, Lohner K, Tehlivets O, Henry SA, Kohlwein SD. 2014. Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids. Developmental Cell. 29(6), P729-739.","ieee":"H. F. Hofbauer et al., “Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids,” Developmental Cell, vol. 29, no. 6. Elsevier, pp. P729-739, 2014.","apa":"Hofbauer, H. F., Schopf, F. H., Schleifer, H., Knittelfelder, O. L., Pieber, B., Rechberger, G. N., … Kohlwein, S. D. (2014). Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids. Developmental Cell. Elsevier. https://doi.org/10.1016/j.devcel.2014.04.025","mla":"Hofbauer, Harald F., et al. “Regulation of Gene Expression through a Transcriptional Repressor That Senses Acyl-Chain Length in Membrane Phospholipids.” Developmental Cell, vol. 29, no. 6, Elsevier, 2014, pp. P729-739, doi:10.1016/j.devcel.2014.04.025.","short":"H.F. Hofbauer, F.H. Schopf, H. Schleifer, O.L. Knittelfelder, B. Pieber, G.N. Rechberger, H. Wolinski, M.L. Gaspar, C.O. Kappe, J. Stadlmann, K. Mechtler, A. Zenz, K. Lohner, O. Tehlivets, S.A. Henry, S.D. Kohlwein, Developmental Cell 29 (2014) P729-739.","chicago":"Hofbauer, Harald F., Florian H. Schopf, Hannes Schleifer, Oskar L. Knittelfelder, Bartholomäus Pieber, Gerald N. Rechberger, Heimo Wolinski, et al. “Regulation of Gene Expression through a Transcriptional Repressor That Senses Acyl-Chain Length in Membrane Phospholipids.” Developmental Cell. Elsevier, 2014. https://doi.org/10.1016/j.devcel.2014.04.025."},"article_type":"original","page":"P729-739","date_published":"2014-06-23T00:00:00Z","scopus_import":"1","day":"23","article_processing_charge":"No","_id":"11968","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids","status":"public","intvolume":" 29","oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Membrane phospholipids typically contain fatty acids (FAs) of 16 and 18 carbon atoms. This particular chain length is evolutionarily highly conserved and presumably provides maximum stability and dynamic properties to biological membranes in response to nutritional or environmental cues. Here, we show that the relative proportion of C16 versus C18 FAs is regulated by the activity of acetyl-CoA carboxylase (Acc1), the first and rate-limiting enzyme of FA de novo synthesis. Acc1 activity is attenuated by AMPK/Snf1-dependent phosphorylation, which is required to maintain an appropriate acyl-chain length distribution. Moreover, we find that the transcriptional repressor Opi1 preferentially binds to C16 over C18 phosphatidic acid (PA) species: thus, C16-chain containing PA sequesters Opi1 more effectively to the ER, enabling AMPK/Snf1 control of PA acyl-chain length to determine the degree of derepression of Opi1 target genes. These findings reveal an unexpected regulatory link between the major energy-sensing kinase, membrane lipid composition, and transcription.","lang":"eng"}],"issue":"6","oa":1,"main_file_link":[{"url":"https://doi.org/10.1016/j.devcel.2014.04.025","open_access":"1"}],"external_id":{"pmid":["24960695"]},"quality_controlled":"1","doi":"10.1016/j.devcel.2014.04.025","language":[{"iso":"eng"}],"month":"06","publication_identifier":{"eissn":["1878-1551"],"issn":["1534-5807"]},"year":"2014","pmid":1,"publication_status":"published","publisher":"Elsevier","author":[{"last_name":"Hofbauer","first_name":"Harald F.","full_name":"Hofbauer, Harald F."},{"last_name":"Schopf","first_name":"Florian H.","full_name":"Schopf, Florian H."},{"first_name":"Hannes","last_name":"Schleifer","full_name":"Schleifer, Hannes"},{"full_name":"Knittelfelder, Oskar L.","first_name":"Oskar L.","last_name":"Knittelfelder"},{"full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber","first_name":"Bartholomäus"},{"full_name":"Rechberger, Gerald N.","last_name":"Rechberger","first_name":"Gerald N."},{"first_name":"Heimo","last_name":"Wolinski","full_name":"Wolinski, Heimo"},{"first_name":"Maria L.","last_name":"Gaspar","full_name":"Gaspar, Maria L."},{"full_name":"Kappe, C. Oliver","first_name":"C. Oliver","last_name":"Kappe"},{"full_name":"Stadlmann, Johannes","first_name":"Johannes","last_name":"Stadlmann"},{"first_name":"Karl","last_name":"Mechtler","full_name":"Mechtler, Karl"},{"first_name":"Alexandra","last_name":"Zenz","full_name":"Zenz, Alexandra"},{"first_name":"Karl","last_name":"Lohner","full_name":"Lohner, Karl"},{"last_name":"Tehlivets","first_name":"Oksana","full_name":"Tehlivets, Oksana"},{"first_name":"Susan A.","last_name":"Henry","full_name":"Henry, Susan A."},{"last_name":"Kohlwein","first_name":"Sepp D.","full_name":"Kohlwein, Sepp D."}],"date_updated":"2023-02-21T10:09:45Z","date_created":"2022-08-25T08:42:42Z","volume":29,"extern":"1"},{"pmid":1,"year":"2014","publisher":"Wiley","publication_status":"published","author":[{"full_name":"Moghaddam, Mojtaba Mirhosseini","last_name":"Moghaddam","first_name":"Mojtaba Mirhosseini"},{"full_name":"Pieber, Bartholomäus","last_name":"Pieber","first_name":"Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726"},{"first_name":"Toma","last_name":"Glasnov","full_name":"Glasnov, Toma"},{"full_name":"Kappe, C. Oliver","last_name":"Kappe","first_name":"C. Oliver"}],"volume":7,"date_updated":"2023-02-21T10:09:42Z","date_created":"2022-08-25T08:36:54Z","extern":"1","external_id":{"pmid":["25209099"]},"quality_controlled":"1","doi":"10.1002/cssc.201402455","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1864-5631"],"eissn":["1864-564X"]},"month":"11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11967","intvolume":" 7","status":"public","title":"Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow","oa_version":"None","type":"journal_article","issue":"11","abstract":[{"text":"An experimentally easy to perform method for the generation of alumina-supported Fe3O4 nanoparticles [(6±1) nm size, 0.67 wt %]and the use of this material in hydrazine-mediated heterogeneously catalyzed reductions of nitroarenes to anilines under batch and continuous-flow conditions is presented. The bench-stable, reusable nano-Fe3O4@Al2O3 catalyst can selectively reduce functionalized nitroarenes at 1 mol % catalyst loading by using a 20 mol % excess of hydrazine hydrate in an elevated temperature regime (150 °C, reaction time 2–6 min in batch). For continuous-flow processing, the catalyst material is packed into dedicated cartridges and used in a commercially available high-temperature/-pressure flow device. In continuous mode, reaction times can be reduced to less than 1 min at 150 °C (30 bar back pressure) in a highly intensified process. The nano-Fe3O4@Al2O3 catalyst demonstrated stable reduction of nitrobenzene (0.5 M in MeOH) for more than 10 h on stream at a productivity of 30 mmol h−1 (0.72 mol per day). Importantly, virtually no leaching of the catalytically active material could be observed by inductively coupled plasma MS monitoring.","lang":"eng"}],"citation":{"ista":"Moghaddam MM, Pieber B, Glasnov T, Kappe CO. 2014. Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow. ChemSusChem. 7(11), 3122–3131.","apa":"Moghaddam, M. M., Pieber, B., Glasnov, T., & Kappe, C. O. (2014). Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow. ChemSusChem. Wiley. https://doi.org/10.1002/cssc.201402455","ieee":"M. M. Moghaddam, B. Pieber, T. Glasnov, and C. O. Kappe, “Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow,” ChemSusChem, vol. 7, no. 11. Wiley, pp. 3122–3131, 2014.","ama":"Moghaddam MM, Pieber B, Glasnov T, Kappe CO. Immobilized iron oxide nanoparticles as stable and reusable catalysts for hydrazine-mediated nitro reductions in continuous flow. ChemSusChem. 2014;7(11):3122-3131. doi:10.1002/cssc.201402455","chicago":"Moghaddam, Mojtaba Mirhosseini, Bartholomäus Pieber, Toma Glasnov, and C. Oliver Kappe. “Immobilized Iron Oxide Nanoparticles as Stable and Reusable Catalysts for Hydrazine-Mediated Nitro Reductions in Continuous Flow.” ChemSusChem. Wiley, 2014. https://doi.org/10.1002/cssc.201402455.","mla":"Moghaddam, Mojtaba Mirhosseini, et al. “Immobilized Iron Oxide Nanoparticles as Stable and Reusable Catalysts for Hydrazine-Mediated Nitro Reductions in Continuous Flow.” ChemSusChem, vol. 7, no. 11, Wiley, 2014, pp. 3122–31, doi:10.1002/cssc.201402455.","short":"M.M. Moghaddam, B. Pieber, T. Glasnov, C.O. Kappe, ChemSusChem 7 (2014) 3122–3131."},"publication":"ChemSusChem","page":"3122-3131","article_type":"original","date_published":"2014-11-01T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"01"},{"type":"journal_article","article_number":"13430","extern":"1","issue":"26","abstract":[{"lang":"eng","text":"A method for the direct lithiation of terminal alkynes and heterocycles with subsequent carboxylation in a continuous flow format was developed. This method provides carboxylic acids at ambient conditions within less than five seconds with only little excess of the organometallic base and CO2."}],"publisher":"Royal Society of Chemistry","intvolume":" 4","publication_status":"published","status":"public","title":"Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow","year":"2014","_id":"11987","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","volume":4,"date_updated":"2023-02-21T10:10:31Z","date_created":"2022-08-25T11:48:19Z","author":[{"id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","first_name":"Bartholomäus","last_name":"Pieber","full_name":"Pieber, Bartholomäus"},{"last_name":"Glasnov","first_name":"Toma","full_name":"Glasnov, Toma"},{"first_name":"C. O.","last_name":"Kappe","full_name":"Kappe, C. O."}],"scopus_import":"1","article_processing_charge":"No","publication_identifier":{"eissn":["2046-2069"]},"day":"03","month":"03","quality_controlled":"1","article_type":"letter_note","citation":{"apa":"Pieber, B., Glasnov, T., & Kappe, C. O. (2014). Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow. RSC Advances. Royal Society of Chemistry. https://doi.org/10.1039/c4ra01442a","ieee":"B. Pieber, T. Glasnov, and C. O. Kappe, “Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow,” RSC Advances, vol. 4, no. 26. Royal Society of Chemistry, 2014.","ista":"Pieber B, Glasnov T, Kappe CO. 2014. Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow. RSC Advances. 4(26), 13430.","ama":"Pieber B, Glasnov T, Kappe CO. Flash carboxylation: Fast lithiation–carboxylation sequence at room temperature in continuous flow. RSC Advances. 2014;4(26). doi:10.1039/c4ra01442a","chicago":"Pieber, Bartholomäus, Toma Glasnov, and C. O. Kappe. “Flash Carboxylation: Fast Lithiation–Carboxylation Sequence at Room Temperature in Continuous Flow.” RSC Advances. Royal Society of Chemistry, 2014. https://doi.org/10.1039/c4ra01442a.","short":"B. Pieber, T. Glasnov, C.O. Kappe, RSC Advances 4 (2014).","mla":"Pieber, Bartholomäus, et al. “Flash Carboxylation: Fast Lithiation–Carboxylation Sequence at Room Temperature in Continuous Flow.” RSC Advances, vol. 4, no. 26, 13430, Royal Society of Chemistry, 2014, doi:10.1039/c4ra01442a."},"publication":"RSC Advances","language":[{"iso":"eng"}],"doi":"10.1039/c4ra01442a","date_published":"2014-03-03T00:00:00Z"},{"month":"01","day":"01","date_published":"2014-01-01T00:00:00Z","doi":"10.1007/s00030-013-0235-0","publication":"Nonlinear Differential Equations and Applications","citation":{"ista":"Fischer JL. 2014. Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn equation and quantum drift-diffusion models. Nonlinear Differential Equations and Applications. 21(1), 27–50.","apa":"Fischer, J. L. (2014). Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn equation and quantum drift-diffusion models. Nonlinear Differential Equations and Applications. Birkhäuser. https://doi.org/10.1007/s00030-013-0235-0","ieee":"J. L. Fischer, “Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn equation and quantum drift-diffusion models,” Nonlinear Differential Equations and Applications, vol. 21, no. 1. Birkhäuser, pp. 27–50, 2014.","ama":"Fischer JL. Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn equation and quantum drift-diffusion models. Nonlinear Differential Equations and Applications. 2014;21(1):27-50. doi:10.1007/s00030-013-0235-0","chicago":"Fischer, Julian L. “Infinite Speed of Support Propagation for the Derrida-Lebowitz-Speer-Spohn Equation and Quantum Drift-Diffusion Models.” Nonlinear Differential Equations and Applications. Birkhäuser, 2014. https://doi.org/10.1007/s00030-013-0235-0.","mla":"Fischer, Julian L. “Infinite Speed of Support Propagation for the Derrida-Lebowitz-Speer-Spohn Equation and Quantum Drift-Diffusion Models.” Nonlinear Differential Equations and Applications, vol. 21, no. 1, Birkhäuser, 2014, pp. 27–50, doi:10.1007/s00030-013-0235-0.","short":"J.L. Fischer, Nonlinear Differential Equations and Applications 21 (2014) 27–50."},"quality_controlled":0,"page":"27 - 50","abstract":[{"text":"We show that weak solutions of the Derrida-Lebowitz-Speer-Spohn (DLSS) equation display infinite speed of support propagation. We apply our method to the case of the quantum drift-diffusion equation which augments the DLSS equation with a drift term and possibly a second-order diffusion term. The proof is accomplished using weighted entropy estimates, Hardy's inequality and a family of singular weight functions to derive a differential inequality; the differential inequality shows exponential growth of the weighted entropy, with the growth constant blowing up very fast as the singularity of the weight becomes sharper. To the best of our knowledge, this is the first example of a nonnegativity-preserving higher-order parabolic equation displaying infinite speed of support propagation.","lang":"eng"}],"publist_id":"5960","issue":"1","extern":1,"type":"journal_article","author":[{"orcid":"0000-0002-0479-558X","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","last_name":"Fischer","first_name":"Julian L","full_name":"Julian Fischer"}],"date_created":"2018-12-11T11:51:17Z","date_updated":"2021-01-12T06:49:47Z","volume":21,"_id":"1309","year":"2014","status":"public","publication_status":"published","title":"Infinite speed of support propagation for the Derrida-Lebowitz-Speer-Spohn equation and quantum drift-diffusion models","intvolume":" 21","publisher":"Birkhäuser"},{"type":"journal_article","extern":1,"abstract":[{"text":"We derive upper bounds on the waiting time of solutions to the thin-film equation in the regime of weak slippage n ∈ [2, 32\\11). In particular, we give sufficient conditions on the initial data for instantaneous forward motion of the free boundary. For n ∈ (2, 32\\11), our estimates are sharp, for n = 2, they are sharp up to a logarithmic correction term. Note that the case n = 2 corresponds-with a grain of salt-to the assumption of the Navier slip condition at the fluid-solid interface. We also obtain results in the regime of strong slippage n ∈ (1,2); however, in this regime we expect them not to be optimal. Our method is based on weighted backward entropy estimates, Hardy's inequality and singular weight functions; we deduce a differential inequality which would enforce blowup of the weighted entropy if the contact line were to remain stationary for too long.","lang":"eng"}],"issue":"3","publist_id":"5959","title":"Upper bounds on waiting times for the Thin-film equation: The case of weak slippage","status":"public","publication_status":"published","publisher":"Springer","intvolume":" 211","_id":"1312","year":"2014","date_updated":"2021-01-12T06:49:48Z","date_created":"2018-12-11T11:51:18Z","volume":211,"author":[{"full_name":"Julian Fischer","orcid":"0000-0002-0479-558X","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","last_name":"Fischer","first_name":"Julian L"}],"month":"01","day":"01","quality_controlled":0,"page":"771 - 818","publication":"Archive for Rational Mechanics and Analysis","citation":{"ieee":"J. L. Fischer, “Upper bounds on waiting times for the Thin-film equation: The case of weak slippage,” Archive for Rational Mechanics and Analysis, vol. 211, no. 3. Springer, pp. 771–818, 2014.","apa":"Fischer, J. L. (2014). Upper bounds on waiting times for the Thin-film equation: The case of weak slippage. Archive for Rational Mechanics and Analysis. Springer. https://doi.org/10.1007/s00205-013-0690-0","ista":"Fischer JL. 2014. Upper bounds on waiting times for the Thin-film equation: The case of weak slippage. Archive for Rational Mechanics and Analysis. 211(3), 771–818.","ama":"Fischer JL. Upper bounds on waiting times for the Thin-film equation: The case of weak slippage. Archive for Rational Mechanics and Analysis. 2014;211(3):771-818. doi:10.1007/s00205-013-0690-0","chicago":"Fischer, Julian L. “Upper Bounds on Waiting Times for the Thin-Film Equation: The Case of Weak Slippage.” Archive for Rational Mechanics and Analysis. Springer, 2014. https://doi.org/10.1007/s00205-013-0690-0.","short":"J.L. Fischer, Archive for Rational Mechanics and Analysis 211 (2014) 771–818.","mla":"Fischer, Julian L. “Upper Bounds on Waiting Times for the Thin-Film Equation: The Case of Weak Slippage.” Archive for Rational Mechanics and Analysis, vol. 211, no. 3, Springer, 2014, pp. 771–818, doi:10.1007/s00205-013-0690-0."},"date_published":"2014-01-01T00:00:00Z","doi":"10.1007/s00205-013-0690-0"},{"publication":"Theoretical Computer Science","citation":{"ama":"Chatterjee K, Henzinger MH, Krinninger S, Loitzenbauer V, Raskin M. Approximating the minimum cycle mean. Theoretical Computer Science. 2014;547(C):104-116. doi:10.1016/j.tcs.2014.06.031","ista":"Chatterjee K, Henzinger MH, Krinninger S, Loitzenbauer V, Raskin M. 2014. Approximating the minimum cycle mean. Theoretical Computer Science. 547(C), 104–116.","apa":"Chatterjee, K., Henzinger, M. H., Krinninger, S., Loitzenbauer, V., & Raskin, M. (2014). Approximating the minimum cycle mean. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2014.06.031","ieee":"K. Chatterjee, M. H. Henzinger, S. Krinninger, V. Loitzenbauer, and M. Raskin, “Approximating the minimum cycle mean,” Theoretical Computer Science, vol. 547, no. C. Elsevier, pp. 104–116, 2014.","mla":"Chatterjee, Krishnendu, et al. “Approximating the Minimum Cycle Mean.” Theoretical Computer Science, vol. 547, no. C, Elsevier, 2014, pp. 104–16, doi:10.1016/j.tcs.2014.06.031.","short":"K. Chatterjee, M.H. Henzinger, S. Krinninger, V. Loitzenbauer, M. Raskin, Theoretical Computer Science 547 (2014) 104–116.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, and Michael Raskin. “Approximating the Minimum Cycle Mean.” Theoretical Computer Science. Elsevier, 2014. https://doi.org/10.1016/j.tcs.2014.06.031."},"article_type":"original","page":"104 - 116","date_published":"2014-08-28T00:00:00Z","scopus_import":"1","day":"28","article_processing_charge":"No","_id":"1375","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Approximating the minimum cycle mean","intvolume":" 547","oa_version":"Preprint","type":"journal_article","abstract":[{"lang":"eng","text":"We consider directed graphs where each edge is labeled with an integer weight and study the fundamental algorithmic question of computing the value of a cycle with minimum mean weight. Our contributions are twofold: (1) First we show that the algorithmic question is reducible to the problem of a logarithmic number of min-plus matrix multiplications of n×n-matrices, where n is the number of vertices of the graph. (2) Second, when the weights are nonnegative, we present the first (1+ε)-approximation algorithm for the problem and the running time of our algorithm is Õ(nωlog3(nW/ε)/ε),1 where O(nω) is the time required for the classic n×n-matrix multiplication and W is the maximum value of the weights. With an additional O(log(nW/ε)) factor in space a cycle with approximately optimal weight can be computed within the same time bound."}],"issue":"C","main_file_link":[{"url":"http://arxiv.org/abs/1307.4473","open_access":"1"}],"external_id":{"arxiv":["1307.4473"]},"oa":1,"quality_controlled":"1","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"doi":"10.1016/j.tcs.2014.06.031","language":[{"iso":"eng"}],"month":"08","year":"2014","publication_status":"published","publisher":"Elsevier","department":[{"_id":"KrCh"}],"author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"full_name":"Krinninger, Sebastian","last_name":"Krinninger","first_name":"Sebastian"},{"last_name":"Loitzenbauer","first_name":"Veronika","full_name":"Loitzenbauer, Veronika"},{"first_name":"Michael","last_name":"Raskin","full_name":"Raskin, Michael"}],"date_created":"2018-12-11T11:51:40Z","date_updated":"2022-09-09T11:50:58Z","volume":547,"publist_id":"5836","ec_funded":1},{"project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling"}],"quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-54013-4_10","conference":{"end_date":"2014-01-21","location":"San Diego, USA","start_date":"2014-01-19","name":"VMCAI: Verification, Model Checking and Abstract Interpretation"},"month":"01","department":[{"_id":"ToHe"}],"publisher":"Springer","publication_status":"published","year":"2014","acknowledgement":"Supported by the Vienna Science and Technology Fund (WWTF) through grant PROSEED.","volume":8318,"date_created":"2018-12-11T11:51:45Z","date_updated":"2021-01-12T06:50:22Z","author":[{"last_name":"Dragoi","first_name":"Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","full_name":"Dragoi, Cezara"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"last_name":"Veith","first_name":"Helmut","full_name":"Veith, Helmut"},{"full_name":"Widder, Josef","first_name":"Josef","last_name":"Widder"},{"full_name":"Zufferey, Damien","last_name":"Zufferey","first_name":"Damien","orcid":"0000-0002-3197-8736","id":"4397AC76-F248-11E8-B48F-1D18A9856A87"}],"ec_funded":1,"publist_id":"5817","file_date_updated":"2020-07-14T12:44:48Z","page":"161 - 181","citation":{"ista":"Dragoi C, Henzinger TA, Veith H, Widder J, Zufferey D. 2014. A logic-based framework for verifying consensus algorithms. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 8318, 161–181.","apa":"Dragoi, C., Henzinger, T. A., Veith, H., Widder, J., & Zufferey, D. (2014). A logic-based framework for verifying consensus algorithms (Vol. 8318, pp. 161–181). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, San Diego, USA: Springer. https://doi.org/10.1007/978-3-642-54013-4_10","ieee":"C. Dragoi, T. A. Henzinger, H. Veith, J. Widder, and D. Zufferey, “A logic-based framework for verifying consensus algorithms,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, San Diego, USA, 2014, vol. 8318, pp. 161–181.","ama":"Dragoi C, Henzinger TA, Veith H, Widder J, Zufferey D. A logic-based framework for verifying consensus algorithms. In: Vol 8318. Springer; 2014:161-181. doi:10.1007/978-3-642-54013-4_10","chicago":"Dragoi, Cezara, Thomas A Henzinger, Helmut Veith, Josef Widder, and Damien Zufferey. “A Logic-Based Framework for Verifying Consensus Algorithms,” 8318:161–81. Springer, 2014. https://doi.org/10.1007/978-3-642-54013-4_10.","mla":"Dragoi, Cezara, et al. A Logic-Based Framework for Verifying Consensus Algorithms. Vol. 8318, Springer, 2014, pp. 161–81, doi:10.1007/978-3-642-54013-4_10.","short":"C. Dragoi, T.A. Henzinger, H. Veith, J. Widder, D. Zufferey, in:, Springer, 2014, pp. 161–181."},"date_published":"2014-01-01T00:00:00Z","scopus_import":1,"has_accepted_license":"1","day":"01","intvolume":" 8318","ddc":["000","005"],"status":"public","title":"A logic-based framework for verifying consensus algorithms","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1392","file":[{"file_size":444138,"content_type":"application/pdf","creator":"system","access_level":"open_access","file_name":"IST-2014-179-v1+1_vmcai14.pdf","checksum":"bffa33d39be77df0da39defe97eabf84","date_updated":"2020-07-14T12:44:48Z","date_created":"2018-12-12T10:11:06Z","relation":"main_file","file_id":"4859"}],"oa_version":"Submitted Version","pubrep_id":"179","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"Fault-tolerant distributed algorithms play an important role in ensuring the reliability of many software applications. In this paper we consider distributed algorithms whose computations are organized in rounds. To verify the correctness of such algorithms, we reason about (i) properties (such as invariants) of the state, (ii) the transitions controlled by the algorithm, and (iii) the communication graph. We introduce a logic that addresses these points, and contains set comprehensions with cardinality constraints, function symbols to describe the local states of each process, and a limited form of quantifier alternation to express the verification conditions. We show its use in automating the verification of consensus algorithms. In particular, we give a semi-decision procedure for the unsatisfiability problem of the logic and identify a decidable fragment. We successfully applied our framework to verify the correctness of a variety of consensus algorithms tolerant to both benign faults (message loss, process crashes) and value faults (message corruption).","lang":"eng"}]},{"abstract":[{"lang":"eng","text":"Probabilistic programs are usual functional or imperative programs with two added constructs: (1) the ability to draw values at random from distributions, and (2) the ability to condition values of variables in a program via observations. Models from diverse application areas such as computer vision, coding theory, cryptographic protocols, biology and reliability analysis can be written as probabilistic programs. Probabilistic inference is the problem of computing an explicit representation of the probability distribution implicitly specified by a probabilistic program. Depending on the application, the desired output from inference may vary-we may want to estimate the expected value of some function f with respect to the distribution, or the mode of the distribution, or simply a set of samples drawn from the distribution. In this paper, we describe connections this research area called \\Probabilistic Programming" has with programming languages and software engineering, and this includes language design, and the static and dynamic analysis of programs. We survey current state of the art and speculate on promising directions for future research."}],"type":"conference","oa_version":"Published Version","title":"Probabilistic programming","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"1393","day":"31","article_processing_charge":"No","scopus_import":1,"date_published":"2014-05-31T00:00:00Z","page":"167 - 181","publication":"Proceedings of the on Future of Software Engineering","citation":{"mla":"Gordon, Andrew, et al. “Probabilistic Programming.” Proceedings of the on Future of Software Engineering, ACM, 2014, pp. 167–81, doi:10.1145/2593882.2593900.","short":"A. Gordon, T.A. Henzinger, A. Nori, S. Rajamani, in:, Proceedings of the on Future of Software Engineering, ACM, 2014, pp. 167–181.","chicago":"Gordon, Andrew, Thomas A Henzinger, Aditya Nori, and Sriram Rajamani. “Probabilistic Programming.” In Proceedings of the on Future of Software Engineering, 167–81. ACM, 2014. https://doi.org/10.1145/2593882.2593900.","ama":"Gordon A, Henzinger TA, Nori A, Rajamani S. Probabilistic programming. In: Proceedings of the on Future of Software Engineering. ACM; 2014:167-181. doi:10.1145/2593882.2593900","ista":"Gordon A, Henzinger TA, Nori A, Rajamani S. 2014. Probabilistic programming. Proceedings of the on Future of Software Engineering. FOSE: Future of Software Engineering, 167–181.","apa":"Gordon, A., Henzinger, T. A., Nori, A., & Rajamani, S. (2014). Probabilistic programming. In Proceedings of the on Future of Software Engineering (pp. 167–181). Hyderabad, India: ACM. https://doi.org/10.1145/2593882.2593900","ieee":"A. Gordon, T. A. Henzinger, A. Nori, and S. Rajamani, “Probabilistic programming,” in Proceedings of the on Future of Software Engineering, Hyderabad, India, 2014, pp. 167–181."},"ec_funded":1,"publist_id":"5816","date_updated":"2021-01-12T06:50:22Z","date_created":"2018-12-11T11:51:45Z","author":[{"last_name":"Gordon","first_name":"Andrew","full_name":"Gordon, Andrew"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nori, Aditya","first_name":"Aditya","last_name":"Nori"},{"full_name":"Rajamani, Sriram","first_name":"Sriram","last_name":"Rajamani"}],"publication_status":"published","publisher":"ACM","department":[{"_id":"ToHe"}],"year":"2014","month":"05","language":[{"iso":"eng"}],"conference":{"end_date":"2014-06-07","start_date":"2014-05-31","location":"Hyderabad, India","name":"FOSE: Future of Software Engineering"},"doi":"10.1145/2593882.2593900","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/2593882.2593900"}],"oa":1},{"status":"public","publication_status":"published","title":"Evolution of a fungal pathogen towards individual versus social immunity in ants","publisher":"IST Austria","department":[{"_id":"SyCr"}],"year":"2014","_id":"1404","acknowledgement":"This work was funded by the DFG and the ERC.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:51:49Z","date_updated":"2021-01-12T06:50:30Z","oa_version":"None","author":[{"full_name":"Stock, Miriam","id":"42462816-F248-11E8-B48F-1D18A9856A87","first_name":"Miriam","last_name":"Stock"}],"alternative_title":["IST Austria Thesis"],"type":"dissertation","abstract":[{"lang":"eng","text":"The co-evolution of hosts and pathogens is characterized by continuous adaptations of both parties. Pathogens of social insects need to adapt towards disease defences at two levels: 1) individual immunity of each colony member consisting of behavioural defence strategies as well as humoral and cellular immune responses and 2) social immunity that is collectively performed by all group members comprising behavioural, physiological and organisational defence strategies.\r\n\r\nTo disentangle the selection pressure on pathogens by the collective versus individual level of disease defence in social insects, we performed an evolution experiment using the Argentine Ant, Linepithema humile, as a host and a mixture of the general insect pathogenic fungus Metarhizium spp. (6 strains) as a pathogen. We allowed pathogen evolution over 10 serial host passages to two different evolution host treatments: (1) only individual host immunity in a single host treatment, and (2) simultaneously acting individual and social immunity in a social host treatment, in which an exposed ant was accompanied by two untreated nestmates.\r\n\r\nBefore starting the pathogen evolution experiment, the 6 Metarhizium spp. strains were characterised concerning conidiospore size killing rates in singly and socially reared ants, their competitiveness under coinfecting conditions and their influence on ant behaviour. We analysed how the ancestral atrain mixture changed in conidiospere size, killing rate and strain composition dependent on host treatment (single or social hosts) during 10 passages and found that killing rate and conidiospere size of the pathogen increased under both evolution regimes, but different depending on host treatment.\r\n\r\nTesting the evolved strain mixtures that evolved under either the single or social host treatment under both single and social current rearing conditions in a full factorial design experiment revealed that the additional collective defences in insect societies add new selection pressure for their coevolving pathogens that compromise their ability to adapt to its host at the group level. To our knowledge, this is the first study directly measuring the influence of social immunity on pathogen evolution."}],"publist_id":"5803","page":"101","citation":{"short":"M. Stock, Evolution of a Fungal Pathogen towards Individual versus Social Immunity in Ants, IST Austria, 2014.","mla":"Stock, Miriam. Evolution of a Fungal Pathogen towards Individual versus Social Immunity in Ants. IST Austria, 2014.","chicago":"Stock, Miriam. “Evolution of a Fungal Pathogen towards Individual versus Social Immunity in Ants.” IST Austria, 2014.","ama":"Stock M. Evolution of a fungal pathogen towards individual versus social immunity in ants. 2014.","ieee":"M. Stock, “Evolution of a fungal pathogen towards individual versus social immunity in ants,” IST Austria, 2014.","apa":"Stock, M. (2014). Evolution of a fungal pathogen towards individual versus social immunity in ants. IST Austria.","ista":"Stock M. 2014. Evolution of a fungal pathogen towards individual versus social immunity in ants. IST Austria."},"supervisor":[{"last_name":"Cremer","first_name":"Sylvia M","orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia M"}],"language":[{"iso":"eng"}],"date_published":"2014-04-01T00:00:00Z","day":"01","month":"04"},{"date_updated":"2021-01-12T06:51:19Z","date_created":"2018-12-11T11:52:28Z","oa_version":"Preprint","author":[{"full_name":"Bräunlich, Gerhard","first_name":"Gerhard","last_name":"Bräunlich"},{"first_name":"Christian","last_name":"Hainzl","full_name":"Hainzl, Christian"},{"full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","last_name":"Seiringer","first_name":"Robert"}],"title":"On the BCS gap equation for superfluid fermionic gases","status":"public","publication_status":"published","publisher":"World Scientific Publishing","department":[{"_id":"RoSe"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","_id":"1516","year":"2014","abstract":[{"lang":"eng","text":"We present a rigorous derivation of the BCS gap equation for superfluid fermionic gases with point interactions. Our starting point is the BCS energy functional, whose minimizer we investigate in the limit when the range of the interaction potential goes to zero.\r\n"}],"publist_id":"5661","type":"conference","language":[{"iso":"eng"}],"conference":{"end_date":"2013-09-13","location":"Berlin, Germany","start_date":"2013-09-10","name":"QMath: Mathematical Results in Quantum Physics"},"date_published":"2014-01-01T00:00:00Z","doi":"10.1142/9789814618144_0007","quality_controlled":"1","page":"127 - 137","publication":"Proceedings of the QMath12 Conference","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1403.2563"}],"citation":{"apa":"Bräunlich, G., Hainzl, C., & Seiringer, R. (2014). On the BCS gap equation for superfluid fermionic gases. In Proceedings of the QMath12 Conference (pp. 127–137). Berlin, Germany: World Scientific Publishing. https://doi.org/10.1142/9789814618144_0007","ieee":"G. Bräunlich, C. Hainzl, and R. Seiringer, “On the BCS gap equation for superfluid fermionic gases,” in Proceedings of the QMath12 Conference, Berlin, Germany, 2014, pp. 127–137.","ista":"Bräunlich G, Hainzl C, Seiringer R. 2014. On the BCS gap equation for superfluid fermionic gases. Proceedings of the QMath12 Conference. QMath: Mathematical Results in Quantum Physics, 127–137.","ama":"Bräunlich G, Hainzl C, Seiringer R. On the BCS gap equation for superfluid fermionic gases. In: Proceedings of the QMath12 Conference. World Scientific Publishing; 2014:127-137. doi:10.1142/9789814618144_0007","chicago":"Bräunlich, Gerhard, Christian Hainzl, and Robert Seiringer. “On the BCS Gap Equation for Superfluid Fermionic Gases.” In Proceedings of the QMath12 Conference, 127–37. World Scientific Publishing, 2014. https://doi.org/10.1142/9789814618144_0007.","short":"G. Bräunlich, C. Hainzl, R. Seiringer, in:, Proceedings of the QMath12 Conference, World Scientific Publishing, 2014, pp. 127–137.","mla":"Bräunlich, Gerhard, et al. “On the BCS Gap Equation for Superfluid Fermionic Gases.” Proceedings of the QMath12 Conference, World Scientific Publishing, 2014, pp. 127–37, doi:10.1142/9789814618144_0007."},"oa":1,"external_id":{"arxiv":["1403.2563"]},"day":"01","month":"01","article_processing_charge":"No"},{"pubrep_id":"577","file":[{"relation":"main_file","file_id":"4876","checksum":"7f91e588a4e888610313b98271e6418e","date_created":"2018-12-12T10:11:22Z","date_updated":"2020-07-14T12:45:07Z","access_level":"open_access","file_name":"IST-2016-577-v1+1_2014.TOG.Paul.EditingPropagation.final.pdf","file_size":9832561,"content_type":"application/pdf","creator":"system"}],"oa_version":"Submitted Version","_id":"1629","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["000"],"title":"Edit propagation using geometric relationship functions","intvolume":" 33","abstract":[{"lang":"eng","text":"We propose a method for propagating edit operations in 2D vector graphics, based on geometric relationship functions. These functions quantify the geometric relationship of a point to a polygon, such as the distance to the boundary or the direction to the closest corner vertex. The level sets of the relationship functions describe points with the same relationship to a polygon. For a given query point, we first determine a set of relationships to local features, construct all level sets for these relationships, and accumulate them. The maxima of the resulting distribution are points with similar geometric relationships. We show extensions to handle mirror symmetries, and discuss the use of relationship functions as local coordinate systems. Our method can be applied, for example, to interactive floorplan editing, and it is especially useful for large layouts, where individual edits would be cumbersome. We demonstrate populating 2D layouts with tens to hundreds of objects by propagating relatively few edit operations."}],"issue":"2","type":"journal_article","date_published":"2014-03-01T00:00:00Z","publication":"ACM Transactions on Graphics","citation":{"mla":"Guerrero, Paul, et al. “Edit Propagation Using Geometric Relationship Functions.” ACM Transactions on Graphics, vol. 33, no. 2, 15, ACM, 2014, doi:10.1145/2591010.","short":"P. Guerrero, S. Jeschke, M. Wimmer, P. Wonka, ACM Transactions on Graphics 33 (2014).","chicago":"Guerrero, Paul, Stefan Jeschke, Michael Wimmer, and Peter Wonka. “Edit Propagation Using Geometric Relationship Functions.” ACM Transactions on Graphics. ACM, 2014. https://doi.org/10.1145/2591010.","ama":"Guerrero P, Jeschke S, Wimmer M, Wonka P. Edit propagation using geometric relationship functions. ACM Transactions on Graphics. 2014;33(2). doi:10.1145/2591010","ista":"Guerrero P, Jeschke S, Wimmer M, Wonka P. 2014. Edit propagation using geometric relationship functions. ACM Transactions on Graphics. 33(2), 15.","ieee":"P. Guerrero, S. Jeschke, M. Wimmer, and P. Wonka, “Edit propagation using geometric relationship functions,” ACM Transactions on Graphics, vol. 33, no. 2. ACM, 2014.","apa":"Guerrero, P., Jeschke, S., Wimmer, M., & Wonka, P. (2014). Edit propagation using geometric relationship functions. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2591010"},"day":"01","has_accepted_license":"1","author":[{"first_name":"Paul","last_name":"Guerrero","full_name":"Guerrero, Paul"},{"id":"44D6411A-F248-11E8-B48F-1D18A9856A87","last_name":"Jeschke","first_name":"Stefan","full_name":"Jeschke, Stefan"},{"first_name":"Michael","last_name":"Wimmer","full_name":"Wimmer, Michael"},{"full_name":"Wonka, Peter","first_name":"Peter","last_name":"Wonka"}],"date_updated":"2021-01-12T06:52:06Z","date_created":"2018-12-11T11:53:08Z","volume":33,"year":"2014","publication_status":"published","publisher":"ACM","department":[{"_id":"ChWo"}],"file_date_updated":"2020-07-14T12:45:07Z","publist_id":"5526","article_number":"15","doi":"10.1145/2591010","language":[{"iso":"eng"}],"oa":1,"quality_controlled":"1","month":"03"}]