[{"publication":"Journal of Geometric Analysis","publication_status":"published","main_file_link":[{"url":"http://arxiv.org/abs/0704.3564","open_access":"1"}],"doi":"10.1007/BF02937429","volume":17,"extern":1,"citation":{"ama":"Frank R, Hainzl C, Naboko S, Seiringer R. The critical temperature for the BCS equation at weak coupling. <i>Journal of Geometric Analysis</i>. 2007;17(4):559-567. doi:<a href=\"https://doi.org/10.1007/BF02937429\">10.1007/BF02937429</a>","ista":"Frank R, Hainzl C, Naboko S, Seiringer R. 2007. The critical temperature for the BCS equation at weak coupling. Journal of Geometric Analysis. 17(4), 559–567.","ieee":"R. Frank, C. Hainzl, S. Naboko, and R. Seiringer, “The critical temperature for the BCS equation at weak coupling,” <i>Journal of Geometric Analysis</i>, vol. 17, no. 4. Springer, pp. 559–567, 2007.","short":"R. Frank, C. Hainzl, S. Naboko, R. Seiringer, Journal of Geometric Analysis 17 (2007) 559–567.","chicago":"Frank, Rupert, Christian Hainzl, Serguei Naboko, and Robert Seiringer. “The Critical Temperature for the BCS Equation at Weak Coupling.” <i>Journal of Geometric Analysis</i>. Springer, 2007. <a href=\"https://doi.org/10.1007/BF02937429\">https://doi.org/10.1007/BF02937429</a>.","apa":"Frank, R., Hainzl, C., Naboko, S., &#38; Seiringer, R. (2007). The critical temperature for the BCS equation at weak coupling. <i>Journal of Geometric Analysis</i>. Springer. <a href=\"https://doi.org/10.1007/BF02937429\">https://doi.org/10.1007/BF02937429</a>","mla":"Frank, Rupert, et al. “The Critical Temperature for the BCS Equation at Weak Coupling.” <i>Journal of Geometric Analysis</i>, vol. 17, no. 4, Springer, 2007, pp. 559–67, doi:<a href=\"https://doi.org/10.1007/BF02937429\">10.1007/BF02937429</a>."},"abstract":[{"text":"For the BCS equation with local two-body interaction λV(x), we give a rigorous analysis of the asymptotic behavior of the critical temperature as γ&quot;0. We derive necessary and sufficient conditions onV(x) for the existence of a nontrivial solution for all values of γ&gt;0.","lang":"eng"}],"type":"journal_article","date_created":"2018-12-11T11:57:17Z","_id":"2373","quality_controlled":0,"day":"01","status":"public","page":"559 - 567","publist_id":"4553","year":"2007","date_published":"2007-01-01T00:00:00Z","intvolume":"        17","month":"01","publisher":"Springer","date_updated":"2021-01-12T06:57:05Z","oa":1,"author":[{"full_name":"Frank, Rupert L","last_name":"Frank","first_name":"Rupert"},{"full_name":"Hainzl, Christian","last_name":"Hainzl","first_name":"Christian"},{"first_name":"Serguei","last_name":"Naboko","full_name":"Naboko, Serguei N"},{"full_name":"Robert Seiringer","last_name":"Seiringer","orcid":"0000-0002-6781-0521","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"title":"The critical temperature for the BCS equation at weak coupling","issue":"4"},{"publication":"Letters in Mathematical Physics","publication_status":"published","doi":"10.1007/s11005-007-0211-x","main_file_link":[{"url":"http://arxiv.org/abs/0710.1877","open_access":"1"}],"_id":"2375","date_created":"2018-12-11T11:57:18Z","day":"01","status":"public","quality_controlled":0,"volume":82,"citation":{"apa":"Frank, R., Lieb, É., &#38; Seiringer, R. (2007). Number of bound states of Schrödinger operators with matrix-valued potentials. <i>Letters in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s11005-007-0211-x\">https://doi.org/10.1007/s11005-007-0211-x</a>","mla":"Frank, Rupert, et al. “Number of Bound States of Schrödinger Operators with Matrix-Valued Potentials.” <i>Letters in Mathematical Physics</i>, vol. 82, no. 2–3, Springer, 2007, pp. 107–16, doi:<a href=\"https://doi.org/10.1007/s11005-007-0211-x\">10.1007/s11005-007-0211-x</a>.","ista":"Frank R, Lieb É, Seiringer R. 2007. Number of bound states of Schrödinger operators with matrix-valued potentials. Letters in Mathematical Physics. 82(2–3), 107–116.","ieee":"R. Frank, É. Lieb, and R. Seiringer, “Number of bound states of Schrödinger operators with matrix-valued potentials,” <i>Letters in Mathematical Physics</i>, vol. 82, no. 2–3. Springer, pp. 107–116, 2007.","short":"R. Frank, É. Lieb, R. Seiringer, Letters in Mathematical Physics 82 (2007) 107–116.","ama":"Frank R, Lieb É, Seiringer R. Number of bound states of Schrödinger operators with matrix-valued potentials. <i>Letters in Mathematical Physics</i>. 2007;82(2-3):107-116. doi:<a href=\"https://doi.org/10.1007/s11005-007-0211-x\">10.1007/s11005-007-0211-x</a>","chicago":"Frank, Rupert, Élliott Lieb, and Robert Seiringer. “Number of Bound States of Schrödinger Operators with Matrix-Valued Potentials.” <i>Letters in Mathematical Physics</i>. Springer, 2007. <a href=\"https://doi.org/10.1007/s11005-007-0211-x\">https://doi.org/10.1007/s11005-007-0211-x</a>."},"extern":1,"abstract":[{"lang":"eng","text":"We give a Cwikel-Lieb-Rozenblum type bound on the number of bound states of Schrödinger operators with matrix-valued potentials using the functional integral method of Lieb. This significantly improves the constant in this inequality obtained earlier by Hundertmark."}],"type":"journal_article","year":"2007","page":"107 - 116","publist_id":"4552","date_updated":"2021-01-12T06:57:06Z","oa":1,"author":[{"last_name":"Frank","first_name":"Rupert","full_name":"Frank, Rupert L"},{"last_name":"Lieb","first_name":"Élliott","full_name":"Lieb, Élliott H"},{"orcid":"0000-0002-6781-0521","last_name":"Seiringer","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Robert Seiringer"}],"title":"Number of bound states of Schrödinger operators with matrix-valued potentials","issue":"2-3","date_published":"2007-12-01T00:00:00Z","month":"12","intvolume":"        82","publisher":"Springer"},{"article_type":"original","year":"2007","language":[{"iso":"eng"}],"article_processing_charge":"No","page":"329-335","title":"Consumption and efficiency of a passenger car with a Hydrogen/Oxygen PEFC based hybrid electric drivetrain","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Büchi, F. N.","first_name":"F. N.","last_name":"Büchi"},{"first_name":"G.","last_name":"Paganelli","full_name":"Paganelli, G."},{"first_name":"P.","last_name":"Dietrich","full_name":"Dietrich, P."},{"last_name":"Laurent","first_name":"D.","full_name":"Laurent, D."},{"full_name":"Tsukada, A.","last_name":"Tsukada","first_name":"A."},{"full_name":"Varenne, P.","last_name":"Varenne","first_name":"P."},{"first_name":"A.","last_name":"Delfino","full_name":"Delfino, A."},{"first_name":"R.","last_name":"Kötz","full_name":"Kötz, R."},{"full_name":"Freunberger, Stefan Alexander","first_name":"Stefan Alexander","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","orcid":"0000-0003-2902-5319","last_name":"Freunberger"},{"last_name":"Magne","first_name":"P.-A.","full_name":"Magne, P.-A."},{"last_name":"Walser","first_name":"D.","full_name":"Walser, D."},{"last_name":"Olsommer","first_name":"D.","full_name":"Olsommer, D."}],"issue":"4","date_updated":"2021-01-12T08:13:04Z","publisher":"Wiley","date_published":"2007-08-01T00:00:00Z","month":"08","intvolume":"         7","oa_version":"None","publication":"Fuel Cells","publication_status":"published","doi":"10.1002/fuce.200600050","quality_controlled":"1","status":"public","day":"01","date_created":"2020-01-15T12:22:10Z","_id":"7323","abstract":[{"lang":"eng","text":"The main factors for reducing the consumption of a vehicle are reduction of curb weight, air drag and increase in the drivetrain efficiency. Highly efficient drivetrains can be developed based on PEFC technology and curb weight may be limited by an innovative vehicle construction. In this paper, data on consumption and efficiency of a four‐place passenger vehicle with a curb weight of 850 kg and an H2/O2 fed PEFC/Supercap hybrid electric powertrain are presented. Hydrogen consumption in the New European Driving Cycle is 0.67 kg H2/100 km, which corresponds to a gasoline equivalent consumption of 2.5 l/100 km. When including the energy needed to supply pure oxygen, the calculated consumption increases from 0.67 to 0.69–0.79 kg H2/100 km, depending on the method of oxygen production."}],"type":"journal_article","volume":7,"publication_identifier":{"issn":["1615-6846","1615-6854"]},"citation":{"mla":"Büchi, F. N., et al. “Consumption and Efficiency of a Passenger Car with a Hydrogen/Oxygen PEFC Based Hybrid Electric Drivetrain.” <i>Fuel Cells</i>, vol. 7, no. 4, Wiley, 2007, pp. 329–35, doi:<a href=\"https://doi.org/10.1002/fuce.200600050\">10.1002/fuce.200600050</a>.","apa":"Büchi, F. N., Paganelli, G., Dietrich, P., Laurent, D., Tsukada, A., Varenne, P., … Olsommer, D. (2007). Consumption and efficiency of a passenger car with a Hydrogen/Oxygen PEFC based hybrid electric drivetrain. <i>Fuel Cells</i>. Wiley. <a href=\"https://doi.org/10.1002/fuce.200600050\">https://doi.org/10.1002/fuce.200600050</a>","chicago":"Büchi, F. N., G. Paganelli, P. Dietrich, D. Laurent, A. Tsukada, P. Varenne, A. Delfino, et al. “Consumption and Efficiency of a Passenger Car with a Hydrogen/Oxygen PEFC Based Hybrid Electric Drivetrain.” <i>Fuel Cells</i>. Wiley, 2007. <a href=\"https://doi.org/10.1002/fuce.200600050\">https://doi.org/10.1002/fuce.200600050</a>.","ama":"Büchi FN, Paganelli G, Dietrich P, et al. Consumption and efficiency of a passenger car with a Hydrogen/Oxygen PEFC based hybrid electric drivetrain. <i>Fuel Cells</i>. 2007;7(4):329-335. doi:<a href=\"https://doi.org/10.1002/fuce.200600050\">10.1002/fuce.200600050</a>","short":"F.N. Büchi, G. Paganelli, P. Dietrich, D. Laurent, A. Tsukada, P. Varenne, A. Delfino, R. Kötz, S.A. Freunberger, P.-A. Magne, D. Walser, D. Olsommer, Fuel Cells 7 (2007) 329–335.","ista":"Büchi FN, Paganelli G, Dietrich P, Laurent D, Tsukada A, Varenne P, Delfino A, Kötz R, Freunberger SA, Magne P-A, Walser D, Olsommer D. 2007. Consumption and efficiency of a passenger car with a Hydrogen/Oxygen PEFC based hybrid electric drivetrain. Fuel Cells. 7(4), 329–335.","ieee":"F. N. Büchi <i>et al.</i>, “Consumption and efficiency of a passenger car with a Hydrogen/Oxygen PEFC based hybrid electric drivetrain,” <i>Fuel Cells</i>, vol. 7, no. 4. Wiley, pp. 329–335, 2007."},"extern":"1"},{"_id":"7324","date_created":"2020-01-15T12:22:20Z","day":"01","status":"public","extern":"1","citation":{"apa":"Büchi, F. N., Freunberger, S. A., Reum, M., Paganelli, G., Tsukada, A., Dietrich, P., &#38; Delfino, A. (2007). On the efficiency of an advanced automotive fuel cell system. <i>Fuel Cells</i>. Wiley. <a href=\"https://doi.org/10.1002/fuce.200500257\">https://doi.org/10.1002/fuce.200500257</a>","mla":"Büchi, F. N., et al. “On the Efficiency of an Advanced Automotive Fuel Cell System.” <i>Fuel Cells</i>, vol. 7, no. 2, Wiley, 2007, pp. 159–64, doi:<a href=\"https://doi.org/10.1002/fuce.200500257\">10.1002/fuce.200500257</a>.","ama":"Büchi FN, Freunberger SA, Reum M, et al. On the efficiency of an advanced automotive fuel cell system. <i>Fuel Cells</i>. 2007;7(2):159-164. doi:<a href=\"https://doi.org/10.1002/fuce.200500257\">10.1002/fuce.200500257</a>","ieee":"F. N. Büchi <i>et al.</i>, “On the efficiency of an advanced automotive fuel cell system,” <i>Fuel Cells</i>, vol. 7, no. 2. Wiley, pp. 159–164, 2007.","ista":"Büchi FN, Freunberger SA, Reum M, Paganelli G, Tsukada A, Dietrich P, Delfino A. 2007. On the efficiency of an advanced automotive fuel cell system. Fuel Cells. 7(2), 159–164.","short":"F.N. Büchi, S.A. Freunberger, M. Reum, G. Paganelli, A. Tsukada, P. Dietrich, A. Delfino, Fuel Cells 7 (2007) 159–164.","chicago":"Büchi, F. N., Stefan Alexander Freunberger, M. Reum, G. Paganelli, A. Tsukada, P. Dietrich, and A. Delfino. “On the Efficiency of an Advanced Automotive Fuel Cell System.” <i>Fuel Cells</i>. Wiley, 2007. <a href=\"https://doi.org/10.1002/fuce.200500257\">https://doi.org/10.1002/fuce.200500257</a>."},"publication_identifier":{"issn":["1615-6846","1615-6854"]},"volume":7,"type":"journal_article","abstract":[{"text":"Efficiency is the key parameter for the application of fuel cells in automotive applications. The efficiency of a hydrogen/oxygen polymer electrolyte fuel cell system is analyzed and compared to hydrogen/air systems. The analysis is performed for the tank to electric power chain. Furthermore, the additional energy required for using pure oxygen as a second fuel is analyzed and included in the calculation. The results show that if hydrogen is produced from primary fossil energy carriers, such as natural gas and pure oxygen needs to be obtained by a conventional process; the fuel to electric current efficiency is comparable for hydrogen/oxygen and hydrogen/air systems. However, if hydrogen and oxygen are produced by the splitting of water, i.e., by electrolysis or by a thermochemical process, the fuel to electric current efficiency for the hydrogen/oxygen system is clearly superior.","lang":"eng"}],"oa_version":"None","doi":"10.1002/fuce.200500257","publication_status":"published","publication":"Fuel Cells","date_updated":"2021-01-12T08:13:04Z","issue":"2","title":"On the efficiency of an advanced automotive fuel cell system","author":[{"last_name":"Büchi","first_name":"F. N.","full_name":"Büchi, F. N."},{"id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","first_name":"Stefan Alexander","orcid":"0000-0003-2902-5319","last_name":"Freunberger","full_name":"Freunberger, Stefan Alexander"},{"last_name":"Reum","first_name":"M.","full_name":"Reum, M."},{"full_name":"Paganelli, G.","last_name":"Paganelli","first_name":"G."},{"full_name":"Tsukada, A.","last_name":"Tsukada","first_name":"A."},{"full_name":"Dietrich, P.","last_name":"Dietrich","first_name":"P."},{"full_name":"Delfino, A.","first_name":"A.","last_name":"Delfino"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"         7","month":"04","date_published":"2007-04-01T00:00:00Z","publisher":"Wiley","language":[{"iso":"eng"}],"year":"2007","article_type":"original","article_processing_charge":"No","page":"159-164"},{"language":[{"iso":"eng"}],"article_type":"original","year":"2007","article_processing_charge":"No","date_updated":"2021-01-12T08:13:05Z","author":[{"last_name":"Schneider","first_name":"I. A.","full_name":"Schneider, I. A."},{"full_name":"Freunberger, Stefan Alexander","orcid":"0000-0003-2902-5319","last_name":"Freunberger","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","first_name":"Stefan Alexander"},{"last_name":"Kramer","first_name":"D.","full_name":"Kramer, D."},{"full_name":"Wokaun, A.","first_name":"A.","last_name":"Wokaun"},{"first_name":"G. G.","last_name":"Scherer","full_name":"Scherer, G. G."}],"title":"Oscillations in gas channels: Part I. The forgotten player in impedance spectroscopy in PEFCs","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"4","date_published":"2007-02-09T00:00:00Z","month":"02","intvolume":"       154","article_number":"B383","publisher":"The Electrochemical Society","oa_version":"None","publication":"Journal of The Electrochemical Society","publication_status":"published","doi":"10.1149/1.2435706","_id":"7325","date_created":"2020-01-15T12:22:31Z","quality_controlled":"1","status":"public","day":"09","volume":154,"citation":{"chicago":"Schneider, I. A., Stefan Alexander Freunberger, D. Kramer, A. Wokaun, and G. G. Scherer. “Oscillations in Gas Channels: Part I. The Forgotten Player in Impedance Spectroscopy in PEFCs.” <i>Journal of The Electrochemical Society</i>. The Electrochemical Society, 2007. <a href=\"https://doi.org/10.1149/1.2435706\">https://doi.org/10.1149/1.2435706</a>.","ama":"Schneider IA, Freunberger SA, Kramer D, Wokaun A, Scherer GG. Oscillations in gas channels: Part I. The forgotten player in impedance spectroscopy in PEFCs. <i>Journal of The Electrochemical Society</i>. 2007;154(4). doi:<a href=\"https://doi.org/10.1149/1.2435706\">10.1149/1.2435706</a>","ista":"Schneider IA, Freunberger SA, Kramer D, Wokaun A, Scherer GG. 2007. Oscillations in gas channels: Part I. The forgotten player in impedance spectroscopy in PEFCs. Journal of The Electrochemical Society. 154(4), B383.","ieee":"I. A. Schneider, S. A. Freunberger, D. Kramer, A. Wokaun, and G. G. Scherer, “Oscillations in gas channels: Part I. The forgotten player in impedance spectroscopy in PEFCs,” <i>Journal of The Electrochemical Society</i>, vol. 154, no. 4. The Electrochemical Society, 2007.","short":"I.A. Schneider, S.A. Freunberger, D. Kramer, A. Wokaun, G.G. Scherer, Journal of The Electrochemical Society 154 (2007).","mla":"Schneider, I. A., et al. “Oscillations in Gas Channels: Part I. The Forgotten Player in Impedance Spectroscopy in PEFCs.” <i>Journal of The Electrochemical Society</i>, vol. 154, no. 4, B383, The Electrochemical Society, 2007, doi:<a href=\"https://doi.org/10.1149/1.2435706\">10.1149/1.2435706</a>.","apa":"Schneider, I. A., Freunberger, S. A., Kramer, D., Wokaun, A., &#38; Scherer, G. G. (2007). Oscillations in gas channels: Part I. The forgotten player in impedance spectroscopy in PEFCs. <i>Journal of The Electrochemical Society</i>. The Electrochemical Society. <a href=\"https://doi.org/10.1149/1.2435706\">https://doi.org/10.1149/1.2435706</a>"},"publication_identifier":{"issn":["0013-4651"]},"extern":"1","abstract":[{"lang":"eng","text":"Our experimental results shown here disprove that finite diffusion can generally be assumed in ac impedance models for H2/air-polymer electrolyte fuel cells (PEFCs) to account for the diffusive transport of oxygen through the gas diffusion layer (GDL) toward the air electrode. It is shown that the amplitude of the oxygen concentration oscillation created as a consequence of superimposed ac current at the air electrode is not zero at the channel/GDL interface but extends into the gas channels, at least below modulation frequencies of fmod=10 Hz . By this, sinusoidal oxygen-concentration oscillations within the cathode gas channels are excited locally along the flow field. Due to the forced air convection in the cathode flow-field channels, a coupling via the gas phase occurs downstream of the flow field. The coupling strongly affects the local and by this the overall impedance response of the cell and evokes the formation of a low-frequency arc in H2/air-PEFC impedance spectra. Based on the experimental results, a qualitative model is presented explaining the local impedance response of a segmented 200cm2H2/air PEFC."}],"type":"journal_article"},{"issue":"2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Takaki","last_name":"Komiyama","full_name":"Komiyama, Takaki"},{"full_name":"Sweeney, Lora Beatrice Jaeger","orcid":"0000-0001-9242-5601","last_name":"Sweeney","id":"56BE8254-C4F0-11E9-8E45-0B23E6697425","first_name":"Lora Beatrice Jaeger"},{"full_name":"Schuldiner, Oren","first_name":"Oren","last_name":"Schuldiner"},{"last_name":"Garcia","first_name":"K. Christopher","full_name":"Garcia, K. Christopher"},{"first_name":"Liqun","last_name":"Luo","full_name":"Luo, Liqun"}],"title":"Graded expression of semaphorin-1a cell-autonomously directs dendritic targeting of olfactory projection neurons","date_updated":"2024-01-31T10:14:48Z","publisher":"Elsevier","month":"01","intvolume":"       128","date_published":"2007-01-26T00:00:00Z","year":"2007","article_type":"original","language":[{"iso":"eng"}],"article_processing_charge":"No","page":"399-410","quality_controlled":"1","status":"public","day":"26","date_created":"2020-04-30T10:37:08Z","_id":"7704","type":"journal_article","abstract":[{"lang":"eng","text":"Gradients of axon guidance molecules instruct the formation of continuous neural maps, such as the retinotopic map in the vertebrate visual system. Here we show that molecular gradients can also instruct the formation of a discrete neural map. In the fly olfactory system, axons of 50 classes of olfactory receptor neurons (ORNs) and dendrites of 50 classes of projection neurons (PNs) form one-to-one connections at discrete units called glomeruli. We provide expression, loss- and gain-of-function data to demonstrate that the levels of transmembrane Semaphorin-1a (Sema-1a), acting cell-autonomously as a receptor or part of a receptor complex, direct the dendritic targeting of PNs along the dorsolateral to ventromedial axis of the antennal lobe. Sema-1a also regulates PN axon targeting in higher olfactory centers. Thus, graded expression of Sema-1a contributes to connection specificity from ORNs to PNs and then to higher brain centers, ensuring proper representation of olfactory information in the brain."}],"extern":"1","publication_identifier":{"issn":["0092-8674"]},"citation":{"ista":"Komiyama T, Sweeney LB, Schuldiner O, Garcia KC, Luo L. 2007. Graded expression of semaphorin-1a cell-autonomously directs dendritic targeting of olfactory projection neurons. Cell. 128(2), 399–410.","short":"T. Komiyama, L.B. Sweeney, O. Schuldiner, K.C. Garcia, L. Luo, Cell 128 (2007) 399–410.","ieee":"T. Komiyama, L. B. Sweeney, O. Schuldiner, K. C. Garcia, and L. Luo, “Graded expression of semaphorin-1a cell-autonomously directs dendritic targeting of olfactory projection neurons,” <i>Cell</i>, vol. 128, no. 2. Elsevier, pp. 399–410, 2007.","ama":"Komiyama T, Sweeney LB, Schuldiner O, Garcia KC, Luo L. Graded expression of semaphorin-1a cell-autonomously directs dendritic targeting of olfactory projection neurons. <i>Cell</i>. 2007;128(2):399-410. doi:<a href=\"https://doi.org/10.1016/j.cell.2006.12.028\">10.1016/j.cell.2006.12.028</a>","chicago":"Komiyama, Takaki, Lora B. Sweeney, Oren Schuldiner, K. Christopher Garcia, and Liqun Luo. “Graded Expression of Semaphorin-1a Cell-Autonomously Directs Dendritic Targeting of Olfactory Projection Neurons.” <i>Cell</i>. Elsevier, 2007. <a href=\"https://doi.org/10.1016/j.cell.2006.12.028\">https://doi.org/10.1016/j.cell.2006.12.028</a>.","apa":"Komiyama, T., Sweeney, L. B., Schuldiner, O., Garcia, K. C., &#38; Luo, L. (2007). Graded expression of semaphorin-1a cell-autonomously directs dendritic targeting of olfactory projection neurons. <i>Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cell.2006.12.028\">https://doi.org/10.1016/j.cell.2006.12.028</a>","mla":"Komiyama, Takaki, et al. “Graded Expression of Semaphorin-1a Cell-Autonomously Directs Dendritic Targeting of Olfactory Projection Neurons.” <i>Cell</i>, vol. 128, no. 2, Elsevier, 2007, pp. 399–410, doi:<a href=\"https://doi.org/10.1016/j.cell.2006.12.028\">10.1016/j.cell.2006.12.028</a>."},"volume":128,"oa_version":"None","doi":"10.1016/j.cell.2006.12.028","publication_status":"published","publication":"Cell"},{"date_created":"2020-04-30T10:37:24Z","_id":"7705","quality_controlled":"1","status":"public","day":"18","citation":{"chicago":"Sweeney, Lora B., Africa Couto, Ya-Hui Chou, Daniela Berdnik, Barry J. Dickson, Liqun Luo, and Takaki Komiyama. “Temporal Target Restriction of Olfactory Receptor Neurons by Semaphorin-1a/PlexinA-Mediated Axon-Axon Interactions.” <i>Neuron</i>. Elsevier, 2007. <a href=\"https://doi.org/10.1016/j.neuron.2006.12.022\">https://doi.org/10.1016/j.neuron.2006.12.022</a>.","ieee":"L. B. Sweeney <i>et al.</i>, “Temporal target restriction of olfactory receptor neurons by semaphorin-1a/plexinA-mediated axon-axon interactions,” <i>Neuron</i>, vol. 53, no. 2. Elsevier, pp. 185–200, 2007.","ista":"Sweeney LB, Couto A, Chou Y-H, Berdnik D, Dickson BJ, Luo L, Komiyama T. 2007. Temporal target restriction of olfactory receptor neurons by semaphorin-1a/plexinA-mediated axon-axon interactions. Neuron. 53(2), 185–200.","short":"L.B. Sweeney, A. Couto, Y.-H. Chou, D. Berdnik, B.J. Dickson, L. Luo, T. Komiyama, Neuron 53 (2007) 185–200.","ama":"Sweeney LB, Couto A, Chou Y-H, et al. Temporal target restriction of olfactory receptor neurons by semaphorin-1a/plexinA-mediated axon-axon interactions. <i>Neuron</i>. 2007;53(2):185-200. doi:<a href=\"https://doi.org/10.1016/j.neuron.2006.12.022\">10.1016/j.neuron.2006.12.022</a>","mla":"Sweeney, Lora B., et al. “Temporal Target Restriction of Olfactory Receptor Neurons by Semaphorin-1a/PlexinA-Mediated Axon-Axon Interactions.” <i>Neuron</i>, vol. 53, no. 2, Elsevier, 2007, pp. 185–200, doi:<a href=\"https://doi.org/10.1016/j.neuron.2006.12.022\">10.1016/j.neuron.2006.12.022</a>.","apa":"Sweeney, L. B., Couto, A., Chou, Y.-H., Berdnik, D., Dickson, B. J., Luo, L., &#38; Komiyama, T. (2007). Temporal target restriction of olfactory receptor neurons by semaphorin-1a/plexinA-mediated axon-axon interactions. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2006.12.022\">https://doi.org/10.1016/j.neuron.2006.12.022</a>"},"extern":"1","publication_identifier":{"issn":["0896-6273"]},"volume":53,"type":"journal_article","abstract":[{"lang":"eng","text":"Axon-axon interactions have been implicated in neural circuit assembly, but the underlying mechanisms are poorly understood. Here, we show that in the Drosophila antennal lobe, early-arriving axons of olfactory receptor neurons (ORNs) from the antenna are required for the proper targeting of late-arriving ORN axons from the maxillary palp (MP). Semaphorin-1a is required for targeting of all MP but only half of the antennal ORN classes examined. Sema-1a acts nonautonomously to control ORN axon-axon interactions, in contrast to its cell-autonomous function in olfactory projection neurons. Phenotypic and genetic interaction analyses implicate PlexinA as the Sema-1a receptor in ORN targeting. Sema-1a on antennal ORN axons is required for correct targeting of MP axons within the antennal lobe, while interactions amongst MP axons facilitate their entry into the antennal lobe. We propose that Sema-1a/PlexinA-mediated repulsion provides a mechanism by which early-arriving ORN axons constrain the target choices of late-arriving axons."}],"oa_version":"None","publication_status":"published","doi":"10.1016/j.neuron.2006.12.022","publication":"Neuron","date_updated":"2024-01-31T10:14:39Z","issue":"2","author":[{"id":"56BE8254-C4F0-11E9-8E45-0B23E6697425","first_name":"Lora Beatrice Jaeger","last_name":"Sweeney","orcid":"0000-0001-9242-5601","full_name":"Sweeney, Lora Beatrice Jaeger"},{"full_name":"Couto, Africa","first_name":"Africa","last_name":"Couto"},{"last_name":"Chou","first_name":"Ya-Hui","full_name":"Chou, Ya-Hui"},{"full_name":"Berdnik, Daniela","last_name":"Berdnik","first_name":"Daniela"},{"first_name":"Barry J.","last_name":"Dickson","full_name":"Dickson, Barry J."},{"first_name":"Liqun","last_name":"Luo","full_name":"Luo, Liqun"},{"last_name":"Komiyama","first_name":"Takaki","full_name":"Komiyama, Takaki"}],"title":"Temporal target restriction of olfactory receptor neurons by semaphorin-1a/plexinA-mediated axon-axon interactions","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","intvolume":"        53","date_published":"2007-01-18T00:00:00Z","publisher":"Elsevier","language":[{"iso":"eng"}],"year":"2007","article_type":"original","article_processing_charge":"No","page":"185-200"},{"article_type":"original","language":[{"iso":"eng"}],"article_processing_charge":"No","title":"Function of weaponry in females: The use of horns in intrasexual competition for resources in female Soay sheep","author":[{"full_name":"Robinson, Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425","first_name":"Matthew Richard","last_name":"Robinson","orcid":"0000-0001-8982-8813"},{"full_name":"Kruuk, Loeske E.B","last_name":"Kruuk","first_name":"Loeske E.B"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"The Royal Society","publication_status":"published","quality_controlled":"1","_id":"7753","type":"journal_article","abstract":[{"text":"In many species, females show reduced expression of a trait that is under sexual selection in males, and this expression is thought to be maintained through genetic associations with the male phenotype. However, there is also the potential for the female trait to convey an advantage in intrasexual conflicts over resources. We tested this hypothesis in a feral population of Soay sheep, in which males and females have a polymorphism for horn development, producing either full (normal horned), reduced (scurred) or no (polled, females only) horns. During the lambing period, females who possessed horns were more likely to initiate and win aggressive interactions, independent of age, weight and birthing status. The occurrence of aggression was also context dependent, decreasing over the lambing period and associated with local density. Our results demonstrate that a trait that confers benefits to males during intrasexual competition for mates may also be used by females in intrasexual competition over resources: males use weaponry to gain mates, whereas females use weaponry to gain food.","lang":"eng"}],"extern":"1","publication_identifier":{"issn":["1744-9561","1744-957X"]},"citation":{"ama":"Robinson MR, Kruuk LE. Function of weaponry in females: The use of horns in intrasexual competition for resources in female Soay sheep. <i>Biology Letters</i>. 2007;3(6):651-654. doi:<a href=\"https://doi.org/10.1098/rsbl.2007.0278\">10.1098/rsbl.2007.0278</a>","ista":"Robinson MR, Kruuk LE. 2007. Function of weaponry in females: The use of horns in intrasexual competition for resources in female Soay sheep. Biology Letters. 3(6), 651–654.","ieee":"M. R. Robinson and L. E. . Kruuk, “Function of weaponry in females: The use of horns in intrasexual competition for resources in female Soay sheep,” <i>Biology Letters</i>, vol. 3, no. 6. The Royal Society, pp. 651–654, 2007.","short":"M.R. Robinson, L.E.. Kruuk, Biology Letters 3 (2007) 651–654.","chicago":"Robinson, Matthew Richard, and Loeske E.B Kruuk. “Function of Weaponry in Females: The Use of Horns in Intrasexual Competition for Resources in Female Soay Sheep.” <i>Biology Letters</i>. The Royal Society, 2007. <a href=\"https://doi.org/10.1098/rsbl.2007.0278\">https://doi.org/10.1098/rsbl.2007.0278</a>.","apa":"Robinson, M. R., &#38; Kruuk, L. E. . (2007). Function of weaponry in females: The use of horns in intrasexual competition for resources in female Soay sheep. <i>Biology Letters</i>. The Royal Society. <a href=\"https://doi.org/10.1098/rsbl.2007.0278\">https://doi.org/10.1098/rsbl.2007.0278</a>","mla":"Robinson, Matthew Richard, and Loeske E. .. Kruuk. “Function of Weaponry in Females: The Use of Horns in Intrasexual Competition for Resources in Female Soay Sheep.” <i>Biology Letters</i>, vol. 3, no. 6, The Royal Society, 2007, pp. 651–54, doi:<a href=\"https://doi.org/10.1098/rsbl.2007.0278\">10.1098/rsbl.2007.0278</a>."},"year":"2007","page":"651-654","external_id":{"pmid":["17711817"]},"issue":"6","oa":1,"date_updated":"2021-01-12T08:15:18Z","month":"08","intvolume":"         3","date_published":"2007-08-21T00:00:00Z","oa_version":"Published Version","doi":"10.1098/rsbl.2007.0278","main_file_link":[{"url":"https://doi.org/10.1098/rsbl.2007.0278","open_access":"1"}],"publication":"Biology Letters","day":"21","status":"public","date_created":"2020-04-30T11:02:28Z","pmid":1,"volume":3},{"publist_id":"150","page":"1 - 247","year":"2007","acknowledgement":"Technical Report No. UCB/EECS-2007-122","publisher":"University of California, Berkeley","date_published":"2007-10-08T00:00:00Z","month":"10","title":"Stochastic ω-Regular Games","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Krishnendu Chatterjee"}],"date_updated":"2021-01-12T07:59:42Z","main_file_link":[{"url":"http://chess.eecs.berkeley.edu/pubs/462.html","open_access":"0"}],"publication_status":"published","abstract":[{"lang":"eng","text":"We study games played on graphs with omega-regular conditions specified as parity, Rabin, Streett or Muller conditions. These games have applications in the verification, synthesis, modeling, testing, and compatibility checking of reactive systems. Important distinctions between graph games are as follows: (a) turn-based vs. concurrent games, depending on whether at a state of the game only a single player makes a move, or players make moves simultaneously; (b) deterministic vs. stochastic, depending on whether the transition function is a deterministic or a probabilistic function over successor states; and (c) zero-sum vs. non-zero-sum, depending on whether the objectives of the players are strictly conflicting or not.\n\nWe establish that the decision problem for turn-based stochastic zero-sum games with Rabin, Streett, and Muller objectives are NP-complete, coNP-complete, and PSPACE-complete, respectively, substantially improving the previously known 3EXPTIME bound. We also present strategy improvement style algorithms for turn-based stochastic Rabin and Streett games. In the case of concurrent stochastic zero-sum games with parity objectives we obtain a PSPACE bound, again improving the previously known 3EXPTIME bound. As a consequence, concurrent stochastic zero-sum games with Rabin, Streett, and Muller objectives can be solved in EXPSPACE, improving the previously known 4EXPTIME bound. We also present an elementary and combinatorial proof of the existence of memoryless \\epsilon-optimal strategies in concurrent stochastic games with reachability objectives, for all real \\epsilon&gt;0, where an \\epsilon-optimal strategy achieves the value of the game with in \\epsilon against all strategies of the opponent. We also use the proof techniques to present a strategy improvement style algorithm for concurrent stochastic reachability games.\n\nWe then go beyond \\omega-regular objectives and study the complexity of an important class of quantitative objectives, namely, limit-average objectives. In the case of limit-average games, the states of the graph is labeled with rewards and the goal is to maximize the long-run average of the rewards. We show that concurrent stochastic zero-sum games with limit-average objectives can be solved in EXPTIME.\n\nFinally, we introduce a new notion of equilibrium, called secure equilibrium, in non-zero-sum games which captures the notion of conditional competitiveness. We prove the existence of unique maximal secure equilibrium payoff profiles in turn-based deterministic games, and present algorithms to compute such payoff profiles. We also show how the notion of secure equilibrium extends the assume-guarantee style of reasoning in the game theoretic framework."}],"type":"dissertation","citation":{"ista":"Chatterjee K. 2007. Stochastic ω-Regular Games. University of California, Berkeley.","short":"K. Chatterjee, Stochastic ω-Regular Games, University of California, Berkeley, 2007.","ieee":"K. Chatterjee, “Stochastic ω-Regular Games,” University of California, Berkeley, 2007.","ama":"Chatterjee K. Stochastic ω-Regular Games. 2007:1-247.","chicago":"Chatterjee, Krishnendu. “Stochastic ω-Regular Games.” University of California, Berkeley, 2007.","apa":"Chatterjee, K. (2007). <i>Stochastic ω-Regular Games</i>. University of California, Berkeley.","mla":"Chatterjee, Krishnendu. <i>Stochastic ω-Regular Games</i>. University of California, Berkeley, 2007, pp. 1–247."},"extern":1,"status":"public","quality_controlled":0,"day":"08","_id":"4559","date_created":"2018-12-11T12:09:29Z"},{"abstract":[{"text":"Complex system design today calls for compositional design and implementation. However each component is designed with certain assumptions about the environment it is meant to operate in, and delivering certain guarantees if those assumptions are satisfied; numerous inter-component interaction errors are introduced in the manual and error-prone integration process as there is little support in design environments for machine-readably representing these assumptions and guarantees and automatically checking consistency during integration.\r\n\r\nBased on Interface Automata we propose a framework for compositional design and analysis of systems: a set of domain-specific automata-theoretic type systems for compositional system specification and analysis by behavioral specification of open systems. We focus on three different domains: component-based hardware systems communicating on bidirectional wires. concurrent distributed recursive message-passing software systems, and embedded software system components operating in resource-constrained environments. For these domains we present approaches to formally represent the assumptions and conditional guarantees between interacting open system components. Composition of such components produces new components with the appropriate assumptions and guarantees. We check satisfaction of temporal logic specifications by such components, and the substitutability of one component with another in an arbitrary context. Using this framework one can analyze large systems incrementally without needing extensive summary information to close the system at each stage. Furthermore, we focus only on the inter-component interaction behavior without dealing with the full implementation details of each component. Many of the merits of automata-theoretic model-checking are combined with the compositionality afforded by type-system based techniques. We also present an integer-based extension of the conventional boolean verification framework motivated by our interface formalism for embedded software components.\r\n\r\nOur algorithms for checking the behavioral compatibility of component interfaces are available in our tool Chic, which can be used as a plug-in for the Java IDE JBuilder and the heterogenous modeling and design environment Ptolemy II.\r\n\r\nFinally, we address the complementary problem of partitioning a large system into meaningful coherent components by analyzing the interaction patterns between its basic elements. We demonstrate the usefulness of our partitioning approach by evaluating its efficacy in improving unit-test branch coverage for a large software system implemented in C.","lang":"eng"}],"type":"dissertation","citation":{"short":"A. Chakrabarti, A Framework for Compositional Design and Analysis of Systems, University of California, Berkeley, 2007.","ista":"Chakrabarti A. 2007. A framework for compositional design and analysis of systems. University of California, Berkeley.","ieee":"A. Chakrabarti, “A framework for compositional design and analysis of systems,” University of California, Berkeley, 2007.","ama":"Chakrabarti A. A framework for compositional design and analysis of systems. 2007:1-244.","chicago":"Chakrabarti, Arindam. “A Framework for Compositional Design and Analysis of Systems.” University of California, Berkeley, 2007.","apa":"Chakrabarti, A. (2007). <i>A framework for compositional design and analysis of systems</i>. University of California, Berkeley.","mla":"Chakrabarti, Arindam. <i>A Framework for Compositional Design and Analysis of Systems</i>. University of California, Berkeley, 2007, pp. 1–244."},"extern":"1","day":"20","status":"public","supervisor":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger"},{"full_name":"Necula, George","last_name":"Necula","first_name":"George"},{"full_name":"Lee, Edward","last_name":"Lee","first_name":"Edward"},{"full_name":"Silver, Jack","last_name":"Silver","first_name":"Jack"}],"date_created":"2018-12-11T12:09:31Z","_id":"4566","publication_status":"published","oa_version":"None","publisher":"University of California, Berkeley","date_published":"2007-12-20T00:00:00Z","month":"12","title":"A framework for compositional design and analysis of systems","author":[{"full_name":"Chakrabarti, Arindam","first_name":"Arindam","last_name":"Chakrabarti"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:59:45Z","publist_id":"145","article_processing_charge":"No","page":"1 - 244","year":"2007","language":[{"iso":"eng"}]},{"status":"public","day":"01","quality_controlled":0,"date_created":"2018-12-11T12:09:31Z","_id":"4567","abstract":[{"text":"BLAST is an automatic verification tool for checking temporal safety properties of C programs. Given a C program and a temporal safety property, BLAST either statically proves that the program satisfies the safety property, or provides an execution path that exhibits a violation of the property (or, since the problem is undecidable, does not terminate). BLAST constructs, explores, and refines abstractions of the program state space based on lazy predicate abstraction and interpolation-based predicate discovery. This paper gives an introduction to BLAST and demonstrates, through two case studies, how it can be applied to program verification and test-case generation. In the first case study, we use BLAST to statically prove memory safety for C programs. We use CCured, a type-based memory-safety analyzer, to annotate a program with run-time assertions that check for safe memory operations. Then, we use BLAST to remove as many of the run-time checks as possible (by proving that these checks never fail), and to generate execution scenarios that violate the assertions for the remaining run-time checks. In our second case study, we use BLAST to automatically generate test suites that guarantee full coverage with respect to a given predicate. Given a C program and a target predicate p, BLAST determines the program locations q for which there exists a program execution that reaches q with p true, and automatically generates a set of test vectors that cause such executions. Our experiments show that BLAST can provide automated, precise, and scalable analysis for C programs.","lang":"eng"}],"type":"journal_article","volume":9,"citation":{"chicago":"Beyer, Dirk, Thomas A Henzinger, Ranjit Jhala, and Ritankar Majumdar. “The Software Model Checker BLAST: Applications to Software Engineering.” <i>International Journal on Software Tools for Technology Transfer</i>. Springer, 2007. <a href=\"https://doi.org/10.1007/s10009-007-0044-z\">https://doi.org/10.1007/s10009-007-0044-z</a>.","ama":"Beyer D, Henzinger TA, Jhala R, Majumdar R. The software model checker BLAST: Applications to software engineering. <i>International Journal on Software Tools for Technology Transfer</i>. 2007;9(5):505-525. doi:<a href=\"https://doi.org/10.1007/s10009-007-0044-z\">10.1007/s10009-007-0044-z</a>","ista":"Beyer D, Henzinger TA, Jhala R, Majumdar R. 2007. The software model checker BLAST: Applications to software engineering. International Journal on Software Tools for Technology Transfer. 9(5), 505–525.","ieee":"D. Beyer, T. A. Henzinger, R. Jhala, and R. Majumdar, “The software model checker BLAST: Applications to software engineering,” <i>International Journal on Software Tools for Technology Transfer</i>, vol. 9, no. 5. Springer, pp. 505–525, 2007.","short":"D. Beyer, T.A. Henzinger, R. Jhala, R. Majumdar, International Journal on Software Tools for Technology Transfer 9 (2007) 505–525.","mla":"Beyer, Dirk, et al. “The Software Model Checker BLAST: Applications to Software Engineering.” <i>International Journal on Software Tools for Technology Transfer</i>, vol. 9, no. 5, Springer, 2007, pp. 505–25, doi:<a href=\"https://doi.org/10.1007/s10009-007-0044-z\">10.1007/s10009-007-0044-z</a>.","apa":"Beyer, D., Henzinger, T. A., Jhala, R., &#38; Majumdar, R. (2007). The software model checker BLAST: Applications to software engineering. <i>International Journal on Software Tools for Technology Transfer</i>. Springer. <a href=\"https://doi.org/10.1007/s10009-007-0044-z\">https://doi.org/10.1007/s10009-007-0044-z</a>"},"extern":1,"publication":"International Journal on Software Tools for Technology Transfer","publication_status":"published","doi":"10.1007/s10009-007-0044-z","title":"The software model checker BLAST: Applications to software engineering","author":[{"full_name":"Beyer, Dirk","first_name":"Dirk","last_name":"Beyer"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Thomas Henzinger"},{"last_name":"Jhala","first_name":"Ranjit","full_name":"Jhala, Ranjit"},{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar S"}],"issue":"5","date_updated":"2021-01-12T07:59:45Z","publisher":"Springer","date_published":"2007-10-01T00:00:00Z","intvolume":"         9","month":"10","year":"2007","publist_id":"139","page":"505 - 525"},{"publication_status":"published","doi":"10.1007/978-3-540-73420-8_71","abstract":[{"lang":"eng","text":"We consider the minimum-time reachability problem in concurrent two-player timed automaton game structures. We show how to compute the minimum time needed by a player to reach a target location against all possible choices of the opponent. We do not put any syntactic restriction on the game structure, nor do we require any player to guarantee time divergence. We only require players to use receptive strategies which do not block time. The minimal time is computed in part using a fixpoint expression, which we show can be evaluated on equivalence classes of a non-trivial extension of the clock-region equivalence relation for timed automata."}],"type":"conference","volume":4596,"extern":1,"citation":{"chicago":"Brihaye, Thomas, Thomas A Henzinger, Vinayak Prabhu, and Jean Raskin. “Minimum-Time Reachability in Timed Games,” 4596:825–37. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-73420-8_71\">https://doi.org/10.1007/978-3-540-73420-8_71</a>.","ama":"Brihaye T, Henzinger TA, Prabhu V, Raskin J. Minimum-time reachability in timed games. In: Vol 4596. Springer; 2007:825-837. doi:<a href=\"https://doi.org/10.1007/978-3-540-73420-8_71\">10.1007/978-3-540-73420-8_71</a>","ieee":"T. Brihaye, T. A. Henzinger, V. Prabhu, and J. Raskin, “Minimum-time reachability in timed games,” presented at the ICALP: Automata, Languages and Programming, 2007, vol. 4596, pp. 825–837.","short":"T. Brihaye, T.A. Henzinger, V. Prabhu, J. Raskin, in:, Springer, 2007, pp. 825–837.","ista":"Brihaye T, Henzinger TA, Prabhu V, Raskin J. 2007. Minimum-time reachability in timed games. ICALP: Automata, Languages and Programming, LNCS, vol. 4596, 825–837.","mla":"Brihaye, Thomas, et al. <i>Minimum-Time Reachability in Timed Games</i>. Vol. 4596, Springer, 2007, pp. 825–37, doi:<a href=\"https://doi.org/10.1007/978-3-540-73420-8_71\">10.1007/978-3-540-73420-8_71</a>.","apa":"Brihaye, T., Henzinger, T. A., Prabhu, V., &#38; Raskin, J. (2007). Minimum-time reachability in timed games (Vol. 4596, pp. 825–837). Presented at the ICALP: Automata, Languages and Programming, Springer. <a href=\"https://doi.org/10.1007/978-3-540-73420-8_71\">https://doi.org/10.1007/978-3-540-73420-8_71</a>"},"day":"29","status":"public","quality_controlled":0,"_id":"4570","date_created":"2018-12-11T12:09:32Z","conference":{"name":"ICALP: Automata, Languages and Programming"},"publist_id":"142","page":"825 - 837","year":"2007","acknowledgement":"This research was supported in part by the NSF grant CCR-0225610 and by the Swiss National Science Foundation.","publisher":"Springer","date_published":"2007-06-29T00:00:00Z","alternative_title":["LNCS"],"month":"06","intvolume":"      4596","author":[{"first_name":"Thomas","last_name":"Brihaye","full_name":"Brihaye, Thomas"},{"full_name":"Thomas Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"full_name":"Prabhu, Vinayak S","last_name":"Prabhu","first_name":"Vinayak"},{"full_name":"Raskin, Jean-François","first_name":"Jean","last_name":"Raskin"}],"title":"Minimum-time reachability in timed games","date_updated":"2021-01-12T07:59:47Z"},{"conference":{"name":"PLDI: Programming Languages Design and Implementation"},"publist_id":"137","page":"300 - 309","year":"2007","publisher":"ACM","month":"06","date_published":"2007-06-01T00:00:00Z","title":"Path invariants","author":[{"full_name":"Beyer, Dirk","first_name":"Dirk","last_name":"Beyer"},{"full_name":"Thomas Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"full_name":"Majumdar, Ritankar S","first_name":"Ritankar","last_name":"Majumdar"},{"last_name":"Rybalchenko","first_name":"Andrey","full_name":"Rybalchenko, Andrey"}],"date_updated":"2021-01-12T07:59:48Z","doi":"10.1145/1250734.1250769","publication_status":"published","type":"conference","abstract":[{"text":"The success of software verification depends on the ability to find a suitable abstraction of a program automatically. We propose a method for automated abstraction refinement which overcomes some limitations of current predicate discovery schemes. In current schemes, the cause of a false alarm is identified as an infeasible error path, and the abstraction is refined in order to remove that path. By contrast, we view the cause of a false alarm -the spurious counterexample- as a full-fledged program, namely, a fragment of the original program whose control-flow graph may contain loops and represent unbounded computations. There are two advantages to using such path programs as counterexamples for abstraction refinement. First, we can bring the whole machinery of program analysis to bear on path programs, which are typically small compared to the original program. Specifically, we use constraint-based invariant generation to automatically infer invariants of path programs-so-called path invariants. Second, we use path invariants for abstraction refinement in order to remove not one infeasibility at a time, but at once all (possibly infinitely many) infeasible error computations that are represented by a path program. Unlike previous predicate discovery schemes, our method handles loops without unrolling them; it infers abstractions that involve universal quantification and naturally incorporates disjunctive reasoning.","lang":"eng"}],"extern":1,"citation":{"apa":"Beyer, D., Henzinger, T. A., Majumdar, R., &#38; Rybalchenko, A. (2007). Path invariants (pp. 300–309). Presented at the PLDI: Programming Languages Design and Implementation, ACM. <a href=\"https://doi.org/10.1145/1250734.1250769\">https://doi.org/10.1145/1250734.1250769</a>","mla":"Beyer, Dirk, et al. <i>Path Invariants</i>. ACM, 2007, pp. 300–09, doi:<a href=\"https://doi.org/10.1145/1250734.1250769\">10.1145/1250734.1250769</a>.","ama":"Beyer D, Henzinger TA, Majumdar R, Rybalchenko A. Path invariants. In: ACM; 2007:300-309. doi:<a href=\"https://doi.org/10.1145/1250734.1250769\">10.1145/1250734.1250769</a>","ieee":"D. Beyer, T. A. Henzinger, R. Majumdar, and A. Rybalchenko, “Path invariants,” presented at the PLDI: Programming Languages Design and Implementation, 2007, pp. 300–309.","ista":"Beyer D, Henzinger TA, Majumdar R, Rybalchenko A. 2007. Path invariants. PLDI: Programming Languages Design and Implementation, 300–309.","short":"D. Beyer, T.A. Henzinger, R. Majumdar, A. Rybalchenko, in:, ACM, 2007, pp. 300–309.","chicago":"Beyer, Dirk, Thomas A Henzinger, Ritankar Majumdar, and Andrey Rybalchenko. “Path Invariants,” 300–309. ACM, 2007. <a href=\"https://doi.org/10.1145/1250734.1250769\">https://doi.org/10.1145/1250734.1250769</a>."},"quality_controlled":0,"day":"01","status":"public","date_created":"2018-12-11T12:09:32Z","_id":"4571"},{"date_updated":"2021-01-12T07:59:48Z","author":[{"first_name":"Dirk","last_name":"Beyer","full_name":"Beyer, Dirk"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Thomas Henzinger"},{"full_name":"Majumdar, Ritankar S","last_name":"Majumdar","first_name":"Ritankar"},{"last_name":"Rybalchenko","first_name":"Andrey","full_name":"Rybalchenko, Andrey"}],"title":"Invariant synthesis for combined theories","date_published":"2007-01-01T00:00:00Z","alternative_title":["LNCS"],"month":"01","intvolume":"      4349","acknowledgement":"This research was sponsored in part by the grants NSF-CCF-0427202 and NSF-CCF-0546170.","publisher":"Springer","year":"2007","page":"378 - 394","conference":{"name":"VMCAI: Verification, Model Checking and Abstract Interpretation"},"publist_id":"138","_id":"4572","date_created":"2018-12-11T12:09:32Z","status":"public","day":"01","quality_controlled":0,"volume":4349,"extern":1,"citation":{"ieee":"D. Beyer, T. A. Henzinger, R. Majumdar, and A. Rybalchenko, “Invariant synthesis for combined theories,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, 2007, vol. 4349, pp. 378–394.","short":"D. Beyer, T.A. Henzinger, R. Majumdar, A. Rybalchenko, in:, Springer, 2007, pp. 378–394.","ista":"Beyer D, Henzinger TA, Majumdar R, Rybalchenko A. 2007. Invariant synthesis for combined theories. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 4349, 378–394.","ama":"Beyer D, Henzinger TA, Majumdar R, Rybalchenko A. Invariant synthesis for combined theories. In: Vol 4349. Springer; 2007:378-394. doi:<a href=\"https://doi.org/10.1007/978-3-540-69738-1_27\">10.1007/978-3-540-69738-1_27</a>","chicago":"Beyer, Dirk, Thomas A Henzinger, Ritankar Majumdar, and Andrey Rybalchenko. “Invariant Synthesis for Combined Theories,” 4349:378–94. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-69738-1_27\">https://doi.org/10.1007/978-3-540-69738-1_27</a>.","apa":"Beyer, D., Henzinger, T. A., Majumdar, R., &#38; Rybalchenko, A. (2007). Invariant synthesis for combined theories (Vol. 4349, pp. 378–394). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Springer. <a href=\"https://doi.org/10.1007/978-3-540-69738-1_27\">https://doi.org/10.1007/978-3-540-69738-1_27</a>","mla":"Beyer, Dirk, et al. <i>Invariant Synthesis for Combined Theories</i>. Vol. 4349, Springer, 2007, pp. 378–94, doi:<a href=\"https://doi.org/10.1007/978-3-540-69738-1_27\">10.1007/978-3-540-69738-1_27</a>."},"abstract":[{"text":"We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of programmer-specified invariant templates, our algorithm reduces the invariant synthesis problem to a sequence of arithmetic constraint satisfaction queries. Since the combination of linear arithmetic and uninterpreted functions is a widely applied predicate domain for program verification, our algorithm provides a powerful tool to statically and automatically reason about program correctness. The algorithm can also be used for the synthesis of invariants over arrays and set data structures, because satisfiability questions for the theories of sets and arrays can be reduced to the theory of linear arithmetic with uninterpreted functions. We have implemented our algorithm and used it to find invariants for a low-level memory allocator written in C.","lang":"eng"}],"type":"conference","doi":"10.1007/978-3-540-69738-1_27","publication_status":"published"},{"publist_id":"135","conference":{"name":"CAV: Computer Aided Verification"},"page":"504 - 518","year":"2007","publisher":"Springer","acknowledgement":"This research was supported in part by the grant SFU/PRG 06-3, and by the Swiss National Science Foundation.","alternative_title":["LNCS"],"date_published":"2007-07-02T00:00:00Z","month":"07","intvolume":"      4590","author":[{"full_name":"Beyer, Dirk","last_name":"Beyer","first_name":"Dirk"},{"full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Grégory","last_name":"Théoduloz","full_name":"Théoduloz, Grégory"}],"title":"Configurable software verification: Concretizing the convergence of model checking and program analysis","date_updated":"2021-01-12T07:59:48Z","publication_status":"published","doi":"10.1007/978-3-540-73368-3_51","abstract":[{"text":"In automatic software verification, we have observed a theoretical convergence of model checking and program analysis. In practice, however, model checkers are still mostly concerned with precision, e.g., the removal of spurious counterexamples; for this purpose they build and refine reachability trees. Lattice-based program analyzers, on the other hand, are primarily concerned with efficiency. We designed an algorithm and built a tool that can be configured to perform not only a purely tree-based or a purely lattice-based analysis, but offers many intermediate settings that have not been evaluated before. The algorithm and tool take one or more abstract interpreters, such as a predicate abstraction and a shape analysis, and configure their execution and interaction using several parameters. Our experiments show that such customization may lead to dramatic improvements in the precision-efficiency spectrum.","lang":"eng"}],"type":"conference","volume":4590,"citation":{"mla":"Beyer, Dirk, et al. <i>Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis</i>. Vol. 4590, Springer, 2007, pp. 504–18, doi:<a href=\"https://doi.org/10.1007/978-3-540-73368-3_51\">10.1007/978-3-540-73368-3_51</a>.","apa":"Beyer, D., Henzinger, T. A., &#38; Théoduloz, G. (2007). Configurable software verification: Concretizing the convergence of model checking and program analysis (Vol. 4590, pp. 504–518). Presented at the CAV: Computer Aided Verification, Springer. <a href=\"https://doi.org/10.1007/978-3-540-73368-3_51\">https://doi.org/10.1007/978-3-540-73368-3_51</a>","chicago":"Beyer, Dirk, Thomas A Henzinger, and Grégory Théoduloz. “Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis,” 4590:504–18. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-73368-3_51\">https://doi.org/10.1007/978-3-540-73368-3_51</a>.","ista":"Beyer D, Henzinger TA, Théoduloz G. 2007. Configurable software verification: Concretizing the convergence of model checking and program analysis. CAV: Computer Aided Verification, LNCS, vol. 4590, 504–518.","short":"D. Beyer, T.A. Henzinger, G. Théoduloz, in:, Springer, 2007, pp. 504–518.","ieee":"D. Beyer, T. A. Henzinger, and G. Théoduloz, “Configurable software verification: Concretizing the convergence of model checking and program analysis,” presented at the CAV: Computer Aided Verification, 2007, vol. 4590, pp. 504–518.","ama":"Beyer D, Henzinger TA, Théoduloz G. Configurable software verification: Concretizing the convergence of model checking and program analysis. In: Vol 4590. Springer; 2007:504-518. doi:<a href=\"https://doi.org/10.1007/978-3-540-73368-3_51\">10.1007/978-3-540-73368-3_51</a>"},"extern":1,"quality_controlled":0,"status":"public","day":"02","date_created":"2018-12-11T12:09:33Z","_id":"4573"},{"conference":{"name":"ICWS: International Conference on Web Service"},"publist_id":"134","page":"831 - 838","year":"2007","acknowledgement":"This research was supported in part by the NSF grant CCR-0225610 and by the Swiss National Science Foundation.","publisher":"IEEE","date_published":"2007-07-30T00:00:00Z","month":"07","title":"An application of web-service interfaces","author":[{"full_name":"Beyer, Dirk","first_name":"Dirk","last_name":"Beyer"},{"full_name":"Chakrabarti, Arindam","first_name":"Arindam","last_name":"Chakrabarti"},{"full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Seshia, Sanjit A","first_name":"Sanjit","last_name":"Seshia"}],"date_updated":"2021-01-12T07:59:49Z","doi":"10.1109/ICWS.2007.32 ","publication_status":"published","abstract":[{"text":"We present a case study to illustrate our formalism for the specification and verification of the method-invocation behavior of web-service applications constructed from asynchronously interacting multi-threaded distributed components. Our model is expressive enough to allow the representation of recursion and dynamic thread creation, and yet permits the algorithmic analysis of the following two questions: (1) Does a given service satisfy a safety specification? (2) Can a given service be substituted by a another service in an arbitrary context? Our case study is based on the Amazon.com E-Commerce Services (ECS) platform.","lang":"eng"}],"type":"conference","citation":{"mla":"Beyer, Dirk, et al. <i>An Application of Web-Service Interfaces</i>. IEEE, 2007, pp. 831–38, doi:<a href=\"https://doi.org/10.1109/ICWS.2007.32 \">10.1109/ICWS.2007.32 </a>.","apa":"Beyer, D., Chakrabarti, A., Henzinger, T. A., &#38; Seshia, S. (2007). An application of web-service interfaces (pp. 831–838). Presented at the ICWS: International Conference on Web Service, IEEE. <a href=\"https://doi.org/10.1109/ICWS.2007.32 \">https://doi.org/10.1109/ICWS.2007.32 </a>","chicago":"Beyer, Dirk, Arindam Chakrabarti, Thomas A Henzinger, and Sanjit Seshia. “An Application of Web-Service Interfaces,” 831–38. IEEE, 2007. <a href=\"https://doi.org/10.1109/ICWS.2007.32 \">https://doi.org/10.1109/ICWS.2007.32 </a>.","ama":"Beyer D, Chakrabarti A, Henzinger TA, Seshia S. An application of web-service interfaces. In: IEEE; 2007:831-838. doi:<a href=\"https://doi.org/10.1109/ICWS.2007.32 \">10.1109/ICWS.2007.32 </a>","ista":"Beyer D, Chakrabarti A, Henzinger TA, Seshia S. 2007. An application of web-service interfaces. ICWS: International Conference on Web Service, 831–838.","short":"D. Beyer, A. Chakrabarti, T.A. Henzinger, S. Seshia, in:, IEEE, 2007, pp. 831–838.","ieee":"D. Beyer, A. Chakrabarti, T. A. Henzinger, and S. Seshia, “An application of web-service interfaces,” presented at the ICWS: International Conference on Web Service, 2007, pp. 831–838."},"extern":1,"day":"30","status":"public","quality_controlled":0,"_id":"4575","date_created":"2018-12-11T12:09:33Z"},{"year":"2007","page":"188 - 217","publist_id":"81","date_updated":"2021-01-12T08:00:37Z","issue":"3","author":[{"first_name":"Luca","last_name":"De Alfaro","full_name":"de Alfaro, Luca"},{"full_name":"Thomas Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"}],"title":"Concurrent reachability games","month":"11","intvolume":"       386","date_published":"2007-11-01T00:00:00Z","publisher":"Elsevier","doi":"10.1016/j.tcs.2007.07.008","publication_status":"published","publication":"Theoretical Computer Science","date_created":"2018-12-11T12:09:49Z","_id":"4626","quality_controlled":0,"day":"01","status":"public","extern":1,"citation":{"ama":"De Alfaro L, Henzinger TA, Kupferman O. Concurrent reachability games. <i>Theoretical Computer Science</i>. 2007;386(3):188-217. doi:<a href=\"https://doi.org/10.1016/j.tcs.2007.07.008\">10.1016/j.tcs.2007.07.008</a>","ieee":"L. De Alfaro, T. A. Henzinger, and O. Kupferman, “Concurrent reachability games,” <i>Theoretical Computer Science</i>, vol. 386, no. 3. Elsevier, pp. 188–217, 2007.","ista":"De Alfaro L, Henzinger TA, Kupferman O. 2007. Concurrent reachability games. Theoretical Computer Science. 386(3), 188–217.","short":"L. De Alfaro, T.A. Henzinger, O. Kupferman, Theoretical Computer Science 386 (2007) 188–217.","chicago":"De Alfaro, Luca, Thomas A Henzinger, and Orna Kupferman. “Concurrent Reachability Games.” <i>Theoretical Computer Science</i>. Elsevier, 2007. <a href=\"https://doi.org/10.1016/j.tcs.2007.07.008\">https://doi.org/10.1016/j.tcs.2007.07.008</a>.","apa":"De Alfaro, L., Henzinger, T. A., &#38; Kupferman, O. (2007). Concurrent reachability games. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2007.07.008\">https://doi.org/10.1016/j.tcs.2007.07.008</a>","mla":"De Alfaro, Luca, et al. “Concurrent Reachability Games.” <i>Theoretical Computer Science</i>, vol. 386, no. 3, Elsevier, 2007, pp. 188–217, doi:<a href=\"https://doi.org/10.1016/j.tcs.2007.07.008\">10.1016/j.tcs.2007.07.008</a>."},"volume":386,"type":"journal_article","abstract":[{"lang":"eng","text":"We consider concurrent two-player games with reachability objectives. In such games, at each round, player 1 and player 2 independently and simultaneously choose moves, and the two choices determine the next state of the game. The objective of player 1 is to reach a set of target states; the objective of player 2 is to prevent this. These are zero-sum games, and the reachability objective is one of the most basic objectives: determining the set of states from which player 1 can win the game is a fundamental problem in control theory and system verification. There are three types of winning states, according to the degree of certainty with which player 1 can reach the target. From type-1 states, player 1 has a deterministic strategy to always reach the target. From type-2 states, player 1 has a randomized strategy to reach the target with probability 1. From type-3 states, player 1 has for every real ε&gt;0 a randomized strategy to reach the target with probability greater than 1−ε. We show that for finite state spaces, all three sets of winning states can be computed in polynomial time: type-1 states in linear time, and type-2 and type-3 states in quadratic time. The algorithms to compute the three sets of winning states also enable the construction of the winning and spoiling strategies."}]},{"quality_controlled":0,"status":"public","day":"01","date_created":"2018-12-11T11:47:19Z","_id":"582","type":"conference","abstract":[{"lang":"eng","text":"Using the techniques of &quot;quantum weak-measurements&quot; as a coherent amplification mechanism for small signals, for the first time we have measured the recently proposed &quot;spin Hall effect&quot; of light."}],"citation":{"chicago":"Hosten, Onur, and Paul Kwiat. “Observing the Spin Hall Effect of Light via Quantum Weak Measurements.” OSA, 2007. <a href=\"https://doi.org/10.1364/FIO.2007.JTuA4\">https://doi.org/10.1364/FIO.2007.JTuA4</a>.","ista":"Hosten O, Kwiat P. 2007. Observing the spin hall effect of light via quantum weak measurements. OMD: Organic Materials and Devices for Displays and Energy Conversion, Optics InfoBase Conference Papers, .","short":"O. Hosten, P. Kwiat, in:, OSA, 2007.","ieee":"O. Hosten and P. Kwiat, “Observing the spin hall effect of light via quantum weak measurements,” presented at the OMD: Organic Materials and Devices for Displays and Energy Conversion, 2007.","ama":"Hosten O, Kwiat P. Observing the spin hall effect of light via quantum weak measurements. In: OSA; 2007. doi:<a href=\"https://doi.org/10.1364/FIO.2007.JTuA4\">10.1364/FIO.2007.JTuA4</a>","mla":"Hosten, Onur, and Paul Kwiat. <i>Observing the Spin Hall Effect of Light via Quantum Weak Measurements</i>. OSA, 2007, doi:<a href=\"https://doi.org/10.1364/FIO.2007.JTuA4\">10.1364/FIO.2007.JTuA4</a>.","apa":"Hosten, O., &#38; Kwiat, P. (2007). Observing the spin hall effect of light via quantum weak measurements. Presented at the OMD: Organic Materials and Devices for Displays and Energy Conversion, OSA. <a href=\"https://doi.org/10.1364/FIO.2007.JTuA4\">https://doi.org/10.1364/FIO.2007.JTuA4</a>"},"extern":1,"doi":"10.1364/FIO.2007.JTuA4","publication_status":"published","title":"Observing the spin hall effect of light via quantum weak measurements","author":[{"orcid":"0000-0002-2031-204X","last_name":"Hosten","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","first_name":"Onur","full_name":"Onur Hosten"},{"last_name":"Kwiat","first_name":"Paul","full_name":"Kwiat, Paul G"}],"date_updated":"2021-01-12T08:03:41Z","publisher":"OSA","month":"01","date_published":"2007-01-01T00:00:00Z","alternative_title":["Optics InfoBase Conference Papers"],"year":"2007","conference":{"name":"OMD: Organic Materials and Devices for Displays and Energy Conversion"},"publist_id":"7228"},{"page":"159-164","external_id":{"pmid":["17240342"]},"year":"2007","language":[{"iso":"eng"}],"publisher":"Elsevier","intvolume":"        17","month":"01","date_published":"2007-01-23T00:00:00Z","issue":"2","author":[{"first_name":"Tina L.","last_name":"Gumienny","full_name":"Gumienny, Tina L."},{"full_name":"MacNeil, Lesley T.","last_name":"MacNeil","first_name":"Lesley T."},{"full_name":"Wang, Huang","first_name":"Huang","last_name":"Wang"},{"id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","first_name":"Mario","last_name":"de Bono","orcid":"0000-0001-8347-0443","full_name":"de Bono, Mario"},{"last_name":"Wrana","first_name":"Jeffrey L.","full_name":"Wrana, Jeffrey L."},{"full_name":"Padgett, Richard W.","first_name":"Richard W.","last_name":"Padgett"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Glypican LON-2 is a conserved negative regulator of BMP-like signaling in Caenorhabditis elegans","date_updated":"2021-01-12T08:06:22Z","doi":"10.1016/j.cub.2006.11.065","publication_status":"published","publication":"Current Biology","oa_version":"None","type":"journal_article","citation":{"mla":"Gumienny, Tina L., et al. “Glypican LON-2 Is a Conserved Negative Regulator of BMP-like Signaling in Caenorhabditis Elegans.” <i>Current Biology</i>, vol. 17, no. 2, Elsevier, 2007, pp. 159–64, doi:<a href=\"https://doi.org/10.1016/j.cub.2006.11.065\">10.1016/j.cub.2006.11.065</a>.","apa":"Gumienny, T. L., MacNeil, L. T., Wang, H., de Bono, M., Wrana, J. L., &#38; Padgett, R. W. (2007). Glypican LON-2 is a conserved negative regulator of BMP-like signaling in Caenorhabditis elegans. <i>Current Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cub.2006.11.065\">https://doi.org/10.1016/j.cub.2006.11.065</a>","chicago":"Gumienny, Tina L., Lesley T. MacNeil, Huang Wang, Mario de Bono, Jeffrey L. Wrana, and Richard W. Padgett. “Glypican LON-2 Is a Conserved Negative Regulator of BMP-like Signaling in Caenorhabditis Elegans.” <i>Current Biology</i>. Elsevier, 2007. <a href=\"https://doi.org/10.1016/j.cub.2006.11.065\">https://doi.org/10.1016/j.cub.2006.11.065</a>.","ama":"Gumienny TL, MacNeil LT, Wang H, de Bono M, Wrana JL, Padgett RW. Glypican LON-2 is a conserved negative regulator of BMP-like signaling in Caenorhabditis elegans. <i>Current Biology</i>. 2007;17(2):159-164. doi:<a href=\"https://doi.org/10.1016/j.cub.2006.11.065\">10.1016/j.cub.2006.11.065</a>","short":"T.L. Gumienny, L.T. MacNeil, H. Wang, M. de Bono, J.L. Wrana, R.W. Padgett, Current Biology 17 (2007) 159–164.","ieee":"T. L. Gumienny, L. T. MacNeil, H. Wang, M. de Bono, J. L. Wrana, and R. W. Padgett, “Glypican LON-2 is a conserved negative regulator of BMP-like signaling in Caenorhabditis elegans,” <i>Current Biology</i>, vol. 17, no. 2. Elsevier, pp. 159–164, 2007.","ista":"Gumienny TL, MacNeil LT, Wang H, de Bono M, Wrana JL, Padgett RW. 2007. Glypican LON-2 is a conserved negative regulator of BMP-like signaling in Caenorhabditis elegans. Current Biology. 17(2), 159–164."},"extern":"1","publication_identifier":{"issn":["0960-9822"]},"pmid":1,"volume":17,"status":"public","day":"23","quality_controlled":"1","date_created":"2019-03-21T08:44:44Z","_id":"6150"},{"article_processing_charge":"No","external_id":{"arxiv":["0704.1217"]},"year":"2007","language":[{"iso":"eng"}],"article_number":"0704.1217","month":"04","date_published":"2007-04-10T00:00:00Z","title":"The Manin conjecture in dimension 2","author":[{"orcid":"0000-0002-8314-0177","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87","first_name":"Timothy D","full_name":"Browning, Timothy D"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"date_updated":"2021-01-12T08:07:04Z","main_file_link":[{"url":"https://arxiv.org/abs/0704.1217","open_access":"1"}],"publication_status":"submitted","publication":"arXiv","oa_version":"Preprint","type":"preprint","abstract":[{"lang":"eng","text":"These lecture notes describe the current state of affairs for Manin's conjecture in the context of del Pezzo surfaces."}],"arxiv":1,"extern":"1","citation":{"mla":"Browning, Timothy D. “The Manin Conjecture in Dimension 2.” <i>ArXiv</i>, 0704.1217.","apa":"Browning, T. D. (n.d.). The Manin conjecture in dimension 2. <i>arXiv</i>.","chicago":"Browning, Timothy D. “The Manin Conjecture in Dimension 2.” <i>ArXiv</i>, n.d.","ama":"Browning TD. The Manin conjecture in dimension 2. <i>arXiv</i>.","ieee":"T. D. Browning, “The Manin conjecture in dimension 2,” <i>arXiv</i>. .","ista":"Browning TD. The Manin conjecture in dimension 2. arXiv, 0704.1217.","short":"T.D. Browning, ArXiv (n.d.)."},"status":"public","day":"10","date_created":"2019-04-16T14:17:50Z","_id":"6321"}]