[{"issue":"11","scopus_import":"1","external_id":{"isi":["000451102100064"],"pmid":["30359041"]},"file":[{"file_name":"IST-2018-1065-v1+1_ACS_nanoletters_8b03217.pdf","content_type":"application/pdf","relation":"main_file","checksum":"3e6034a94c6b5335e939145d88bdb371","file_id":"5194","access_level":"open_access","date_updated":"2020-07-14T12:45:37Z","creator":"system","date_created":"2018-12-12T10:16:08Z","file_size":1361441}],"publication_identifier":{"issn":["15306984"]},"doi":"10.1021/acs.nanolett.8b03217","oa_version":"Published Version","day":"25","oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2018-10-25T00:00:00Z","ddc":["530"],"status":"public","file_date_updated":"2020-07-14T12:45:37Z","article_processing_charge":"No","title":"Single-shot readout of hole spins in Ge","language":[{"iso":"eng"}],"publication":"Nano Letters","department":[{"_id":"GeKa"}],"publisher":"American Chemical Society","pmid":1,"page":"7141 - 7145","pubrep_id":"1065","citation":{"ista":"Vukušić L, Kukucka J, Watzinger H, Milem JM, Schäffler F, Katsaros G. 2018. Single-shot readout of hole spins in Ge. Nano Letters. 18(11), 7141–7145.","apa":"Vukušić, L., Kukucka, J., Watzinger, H., Milem, J. M., Schäffler, F., & Katsaros, G. (2018). Single-shot readout of hole spins in Ge. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.8b03217","mla":"Vukušić, Lada, et al. “Single-Shot Readout of Hole Spins in Ge.” Nano Letters, vol. 18, no. 11, American Chemical Society, 2018, pp. 7141–45, doi:10.1021/acs.nanolett.8b03217.","short":"L. Vukušić, J. Kukucka, H. Watzinger, J.M. Milem, F. Schäffler, G. Katsaros, Nano Letters 18 (2018) 7141–7145.","ieee":"L. Vukušić, J. Kukucka, H. Watzinger, J. M. Milem, F. Schäffler, and G. Katsaros, “Single-shot readout of hole spins in Ge,” Nano Letters, vol. 18, no. 11. American Chemical Society, pp. 7141–7145, 2018.","chicago":"Vukušić, Lada, Josip Kukucka, Hannes Watzinger, Joshua M Milem, Friedrich Schäffler, and Georgios Katsaros. “Single-Shot Readout of Hole Spins in Ge.” Nano Letters. American Chemical Society, 2018. https://doi.org/10.1021/acs.nanolett.8b03217.","ama":"Vukušić L, Kukucka J, Watzinger H, Milem JM, Schäffler F, Katsaros G. Single-shot readout of hole spins in Ge. Nano Letters. 2018;18(11):7141-7145. doi:10.1021/acs.nanolett.8b03217"},"volume":18,"publist_id":"8032","quality_controlled":"1","has_accepted_license":"1","abstract":[{"text":"The strong atomistic spin–orbit coupling of holes makes single-shot spin readout measurements difficult because it reduces the spin lifetimes. By integrating the charge sensor into a high bandwidth radio frequency reflectometry setup, we were able to demonstrate single-shot readout of a germanium quantum dot hole spin and measure the spin lifetime. Hole spin relaxation times of about 90 μs at 500 mT are reported, with a total readout visibility of about 70%. By analyzing separately the spin-to-charge conversion and charge readout fidelities, we have obtained insight into the processes limiting the visibilities of hole spins. The analyses suggest that high hole visibilities are feasible at realistic experimental conditions, underlying the potential of hole spins for the realization of viable qubit devices.","lang":"eng"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-09-18T09:30:37Z","author":[{"first_name":"Lada","last_name":"Vukušić","full_name":"Vukušić, Lada","id":"31E9F056-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2424-8636"},{"full_name":"Kukucka, Josip","last_name":"Kukucka","first_name":"Josip","id":"3F5D8856-F248-11E8-B48F-1D18A9856A87"},{"id":"35DF8E50-F248-11E8-B48F-1D18A9856A87","last_name":"Watzinger","first_name":"Hannes","full_name":"Watzinger, Hannes"},{"id":"4CDE0A96-F248-11E8-B48F-1D18A9856A87","first_name":"Joshua M","last_name":"Milem","full_name":"Milem, Joshua M"},{"full_name":"Schäffler, Friedrich","last_name":"Schäffler","first_name":"Friedrich"},{"last_name":"Katsaros","first_name":"Georgios","full_name":"Katsaros, Georgios","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X"}],"isi":1,"ec_funded":1,"month":"10","publication_status":"published","project":[{"grant_number":"335497","call_identifier":"FP7","_id":"25517E86-B435-11E9-9278-68D0E5697425","name":"Towards Spin qubits and Majorana fermions in Germanium selfassembled hut-wires"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"date_created":"2018-12-11T11:44:13Z","intvolume":" 18","year":"2018","_id":"23","related_material":{"record":[{"relation":"popular_science","id":"7977"},{"status":"public","id":"69","relation":"dissertation_contains"},{"relation":"dissertation_contains","status":"public","id":"7996"}]},"type":"journal_article"},{"doi":"10.24963/ijcai.2018/652","oa_version":"Preprint","scopus_import":"1","external_id":{"arxiv":["1804.10601"],"isi":["000764175404117"]},"day":"01","oa":1,"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2018-07-01T00:00:00Z","acknowledgement":"This research was supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003; Austrian Science Fund (FWF): S11407-N23(RiSE/SHiNE);and an ERC Start Grant (279307:Graph Games).\r\n","arxiv":1,"title":"Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives","article_processing_charge":"No","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1804.10601","open_access":"1"}],"publisher":"IJCAI","conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","start_date":"2018-07-13","location":"Stockholm, Sweden","end_date":"2018-07-19"},"department":[{"_id":"KrCh"},{"_id":"ToHe"}],"quality_controlled":"1","publist_id":"8031","abstract":[{"lang":"eng","text":"Partially-observable Markov decision processes (POMDPs) with discounted-sum payoff are a standard framework to model a wide range of problems related to decision making under uncertainty. Traditionally, the goal has been to obtain policies that optimize the expectation of the discounted-sum payoff. A key drawback of the expectation measure is that even low probability events with extreme payoff can significantly affect the expectation, and thus the obtained policies are not necessarily risk-averse. An alternate approach is to optimize the probability that the payoff is above a certain threshold, which allows obtaining risk-averse policies, but ignores optimization of the expectation. We consider the expectation optimization with probabilistic guarantee (EOPG) problem, where the goal is to optimize the expectation ensuring that the payoff is above a given threshold with at least a specified probability. We present several results on the EOPG problem, including the first algorithm to solve it."}],"date_updated":"2025-06-02T08:53:48Z","volume":2018,"citation":{"chicago":"Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,” 2018:4692–99. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/652.","short":"K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699.","ieee":"K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699.","ama":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. In: Vol 2018. IJCAI; 2018:4692-4699. doi:10.24963/ijcai.2018/652","mla":"Chatterjee, Krishnendu, et al. Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:10.24963/ijcai.2018/652.","apa":"Chatterjee, K., Elgyütt, A., Novotný, P., & Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. https://doi.org/10.24963/ijcai.2018/652","ista":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699."},"page":"4692 - 4699","date_created":"2018-12-11T11:44:13Z","intvolume":" 2018","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","last_name":"Elgyütt","first_name":"Adrian","full_name":"Elgyütt, Adrian"},{"full_name":"Novotny, Petr","first_name":"Petr","last_name":"Novotny","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rouillé","first_name":"Owen","full_name":"Rouillé, Owen"}],"month":"07","ec_funded":1,"isi":1,"project":[{"grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"}],"publication_status":"published","year":"2018","_id":"24","type":"conference"},{"page":"1-5","oa":1,"citation":{"short":"S.A. Hashemi, N. Doan, M. Mondelli, W. Gross, in:, 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing, IEEE, 2018, pp. 1–5.","ama":"Hashemi SA, Doan N, Mondelli M, Gross W. Decoding Reed-Muller and polar codes by successive factor graph permutations. In: 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing. IEEE; 2018:1-5. doi:10.1109/istc.2018.8625281","chicago":"Hashemi, Seyyed Ali, Nghia Doan, Marco Mondelli, and Warren Gross. “Decoding Reed-Muller and Polar Codes by Successive Factor Graph Permutations.” In 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing, 1–5. IEEE, 2018. https://doi.org/10.1109/istc.2018.8625281.","ieee":"S. A. Hashemi, N. Doan, M. Mondelli, and W. Gross, “Decoding Reed-Muller and polar codes by successive factor graph permutations,” in 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing, Hong Kong, China, 2018, pp. 1–5.","mla":"Hashemi, Seyyed Ali, et al. “Decoding Reed-Muller and Polar Codes by Successive Factor Graph Permutations.” 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing, IEEE, 2018, pp. 1–5, doi:10.1109/istc.2018.8625281.","apa":"Hashemi, S. A., Doan, N., Mondelli, M., & Gross, W. (2018). Decoding Reed-Muller and polar codes by successive factor graph permutations. In 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (pp. 1–5). Hong Kong, China: IEEE. https://doi.org/10.1109/istc.2018.8625281","ista":"Hashemi SA, Doan N, Mondelli M, Gross W. 2018. Decoding Reed-Muller and polar codes by successive factor graph permutations. 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing. ISTC: Symposium on Turbo Codes & Iterative Information Processing, 1–5."},"day":"01","quality_controlled":"1","date_updated":"2021-01-12T08:08:29Z","abstract":[{"text":"Reed-Muller (RM) and polar codes are a class of capacity-achieving channel coding schemes with the same factor graph representation. Low-complexity decoding algorithms fall short in providing a good error-correction performance for RM and polar codes. Using the symmetric group of RM and polar codes, the specific decoding algorithm can be carried out on multiple permutations of the factor graph to boost the error-correction performance. However, this approach results in high decoding complexity. In this paper, we first derive the total number of factor graph permutations on which the decoding can be performed. We further propose a successive permutation (SP) scheme which finds the permutations on the fly, thus the decoding always progresses on a single factor graph permutation. We show that SP can be used to improve the error-correction performance of RM and polar codes under successive-cancellation (SC) and SC list (SCL) decoding, while keeping the memory requirements of the decoders unaltered. Our results for RM and polar codes of length 128 and rate 0.5 show that when SP is used and at a target frame error rate of 10 -4 , up to 0.5 dB and 0.1 dB improvement can be achieved for RM and polar codes respectively.","lang":"eng"}],"external_id":{"arxiv":["1807.03912"]},"publisher":"IEEE","extern":"1","oa_version":"Preprint","doi":"10.1109/istc.2018.8625281","conference":{"name":"ISTC: Symposium on Turbo Codes & Iterative Information Processing","start_date":"2018-12-03","location":"Hong Kong, China","end_date":"2018-12-07"},"year":"2018","_id":"6664","type":"conference","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1807.03912"}],"title":"Decoding Reed-Muller and polar codes by successive factor graph permutations","arxiv":1,"publication":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing","language":[{"iso":"eng"}],"author":[{"first_name":"Seyyed Ali","last_name":"Hashemi","full_name":"Hashemi, Seyyed Ali"},{"full_name":"Doan, Nghia","last_name":"Doan","first_name":"Nghia"},{"orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","first_name":"Marco","last_name":"Mondelli"},{"first_name":"Warren ","last_name":"Gross","full_name":"Gross, Warren "}],"date_published":"2018-12-01T00:00:00Z","publication_status":"published","month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2019-07-23T09:12:43Z","status":"public"},{"arxiv":1,"title":"Binary linear codes with optimal scaling: Polar codes with large kernels","language":[{"iso":"eng"}],"publication":"2018 IEEE Information Theory Workshop","year":"2018","_id":"6665","related_material":{"record":[{"relation":"later_version","id":"9002","status":"public"}]},"main_file_link":[{"url":"https://arxiv.org/abs/1711.01339","open_access":"1"}],"type":"conference","date_created":"2019-07-23T11:01:42Z","status":"public","author":[{"full_name":"Fazeli, Arman","first_name":"Arman","last_name":"Fazeli"},{"last_name":"Hassani","first_name":"Hamed","full_name":"Hassani, Hamed"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","last_name":"Mondelli","first_name":"Marco"},{"full_name":"Vardy, Alexander","last_name":"Vardy","first_name":"Alexander"}],"month":"11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","date_published":"2018-11-01T00:00:00Z","quality_controlled":"1","abstract":[{"text":"We prove that, at least for the binary erasure channel, the polar-coding paradigm gives rise to codes that not only approach the Shannon limit but, in fact, do so under the best possible scaling of their block length as a function of the gap to capacity. This result exhibits the first known family of binary codes that attain both optimal scaling and quasi-linear complexity of encoding and decoding. Specifically, for any fixed δ > 0, we exhibit binary linear codes that ensure reliable communication at rates within ε > 0 of capacity with block length n = O(1/ε 2+δ ), construction complexity Θ(n), and encoding/decoding complexity Θ(n log n).","lang":"eng"}],"date_updated":"2024-03-07T12:18:50Z","day":"01","page":"1-5","citation":{"mla":"Fazeli, Arman, et al. “Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels.” 2018 IEEE Information Theory Workshop, IEEE, 2018, pp. 1–5, doi:10.1109/itw.2018.8613428.","apa":"Fazeli, A., Hassani, H., Mondelli, M., & Vardy, A. (2018). Binary linear codes with optimal scaling: Polar codes with large kernels. In 2018 IEEE Information Theory Workshop (pp. 1–5). Guangzhou, China: IEEE. https://doi.org/10.1109/itw.2018.8613428","chicago":"Fazeli, Arman, Hamed Hassani, Marco Mondelli, and Alexander Vardy. “Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels.” In 2018 IEEE Information Theory Workshop, 1–5. IEEE, 2018. https://doi.org/10.1109/itw.2018.8613428.","ama":"Fazeli A, Hassani H, Mondelli M, Vardy A. Binary linear codes with optimal scaling: Polar codes with large kernels. In: 2018 IEEE Information Theory Workshop. IEEE; 2018:1-5. doi:10.1109/itw.2018.8613428","ieee":"A. Fazeli, H. Hassani, M. Mondelli, and A. Vardy, “Binary linear codes with optimal scaling: Polar codes with large kernels,” in 2018 IEEE Information Theory Workshop, Guangzhou, China, 2018, pp. 1–5.","short":"A. Fazeli, H. Hassani, M. Mondelli, A. Vardy, in:, 2018 IEEE Information Theory Workshop, IEEE, 2018, pp. 1–5.","ista":"Fazeli A, Hassani H, Mondelli M, Vardy A. 2018. Binary linear codes with optimal scaling: Polar codes with large kernels. 2018 IEEE Information Theory Workshop. ITW: Information Theory Workshop, 1–5."},"oa":1,"doi":"10.1109/itw.2018.8613428","publisher":"IEEE","extern":"1","oa_version":"Preprint","conference":{"start_date":"2018-11-25","location":"Guangzhou, China","end_date":"2018-11-29","name":"ITW: Information Theory Workshop"},"external_id":{"arxiv":["1711.01339"]}},{"month":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","date_published":"2018-09-01T00:00:00Z","author":[{"full_name":"Hashemi, Seyyed Ali","first_name":"Seyyed Ali","last_name":"Hashemi"},{"first_name":"Marco","last_name":"Mondelli","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020"},{"first_name":"S. Hamed","last_name":"Hassani","full_name":"Hassani, S. Hamed"},{"last_name":"Condo","first_name":"Carlo","full_name":"Condo, Carlo"},{"last_name":"Urbanke","first_name":"Rudiger L.","full_name":"Urbanke, Rudiger L."},{"first_name":"Warren J.","last_name":"Gross","full_name":"Gross, Warren J."}],"status":"public","intvolume":" 66","date_created":"2019-07-24T08:59:41Z","type":"journal_article","year":"2018","_id":"6674","language":[{"iso":"eng"}],"publication":"IEEE Transactions on Communications","title":"Decoder partitioning: Towards practical list decoding of polar codes","publication_identifier":{"eissn":["1558-0857"]},"issue":"9","doi":"10.1109/tcomm.2018.2832207","publisher":"IEEE","extern":"1","oa_version":"None","day":"01","volume":66,"page":"3749-3759","citation":{"ista":"Hashemi SA, Mondelli M, Hassani SH, Condo C, Urbanke RL, Gross WJ. 2018. Decoder partitioning: Towards practical list decoding of polar codes. IEEE Transactions on Communications. 66(9), 3749–3759.","ieee":"S. A. Hashemi, M. Mondelli, S. H. Hassani, C. Condo, R. L. Urbanke, and W. J. Gross, “Decoder partitioning: Towards practical list decoding of polar codes,” IEEE Transactions on Communications, vol. 66, no. 9. IEEE, pp. 3749–3759, 2018.","short":"S.A. Hashemi, M. Mondelli, S.H. Hassani, C. Condo, R.L. Urbanke, W.J. Gross, IEEE Transactions on Communications 66 (2018) 3749–3759.","chicago":"Hashemi, Seyyed Ali, Marco Mondelli, S. Hamed Hassani, Carlo Condo, Rudiger L. Urbanke, and Warren J. Gross. “Decoder Partitioning: Towards Practical List Decoding of Polar Codes.” IEEE Transactions on Communications. IEEE, 2018. https://doi.org/10.1109/tcomm.2018.2832207.","ama":"Hashemi SA, Mondelli M, Hassani SH, Condo C, Urbanke RL, Gross WJ. Decoder partitioning: Towards practical list decoding of polar codes. IEEE Transactions on Communications. 2018;66(9):3749-3759. doi:10.1109/tcomm.2018.2832207","mla":"Hashemi, Seyyed Ali, et al. “Decoder Partitioning: Towards Practical List Decoding of Polar Codes.” IEEE Transactions on Communications, vol. 66, no. 9, IEEE, 2018, pp. 3749–59, doi:10.1109/tcomm.2018.2832207.","apa":"Hashemi, S. A., Mondelli, M., Hassani, S. H., Condo, C., Urbanke, R. L., & Gross, W. J. (2018). Decoder partitioning: Towards practical list decoding of polar codes. IEEE Transactions on Communications. IEEE. https://doi.org/10.1109/tcomm.2018.2832207"},"abstract":[{"text":"Polar codes represent one of the major recent breakthroughs in coding theory and, because of their attractive features, they have been selected for the incoming 5G standard. As such, a lot of attention has been devoted to the development of decoding algorithms with good error performance and efficient hardware implementation. One of the leading candidates in this regard is represented by successive-cancellation list (SCL) decoding. However, its hardware implementation requires a large amount of memory. Recently, a partitioned SCL (PSCL) decoder has been proposed to significantly reduce the memory consumption. In this paper, we consider the paradigm of PSCL decoding from a practical standpoint, and we provide several improvements. First, by changing the target signal-to-noise ratio and consequently modifying the construction of the code, we are able to improve the performance at no additional computational, latency, or memory cost. Second, we bridge the performance gap between SCL and PSCL decoding by introducing a generalized PSCL decoder and a layered PSCL decoder. In this way, we obtain almost the same performance of the SCL decoder with a significantly lower memory requirement, as testified by hardware implementation results. Third, we present an optimal scheme to allocate cyclic redundancy checks. Finally, we provide a lower bound on the list size that guarantees optimal maximum a posteriori performance for the binary erasure channel.","lang":"eng"}],"date_updated":"2021-01-12T08:08:31Z","quality_controlled":"1"},{"author":[{"full_name":"Mondelli, Marco","last_name":"Mondelli","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020"},{"last_name":"Hassani","first_name":"Hamed","full_name":"Hassani, Hamed"},{"full_name":"Urbanke, Rudiger","last_name":"Urbanke","first_name":"Rudiger"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","date_published":"2018-06-16T00:00:00Z","publication_status":"published","date_created":"2019-07-24T09:10:38Z","status":"public","year":"2018","_id":"6675","related_material":{"record":[{"status":"public","id":"7007","relation":"later_version"}]},"main_file_link":[{"url":"https://arxiv.org/abs/1801.03153","open_access":"1"}],"type":"conference","arxiv":1,"title":"A new coding paradigm for the primitive relay channel","language":[{"iso":"eng"}],"publication":"2018 IEEE International Symposium on Information Theory","external_id":{"arxiv":["1801.03153"]},"publication_identifier":{"eissn":["2157-8117"]},"doi":"10.1109/isit.2018.8437479","extern":"1","publisher":"IEEE","oa_version":"Preprint","conference":{"name":"ISIT: International Symposium on Information Theory ","start_date":"2018-06-17","location":"Vail, CO, United States","end_date":"2018-06-22"},"day":"16","oa":1,"citation":{"apa":"Mondelli, M., Hassani, H., & Urbanke, R. (2018). A new coding paradigm for the primitive relay channel. In 2018 IEEE International Symposium on Information Theory (pp. 351–355). Vail, CO, United States: IEEE. https://doi.org/10.1109/isit.2018.8437479","mla":"Mondelli, Marco, et al. “A New Coding Paradigm for the Primitive Relay Channel.” 2018 IEEE International Symposium on Information Theory, IEEE, 2018, pp. 351–55, doi:10.1109/isit.2018.8437479.","ama":"Mondelli M, Hassani H, Urbanke R. A new coding paradigm for the primitive relay channel. In: 2018 IEEE International Symposium on Information Theory. IEEE; 2018:351-355. doi:10.1109/isit.2018.8437479","chicago":"Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “A New Coding Paradigm for the Primitive Relay Channel.” In 2018 IEEE International Symposium on Information Theory, 351–55. IEEE, 2018. https://doi.org/10.1109/isit.2018.8437479.","ieee":"M. Mondelli, H. Hassani, and R. Urbanke, “A new coding paradigm for the primitive relay channel,” in 2018 IEEE International Symposium on Information Theory, Vail, CO, United States, 2018, pp. 351–355.","short":"M. Mondelli, H. Hassani, R. Urbanke, in:, 2018 IEEE International Symposium on Information Theory, IEEE, 2018, pp. 351–355.","ista":"Mondelli M, Hassani H, Urbanke R. 2018. A new coding paradigm for the primitive relay channel. 2018 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory , 351–355."},"page":"351-355","quality_controlled":"1","abstract":[{"text":"We present a coding paradigm that provides a new achievable rate for the primitive relay channel by combining compress-and-forward and decode-and-forward with a chaining construction. In the primitive relay channel model, the source broadcasts a message to the relay and to the destination; and the relay facilitates this communication by sending an additional message to the destination through a separate channel. Two well-known coding approaches for this setting are decode-and-forward and compress-and-forward: in the former, the relay decodes the message and sends some of the information to the destination; in the latter, the relay does not attempt to decode, but it sends a compressed description of the received sequence to the destination via Wyner-Ziv coding. In our scheme, we transmit over pairs of blocks and we use compress-and-forward for the first block and decode-and-forward for the second. In particular, in the first block, the relay does not attempt to decode and it sends only a part of the compressed description of the received sequence; in the second block, the relay decodes the message and sends this information plus the remaining part of the compressed sequence relative to the first block. As a result, we strictly outperform both compress-and- forward and decode-and-forward. Furthermore, this paradigm can be implemented with a low-complexity polar coding scheme that has the typical attractive features of polar codes, i.e., quasi-linear encoding/decoding complexity and super-polynomial decay of the error probability. Throughout the paper we consider as a running example the special case of the erasure relay channel and we compare the rates achievable by our proposed scheme with the existing upper and lower bounds.","lang":"eng"}],"date_updated":"2023-02-23T12:56:49Z"},{"_id":"6678","year":"2018","type":"journal_article","related_material":{"record":[{"relation":"earlier_version","id":"6740","status":"public"}]},"author":[{"id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","last_name":"Mondelli","first_name":"Marco","full_name":"Mondelli, Marco"},{"full_name":"Hassani, Hamed","last_name":"Hassani","first_name":"Hamed"},{"full_name":"Urbanke, Rudiger ","last_name":"Urbanke","first_name":"Rudiger "}],"publication_status":"published","month":"05","date_created":"2019-07-24T12:38:49Z","intvolume":" 64","page":"3371-3393","volume":64,"citation":{"ista":"Mondelli M, Hassani H, Urbanke R. 2018. How to achieve the capacity of asymmetric channels. IEEE Transactions on Information Theory. 64(5), 3371–3393.","ama":"Mondelli M, Hassani H, Urbanke R. How to achieve the capacity of asymmetric channels. IEEE Transactions on Information Theory. 2018;64(5):3371-3393. doi:10.1109/tit.2018.2789885","chicago":"Mondelli, Marco, Hamed Hassani, and Rudiger Urbanke. “How to Achieve the Capacity of Asymmetric Channels.” IEEE Transactions on Information Theory. IEEE, 2018. https://doi.org/10.1109/tit.2018.2789885.","ieee":"M. Mondelli, H. Hassani, and R. Urbanke, “How to achieve the capacity of asymmetric channels,” IEEE Transactions on Information Theory, vol. 64, no. 5. IEEE, pp. 3371–3393, 2018.","short":"M. Mondelli, H. Hassani, R. Urbanke, IEEE Transactions on Information Theory 64 (2018) 3371–3393.","apa":"Mondelli, M., Hassani, H., & Urbanke, R. (2018). How to achieve the capacity of asymmetric channels. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/tit.2018.2789885","mla":"Mondelli, Marco, et al. “How to Achieve the Capacity of Asymmetric Channels.” IEEE Transactions on Information Theory, vol. 64, no. 5, IEEE, 2018, pp. 3371–93, doi:10.1109/tit.2018.2789885."},"quality_controlled":"1","date_updated":"2023-02-23T12:50:46Z","abstract":[{"text":"We survey coding techniques that enable reliable transmission at rates that approach the capacity of an arbitrary discrete memoryless channel. In particular, we take the point of view of modern coding theory and discuss how recent advances in coding for symmetric channels help provide more efficient solutions for the asymmetric case. We consider, in more detail, three basic coding paradigms. The first one is Gallager's scheme that consists of concatenating a linear code with a non-linear mapping so that the input distribution can be appropriately shaped. We explicitly show that both polar codes and spatially coupled codes can be employed in this scenario. Furthermore, we derive a scaling law between the gap to capacity, the cardinality of the input and output alphabets, and the required size of the mapper. The second one is an integrated scheme in which the code is used both for source coding, in order to create codewords distributed according to the capacity-achieving input distribution, and for channel coding, in order to provide error protection. Such a technique has been recently introduced by Honda and Yamamoto in the context of polar codes, and we show how to apply it also to the design of sparse graph codes. The third paradigm is based on an idea of Böcherer and Mathar, and separates the two tasks of source coding and channel coding by a chaining construction that binds together several codewords. We present conditions for the source code and the channel code, and we describe how to combine any source code with any channel code that fulfill those conditions, in order to provide capacity-achieving schemes for asymmetric channels. In particular, we show that polar codes, spatially coupled codes, and homophonic codes are suitable as basic building blocks of the proposed coding strategy. Rather than focusing on the exact details of the schemes, the purpose of this tutorial is to present different coding techniques that can then be implemented with many variants. There is no absolute winner and, in order to understand the most suitable technique for a specific application scenario, we provide a detailed comparison that takes into account several performance metrics.","lang":"eng"}],"publisher":"IEEE","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1406.7373"}],"title":"How to achieve the capacity of asymmetric channels","arxiv":1,"publication":"IEEE Transactions on Information Theory","language":[{"iso":"eng"}],"article_type":"original","date_published":"2018-05-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","oa":1,"day":"01","external_id":{"arxiv":["1406.7373"]},"issue":"5","publication_identifier":{"issn":["0018-9448","1557-9654"]},"extern":"1","oa_version":"Preprint","doi":"10.1109/tit.2018.2789885"},{"title":"Evolutionary potential of transcription factors for gene regulatory rewiring","article_processing_charge":"No","publication":"Nature Ecology and Evolution","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:47:37Z","ddc":["570"],"status":"public","article_type":"original","date_published":"2018-09-10T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"day":"10","oa_version":"Submitted Version","doi":"10.1038/s41559-018-0651-y","external_id":{"isi":["000447947600021"]},"scopus_import":"1","issue":"10","file":[{"creator":"dernst","file_size":1135973,"date_created":"2020-05-14T11:28:52Z","file_name":"2018_NatureEcology_Igler.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:37Z","file_id":"7830","checksum":"383a2e2c944a856e2e821ec8e7bf71b6","relation":"main_file","content_type":"application/pdf"}],"_id":"67","year":"2018","type":"journal_article","related_material":{"record":[{"status":"public","id":"5585","relation":"popular_science"},{"relation":"dissertation_contains","id":"6371","status":"public"}]},"date_created":"2018-12-11T11:44:27Z","intvolume":" 2","author":[{"first_name":"Claudia","last_name":"Igler","full_name":"Igler, Claudia","id":"46613666-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lagator","first_name":"Mato","full_name":"Lagator, Mato","id":"345D25EC-F248-11E8-B48F-1D18A9856A87"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper","first_name":"Gasper","last_name":"Tkacik"},{"last_name":"Bollback","first_name":"Jonathan P","full_name":"Bollback, Jonathan P","id":"2C6FA9CC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4624-4612"},{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","last_name":"Guet","first_name":"Calin C","full_name":"Guet, Calin C"}],"publication_status":"published","project":[{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"},{"name":"Selective Barriers to Horizontal Gene Transfer","_id":"2578D616-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"648440"},{"grant_number":"24573","_id":"251EE76E-B435-11E9-9278-68D0E5697425","name":"Design principles underlying genetic switch architecture (DOC Fellowship)"}],"ec_funded":1,"isi":1,"month":"09","publist_id":"7987","has_accepted_license":"1","quality_controlled":"1","date_updated":"2024-03-25T23:30:27Z","abstract":[{"text":"Gene regulatory networks evolve through rewiring of individual components—that is, through changes in regulatory connections. However, the mechanistic basis of regulatory rewiring is poorly understood. Using a canonical gene regulatory system, we quantify the properties of transcription factors that determine the evolutionary potential for rewiring of regulatory connections: robustness, tunability and evolvability. In vivo repression measurements of two repressors at mutated operator sites reveal their contrasting evolutionary potential: while robustness and evolvability were positively correlated, both were in trade-off with tunability. Epistatic interactions between adjacent operators alleviated this trade-off. A thermodynamic model explains how the differences in robustness, tunability and evolvability arise from biophysical characteristics of repressor–DNA binding. The model also uncovers that the energy matrix, which describes how mutations affect repressor–DNA binding, encodes crucial information about the evolutionary potential of a repressor. The biophysical determinants of evolutionary potential for regulatory rewiring constitute a mechanistic framework for understanding network evolution.","lang":"eng"}],"citation":{"ieee":"C. Igler, M. Lagator, G. Tkačik, J. P. Bollback, and C. C. Guet, “Evolutionary potential of transcription factors for gene regulatory rewiring,” Nature Ecology and Evolution, vol. 2, no. 10. Nature Publishing Group, pp. 1633–1643, 2018.","ama":"Igler C, Lagator M, Tkačik G, Bollback JP, Guet CC. Evolutionary potential of transcription factors for gene regulatory rewiring. Nature Ecology and Evolution. 2018;2(10):1633-1643. doi:10.1038/s41559-018-0651-y","short":"C. Igler, M. Lagator, G. Tkačik, J.P. Bollback, C.C. Guet, Nature Ecology and Evolution 2 (2018) 1633–1643.","chicago":"Igler, Claudia, Mato Lagator, Gašper Tkačik, Jonathan P Bollback, and Calin C Guet. “Evolutionary Potential of Transcription Factors for Gene Regulatory Rewiring.” Nature Ecology and Evolution. Nature Publishing Group, 2018. https://doi.org/10.1038/s41559-018-0651-y.","mla":"Igler, Claudia, et al. “Evolutionary Potential of Transcription Factors for Gene Regulatory Rewiring.” Nature Ecology and Evolution, vol. 2, no. 10, Nature Publishing Group, 2018, pp. 1633–43, doi:10.1038/s41559-018-0651-y.","apa":"Igler, C., Lagator, M., Tkačik, G., Bollback, J. P., & Guet, C. C. (2018). Evolutionary potential of transcription factors for gene regulatory rewiring. Nature Ecology and Evolution. Nature Publishing Group. https://doi.org/10.1038/s41559-018-0651-y","ista":"Igler C, Lagator M, Tkačik G, Bollback JP, Guet CC. 2018. Evolutionary potential of transcription factors for gene regulatory rewiring. Nature Ecology and Evolution. 2(10), 1633–1643."},"page":"1633 - 1643","volume":2,"publisher":"Nature Publishing Group","department":[{"_id":"CaGu"},{"_id":"GaTk"},{"_id":"JoBo"}]},{"language":[{"iso":"eng"}],"publication":"2018 IEEE Global Communications Conference ","arxiv":1,"title":"On the decoding of polar codes on permuted factor graphs","main_file_link":[{"url":"https://arxiv.org/abs/1806.11195","open_access":"1"}],"type":"conference","year":"2018","_id":"6728","status":"public","date_created":"2019-07-30T06:43:15Z","month":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2018-12-01T00:00:00Z","publication_status":"published","author":[{"full_name":"Doan, Nghia","last_name":"Doan","first_name":"Nghia"},{"last_name":"Hashemi","first_name":"Seyyed Ali","full_name":"Hashemi, Seyyed Ali"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","last_name":"Mondelli","first_name":"Marco","full_name":"Mondelli, Marco"},{"full_name":"Gross, Warren J.","last_name":"Gross","first_name":"Warren J."}],"abstract":[{"lang":"eng","text":"Polar codes are a channel coding scheme for the next generation of wireless communications standard (5G). The belief propagation (BP) decoder allows for parallel decoding of polar codes, making it suitable for high throughput applications. However, the error-correction performance of polar codes under BP decoding is far from the requirements of 5G. It has been shown that the error-correction performance of BP can be improved if the decoding is performed on multiple permuted factor graphs of polar codes. However, a different BP decoding scheduling is required for each factor graph permutation which results in the design of a different decoder for each permutation. Moreover, the selection of the different factor graph permutations is at random, which prevents the decoder to achieve a desirable error correction performance with a small number of permutations. In this paper, we first show that the permutations on the factor graph can be mapped into suitable permutations on the codeword positions. As a result, we can make use of a single decoder for all the permutations. In addition, we introduce a method to construct a set of predetermined permutations which can provide the correct codeword if the decoding fails on the original permutation. We show that for the 5G polar code of length 1024, the error-correction performance of the proposed decoder is more than 0.25 dB better than that of the BP decoder with the same number of random permutations at the frame error rate of 10 -4 ."}],"date_updated":"2021-01-12T08:08:42Z","quality_controlled":"1","day":"01","citation":{"ista":"Doan N, Hashemi SA, Mondelli M, Gross WJ. 2018. On the decoding of polar codes on permuted factor graphs. 2018 IEEE Global Communications Conference . GLOBECOM: Global Communications Conference.","apa":"Doan, N., Hashemi, S. A., Mondelli, M., & Gross, W. J. (2018). On the decoding of polar codes on permuted factor graphs. In 2018 IEEE Global Communications Conference . Abu Dhabi, United Arab Emirates: IEEE. https://doi.org/10.1109/glocom.2018.8647308","mla":"Doan, Nghia, et al. “On the Decoding of Polar Codes on Permuted Factor Graphs.” 2018 IEEE Global Communications Conference , IEEE, 2018, doi:10.1109/glocom.2018.8647308.","ama":"Doan N, Hashemi SA, Mondelli M, Gross WJ. On the decoding of polar codes on permuted factor graphs. In: 2018 IEEE Global Communications Conference . IEEE; 2018. doi:10.1109/glocom.2018.8647308","ieee":"N. Doan, S. A. Hashemi, M. Mondelli, and W. J. Gross, “On the decoding of polar codes on permuted factor graphs,” in 2018 IEEE Global Communications Conference , Abu Dhabi, United Arab Emirates, 2018.","chicago":"Doan, Nghia, Seyyed Ali Hashemi, Marco Mondelli, and Warren J. Gross. “On the Decoding of Polar Codes on Permuted Factor Graphs.” In 2018 IEEE Global Communications Conference . IEEE, 2018. https://doi.org/10.1109/glocom.2018.8647308.","short":"N. Doan, S.A. Hashemi, M. Mondelli, W.J. Gross, in:, 2018 IEEE Global Communications Conference , IEEE, 2018."},"oa":1,"conference":{"end_date":"2018-12-13","start_date":"2018-12-09","location":"Abu Dhabi, United Arab Emirates","name":"GLOBECOM: Global Communications Conference"},"doi":"10.1109/glocom.2018.8647308","extern":"1","oa_version":"Preprint","publisher":"IEEE","publication_identifier":{"isbn":["9781538647271"]},"external_id":{"arxiv":["1806.11195"]}},{"doi":"10.1007/s41468-018-0021-5","oa_version":"Published Version","issue":"3-4","file":[{"creator":"dernst","file_size":1056278,"date_created":"2019-08-08T06:55:21Z","file_name":"2018_JourAppliedComputTopology_Filakovsky.pdf","date_updated":"2020-07-14T12:47:40Z","access_level":"open_access","checksum":"cf9e7fcd2a113dd4828774fc75cdb7e8","file_id":"6775","content_type":"application/pdf","relation":"main_file"}],"publication_identifier":{"eissn":["2367-1734"],"issn":["2367-1726"]},"day":"01","oa":1,"ddc":["514"],"status":"public","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2018-12-01T00:00:00Z","title":"Computing simplicial representatives of homotopy group elements","language":[{"iso":"eng"}],"publication":"Journal of Applied and Computational Topology","file_date_updated":"2020-07-14T12:47:40Z","publisher":"Springer","department":[{"_id":"UlWa"}],"has_accepted_license":"1","quality_controlled":"1","abstract":[{"text":"A central problem of algebraic topology is to understand the homotopy groups 𝜋𝑑(𝑋) of a topological space X. For the computational version of the problem, it is well known that there is no algorithm to decide whether the fundamental group 𝜋1(𝑋) of a given finite simplicial complex X is trivial. On the other hand, there are several algorithms that, given a finite simplicial complex X that is simply connected (i.e., with 𝜋1(𝑋) trivial), compute the higher homotopy group 𝜋𝑑(𝑋) for any given 𝑑≥2 . However, these algorithms come with a caveat: They compute the isomorphism type of 𝜋𝑑(𝑋) , 𝑑≥2 as an abstract finitely generated abelian group given by generators and relations, but they work with very implicit representations of the elements of 𝜋𝑑(𝑋) . Converting elements of this abstract group into explicit geometric maps from the d-dimensional sphere 𝑆𝑑 to X has been one of the main unsolved problems in the emerging field of computational homotopy theory. Here we present an algorithm that, given a simply connected space X, computes 𝜋𝑑(𝑋) and represents its elements as simplicial maps from a suitable triangulation of the d-sphere 𝑆𝑑 to X. For fixed d, the algorithm runs in time exponential in size(𝑋) , the number of simplices of X. Moreover, we prove that this is optimal: For every fixed 𝑑≥2 , we construct a family of simply connected spaces X such that for any simplicial map representing a generator of 𝜋𝑑(𝑋) , the size of the triangulation of 𝑆𝑑 on which the map is defined, is exponential in size(𝑋) .","lang":"eng"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-09-07T13:10:36Z","page":"177-231","volume":2,"citation":{"mla":"Filakovský, Marek, et al. “Computing Simplicial Representatives of Homotopy Group Elements.” Journal of Applied and Computational Topology, vol. 2, no. 3–4, Springer, 2018, pp. 177–231, doi:10.1007/s41468-018-0021-5.","apa":"Filakovský, M., Franek, P., Wagner, U., & Zhechev, S. Y. (2018). Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. Springer. https://doi.org/10.1007/s41468-018-0021-5","short":"M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and Computational Topology 2 (2018) 177–231.","ieee":"M. Filakovský, P. Franek, U. Wagner, and S. Y. Zhechev, “Computing simplicial representatives of homotopy group elements,” Journal of Applied and Computational Topology, vol. 2, no. 3–4. Springer, pp. 177–231, 2018.","chicago":"Filakovský, Marek, Peter Franek, Uli Wagner, and Stephan Y Zhechev. “Computing Simplicial Representatives of Homotopy Group Elements.” Journal of Applied and Computational Topology. Springer, 2018. https://doi.org/10.1007/s41468-018-0021-5.","ama":"Filakovský M, Franek P, Wagner U, Zhechev SY. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2018;2(3-4):177-231. doi:10.1007/s41468-018-0021-5","ista":"Filakovský M, Franek P, Wagner U, Zhechev SY. 2018. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2(3–4), 177–231."},"date_created":"2019-08-08T06:47:40Z","intvolume":" 2","author":[{"first_name":"Marek","last_name":"Filakovský","full_name":"Filakovský, Marek","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87"},{"id":"473294AE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8878-8397","full_name":"Franek, Peter","last_name":"Franek","first_name":"Peter"},{"orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","first_name":"Uli","full_name":"Wagner, Uli"},{"id":"3AA52972-F248-11E8-B48F-1D18A9856A87","first_name":"Stephan Y","last_name":"Zhechev","full_name":"Zhechev, Stephan Y"}],"month":"12","project":[{"_id":"25F8B9BC-B435-11E9-9278-68D0E5697425","name":"Robust invariants of Nonlinear Systems","grant_number":"M01980","call_identifier":"FWF"},{"_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","name":"FWF Open Access Fund","call_identifier":"FWF"}],"publication_status":"published","year":"2018","_id":"6774","related_material":{"record":[{"id":"6681","status":"public","relation":"dissertation_contains"}]},"type":"journal_article"},{"language":[{"iso":"eng"}],"article_processing_charge":"No","title":"Learning from dependent data","file_date_updated":"2020-07-14T12:47:40Z","status":"public","ddc":["004","519"],"date_published":"2018-09-01T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","alternative_title":["ISTA Thesis"],"degree_awarded":"PhD","oa":1,"day":"01","oa_version":"Published Version","doi":"10.15479/AT:ISTA:TH1048","publication_identifier":{"issn":["2663-337X"]},"file":[{"creator":"dernst","file_size":1036137,"date_created":"2019-04-09T07:32:47Z","file_name":"2018_Thesis_Zimin.pdf","file_id":"6253","checksum":"e849dd40a915e4d6c5572b51b517f098","date_updated":"2020-07-14T12:47:40Z","access_level":"open_access","content_type":"application/pdf","relation":"main_file"},{"date_created":"2019-04-09T07:32:47Z","file_size":637490,"creator":"dernst","content_type":"application/zip","relation":"source_file","file_id":"6254","checksum":"da092153cec55c97461bd53c45c5d139","date_updated":"2020-07-14T12:47:40Z","access_level":"closed","file_name":"2018_Thesis_Zimin_Source.zip"}],"type":"dissertation","year":"2018","_id":"68","date_created":"2018-12-11T11:44:27Z","project":[{"_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding","call_identifier":"FP7","grant_number":"308036"}],"publication_status":"published","month":"09","ec_funded":1,"author":[{"first_name":"Alexander","last_name":"Zimin","full_name":"Zimin, Alexander","id":"37099E9C-F248-11E8-B48F-1D18A9856A87"}],"supervisor":[{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert"}],"date_updated":"2023-09-07T12:29:07Z","abstract":[{"lang":"eng","text":"The most common assumption made in statistical learning theory is the assumption of the independent and identically distributed (i.i.d.) data. While being very convenient mathematically, it is often very clearly violated in practice. This disparity between the machine learning theory and applications underlies a growing demand in the development of algorithms that learn from dependent data and theory that can provide generalization guarantees similar to the independent situations. This thesis is dedicated to two variants of dependencies that can arise in practice. One is a dependence on the level of samples in a single learning task. Another dependency type arises in the multi-task setting when the tasks are dependent on each other even though the data for them can be i.i.d. In both cases we model the data (samples or tasks) as stochastic processes and introduce new algorithms for both settings that take into account and exploit the resulting dependencies. We prove the theoretical guarantees on the performance of the introduced algorithms under different evaluation criteria and, in addition, we compliment the theoretical study by the empirical one, where we evaluate some of the algorithms on two real world datasets to highlight their practical applicability."}],"publist_id":"7986","has_accepted_license":"1","citation":{"ieee":"A. Zimin, “Learning from dependent data,” Institute of Science and Technology Austria, 2018.","chicago":"Zimin, Alexander. “Learning from Dependent Data.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH1048.","short":"A. Zimin, Learning from Dependent Data, Institute of Science and Technology Austria, 2018.","ama":"Zimin A. Learning from dependent data. 2018. doi:10.15479/AT:ISTA:TH1048","mla":"Zimin, Alexander. Learning from Dependent Data. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH1048.","apa":"Zimin, A. (2018). Learning from dependent data. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH1048","ista":"Zimin A. 2018. Learning from dependent data. Institute of Science and Technology Austria."},"page":"92","pubrep_id":"1048","publisher":"Institute of Science and Technology Austria","department":[{"_id":"ChLa"}]},{"day":"01","oa":1,"degree_awarded":"PhD","file":[{"file_name":"2018_Thesis_Vukusic.pdf","relation":"main_file","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:44Z","file_id":"6247","checksum":"c570b656e30749cd65b1c7e13a9ce0a8","creator":"dernst","date_created":"2019-04-09T07:00:40Z","file_size":28452385},{"relation":"source_file","content_type":"application/zip","access_level":"closed","date_updated":"2020-07-14T12:47:44Z","checksum":"7856771d9cd401fe0b311191076db6e1","file_id":"6248","file_name":"2018_Thesis_Vukusic_source.zip","date_created":"2019-04-09T07:00:40Z","file_size":53058704,"creator":"dernst"}],"publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/AT:ISTA:TH_1047","oa_version":"Published Version","file_date_updated":"2020-07-14T12:47:44Z","language":[{"iso":"eng"}],"article_processing_charge":"No","title":"Charge sensing and spin relaxation times of holes in Ge hut wires","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","alternative_title":["ISTA Thesis"],"date_published":"2018-09-01T00:00:00Z","status":"public","ddc":["530","600"],"page":"103","pubrep_id":"1047","citation":{"chicago":"Vukušić, Lada. “Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires.” Institute of Science and Technology Austria, 2018. https://doi.org/10.15479/AT:ISTA:TH_1047.","short":"L. Vukušić, Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires, Institute of Science and Technology Austria, 2018.","ieee":"L. Vukušić, “Charge sensing and spin relaxation times of holes in Ge hut wires,” Institute of Science and Technology Austria, 2018.","ama":"Vukušić L. Charge sensing and spin relaxation times of holes in Ge hut wires. 2018. doi:10.15479/AT:ISTA:TH_1047","mla":"Vukušić, Lada. Charge Sensing and Spin Relaxation Times of Holes in Ge Hut Wires. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1047.","apa":"Vukušić, L. (2018). Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:TH_1047","ista":"Vukušić L. 2018. Charge sensing and spin relaxation times of holes in Ge hut wires. Institute of Science and Technology Austria."},"abstract":[{"lang":"eng","text":"A qubit, a unit of quantum information, is essentially any quantum mechanical two-level system which can be coherently controlled. Still, to be used for computation, it has to fulfill criteria. Qubits, regardless of the system in which they are realized, suffer from decoherence. This leads to loss of the information stored in the qubit. The upper bound of the time scale on which decoherence happens is set by the spin relaxation time. In this thesis I studied a two-level system consisting of a Zeeman-split hole spin confined in a quantum dot formed in a Ge hut wire. Such Ge hut wires have emerged as a promising material system for the realization of spin qubits, due to the combination of two significant properties: long spin coherence time as expected for group IV semiconductors due to the low hyperfine interaction and a strong valence band spin-orbit coupling. Here, I present how to fabricate quantum dot devices suitable for electrical transport measurements. Coupled quantum dot devices allowed the realization of a charge sensor, which is electrostatically and tunnel coupled to a quantum dot. By integrating the charge sensor into a radio-frequency reflectometry setup, I performed for the first time single-shot readout measurements of hole spins and extracted the hole spin relaxation times in Ge hut wires."}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-09-26T15:50:22Z","supervisor":[{"full_name":"Katsaros, Georgios","last_name":"Katsaros","first_name":"Georgios","orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87"}],"publist_id":"7985","has_accepted_license":"1","department":[{"_id":"GeKa"},{"_id":"GradSch"}],"publisher":"Institute of Science and Technology Austria","related_material":{"record":[{"id":"23","status":"public","relation":"part_of_dissertation"},{"status":"public","id":"840","relation":"part_of_dissertation"}]},"type":"dissertation","_id":"69","year":"2018","month":"09","publication_status":"published","author":[{"last_name":"Vukušić","first_name":"Lada","full_name":"Vukušić, Lada","orcid":"0000-0003-2424-8636","id":"31E9F056-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2018-12-11T11:44:28Z"},{"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2018-06-14T00:00:00Z","arxiv":1,"title":"Local law and Tracy–Widom limit for sparse random matrices","language":[{"iso":"eng"}],"publication":"Probability Theory and Related Fields","main_file_link":[{"url":"https://arxiv.org/abs/1605.08767","open_access":"1"}],"doi":"10.1007/s00440-017-0787-8","oa_version":"Preprint","issue":"1-2","scopus_import":1,"external_id":{"arxiv":["1605.08767"]},"day":"14","oa":1,"date_created":"2018-12-11T11:47:56Z","intvolume":" 171","author":[{"full_name":"Lee, Jii","last_name":"Lee","first_name":"Jii"},{"first_name":"Kevin","last_name":"Schnelli","full_name":"Schnelli, Kevin","id":"434AD0AE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0954-3231"}],"month":"06","ec_funded":1,"publication_status":"published","project":[{"grant_number":"338804","call_identifier":"FP7","name":"Random matrices, universality and disordered quantum systems","_id":"258DCDE6-B435-11E9-9278-68D0E5697425"}],"_id":"690","year":"2018","article_number":"543-616","type":"journal_article","publisher":"Springer","department":[{"_id":"LaEr"}],"quality_controlled":"1","publist_id":"7017","abstract":[{"lang":"eng","text":"We consider spectral properties and the edge universality of sparse random matrices, the class of random matrices that includes the adjacency matrices of the Erdős–Rényi graph model G(N, p). We prove a local law for the eigenvalue density up to the spectral edges. Under a suitable condition on the sparsity, we also prove that the rescaled extremal eigenvalues exhibit GOE Tracy–Widom fluctuations if a deterministic shift of the spectral edge due to the sparsity is included. For the adjacency matrix of the Erdős–Rényi graph this establishes the Tracy–Widom fluctuations of the second largest eigenvalue when p is much larger than N−2/3 with a deterministic shift of order (Np)−1."}],"date_updated":"2021-01-12T08:09:33Z","citation":{"ista":"Lee J, Schnelli K. 2018. Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. 171(1–2), 543–616.","mla":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” Probability Theory and Related Fields, vol. 171, no. 1–2, 543–616, Springer, 2018, doi:10.1007/s00440-017-0787-8.","apa":"Lee, J., & Schnelli, K. (2018). Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. Springer. https://doi.org/10.1007/s00440-017-0787-8","ieee":"J. Lee and K. Schnelli, “Local law and Tracy–Widom limit for sparse random matrices,” Probability Theory and Related Fields, vol. 171, no. 1–2. Springer, 2018.","short":"J. Lee, K. Schnelli, Probability Theory and Related Fields 171 (2018).","chicago":"Lee, Jii, and Kevin Schnelli. “Local Law and Tracy–Widom Limit for Sparse Random Matrices.” Probability Theory and Related Fields. Springer, 2018. https://doi.org/10.1007/s00440-017-0787-8.","ama":"Lee J, Schnelli K. Local law and Tracy–Widom limit for sparse random matrices. Probability Theory and Related Fields. 2018;171(1-2). doi:10.1007/s00440-017-0787-8"},"volume":171},{"type":"journal_article","year":"2018","_id":"691","intvolume":" 55","date_created":"2018-12-11T11:47:57Z","month":"01","isi":1,"publication_status":"published","project":[{"grant_number":"401299","name":"Probing development and reversibility of autism spectrum disorders","_id":"254BA948-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Marin Valencia, Isaac","first_name":"Isaac","last_name":"Marin Valencia"},{"last_name":"Novarino","first_name":"Gaia","full_name":"Novarino, Gaia","orcid":"0000-0002-7673-7178","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Anide","last_name":"Johansen","full_name":"Johansen, Anide"},{"full_name":"Rosti, Başak","first_name":"Başak","last_name":"Rosti"},{"first_name":"Mahmoud","last_name":"Issa","full_name":"Issa, Mahmoud"},{"last_name":"Musaev","first_name":"Damir","full_name":"Musaev, Damir"},{"full_name":"Bhat, Gifty","last_name":"Bhat","first_name":"Gifty"},{"full_name":"Scott, Eric","last_name":"Scott","first_name":"Eric"},{"first_name":"Jennifer","last_name":"Silhavy","full_name":"Silhavy, Jennifer"},{"full_name":"Stanley, Valentina","last_name":"Stanley","first_name":"Valentina"},{"full_name":"Rosti, Rasim","last_name":"Rosti","first_name":"Rasim"},{"first_name":"Jeremy","last_name":"Gleeson","full_name":"Gleeson, Jeremy"},{"last_name":"Imam","first_name":"Farhad","full_name":"Imam, Farhad"},{"last_name":"Zaki","first_name":"Maha","full_name":"Zaki, Maha"},{"full_name":"Gleeson, Joseph","last_name":"Gleeson","first_name":"Joseph"}],"abstract":[{"lang":"eng","text":"Background: Transport protein particle (TRAPP) is a multisubunit complex that regulates membrane trafficking through the Golgi apparatus. The clinical phenotype associated with mutations in various TRAPP subunits has allowed elucidation of their functions in specific tissues. The role of some subunits in human disease, however, has not been fully established, and their functions remain uncertain.\r\n\r\nObjective: We aimed to expand the range of neurodevelopmental disorders associated with mutations in TRAPP subunits by exome sequencing of consanguineous families.\r\n\r\nMethods: Linkage and homozygosity mapping and candidate gene analysis were used to identify homozygous mutations in families. Patient fibroblasts were used to study splicing defect and zebrafish to model the disease.\r\n\r\nResults: We identified six individuals from three unrelated families with a founder homozygous splice mutation in TRAPPC6B, encoding a core subunit of the complex TRAPP I. Patients manifested a neurodevelopmental disorder characterised by microcephaly, epilepsy and autistic features, and showed splicing defect. Zebrafish trappc6b morphants replicated the human phenotype, displaying decreased head size and neuronal hyperexcitability, leading to a lower seizure threshold.\r\n\r\nConclusion: This study provides clinical and functional evidence of the role of TRAPPC6B in brain development and function."}],"date_updated":"2023-10-16T09:55:43Z","publist_id":"7016","quality_controlled":"1","page":"48 - 54","volume":55,"citation":{"mla":"Marin Valencia, Isaac, et al. “A Homozygous Founder Mutation in TRAPPC6B Associates with a Neurodevelopmental Disorder Characterised by Microcephaly Epilepsy and Autistic Features.” Journal of Medical Genetics, vol. 55, no. 1, BMJ Publishing Group, 2018, pp. 48–54, doi:10.1136/jmedgenet-2017-104627.","apa":"Marin Valencia, I., Novarino, G., Johansen, A., Rosti, B., Issa, M., Musaev, D., … Gleeson, J. (2018). A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features. Journal of Medical Genetics. BMJ Publishing Group. https://doi.org/10.1136/jmedgenet-2017-104627","short":"I. Marin Valencia, G. Novarino, A. Johansen, B. Rosti, M. Issa, D. Musaev, G. Bhat, E. Scott, J. Silhavy, V. Stanley, R. Rosti, J. Gleeson, F. Imam, M. Zaki, J. Gleeson, Journal of Medical Genetics 55 (2018) 48–54.","chicago":"Marin Valencia, Isaac, Gaia Novarino, Anide Johansen, Başak Rosti, Mahmoud Issa, Damir Musaev, Gifty Bhat, et al. “A Homozygous Founder Mutation in TRAPPC6B Associates with a Neurodevelopmental Disorder Characterised by Microcephaly Epilepsy and Autistic Features.” Journal of Medical Genetics. BMJ Publishing Group, 2018. https://doi.org/10.1136/jmedgenet-2017-104627.","ama":"Marin Valencia I, Novarino G, Johansen A, et al. A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features. Journal of Medical Genetics. 2018;55(1):48-54. doi:10.1136/jmedgenet-2017-104627","ieee":"I. Marin Valencia et al., “A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features,” Journal of Medical Genetics, vol. 55, no. 1. BMJ Publishing Group, pp. 48–54, 2018.","ista":"Marin Valencia I, Novarino G, Johansen A, Rosti B, Issa M, Musaev D, Bhat G, Scott E, Silhavy J, Stanley V, Rosti R, Gleeson J, Imam F, Zaki M, Gleeson J. 2018. A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features. Journal of Medical Genetics. 55(1), 48–54."},"pmid":1,"publisher":"BMJ Publishing Group","department":[{"_id":"GaNo"}],"language":[{"iso":"eng"}],"publication":"Journal of Medical Genetics","article_processing_charge":"No","title":"A homozygous founder mutation in TRAPPC6B associates with a neurodevelopmental disorder characterised by microcephaly epilepsy and autistic features","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6056005/"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2018-01-01T00:00:00Z","article_type":"original","day":"01","oa":1,"doi":"10.1136/jmedgenet-2017-104627","oa_version":"Submitted Version","publication_identifier":{"issn":["0022-2593"]},"scopus_import":"1","issue":"1","external_id":{"isi":["000418199800007"],"pmid":["28626029"]}},{"file":[{"file_id":"7222","checksum":"1febcfc1266486053a069e3425ea3713","date_updated":"2020-07-14T12:47:44Z","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"2018_Springer_Akopyan.pdf","file_size":1140860,"date_created":"2020-01-03T11:35:08Z","creator":"kschuh"}],"external_id":{"isi":["000431418800004"]},"issue":"1","scopus_import":"1","oa_version":"Published Version","doi":"10.1007/s10711-017-0265-6","oa":1,"day":"01","date_published":"2018-06-01T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_type":"original","status":"public","ddc":["510"],"file_date_updated":"2020-07-14T12:47:44Z","publication":"Geometriae Dedicata","language":[{"iso":"eng"}],"title":"3-Webs generated by confocal conics and circles","article_processing_charge":"Yes (via OA deal)","department":[{"_id":"HeEd"}],"publisher":"Springer","volume":194,"page":"55 - 64","citation":{"apa":"Akopyan, A. (2018). 3-Webs generated by confocal conics and circles. Geometriae Dedicata. Springer. https://doi.org/10.1007/s10711-017-0265-6","mla":"Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae Dedicata, vol. 194, no. 1, Springer, 2018, pp. 55–64, doi:10.1007/s10711-017-0265-6.","ieee":"A. Akopyan, “3-Webs generated by confocal conics and circles,” Geometriae Dedicata, vol. 194, no. 1. Springer, pp. 55–64, 2018.","short":"A. Akopyan, Geometriae Dedicata 194 (2018) 55–64.","ama":"Akopyan A. 3-Webs generated by confocal conics and circles. Geometriae Dedicata. 2018;194(1):55-64. doi:10.1007/s10711-017-0265-6","chicago":"Akopyan, Arseniy. “3-Webs Generated by Confocal Conics and Circles.” Geometriae Dedicata. Springer, 2018. https://doi.org/10.1007/s10711-017-0265-6.","ista":"Akopyan A. 2018. 3-Webs generated by confocal conics and circles. Geometriae Dedicata. 194(1), 55–64."},"date_updated":"2023-09-08T11:40:29Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"abstract":[{"text":"We consider families of confocal conics and two pencils of Apollonian circles having the same foci. We will show that these families of curves generate trivial 3-webs and find the exact formulas describing them.","lang":"eng"}],"has_accepted_license":"1","quality_controlled":"1","publist_id":"7014","publication_status":"published","project":[{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"month":"06","isi":1,"author":[{"id":"430D2C90-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2548-617X","first_name":"Arseniy","last_name":"Akopyan","full_name":"Akopyan, Arseniy"}],"intvolume":" 194","date_created":"2018-12-11T11:47:57Z","type":"journal_article","_id":"692","year":"2018"},{"volume":10957,"citation":{"ista":"Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. 2018. SpaceMint: A cryptocurrency based on proofs of space. 22nd International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 10957, 480–499.","chicago":"Park, Sunoo, Albert Kwon, Georg Fuchsbauer, Peter Gazi, Joel F Alwen, and Krzysztof Z Pietrzak. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” In 22nd International Conference on Financial Cryptography and Data Security, 10957:480–99. Springer Nature, 2018. https://doi.org/10.1007/978-3-662-58387-6_26.","ama":"Park S, Kwon A, Fuchsbauer G, Gazi P, Alwen JF, Pietrzak KZ. SpaceMint: A cryptocurrency based on proofs of space. In: 22nd International Conference on Financial Cryptography and Data Security. Vol 10957. Springer Nature; 2018:480-499. doi:10.1007/978-3-662-58387-6_26","short":"S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J.F. Alwen, K.Z. Pietrzak, in:, 22nd International Conference on Financial Cryptography and Data Security, Springer Nature, 2018, pp. 480–499.","ieee":"S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J. F. Alwen, and K. Z. Pietrzak, “SpaceMint: A cryptocurrency based on proofs of space,” in 22nd International Conference on Financial Cryptography and Data Security, Nieuwpoort, Curacao, 2018, vol. 10957, pp. 480–499.","mla":"Park, Sunoo, et al. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” 22nd International Conference on Financial Cryptography and Data Security, vol. 10957, Springer Nature, 2018, pp. 480–99, doi:10.1007/978-3-662-58387-6_26.","apa":"Park, S., Kwon, A., Fuchsbauer, G., Gazi, P., Alwen, J. F., & Pietrzak, K. Z. (2018). SpaceMint: A cryptocurrency based on proofs of space. In 22nd International Conference on Financial Cryptography and Data Security (Vol. 10957, pp. 480–499). Nieuwpoort, Curacao: Springer Nature. https://doi.org/10.1007/978-3-662-58387-6_26"},"page":"480-499","quality_controlled":"1","abstract":[{"lang":"eng","text":"Bitcoin has become the most successful cryptocurrency ever deployed, and its most distinctive feature is that it is decentralized. Its underlying protocol (Nakamoto consensus) achieves this by using proof of work, which has the drawback that it causes the consumption of vast amounts of energy to maintain the ledger. Moreover, Bitcoin mining dynamics have become less distributed over time.\r\n\r\nTowards addressing these issues, we propose SpaceMint, a cryptocurrency based on proofs of space instead of proofs of work. Miners in SpaceMint dedicate disk space rather than computation. We argue that SpaceMint’s design solves or alleviates several of Bitcoin’s issues: most notably, its large energy consumption. SpaceMint also rewards smaller miners fairly according to their contribution to the network, thus incentivizing more distributed participation.\r\n\r\nThis paper adapts proof of space to enable its use in cryptocurrency, studies the attacks that can arise against a Bitcoin-like blockchain that uses proof of space, and proposes a new blockchain format and transaction types to address these attacks. Our prototype shows that initializing 1 TB for mining takes about a day (a one-off setup cost), and miners spend on average just a fraction of a second per block mined. Finally, we provide a game-theoretic analysis modeling SpaceMint as an extensive game (the canonical game-theoretic notion for games that take place over time) and show that this stylized game satisfies a strong equilibrium notion, thereby arguing for SpaceMint ’s stability and consensus."}],"date_updated":"2023-09-19T15:02:13Z","department":[{"_id":"KrPi"}],"publisher":"Springer Nature","conference":{"name":"FC: Financial Cryptography and Data Security","location":"Nieuwpoort, Curacao","start_date":"2018-02-26","end_date":"2018-03-02"},"_id":"6941","year":"2018","type":"conference","author":[{"full_name":"Park, Sunoo","last_name":"Park","first_name":"Sunoo"},{"first_name":"Albert","last_name":"Kwon","full_name":"Kwon, Albert"},{"full_name":"Fuchsbauer, Georg","first_name":"Georg","last_name":"Fuchsbauer","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87"},{"id":"3E0BFE38-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Gazi","full_name":"Gazi, Peter"},{"full_name":"Alwen, Joel F","last_name":"Alwen","first_name":"Joel F","id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z"}],"month":"12","isi":1,"ec_funded":1,"publication_status":"published","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","grant_number":"682815"}],"date_created":"2019-10-14T06:35:38Z","intvolume":" 10957","day":"07","oa":1,"scopus_import":"1","external_id":{"isi":["000540656400026"]},"publication_identifier":{"isbn":["9783662583869","9783662583876"],"issn":["0302-9743"],"eissn":["1611-3349"]},"doi":"10.1007/978-3-662-58387-6_26","oa_version":"Submitted Version","main_file_link":[{"url":"https://eprint.iacr.org/2015/528","open_access":"1"}],"title":"SpaceMint: A cryptocurrency based on proofs of space","article_processing_charge":"No","language":[{"iso":"eng"}],"publication":"22nd International Conference on Financial Cryptography and Data Security","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","alternative_title":["LNCS"],"date_published":"2018-12-07T00:00:00Z","status":"public"},{"year":"2018","_id":"7","type":"journal_article","related_material":{"record":[{"id":"13055","status":"public","relation":"research_data"}],"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/for-ants-unity-is-strength-and-health/","description":"News on IST Homepage"}]},"author":[{"last_name":"Stroeymeyt","first_name":"Nathalie","full_name":"Stroeymeyt, Nathalie"},{"last_name":"Grasse","first_name":"Anna V","full_name":"Grasse, Anna V","id":"406F989C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alessandro","last_name":"Crespi","full_name":"Crespi, Alessandro"},{"full_name":"Mersch, Danielle","first_name":"Danielle","last_name":"Mersch"},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia","last_name":"Cremer","first_name":"Sylvia"},{"full_name":"Keller, Laurent","first_name":"Laurent","last_name":"Keller"}],"publication_status":"published","project":[{"_id":"25DC711C-B435-11E9-9278-68D0E5697425","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects","call_identifier":"FP7","grant_number":"243071"}],"isi":1,"month":"11","ec_funded":1,"date_created":"2018-12-11T11:44:07Z","intvolume":" 362","citation":{"ama":"Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. Social network plasticity decreases disease transmission in a eusocial insect. Science. 2018;362(6417):941-945. doi:10.1126/science.aat4793","chicago":"Stroeymeyt, Nathalie, Anna V Grasse, Alessandro Crespi, Danielle Mersch, Sylvia Cremer, and Laurent Keller. “Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect.” Science. AAAS, 2018. https://doi.org/10.1126/science.aat4793.","short":"N. Stroeymeyt, A.V. Grasse, A. Crespi, D. Mersch, S. Cremer, L. Keller, Science 362 (2018) 941–945.","ieee":"N. Stroeymeyt, A. V. Grasse, A. Crespi, D. Mersch, S. Cremer, and L. Keller, “Social network plasticity decreases disease transmission in a eusocial insect,” Science, vol. 362, no. 6417. AAAS, pp. 941–945, 2018.","apa":"Stroeymeyt, N., Grasse, A. V., Crespi, A., Mersch, D., Cremer, S., & Keller, L. (2018). Social network plasticity decreases disease transmission in a eusocial insect. Science. AAAS. https://doi.org/10.1126/science.aat4793","mla":"Stroeymeyt, Nathalie, et al. “Social Network Plasticity Decreases Disease Transmission in a Eusocial Insect.” Science, vol. 362, no. 6417, AAAS, 2018, pp. 941–45, doi:10.1126/science.aat4793.","ista":"Stroeymeyt N, Grasse AV, Crespi A, Mersch D, Cremer S, Keller L. 2018. Social network plasticity decreases disease transmission in a eusocial insect. Science. 362(6417), 941–945."},"page":"941 - 945","volume":362,"quality_controlled":"1","publist_id":"8049","date_updated":"2023-10-17T11:50:05Z","abstract":[{"lang":"eng","text":"Animal social networks are shaped by multiple selection pressures, including the need to ensure efficient communication and functioning while simultaneously limiting disease transmission. Social animals could potentially further reduce epidemic risk by altering their social networks in the presence of pathogens, yet there is currently no evidence for such pathogen-triggered responses. We tested this hypothesis experimentally in the ant Lasius niger using a combination of automated tracking, controlled pathogen exposure, transmission quantification, and temporally explicit simulations. Pathogen exposure induced behavioral changes in both exposed ants and their nestmates, which helped contain the disease by reinforcing key transmission-inhibitory properties of the colony's contact network. This suggests that social network plasticity in response to pathogens is an effective strategy for mitigating the effects of disease in social groups."}],"department":[{"_id":"SyCr"}],"publisher":"AAAS","main_file_link":[{"open_access":"1","url":"https://serval.unil.ch/resource/serval:BIB_E9228C205467.P001/REF.pdf"}],"title":"Social network plasticity decreases disease transmission in a eusocial insect","article_processing_charge":"No","publication":"Science","language":[{"iso":"eng"}],"article_type":"original","date_published":"2018-11-23T00:00:00Z","acknowledgement":"This project was funded by two European Research Council Advanced Grants (Social Life, 249375, and resiliANT, 741491) and two Swiss National Science Foundation grants (CR32I3_141063 and 310030_156732) to L.K. and a European Research Council Starting Grant (SocialVaccines, 243071) to S.C.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","oa":1,"day":"23","external_id":{"isi":["000451124500041"]},"scopus_import":"1","issue":"6417","publication_identifier":{"issn":["1095-9203"]},"oa_version":"Published Version","doi":"10.1126/science.aat4793"},{"type":"journal_article","year":"2018","_id":"70","intvolume":" 15","date_created":"2018-12-11T11:44:28Z","publication_status":"published","project":[{"grant_number":"338804","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","name":"Random matrices, universality and disordered quantum systems"},{"call_identifier":"H2020","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"isi":1,"month":"10","author":[{"full_name":"Nejjar, Peter","last_name":"Nejjar","first_name":"Peter","id":"4BF426E2-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-10-10T13:11:29Z","abstract":[{"text":"We consider the totally asymmetric simple exclusion process in a critical scaling parametrized by a≥0, which creates a shock in the particle density of order aT−1/3, T the observation time. When starting from step initial data, we provide bounds on the limiting law which in particular imply that in the double limit lima→∞limT→∞ one recovers the product limit law and the degeneration of the correlation length observed at shocks of order 1. This result is shown to apply to a general last-passage percolation model. We also obtain bounds on the two-point functions of several airy processes.","lang":"eng"}],"quality_controlled":"1","has_accepted_license":"1","volume":15,"citation":{"ista":"Nejjar P. 2018. Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. 15(2), 1311–1334.","apa":"Nejjar, P. (2018). Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. Instituto Nacional de Matematica Pura e Aplicada. https://doi.org/10.30757/ALEA.v15-49","mla":"Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage Times.” Latin American Journal of Probability and Mathematical Statistics, vol. 15, no. 2, Instituto Nacional de Matematica Pura e Aplicada, 2018, pp. 1311–34, doi:10.30757/ALEA.v15-49.","short":"P. Nejjar, Latin American Journal of Probability and Mathematical Statistics 15 (2018) 1311–1334.","chicago":"Nejjar, Peter. “Transition to Shocks in TASEP and Decoupling of Last Passage Times.” Latin American Journal of Probability and Mathematical Statistics. Instituto Nacional de Matematica Pura e Aplicada, 2018. https://doi.org/10.30757/ALEA.v15-49.","ieee":"P. Nejjar, “Transition to shocks in TASEP and decoupling of last passage times,” Latin American Journal of Probability and Mathematical Statistics, vol. 15, no. 2. Instituto Nacional de Matematica Pura e Aplicada, pp. 1311–1334, 2018.","ama":"Nejjar P. Transition to shocks in TASEP and decoupling of last passage times. Latin American Journal of Probability and Mathematical Statistics. 2018;15(2):1311-1334. doi:10.30757/ALEA.v15-49"},"page":"1311-1334","publisher":"Instituto Nacional de Matematica Pura e Aplicada","department":[{"_id":"LaEr"},{"_id":"JaMa"}],"publication":"Latin American Journal of Probability and Mathematical Statistics","language":[{"iso":"eng"}],"article_processing_charge":"No","title":"Transition to shocks in TASEP and decoupling of last passage times","arxiv":1,"file_date_updated":"2020-07-14T12:47:46Z","status":"public","ddc":["510"],"date_published":"2018-10-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","oa":1,"day":"01","oa_version":"Published Version","doi":"10.30757/ALEA.v15-49","file":[{"creator":"kschuh","date_created":"2019-02-14T09:44:10Z","file_size":394851,"file_name":"2018_ALEA_Nejjar.pdf","content_type":"application/pdf","relation":"main_file","date_updated":"2020-07-14T12:47:46Z","access_level":"open_access","file_id":"5981","checksum":"2ded46aa284a836a8cbb34133a64f1cb"}],"publication_identifier":{"issn":["1980-0436"]},"external_id":{"arxiv":["1705.08836"],"isi":["000460475800022"]},"issue":"2","scopus_import":"1"},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1508.07902"}],"arxiv":1,"title":"Maximum persistency via iterative relaxed inference with graphical models","language":[{"iso":"eng"}],"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2018-07-01T00:00:00Z","status":"public","day":"01","oa":1,"scopus_import":1,"issue":"7","external_id":{"arxiv":["1508.07902"]},"publication_identifier":{"issn":["01628828"]},"doi":"10.1109/TPAMI.2017.2730884","oa_version":"Preprint","_id":"703","year":"2018","type":"journal_article","author":[{"first_name":"Alexander","last_name":"Shekhovtsov","full_name":"Shekhovtsov, Alexander"},{"last_name":"Swoboda","first_name":"Paul","full_name":"Swoboda, Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Bogdan","last_name":"Savchynskyy","full_name":"Savchynskyy, Bogdan"}],"month":"07","publication_status":"published","date_created":"2018-12-11T11:48:01Z","intvolume":" 40","volume":40,"citation":{"apa":"Shekhovtsov, A., Swoboda, P., & Savchynskyy, B. (2018). Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2017.2730884","mla":"Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884.","chicago":"Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2018. https://doi.org/10.1109/TPAMI.2017.2730884.","ieee":"A. Shekhovtsov, P. Swoboda, and B. Savchynskyy, “Maximum persistency via iterative relaxed inference with graphical models,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7. IEEE, pp. 1668–1682, 2018.","short":"A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1668–1682.","ama":"Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2018;40(7):1668-1682. doi:10.1109/TPAMI.2017.2730884","ista":"Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 40(7), 1668–1682."},"page":"1668-1682","quality_controlled":"1","publist_id":"6992","abstract":[{"text":"We consider the NP-hard problem of MAP-inference for undirected discrete graphical models. We propose a polynomial time and practically efficient algorithm for finding a part of its optimal solution. Specifically, our algorithm marks some labels of the considered graphical model either as (i) optimal, meaning that they belong to all optimal solutions of the inference problem; (ii) non-optimal if they provably do not belong to any solution. With access to an exact solver of a linear programming relaxation to the MAP-inference problem, our algorithm marks the maximal possible (in a specified sense) number of labels. We also present a version of the algorithm, which has access to a suboptimal dual solver only and still can ensure the (non-)optimality for the marked labels, although the overall number of the marked labels may decrease. We propose an efficient implementation, which runs in time comparable to a single run of a suboptimal dual solver. Our method is well-scalable and shows state-of-the-art results on computational benchmarks from machine learning and computer vision.","lang":"eng"}],"date_updated":"2021-01-12T08:11:32Z","department":[{"_id":"VlKo"}],"publisher":"IEEE"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2018-06-01T00:00:00Z","status":"public","title":"Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes","article_processing_charge":"No","language":[{"iso":"eng"}],"publication":"Molecular Neurobiology","scopus_import":"1","issue":"6","external_id":{"isi":["000431991500025"]},"doi":"10.1007/s12035-017-0688-y","oa_version":"None","day":"01","author":[{"last_name":"Miklosi","first_name":"Andras","full_name":"Miklosi, Andras"},{"full_name":"Del Favero, Giorgia","last_name":"Del Favero","first_name":"Giorgia"},{"last_name":"Bulat","first_name":"Tanja","full_name":"Bulat, Tanja"},{"last_name":"Höger","first_name":"Harald","full_name":"Höger, Harald"},{"full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","first_name":"Ryuichi","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Doris","last_name":"Marko","full_name":"Marko, Doris"},{"first_name":"Gert","last_name":"Lubec","full_name":"Lubec, Gert"}],"month":"06","isi":1,"publication_status":"published","date_created":"2018-12-11T11:48:02Z","intvolume":" 55","year":"2018","_id":"705","type":"journal_article","department":[{"_id":"RySh"}],"publisher":"Springer","citation":{"ista":"Miklosi A, Del Favero G, Bulat T, Höger H, Shigemoto R, Marko D, Lubec G. 2018. Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes. Molecular Neurobiology. 55(6), 4857 – 4869.","ieee":"A. Miklosi et al., “Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes,” Molecular Neurobiology, vol. 55, no. 6. Springer, pp. 4857 – 4869, 2018.","short":"A. Miklosi, G. Del Favero, T. Bulat, H. Höger, R. Shigemoto, D. Marko, G. Lubec, Molecular Neurobiology 55 (2018) 4857 – 4869.","chicago":"Miklosi, Andras, Giorgia Del Favero, Tanja Bulat, Harald Höger, Ryuichi Shigemoto, Doris Marko, and Gert Lubec. “Super Resolution Microscopical Localization of Dopamine Receptors 1 and 2 in Rat Hippocampal Synaptosomes.” Molecular Neurobiology. Springer, 2018. https://doi.org/10.1007/s12035-017-0688-y.","ama":"Miklosi A, Del Favero G, Bulat T, et al. Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes. Molecular Neurobiology. 2018;55(6):4857 – 4869. doi:10.1007/s12035-017-0688-y","mla":"Miklosi, Andras, et al. “Super Resolution Microscopical Localization of Dopamine Receptors 1 and 2 in Rat Hippocampal Synaptosomes.” Molecular Neurobiology, vol. 55, no. 6, Springer, 2018, pp. 4857 – 4869, doi:10.1007/s12035-017-0688-y.","apa":"Miklosi, A., Del Favero, G., Bulat, T., Höger, H., Shigemoto, R., Marko, D., & Lubec, G. (2018). Super resolution microscopical localization of dopamine receptors 1 and 2 in rat hippocampal synaptosomes. Molecular Neurobiology. Springer. https://doi.org/10.1007/s12035-017-0688-y"},"volume":55,"page":"4857 – 4869","publist_id":"6991","quality_controlled":"1","abstract":[{"lang":"eng","text":"Although dopamine receptors D1 and D2 play key roles in hippocampal function, their synaptic localization within the hippocampus has not been fully elucidated. In order to understand precise functions of pre- or postsynaptic dopamine receptors (DRs), the development of protocols to differentiate pre- and postsynaptic DRs is essential. So far, most studies on determination and quantification of DRs did not discriminate between subsynaptic localization. Therefore, the aim of the study was to generate a robust workflow for the localization of DRs. This work provides the basis for future work on hippocampal DRs, in light that DRs may have different functions at pre- or postsynaptic sites. Synaptosomes from rat hippocampi isolated by a sucrose gradient protocol were prepared for super-resolution direct stochastic optical reconstruction microscopy (dSTORM) using Bassoon as a presynaptic zone and Homer1 as postsynaptic density marker. Direct labeling of primary validated antibodies against dopamine receptors D1 (D1R) and D2 (D2R) with Alexa Fluor 594 enabled unequivocal assignment of D1R and D2R to both, pre- and postsynaptic sites. D1R immunoreactivity clusters were observed within the presynaptic active zone as well as at perisynaptic sites at the edge of the presynaptic active zone. The results may be useful for the interpretation of previous studies and the design of future work on DRs in the hippocampus. Moreover, the reduction of the complexity of brain tissue by the use of synaptosomal preparations and dSTORM technology may represent a useful tool for synaptic localization of brain proteins."}],"date_updated":"2023-09-19T09:58:11Z"}]