[{"doi":"10.1007/978-3-642-03845-7_12","acknowledgement":"This research was supported in part by the Swiss National Science Foundation under grant 205321-111840 and by the Excellence Cluster on Multimodal Computing and Interaction.","alternative_title":["LNCS"],"publist_id":"189","related_material":{"record":[{"id":"3364","relation":"later_version","status":"public"}]},"publication_status":"published","status":"public","type":"conference","publisher":"Springer","extern":1,"date_updated":"2025-09-30T09:03:30Z","intvolume":"      5688","abstract":[{"lang":"eng","text":"Molecular noise, which arises from the randomness of the discrete events in the cell, significantly influences fundamental biological processes. Discrete -state continuous-time stochastic models (CTMC) can be used to describe such effects, but the calculation of the probabilities of certain events is computationally expensive.\nWe present a comparison of two analysis approaches for CTMC. On one hand, we estimate the probabilities of interest using repeated Gillespie simulation and determine the statistical accuracy that we obtain. On the other hand, we apply a numerical reachability analysis that approximates the probability distributions of the system at several time instances. We use examples of cellular processes to demonstrate the superiority of the reachability analysis if accurate results are required."}],"day":"17","page":"173 - 188","_id":"4535","year":"2009","author":[{"last_name":"Didier","full_name":"Didier, Frédéric","first_name":"Frédéric"},{"orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Maria Mateescu","last_name":"Mateescu","id":"3B43276C-F248-11E8-B48F-1D18A9856A87","first_name":"Maria"},{"first_name":"Verena","full_name":"Wolf, Verena","last_name":"Wolf"}],"quality_controlled":0,"date_created":"2018-12-11T12:09:21Z","conference":{"name":"CMSB: Computational Methods in Systems Biology"},"month":"08","volume":5688,"citation":{"ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2009. Approximation of event probabilities in noisy cellular processes. CMSB: Computational Methods in Systems Biology, LNCS, vol. 5688, 173–188.","short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, Springer, 2009, pp. 173–188.","chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Approximation of Event Probabilities in Noisy Cellular Processes,” 5688:173–88. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-03845-7_12\">https://doi.org/10.1007/978-3-642-03845-7_12</a>.","ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. Approximation of event probabilities in noisy cellular processes. In: Vol 5688. Springer; 2009:173-188. doi:<a href=\"https://doi.org/10.1007/978-3-642-03845-7_12\">10.1007/978-3-642-03845-7_12</a>","apa":"Didier, F., Henzinger, T. A., Mateescu, M., &#38; Wolf, V. (2009). Approximation of event probabilities in noisy cellular processes (Vol. 5688, pp. 173–188). Presented at the CMSB: Computational Methods in Systems Biology, Springer. <a href=\"https://doi.org/10.1007/978-3-642-03845-7_12\">https://doi.org/10.1007/978-3-642-03845-7_12</a>","mla":"Didier, Frédéric, et al. <i>Approximation of Event Probabilities in Noisy Cellular Processes</i>. Vol. 5688, Springer, 2009, pp. 173–88, doi:<a href=\"https://doi.org/10.1007/978-3-642-03845-7_12\">10.1007/978-3-642-03845-7_12</a>.","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Approximation of event probabilities in noisy cellular processes,” presented at the CMSB: Computational Methods in Systems Biology, 2009, vol. 5688, pp. 173–188."},"date_published":"2009-08-17T00:00:00Z","title":"Approximation of event probabilities in noisy cellular processes"},{"citation":{"ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. Expressiveness and closure properties for quantitative languages. LICS: Logic in Computer Science, 199–208.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, IEEE, 2009, pp. 199–208.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2009). Expressiveness and closure properties for quantitative languages (pp. 199–208). Presented at the LICS: Logic in Computer Science, IEEE. <a href=\"https://doi.org/10.1109/LICS.2009.16\">https://doi.org/10.1109/LICS.2009.16</a>","mla":"Chatterjee, Krishnendu, et al. <i>Expressiveness and Closure Properties for Quantitative Languages</i>. IEEE, 2009, pp. 199–208, doi:<a href=\"https://doi.org/10.1109/LICS.2009.16\">10.1109/LICS.2009.16</a>.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure properties for quantitative languages,” presented at the LICS: Logic in Computer Science, 2009, pp. 199–208.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages,” 199–208. IEEE, 2009. <a href=\"https://doi.org/10.1109/LICS.2009.16\">https://doi.org/10.1109/LICS.2009.16</a>.","ama":"Chatterjee K, Doyen L, Henzinger TA. Expressiveness and closure properties for quantitative languages. In: IEEE; 2009:199-208. doi:<a href=\"https://doi.org/10.1109/LICS.2009.16\">10.1109/LICS.2009.16</a>"},"article_processing_charge":"No","month":"01","title":"Expressiveness and closure properties for quantitative languages","date_published":"2009-01-01T00:00:00Z","quality_controlled":"1","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"language":[{"iso":"eng"}],"conference":{"name":"LICS: Logic in Computer Science"},"date_created":"2018-12-11T12:09:23Z","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit average, or discounted sum of the transition weights. We study expressiveness and closure questions about these quantitative languages. We first show that the set of words with value greater than a threshold can be non-w-regular for deterministic limit-average and discounted-sum automata, while this set is always w-regular when the threshold is isolated (i.e., some neighborhood around the threshold contains no word). In the latter case, we prove that the w-regular language is robust against small perturbations of the transition weights. We next consider automata with transition weights 0 or 1 and show that they are as expressive as general weighted automata in the limit-average case, but not in the discounted-sum case. Third, for quantitative languages L-1 and L-2, we consider the operations max(L-1, L-2), min(L-1, L-2), and 1-L-1, which generalize the boolean operations on languages, as well as the sum L-1 + L-2. We establish the closure properties of all classes of quantitative languages with respect to these four operations.","lang":"eng"}],"oa_version":"None","year":"2009","_id":"4540","page":"199 - 208","related_material":{"record":[{"relation":"later_version","status":"public","id":"3867"}]},"publist_id":"181","pubrep_id":"55","doi":"10.1109/LICS.2009.16","scopus_import":"1","date_updated":"2025-09-30T09:30:59Z","type":"conference","status":"public","publisher":"IEEE","publication_status":"published","extern":"1"},{"author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"}],"file":[{"content_type":"application/pdf","file_size":164428,"creator":"system","file_id":"5126","checksum":"e8f53abb63579de3f2bff58b2a1188e2","date_created":"2018-12-12T10:15:09Z","access_level":"open_access","date_updated":"2020-07-14T12:46:31Z","relation":"main_file","file_name":"IST-2012-39-v1+1_Alternating_Weighted_Automata.pdf"}],"department":[{"_id":"KrCh"}],"title":"Alternating weighted automata","alternative_title":["LNCS"],"pubrep_id":"39","has_accepted_license":"1","publication_status":"published","corr_author":"1","scopus_import":1,"project":[{"name":"Design for Embedded Systems","call_identifier":"FP7","_id":"25F1337C-B435-11E9-9278-68D0E5697425","grant_number":"214373"},{"call_identifier":"FP7","name":"COMponent-Based Embedded Systems design Techniques","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543"}],"abstract":[{"text":"Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real number L(w) computed as the maximal value of all runs over w, and the value of a run r is a function of the sequence of weights that appear along r. There are several natural functions to consider such as Sup, LimSup, LimInf, limit average, and discounted sum of transition weights.\r\nWe introduce alternating weighted automata in which the transitions of the runs are chosen by two players in a turn-based fashion. Each word is assigned the maximal value of a run that the first player can enforce regardless of the choices made by the second player. We survey the results about closure properties, expressiveness, and decision problems for nondeterministic weighted automata, and we extend these results to alternating weighted automata.\r\nFor quantitative languages L 1 and L 2, we consider the pointwise operations max(L 1,L 2), min(L 1,L 2), 1 − L 1, and the sum L 1 + L 2. We establish the closure properties of all classes of alternating weighted automata with respect to these four operations.\r\nWe next compare the expressive power of the various classes of alternating and nondeterministic weighted automata over infinite words. In particular, for limit average and discounted sum, we show that alternation brings more expressive power than nondeterminism.\r\nFinally, we present decidability results and open questions for the quantitative extension of the classical decision problems in automata theory: emptiness, universality, language inclusion, and language equivalence.","lang":"eng"}],"day":"10","ddc":["004"],"ec_funded":1,"oa_version":"Submitted Version","language":[{"iso":"eng"}],"quality_controlled":"1","date_created":"2018-12-11T12:09:23Z","conference":{"location":"Wroclaw, Poland","start_date":"2009-09-02","name":"FCT: Fundamentals of Computation Theory","end_date":"2009-09-04"},"volume":5699,"month":"09","oa":1,"citation":{"short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 3–13.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. Alternating weighted automata. FCT: Fundamentals of Computation Theory, LNCS, vol. 5699, 3–13.","mla":"Chatterjee, Krishnendu, et al. <i>Alternating Weighted Automata</i>. Vol. 5699, Springer, 2009, pp. 3–13, doi:<a href=\"https://doi.org/10.1007/978-3-642-03409-1_2\">10.1007/978-3-642-03409-1_2</a>.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “Alternating weighted automata,” presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland, 2009, vol. 5699, pp. 3–13.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2009). Alternating weighted automata (Vol. 5699, pp. 3–13). Presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland: Springer. <a href=\"https://doi.org/10.1007/978-3-642-03409-1_2\">https://doi.org/10.1007/978-3-642-03409-1_2</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Alternating Weighted Automata,” 5699:3–13. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-03409-1_2\">https://doi.org/10.1007/978-3-642-03409-1_2</a>.","ama":"Chatterjee K, Doyen L, Henzinger TA. Alternating weighted automata. In: Vol 5699. Springer; 2009:3-13. doi:<a href=\"https://doi.org/10.1007/978-3-642-03409-1_2\">10.1007/978-3-642-03409-1_2</a>"},"file_date_updated":"2020-07-14T12:46:31Z","date_published":"2009-09-10T00:00:00Z","doi":"10.1007/978-3-642-03409-1_2","acknowledgement":"This research was supported in part by the Swiss National Science Foundation under the Indo-Swiss Joint Research Programme, by the European Network of Excellence on Embedded Systems Design (ArtistDesign), by the European Combest, Quasimodo, and Gasics projects, by the PAI program Moves funded by the Belgian Federal Government, and by the CFV (Federated Center in Verification) funded by the F.R.S.-FNRS.","publist_id":"180","status":"public","publisher":"Springer","type":"conference","date_updated":"2024-10-09T20:53:55Z","intvolume":"      5699","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"3 - 13","_id":"4542","year":"2009"},{"department":[{"_id":"KrCh"}],"title":"Stochastic games with finitary objectives","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"first_name":"Florian","last_name":"Horn","id":"37327ACE-F248-11E8-B48F-1D18A9856A87","full_name":"Horn, Florian"}],"project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"},{"grant_number":"214373","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Design for Embedded Systems"}],"day":"01","abstract":[{"lang":"eng","text":"The synthesis of a reactive system with respect to all omega-regular specification requires the solution of a graph game. Such games have been extended in two natural ways. First, a game graph can be equipped with probabilistic choices between alternative transitions, thus allowing the, modeling of uncertain behaviour. These are called stochastic games. Second, a liveness specification can he strengthened to require satisfaction within all unknown but bounded amount of time. These are called finitary objectives. We study. for the first time, the, combination of Stochastic games and finitary objectives. We characterize the requirements on optimal strategies and provide algorithms for Computing the maximal achievable probability of winning stochastic games with finitary parity or Street, objectives. Most notably the set of state's from which a player can win with probability . for a finitary parity objective can he computed in polynomial time even though no polynomial-time algorithm is known in the nonfinitary case."}],"oa_version":"None","ec_funded":1,"alternative_title":["LNCS"],"scopus_import":1,"publication_status":"published","corr_author":"1","citation":{"ista":"Chatterjee K, Henzinger TA, Horn F. 2009. Stochastic games with finitary objectives. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 5734, 34–54.","short":"K. Chatterjee, T.A. Henzinger, F. Horn, in:, Springer, 2009, pp. 34–54.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Stochastic Games with Finitary Objectives,” 5734:34–54. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-03816-7_4\">https://doi.org/10.1007/978-3-642-03816-7_4</a>.","ama":"Chatterjee K, Henzinger TA, Horn F. Stochastic games with finitary objectives. In: Vol 5734. Springer; 2009:34-54. doi:<a href=\"https://doi.org/10.1007/978-3-642-03816-7_4\">10.1007/978-3-642-03816-7_4</a>","apa":"Chatterjee, K., Henzinger, T. A., &#38; Horn, F. (2009). Stochastic games with finitary objectives (Vol. 5734, pp. 34–54). Presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-03816-7_4\">https://doi.org/10.1007/978-3-642-03816-7_4</a>","ieee":"K. Chatterjee, T. A. Henzinger, and F. Horn, “Stochastic games with finitary objectives,” presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia, 2009, vol. 5734, pp. 34–54.","mla":"Chatterjee, Krishnendu, et al. <i>Stochastic Games with Finitary Objectives</i>. Vol. 5734, Springer, 2009, pp. 34–54, doi:<a href=\"https://doi.org/10.1007/978-3-642-03816-7_4\">10.1007/978-3-642-03816-7_4</a>."},"volume":5734,"month":"08","date_published":"2009-08-01T00:00:00Z","quality_controlled":"1","language":[{"iso":"eng"}],"conference":{"location":"High Tatras, Slovakia","start_date":"2009-08-24","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2009-08-28"},"date_created":"2018-12-11T12:09:24Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2009","page":"34 - 54","_id":"4543","publist_id":"178","acknowledgement":"This research was supported in part by the Swiss National Science Foundation under the Indo-Swiss Joint Research Programme, by the European Network of Excellence on Embedded Systems Design (ArtistDesign), and by the European project Combest.","doi":"10.1007/978-3-642-03816-7_4","intvolume":"      5734","status":"public","type":"conference","publisher":"Springer","date_updated":"2024-10-09T20:53:54Z"},{"quality_controlled":0,"author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Krishnendu Chatterjee","orcid":"0000-0002-4561-241X"},{"first_name":"Luca","full_name":"de Alfaro, Luca","last_name":"De Alfaro"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}],"conference":{"name":"SODA: Symposium on Discrete Algorithms"},"date_created":"2018-12-11T12:09:24Z","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Termination Criteria for Solving Concurrent Safety and Reachability Games</i>. SIAM, 2009, pp. 197–206, doi:<a href=\"https://doi.org/10.1137/1.9781611973068.23\">10.1137/1.9781611973068.23</a>.","ieee":"K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Termination criteria for solving concurrent safety and reachability games,” presented at the SODA: Symposium on Discrete Algorithms, 2009, pp. 197–206.","apa":"Chatterjee, K., De Alfaro, L., &#38; Henzinger, T. A. (2009). Termination criteria for solving concurrent safety and reachability games (pp. 197–206). Presented at the SODA: Symposium on Discrete Algorithms, SIAM. <a href=\"https://doi.org/10.1137/1.9781611973068.23\">https://doi.org/10.1137/1.9781611973068.23</a>","chicago":"Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Termination Criteria for Solving Concurrent Safety and Reachability Games,” 197–206. SIAM, 2009. <a href=\"https://doi.org/10.1137/1.9781611973068.23\">https://doi.org/10.1137/1.9781611973068.23</a>.","ama":"Chatterjee K, De Alfaro L, Henzinger TA. Termination criteria for solving concurrent safety and reachability games. In: SIAM; 2009:197-206. doi:<a href=\"https://doi.org/10.1137/1.9781611973068.23\">10.1137/1.9781611973068.23</a>","short":"K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, SIAM, 2009, pp. 197–206.","ista":"Chatterjee K, De Alfaro L, Henzinger TA. 2009. Termination criteria for solving concurrent safety and reachability games. SODA: Symposium on Discrete Algorithms, 197–206."},"oa":1,"file":[{"content_type":"application/pdf","file_size":212369,"file_name":"IST-2012-37-v1+1_Termination_criteria_for_solving_concurrent_safety_and_reachability_games.pdf","checksum":"ce7dc1667502e26b23c07a767ac41ae6","file_id":"4662","creator":"system","date_created":"2018-12-12T10:08:03Z","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:31Z"}],"month":"01","main_file_link":[{"open_access":"1","url":"https://repository.ist.ac.at/id/eprint/37"}],"title":"Termination criteria for solving concurrent safety and reachability games","date_published":"2009-01-01T00:00:00Z","file_date_updated":"2020-07-14T12:46:31Z","pubrep_id":"37","publist_id":"176","doi":"10.1137/1.9781611973068.23","date_updated":"2021-01-12T07:59:35Z","type":"conference","publication_status":"published","publisher":"SIAM","status":"public","extern":1,"abstract":[{"text":"We consider concurrent games played on graphs. At every round of a game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state. Two basic objectives are the safety objective to stay forever in a given set of states, and its dual, the reachability objective to reach a given set of states. We present in this paper a strategy improvement algorithm for computing the value of a concurrent safety game, that is, the maximal probability with which player 1 can enforce the safety objective. The algorithm yields a sequence of player-1 strategies which ensure probabilities of winning that converge monotonically to the value of the safety game. Our result is significant because the strategy improvement algorithm provides, for the first time, a way to approximate the value of a concurrent safety game from below. Since a value iteration algorithm, or a strategy improvement algorithm for reachability games, can be used to approximate the same value from above, the combination of both algorithms yields a method for computing a converging sequence of upper and lower bounds for the values of concurrent reachability and safety games. Previous methods could approximate the values of these games only from one direction, and as no rates of convergence are known, they did not provide a practical way to solve these games.","lang":"eng"}],"day":"01","year":"2009","_id":"4544","page":"197 - 206"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2009","page":"1 - 15","_id":"4545","publist_id":"177","acknowledgement":"This research was supported in part by the Swiss National Science Foundation under the Indo-Swiss Joint Research Programme, by the European Network of Excellence on Embedded Systems Design (ArtistDesign), by the European projects COMBEST, Quasimodo, Gasics, by the PAI program Moves funded by the Belgian Federal Government, and by the CFV (Federated Center in Verification) funded by the F.R.S.-FNRS.","doi":"10.1007/978-3-642-02930-1_1","intvolume":"      5556","status":"public","type":"conference","publisher":"Springer","date_updated":"2024-10-09T20:53:54Z","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>A Survey of Stochastic Games with Limsup and Liminf Objectives</i>. Vol. 5556, Springer, 2009, pp. 1–15, doi:<a href=\"https://doi.org/10.1007/978-3-642-02930-1_1\">10.1007/978-3-642-02930-1_1</a>.","ieee":"K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of stochastic games with limsup and liminf objectives,” presented at the ICALP: Automata, Languages and Programming, Rhodos, Greece, 2009, vol. 5556, pp. 1–15.","apa":"Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2009). A survey of stochastic games with limsup and liminf objectives (Vol. 5556, pp. 1–15). Presented at the ICALP: Automata, Languages and Programming, Rhodos, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-642-02930-1_1\">https://doi.org/10.1007/978-3-642-02930-1_1</a>","ama":"Chatterjee K, Doyen L, Henzinger TA. A survey of stochastic games with limsup and liminf objectives. In: Vol 5556. Springer; 2009:1-15. doi:<a href=\"https://doi.org/10.1007/978-3-642-02930-1_1\">10.1007/978-3-642-02930-1_1</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Stochastic Games with Limsup and Liminf Objectives,” 5556:1–15. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-02930-1_1\">https://doi.org/10.1007/978-3-642-02930-1_1</a>.","short":"K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 1–15.","ista":"Chatterjee K, Doyen L, Henzinger TA. 2009. A survey of stochastic games with limsup and liminf objectives. ICALP: Automata, Languages and Programming, LNCS, vol. 5556, 1–15."},"month":"06","volume":5556,"oa":1,"date_published":"2009-06-24T00:00:00Z","file_date_updated":"2020-07-14T12:46:31Z","quality_controlled":"1","language":[{"iso":"eng"}],"conference":{"location":"Rhodos, Greece","start_date":"2009-07-05","name":"ICALP: Automata, Languages and Programming","end_date":"2009-07-12"},"date_created":"2018-12-11T12:09:24Z","project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"}],"abstract":[{"lang":"eng","text":"A stochastic game is a two-player game played oil a graph, where in each state the successor is chosen either by One of the players, or according to a probability distribution. We Survey Stochastic games with limsup and liminf objectives. A real-valued re-ward is assigned to each state, and the value of all infinite path is the limsup (resp. liminf) of all rewards along the path. The value of a stochastic game is the maximal expected value of an infinite path that call he achieved by resolving the decisions of the first player. We present the complexity of computing values of Stochastic games and their subclasses, and the complexity, of optimal strategies in such games. "}],"day":"24","ddc":["000","005"],"oa_version":"Submitted Version","ec_funded":1,"pubrep_id":"38","has_accepted_license":"1","alternative_title":["LNCS"],"scopus_import":1,"publication_status":"published","corr_author":"1","department":[{"_id":"KrCh"}],"file":[{"checksum":"dabb6d24428a000254c95493d9c492e6","file_id":"4992","creator":"system","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:31Z","date_created":"2018-12-12T10:13:11Z","file_name":"IST-2012-38-v1+1_A_survey_of_stochastic_games_with_limsup_and_liminf_objectives.pdf","content_type":"application/pdf","file_size":187419}],"title":"A survey of stochastic games with limsup and liminf objectives","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"}]},{"external_id":{"arxiv":["0904.2638"]},"author":[{"full_name":"Bloem, Roderick","last_name":"Bloem","first_name":"Roderick"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Jobstmann, Barbara","last_name":"Jobstmann","first_name":"Barbara"}],"title":"Better quality in synthesis through quantitative objectives","department":[{"_id":"KrCh"}],"main_file_link":[{"url":"http://arxiv.org/abs/0904.2638","open_access":"1"}],"scopus_import":"1","publication_status":"published","alternative_title":["LNCS"],"oa_version":"Preprint","ec_funded":1,"day":"19","abstract":[{"text":"Most specification languages express only qualitative constraints. However, among two implementations that satisfy a given specification, one may be preferred to another. For example, if a specification asks that every request is followed by a response, one may prefer an implementation that generates responses quickly but does not generate unnecessary responses. We use quantitative properties to measure the “goodness” of an implementation. Using games with corresponding quantitative objectives, we can synthesize “optimal” implementations, which are preferred among the set of possible implementations that satisfy a given specification.\r\nIn particular, we show how automata with lexicographic mean-payoff conditions can be used to express many interesting quantitative properties for reactive systems. In this framework, the synthesis of optimal implementations requires the solution of lexicographic mean-payoff games (for safety requirements), and the solution of games with both lexicographic mean-payoff and parity objectives (for liveness requirements). We present algorithms for solving both kinds of novel graph games.","lang":"eng"}],"project":[{"grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425"}],"conference":{"name":"CAV: Computer Aided Verification","end_date":"2009-07-02","location":"Grenoble, France","start_date":"2009-06-26"},"arxiv":1,"date_created":"2018-12-11T12:09:31Z","quality_controlled":"1","language":[{"iso":"eng"}],"date_published":"2009-06-19T00:00:00Z","citation":{"apa":"Bloem, R., Chatterjee, K., Henzinger, T. A., &#38; Jobstmann, B. (2009). Better quality in synthesis through quantitative objectives (Vol. 5643, pp. 140–156). Presented at the CAV: Computer Aided Verification, Grenoble, France: Springer. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_14\">https://doi.org/10.1007/978-3-642-02658-4_14</a>","ieee":"R. Bloem, K. Chatterjee, T. A. Henzinger, and B. Jobstmann, “Better quality in synthesis through quantitative objectives,” presented at the CAV: Computer Aided Verification, Grenoble, France, 2009, vol. 5643, pp. 140–156.","mla":"Bloem, Roderick, et al. <i>Better Quality in Synthesis through Quantitative Objectives</i>. Vol. 5643, Springer, 2009, pp. 140–56, doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_14\">10.1007/978-3-642-02658-4_14</a>.","chicago":"Bloem, Roderick, Krishnendu Chatterjee, Thomas A Henzinger, and Barbara Jobstmann. “Better Quality in Synthesis through Quantitative Objectives,” 5643:140–56. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_14\">https://doi.org/10.1007/978-3-642-02658-4_14</a>.","ama":"Bloem R, Chatterjee K, Henzinger TA, Jobstmann B. Better quality in synthesis through quantitative objectives. In: Vol 5643. Springer; 2009:140-156. doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_14\">10.1007/978-3-642-02658-4_14</a>","ista":"Bloem R, Chatterjee K, Henzinger TA, Jobstmann B. 2009. Better quality in synthesis through quantitative objectives. CAV: Computer Aided Verification, LNCS, vol. 5643, 140–156.","short":"R. Bloem, K. Chatterjee, T.A. Henzinger, B. Jobstmann, in:, Springer, 2009, pp. 140–156."},"oa":1,"volume":5643,"month":"06","intvolume":"      5643","date_updated":"2024-10-21T06:03:07Z","type":"conference","publisher":"Springer","status":"public","publist_id":"141","doi":"10.1007/978-3-642-02658-4_14","acknowledgement":"This research was supported by the Swiss National Science Foundation (Indo-Swiss Research Program and NCCR MICS) and the European Union projects COMBEST and COCONUT.","year":"2009","_id":"4569","page":"140 - 156","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"_id":"4580","page":"58 - 61","year":"2009","abstract":[{"text":"Alpaga is a solver for two-player parity games with imperfect information. Given the description of a game, it determines whether the first player can ensure to win and, if so, it constructs a winning strategy. The tool provides a symbolic implementation of a recent algorithm based on antichains.","lang":"eng"}],"day":"09","date_updated":"2021-01-12T07:59:52Z","extern":1,"status":"public","publication_status":"published","publisher":"Springer","type":"conference","intvolume":"      5505","alternative_title":["LNCS"],"doi":"10.1007/978-3-642-00768-2_7","publist_id":"127","pubrep_id":"35","file_date_updated":"2020-07-14T12:46:32Z","title":"Alpaga: A tool for solving parity games with imperfect information","date_published":"2009-03-09T00:00:00Z","oa":1,"file":[{"content_type":"application/pdf","file_size":212180,"file_name":"IST-2012-35-v1+1_Alpaga_-_A_tool_for_solving_parity_games_with_imperfect_information.pdf","file_id":"5168","checksum":"d52b55a10a47b3e3b0e016ea9bf85c41","creator":"system","date_updated":"2020-07-14T12:46:32Z","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:15:45Z"}],"main_file_link":[{"open_access":"1","url":"https://repository.ist.ac.at/35/"}],"month":"03","volume":5505,"citation":{"apa":"Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., &#38; Henzinger, T. A. (2009). Alpaga: A tool for solving parity games with imperfect information (Vol. 5505, pp. 58–61). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. <a href=\"https://doi.org/10.1007/978-3-642-00768-2_7\">https://doi.org/10.1007/978-3-642-00768-2_7</a>","mla":"Berwanger, Dietmar, et al. <i>Alpaga: A Tool for Solving Parity Games with Imperfect Information</i>. Vol. 5505, Springer, 2009, pp. 58–61, doi:<a href=\"https://doi.org/10.1007/978-3-642-00768-2_7\">10.1007/978-3-642-00768-2_7</a>.","ieee":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, and T. A. Henzinger, “Alpaga: A tool for solving parity games with imperfect information,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 2009, vol. 5505, pp. 58–61.","ama":"Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. Alpaga: A tool for solving parity games with imperfect information. In: Vol 5505. Springer; 2009:58-61. doi:<a href=\"https://doi.org/10.1007/978-3-642-00768-2_7\">10.1007/978-3-642-00768-2_7</a>","chicago":"Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, and Thomas A Henzinger. “Alpaga: A Tool for Solving Parity Games with Imperfect Information,” 5505:58–61. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-00768-2_7\">https://doi.org/10.1007/978-3-642-00768-2_7</a>.","ista":"Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2009. Alpaga: A tool for solving parity games with imperfect information. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 5505, 58–61.","short":"D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 58–61."},"date_created":"2018-12-11T12:09:35Z","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"author":[{"first_name":"Dietmar","last_name":"Berwanger","full_name":"Berwanger, Dietmar"},{"full_name":"Krishnendu Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"De Wulf","first_name":"Martin","full_name":"De Wulf, Martin"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"}],"quality_controlled":0},{"title":"Quality assessment of polymer replication by hot embossing and micro-injection moulding processes using scanning mechanical microscopy","author":[{"first_name":"M.","full_name":"Sahli, M.","last_name":"Sahli"},{"first_name":"C.","full_name":"Millot, C.","last_name":"Millot"},{"full_name":"Roques-Carmes, Charles","id":"e2e68fc9-6505-11ef-a541-eb4e72cc3e82","last_name":"Roques-Carmes","first_name":"Charles"},{"first_name":"C.","last_name":"Khan Malek","full_name":"Khan Malek, C."},{"last_name":"Barriere","first_name":"T.","full_name":"Barriere, T."},{"first_name":"J.C.","full_name":"Gelin, J.C.","last_name":"Gelin"}],"oa_version":"None","publication":"Journal of Materials Processing Technology","issue":"18-19","day":"19","ddc":["530"],"abstract":[{"lang":"eng","text":"This paper describes observations and metrological analyses made to compare the replication quality of polymeric replicas obtained by filling micro-cavities using both hot embossing and micro-injection moulding processes. The experiments are performed with polypropylene (PP) at a constant melt temperature and a constant mould temperature, whereas hot embossing tests are carried out with the same polymer at temperatures close to the softening one.\r\nThe results concerning the micro-cavities filling provide information on the reliability about the possibilities of replication topographical surface geometries. The data obtained by scanning mechanical microscopy (SMM) are used to determine the comparative filling ratio values."}],"publication_status":"published","extern":"1","scopus_import":"1","date_published":"2009-09-19T00:00:00Z","article_processing_charge":"No","month":"09","volume":209,"citation":{"short":"M. Sahli, C. Millot, C. Roques-Carmes, C. Khan Malek, T. Barriere, J.C. Gelin, Journal of Materials Processing Technology 209 (2009) 5851–5861.","ista":"Sahli M, Millot C, Roques-Carmes C, Khan Malek C, Barriere T, Gelin JC. 2009. Quality assessment of polymer replication by hot embossing and micro-injection moulding processes using scanning mechanical microscopy. Journal of Materials Processing Technology. 209(18–19), 5851–5861.","mla":"Sahli, M., et al. “Quality Assessment of Polymer Replication by Hot Embossing and Micro-Injection Moulding Processes Using Scanning Mechanical Microscopy.” <i>Journal of Materials Processing Technology</i>, vol. 209, no. 18–19, Elsevier, 2009, pp. 5851–61, doi:<a href=\"https://doi.org/10.1016/j.jmatprotec.2009.06.011\">10.1016/j.jmatprotec.2009.06.011</a>.","ieee":"M. Sahli, C. Millot, C. Roques-Carmes, C. Khan Malek, T. Barriere, and J. C. Gelin, “Quality assessment of polymer replication by hot embossing and micro-injection moulding processes using scanning mechanical microscopy,” <i>Journal of Materials Processing Technology</i>, vol. 209, no. 18–19. Elsevier, pp. 5851–5861, 2009.","apa":"Sahli, M., Millot, C., Roques-Carmes, C., Khan Malek, C., Barriere, T., &#38; Gelin, J. C. (2009). Quality assessment of polymer replication by hot embossing and micro-injection moulding processes using scanning mechanical microscopy. <i>Journal of Materials Processing Technology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jmatprotec.2009.06.011\">https://doi.org/10.1016/j.jmatprotec.2009.06.011</a>","ama":"Sahli M, Millot C, Roques-Carmes C, Khan Malek C, Barriere T, Gelin JC. Quality assessment of polymer replication by hot embossing and micro-injection moulding processes using scanning mechanical microscopy. <i>Journal of Materials Processing Technology</i>. 2009;209(18-19):5851-5861. doi:<a href=\"https://doi.org/10.1016/j.jmatprotec.2009.06.011\">10.1016/j.jmatprotec.2009.06.011</a>","chicago":"Sahli, M., C. Millot, Charles Roques-Carmes, C. Khan Malek, T. Barriere, and J.C. Gelin. “Quality Assessment of Polymer Replication by Hot Embossing and Micro-Injection Moulding Processes Using Scanning Mechanical Microscopy.” <i>Journal of Materials Processing Technology</i>. Elsevier, 2009. <a href=\"https://doi.org/10.1016/j.jmatprotec.2009.06.011\">https://doi.org/10.1016/j.jmatprotec.2009.06.011</a>."},"date_created":"2026-03-30T12:22:47Z","language":[{"iso":"eng"}],"quality_controlled":"1","publication_identifier":{"eissn":["1873-4774"],"issn":["0924-0136"]},"page":"5851-5861","_id":"21514","year":"2009","OA_type":"closed access","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","keyword":["Hot embossing","Micro-injection moulding","Micro-cavities replication","Polypropylene polymer","Scanning mechanical microscopy","Roughness parameters"],"type":"journal_article","status":"public","publisher":"Elsevier","date_updated":"2026-04-15T12:52:03Z","intvolume":"       209","doi":"10.1016/j.jmatprotec.2009.06.011"},{"OA_type":"closed access","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"21513","page":"827-835","year":"2009","doi":"10.1007/s00542-009-0813-6","date_updated":"2026-04-27T09:57:37Z","type":"journal_article","status":"public","publisher":"Springer Nature","intvolume":"        15","month":"06","volume":15,"article_processing_charge":"No","citation":{"short":"M. Sahli, C. Millot, C. Roques-Carmes, C. Khan Malek, Microsystem Technologies 15 (2009) 827–835.","ista":"Sahli M, Millot C, Roques-Carmes C, Khan Malek C. 2009. Experimental analysis and numerical modelling of the forming process of polypropylene replicas of micro-cavities using hot embossing. Microsystem Technologies. 15(6), 827–835.","ieee":"M. Sahli, C. Millot, C. Roques-Carmes, and C. Khan Malek, “Experimental analysis and numerical modelling of the forming process of polypropylene replicas of micro-cavities using hot embossing,” <i>Microsystem Technologies</i>, vol. 15, no. 6. Springer Nature, pp. 827–835, 2009.","mla":"Sahli, Mohamed, et al. “Experimental Analysis and Numerical Modelling of the Forming Process of Polypropylene Replicas of Micro-Cavities Using Hot Embossing.” <i>Microsystem Technologies</i>, vol. 15, no. 6, Springer Nature, 2009, pp. 827–35, doi:<a href=\"https://doi.org/10.1007/s00542-009-0813-6\">10.1007/s00542-009-0813-6</a>.","apa":"Sahli, M., Millot, C., Roques-Carmes, C., &#38; Khan Malek, C. (2009). Experimental analysis and numerical modelling of the forming process of polypropylene replicas of micro-cavities using hot embossing. <i>Microsystem Technologies</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00542-009-0813-6\">https://doi.org/10.1007/s00542-009-0813-6</a>","chicago":"Sahli, Mohamed, Christine Millot, Charles Roques-Carmes, and Chantal Khan Malek. “Experimental Analysis and Numerical Modelling of the Forming Process of Polypropylene Replicas of Micro-Cavities Using Hot Embossing.” <i>Microsystem Technologies</i>. Springer Nature, 2009. <a href=\"https://doi.org/10.1007/s00542-009-0813-6\">https://doi.org/10.1007/s00542-009-0813-6</a>.","ama":"Sahli M, Millot C, Roques-Carmes C, Khan Malek C. Experimental analysis and numerical modelling of the forming process of polypropylene replicas of micro-cavities using hot embossing. <i>Microsystem Technologies</i>. 2009;15(6):827-835. doi:<a href=\"https://doi.org/10.1007/s00542-009-0813-6\">10.1007/s00542-009-0813-6</a>"},"date_published":"2009-06-01T00:00:00Z","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1432-1858"],"issn":["0946-7076"]},"quality_controlled":"1","date_created":"2026-03-30T12:22:47Z","issue":"6","publication":"Microsystem Technologies","day":"01","abstract":[{"text":"Numerical modelling of the deformation of a polymer using the finite elements method in axisymetrical mode was performed using the LsDyna® software to describe the filling of micro-cavities during the forming process of the material using the hot embossing. These simulations firstly allow verifying whether the chosen forming process conditions promote or not an optimized filling of the superficial cavities in order to achieve precise replicas which best reproduce the superficial topography of the mould. The simulations were carried out to evaluate the filling of the cavities taking into account the mechanical behaviour of the selected polymer into the model. Moreover, these models were developed to verify the effect of the distribution of the mould cavities on their filling. The influence of the mobility of non deformable rigid plates on the filling of the cavities represents an auxiliary variable. In the approach presented, the compression plates are assumed to be parallel and non deformable, whereas the polymer disk follows a rubbery behaviour around a temperature equal to 140°C. Globally the modelling results are satisfactory for they are rather close to the experimental observations conducted. In summary, the effect of the normal stress as also the distribution of micro-cavities at the mould surface seem to prevail in the case of the forming process by hot embossing.","lang":"eng"}],"ddc":["530"],"oa_version":"None","extern":"1","publication_status":"published","scopus_import":"1","title":"Experimental analysis and numerical modelling of the forming process of polypropylene replicas of micro-cavities using hot embossing","author":[{"first_name":"Mohamed","last_name":"Sahli","full_name":"Sahli, Mohamed"},{"first_name":"Christine","full_name":"Millot, Christine","last_name":"Millot"},{"last_name":"Roques-Carmes","full_name":"Roques-Carmes, Charles","id":"e2e68fc9-6505-11ef-a541-eb4e72cc3e82","first_name":"Charles"},{"last_name":"Khan Malek","first_name":"Chantal","full_name":"Khan Malek, Chantal"}]},{"page":"176-187","_id":"11878","year":"2008","oa_version":"None","article_type":"original","issue":"1","publication":"Proceedings of the VLDB Endowment","abstract":[{"text":"Given only the URL of a web page, can we identify its language? This is the question that we examine in this paper.\r\nSuch a language classifier is, for example, useful for crawlers of web search engines, which frequently try to satisfy certain language quotas. To determine the language of uncrawled web pages, they have to download the page, which might be wasteful, if the page is not in the desired language. With URL-based language classifiers these redundant downloads can be avoided.\r\n\r\nWe apply a variety of machine learning algorithms to the language identification task and evaluate their performance in extensive experiments for five languages: English, French, German, Spanish and Italian. Our best methods achieve an F-measure, averaged over all languages, of around .90 for both a random sample of 1,260 web page from a large web crawl and for 25k pages from the ODP directory. For 5k pages of web search engine results we even achieve an F-measure of .96. The achieved recall for these collections is .93, .88 and .95 respectively. Two independent human evaluators performed considerably worse on the task, with an F-measure of .75 and a typical recall of a mere .67. Using only country-code top-level domains, such as .de or .fr yields a good precision, but a typical recall of below .60 and an F-measure of around .68.","lang":"eng"}],"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","publisher":"Association for Computing Machinery","extern":"1","type":"journal_article","status":"public","date_updated":"2024-11-06T12:21:34Z","intvolume":"         1","scopus_import":"1","doi":"10.14778/1453856.1453880","date_published":"2008-08-01T00:00:00Z","title":"Web page language identification based on URLs","article_processing_charge":"No","volume":1,"month":"08","citation":{"ista":"Baykan E, Henzinger M, Weber I. 2008. Web page language identification based on URLs. Proceedings of the VLDB Endowment. 1(1), 176–187.","short":"E. Baykan, M. Henzinger, I. Weber, Proceedings of the VLDB Endowment 1 (2008) 176–187.","apa":"Baykan, E., Henzinger, M., &#38; Weber, I. (2008). Web page language identification based on URLs. <i>Proceedings of the VLDB Endowment</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.14778/1453856.1453880\">https://doi.org/10.14778/1453856.1453880</a>","mla":"Baykan, Eda, et al. “Web Page Language Identification Based on URLs.” <i>Proceedings of the VLDB Endowment</i>, vol. 1, no. 1, Association for Computing Machinery, 2008, pp. 176–87, doi:<a href=\"https://doi.org/10.14778/1453856.1453880\">10.14778/1453856.1453880</a>.","ieee":"E. Baykan, M. Henzinger, and I. Weber, “Web page language identification based on URLs,” <i>Proceedings of the VLDB Endowment</i>, vol. 1, no. 1. Association for Computing Machinery, pp. 176–187, 2008.","ama":"Baykan E, Henzinger M, Weber I. Web page language identification based on URLs. <i>Proceedings of the VLDB Endowment</i>. 2008;1(1):176-187. doi:<a href=\"https://doi.org/10.14778/1453856.1453880\">10.14778/1453856.1453880</a>","chicago":"Baykan, Eda, Monika Henzinger, and Ingmar Weber. “Web Page Language Identification Based on URLs.” <i>Proceedings of the VLDB Endowment</i>. Association for Computing Machinery, 2008. <a href=\"https://doi.org/10.14778/1453856.1453880\">https://doi.org/10.14778/1453856.1453880</a>."},"date_created":"2022-08-16T13:10:11Z","language":[{"iso":"eng"}],"author":[{"full_name":"Baykan, Eda","first_name":"Eda","last_name":"Baykan"},{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"first_name":"Ingmar","full_name":"Weber, Ingmar","last_name":"Weber"}],"publication_identifier":{"issn":["2150-8097"]},"quality_controlled":"1"},{"publication":"Tanpakushitsu kakusan koso Protein nucleic acid enzyme","issue":"4 Suppl","day":"01","page":"436 - 441","_id":"2674","year":"2008","publist_id":"4223","extern":1,"publisher":"Kyoritsu Shuppan","status":"public","publication_status":"published","type":"review","date_updated":"2020-07-14T12:45:44Z","intvolume":"        53","volume":53,"month":"03","citation":{"ama":"Fukazawa Y, Tarusawa E, Matsui K, Shigemoto R.  Ultrastructural insights of postsynaptic glutamate receptor organization . <i>Tanpakushitsu kakusan koso Protein nucleic acid enzyme</i>. 2008;53(4 Suppl):436-441.","chicago":"Fukazawa, Yugo, Etsuko Tarusawa, Ko Matsui, and Ryuichi Shigemoto. “ Ultrastructural Insights of Postsynaptic Glutamate Receptor Organization .” <i>Tanpakushitsu Kakusan Koso Protein Nucleic Acid Enzyme</i>. Kyoritsu Shuppan, 2008.","apa":"Fukazawa, Y., Tarusawa, E., Matsui, K., &#38; Shigemoto, R. (2008).  Ultrastructural insights of postsynaptic glutamate receptor organization . <i>Tanpakushitsu Kakusan Koso Protein Nucleic Acid Enzyme</i>. Kyoritsu Shuppan.","ieee":"Y. Fukazawa, E. Tarusawa, K. Matsui, and R. Shigemoto, “ Ultrastructural insights of postsynaptic glutamate receptor organization ,” <i>Tanpakushitsu kakusan koso Protein nucleic acid enzyme</i>, vol. 53, no. 4 Suppl. Kyoritsu Shuppan, pp. 436–441, 2008.","mla":"Fukazawa, Yugo, et al. “ Ultrastructural Insights of Postsynaptic Glutamate Receptor Organization .” <i>Tanpakushitsu Kakusan Koso Protein Nucleic Acid Enzyme</i>, vol. 53, no. 4 Suppl, Kyoritsu Shuppan, 2008, pp. 436–41.","ista":"Fukazawa Y, Tarusawa E, Matsui K, Shigemoto R. 2008.  Ultrastructural insights of postsynaptic glutamate receptor organization . Tanpakushitsu kakusan koso Protein nucleic acid enzyme. 53(4 Suppl), 436–441.","short":"Y. Fukazawa, E. Tarusawa, K. Matsui, R. Shigemoto, Tanpakushitsu Kakusan Koso Protein Nucleic Acid Enzyme 53 (2008) 436–441."},"date_published":"2008-03-01T00:00:00Z","title":" Ultrastructural insights of postsynaptic glutamate receptor organization ","author":[{"last_name":"Fukazawa","first_name":"Yugo","full_name":"Fukazawa, Yugo"},{"last_name":"Tarusawa","first_name":"Etsuko","full_name":"Tarusawa, Etsuko"},{"last_name":"Matsui","first_name":"Ko","full_name":"Matsui, Ko"},{"orcid":"0000-0001-8761-9444","full_name":"Ryuichi Shigemoto","last_name":"Shigemoto","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":0,"date_created":"2018-12-11T11:59:00Z"},{"date_created":"2018-12-11T11:59:00Z","quality_controlled":0,"author":[{"full_name":"Endo, Toshiaki","first_name":"Toshiaki","last_name":"Endo"},{"full_name":"Tarusawa, Etsuko","last_name":"Tarusawa","first_name":"Etsuko"},{"full_name":"Notomi, Takuya","first_name":"Takuya","last_name":"Notomi"},{"full_name":"Kaneda, Katsuyuki","last_name":"Kaneda","first_name":"Katsuyuki"},{"first_name":"Masumi","last_name":"Hirabayashi","full_name":"Hirabayashi, Masumi"},{"full_name":"Ryuichi Shigemoto","first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","orcid":"0000-0001-8761-9444"},{"first_name":"Tadashi","last_name":"Isa","full_name":"Isa, Tadashi"}],"title":"Dendritic Ih ensures high-fidelity dendritic spike responses of motion-sensitive neurons in rat superior colliculus","date_published":"2008-05-01T00:00:00Z","citation":{"mla":"Endo, Toshiaki, et al. “Dendritic Ih Ensures High-Fidelity Dendritic Spike Responses of Motion-Sensitive Neurons in Rat Superior Colliculus.” <i>Journal of Neurophysiology</i>, vol. 99, no. 5, American Physiological Society, 2008, pp. 2066–76, doi:<a href=\"https://doi.org/10.1152/jn.00556.2007\">10.1152/jn.00556.2007</a>.","ieee":"T. Endo <i>et al.</i>, “Dendritic Ih ensures high-fidelity dendritic spike responses of motion-sensitive neurons in rat superior colliculus,” <i>Journal of Neurophysiology</i>, vol. 99, no. 5. American Physiological Society, pp. 2066–2076, 2008.","apa":"Endo, T., Tarusawa, E., Notomi, T., Kaneda, K., Hirabayashi, M., Shigemoto, R., &#38; Isa, T. (2008). Dendritic Ih ensures high-fidelity dendritic spike responses of motion-sensitive neurons in rat superior colliculus. <i>Journal of Neurophysiology</i>. American Physiological Society. <a href=\"https://doi.org/10.1152/jn.00556.2007\">https://doi.org/10.1152/jn.00556.2007</a>","chicago":"Endo, Toshiaki, Etsuko Tarusawa, Takuya Notomi, Katsuyuki Kaneda, Masumi Hirabayashi, Ryuichi Shigemoto, and Tadashi Isa. “Dendritic Ih Ensures High-Fidelity Dendritic Spike Responses of Motion-Sensitive Neurons in Rat Superior Colliculus.” <i>Journal of Neurophysiology</i>. American Physiological Society, 2008. <a href=\"https://doi.org/10.1152/jn.00556.2007\">https://doi.org/10.1152/jn.00556.2007</a>.","ama":"Endo T, Tarusawa E, Notomi T, et al. Dendritic Ih ensures high-fidelity dendritic spike responses of motion-sensitive neurons in rat superior colliculus. <i>Journal of Neurophysiology</i>. 2008;99(5):2066-2076. doi:<a href=\"https://doi.org/10.1152/jn.00556.2007\">10.1152/jn.00556.2007</a>","short":"T. Endo, E. Tarusawa, T. Notomi, K. Kaneda, M. Hirabayashi, R. Shigemoto, T. Isa, Journal of Neurophysiology 99 (2008) 2066–2076.","ista":"Endo T, Tarusawa E, Notomi T, Kaneda K, Hirabayashi M, Shigemoto R, Isa T. 2008. Dendritic Ih ensures high-fidelity dendritic spike responses of motion-sensitive neurons in rat superior colliculus. Journal of Neurophysiology. 99(5), 2066–2076."},"month":"05","volume":99,"intvolume":"        99","date_updated":"2021-01-12T06:58:59Z","publisher":"American Physiological Society","publication_status":"published","type":"journal_article","extern":1,"status":"public","publist_id":"4221","doi":"10.1152/jn.00556.2007","year":"2008","_id":"2675","page":"2066 - 2076","day":"01","abstract":[{"text":"Hyperpolarization-activated cyclic nucleotide-gated (HCN) channels that generate Ih currents are widely distributed in the brain and have been shown to contribute to various neuronal functions. In the present study, we investigated the functions of Ih in the motion-sensitive projection neurons [wide field vertical (WFV) cells] of the superior colliculus, a pivotal visual center for detection of and orientating to salient objects. Combination of whole cell recordings and immunohistochemical investigations suggested that HCN1 channels dominantly contribute to the Ih in WFV cells among HCN isoforms expressed in the superficial superior colliculus and mainly located on their expansive dendritic trees. We found that blocking Ih suppressed the initiation of short- and fixed-latency dendritic spike responses and led instead to long- and fluctuating-latency somatic spike responses to optic fiber stimulations. These results suggest that the dendritic Ih facilitates the dendritic initiation and/or propagation of action potentials and ensures that WFV cells generate spike responses to distal synaptic inputs in a sensitive and robustly time-locked manner, probably by acting as continuous depolarizing drive and fixing dendritic membrane potentials close to the spike threshold. These functions are different from known functions of dendritic Ih revealed in hippocampal and neocortical pyramidal cells, where they spatiotemporally limit the propagations of synaptic inputs along the apical dendrites by reducing dendritic membrane resistance. Thus we have revealed new functional aspects of Ih, and these dendritic properties are likely critical for visual motion processing in these neurons.","lang":"eng"}],"publication":"Journal of Neurophysiology","issue":"5"},{"volume":3,"month":"04","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"ista":"Kawakami R, Dobi A, Shigemoto R, Ito I. 2008. Right isomerism of the brain in inversus viscerum mutant mice. PLoS One. 3(4).","short":"R. Kawakami, A. Dobi, R. Shigemoto, I. Ito, PLoS One 3 (2008).","chicago":"Kawakami, Ryosuke, Alice Dobi, Ryuichi Shigemoto, and Isao Ito. “Right Isomerism of the Brain in Inversus Viscerum Mutant Mice.” <i>PLoS One</i>. Public Library of Science, 2008. <a href=\"https://doi.org/10.1371/journal.pone.0001945\">https://doi.org/10.1371/journal.pone.0001945</a>.","ama":"Kawakami R, Dobi A, Shigemoto R, Ito I. Right isomerism of the brain in inversus viscerum mutant mice. <i>PLoS One</i>. 2008;3(4). doi:<a href=\"https://doi.org/10.1371/journal.pone.0001945\">10.1371/journal.pone.0001945</a>","apa":"Kawakami, R., Dobi, A., Shigemoto, R., &#38; Ito, I. (2008). Right isomerism of the brain in inversus viscerum mutant mice. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0001945\">https://doi.org/10.1371/journal.pone.0001945</a>","ieee":"R. Kawakami, A. Dobi, R. Shigemoto, and I. Ito, “Right isomerism of the brain in inversus viscerum mutant mice,” <i>PLoS One</i>, vol. 3, no. 4. Public Library of Science, 2008.","mla":"Kawakami, Ryosuke, et al. “Right Isomerism of the Brain in Inversus Viscerum Mutant Mice.” <i>PLoS One</i>, vol. 3, no. 4, Public Library of Science, 2008, doi:<a href=\"https://doi.org/10.1371/journal.pone.0001945\">10.1371/journal.pone.0001945</a>."},"date_published":"2008-04-16T00:00:00Z","title":"Right isomerism of the brain in inversus viscerum mutant mice","author":[{"first_name":"Ryosuke","full_name":"Kawakami, Ryosuke","last_name":"Kawakami"},{"full_name":"Dobi, Alice","first_name":"Alice","last_name":"Dobi"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Ryuichi Shigemoto","first_name":"Ryuichi","last_name":"Shigemoto","orcid":"0000-0001-8761-9444"},{"full_name":"Ito, Isao","first_name":"Isao","last_name":"Ito"}],"quality_controlled":0,"date_created":"2018-12-11T11:59:00Z","issue":"4","publication":"PLoS One","abstract":[{"lang":"eng","text":"Left-right (L-R) asymmetry is a fundamental feature of higher-order neural function. However, the molecular basis of brain asymmetry remains unclear. We recently reported L-R asymmetry of hippocampal circuitry caused by differential allocation of N-methyl-O-aspartate receptor (NMDAR) subunit GluRε2 (NR2B) in hippocambal synapses. Using electrophysiology and immunocytochemistry, here we analyzed the hippocampal circuitry of the inversus viscerum (iv) mouse that has a randomized laterality of internal organs. The iv mouse hippocampus lacks L-R asymmetry, it exhibits right isomerism in the synaptic distribution of the ε2 subunit, irrespective of the laterality of visceral organs. This independent right isomerism of the hippocampus is the first evidence that a distinct mechanism downstream of the iv mutation generates brain asymmetry."}],"day":"16","_id":"2676","year":"2008","doi":"10.1371/journal.pone.0001945","publist_id":"4222","publication_status":"published","extern":1,"publisher":"Public Library of Science","type":"journal_article","status":"public","date_updated":"2021-01-12T06:58:59Z","intvolume":"         3"},{"date_updated":"2021-01-12T06:58:59Z","extern":1,"publication_status":"published","publisher":"Wiley-Blackwell","status":"public","type":"journal_article","intvolume":"       586","doi":"10.1113/jphysiol.2008.155242","publist_id":"4220","_id":"2677","page":"3893 - 3915","year":"2008","publication":"Journal of Physiology","issue":"16","abstract":[{"text":"The medial septum (MS) is an indispensable component of the subcortical network which synchronizes the hippocampus at theta frequency during specific stages of information processing. GABAergic neurons exhibiting highly regular firing coupled to the hippocampal theta rhythm are thought to form the core of the MS rhythm-generating network. In recent studies the hyperpolarization-activated, cyclic nucleotide-gated non-selective cation (HCN) channel was shown to participate in theta synchronization of the medial septum. Here, we tested the hypothesis that HCN channel expression correlates with theta modulated firing behaviour of MS neurons by a combined anatomical and electrophysiological approach. HCN-expressing neurons represented a subpopulation of GABAergic cells in the MS partly overlapping with parvalbumin (PV)-containing neurons. Rhythmic firing in the theta frequency range was characteristic of all HCN-expressing neurons. In contrast, only a minority of HCN-negative cells displayed theta related activity. All HCN cells had tight phase coupling to hippocampal theta waves. As a group, PV-expressing HCN neurons had a marked bimodal phase distribution, whereas PV-immunonegative HCN neurons did not show group-level phase preference despite significant individual phase coupling. Microiontophoretic blockade of HCN channels resulted in the reduction of discharge frequency, but theta rhythmic firing was perturbed only in a few cases. Our data imply that HCN-expressing GABAergic neurons provide rhythmic drive in all phases of the hippocampal theta activity. In most MS theta cells rhythm genesis is apparently determined by interactions at the level of the network rather than by the pacemaking property of HCN channels alone.","lang":"eng"}],"day":"15","date_created":"2018-12-11T11:59:01Z","author":[{"full_name":"Varga, Viktor","first_name":"Viktor","last_name":"Varga"},{"full_name":"Hangya, Balázs","first_name":"Balázs","last_name":"Hangya"},{"first_name":"Kinga","last_name":"Kránitz","full_name":"Kránitz, Kinga"},{"full_name":"Ludányi, Anikó","first_name":"Anikó","last_name":"Ludányi"},{"last_name":"Zemankovics","first_name":"Rita","full_name":"Zemankovics, Rita"},{"first_name":"István","full_name":"Katona, István","last_name":"Katona"},{"last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Ryuichi Shigemoto","first_name":"Ryuichi","orcid":"0000-0001-8761-9444"},{"last_name":"Freund","full_name":"Freund, Tamás F","first_name":"Tamás"},{"first_name":"Zsolt","last_name":"Borhegyi","full_name":"Borhegyi, Zsolt"}],"quality_controlled":0,"title":"The presence of pacemaker HCN channels identifies theta rhythmic GABAergic neurons in the medial septum","date_published":"2008-08-15T00:00:00Z","month":"08","volume":586,"citation":{"short":"V. Varga, B. Hangya, K. Kránitz, A. Ludányi, R. Zemankovics, I. Katona, R. Shigemoto, T. Freund, Z. Borhegyi, Journal of Physiology 586 (2008) 3893–3915.","ista":"Varga V, Hangya B, Kránitz K, Ludányi A, Zemankovics R, Katona I, Shigemoto R, Freund T, Borhegyi Z. 2008. The presence of pacemaker HCN channels identifies theta rhythmic GABAergic neurons in the medial septum. Journal of Physiology. 586(16), 3893–3915.","mla":"Varga, Viktor, et al. “The Presence of Pacemaker HCN Channels Identifies Theta Rhythmic GABAergic Neurons in the Medial Septum.” <i>Journal of Physiology</i>, vol. 586, no. 16, Wiley-Blackwell, 2008, pp. 3893–915, doi:<a href=\"https://doi.org/10.1113/jphysiol.2008.155242\">10.1113/jphysiol.2008.155242</a>.","ieee":"V. Varga <i>et al.</i>, “The presence of pacemaker HCN channels identifies theta rhythmic GABAergic neurons in the medial septum,” <i>Journal of Physiology</i>, vol. 586, no. 16. Wiley-Blackwell, pp. 3893–3915, 2008.","apa":"Varga, V., Hangya, B., Kránitz, K., Ludányi, A., Zemankovics, R., Katona, I., … Borhegyi, Z. (2008). The presence of pacemaker HCN channels identifies theta rhythmic GABAergic neurons in the medial septum. <i>Journal of Physiology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1113/jphysiol.2008.155242\">https://doi.org/10.1113/jphysiol.2008.155242</a>","ama":"Varga V, Hangya B, Kránitz K, et al. The presence of pacemaker HCN channels identifies theta rhythmic GABAergic neurons in the medial septum. <i>Journal of Physiology</i>. 2008;586(16):3893-3915. doi:<a href=\"https://doi.org/10.1113/jphysiol.2008.155242\">10.1113/jphysiol.2008.155242</a>","chicago":"Varga, Viktor, Balázs Hangya, Kinga Kránitz, Anikó Ludányi, Rita Zemankovics, István Katona, Ryuichi Shigemoto, Tamás Freund, and Zsolt Borhegyi. “The Presence of Pacemaker HCN Channels Identifies Theta Rhythmic GABAergic Neurons in the Medial Septum.” <i>Journal of Physiology</i>. Wiley-Blackwell, 2008. <a href=\"https://doi.org/10.1113/jphysiol.2008.155242\">https://doi.org/10.1113/jphysiol.2008.155242</a>."}},{"date_published":"2008-09-24T00:00:00Z","title":"Connexin45-containing neuronal gap junctions in rodent retina also contain connexin36 in both apposing hemiplaques, forming bihomotypic gap junctions, with scaffolding contributed by zonula occludens-1","citation":{"short":"X. Li, N. Kamasawa, C. Ciolofan, C. Olson, S. Lu, K. Davidson, T. Yasumura, R. Shigemoto, J. Rash, J. Nagy, Journal of Neuroscience 28 (2008) 9769–9789.","ista":"Li X, Kamasawa N, Ciolofan C, Olson C, Lu S, Davidson K, Yasumura T, Shigemoto R, Rash J, Nagy J. 2008. Connexin45-containing neuronal gap junctions in rodent retina also contain connexin36 in both apposing hemiplaques, forming bihomotypic gap junctions, with scaffolding contributed by zonula occludens-1. Journal of Neuroscience. 28(39), 9769–9789.","ama":"Li X, Kamasawa N, Ciolofan C, et al. Connexin45-containing neuronal gap junctions in rodent retina also contain connexin36 in both apposing hemiplaques, forming bihomotypic gap junctions, with scaffolding contributed by zonula occludens-1. <i>Journal of Neuroscience</i>. 2008;28(39):9769-9789. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.2137-08.2008\">10.1523/JNEUROSCI.2137-08.2008</a>","chicago":"Li, Xinbo, Naomi Kamasawa, Cristina Ciolofan, Carl Olson, Shijun Lu, Kimberly Davidson, Thomas Yasumura, Ryuichi Shigemoto, John Rash, and James Nagy. “Connexin45-Containing Neuronal Gap Junctions in Rodent Retina Also Contain Connexin36 in Both Apposing Hemiplaques, Forming Bihomotypic Gap Junctions, with Scaffolding Contributed by Zonula Occludens-1.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2008. <a href=\"https://doi.org/10.1523/JNEUROSCI.2137-08.2008\">https://doi.org/10.1523/JNEUROSCI.2137-08.2008</a>.","ieee":"X. Li <i>et al.</i>, “Connexin45-containing neuronal gap junctions in rodent retina also contain connexin36 in both apposing hemiplaques, forming bihomotypic gap junctions, with scaffolding contributed by zonula occludens-1,” <i>Journal of Neuroscience</i>, vol. 28, no. 39. Society for Neuroscience, pp. 9769–9789, 2008.","mla":"Li, Xinbo, et al. “Connexin45-Containing Neuronal Gap Junctions in Rodent Retina Also Contain Connexin36 in Both Apposing Hemiplaques, Forming Bihomotypic Gap Junctions, with Scaffolding Contributed by Zonula Occludens-1.” <i>Journal of Neuroscience</i>, vol. 28, no. 39, Society for Neuroscience, 2008, pp. 9769–89, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.2137-08.2008\">10.1523/JNEUROSCI.2137-08.2008</a>.","apa":"Li, X., Kamasawa, N., Ciolofan, C., Olson, C., Lu, S., Davidson, K., … Nagy, J. (2008). Connexin45-containing neuronal gap junctions in rodent retina also contain connexin36 in both apposing hemiplaques, forming bihomotypic gap junctions, with scaffolding contributed by zonula occludens-1. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.2137-08.2008\">https://doi.org/10.1523/JNEUROSCI.2137-08.2008</a>"},"month":"09","volume":28,"date_created":"2018-12-11T11:59:01Z","quality_controlled":0,"author":[{"full_name":"Li, Xinbo","last_name":"Li","first_name":"Xinbo"},{"first_name":"Naomi","last_name":"Kamasawa","full_name":"Kamasawa, Naomi"},{"full_name":"Ciolofan, Cristina","last_name":"Ciolofan","first_name":"Cristina"},{"first_name":"Carl","full_name":"Olson, Carl O","last_name":"Olson"},{"last_name":"Lu","first_name":"Shijun","full_name":"Lu, Shijun"},{"first_name":"Kimberly","full_name":"Davidson, Kimberly G","last_name":"Davidson"},{"full_name":"Yasumura, Thomas","first_name":"Thomas","last_name":"Yasumura"},{"orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","first_name":"Ryuichi","full_name":"Ryuichi Shigemoto"},{"first_name":"John","full_name":"Rash, John E","last_name":"Rash"},{"full_name":"Nagy, James I","first_name":"James","last_name":"Nagy"}],"year":"2008","page":"9769 - 9789","_id":"2678","abstract":[{"text":"Mammalian retinas contain abundant neuronal gap junctions, particularly in the inner plexiform layer (IPL), where the two principal neuronal connexin proteins are Cx36 and Cx45. Currently undetermined are coupling relationships between these connexins and whether both are expressed together or separately in a neuronal subtype-specific manner. Although Cx45-expressing neurons strongly couple with Cx36-expressing neurons, possibly via heterotypic gap junctions, Cx45 and Cx36 failed to form functional heterotypic channels in vitro. We now show that Cx36 and Cx45 coexpressed in HeLa cells were colocalized in immunofluorescent puncta between contacting cells, demonstrating targeting/scaffolding competence for both connexins in vitro. However, Cx36 and Cx45 expressed separately did not form immunofluorescent puncta containing both connexins, supporting lack of heterotypic coupling competence. In IPL, 87% of Cx45-immunofluorescent puncta were colocalized with Cx36, supporting either widespread heterotypic coupling or bihomotypic coupling. Ultrastructurally, Cx45 was detected in 9% of IPL gap junction hemiplaques, 90-100% of which also contained Cx36, demonstrating connexin coexpression and cotargeting in virtually all IPL neurons that express Cx45. Moreover, double replicas revealed both connexins in separate domains mirrored on both sides of matched hemiplaques. With previous evidence that Cx36 interacts with PDZ1 domain of zonula occludens-1 (ZO-1), we show that Cx45 interacts with PDZ2 domain of ZO-1, and that Cx36, Cx45, and ZO-1 coimmunoprecipitate, suggesting that ZO-1 provides for coscaffolding of Cx45 with Cx36. These data document that in Cx45-expressing neurons of IPL, Cx45 is almost always accompanied by Cx36, forming &quot;bihomotypic&quot; gap junctions, with Cx45 structurally coupling to Cx45 and Cx36 coupling to Cx36.","lang":"eng"}],"day":"24","issue":"39","publication":"Journal of Neuroscience","intvolume":"        28","publication_status":"published","extern":1,"publisher":"Society for Neuroscience","status":"public","type":"journal_article","date_updated":"2021-01-12T06:59:00Z","publist_id":"4218","doi":"10.1523/JNEUROSCI.2137-08.2008"},{"doi":"10.1523/JNEUROSCI.1551-08.2008","publist_id":"4219","date_updated":"2021-01-12T06:59:00Z","type":"journal_article","status":"public","extern":1,"publication_status":"published","publisher":"Society for Neuroscience","intvolume":"        28","publication":"Journal of Neuroscience","issue":"39","abstract":[{"text":"Ionotropic glutamate receptors play important roles in spinal processing of nociceptive sensory signals and induction of central sensitization in chronic pain. Here we applied highly sensitive freeze-fracture replica labeling to laminae I-II of the spinal dorsal horn of rats and investigated the numbers, densities, and colocalization of AMPA- and NMDA-type glutamate receptors at individual postsynaptic membrane specializations with a high resolution. All glutamatergic postsynaptic membranes in laminae I-II expressed AMPA receptors, and most of them (96%) were also immunoreactive for the NR1 subunit of NMDA receptors. The numbers of gold particles for AMPA and NMDA receptors at individual postsynaptic membranes showed a linear correlation with the size of postsynaptic membrane specializations and varied in the range of 8-214 and 5-232 with median values of 37 and 28, whereas their densities varied in the range of 325-3365/μm 2 and 102-2263/μm 2 with median values of 1115/μm 2 and 777/μm 2, respectively. Virtually all (99%) glutamatergic postsynaptic membranes expressed GluR2, and most of them (87%) were also immunoreactive for GluR1. The numbers of gold particles for pan-AMPA, NR1, and GluR2 subunits showed a linear correlation with the size of postsynaptic surface areas. Concerning GluR1, there may be two populations of synapses with high and low GluR1 densities. In synapses larger than 0.1 μm 2, GluR1 subunits were recovered in very low numbers. Differential expression of GluR1 and GluR2 subunits suggests regulation of AMPA receptor subunit composition by presynaptic mechanism.","lang":"eng"}],"day":"24","_id":"2679","page":"9692 - 9701","year":"2008","author":[{"last_name":"Antal","first_name":"Miklós","full_name":"Antal, Miklós"},{"full_name":"Fukazawa, Yugo","first_name":"Yugo","last_name":"Fukazawa"},{"full_name":"Eördögh, Mária","last_name":"Eördögh","first_name":"Mária"},{"last_name":"Muszil","full_name":"Muszil, Dóra","first_name":"Dóra"},{"full_name":"Molnár, Elek","first_name":"Elek","last_name":"Molnár"},{"first_name":"Makoto","full_name":"Itakura, Makoto","last_name":"Itakura"},{"first_name":"Masami","last_name":"Takahashi","full_name":"Takahashi, Masami"},{"first_name":"Ryuichi","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Ryuichi Shigemoto","orcid":"0000-0001-8761-9444"}],"quality_controlled":0,"date_created":"2018-12-11T11:59:01Z","month":"09","volume":28,"citation":{"ama":"Antal M, Fukazawa Y, Eördögh M, et al. Numbers, densities, and colocalization of AMPA- and NMDA-type glutamate receptors at individual synapses in the superficial spinal dorsal horn of rats. <i>Journal of Neuroscience</i>. 2008;28(39):9692-9701. doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1551-08.2008\">10.1523/JNEUROSCI.1551-08.2008</a>","chicago":"Antal, Miklós, Yugo Fukazawa, Mária Eördögh, Dóra Muszil, Elek Molnár, Makoto Itakura, Masami Takahashi, and Ryuichi Shigemoto. “Numbers, Densities, and Colocalization of AMPA- and NMDA-Type Glutamate Receptors at Individual Synapses in the Superficial Spinal Dorsal Horn of Rats.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2008. <a href=\"https://doi.org/10.1523/JNEUROSCI.1551-08.2008\">https://doi.org/10.1523/JNEUROSCI.1551-08.2008</a>.","apa":"Antal, M., Fukazawa, Y., Eördögh, M., Muszil, D., Molnár, E., Itakura, M., … Shigemoto, R. (2008). Numbers, densities, and colocalization of AMPA- and NMDA-type glutamate receptors at individual synapses in the superficial spinal dorsal horn of rats. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href=\"https://doi.org/10.1523/JNEUROSCI.1551-08.2008\">https://doi.org/10.1523/JNEUROSCI.1551-08.2008</a>","mla":"Antal, Miklós, et al. “Numbers, Densities, and Colocalization of AMPA- and NMDA-Type Glutamate Receptors at Individual Synapses in the Superficial Spinal Dorsal Horn of Rats.” <i>Journal of Neuroscience</i>, vol. 28, no. 39, Society for Neuroscience, 2008, pp. 9692–701, doi:<a href=\"https://doi.org/10.1523/JNEUROSCI.1551-08.2008\">10.1523/JNEUROSCI.1551-08.2008</a>.","ieee":"M. Antal <i>et al.</i>, “Numbers, densities, and colocalization of AMPA- and NMDA-type glutamate receptors at individual synapses in the superficial spinal dorsal horn of rats,” <i>Journal of Neuroscience</i>, vol. 28, no. 39. Society for Neuroscience, pp. 9692–9701, 2008.","ista":"Antal M, Fukazawa Y, Eördögh M, Muszil D, Molnár E, Itakura M, Takahashi M, Shigemoto R. 2008. Numbers, densities, and colocalization of AMPA- and NMDA-type glutamate receptors at individual synapses in the superficial spinal dorsal horn of rats. Journal of Neuroscience. 28(39), 9692–9701.","short":"M. Antal, Y. Fukazawa, M. Eördögh, D. Muszil, E. Molnár, M. Itakura, M. Takahashi, R. Shigemoto, Journal of Neuroscience 28 (2008) 9692–9701."},"title":"Numbers, densities, and colocalization of AMPA- and NMDA-type glutamate receptors at individual synapses in the superficial spinal dorsal horn of rats","date_published":"2008-09-24T00:00:00Z"},{"volume":105,"month":"12","citation":{"short":"Y. Shinohara, H. Hirase, M. Watanabe, M. Itakura, M. Takahashi, R. Shigemoto, PNAS 105 (2008) 19498–19503.","ista":"Shinohara Y, Hirase H, Watanabe M, Itakura M, Takahashi M, Shigemoto R. 2008. Left-right asymmetry of the hippocampal synapses with differential subunit allocation of glutamate receptors. PNAS. 105(49), 19498–19503.","ieee":"Y. Shinohara, H. Hirase, M. Watanabe, M. Itakura, M. Takahashi, and R. Shigemoto, “Left-right asymmetry of the hippocampal synapses with differential subunit allocation of glutamate receptors,” <i>PNAS</i>, vol. 105, no. 49. National Academy of Sciences, pp. 19498–19503, 2008.","mla":"Shinohara, Yoshiaki, et al. “Left-Right Asymmetry of the Hippocampal Synapses with Differential Subunit Allocation of Glutamate Receptors.” <i>PNAS</i>, vol. 105, no. 49, National Academy of Sciences, 2008, pp. 19498–503, doi:<a href=\"https://doi.org/10.1073/pnas.0807461105\">10.1073/pnas.0807461105</a>.","apa":"Shinohara, Y., Hirase, H., Watanabe, M., Itakura, M., Takahashi, M., &#38; Shigemoto, R. (2008). Left-right asymmetry of the hippocampal synapses with differential subunit allocation of glutamate receptors. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.0807461105\">https://doi.org/10.1073/pnas.0807461105</a>","chicago":"Shinohara, Yoshiaki, Hajime Hirase, Masahiko Watanabe, Makoto Itakura, Masami Takahashi, and Ryuichi Shigemoto. “Left-Right Asymmetry of the Hippocampal Synapses with Differential Subunit Allocation of Glutamate Receptors.” <i>PNAS</i>. National Academy of Sciences, 2008. <a href=\"https://doi.org/10.1073/pnas.0807461105\">https://doi.org/10.1073/pnas.0807461105</a>.","ama":"Shinohara Y, Hirase H, Watanabe M, Itakura M, Takahashi M, Shigemoto R. Left-right asymmetry of the hippocampal synapses with differential subunit allocation of glutamate receptors. <i>PNAS</i>. 2008;105(49):19498-19503. doi:<a href=\"https://doi.org/10.1073/pnas.0807461105\">10.1073/pnas.0807461105</a>"},"date_published":"2008-12-09T00:00:00Z","title":"Left-right asymmetry of the hippocampal synapses with differential subunit allocation of glutamate receptors","author":[{"first_name":"Yoshiaki","full_name":"Shinohara, Yoshiaki","last_name":"Shinohara"},{"first_name":"Hajime","full_name":"Hirase, Hajime","last_name":"Hirase"},{"full_name":"Watanabe, Masahiko","first_name":"Masahiko","last_name":"Watanabe"},{"full_name":"Itakura, Makoto","last_name":"Itakura","first_name":"Makoto"},{"full_name":"Takahashi, Masami","last_name":"Takahashi","first_name":"Masami"},{"orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","first_name":"Ryuichi","full_name":"Ryuichi Shigemoto"}],"quality_controlled":0,"date_created":"2018-12-11T11:59:02Z","issue":"49","publication":"PNAS","day":"09","abstract":[{"text":"Left-right asymmetry of the brain has been studied mostly through psychological examination and functional imaging in primates, leaving its molecular and synaptic aspects largely unaddressed. Here, we show that hippocampal CA1 pyramidal cell synapses differ in size, shape, and glutamate receptor expression depending on the laterality of presynaptic origin. CA1 synapses receiving neuronal input from the right CA3 pyramidal cells are larger and have more perforated PSD and a GluR1 expression level twice as high as those receiving input from the left CA3. The synaptic density of GluR1 increases as the size of a synapse increases, whereas that of NR2B decreases because of the relatively constant NR2B expression in CA1 regardless of synapse size. Densities of other major glutamate receptor subunits show no correlation with synapse size, thus resulting in higher net expression in synapses having right input. Our study demonstrates universal left-right asymmetry of hippocampal synapses with a fundamental relationship between synaptic area and the expression of glutamate receptor subunits.","lang":"eng"}],"page":"19498 - 19503","_id":"2681","year":"2008","doi":"10.1073/pnas.0807461105","publist_id":"4217","publisher":"National Academy of Sciences","publication_status":"published","extern":1,"status":"public","type":"journal_article","date_updated":"2021-01-12T06:59:01Z","intvolume":"       105"},{"citation":{"ama":"Erdös L, Salmhofer M, Yau H. Feynman graphs and renormalization in quantum diffusion. In: World Scientific Publishing; 2008:167-182. doi:<a href=\"https://doi.org/10.1142/9789812833556_0011\">10.1142/9789812833556_0011</a>","chicago":"Erdös, László, Manfred Salmhofer, and Horng Yau. “Feynman Graphs and Renormalization in Quantum Diffusion,” 167–82. World Scientific Publishing, 2008. <a href=\"https://doi.org/10.1142/9789812833556_0011\">https://doi.org/10.1142/9789812833556_0011</a>.","mla":"Erdös, László, et al. <i>Feynman Graphs and Renormalization in Quantum Diffusion</i>. World Scientific Publishing, 2008, pp. 167–82, doi:<a href=\"https://doi.org/10.1142/9789812833556_0011\">10.1142/9789812833556_0011</a>.","ieee":"L. Erdös, M. Salmhofer, and H. Yau, “Feynman graphs and renormalization in quantum diffusion,” presented at the Symposium in Honor of Wolfhart Zimmermann’s 80th Birthday, 2008, pp. 167–182.","apa":"Erdös, L., Salmhofer, M., &#38; Yau, H. (2008). Feynman graphs and renormalization in quantum diffusion (pp. 167–182). Presented at the Symposium in Honor of Wolfhart Zimmermann’s 80th Birthday, World Scientific Publishing. <a href=\"https://doi.org/10.1142/9789812833556_0011\">https://doi.org/10.1142/9789812833556_0011</a>","short":"L. Erdös, M. Salmhofer, H. Yau, in:, World Scientific Publishing, 2008, pp. 167–182.","ista":"Erdös L, Salmhofer M, Yau H. 2008. Feynman graphs and renormalization in quantum diffusion. Symposium in Honor of Wolfhart Zimmermann’s 80th Birthday, 167–182."},"month":"01","main_file_link":[{"url":"http://arxiv.org/abs/0806.4751","open_access":"1"}],"oa":1,"date_published":"2008-01-01T00:00:00Z","title":"Feynman graphs and renormalization in quantum diffusion","quality_controlled":0,"author":[{"last_name":"Erdös","full_name":"László Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603"},{"full_name":"Salmhofer, Manfred","last_name":"Salmhofer","first_name":"Manfred"},{"full_name":"Yau, Horng-Tzer","first_name":"Horng","last_name":"Yau"}],"conference":{"name":"Symposium in Honor of Wolfhart Zimmermann's 80th Birthday"},"date_created":"2018-12-11T11:59:09Z","abstract":[{"lang":"eng","text":"We review our proof that in a scaling limit, the time evolution of a quantum particle in a static random environment leads to a diffusion equation. In particular, we discuss the role of Feynman graph expansions and of renormalization.\n"}],"day":"01","year":"2008","page":"167 - 182","_id":"2702","publist_id":"4194","doi":"10.1142/9789812833556_0011","publisher":"World Scientific Publishing","type":"conference","status":"public","publication_status":"published","extern":1,"date_updated":"2021-01-12T06:59:09Z"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","text":"We consider random Schrödinger equations on R d for d ≽ 3 with a homogeneous Anderson–Poisson type random potential. Denote by λ the coupling constant and ψt the solution with initial data ψ0 . The space and time variables scale as x∼λ−2−ϰ/2 and t∼λ−2−ϰ with 0&lt;ϰ&lt;ϰ0(d) . We prove that, in the limit λ → 0, the expectation of the Wigner distribution of ψt converges weakly to the solution of a heat equation in the space variable x for arbitrary L 2 initial data.\r\nThe proof is based on analyzing the phase cancellations of multiple scatterings on the random potential by expanding the propagator into a sum of Feynman graphs. In this paper we consider the non-recollision graphs and prove that the amplitude of the non-ladder diagrams is smaller than their “naive size” by an extra λ c factor per non-(anti)ladder vertex for some c &gt; 0. This is the first rigorous result showing that the improvement over the naive estimates on the Feynman graphs grows as a power of the small parameter with the exponent depending linearly on the number of vertices. This estimate allows us to prove the convergence of the perturbation series.\r\n"}],"day":"01","publication":"Acta Mathematica","issue":"2","year":"2008","oa_version":"None","page":"211 - 277","_id":"2753","publist_id":"4139","doi":"10.1007/s11511-008-0027-2","intvolume":"       200","extern":"1","publisher":"Springer","publication_status":"published","type":"journal_article","status":"public","date_updated":"2025-09-10T07:22:34Z","citation":{"ista":"Erdös L, Salmhofer M, Yau H. 2008. Quantum diffusion of the random Schrödinger evolution in the scaling limit. Acta Mathematica. 200(2), 211–277.","short":"L. Erdös, M. Salmhofer, H. Yau, Acta Mathematica 200 (2008) 211–277.","apa":"Erdös, L., Salmhofer, M., &#38; Yau, H. (2008). Quantum diffusion of the random Schrödinger evolution in the scaling limit. <i>Acta Mathematica</i>. Springer. <a href=\"https://doi.org/10.1007/s11511-008-0027-2\">https://doi.org/10.1007/s11511-008-0027-2</a>","mla":"Erdös, László, et al. “Quantum Diffusion of the Random Schrödinger Evolution in the Scaling Limit.” <i>Acta Mathematica</i>, vol. 200, no. 2, Springer, 2008, pp. 211–77, doi:<a href=\"https://doi.org/10.1007/s11511-008-0027-2\">10.1007/s11511-008-0027-2</a>.","ieee":"L. Erdös, M. Salmhofer, and H. Yau, “Quantum diffusion of the random Schrödinger evolution in the scaling limit,” <i>Acta Mathematica</i>, vol. 200, no. 2. Springer, pp. 211–277, 2008.","ama":"Erdös L, Salmhofer M, Yau H. Quantum diffusion of the random Schrödinger evolution in the scaling limit. <i>Acta Mathematica</i>. 2008;200(2):211-277. doi:<a href=\"https://doi.org/10.1007/s11511-008-0027-2\">10.1007/s11511-008-0027-2</a>","chicago":"Erdös, László, Manfred Salmhofer, and Horng Yau. “Quantum Diffusion of the Random Schrödinger Evolution in the Scaling Limit.” <i>Acta Mathematica</i>. Springer, 2008. <a href=\"https://doi.org/10.1007/s11511-008-0027-2\">https://doi.org/10.1007/s11511-008-0027-2</a>."},"article_processing_charge":"No","month":"07","volume":200,"date_published":"2008-07-01T00:00:00Z","title":"Quantum diffusion of the random Schrödinger evolution in the scaling limit","author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","first_name":"László","full_name":"Erdös, László","last_name":"Erdös","orcid":"0000-0001-5366-9603"},{"full_name":"Salmhofer, Manfred","first_name":"Manfred","last_name":"Salmhofer"},{"full_name":"Yau, Horng","first_name":"Horng","last_name":"Yau"}],"language":[{"iso":"eng"}],"date_created":"2018-12-11T11:59:25Z"}]