[{"intvolume":"        14","extern":1,"citation":{"ama":"Barton NH, Etheridge A, Sturm A. Coalescence in a Random Background. <i>Annals of Applied Probability</i>. 2004;14(2):754-785.","ista":"Barton NH, Etheridge A, Sturm A. 2004. Coalescence in a Random Background. Annals of Applied Probability. 14(2), 754–785.","mla":"Barton, Nicholas H., et al. “Coalescence in a Random Background.” <i>Annals of Applied Probability</i>, vol. 14, no. 2, Institute of Mathematical Statistics, 2004, pp. 754–85.","apa":"Barton, N. H., Etheridge, A., &#38; Sturm, A. (2004). Coalescence in a Random Background. <i>Annals of Applied Probability</i>. Institute of Mathematical Statistics.","ieee":"N. H. Barton, A. Etheridge, and A. Sturm, “Coalescence in a Random Background,” <i>Annals of Applied Probability</i>, vol. 14, no. 2. Institute of Mathematical Statistics, pp. 754–785, 2004.","chicago":"Barton, Nicholas H, Alison Etheridge, and Anja Sturm. “Coalescence in a Random Background.” <i>Annals of Applied Probability</i>. Institute of Mathematical Statistics, 2004.","short":"N.H. Barton, A. Etheridge, A. Sturm, Annals of Applied Probability 14 (2004) 754–785."},"issue":"2","status":"public","date_published":"2004-05-01T00:00:00Z","main_file_link":[{"url":"http://www.jstor.org/stable/4140427","open_access":"0"}],"quality_controlled":0,"publication_status":"published","publication":"Annals of Applied Probability","_id":"4253","publisher":"Institute of Mathematical Statistics","year":"2004","title":"Coalescence in a Random Background","volume":14,"publist_id":"1842","date_created":"2018-12-11T12:07:52Z","author":[{"full_name":"Nicholas Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H"},{"first_name":"Alison","last_name":"Etheridge","full_name":"Etheridge, Alison M"},{"full_name":"Sturm, Anja K","last_name":"Sturm","first_name":"Anja"}],"page":"754 - 785","abstract":[{"lang":"eng","text":"We consider a single genetic locus which carries two alleles, labelled P and Q. This locus experiences selection and mutation. It is linked to a second neutral locus with recombination rate r. If r = 0, this reduces to the study of a single selected locus. Assuming a Moran model for the population dynamics, we pass to a diffusion approximation and, assuming that the allele frequencies at the selected locus have reached stationarity, establish the joint generating function for the genealogy of a sample from the population and the frequency of the P allele. In essence this is the joint generating function for a coalescent and the random background in which it evolves. We use this to characterize, for the diffusion approximation, the probability of identity in state at the neutral locus of a sample of two individuals (whose type at the selected locus is known) as solutions to a system of ordinary differential equations. The only subtlety is to find the boundary conditions for this system. Finally, numerical examples are presented that illustrate the accuracy and predictions of the diffusion approximation. In particular, a comparison is made between this approach and one in which the frequencies at the selected locus are estimated by their value in the absence of fluctuations and a classical structured coalescent model is used."}],"day":"01","date_updated":"2021-01-12T07:55:38Z","month":"05","type":"journal_article"},{"publication_status":"published","quality_controlled":0,"date_published":"2004-12-14T00:00:00Z","doi":"1572","status":"public","alternative_title":["LNCS"],"citation":{"chicago":"Maler, Oded, and Dejan Nickovic. “Monitoring Temporal Properties of Continuous Signals,” 152–66. Springer, 2004. <a href=\"https://doi.org/1572\">https://doi.org/1572</a>.","ieee":"O. Maler and D. Nickovic, “Monitoring Temporal Properties of Continuous Signals,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, 2004, pp. 152–166.","short":"O. Maler, D. Nickovic, in:, Springer, 2004, pp. 152–166.","ama":"Maler O, Nickovic D. Monitoring Temporal Properties of Continuous Signals. In: Springer; 2004:152-166. doi:<a href=\"https://doi.org/1572\">1572</a>","apa":"Maler, O., &#38; Nickovic, D. (2004). Monitoring Temporal Properties of Continuous Signals (pp. 152–166). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Springer. <a href=\"https://doi.org/1572\">https://doi.org/1572</a>","ista":"Maler O, Nickovic D. 2004. Monitoring Temporal Properties of Continuous Signals. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, , 152–166.","mla":"Maler, Oded, and Dejan Nickovic. <i>Monitoring Temporal Properties of Continuous Signals</i>. Springer, 2004, pp. 152–66, doi:<a href=\"https://doi.org/1572\">1572</a>."},"extern":1,"conference":{"name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"date_updated":"2021-01-12T07:56:29Z","day":"14","month":"12","type":"conference","author":[{"first_name":"Oded","last_name":"Maler","full_name":"Maler, Oded"},{"last_name":"Nickovic","first_name":"Dejan","full_name":"Dejan Nickovic","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"}],"page":"152 - 166","date_created":"2018-12-11T12:08:31Z","publist_id":"1088","title":"Monitoring Temporal Properties of Continuous Signals","year":"2004","publisher":"Springer","_id":"4372"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"University of California, Berkeley","year":"2004","_id":"4424","article_processing_charge":"No","author":[{"full_name":"Jhala, Ranjit","last_name":"Jhala","first_name":"Ranjit"}],"page":"1 - 165","day":"01","abstract":[{"lang":"eng","text":"The enormous cost and ubiquity of software errors necessitates the need for techniques and tools that can precisely analyze large systems and prove that they meet given specifications, or if they don't, return counterexample behaviors showing how the system fails. Recent advances in model checking, decision procedures, program analysis and type systems, and a shift of focus to partial specifications common to several systems (e.g., memory safety and race freedom) have resulted in several practical verification methods. However, these methods are either precise or they are scalable, depending on whether they track the values of variables or only a fixed small set of dataflow facts (e.g., types), and are usually insufficient for precisely verifying large programs.\r\n\r\nWe describe a new technique called Lazy Abstraction (LA) which achieves both precision and scalability by localizing the use of precise information. LA automatically builds, explores and refines a single abstract model of the program in a way that different parts of the model exhibit different degrees of precision, namely just enough to verify the desired property. The algorithm automatically mines the information required by partitioning mechanical proofs of unsatisfiability of spurious counterexamples into Craig Interpolants. For multithreaded systems, we give a new technique based on analyzing the behavior of a single thread executing in a context which is an abstraction of the other (arbitrarily many) threads. We define novel context models and show how to automatically infer them and analyze the full system (thread + context) using LA.\r\n\r\nLA is implemented in BLAST. We have run BLAST on Windows and Linux Device Drivers to verify API conformance properties, and have used it to find (or guarantee the absence of) data races in multithreaded Networked Embedded Systems (NESC) applications. BLAST is able to prove the absence of races in several cases where earlier methods, which depend on lock-based synchronization, fail."}],"date_updated":"2021-01-12T07:56:52Z","type":"dissertation","oa_version":"None","month":"12","title":"Program verification by lazy abstraction","date_created":"2018-12-11T12:08:47Z","publist_id":"307","status":"public","extern":"1","citation":{"short":"R. Jhala, Program Verification by Lazy Abstraction, University of California, Berkeley, 2004.","chicago":"Jhala, Ranjit. “Program Verification by Lazy Abstraction.” University of California, Berkeley, 2004.","ieee":"R. Jhala, “Program verification by lazy abstraction,” University of California, Berkeley, 2004.","apa":"Jhala, R. (2004). <i>Program verification by lazy abstraction</i>. University of California, Berkeley.","mla":"Jhala, Ranjit. <i>Program Verification by Lazy Abstraction</i>. University of California, Berkeley, 2004, pp. 1–165.","ista":"Jhala R. 2004. Program verification by lazy abstraction. University of California, Berkeley.","ama":"Jhala R. Program verification by lazy abstraction. 2004:1-165."},"language":[{"iso":"eng"}],"publication_status":"published","supervisor":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"}],"date_published":"2004-12-01T00:00:00Z"},{"year":"2004","publisher":"ACM","acknowledgement":"This research was supported in part by the AFOSR MURI grant F49620-00-1-0327 and by the NSF grants CCR- 0208875 and CCR-0225610.","_id":"4445","day":"01","date_updated":"2021-01-12T07:57:01Z","abstract":[{"text":"We present a type system for E code, which is an assembly language that manages the release, interaction, and termination of real-time tasks. E code specifies a deadline for each task, and the type system ensures that the deadlines are path-insensitive. We show that typed E programs allow, for given worst-case execution times of tasks, a simple schedulability analysis. Moreover, the real-time programming language Giotto can be compiled into typed E~code. This shows that typed E~code identifies an easily schedulable yet expressive class of real-time programs. We have extended the Giotto compiler to generate typed E code, and enabled the run-time system for E code to perform a type and schedulability check before executing the code.","lang":"eng"}],"type":"conference","month":"09","page":"104 - 113","author":[{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger"},{"full_name":"Kirsch, Christoph M","first_name":"Christoph","last_name":"Kirsch"}],"date_created":"2018-12-11T12:08:53Z","publist_id":"285","title":"A typed assembly language for real-time programs","status":"public","citation":{"ieee":"T. A. Henzinger and C. Kirsch, “A typed assembly language for real-time programs,” presented at the EMSOFT: Embedded Software , 2004, pp. 104–113.","chicago":"Henzinger, Thomas A, and Christoph Kirsch. “A Typed Assembly Language for Real-Time Programs,” 104–13. ACM, 2004. <a href=\"https://doi.org/10.1145/1017753.1017774\">https://doi.org/10.1145/1017753.1017774</a>.","short":"T.A. Henzinger, C. Kirsch, in:, ACM, 2004, pp. 104–113.","ama":"Henzinger TA, Kirsch C. A typed assembly language for real-time programs. In: ACM; 2004:104-113. doi:<a href=\"https://doi.org/10.1145/1017753.1017774\">10.1145/1017753.1017774</a>","ista":"Henzinger TA, Kirsch C. 2004. A typed assembly language for real-time programs. EMSOFT: Embedded Software , 104–113.","mla":"Henzinger, Thomas A., and Christoph Kirsch. <i>A Typed Assembly Language for Real-Time Programs</i>. ACM, 2004, pp. 104–13, doi:<a href=\"https://doi.org/10.1145/1017753.1017774\">10.1145/1017753.1017774</a>.","apa":"Henzinger, T. A., &#38; Kirsch, C. (2004). A typed assembly language for real-time programs (pp. 104–113). Presented at the EMSOFT: Embedded Software , ACM. <a href=\"https://doi.org/10.1145/1017753.1017774\">https://doi.org/10.1145/1017753.1017774</a>"},"extern":1,"conference":{"name":"EMSOFT: Embedded Software "},"publication_status":"published","quality_controlled":0,"doi":"10.1145/1017753.1017774","date_published":"2004-09-01T00:00:00Z"},{"publisher":"ACM","year":"2004","_id":"4458","page":"232 - 244","author":[{"full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Jhala","first_name":"Ranjit","full_name":"Jhala, Ranjit"},{"full_name":"Majumdar, Ritankar S","last_name":"Majumdar","first_name":"Ritankar"},{"last_name":"Mcmillan","first_name":"Kenneth","full_name":"McMillan, Kenneth L"}],"month":"04","type":"conference","date_updated":"2021-01-12T07:57:06Z","abstract":[{"lang":"eng","text":"The success of model checking for large programs depends crucially on the ability to efficiently construct parsimonious abstractions. A predicate abstraction is parsimonious if at each control location, it specifies only relationships between current values of variables, and only those which are required for proving correctness. Previous methods for automatically refining predicate abstractions until sufficient precision is obtained do not systematically construct parsimonious abstractions: predicates usually contain symbolic variables, and are added heuristically and often uniformly to many or all control locations at once. We use Craig interpolation to efficiently construct, from a given abstract error trace which cannot be concretized, a parsominous abstraction that removes the trace. At each location of the trace, we infer the relevant predicates as an interpolant between the two formulas that define the past and the future segment of the trace. Each interpolant is a relationship between current values of program variables, and is relevant only at that particular program location. It can be found by a linear scan of the proof of infeasibility of the trace.We develop our method for programs with arithmetic and pointer expressions, and call-by-value function calls. For function calls, Craig interpolation offers a systematic way of generating relevant predicates that contain only the local variables of the function and the values of the formal parameters when the function was called. We have extended our model checker Blast with predicate discovery by Craig interpolation, and applied it successfully to C programs with more than 130,000 lines of code, which was not possible with approaches that build less parsimonious abstractions."}],"day":"01","title":"Abstractions from proofs","date_created":"2018-12-11T12:08:57Z","publist_id":"270","status":"public","conference":{"name":"POPL: Principles of Programming Languages"},"extern":1,"citation":{"apa":"Henzinger, T. A., Jhala, R., Majumdar, R., &#38; Mcmillan, K. (2004). Abstractions from proofs (pp. 232–244). Presented at the POPL: Principles of Programming Languages, ACM. <a href=\"https://doi.org/10.1145/964001.964021\">https://doi.org/10.1145/964001.964021</a>","ista":"Henzinger TA, Jhala R, Majumdar R, Mcmillan K. 2004. Abstractions from proofs. POPL: Principles of Programming Languages, 232–244.","mla":"Henzinger, Thomas A., et al. <i>Abstractions from Proofs</i>. ACM, 2004, pp. 232–44, doi:<a href=\"https://doi.org/10.1145/964001.964021\">10.1145/964001.964021</a>.","ama":"Henzinger TA, Jhala R, Majumdar R, Mcmillan K. Abstractions from proofs. In: ACM; 2004:232-244. doi:<a href=\"https://doi.org/10.1145/964001.964021\">10.1145/964001.964021</a>","short":"T.A. Henzinger, R. Jhala, R. Majumdar, K. Mcmillan, in:, ACM, 2004, pp. 232–244.","chicago":"Henzinger, Thomas A, Ranjit Jhala, Ritankar Majumdar, and Kenneth Mcmillan. “Abstractions from Proofs,” 232–44. ACM, 2004. <a href=\"https://doi.org/10.1145/964001.964021\">https://doi.org/10.1145/964001.964021</a>.","ieee":"T. A. Henzinger, R. Jhala, R. Majumdar, and K. Mcmillan, “Abstractions from proofs,” presented at the POPL: Principles of Programming Languages, 2004, pp. 232–244."},"publication_status":"published","date_published":"2004-04-01T00:00:00Z","doi":"10.1145/964001.964021","quality_controlled":0},{"quality_controlled":0,"doi":"10.1145/996841.996844","date_published":"2004-06-01T00:00:00Z","publication_status":"published","citation":{"ama":"Henzinger TA, Jhala R, Majumdar R. Race checking by context inference. In: ACM; 2004:1-13. doi:<a href=\"https://doi.org/10.1145/996841.996844\">10.1145/996841.996844</a>","mla":"Henzinger, Thomas A., et al. <i>Race Checking by Context Inference</i>. ACM, 2004, pp. 1–13, doi:<a href=\"https://doi.org/10.1145/996841.996844\">10.1145/996841.996844</a>.","ista":"Henzinger TA, Jhala R, Majumdar R. 2004. Race checking by context inference. PLDI: Programming Languages Design and Implementation, 1–13.","apa":"Henzinger, T. A., Jhala, R., &#38; Majumdar, R. (2004). Race checking by context inference (pp. 1–13). Presented at the PLDI: Programming Languages Design and Implementation, ACM. <a href=\"https://doi.org/10.1145/996841.996844\">https://doi.org/10.1145/996841.996844</a>","ieee":"T. A. Henzinger, R. Jhala, and R. Majumdar, “Race checking by context inference,” presented at the PLDI: Programming Languages Design and Implementation, 2004, pp. 1–13.","chicago":"Henzinger, Thomas A, Ranjit Jhala, and Ritankar Majumdar. “Race Checking by Context Inference,” 1–13. ACM, 2004. <a href=\"https://doi.org/10.1145/996841.996844\">https://doi.org/10.1145/996841.996844</a>.","short":"T.A. Henzinger, R. Jhala, R. Majumdar, in:, ACM, 2004, pp. 1–13."},"extern":1,"conference":{"name":"PLDI: Programming Languages Design and Implementation"},"status":"public","date_created":"2018-12-11T12:08:57Z","publist_id":"271","title":"Race checking by context inference","day":"01","date_updated":"2021-01-12T07:57:07Z","abstract":[{"text":"Software model checking has been successful for sequential programs, where predicate abstraction offers suitable models, and counterexample-guided abstraction refinement permits the automatic inference of models. When checking concurrent programs, we need to abstract threads as well as the contexts in which they execute. Stateless context models, such as predicates on global variables, prove insufficient for showing the absence of race conditions in many examples. We therefore use richer context models, which combine (1) predicates for abstracting data state, (2) control flow quotients for abstracting control state, and (3) counters for abstracting an unbounded number of threads. We infer suitable context models automatically by a combination of counterexample-guided abstraction refinement, bisimulation minimization, circular assume-guarantee reasoning, and parametric reasoning about an unbounded number of threads. This algorithm, called CIRC, has been implemented in BLAST and succeeds in checking many examples of NESC code for data races. In particular, BLAST proves the absence of races in several cases where previous race checkers give false positives.","lang":"eng"}],"month":"06","type":"conference","page":"1 - 13","author":[{"full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Jhala, Ranjit","last_name":"Jhala","first_name":"Ranjit"},{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar S"}],"_id":"4459","year":"2004","publisher":"ACM"},{"title":"Extreme model checking","volume":2772,"date_created":"2018-12-11T12:08:58Z","publist_id":"269","author":[{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger"},{"full_name":"Jhala, Ranjit","first_name":"Ranjit","last_name":"Jhala"},{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar S"},{"full_name":"Sanvido, Marco A","last_name":"Sanvido","first_name":"Marco"}],"page":"332 - 358","abstract":[{"lang":"eng","text":"One of the central axioms of extreme programming is the disciplined use of regression testing during stepwise software development. Due to recent progress in software model checking, it has become possible to supplement this process with automatic checks for behavioral safety properties of programs, such as conformance with locking idioms and other programming protocols and patterns. For efficiency reasons, all checks must be incremental, i.e., they must reuse partial results from previous checks in order to avoid all unnecessary repetition of expensive verification tasks. We show that the lazy-abstraction algorithm, and its implementation in Blast, can be extended to support the fully automatic and incremental checking of temporal safety properties during software development."}],"date_updated":"2021-01-12T07:57:08Z","day":"24","month":"02","type":"book_chapter","publication":"Verification: Theory and Practice","_id":"4461","publisher":"Springer","acknowledgement":"This work was supported in part by the NSF grants CCR-9988172, CCR-0085949, and CCR-0234690, the ONR grant N00014-02-1-0671, the DARPA grant F33615-00-C-1693, and the MARCO grant 98-DT-660. ","year":"2004","doi":"10.1007/978-3-540-39910-0_16","date_published":"2004-02-24T00:00:00Z","quality_controlled":0,"publication_status":"published","extern":1,"intvolume":"      2772","citation":{"ama":"Henzinger TA, Jhala R, Majumdar R, Sanvido M. Extreme model checking. In: <i>Verification: Theory and Practice</i>. Vol 2772. Springer; 2004:332-358. doi:<a href=\"https://doi.org/10.1007/978-3-540-39910-0_16\">10.1007/978-3-540-39910-0_16</a>","mla":"Henzinger, Thomas A., et al. “Extreme Model Checking.” <i>Verification: Theory and Practice</i>, vol. 2772, Springer, 2004, pp. 332–58, doi:<a href=\"https://doi.org/10.1007/978-3-540-39910-0_16\">10.1007/978-3-540-39910-0_16</a>.","ista":"Henzinger TA, Jhala R, Majumdar R, Sanvido M. 2004.Extreme model checking. In: Verification: Theory and Practice. LNCS, vol. 2772, 332–358.","apa":"Henzinger, T. A., Jhala, R., Majumdar, R., &#38; Sanvido, M. (2004). Extreme model checking. In <i>Verification: Theory and Practice</i> (Vol. 2772, pp. 332–358). Springer. <a href=\"https://doi.org/10.1007/978-3-540-39910-0_16\">https://doi.org/10.1007/978-3-540-39910-0_16</a>","ieee":"T. A. Henzinger, R. Jhala, R. Majumdar, and M. Sanvido, “Extreme model checking,” in <i>Verification: Theory and Practice</i>, vol. 2772, Springer, 2004, pp. 332–358.","chicago":"Henzinger, Thomas A, Ranjit Jhala, Ritankar Majumdar, and Marco Sanvido. “Extreme Model Checking.” In <i>Verification: Theory and Practice</i>, 2772:332–58. Springer, 2004. <a href=\"https://doi.org/10.1007/978-3-540-39910-0_16\">https://doi.org/10.1007/978-3-540-39910-0_16</a>.","short":"T.A. Henzinger, R. Jhala, R. Majumdar, M. Sanvido, in:, Verification: Theory and Practice, Springer, 2004, pp. 332–358."},"alternative_title":["LNCS"],"status":"public"},{"_id":"4525","year":"2004","acknowledgement":"This research is supported by the AFOSR MURI grant F49620-00-1-0327, the DARPA SEC grant F33615-C-98-3614, the MARCO GSRC grant 98-DT-660, and the NSF grants CCR-0208875 and CCR-0225610.","publisher":"Springer","publist_id":"200","date_created":"2018-12-11T12:09:18Z","volume":2993,"title":"Event-driven programming with logical execution times","month":"03","type":"conference","date_updated":"2021-01-12T07:59:26Z","abstract":[{"lang":"eng","text":"We present a new high-level programming language, called xGiotto, for programming applications with hard real-time constraints. Like its predecessor, xGiotto is based on the LET (logical execution time) assumption: the programmer specifies when the outputs of a task become available, and the compiler checks if the specification can be implemented on a given platform. However, while the predecessor language xGiotto was purely time-triggered, xGiotto accommodates also asynchronous events. Indeed, through a mechanism called event scoping, events are the main structuring principle of the new language. The xGiotto compiler and run-time system implement event scoping through a tree-based event filter. The compiler also checks programs for determinism (absence of race conditions)."}],"day":"12","page":"167 - 170","author":[{"full_name":"Ghosal, Arkadeb","last_name":"Ghosal","first_name":"Arkadeb"},{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger","first_name":"Thomas A","last_name":"Henzinger"},{"last_name":"Kirsch","first_name":"Christoph","full_name":"Kirsch, Christoph M"},{"full_name":"Sanvido, Marco A","first_name":"Marco","last_name":"Sanvido"}],"citation":{"short":"A. Ghosal, T.A. Henzinger, C. Kirsch, M. Sanvido, in:, Springer, 2004, pp. 167–170.","chicago":"Ghosal, Arkadeb, Thomas A Henzinger, Christoph Kirsch, and Marco Sanvido. “Event-Driven Programming with Logical Execution Times,” 2993:167–70. Springer, 2004. <a href=\"https://doi.org/10.1007/978-3-540-24743-2_24\">https://doi.org/10.1007/978-3-540-24743-2_24</a>.","ieee":"A. Ghosal, T. A. Henzinger, C. Kirsch, and M. Sanvido, “Event-driven programming with logical execution times,” presented at the HSCC: Hybrid Systems - Computation and Control, 2004, vol. 2993, pp. 167–170.","apa":"Ghosal, A., Henzinger, T. A., Kirsch, C., &#38; Sanvido, M. (2004). Event-driven programming with logical execution times (Vol. 2993, pp. 167–170). Presented at the HSCC: Hybrid Systems - Computation and Control, Springer. <a href=\"https://doi.org/10.1007/978-3-540-24743-2_24\">https://doi.org/10.1007/978-3-540-24743-2_24</a>","mla":"Ghosal, Arkadeb, et al. <i>Event-Driven Programming with Logical Execution Times</i>. Vol. 2993, Springer, 2004, pp. 167–70, doi:<a href=\"https://doi.org/10.1007/978-3-540-24743-2_24\">10.1007/978-3-540-24743-2_24</a>.","ista":"Ghosal A, Henzinger TA, Kirsch C, Sanvido M. 2004. Event-driven programming with logical execution times. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 2993, 167–170.","ama":"Ghosal A, Henzinger TA, Kirsch C, Sanvido M. Event-driven programming with logical execution times. In: Vol 2993. Springer; 2004:167-170. doi:<a href=\"https://doi.org/10.1007/978-3-540-24743-2_24\">10.1007/978-3-540-24743-2_24</a>"},"conference":{"name":"HSCC: Hybrid Systems - Computation and Control"},"intvolume":"      2993","extern":1,"status":"public","alternative_title":["LNCS"],"quality_controlled":0,"date_published":"2004-03-12T00:00:00Z","doi":"10.1007/978-3-540-24743-2_24","publication_status":"published"},{"date_published":"2004-09-30T00:00:00Z","doi":"10.1109/QEST.2004.10051","quality_controlled":0,"publication_status":"published","extern":1,"conference":{"name":"QEST: Quantitative Evaluation of Systems"},"citation":{"chicago":"Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Trading Memory for Randomness,” 206–17. IEEE, 2004. <a href=\"https://doi.org/10.1109/QEST.2004.10051\">https://doi.org/10.1109/QEST.2004.10051</a>.","ieee":"K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Trading memory for randomness,” presented at the QEST: Quantitative Evaluation of Systems, 2004, pp. 206–217.","short":"K. Chatterjee, L. De Alfaro, T.A. Henzinger, in:, IEEE, 2004, pp. 206–217.","ama":"Chatterjee K, De Alfaro L, Henzinger TA. Trading memory for randomness. In: IEEE; 2004:206-217. doi:<a href=\"https://doi.org/10.1109/QEST.2004.10051\">10.1109/QEST.2004.10051</a>","apa":"Chatterjee, K., De Alfaro, L., &#38; Henzinger, T. A. (2004). Trading memory for randomness (pp. 206–217). Presented at the QEST: Quantitative Evaluation of Systems, IEEE. <a href=\"https://doi.org/10.1109/QEST.2004.10051\">https://doi.org/10.1109/QEST.2004.10051</a>","mla":"Chatterjee, Krishnendu, et al. <i>Trading Memory for Randomness</i>. IEEE, 2004, pp. 206–17, doi:<a href=\"https://doi.org/10.1109/QEST.2004.10051\">10.1109/QEST.2004.10051</a>.","ista":"Chatterjee K, De Alfaro L, Henzinger TA. 2004. Trading memory for randomness. QEST: Quantitative Evaluation of Systems, 206–217."},"status":"public","title":"Trading memory for randomness","date_created":"2018-12-11T12:09:27Z","publist_id":"155","page":"206 - 217","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Krishnendu Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"De Alfaro","first_name":"Luca","full_name":"de Alfaro, Luca"},{"first_name":"Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger"}],"date_updated":"2021-01-12T07:59:40Z","abstract":[{"text":"Strategies in repeated games can be classified as to whether or not they use memory and/or randomization. We consider Markov decision processes and 2-player graph games, both of the deterministic and probabilistic varieties. We characterize when memory and/or randomization are required for winning with respect to various classes of w-regular objectives, noting particularly when the use of memory can be traded for the use of randomization. In particular, we show that Markov decision processes allow randomized memoryless optimal strategies for all M?ller objectives. Furthermore, we show that 2-player probabilistic graph games allow randomized memoryless strategies for winning with probability 1 those M?ller objectives which are upward-closed. Upward-closure means that if a set α of infinitely repeating vertices is winning, then all supersets of α are also winning.","lang":"eng"}],"day":"30","month":"09","type":"conference","_id":"4555","publisher":"IEEE","year":"2004"},{"status":"public","extern":1,"intvolume":"       194","issue":"2","citation":{"short":"K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T.A. Henzinger, J. Palsberg, Information and Computation 194 (2004) 144–174.","ieee":"K. Chatterjee, D. Ma, R. Majumdar, T. Zhao, T. A. Henzinger, and J. Palsberg, “Stack size analysis for interrupt-driven programs,” <i>Information and Computation</i>, vol. 194, no. 2. Elsevier, pp. 144–174, 2004.","chicago":"Chatterjee, Krishnendu, Di Ma, Ritankar Majumdar, Tian Zhao, Thomas A Henzinger, and Jens Palsberg. “Stack Size Analysis for Interrupt-Driven Programs.” <i>Information and Computation</i>. Elsevier, 2004. <a href=\"https://doi.org/10.1016/j.ic.2004.06.001\">https://doi.org/10.1016/j.ic.2004.06.001</a>.","mla":"Chatterjee, Krishnendu, et al. “Stack Size Analysis for Interrupt-Driven Programs.” <i>Information and Computation</i>, vol. 194, no. 2, Elsevier, 2004, pp. 144–74, doi:<a href=\"https://doi.org/10.1016/j.ic.2004.06.001\">10.1016/j.ic.2004.06.001</a>.","ista":"Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. 2004. Stack size analysis for interrupt-driven programs. Information and Computation. 194(2), 144–174.","apa":"Chatterjee, K., Ma, D., Majumdar, R., Zhao, T., Henzinger, T. A., &#38; Palsberg, J. (2004). Stack size analysis for interrupt-driven programs. <i>Information and Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ic.2004.06.001\">https://doi.org/10.1016/j.ic.2004.06.001</a>","ama":"Chatterjee K, Ma D, Majumdar R, Zhao T, Henzinger TA, Palsberg J. Stack size analysis for interrupt-driven programs. <i>Information and Computation</i>. 2004;194(2):144-174. doi:<a href=\"https://doi.org/10.1016/j.ic.2004.06.001\">10.1016/j.ic.2004.06.001</a>"},"publication_status":"published","doi":"10.1016/j.ic.2004.06.001","date_published":"2004-08-11T00:00:00Z","quality_controlled":0,"publisher":"Elsevier","year":"2004","_id":"4556","publication":"Information and Computation","page":"144 - 174","author":[{"full_name":"Krishnendu Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Ma","first_name":"Di","full_name":"Ma, Di"},{"first_name":"Ritankar","last_name":"Majumdar","full_name":"Majumdar, Ritankar S"},{"full_name":"Zhao, Tian","last_name":"Zhao","first_name":"Tian"},{"full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Palsberg, Jens","first_name":"Jens","last_name":"Palsberg"}],"month":"08","type":"journal_article","day":"11","abstract":[{"text":"We study the problem of determining stack boundedness and the exact maximum stack size for three classes of interrupt-driven programs. Interrupt-driven programs are used in many real-time applications that require responsive interrupt handling. In order to ensure responsiveness, programmers often enable interrupt processing in the body of lower-priority interrupt handlers. In such programs a programming error can allow interrupt handlers to be interrupted in a cyclic fashion to lead to an unbounded stack, causing the system to crash. For a restricted class of interrupt-driven programs, we show that there is a polynomial-time procedure to check stack boundedness, while determining the exact maximum stack size is PSPACE-complete. For a larger class of programs, the two problems are both PSPACE-complete, and for the largest class of programs we consider, the two problems are PSPACE-hard and can be solved in exponential time. While the complexities are high, our algorithms are exponential only in the number of handlers, and polynomial in the size of the program.","lang":"eng"}],"date_updated":"2021-01-12T07:59:40Z","title":"Stack size analysis for interrupt-driven programs","volume":194,"date_created":"2018-12-11T12:09:28Z","publist_id":"156"},{"publist_id":"153","date_created":"2018-12-11T12:09:28Z","title":"Quantitative stochastic parity games","month":"01","type":"conference","date_updated":"2021-01-12T07:59:41Z","day":"01","abstract":[{"lang":"eng","text":"We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play results in an infinite path and the conflicting goals of the two players are ω-regular path properties, formalized as parity winning conditions. The qualitative solution of such a game amounts to computing the set of vertices from which a player has a strategy to win with probability 1 (or with positive probability). The quantitative solution amounts to computing the value of the game in every vertex, i.e., the highest probability with which a player can guarantee satisfaction of his own objective in a play that starts from the vertex.For the important special case of one-player stochastic parity games (parity Markov decision processes) we give polynomial-time algorithms both for the qualitative and the quantitative solution. The running time of the qualitative solution is O(d · m3/2) for graphs with m edges and d priorities. The quantitative solution is based on a linear-programming formulation.For the two-player case, we establish the existence of optimal pure memoryless strategies. This has several important ramifications. First, it implies that the values of the games are rational. This is in contrast to the concurrent stochastic parity games of de Alfaro et al.; there, values are in general algebraic numbers, optimal strategies do not exist, and ε-optimal strategies have to be mixed and with infinite memory. Second, the existence of optimal pure memoryless strategies together with the polynomial-time solution forone-player case implies that the quantitative two-player stochastic parity game problem is in NP ∩ co-NP. This generalizes a result of Condon for stochastic games with reachability objectives. It also constitutes an exponential improvement over the best previous algorithm, which is based on a doubly exponential procedure of de Alfaro and Majumdar for concurrent stochastic parity games and provides only ε-approximations of the values."}],"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Krishnendu Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Jurdziński, Marcin","first_name":"Marcin","last_name":"Jurdziński"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"}],"page":"121 - 130","_id":"4558","year":"2004","publisher":"SIAM","quality_controlled":0,"date_published":"2004-01-01T00:00:00Z","publication_status":"published","citation":{"apa":"Chatterjee, K., Jurdziński, M., &#38; Henzinger, T. A. (2004). Quantitative stochastic parity games (pp. 121–130). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.","mla":"Chatterjee, Krishnendu, et al. <i>Quantitative Stochastic Parity Games</i>. SIAM, 2004, pp. 121–30.","ista":"Chatterjee K, Jurdziński M, Henzinger TA. 2004. Quantitative stochastic parity games. SODA: Symposium on Discrete Algorithms, 121–130.","ama":"Chatterjee K, Jurdziński M, Henzinger TA. Quantitative stochastic parity games. In: SIAM; 2004:121-130.","short":"K. Chatterjee, M. Jurdziński, T.A. Henzinger, in:, SIAM, 2004, pp. 121–130.","chicago":"Chatterjee, Krishnendu, Marcin Jurdziński, and Thomas A Henzinger. “Quantitative Stochastic Parity Games,” 121–30. SIAM, 2004.","ieee":"K. Chatterjee, M. Jurdziński, and T. A. Henzinger, “Quantitative stochastic parity games,” presented at the SODA: Symposium on Discrete Algorithms, 2004, pp. 121–130."},"conference":{"name":"SODA: Symposium on Discrete Algorithms"},"extern":1,"status":"public"},{"extern":1,"intvolume":"        53","citation":{"ista":"Coesmans M, Sillevis Smitt P, Linden D, Shigemoto R, Hirano T, Yamakawa Y, Van Alphen A, Luo C, Van Der Geest J, Kros J, Gaillard C, Frens M, De Zeeuw C. 2003. Mechanisms underlying cerebellar motor deficits due to mGluR1-autoantibodies. Annals of Neurology. 53(3), 325–336.","mla":"Coesmans, Michiel, et al. “Mechanisms Underlying Cerebellar Motor Deficits Due to MGluR1-Autoantibodies.” <i>Annals of Neurology</i>, vol. 53, no. 3, Wiley-Blackwell, 2003, pp. 325–36, doi:<a href=\"https://doi.org/10.1002/ana.10451\">10.1002/ana.10451</a>.","apa":"Coesmans, M., Sillevis Smitt, P., Linden, D., Shigemoto, R., Hirano, T., Yamakawa, Y., … De Zeeuw, C. (2003). Mechanisms underlying cerebellar motor deficits due to mGluR1-autoantibodies. <i>Annals of Neurology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/ana.10451\">https://doi.org/10.1002/ana.10451</a>","ama":"Coesmans M, Sillevis Smitt P, Linden D, et al. Mechanisms underlying cerebellar motor deficits due to mGluR1-autoantibodies. <i>Annals of Neurology</i>. 2003;53(3):325-336. doi:<a href=\"https://doi.org/10.1002/ana.10451\">10.1002/ana.10451</a>","short":"M. Coesmans, P. Sillevis Smitt, D. Linden, R. Shigemoto, T. Hirano, Y. Yamakawa, A. Van Alphen, C. Luo, J. Van Der Geest, J. Kros, C. Gaillard, M. Frens, C. De Zeeuw, Annals of Neurology 53 (2003) 325–336.","ieee":"M. Coesmans <i>et al.</i>, “Mechanisms underlying cerebellar motor deficits due to mGluR1-autoantibodies,” <i>Annals of Neurology</i>, vol. 53, no. 3. Wiley-Blackwell, pp. 325–336, 2003.","chicago":"Coesmans, Michiel, Peter Sillevis Smitt, David Linden, Ryuichi Shigemoto, Tomoo Hirano, Yoshinori Yamakawa, Adriaan Van Alphen, et al. “Mechanisms Underlying Cerebellar Motor Deficits Due to MGluR1-Autoantibodies.” <i>Annals of Neurology</i>. Wiley-Blackwell, 2003. <a href=\"https://doi.org/10.1002/ana.10451\">https://doi.org/10.1002/ana.10451</a>."},"issue":"3","status":"public","doi":"10.1002/ana.10451","date_published":"2003-03-01T00:00:00Z","quality_controlled":0,"publication_status":"published","publication":"Annals of Neurology","_id":"2623","publisher":"Wiley-Blackwell","year":"2003","title":"Mechanisms underlying cerebellar motor deficits due to mGluR1-autoantibodies","volume":53,"date_created":"2018-12-11T11:58:44Z","publist_id":"4274","author":[{"full_name":"Coesmans, Michiel P","last_name":"Coesmans","first_name":"Michiel"},{"last_name":"Sillevis Smitt","first_name":"Peter","full_name":"Sillevis-Smitt, Peter A"},{"full_name":"Linden, David J","first_name":"David","last_name":"Linden"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","full_name":"Ryuichi Shigemoto","last_name":"Shigemoto","first_name":"Ryuichi"},{"first_name":"Tomoo","last_name":"Hirano","full_name":"Hirano, Tomoo"},{"full_name":"Yamakawa, Yoshinori","first_name":"Yoshinori","last_name":"Yamakawa"},{"first_name":"Adriaan","last_name":"Van Alphen","full_name":"Van Alphen, Adriaan M"},{"last_name":"Luo","first_name":"Chongde","full_name":"Luo, Chongde"},{"full_name":"Van Der Geest, Jos N","first_name":"Jos","last_name":"Van Der Geest"},{"full_name":"Kros, Johan M","first_name":"Johan","last_name":"Kros"},{"full_name":"Gaillard, Carlo A","first_name":"Carlo","last_name":"Gaillard"},{"full_name":"Frens, Maarten A","last_name":"Frens","first_name":"Maarten"},{"full_name":"De Zeeuw, Chris I","last_name":"De Zeeuw","first_name":"Chris"}],"page":"325 - 336","date_updated":"2021-01-12T06:58:39Z","abstract":[{"text":"Patients with Hodgkin's disease can develop paraneoplastic cerebellar ataxia because of the generation of autoantibodies against mGluR1 (mGluR1-Abs). Yet, the pathophysiological mechanisms underlying their motor coordination deficits remain to be elucidated. Here, we show that application of IgG purified from the patients' serum to cerebellar slices of mice acutely reduces the basal activity of Purkinje cells, whereas application to the flocculus of mice in vivo evokes acute disturbances in the performance of their compensatory eye movements. In addition, the mGluR1-Abs block induction of long-term depression in cultured mouse Purkinje cells, whereas the cerebellar motor learning behavior of the patients is affected in that they show impaired adaptation of their saccadic eye movements. Finally, postmortem analysis of the cerebellum of a paraneoplastic cerebellar ataxia patient showed that the number of Purkinje cells was significantly reduced by approximately two thirds compared with three controls. We conclude that autoantibodies against mGluR1 can cause cerebellar motor coordination deficits caused by a combination of rapid effects on both acute and plastic responses of Purkinje cells and chronic degenerative effects.","lang":"eng"}],"day":"01","month":"03","type":"journal_article"},{"publication":"European Journal of Neuroscience","_id":"2625","publisher":"Wiley-Blackwell","year":"2003","title":"Long-term potentiation of mGluR1 activity by depolarization-induced Homer1a in mouse cerebellar Purkinje neurons","volume":17,"publist_id":"4273","date_created":"2018-12-11T11:58:44Z","page":"1023 - 1032","author":[{"last_name":"Minami","first_name":"Itsunari","full_name":"Minami, Itsunari"},{"first_name":"Mineko","last_name":"Kengaku","full_name":"Kengaku, Mineko"},{"full_name":"Smitt, Sillevis P","last_name":"Smitt","first_name":"Sillevis"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","full_name":"Ryuichi Shigemoto","first_name":"Ryuichi","last_name":"Shigemoto"},{"first_name":"Tomoo","last_name":"Hirano","full_name":"Hirano, Tomoo"}],"date_updated":"2021-01-12T06:58:39Z","abstract":[{"text":"Metabotropic glutamate receptor 1 (mGluR1) plays a crucial role in synaptic plasticity and motor learning in the cerebellum. We have studied activity-dependent changes in mGluR1 function in mouse cultured Purkinje neurons. Depolarizing stimulation potentiated Ca2+ and current responses to an mGluR1 agonist for several hours in the cultured Purkinje neurons. It also blocked internalization of mGluR1 and increased the number of mGluR1s on the cell membrane. We found that depolarization simultaneously increased transcription of Homer1a in Purkinje neurons. Homer1a inhibited internalization and increased cell-surface expression of mGluR1 when coexpressed in human embryonic kidney (HEK)-293 cells. Depolarization-induced Homer1a expression in Purkinje neurons was blocked by a mitogen-activated protein kinase (MAPK) inhibitor. Changes in internalization and mGluR1-mediated Ca2+ response were also blocked by inhibition of MAPK activity, suggesting that localization and activity of mGluR1 were regulated in the same signalling pathway as Homer1a expression. It is thus suggested that depolarization of the Purkinje neuron leads to the increment in mGluR1 responsiveness through MAPK activity and induction of Homer1a expression, which increases active mGluR1 on the cell surface by blocking internalization of mGluR1.","lang":"eng"}],"day":"01","type":"journal_article","month":"03","extern":1,"intvolume":"        17","citation":{"ama":"Minami I, Kengaku M, Smitt S, Shigemoto R, Hirano T. Long-term potentiation of mGluR1 activity by depolarization-induced Homer1a in mouse cerebellar Purkinje neurons. <i>European Journal of Neuroscience</i>. 2003;17(5):1023-1032. doi:<a href=\"https://doi.org/10.1046/j.1460-9568.2003.02499.x\">10.1046/j.1460-9568.2003.02499.x</a>","mla":"Minami, Itsunari, et al. “Long-Term Potentiation of MGluR1 Activity by Depolarization-Induced Homer1a in Mouse Cerebellar Purkinje Neurons.” <i>European Journal of Neuroscience</i>, vol. 17, no. 5, Wiley-Blackwell, 2003, pp. 1023–32, doi:<a href=\"https://doi.org/10.1046/j.1460-9568.2003.02499.x\">10.1046/j.1460-9568.2003.02499.x</a>.","ista":"Minami I, Kengaku M, Smitt S, Shigemoto R, Hirano T. 2003. Long-term potentiation of mGluR1 activity by depolarization-induced Homer1a in mouse cerebellar Purkinje neurons. European Journal of Neuroscience. 17(5), 1023–1032.","apa":"Minami, I., Kengaku, M., Smitt, S., Shigemoto, R., &#38; Hirano, T. (2003). Long-term potentiation of mGluR1 activity by depolarization-induced Homer1a in mouse cerebellar Purkinje neurons. <i>European Journal of Neuroscience</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1046/j.1460-9568.2003.02499.x\">https://doi.org/10.1046/j.1460-9568.2003.02499.x</a>","ieee":"I. Minami, M. Kengaku, S. Smitt, R. Shigemoto, and T. Hirano, “Long-term potentiation of mGluR1 activity by depolarization-induced Homer1a in mouse cerebellar Purkinje neurons,” <i>European Journal of Neuroscience</i>, vol. 17, no. 5. Wiley-Blackwell, pp. 1023–1032, 2003.","chicago":"Minami, Itsunari, Mineko Kengaku, Sillevis Smitt, Ryuichi Shigemoto, and Tomoo Hirano. “Long-Term Potentiation of MGluR1 Activity by Depolarization-Induced Homer1a in Mouse Cerebellar Purkinje Neurons.” <i>European Journal of Neuroscience</i>. Wiley-Blackwell, 2003. <a href=\"https://doi.org/10.1046/j.1460-9568.2003.02499.x\">https://doi.org/10.1046/j.1460-9568.2003.02499.x</a>.","short":"I. Minami, M. Kengaku, S. Smitt, R. Shigemoto, T. Hirano, European Journal of Neuroscience 17 (2003) 1023–1032."},"issue":"5","status":"public","date_published":"2003-03-01T00:00:00Z","doi":"10.1046/j.1460-9568.2003.02499.x","quality_controlled":0,"publication_status":"published"},{"year":"2003","publisher":"Lippincott, Williams & Wilkins","_id":"2626","publication":"Neuroreport","month":"05","type":"journal_article","abstract":[{"lang":"eng","text":"The expression pattern of metabotropic glutamate receptor Iα (mGluR1α) was immunohistochemically investigated in substantia nigra dopaminergic neurons of the macaque monkey. In normal monkeys, mGluR1α immunoreactivity was weakly observed in the dorsal tier of the substantia nigra pars compacta (SNc-d) where calbindin-D28k-containing dopaminergic neurons invulnerable to parkinsonian degeneration are specifically located. On the other hand, mGluR1α was strongly expressed in the ventral tier of the substantia nigra pars cornpacta (SNc-v). In monkeys treated with the parkinsonism-inducing drug, I-methyl-4-phenyl-1,2,3,6-tetrahydropyridine (MPTP), mGluR1α expression was decreased in dopaminergic neurons in the SNc-v that were spared its toxic action. These results suggest that mGluR1α expression may be involved at least partly in the vulnerability of dopaminergic neurons to parkinsonian insults."}],"date_updated":"2021-01-12T06:58:40Z","day":"01","author":[{"first_name":"Katsuyuki","last_name":"Kaneda","full_name":"Kaneda, Katsuyuki"},{"last_name":"Imanishi","first_name":"Michiko","full_name":"Imanishi, Michiko"},{"first_name":"Atsushi","last_name":"Nambu","full_name":"Nambu, Atsushi"},{"full_name":"Ryuichi Shigemoto","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","last_name":"Shigemoto","first_name":"Ryuichi"},{"full_name":"Takada, Masahiko","first_name":"Masahiko","last_name":"Takada"}],"page":"947 - 950","publist_id":"4272","date_created":"2018-12-11T11:58:45Z","volume":14,"title":"Differential expression patterns of mGluR1α in monkey nigral dopamine neurons","status":"public","issue":"7","citation":{"short":"K. Kaneda, M. Imanishi, A. Nambu, R. Shigemoto, M. Takada, Neuroreport 14 (2003) 947–950.","ieee":"K. Kaneda, M. Imanishi, A. Nambu, R. Shigemoto, and M. Takada, “Differential expression patterns of mGluR1α in monkey nigral dopamine neurons,” <i>Neuroreport</i>, vol. 14, no. 7. Lippincott, Williams &#38; Wilkins, pp. 947–950, 2003.","chicago":"Kaneda, Katsuyuki, Michiko Imanishi, Atsushi Nambu, Ryuichi Shigemoto, and Masahiko Takada. “Differential Expression Patterns of MGluR1α in Monkey Nigral Dopamine Neurons.” <i>Neuroreport</i>. Lippincott, Williams &#38; Wilkins, 2003. <a href=\"https://doi.org/10.1097/01.wnr.0000074344.81633.e4\">https://doi.org/10.1097/01.wnr.0000074344.81633.e4</a>.","mla":"Kaneda, Katsuyuki, et al. “Differential Expression Patterns of MGluR1α in Monkey Nigral Dopamine Neurons.” <i>Neuroreport</i>, vol. 14, no. 7, Lippincott, Williams &#38; Wilkins, 2003, pp. 947–50, doi:<a href=\"https://doi.org/10.1097/01.wnr.0000074344.81633.e4\">10.1097/01.wnr.0000074344.81633.e4</a>.","ista":"Kaneda K, Imanishi M, Nambu A, Shigemoto R, Takada M. 2003. Differential expression patterns of mGluR1α in monkey nigral dopamine neurons. Neuroreport. 14(7), 947–950.","apa":"Kaneda, K., Imanishi, M., Nambu, A., Shigemoto, R., &#38; Takada, M. (2003). Differential expression patterns of mGluR1α in monkey nigral dopamine neurons. <i>Neuroreport</i>. Lippincott, Williams &#38; Wilkins. <a href=\"https://doi.org/10.1097/01.wnr.0000074344.81633.e4\">https://doi.org/10.1097/01.wnr.0000074344.81633.e4</a>","ama":"Kaneda K, Imanishi M, Nambu A, Shigemoto R, Takada M. Differential expression patterns of mGluR1α in monkey nigral dopamine neurons. <i>Neuroreport</i>. 2003;14(7):947-950. doi:<a href=\"https://doi.org/10.1097/01.wnr.0000074344.81633.e4\">10.1097/01.wnr.0000074344.81633.e4</a>"},"extern":1,"intvolume":"        14","publication_status":"published","quality_controlled":0,"doi":"10.1097/01.wnr.0000074344.81633.e4","date_published":"2003-05-01T00:00:00Z"},{"publication":"Science","_id":"2627","year":"2003","publisher":"American Association for the Advancement of Science","publist_id":"4271","date_created":"2018-12-11T11:58:45Z","volume":300,"title":"Asymmetrical allocation of NMDA receptor ε2 subunits in hippocampal circuitry","day":"09","abstract":[{"lang":"eng","text":"Despite its implications for higher order functions of the brain, little is currently known about the molecular basis of left-right asymmetry of the brain. Here we report that synaptic distribution of N-methyl-D-aspartate (NMDA) receptor GluRε2 (NR2B) subunits in the adult mouse hippocampus is asymmetrical between the left and right and between the apical and basal dendrites of single neurons. These asymmetrical allocations of ε2 subunits differentiate the properties of NMDA receptors and synaptic plasticity between the left and right hippocampus. These results provide a molecular basis for the structural and functional asymmetry of the mature brain."}],"date_updated":"2021-01-12T06:58:40Z","month":"05","type":"journal_article","page":"990 - 994","author":[{"last_name":"Kawakami","first_name":"Ryosuke","full_name":"Kawakami, Ryosuke"},{"first_name":"Yoshiaki","last_name":"Shinohara","full_name":"Shinohara, Yoshiaki"},{"full_name":"Kato, Yuichiro","first_name":"Yuichiro","last_name":"Kato"},{"last_name":"Sugiyama","first_name":"Hiroyuki","full_name":"Sugiyama, Hiroyuki"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","full_name":"Ryuichi Shigemoto","last_name":"Shigemoto","first_name":"Ryuichi"},{"last_name":"Ito","first_name":"Isao","full_name":"Ito, Isao"}],"citation":{"apa":"Kawakami, R., Shinohara, Y., Kato, Y., Sugiyama, H., Shigemoto, R., &#38; Ito, I. (2003). Asymmetrical allocation of NMDA receptor ε2 subunits in hippocampal circuitry. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1082609\">https://doi.org/10.1126/science.1082609</a>","ista":"Kawakami R, Shinohara Y, Kato Y, Sugiyama H, Shigemoto R, Ito I. 2003. Asymmetrical allocation of NMDA receptor ε2 subunits in hippocampal circuitry. Science. 300(5621), 990–994.","mla":"Kawakami, Ryosuke, et al. “Asymmetrical Allocation of NMDA Receptor Ε2 Subunits in Hippocampal Circuitry.” <i>Science</i>, vol. 300, no. 5621, American Association for the Advancement of Science, 2003, pp. 990–94, doi:<a href=\"https://doi.org/10.1126/science.1082609\">10.1126/science.1082609</a>.","ama":"Kawakami R, Shinohara Y, Kato Y, Sugiyama H, Shigemoto R, Ito I. Asymmetrical allocation of NMDA receptor ε2 subunits in hippocampal circuitry. <i>Science</i>. 2003;300(5621):990-994. doi:<a href=\"https://doi.org/10.1126/science.1082609\">10.1126/science.1082609</a>","short":"R. Kawakami, Y. Shinohara, Y. Kato, H. Sugiyama, R. Shigemoto, I. Ito, Science 300 (2003) 990–994.","chicago":"Kawakami, Ryosuke, Yoshiaki Shinohara, Yuichiro Kato, Hiroyuki Sugiyama, Ryuichi Shigemoto, and Isao Ito. “Asymmetrical Allocation of NMDA Receptor Ε2 Subunits in Hippocampal Circuitry.” <i>Science</i>. American Association for the Advancement of Science, 2003. <a href=\"https://doi.org/10.1126/science.1082609\">https://doi.org/10.1126/science.1082609</a>.","ieee":"R. Kawakami, Y. Shinohara, Y. Kato, H. Sugiyama, R. Shigemoto, and I. Ito, “Asymmetrical allocation of NMDA receptor ε2 subunits in hippocampal circuitry,” <i>Science</i>, vol. 300, no. 5621. American Association for the Advancement of Science, pp. 990–994, 2003."},"issue":"5621","extern":1,"intvolume":"       300","status":"public","quality_controlled":0,"date_published":"2003-05-09T00:00:00Z","doi":"10.1126/science.1082609","publication_status":"published"},{"type":"journal_article","month":"05","day":"15","date_updated":"2021-01-12T06:58:40Z","abstract":[{"text":"We aimed to estimate the number of AMPA receptors (AMPARs) bound by the quantal transmitter packet, their single-channel conductance and their density in the postsynaptic membrane at cerebellar Purkinje cell synapses. The synaptic and extrasynaptic AMPARs were examined in Purkinje cells in 2- to 4-day-old rats, when they receive synaptic inputs solely from climbing fibres (CFs). Evoked CF EPSCs and whole-cell AMPA currents displayed roughly linear current-voltage relationships, consistent with the presence of GluR2 subunits in synaptic and extrasynaptic AMPARs. The mean quantal size, estimated from the miniature EPSCs (MEPSCs), was ∼300 pS. Peak-scaled non-stationary fluctuation analysis of spontaneous EPSCs and MEPSCs gave a weighted-mean synaptic channel conductance of ∼5 pS (∼7 pS when corrected for filtering). By applying non-stationary fluctuation analysis to extrasynaptic currents activated by brief glutamate pulses (5 mM), we also obtained a small single-channel conductance estimate for extrasynaptic AMPARs (∼11 pS). This approach allowed us to obtain a maximum open probability (Po,max) value for the extrasynaptic receptors (Po,max = 0.72). Directly resolved extrasynaptic channel openings in the continued presence of glutamate exhibited clear multiple-conductance levels. The mean area of the postsynaptic density (PSD) of these synapses was 0.074 μm2, measured by reconstructing electron-microscopic (EM) serial sections. Postembedding immunogold labelling by anti-GluR2/3 antibody revealed that AMPARs are localised in PSDs. From these data and by simulating error factors, we estimate that at least 66 AMPARs are bound by a quantal transmitter packet at CF-Purkinje cell synapses, and the receptors are packed at a minimum density of ∼900 μm-2 in the postsynaptic membrane.","lang":"eng"}],"author":[{"full_name":"Momiyama, Akiko","last_name":"Momiyama","first_name":"Akiko"},{"first_name":"Rachel","last_name":"Silver","full_name":"Silver, Rachel A"},{"full_name":"Häusser, Michael A","first_name":"Michael","last_name":"Häusser"},{"full_name":"Notomi, Takuya","first_name":"Takuya","last_name":"Notomi"},{"full_name":"Wu, Yue","first_name":"Yue","last_name":"Wu"},{"first_name":"Ryuichi","last_name":"Shigemoto","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","full_name":"Ryuichi Shigemoto"},{"full_name":"Cull-Candy, Stuart G","first_name":"Stuart","last_name":"Cull Candy"}],"page":"75 - 92","publist_id":"4270","date_created":"2018-12-11T11:58:45Z","volume":549,"title":"The density of AMPA receptors activated by a transmitter quantum at the climbing fibre - Purkinje cell synapse in immature rats","year":"2003","publisher":"Wiley-Blackwell","_id":"2628","publication":"Journal of Physiology","publication_status":"published","quality_controlled":0,"doi":"10.1113/jphysiol.2002.033472","date_published":"2003-05-15T00:00:00Z","status":"public","issue":"1","citation":{"ama":"Momiyama A, Silver R, Häusser M, et al. The density of AMPA receptors activated by a transmitter quantum at the climbing fibre - Purkinje cell synapse in immature rats. <i>Journal of Physiology</i>. 2003;549(1):75-92. doi:<a href=\"https://doi.org/10.1113/jphysiol.2002.033472\">10.1113/jphysiol.2002.033472</a>","apa":"Momiyama, A., Silver, R., Häusser, M., Notomi, T., Wu, Y., Shigemoto, R., &#38; Cull Candy, S. (2003). The density of AMPA receptors activated by a transmitter quantum at the climbing fibre - Purkinje cell synapse in immature rats. <i>Journal of Physiology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1113/jphysiol.2002.033472\">https://doi.org/10.1113/jphysiol.2002.033472</a>","ista":"Momiyama A, Silver R, Häusser M, Notomi T, Wu Y, Shigemoto R, Cull Candy S. 2003. The density of AMPA receptors activated by a transmitter quantum at the climbing fibre - Purkinje cell synapse in immature rats. Journal of Physiology. 549(1), 75–92.","mla":"Momiyama, Akiko, et al. “The Density of AMPA Receptors Activated by a Transmitter Quantum at the Climbing Fibre - Purkinje Cell Synapse in Immature Rats.” <i>Journal of Physiology</i>, vol. 549, no. 1, Wiley-Blackwell, 2003, pp. 75–92, doi:<a href=\"https://doi.org/10.1113/jphysiol.2002.033472\">10.1113/jphysiol.2002.033472</a>.","chicago":"Momiyama, Akiko, Rachel Silver, Michael Häusser, Takuya Notomi, Yue Wu, Ryuichi Shigemoto, and Stuart Cull Candy. “The Density of AMPA Receptors Activated by a Transmitter Quantum at the Climbing Fibre - Purkinje Cell Synapse in Immature Rats.” <i>Journal of Physiology</i>. Wiley-Blackwell, 2003. <a href=\"https://doi.org/10.1113/jphysiol.2002.033472\">https://doi.org/10.1113/jphysiol.2002.033472</a>.","ieee":"A. Momiyama <i>et al.</i>, “The density of AMPA receptors activated by a transmitter quantum at the climbing fibre - Purkinje cell synapse in immature rats,” <i>Journal of Physiology</i>, vol. 549, no. 1. Wiley-Blackwell, pp. 75–92, 2003.","short":"A. Momiyama, R. Silver, M. Häusser, T. Notomi, Y. Wu, R. Shigemoto, S. Cull Candy, Journal of Physiology 549 (2003) 75–92."},"intvolume":"       549","extern":1},{"publication_status":"published","doi":"10.1046/j.1460-9568.2003.02697.x","date_published":"2003-06-01T00:00:00Z","quality_controlled":0,"status":"public","extern":1,"intvolume":"        17","issue":"12","citation":{"short":"P. Somogyi, Y. Dalezios, R. Luján, J. Roberts, M. Watanabe, R. Shigemoto, European Journal of Neuroscience 17 (2003) 2503–2520.","ieee":"P. Somogyi, Y. Dalezios, R. Luján, J. Roberts, M. Watanabe, and R. Shigemoto, “High level of mGluR7 in the presynaptic active zones of select populations of GABAergic terminals innervating interneurons in the rat hippocampus,” <i>European Journal of Neuroscience</i>, vol. 17, no. 12. Wiley-Blackwell, pp. 2503–2520, 2003.","chicago":"Somogyi, Péter, Yannis Dalezios, Rafael Luján, John Roberts, Masahiko Watanabe, and Ryuichi Shigemoto. “High Level of MGluR7 in the Presynaptic Active Zones of Select Populations of GABAergic Terminals Innervating Interneurons in the Rat Hippocampus.” <i>European Journal of Neuroscience</i>. Wiley-Blackwell, 2003. <a href=\"https://doi.org/10.1046/j.1460-9568.2003.02697.x\">https://doi.org/10.1046/j.1460-9568.2003.02697.x</a>.","ista":"Somogyi P, Dalezios Y, Luján R, Roberts J, Watanabe M, Shigemoto R. 2003. High level of mGluR7 in the presynaptic active zones of select populations of GABAergic terminals innervating interneurons in the rat hippocampus. European Journal of Neuroscience. 17(12), 2503–2520.","mla":"Somogyi, Péter, et al. “High Level of MGluR7 in the Presynaptic Active Zones of Select Populations of GABAergic Terminals Innervating Interneurons in the Rat Hippocampus.” <i>European Journal of Neuroscience</i>, vol. 17, no. 12, Wiley-Blackwell, 2003, pp. 2503–20, doi:<a href=\"https://doi.org/10.1046/j.1460-9568.2003.02697.x\">10.1046/j.1460-9568.2003.02697.x</a>.","apa":"Somogyi, P., Dalezios, Y., Luján, R., Roberts, J., Watanabe, M., &#38; Shigemoto, R. (2003). High level of mGluR7 in the presynaptic active zones of select populations of GABAergic terminals innervating interneurons in the rat hippocampus. <i>European Journal of Neuroscience</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1046/j.1460-9568.2003.02697.x\">https://doi.org/10.1046/j.1460-9568.2003.02697.x</a>","ama":"Somogyi P, Dalezios Y, Luján R, Roberts J, Watanabe M, Shigemoto R. High level of mGluR7 in the presynaptic active zones of select populations of GABAergic terminals innervating interneurons in the rat hippocampus. <i>European Journal of Neuroscience</i>. 2003;17(12):2503-2520. doi:<a href=\"https://doi.org/10.1046/j.1460-9568.2003.02697.x\">10.1046/j.1460-9568.2003.02697.x</a>"},"page":"2503 - 2520","author":[{"full_name":"Somogyi, Péter","last_name":"Somogyi","first_name":"Péter"},{"last_name":"Dalezios","first_name":"Yannis","full_name":"Dalezios, Yannis"},{"full_name":"Luján, Rafael","last_name":"Luján","first_name":"Rafael"},{"last_name":"Roberts","first_name":"John","full_name":"Roberts, John D"},{"full_name":"Watanabe, Masahiko","last_name":"Watanabe","first_name":"Masahiko"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","full_name":"Ryuichi Shigemoto","last_name":"Shigemoto","first_name":"Ryuichi"}],"type":"journal_article","month":"06","day":"01","date_updated":"2021-01-12T06:58:41Z","abstract":[{"lang":"eng","text":"The release of neurotransmitters is modulated by presynaptic metabotropic glutamate receptors (mGluRs), which show a highly selective expression and subcellular location in glutamatergic terminals in the hippocampus. Using immunocytochemistry, we investigated whether one of the receptors, mGluR7, whose level of expression is governed by the postsynaptic target, was present in GABAergic terminals and whether such terminals targeted particular cells. A total of 165 interneuron dendritic profiles receiving 466 synapses (82% mGluR7a-positive) were analysed. The presynaptic active zones of most GAD-(77%) or GABA-positive (94%) synaptic boutons on interneurons innervated by mGluR7a-enriched glutamatergic terminals (mGluR7a-decorated) were immunopositive for mGluR7a. GABAergic terminals on pyramidal cells and most other interneurons in str. oriens were mGluR7a-immunonegative. The mGluR7a-decorated cells were mostly somatostatin- and mGluR1α-immunopositive neurons in str. oriens and the alveus. Their GABAergic input mainly originated from VIP-positive terminals, 90% of which expressed high levels of mGluR7a in the presynaptic active zone. Parvalbumin-positive synaptic terminals were rare on mGluR7a-decorated cells, but on these neurons 73% of them were mGluR7a-immunopositive. Some type II synapses innervating interneurons were immunopositive for mGluR7b, as were some type I synapses. Because not all target cells of VIP-positive neurons are known it has not been possible to determine whether mGluR7 is expressed in a target-cell-specific manner in the terminals of single GABAergic cells. The activation of mGluR7 may decrease GABA release to mGluR7-decorated cells at times of high pyramidal cell activity, which elevates extracellular glutamate levels. Alternatively, the presynaptic receptor may be activated by as yet unidentified endogenous ligands released by the GABAergic terminals or the postsynaptic dendrites."}],"title":"High level of mGluR7 in the presynaptic active zones of select populations of GABAergic terminals innervating interneurons in the rat hippocampus","volume":17,"publist_id":"4269","date_created":"2018-12-11T11:58:46Z","publisher":"Wiley-Blackwell","year":"2003","_id":"2629","publication":"European Journal of Neuroscience"},{"page":"29 - 35","author":[{"first_name":"Takashi","last_name":"Toyono","full_name":"Toyono, Takashi"},{"first_name":"Yuji","last_name":"Seta","full_name":"Seta, Yuji"},{"full_name":"Kataoka, Shinji","last_name":"Kataoka","first_name":"Shinji"},{"full_name":"Kawano, Shintaro","last_name":"Kawano","first_name":"Shintaro"},{"last_name":"Shigemoto","first_name":"Ryuichi","full_name":"Ryuichi Shigemoto","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Kuniaki","last_name":"Toyoshima","full_name":"Toyoshima, Kuniaki"}],"type":"journal_article","month":"07","abstract":[{"text":"Taste-metabotropic glutamate receptor 4 (taste-mGluR4) and the heteromers of T1R1 and T1R3 are candidate receptors involved in the sense of umami (monosodium glutamate) taste. Although the expression of group III mGluRs (taste-mGluR4) has been demonstrated in taste tissues, no mention has been made of the expression of group I mGluRs (mGluR1 and mGluR5) in taste tissues. We examined the expression of mGluR1 and mGluR5 in rat gustatory tissues by using reverse transcription-polymerase chain reaction (RT-PCR), in situ hybridization, immunohistochemistry and immunoelectron microscopy. RT-PCR assay showed that mGluR1α and mGluR1β mRNAs were expressed in circumvallate papillae, but mGluR5 mRNA was not expressed. The positive signals of mGluR1 mRNA were detected only in circumvallate taste buds by in situ hybridization analysis. In cryosections of fungiform, foliate and circumvallate papillae, the antibody against mGluRla gave intense labeling on the taste hairs in all taste pores examined. In the developing taste buds, the positive signals of mGluR1α in taste hairs gradually increased with the increase in number of taste bud cells. These results show that, in addition to taste-mGluR4 and the heteromer of T1R1 and T1R3, mGluR1α may function as a receptor for glutamate (umami) taste sensation.","lang":"eng"}],"day":"01","date_updated":"2021-01-12T06:58:41Z","volume":313,"title":"Expression of metabotropic glutamate receptor group I in rat gustatory papillae","publist_id":"4267","date_created":"2018-12-11T11:58:46Z","publisher":"Springer","year":"2003","_id":"2630","publication":"Cell and Tissue Research","publication_status":"published","doi":"10.1007/s00441-003-0740-2","date_published":"2003-07-01T00:00:00Z","quality_controlled":0,"status":"public","intvolume":"       313","extern":1,"issue":"1","citation":{"ama":"Toyono T, Seta Y, Kataoka S, Kawano S, Shigemoto R, Toyoshima K. Expression of metabotropic glutamate receptor group I in rat gustatory papillae. <i>Cell and Tissue Research</i>. 2003;313(1):29-35. doi:<a href=\"https://doi.org/10.1007/s00441-003-0740-2\">10.1007/s00441-003-0740-2</a>","ista":"Toyono T, Seta Y, Kataoka S, Kawano S, Shigemoto R, Toyoshima K. 2003. Expression of metabotropic glutamate receptor group I in rat gustatory papillae. Cell and Tissue Research. 313(1), 29–35.","mla":"Toyono, Takashi, et al. “Expression of Metabotropic Glutamate Receptor Group I in Rat Gustatory Papillae.” <i>Cell and Tissue Research</i>, vol. 313, no. 1, Springer, 2003, pp. 29–35, doi:<a href=\"https://doi.org/10.1007/s00441-003-0740-2\">10.1007/s00441-003-0740-2</a>.","apa":"Toyono, T., Seta, Y., Kataoka, S., Kawano, S., Shigemoto, R., &#38; Toyoshima, K. (2003). Expression of metabotropic glutamate receptor group I in rat gustatory papillae. <i>Cell and Tissue Research</i>. Springer. <a href=\"https://doi.org/10.1007/s00441-003-0740-2\">https://doi.org/10.1007/s00441-003-0740-2</a>","ieee":"T. Toyono, Y. Seta, S. Kataoka, S. Kawano, R. Shigemoto, and K. Toyoshima, “Expression of metabotropic glutamate receptor group I in rat gustatory papillae,” <i>Cell and Tissue Research</i>, vol. 313, no. 1. Springer, pp. 29–35, 2003.","chicago":"Toyono, Takashi, Yuji Seta, Shinji Kataoka, Shintaro Kawano, Ryuichi Shigemoto, and Kuniaki Toyoshima. “Expression of Metabotropic Glutamate Receptor Group I in Rat Gustatory Papillae.” <i>Cell and Tissue Research</i>. Springer, 2003. <a href=\"https://doi.org/10.1007/s00441-003-0740-2\">https://doi.org/10.1007/s00441-003-0740-2</a>.","short":"T. Toyono, Y. Seta, S. Kataoka, S. Kawano, R. Shigemoto, K. Toyoshima, Cell and Tissue Research 313 (2003) 29–35."}},{"quality_controlled":0,"date_published":"2003-06-01T00:00:00Z","doi":"10.1046/j.1471-4159.2003.01751.x","publication_status":"published","issue":"5","citation":{"ieee":"H. Higashida <i>et al.</i>, “Subtype-specific coupling with ADP-ribosyl cyclase of metabotropic glutamate receptors in retina, cervical superior ganglion and NG108-15 cells,” <i>Journal of Neurochemistry</i>, vol. 85, no. 5. Wiley-Blackwell, pp. 1148–1158, 2003.","chicago":"Higashida, Haruhiro, Jia Zhang, Sumiko Mochida, Xiao Chen, Yeonsook Shin, Mami Noda, Kazi Hossain, et al. “Subtype-Specific Coupling with ADP-Ribosyl Cyclase of Metabotropic Glutamate Receptors in Retina, Cervical Superior Ganglion and NG108-15 Cells.” <i>Journal of Neurochemistry</i>. Wiley-Blackwell, 2003. <a href=\"https://doi.org/10.1046/j.1471-4159.2003.01751.x\">https://doi.org/10.1046/j.1471-4159.2003.01751.x</a>.","short":"H. Higashida, J. Zhang, S. Mochida, X. Chen, Y. Shin, M. Noda, K. Hossain, N. Hoshi, M. Hashii, R. Shigemoto, S. Nakanishi, Y. Fukuda, S. Yokoyama, Journal of Neurochemistry 85 (2003) 1148–1158.","ama":"Higashida H, Zhang J, Mochida S, et al. Subtype-specific coupling with ADP-ribosyl cyclase of metabotropic glutamate receptors in retina, cervical superior ganglion and NG108-15 cells. <i>Journal of Neurochemistry</i>. 2003;85(5):1148-1158. doi:<a href=\"https://doi.org/10.1046/j.1471-4159.2003.01751.x\">10.1046/j.1471-4159.2003.01751.x</a>","mla":"Higashida, Haruhiro, et al. “Subtype-Specific Coupling with ADP-Ribosyl Cyclase of Metabotropic Glutamate Receptors in Retina, Cervical Superior Ganglion and NG108-15 Cells.” <i>Journal of Neurochemistry</i>, vol. 85, no. 5, Wiley-Blackwell, 2003, pp. 1148–58, doi:<a href=\"https://doi.org/10.1046/j.1471-4159.2003.01751.x\">10.1046/j.1471-4159.2003.01751.x</a>.","ista":"Higashida H, Zhang J, Mochida S, Chen X, Shin Y, Noda M, Hossain K, Hoshi N, Hashii M, Shigemoto R, Nakanishi S, Fukuda Y, Yokoyama S. 2003. Subtype-specific coupling with ADP-ribosyl cyclase of metabotropic glutamate receptors in retina, cervical superior ganglion and NG108-15 cells. Journal of Neurochemistry. 85(5), 1148–1158.","apa":"Higashida, H., Zhang, J., Mochida, S., Chen, X., Shin, Y., Noda, M., … Yokoyama, S. (2003). Subtype-specific coupling with ADP-ribosyl cyclase of metabotropic glutamate receptors in retina, cervical superior ganglion and NG108-15 cells. <i>Journal of Neurochemistry</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1046/j.1471-4159.2003.01751.x\">https://doi.org/10.1046/j.1471-4159.2003.01751.x</a>"},"extern":1,"intvolume":"        85","status":"public","date_created":"2018-12-11T11:58:46Z","publist_id":"4268","volume":85,"title":"Subtype-specific coupling with ADP-ribosyl cyclase of metabotropic glutamate receptors in retina, cervical superior ganglion and NG108-15 cells","month":"06","type":"journal_article","day":"01","abstract":[{"text":"Cyclic ADP-ribose (cADP-ribose) is a putative second messenger or modulator. However, the role of cADP-ribose in the downstream signals of the metabotropic glutamate receptors (mGluRs) is unclear. Here, we show that glutamate stimulates ADP-ribosyl cyclase activity in rat or mouse crude membranes of retina via group III mGluRs or in superior cervical ganglion via group I mGluRs. The retina of mGluR6-deficient mice showed no increase in the ADP-ribosyl cyclase level in response to glutamate. GTP enhanced the initial rate of basal and glutamate-stimulated cyclase activity. GTP-γ-S also stimulated basal activity. To determine whether the coupling mode of mGluRs to ADP-ribosyl cyclase is a feature common to individual cloned mGluRs, we expressed each mGluR subtype in NG108-15 neuroblastoma x glioma hybrid cells. The glutamate-induced stimulation of the cyclase occurs preferentially in NG108-15 cells over-expressing mGluRs1, 3, 5, and 6. Cells expressing mGluR2 or mGluRs4 and 7 exhibit inhibition or no coupling, respectively. Glutamate-induced activation or inhibition of the cyclase activity was eliminated after pre-treatment with cholera or pertussis toxin, respectively. Thus, the subtype-specific coupling of mGluRs to ADP-ribosyl cyclase via G proteins suggests that some glutamate-evoked neuronal functions are mediated by cADP-ribose.","lang":"eng"}],"date_updated":"2021-01-12T06:58:42Z","page":"1148 - 1158","author":[{"first_name":"Haruhiro","last_name":"Higashida","full_name":"Higashida, Haruhiro"},{"full_name":"Zhang, Jia-Sheng","last_name":"Zhang","first_name":"Jia"},{"last_name":"Mochida","first_name":"Sumiko","full_name":"Mochida, Sumiko"},{"last_name":"Chen","first_name":"Xiao","full_name":"Chen, Xiao-Liang"},{"last_name":"Shin","first_name":"Yeonsook","full_name":"Shin, Yeonsook"},{"full_name":"Noda, Mami","first_name":"Mami","last_name":"Noda"},{"last_name":"Hossain","first_name":"Kazi","full_name":"Hossain, Kazi Z"},{"full_name":"Hoshi, Naoto","first_name":"Naoto","last_name":"Hoshi"},{"full_name":"Hashii, Minako","last_name":"Hashii","first_name":"Minako"},{"id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","full_name":"Ryuichi Shigemoto","last_name":"Shigemoto","first_name":"Ryuichi"},{"first_name":"Shigetada","last_name":"Nakanishi","full_name":"Nakanishi, Shigetada"},{"full_name":"Fukuda, Yutaka","last_name":"Fukuda","first_name":"Yutaka"},{"full_name":"Yokoyama, Shigeru","last_name":"Yokoyama","first_name":"Shigeru"}],"_id":"2631","publication":"Journal of Neurochemistry","year":"2003","publisher":"Wiley-Blackwell"},{"page":"344 - 354","author":[{"full_name":"Holderith, Noémi B","last_name":"Holderith","first_name":"Noémi"},{"full_name":"Ryuichi Shigemoto","orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","last_name":"Shigemoto"},{"first_name":"Zoltán","last_name":"Nusser","full_name":"Nusser, Zoltán"}],"type":"journal_article","month":"07","date_updated":"2021-01-12T06:58:42Z","day":"01","abstract":[{"lang":"eng","text":"In many brain regions, hyperpolarization-activated cationic currents (Ih) are involved in the generation of rhythmic activities, but the role of Ih in olfactory oscillations remains unclear. Knowledge of the cellular and subcellular distributions of hyperpolarization-activated and cyclic nucleotide-gated channel (HCN) subunits is necessary for understanding the role of Ih in olfactory network activities. Using light microscopic immunocytochemistry, we demonstrate strong HCN1 labelling of the glomerular layer and moderate staining of granule cell, internal and external plexiform layers of the rat main olfactory bulb. In the glomerular layer, among many unlabelled neurons, two distinct subpopulations of juxtaglomerular cells are labelled. Approximately 10% of the juxtaglomerular cells strongly express HCN1. These small diameter cells are immunoreactive for GABA and comprise a subpopulation of periglomerular cells. An additional subset of juxtaglomerular cells (≈ 1%) expresses low levels of HCN1. They are large in diameter, GABA immunonegative but immunopositive for vesicular glutamate transporter 2, characterizing them as external tufted cells. Quantitative immunogold localization revealed that the somatic plasma membranes of periglomerular cells contain approximately four times more HCN1 labelling than those of external tufted cells. Unlike in cortical pyramidal cells, immunogold density for HCN1 does not significantly differ in somatic and dendritic plasma membranes of external tufted cells, indicating that post-synaptic potentials arriving at proximal and distal dendrites are modulated by the same density of I h. Our results demonstrate a cell type-dependent expression of HCN1 in the olfactory bulb and predict a differential contribution of distinct juxtaglomerular cell types to network oscillations."}],"title":"Cell type-dependent expression of HCN1 in the main olfactory bulb","volume":18,"publist_id":"4266","date_created":"2018-12-11T11:58:47Z","publisher":"Wiley-Blackwell","year":"2003","_id":"2632","publication":"European Journal of Neuroscience","publication_status":"published","doi":"10.1046/j.1460-9568.2003.02756.x","date_published":"2003-07-01T00:00:00Z","quality_controlled":0,"status":"public","extern":1,"intvolume":"        18","issue":"2","citation":{"ama":"Holderith N, Shigemoto R, Nusser Z. Cell type-dependent expression of HCN1 in the main olfactory bulb. <i>European Journal of Neuroscience</i>. 2003;18(2):344-354. doi:<a href=\"https://doi.org/10.1046/j.1460-9568.2003.02756.x\">10.1046/j.1460-9568.2003.02756.x</a>","apa":"Holderith, N., Shigemoto, R., &#38; Nusser, Z. (2003). Cell type-dependent expression of HCN1 in the main olfactory bulb. <i>European Journal of Neuroscience</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1046/j.1460-9568.2003.02756.x\">https://doi.org/10.1046/j.1460-9568.2003.02756.x</a>","mla":"Holderith, Noémi, et al. “Cell Type-Dependent Expression of HCN1 in the Main Olfactory Bulb.” <i>European Journal of Neuroscience</i>, vol. 18, no. 2, Wiley-Blackwell, 2003, pp. 344–54, doi:<a href=\"https://doi.org/10.1046/j.1460-9568.2003.02756.x\">10.1046/j.1460-9568.2003.02756.x</a>.","ista":"Holderith N, Shigemoto R, Nusser Z. 2003. Cell type-dependent expression of HCN1 in the main olfactory bulb. European Journal of Neuroscience. 18(2), 344–354.","chicago":"Holderith, Noémi, Ryuichi Shigemoto, and Zoltán Nusser. “Cell Type-Dependent Expression of HCN1 in the Main Olfactory Bulb.” <i>European Journal of Neuroscience</i>. Wiley-Blackwell, 2003. <a href=\"https://doi.org/10.1046/j.1460-9568.2003.02756.x\">https://doi.org/10.1046/j.1460-9568.2003.02756.x</a>.","ieee":"N. Holderith, R. Shigemoto, and Z. Nusser, “Cell type-dependent expression of HCN1 in the main olfactory bulb,” <i>European Journal of Neuroscience</i>, vol. 18, no. 2. Wiley-Blackwell, pp. 344–354, 2003.","short":"N. Holderith, R. Shigemoto, Z. Nusser, European Journal of Neuroscience 18 (2003) 344–354."}}]