[{"date_updated":"2021-01-12T06:57:25Z","extern":1,"quality_controlled":0,"citation":{"short":"C. Ambühl, U. Wagner, Theory of Computing Systems 38 (2005) 279–292.","mla":"Ambühl, Christoph, and Uli Wagner. “The Clique Problem in Intersection Graphs of Ellipses and Triangles.” <i>Theory of Computing Systems</i>, vol. 38, no. 3, Springer, 2005, pp. 279–92, doi:<a href=\"https://doi.org/10.1007/s00224-005-1141-6\">10.1007/s00224-005-1141-6</a>.","apa":"Ambühl, C., &#38; Wagner, U. (2005). The Clique problem in intersection graphs of ellipses and triangles. <i>Theory of Computing Systems</i>. Springer. <a href=\"https://doi.org/10.1007/s00224-005-1141-6\">https://doi.org/10.1007/s00224-005-1141-6</a>","chicago":"Ambühl, Christoph, and Uli Wagner. “The Clique Problem in Intersection Graphs of Ellipses and Triangles.” <i>Theory of Computing Systems</i>. Springer, 2005. <a href=\"https://doi.org/10.1007/s00224-005-1141-6\">https://doi.org/10.1007/s00224-005-1141-6</a>.","ista":"Ambühl C, Wagner U. 2005. The Clique problem in intersection graphs of ellipses and triangles. Theory of Computing Systems. 38(3), 279–292.","ama":"Ambühl C, Wagner U. The Clique problem in intersection graphs of ellipses and triangles. <i>Theory of Computing Systems</i>. 2005;38(3):279-292. doi:<a href=\"https://doi.org/10.1007/s00224-005-1141-6\">10.1007/s00224-005-1141-6</a>","ieee":"C. Ambühl and U. Wagner, “The Clique problem in intersection graphs of ellipses and triangles,” <i>Theory of Computing Systems</i>, vol. 38, no. 3. Springer, pp. 279–292, 2005."},"author":[{"full_name":"Ambühl, Christoph","last_name":"Ambühl","first_name":"Christoph"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Uli Wagner","last_name":"Wagner","first_name":"Uli","orcid":"0000-0002-1494-0568"}],"abstract":[{"lang":"eng","text":"Intersection graphs of disks and of line segments, respectively, have been well studied, because of both practical applications and theoretically interesting properties of these graphs. Despite partial results, the complexity status of the Clique problem for these two graph classes is still open. Here, we consider the Clique problem for intersection graphs of ellipses, which, in a sense, interpolate between disks and line segments, and show that the problem is APX-hard in that case. Moreover, this holds even if for all ellipses, the ratio of the larger over the smaller radius is some prescribed number. Furthermore, the reduction immediately carries over to intersection graphs of triangles. To our knowledge, this is the first hardness result for the Clique problem in intersection graphs of convex objects with finite description complexity. We also describe a simple approximation algorithm for the case of ellipses for which the ratio of radii is bounded."}],"month":"05","publication_status":"published","issue":"3","publisher":"Springer","date_published":"2005-05-01T00:00:00Z","volume":38,"title":"The Clique problem in intersection graphs of ellipses and triangles","date_created":"2018-12-11T11:57:36Z","type":"journal_article","_id":"2427","year":"2005","doi":"10.1007/s00224-005-1141-6","page":"279 - 292","day":"01","status":"public","intvolume":"        38","publist_id":"4497","publication":"Theory of Computing Systems"},{"type":"conference","_id":"2428","date_created":"2018-12-11T11:57:36Z","day":"01","page":"545 - 554","doi":"10.1137/S0097539704446682","year":"2005","status":"public","conference":{"name":"SODA: Symposium on Discrete Algorithms"},"publist_id":"4496","citation":{"apa":"Fiat, A., Levy, M., Matoušek, J., Pach, E., Sharir, M., Smorodinsky, S., … Welzl, E. (2005). Online conflict-free coloring for intervals (pp. 545–554). Presented at the SODA: Symposium on Discrete Algorithms, SIAM. <a href=\"https://doi.org/10.1137/S0097539704446682\">https://doi.org/10.1137/S0097539704446682</a>","ista":"Fiat A, Levy M, Matoušek J, Pach E, Sharir M, Smorodinsky S, Wagner U, Welzl E. 2005. Online conflict-free coloring for intervals. SODA: Symposium on Discrete Algorithms, 545–554.","chicago":"Fiat, Amos, Meital Levy, Jiří Matoušek, Elchanan Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, and Emo Welzl. “Online Conflict-Free Coloring for Intervals,” 545–54. SIAM, 2005. <a href=\"https://doi.org/10.1137/S0097539704446682\">https://doi.org/10.1137/S0097539704446682</a>.","ama":"Fiat A, Levy M, Matoušek J, et al. Online conflict-free coloring for intervals. In: SIAM; 2005:545-554. doi:<a href=\"https://doi.org/10.1137/S0097539704446682\">10.1137/S0097539704446682</a>","ieee":"A. Fiat <i>et al.</i>, “Online conflict-free coloring for intervals,” presented at the SODA: Symposium on Discrete Algorithms, 2005, pp. 545–554.","short":"A. Fiat, M. Levy, J. Matoušek, E. Pach, M. Sharir, S. Smorodinsky, U. Wagner, E. Welzl, in:, SIAM, 2005, pp. 545–554.","mla":"Fiat, Amos, et al. <i>Online Conflict-Free Coloring for Intervals</i>. SIAM, 2005, pp. 545–54, doi:<a href=\"https://doi.org/10.1137/S0097539704446682\">10.1137/S0097539704446682</a>."},"date_updated":"2021-01-12T06:57:25Z","extern":1,"quality_controlled":0,"author":[{"full_name":"Fiat, Amos","last_name":"Fiat","first_name":"Amos"},{"first_name":"Meital","last_name":"Levy","full_name":"Levy, Meital B"},{"first_name":"Jiří","last_name":"Matoušek","full_name":"Matoušek, Jiří"},{"full_name":"Pach, Elchanan M","first_name":"Elchanan","last_name":"Pach"},{"first_name":"Micha","last_name":"Sharir","full_name":"Sharir, Micha"},{"last_name":"Smorodinsky","first_name":"Shakhar","full_name":"Smorodinsky, Shakhar"},{"orcid":"0000-0002-1494-0568","last_name":"Wagner","first_name":"Uli","full_name":"Uli Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Welzl, Emo","last_name":"Welzl","first_name":"Emo"}],"abstract":[{"text":"We consider an online version of the conflict-free coloring of a set of points on the line, where each newly inserted point must be assigned a color upon insertion, and at all times the coloring has to be conflict-free, in the sense that in every interval I there is a color that appears exactly once in I. We present several deterministic and randomized algorithms for achieving this goal, and analyze their performance, that is, the maximum number of colors that they need to use, as a function of the number n of inserted points. We first show that a natural and simple (deterministic) approach may perform rather poorly, requiring Ω(√n) colors in the worst case. We then modify this approach, to obtain an efficient deterministic algorithm that uses a maximum of Θ(log 2 n) colors. Next, we present two randomized solutions. The first algorithm requires an expected number of at most O(log 2 n) colors, and produces a coloring which is valid with high probability, and the second one, which is a variant of our efficient deterministic algorithm, requires an expected number of at most O(log n log log n) colors but always produces a valid coloring. We also analyze the performance of the simplest proposed algorithm when the points are inserted in a random order, and present an incomplete analysis that indicates that, with high probability, it uses only O(log n) colors. Finally, we show that in the extension of this problem to two dimensions, where the relevant ranges are disks, n colors may be required in the worst case. The average-case behavior for disks, and cases involving other planar ranges, are still open.","lang":"eng"}],"month":"01","publication_status":"published","title":"Online conflict-free coloring for intervals","publisher":"SIAM","date_published":"2005-01-01T00:00:00Z"},{"publisher":"Springer","date_published":"2005-09-19T00:00:00Z","title":"Verifying quantitative properties using bound functions","volume":3725,"abstract":[{"lang":"eng","text":"We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have integer values at states, and properties have integer values on traces. For example, the value of a quantitative proposition at a state may represent power consumed at the state, and the value of a quantitative property on a trace may represent energy used along the trace. The value of a quantitative property at a state, then, is the maximum (or minimum) value achievable over all possible traces from the state. In this framework, model checking can be used to compute, for example, the minimum battery capacity necessary for achieving a given objective, or the maximal achievable lifetime of a system with a given initial battery capacity. In the case of open systems, these problems require the solution of games with integer values.\nQuantitative model checking and game solving is undecidable, except if bounds on the computation can be found. Indeed, many interesting quantitative properties, like minimal necessary battery capacity and maximal achievable lifetime, can be naturally specified by quantitative-bound automata, which are finite automata with integer registers whose analysis is constrained by a bound function f that maps each system K to an integer f(K). Along with the linear-time, automaton-based view of quantitative verification, we present a corresponding branching-time view based on a quantitative-bound μ-calculus, and we study the relationship, expressive power, and complexity of both views.\n"}],"publication_status":"published","month":"09","author":[{"full_name":"Chakrabarti, Arindam","last_name":"Chakrabarti","first_name":"Arindam"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Krishnendu Chatterjee"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"first_name":"Orna","last_name":"Kupferman","full_name":"Kupferman, Orna"},{"first_name":"Ritankar","last_name":"Majumdar","full_name":"Majumdar, Ritankar S"}],"alternative_title":["LNCS"],"date_updated":"2021-01-12T07:59:42Z","extern":1,"quality_controlled":0,"citation":{"mla":"Chakrabarti, Arindam, et al. <i>Verifying Quantitative Properties Using Bound Functions</i>. Vol. 3725, Springer, 2005, pp. 50–64, doi:<a href=\"https://doi.org/10.1007/11560548_7\">10.1007/11560548_7</a>.","short":"A. Chakrabarti, K. Chatterjee, T.A. Henzinger, O. Kupferman, R. Majumdar, in:, Springer, 2005, pp. 50–64.","ieee":"A. Chakrabarti, K. Chatterjee, T. A. Henzinger, O. Kupferman, and R. Majumdar, “Verifying quantitative properties using bound functions,” presented at the CHARME: Correct Hardware Design and Verification Methods, 2005, vol. 3725, pp. 50–64.","ama":"Chakrabarti A, Chatterjee K, Henzinger TA, Kupferman O, Majumdar R. Verifying quantitative properties using bound functions. In: Vol 3725. Springer; 2005:50-64. doi:<a href=\"https://doi.org/10.1007/11560548_7\">10.1007/11560548_7</a>","ista":"Chakrabarti A, Chatterjee K, Henzinger TA, Kupferman O, Majumdar R. 2005. Verifying quantitative properties using bound functions. CHARME: Correct Hardware Design and Verification Methods, LNCS, vol. 3725, 50–64.","chicago":"Chakrabarti, Arindam, Krishnendu Chatterjee, Thomas A Henzinger, Orna Kupferman, and Ritankar Majumdar. “Verifying Quantitative Properties Using Bound Functions,” 3725:50–64. Springer, 2005. <a href=\"https://doi.org/10.1007/11560548_7\">https://doi.org/10.1007/11560548_7</a>.","apa":"Chakrabarti, A., Chatterjee, K., Henzinger, T. A., Kupferman, O., &#38; Majumdar, R. (2005). Verifying quantitative properties using bound functions (Vol. 3725, pp. 50–64). Presented at the CHARME: Correct Hardware Design and Verification Methods, Springer. <a href=\"https://doi.org/10.1007/11560548_7\">https://doi.org/10.1007/11560548_7</a>"},"intvolume":"      3725","conference":{"name":"CHARME: Correct Hardware Design and Verification Methods"},"publist_id":"149","status":"public","day":"19","year":"2005","doi":"10.1007/11560548_7","page":"50 - 64","date_created":"2018-12-11T12:09:29Z","_id":"4560","type":"conference"},{"citation":{"short":"D. Beyer, A. Chakrabarti, T.A. Henzinger, in:, ACM, 2005, pp. 148–159.","mla":"Beyer, Dirk, et al. <i>Web Service Interfaces</i>. ACM, 2005, pp. 148–59, doi:<a href=\"https://doi.org/10.1145/1060745.1060770\">10.1145/1060745.1060770</a>.","ieee":"D. Beyer, A. Chakrabarti, and T. A. Henzinger, “Web service interfaces,” presented at the WWW: World Wide Web Conference, 2005, pp. 148–159.","apa":"Beyer, D., Chakrabarti, A., &#38; Henzinger, T. A. (2005). Web service interfaces (pp. 148–159). Presented at the WWW: World Wide Web Conference, ACM. <a href=\"https://doi.org/10.1145/1060745.1060770\">https://doi.org/10.1145/1060745.1060770</a>","ama":"Beyer D, Chakrabarti A, Henzinger TA. Web service interfaces. In: ACM; 2005:148-159. doi:<a href=\"https://doi.org/10.1145/1060745.1060770\">10.1145/1060745.1060770</a>","chicago":"Beyer, Dirk, Arindam Chakrabarti, and Thomas A Henzinger. “Web Service Interfaces,” 148–59. ACM, 2005. <a href=\"https://doi.org/10.1145/1060745.1060770\">https://doi.org/10.1145/1060745.1060770</a>.","ista":"Beyer D, Chakrabarti A, Henzinger TA. 2005. Web service interfaces. WWW: World Wide Web Conference, 148–159."},"quality_controlled":0,"extern":1,"date_updated":"2021-01-12T07:59:50Z","author":[{"full_name":"Beyer, Dirk","last_name":"Beyer","first_name":"Dirk"},{"first_name":"Arindam","last_name":"Chakrabarti","full_name":"Chakrabarti, Arindam"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"month":"05","publication_status":"published","abstract":[{"lang":"eng","text":"We present a language for specifying web service interfaces. A web service interface puts three kinds of constraints on the users of the service. First, the interface specifies the methods that can be called by a client, together with types of input and output parameters; these are called signature constraints. Second, the interface may specify propositional constraints on method calls and output values that may oc- cur in a web service conversation; these are called consis- tency constraints. Third, the interface may specify temporal constraints on the ordering of method calls; these are called protocol constraints. The interfaces can be used to check, first, if two or more web services are compatible, and second, if a web service A can be safely substituted for a web ser- vice B. The algorithm for compatibility checking verifies that two or more interfaces fulfill each others’ constraints. The algorithm for substitutivity checking verifies that service A demands fewer and fulfills more constraints than service B."}],"title":"Web service interfaces","date_published":"2005-05-01T00:00:00Z","publisher":"ACM","type":"conference","_id":"4576","date_created":"2018-12-11T12:09:33Z","page":"148 - 159","doi":"10.1145/1060745.1060770","year":"2005","status":"public","day":"01","acknowledgement":"This research was supported in part by the ONR grant N00014-02-1-0671 and by the NSF grants CCR-0234690 and CCR-0225610.","conference":{"name":"WWW: World Wide Web Conference"},"publist_id":"132"},{"date_published":"2005-03-24T00:00:00Z","publisher":"Springer","title":"Checking memory safety with BLAST","volume":3442,"month":"03","publication_status":"published","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 statically proves that either the program satisfies the safety property or the program has an execution trace that exhibits a violation of the property. BLAST constructs, explores, and refines abstractions of the program state space based on lazy predicate abstraction and interpolation-based predicate discovery. We show how BLAST can be used to statically prove memory safety for C programs. We take a two-step approach. First, we use Ccured, a type-based memory safety analyzer, to annotate with run-time checks all program points that cannot be proved memory safe by the type system. Second, we use BLAST to remove as many of the run-time checks as possible (by proving that these checks never fail), and to generate for the remaining run-time checks execution traces that witness them fail. Our experience shows that BLAST can remove many of the run-time checks added by Ccured and provide useful information to the programmer about many of the remaining checks.","lang":"eng"}],"author":[{"last_name":"Beyer","first_name":"Dirk","full_name":"Beyer, Dirk"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Jhala, Ranjit","first_name":"Ranjit","last_name":"Jhala"},{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar S"}],"alternative_title":["LNCS"],"quality_controlled":0,"extern":1,"date_updated":"2021-01-12T07:59:51Z","citation":{"apa":"Beyer, D., Henzinger, T. A., Jhala, R., &#38; Majumdar, R. (2005). Checking memory safety with BLAST (Vol. 3442, pp. 2–18). Presented at the FASE: Fundamental Approaches To Software Engineering, Springer. <a href=\"https://doi.org/10.1007/978-3-540-31984-9_2\">https://doi.org/10.1007/978-3-540-31984-9_2</a>","chicago":"Beyer, Dirk, Thomas A Henzinger, Ranjit Jhala, and Ritankar Majumdar. “Checking Memory Safety with BLAST,” 3442:2–18. Springer, 2005. <a href=\"https://doi.org/10.1007/978-3-540-31984-9_2\">https://doi.org/10.1007/978-3-540-31984-9_2</a>.","ista":"Beyer D, Henzinger TA, Jhala R, Majumdar R. 2005. Checking memory safety with BLAST. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 3442, 2–18.","ama":"Beyer D, Henzinger TA, Jhala R, Majumdar R. Checking memory safety with BLAST. In: Vol 3442. Springer; 2005:2-18. doi:<a href=\"https://doi.org/10.1007/978-3-540-31984-9_2\">10.1007/978-3-540-31984-9_2</a>","ieee":"D. Beyer, T. A. Henzinger, R. Jhala, and R. Majumdar, “Checking memory safety with BLAST,” presented at the FASE: Fundamental Approaches To Software Engineering, 2005, vol. 3442, pp. 2–18.","mla":"Beyer, Dirk, et al. <i>Checking Memory Safety with BLAST</i>. Vol. 3442, Springer, 2005, pp. 2–18, doi:<a href=\"https://doi.org/10.1007/978-3-540-31984-9_2\">10.1007/978-3-540-31984-9_2</a>.","short":"D. Beyer, T.A. Henzinger, R. Jhala, R. Majumdar, in:, Springer, 2005, pp. 2–18."},"conference":{"name":"FASE: Fundamental Approaches To Software Engineering"},"publist_id":"131","intvolume":"      3442","acknowledgement":"This research was supported in part by the NSF grants CCR-0234690, CCR-0225610, and ITR-0326577.","day":"24","page":"2 - 18","year":"2005","status":"public","doi":"10.1007/978-3-540-31984-9_2","date_created":"2018-12-11T12:09:34Z","_id":"4579","type":"conference"},{"year":"2005","status":"public","day":"15","page":"83 - 104","doi":"10.1007/1-4020-3532-2_3","date_created":"2018-12-11T12:09:49Z","type":"conference","_id":"4624","conference":{"name":"Engineering Theories of Software Intensive Systems"},"publist_id":"85","intvolume":"       195","author":[{"full_name":"de Alfaro, Luca","last_name":"De Alfaro","first_name":"Luca"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger"}],"alternative_title":["NATO Science Series: Mathematics, Physics, and Chemistry"],"quality_controlled":0,"extern":1,"date_updated":"2021-01-12T08:00:36Z","citation":{"short":"L. De Alfaro, T.A. Henzinger, in:, Springer, 2005, pp. 83–104.","mla":"De Alfaro, Luca, and Thomas A. Henzinger. <i>Interface-Based Design</i>. Vol. 195, Springer, 2005, pp. 83–104, doi:<a href=\"https://doi.org/10.1007/1-4020-3532-2_3\">10.1007/1-4020-3532-2_3</a>.","ieee":"L. De Alfaro and T. A. Henzinger, “Interface-based design,” presented at the Engineering Theories of Software Intensive Systems, 2005, vol. 195, pp. 83–104.","ama":"De Alfaro L, Henzinger TA. Interface-based design. In: Vol 195. Springer; 2005:83-104. doi:<a href=\"https://doi.org/10.1007/1-4020-3532-2_3\">10.1007/1-4020-3532-2_3</a>","chicago":"De Alfaro, Luca, and Thomas A Henzinger. “Interface-Based Design,” 195:83–104. Springer, 2005. <a href=\"https://doi.org/10.1007/1-4020-3532-2_3\">https://doi.org/10.1007/1-4020-3532-2_3</a>.","ista":"De Alfaro L, Henzinger TA. 2005. Interface-based design. Engineering Theories of Software Intensive Systems, NATO Science Series: Mathematics, Physics, and Chemistry, vol. 195, 83–104.","apa":"De Alfaro, L., &#38; Henzinger, T. A. (2005). Interface-based design (Vol. 195, pp. 83–104). Presented at the Engineering Theories of Software Intensive Systems, Springer. <a href=\"https://doi.org/10.1007/1-4020-3532-2_3\">https://doi.org/10.1007/1-4020-3532-2_3</a>"},"date_published":"2005-07-15T00:00:00Z","publisher":"Springer","volume":195,"title":"Interface-based design","publication_status":"published","month":"07","abstract":[{"text":"Surveying results from [5] and [6], we motivate and introduce the theory behind formalizing rich interfaces for software and hardware components. Rich interfaces specify the protocol aspects of component interaction. Their formalization, called interface automata, permits a compiler to check the compatibility of component interaction protocols. Interface automata support incremental design and independent implementability. Incremental design means that the compatibility checking of interfaces can proceed for partial system descriptions, without knowing the interfaces of all components. Independent implementability means that compatible interfaces can be refined separately, while still maintaining compatibility.","lang":"eng"}]},{"citation":{"short":"L. De Alfaro, M. Faella, T.A. Henzinger, R. Majumdar, M. Stoelinga, Theoretical Computer Science 345 (2005) 139–170.","mla":"De Alfaro, Luca, et al. “Model Checking Discounted Temporal Properties.” <i>Theoretical Computer Science</i>, vol. 345, no. 1, Elsevier, 2005, pp. 139–70, doi:<a href=\"https://doi.org/10.1016/j.tcs.2005.07.033\">10.1016/j.tcs.2005.07.033</a>.","ieee":"L. De Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga, “Model checking discounted temporal properties,” <i>Theoretical Computer Science</i>, vol. 345, no. 1. Elsevier, pp. 139–170, 2005.","ista":"De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. 2005. Model checking discounted temporal properties. Theoretical Computer Science. 345(1), 139–170.","ama":"De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. Model checking discounted temporal properties. <i>Theoretical Computer Science</i>. 2005;345(1):139-170. doi:<a href=\"https://doi.org/10.1016/j.tcs.2005.07.033\">10.1016/j.tcs.2005.07.033</a>","chicago":"De Alfaro, Luca, Marco Faella, Thomas A Henzinger, Ritankar Majumdar, and Mariëlle Stoelinga. “Model Checking Discounted Temporal Properties.” <i>Theoretical Computer Science</i>. Elsevier, 2005. <a href=\"https://doi.org/10.1016/j.tcs.2005.07.033\">https://doi.org/10.1016/j.tcs.2005.07.033</a>.","apa":"De Alfaro, L., Faella, M., Henzinger, T. A., Majumdar, R., &#38; Stoelinga, M. (2005). Model checking discounted temporal properties. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2005.07.033\">https://doi.org/10.1016/j.tcs.2005.07.033</a>"},"date_updated":"2021-01-12T08:00:37Z","extern":1,"quality_controlled":0,"author":[{"full_name":"de Alfaro, Luca","first_name":"Luca","last_name":"De Alfaro"},{"last_name":"Faella","first_name":"Marco","full_name":"Faella, Marco"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger"},{"first_name":"Ritankar","last_name":"Majumdar","full_name":"Majumdar, Ritankar S"},{"full_name":"Stoelinga, Mariëlle","first_name":"Mariëlle","last_name":"Stoelinga"}],"issue":"1","abstract":[{"text":"Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, temporal logic is therefore fragile: even small changes in the model can lead to opposite truth values for a specification. We present a generalization of the branching-time logic CTL which achieves robustness with respect to model perturbations by giving a quantitative interpretation to predicates and logical operators, and by discounting the importance of events according to how late they occur. In every state, the value of a formula is a real number in the interval [0,1], where 1 corresponds to truth and 0 to falsehood. The boolean operators and and or are replaced by min and max, the path quantifiers ∃ and ∀ determine sup and inf over all paths from a given state, and the temporal operators ⋄ and □ specify sup and inf over a given path; a new operator averages all values along a path. Furthermore, all path operators are discounted by a parameter that can be chosen to give more weight to states that are closer to the beginning of the path.\n\nWe interpret the resulting logic DCTL over transition systems, Markov chains, and Markov decision processes. We present two semantics for DCTL: a path semantics, inspired by the standard interpretation of state and path formulas in CTL, and a fixpoint semantics, inspired by the μ-calculus evaluation of CTL formulas. We show that, while these semantics coincide for CTL, they differ for DCTL, and we provide model-checking algorithms for both semantics.","lang":"eng"}],"month":"11","publication_status":"published","volume":345,"title":"Model checking discounted temporal properties","publisher":"Elsevier","date_published":"2005-11-21T00:00:00Z","_id":"4625","type":"journal_article","date_created":"2018-12-11T12:09:49Z","year":"2005","status":"public","day":"21","doi":"10.1016/j.tcs.2005.07.033","page":"139 - 170","publication":"Theoretical Computer Science","intvolume":"       345","publist_id":"80"},{"publisher":"IEEE","date_published":"2005-01-01T00:00:00Z","volume":1,"title":"Counterfactual quantum computation","abstract":[{"text":"We present the first demonstration of Jozsa's &quot;counterfactual computation&quot;, using an optical Grover's search algorithm. We put the algorithm in a superposition of 'running' and 'not-running', obtaining information even though the algorithm does not run.","lang":"eng"}],"month":"01","publication_status":"published","author":[{"full_name":"Onur Hosten","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2031-204X","first_name":"Onur","last_name":"Hosten"},{"first_name":"Matthew","last_name":"Rakher","full_name":"Rakher, Matthew T"},{"full_name":"Barreiro, Julio T","last_name":"Barreiro","first_name":"Julio"},{"last_name":"Peters","first_name":"Nicholas","full_name":"Peters, Nicholas A"},{"full_name":"Kwiat, Paul G","first_name":"Paul","last_name":"Kwiat"}],"alternative_title":["QELS"],"date_updated":"2021-01-12T08:03:18Z","quality_controlled":0,"extern":1,"citation":{"mla":"Hosten, Onur, et al. <i>Counterfactual Quantum Computation</i>. Vol. 1, IEEE, 2005, pp. 365–67, doi:<a href=\"https://doi.org/ 10.1109/QELS.2005.1548783\"> 10.1109/QELS.2005.1548783</a>.","short":"O. Hosten, M. Rakher, J. Barreiro, N. Peters, P. Kwiat, in:, IEEE, 2005, pp. 365–367.","ama":"Hosten O, Rakher M, Barreiro J, Peters N, Kwiat P. Counterfactual quantum computation. In: Vol 1. IEEE; 2005:365-367. doi:<a href=\"https://doi.org/ 10.1109/QELS.2005.1548783\"> 10.1109/QELS.2005.1548783</a>","chicago":"Hosten, Onur, Matthew Rakher, Julio Barreiro, Nicholas Peters, and Paul Kwiat. “Counterfactual Quantum Computation,” 1:365–67. IEEE, 2005. <a href=\"https://doi.org/ 10.1109/QELS.2005.1548783\">https://doi.org/ 10.1109/QELS.2005.1548783</a>.","ista":"Hosten O, Rakher M, Barreiro J, Peters N, Kwiat P. 2005. Counterfactual quantum computation. QELS: Quantum Electronics and Laser Science, QELS, vol. 1, 365–367.","apa":"Hosten, O., Rakher, M., Barreiro, J., Peters, N., &#38; Kwiat, P. (2005). Counterfactual quantum computation (Vol. 1, pp. 365–367). Presented at the QELS: Quantum Electronics and Laser Science, IEEE. <a href=\"https://doi.org/ 10.1109/QELS.2005.1548783\">https://doi.org/ 10.1109/QELS.2005.1548783</a>","ieee":"O. Hosten, M. Rakher, J. Barreiro, N. Peters, and P. Kwiat, “Counterfactual quantum computation,” presented at the QELS: Quantum Electronics and Laser Science, 2005, vol. 1, pp. 365–367."},"intvolume":"         1","conference":{"name":"QELS: Quantum Electronics and Laser Science"},"publist_id":"7237","year":"2005","status":"public","day":"01","page":"365 - 367","doi":" 10.1109/QELS.2005.1548783","date_created":"2018-12-11T11:47:16Z","type":"conference","_id":"575"},{"publication_status":"published","month":"07","abstract":[{"lang":"eng","text":"A current challenge in neuroscience is to bridge the gaps between genes, proteins, neurons, neural circuits, and behavior in a single animal model. The nematode Caenorhabditis elegans has unique features that facilitate this synthesis. Its nervous system includes exactly 302 neurons, and their pattern of synaptic connectivity is known. With only five olfactory neurons, C. elegans can dynamically respond to dozens of attractive and repellant odors. Thermosensory neurons enable the nematode to remember its cultivation temperature and to track narrow isotherms. Polymodal sensory neurons detect a wide range of nociceptive cues and signal robust escape responses. Pairing of sensory stimuli leads to long-lived changes in behavior consistent with associative learning. Worms exhibit social behaviors and complex ultradian rhythms driven by Ca2+ oscillators with clock-like properties. Genetic analysis has identified gene products required for nervous system function and elucidated the molecular and neural bases of behaviors."}],"pmid":1,"language":[{"iso":"eng"}],"publisher":"Annual Reviews","date_published":"2005-07-21T00:00:00Z","title":"Neuronal substrates of complex behaviors in C. elegans","volume":28,"article_processing_charge":"No","quality_controlled":"1","extern":"1","date_updated":"2021-01-12T08:06:24Z","citation":{"short":"M. de Bono, A. Villu Maricq, Annual Review of Neuroscience 28 (2005) 451–501.","mla":"de Bono, Mario, and Andres Villu Maricq. “Neuronal Substrates of Complex Behaviors in C. Elegans.” <i>Annual Review of Neuroscience</i>, vol. 28, Annual Reviews, 2005, pp. 451–501, doi:<a href=\"https://doi.org/10.1146/annurev.neuro.27.070203.144259\">10.1146/annurev.neuro.27.070203.144259</a>.","ieee":"M. de Bono and A. Villu Maricq, “Neuronal substrates of complex behaviors in C. elegans,” <i>Annual Review of Neuroscience</i>, vol. 28. Annual Reviews, pp. 451–501, 2005.","ista":"de Bono M, Villu Maricq A. 2005. Neuronal substrates of complex behaviors in C. elegans. Annual Review of Neuroscience. 28, 451–501.","ama":"de Bono M, Villu Maricq A. Neuronal substrates of complex behaviors in C. elegans. <i>Annual Review of Neuroscience</i>. 2005;28:451-501. doi:<a href=\"https://doi.org/10.1146/annurev.neuro.27.070203.144259\">10.1146/annurev.neuro.27.070203.144259</a>","chicago":"Bono, Mario de, and Andres Villu Maricq. “Neuronal Substrates of Complex Behaviors in C. Elegans.” <i>Annual Review of Neuroscience</i>. Annual Reviews, 2005. <a href=\"https://doi.org/10.1146/annurev.neuro.27.070203.144259\">https://doi.org/10.1146/annurev.neuro.27.070203.144259</a>.","apa":"de Bono, M., &#38; Villu Maricq, A. (2005). Neuronal substrates of complex behaviors in C. elegans. <i>Annual Review of Neuroscience</i>. Annual Reviews. <a href=\"https://doi.org/10.1146/annurev.neuro.27.070203.144259\">https://doi.org/10.1146/annurev.neuro.27.070203.144259</a>"},"oa_version":"None","author":[{"id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","full_name":"de Bono, Mario","first_name":"Mario","last_name":"de Bono","orcid":"0000-0001-8347-0443"},{"last_name":"Villu Maricq","first_name":"Andres","full_name":"Villu Maricq, Andres"}],"external_id":{"pmid":["16022603"]},"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","intvolume":"        28","publication":"Annual Review of Neuroscience","date_created":"2019-03-21T09:31:29Z","article_type":"original","type":"journal_article","_id":"6153","status":"public","year":"2005","day":"21","page":"451-501","publication_identifier":{"issn":["0147-006X","1545-4126"]},"doi":"10.1146/annurev.neuro.27.070203.144259"},{"oa_version":"None","citation":{"ieee":"B. H. H. Cheung, M. Cohen, C. Rogers, O. Albayram, and M. de Bono, “Experience-dependent modulation of C. elegans behavior by ambient oxygen,” <i>Current Biology</i>, vol. 15, no. 10. Elsevier, pp. 905–917, 2005.","apa":"Cheung, B. H. H., Cohen, M., Rogers, C., Albayram, O., &#38; de Bono, M. (2005). Experience-dependent modulation of C. elegans behavior by ambient oxygen. <i>Current Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cub.2005.04.017\">https://doi.org/10.1016/j.cub.2005.04.017</a>","ama":"Cheung BHH, Cohen M, Rogers C, Albayram O, de Bono M. Experience-dependent modulation of C. elegans behavior by ambient oxygen. <i>Current Biology</i>. 2005;15(10):905-917. doi:<a href=\"https://doi.org/10.1016/j.cub.2005.04.017\">10.1016/j.cub.2005.04.017</a>","ista":"Cheung BHH, Cohen M, Rogers C, Albayram O, de Bono M. 2005. Experience-dependent modulation of C. elegans behavior by ambient oxygen. Current Biology. 15(10), 905–917.","chicago":"Cheung, Benny H.H., Merav Cohen, Candida Rogers, Onder Albayram, and Mario de Bono. “Experience-Dependent Modulation of C. Elegans Behavior by Ambient Oxygen.” <i>Current Biology</i>. Elsevier, 2005. <a href=\"https://doi.org/10.1016/j.cub.2005.04.017\">https://doi.org/10.1016/j.cub.2005.04.017</a>.","short":"B.H.H. Cheung, M. Cohen, C. Rogers, O. Albayram, M. de Bono, Current Biology 15 (2005) 905–917.","mla":"Cheung, Benny H. H., et al. “Experience-Dependent Modulation of C. Elegans Behavior by Ambient Oxygen.” <i>Current Biology</i>, vol. 15, no. 10, Elsevier, 2005, pp. 905–17, doi:<a href=\"https://doi.org/10.1016/j.cub.2005.04.017\">10.1016/j.cub.2005.04.017</a>."},"date_updated":"2021-01-12T08:06:24Z","extern":"1","quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["15916947"]},"author":[{"last_name":"Cheung","first_name":"Benny H.H.","full_name":"Cheung, Benny H.H."},{"last_name":"Cohen","first_name":"Merav","full_name":"Cohen, Merav"},{"full_name":"Rogers, Candida","first_name":"Candida","last_name":"Rogers"},{"full_name":"Albayram, Onder","last_name":"Albayram","first_name":"Onder"},{"id":"4E3FF80E-F248-11E8-B48F-1D18A9856A87","full_name":"de Bono, Mario","first_name":"Mario","last_name":"de Bono","orcid":"0000-0001-8347-0443"}],"issue":"10","month":"05","publication_status":"published","volume":15,"title":"Experience-dependent modulation of C. elegans behavior by ambient oxygen","publisher":"Elsevier","language":[{"iso":"eng"}],"date_published":"2005-05-24T00:00:00Z","pmid":1,"type":"journal_article","_id":"6154","date_created":"2019-03-21T09:37:48Z","status":"public","year":"2005","day":"24","page":"905-917","doi":"10.1016/j.cub.2005.04.017","publication_identifier":{"issn":["0960-9822"]},"publication":"Current Biology","intvolume":"        15"},{"publication":"Geometric Methods in Algebra and Number Theory","publist_id":"5752","intvolume":"       235","type":"book_chapter","_id":"1444","date_created":"2018-12-11T11:52:03Z","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/math/0406380","open_access":"1"}],"page":"193 - 217","year":"2005","doi":"10.1007/0-8176-4417-2_9","status":"public","day":"01","month":"01","publication_status":"published","abstract":[{"text":"The paper surveys the mirror symmetry conjectures of Hausel-Thaddeus and Hausel-Rodriguez-Villegas concerning the equality of certain Hodge numbers of SL(n, ℂ) vs. PGL(n, ℂ) flat connections and character varieties for curves, respectively. Several new results and conjectures and their relations to works of Hitchin, Gothen, Garsia-Haiman and Earl-Kirwan are explained. These use the representation theory of finite groups of Lie-type via the arithmetic of character varieties and lead to an unexpected conjecture for a Hard Lefschetz theorem for their cohomology.","lang":"eng"}],"title":"Mirror symmetry and Langlands duality in the non-Abelian Hodge theory of a curve","volume":235,"publisher":"Springer","date_published":"2005-01-01T00:00:00Z","citation":{"mla":"Hausel, Tamás. “Mirror Symmetry and Langlands Duality in the Non-Abelian Hodge Theory of a Curve.” <i>Geometric Methods in Algebra and Number Theory</i>, vol. 235, Springer, 2005, pp. 193–217, doi:<a href=\"https://doi.org/10.1007/0-8176-4417-2_9\">10.1007/0-8176-4417-2_9</a>.","short":"T. Hausel, in:, Geometric Methods in Algebra and Number Theory, Springer, 2005, pp. 193–217.","apa":"Hausel, T. (2005). Mirror symmetry and Langlands duality in the non-Abelian Hodge theory of a curve. In <i>Geometric Methods in Algebra and Number Theory</i> (Vol. 235, pp. 193–217). Springer. <a href=\"https://doi.org/10.1007/0-8176-4417-2_9\">https://doi.org/10.1007/0-8176-4417-2_9</a>","ama":"Hausel T. Mirror symmetry and Langlands duality in the non-Abelian Hodge theory of a curve. In: <i>Geometric Methods in Algebra and Number Theory</i>. Vol 235. Springer; 2005:193-217. doi:<a href=\"https://doi.org/10.1007/0-8176-4417-2_9\">10.1007/0-8176-4417-2_9</a>","chicago":"Hausel, Tamás. “Mirror Symmetry and Langlands Duality in the Non-Abelian Hodge Theory of a Curve.” In <i>Geometric Methods in Algebra and Number Theory</i>, 235:193–217. Springer, 2005. <a href=\"https://doi.org/10.1007/0-8176-4417-2_9\">https://doi.org/10.1007/0-8176-4417-2_9</a>.","ista":"Hausel T. 2005.Mirror symmetry and Langlands duality in the non-Abelian Hodge theory of a curve. In: Geometric Methods in Algebra and Number Theory. Progress in Mathematics, vol. 235, 193–217.","ieee":"T. Hausel, “Mirror symmetry and Langlands duality in the non-Abelian Hodge theory of a curve,” in <i>Geometric Methods in Algebra and Number Theory</i>, vol. 235, Springer, 2005, pp. 193–217."},"quality_controlled":0,"extern":1,"date_updated":"2021-01-12T06:50:47Z","alternative_title":["Progress in Mathematics"],"author":[{"full_name":"Tamas Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","last_name":"Hausel","first_name":"Tamas"}]},{"_id":"1447","type":"journal_article","date_created":"2018-12-11T11:52:05Z","oa":1,"status":"public","day":"01","year":"2005","page":"26 - 38","doi":"10.2478/BF02475653","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/math/0308146"}],"acknowledgement":"Financial support wa s provided by a Miller Research Fellowship at the University of California at Berkeley , and by NSF grants DMS- 0072675 and DMS-0305505.","publication":"Open Mathematics","intvolume":"         3","publist_id":"5749","citation":{"chicago":"Hausel, Tamás. “Quaternionic Geometry of Matroids.” <i>Open Mathematics</i>. Central European Science Journals, 2005. <a href=\"https://doi.org/10.2478/BF02475653\">https://doi.org/10.2478/BF02475653</a>.","ista":"Hausel T. 2005. Quaternionic geometry of matroids. Open Mathematics. 3(1), 26–38.","ama":"Hausel T. Quaternionic geometry of matroids. <i>Open Mathematics</i>. 2005;3(1):26-38. doi:<a href=\"https://doi.org/10.2478/BF02475653\">10.2478/BF02475653</a>","apa":"Hausel, T. (2005). Quaternionic geometry of matroids. <i>Open Mathematics</i>. Central European Science Journals. <a href=\"https://doi.org/10.2478/BF02475653\">https://doi.org/10.2478/BF02475653</a>","ieee":"T. Hausel, “Quaternionic geometry of matroids,” <i>Open Mathematics</i>, vol. 3, no. 1. Central European Science Journals, pp. 26–38, 2005.","short":"T. Hausel, Open Mathematics 3 (2005) 26–38.","mla":"Hausel, Tamás. “Quaternionic Geometry of Matroids.” <i>Open Mathematics</i>, vol. 3, no. 1, Central European Science Journals, 2005, pp. 26–38, doi:<a href=\"https://doi.org/10.2478/BF02475653\">10.2478/BF02475653</a>."},"date_updated":"2021-01-12T06:50:49Z","extern":1,"quality_controlled":0,"author":[{"last_name":"Hausel","first_name":"Tamas","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","full_name":"Tamas Hausel"}],"issue":"1","abstract":[{"text":"Building on a recent paper [8], here we argue that the combinatorics of matroids are intimately related to the geometry and topology of toric hyperkähler varieties. We show that just like toric varieties occupy a central role in Stanley’s proof for the necessity of McMullen’s conjecture (or g-inequalities) about the classification of face vectors of simplicial polytopes, the topology of toric hyperkähler varieties leads to new restrictions on face vectors of matroid complexes. Namely in this paper we will give two proofs that the injectivity part of the Hard Lefschetz theorem survives for toric hyperkähler varieties. We explain how this implies the g-inequalities for rationally representable matroids. We show how the geometrical intuition in the first proof, coupled with results of Chari [3], leads to a proof of the g-inequalities for general matroid complexes, which is a recent result of Swartz [20]. The geometrical idea in the second proof will show that a pure O-sequence should satisfy the g-inequalities, thus showing that our result is in fact a consequence of a long-standing conjecture of Stanley.","lang":"eng"}],"publication_status":"published","month":"03","volume":3,"title":"Quaternionic geometry of matroids","date_published":"2005-03-01T00:00:00Z","publisher":"Central European Science Journals"},{"publication_status":"published","month":"01","abstract":[{"lang":"eng","text":"We study an integration theory in circle equivariant cohomology in order to prove a theorem relating the cohomology ring of a hyperkähler quotient to the cohomology ring of the quotient by a maximal abelian subgroup, analogous to a theorem of Martin for symplectic quotients. We discuss applications of this theorem to quiver varieties, and compute as an example the ordinary and equivariant cohomology rings of a hyperpolygon space."}],"issue":"1","publisher":"Elsevier","date_published":"2005-01-01T00:00:00Z","volume":44,"title":"Abelianization for hyperkähler quotients","quality_controlled":0,"extern":1,"date_updated":"2021-01-12T06:50:55Z","citation":{"mla":"Hausel, Tamás, and Nicholas Proudfoot. “Abelianization for Hyperkähler Quotients.” <i>Topology</i>, vol. 44, no. 1, Elsevier, 2005, pp. 231–48, doi:<a href=\"https://doi.org/10.1016/j.top.2004.04.002\">10.1016/j.top.2004.04.002</a>.","short":"T. Hausel, N. Proudfoot, Topology 44 (2005) 231–248.","ieee":"T. Hausel and N. Proudfoot, “Abelianization for hyperkähler quotients,” <i>Topology</i>, vol. 44, no. 1. Elsevier, pp. 231–248, 2005.","ama":"Hausel T, Proudfoot N. Abelianization for hyperkähler quotients. <i>Topology</i>. 2005;44(1):231-248. doi:<a href=\"https://doi.org/10.1016/j.top.2004.04.002\">10.1016/j.top.2004.04.002</a>","ista":"Hausel T, Proudfoot N. 2005. Abelianization for hyperkähler quotients. Topology. 44(1), 231–248.","chicago":"Hausel, Tamás, and Nicholas Proudfoot. “Abelianization for Hyperkähler Quotients.” <i>Topology</i>. Elsevier, 2005. <a href=\"https://doi.org/10.1016/j.top.2004.04.002\">https://doi.org/10.1016/j.top.2004.04.002</a>.","apa":"Hausel, T., &#38; Proudfoot, N. (2005). Abelianization for hyperkähler quotients. <i>Topology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.top.2004.04.002\">https://doi.org/10.1016/j.top.2004.04.002</a>"},"author":[{"full_name":"Tamas Hausel","id":"4A0666D8-F248-11E8-B48F-1D18A9856A87","first_name":"Tamas","last_name":"Hausel"},{"first_name":"Nicholas","last_name":"Proudfoot","full_name":"Proudfoot, Nicholas J"}],"publist_id":"5735","intvolume":"        44","publication":"Topology","oa":1,"date_created":"2018-12-11T11:52:10Z","_id":"1463","type":"journal_article","acknowledgement":" Financial support was provided in part by NSF Grants DMS-0072675 and DMS-0305505.","page":"231 - 248","doi":"10.1016/j.top.2004.04.002","day":"01","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/math/0310141"}],"status":"public","year":"2005"},{"day":"24","page":"1361-1365","year":"2005","doi":"10.1002/adma.200402086","keyword":["Mechanical Engineering","Mechanics of Materials","General Materials Science"],"scopus_import":"1","intvolume":"        17","publication":"Advanced Materials","extern":"1","date_updated":"2023-08-08T11:53:16Z","citation":{"ieee":"S. K. Smoukov, K. J. M. Bishop, R. Klajn, C. J. Campbell, and B. A. Grzybowski, “Cutting into solids with micropatterned gels,” <i>Advanced Materials</i>, vol. 17, no. 11. Wiley, pp. 1361–1365, 2005.","ista":"Smoukov SK, Bishop KJM, Klajn R, Campbell CJ, Grzybowski BA. 2005. Cutting into solids with micropatterned gels. Advanced Materials. 17(11), 1361–1365.","chicago":"Smoukov, S. K., K. J. M. Bishop, Rafal Klajn, C. J. Campbell, and B. A. Grzybowski. “Cutting into Solids with Micropatterned Gels.” <i>Advanced Materials</i>. Wiley, 2005. <a href=\"https://doi.org/10.1002/adma.200402086\">https://doi.org/10.1002/adma.200402086</a>.","ama":"Smoukov SK, Bishop KJM, Klajn R, Campbell CJ, Grzybowski BA. Cutting into solids with micropatterned gels. <i>Advanced Materials</i>. 2005;17(11):1361-1365. doi:<a href=\"https://doi.org/10.1002/adma.200402086\">10.1002/adma.200402086</a>","apa":"Smoukov, S. K., Bishop, K. J. M., Klajn, R., Campbell, C. J., &#38; Grzybowski, B. A. (2005). Cutting into solids with micropatterned gels. <i>Advanced Materials</i>. Wiley. <a href=\"https://doi.org/10.1002/adma.200402086\">https://doi.org/10.1002/adma.200402086</a>","short":"S.K. Smoukov, K.J.M. Bishop, R. Klajn, C.J. Campbell, B.A. Grzybowski, Advanced Materials 17 (2005) 1361–1365.","mla":"Smoukov, S. K., et al. “Cutting into Solids with Micropatterned Gels.” <i>Advanced Materials</i>, vol. 17, no. 11, Wiley, 2005, pp. 1361–65, doi:<a href=\"https://doi.org/10.1002/adma.200402086\">10.1002/adma.200402086</a>."},"external_id":{"pmid":["34412440"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"text":"Hydrogel stamps can microstructure solid surfaces, i.e., modify the surface topology of metals, glasses, and crystals. It is demonstrated that stamps soaked in an appropriate etchant can remove material with micrometer-scale precision. The Figure shows an array of concentric circles etched in glass using the immersion wet stamping process described (scale bar: 500 μm).","lang":"eng"}],"pmid":1,"date_published":"2005-06-24T00:00:00Z","publisher":"Wiley","title":"Cutting into solids with micropatterned gels","date_created":"2023-08-01T10:38:01Z","article_type":"original","type":"journal_article","_id":"13431","publication_identifier":{"eissn":["1521-4095"],"issn":["0935-9648"]},"status":"public","quality_controlled":"1","oa_version":"None","author":[{"full_name":"Smoukov, S. K.","last_name":"Smoukov","first_name":"S. K."},{"full_name":"Bishop, K. J. M.","last_name":"Bishop","first_name":"K. J. M."},{"id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b","full_name":"Klajn, Rafal","last_name":"Klajn","first_name":"Rafal"},{"last_name":"Campbell","first_name":"C. J.","full_name":"Campbell, C. J."},{"last_name":"Grzybowski","first_name":"B. A.","full_name":"Grzybowski, B. A."}],"month":"06","issue":"11","language":[{"iso":"eng"}],"volume":17,"article_processing_charge":"No"},{"citation":{"chicago":"Campbell, Christopher J., Rafal Klajn, Marcin Fialkowski, and Bartosz A. Grzybowski. “One-Step Multilevel Microfabrication by Reaction−diffusion.” <i>Langmuir</i>. American Chemical Society, 2005. <a href=\"https://doi.org/10.1021/la0487747\">https://doi.org/10.1021/la0487747</a>.","ama":"Campbell CJ, Klajn R, Fialkowski M, Grzybowski BA. One-step multilevel microfabrication by reaction−diffusion. <i>Langmuir</i>. 2005;21(1):418-423. doi:<a href=\"https://doi.org/10.1021/la0487747\">10.1021/la0487747</a>","ista":"Campbell CJ, Klajn R, Fialkowski M, Grzybowski BA. 2005. One-step multilevel microfabrication by reaction−diffusion. Langmuir. 21(1), 418–423.","apa":"Campbell, C. J., Klajn, R., Fialkowski, M., &#38; Grzybowski, B. A. (2005). One-step multilevel microfabrication by reaction−diffusion. <i>Langmuir</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/la0487747\">https://doi.org/10.1021/la0487747</a>","ieee":"C. J. Campbell, R. Klajn, M. Fialkowski, and B. A. Grzybowski, “One-step multilevel microfabrication by reaction−diffusion,” <i>Langmuir</i>, vol. 21, no. 1. American Chemical Society, pp. 418–423, 2005.","short":"C.J. Campbell, R. Klajn, M. Fialkowski, B.A. Grzybowski, Langmuir 21 (2005) 418–423.","mla":"Campbell, Christopher J., et al. “One-Step Multilevel Microfabrication by Reaction−diffusion.” <i>Langmuir</i>, vol. 21, no. 1, American Chemical Society, 2005, pp. 418–23, doi:<a href=\"https://doi.org/10.1021/la0487747\">10.1021/la0487747</a>."},"date_updated":"2023-08-08T12:15:48Z","extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["15620333"]},"abstract":[{"text":"A new experimental technique is described that uses reaction−diffusion phenomena as a means of one-step microfabrication of complex, multilevel surface reliefs. Thin films of dry gelatin doped with potassium hexacyanoferrate are chemically micropatterned with a solution of silver nitrate delivered from an agarose stamp. Precipitation reaction between the two salts causes the surface to deform. The mechanism of surface deformation is shown to involve a sequence of reactions, diffusion, and gel swelling/contraction. This mechanism is established experimentally and provides a basis of a theoretical lattice-gas model that allows prediction surface topographies emerging from arbitrary geometries of the stamped features. The usefulness of the technique is demonstrated by using it to rapidly prepare two types of mold for passive microfluidic mixers.","lang":"eng"}],"publication_status":"published","title":"One-step multilevel microfabrication by reaction−diffusion","publisher":"American Chemical Society","date_published":"2005-01-21T00:00:00Z","pmid":1,"page":"418-423","day":"21","year":"2005","doi":"10.1021/la0487747","scopus_import":"1","keyword":["Electrochemistry","Spectroscopy","Surfaces and Interfaces","Condensed Matter Physics","General Materials Science"],"publication":"Langmuir","intvolume":"        21","oa_version":"None","quality_controlled":"1","author":[{"full_name":"Campbell, Christopher J.","last_name":"Campbell","first_name":"Christopher J."},{"first_name":"Rafal","last_name":"Klajn","full_name":"Klajn, Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b"},{"full_name":"Fialkowski, Marcin","first_name":"Marcin","last_name":"Fialkowski"},{"last_name":"Grzybowski","first_name":"Bartosz A.","full_name":"Grzybowski, Bartosz A."}],"issue":"1","month":"01","article_processing_charge":"No","volume":21,"language":[{"iso":"eng"}],"type":"journal_article","_id":"13432","article_type":"original","date_created":"2023-08-01T10:38:29Z","status":"public","publication_identifier":{"issn":["0743-7463"],"eissn":["1520-5827"]}},{"date_created":"2023-08-01T10:38:58Z","type":"journal_article","_id":"13433","article_type":"original","publication_identifier":{"eissn":["1875-5348"],"issn":["1385-2728"]},"status":"public","month":"12","issue":"18","language":[{"iso":"eng"}],"article_processing_charge":"No","volume":8,"quality_controlled":"1","oa_version":"None","author":[{"full_name":"Witt, Dariusz","last_name":"Witt","first_name":"Dariusz"},{"first_name":"Rafal","last_name":"Klajn","full_name":"Klajn, Rafal","id":"8e84690e-1e48-11ed-a02b-a1e6fb8bb53b"},{"first_name":"Piotr","last_name":"Barski","full_name":"Barski, Piotr"},{"full_name":"Grzybowski, Bartosz","first_name":"Bartosz","last_name":"Grzybowski"}],"keyword":["Organic Chemistry"],"scopus_import":"1","intvolume":"         8","publication":"Current Organic Chemistry","doi":"10.2174/1385272043369421","day":"01","year":"2005","page":"1763-1797","abstract":[{"text":"Self-assembled monolayers (SAMs) of alkane thiols on gold and other metals are versatile constructs with which to study interfacial phenomena and reactions at surfaces. Surface properties of SAMs - e.g., wettability, stability in diverse environments, propensity to interact with or to resist adsorption of macromolecules -- depend on and can be controlled flexibly by the properties of the functional (head) groups in the w position of the alkyl chain. SAMs provide a basis for many important scientific and technological applications, ranging from micropatterning methods, through sensing, to biological recognition. Despite their importance, the literature on SAMs and the synthesis of molecules that constitute them remains scattered and often conflicting. The purpose of this Review is (i) to summarize the applications and physical properties of SAMs and (ii) to systematize the strategies of synthesis of ω-functionalized alkane thiols. Generic retrosynthetic scheme is developed that allows efficient synthetic planning. Issues related to the selection of appropriate protecting groups and the ways of introduction of the thiol functionality are discussed in detail, and illustrated with examples of syntheses of several complex alkane thiols.","lang":"eng"}],"publication_status":"published","publisher":"Bentham Science","date_published":"2005-12-01T00:00:00Z","title":"Applications, properties and synthesis of w-functionalized n-alkanethiols and disulfides - the building blocks of self-assembled monolayers","date_updated":"2023-08-08T12:39:52Z","extern":"1","citation":{"mla":"Witt, Dariusz, et al. “Applications, Properties and Synthesis of w-Functionalized n-Alkanethiols and Disulfides - the Building Blocks of Self-Assembled Monolayers.” <i>Current Organic Chemistry</i>, vol. 8, no. 18, Bentham Science, 2005, pp. 1763–97, doi:<a href=\"https://doi.org/10.2174/1385272043369421\">10.2174/1385272043369421</a>.","short":"D. Witt, R. Klajn, P. Barski, B. Grzybowski, Current Organic Chemistry 8 (2005) 1763–1797.","ama":"Witt D, Klajn R, Barski P, Grzybowski B. Applications, properties and synthesis of w-functionalized n-alkanethiols and disulfides - the building blocks of self-assembled monolayers. <i>Current Organic Chemistry</i>. 2005;8(18):1763-1797. doi:<a href=\"https://doi.org/10.2174/1385272043369421\">10.2174/1385272043369421</a>","ista":"Witt D, Klajn R, Barski P, Grzybowski B. 2005. Applications, properties and synthesis of w-functionalized n-alkanethiols and disulfides - the building blocks of self-assembled monolayers. Current Organic Chemistry. 8(18), 1763–1797.","chicago":"Witt, Dariusz, Rafal Klajn, Piotr Barski, and Bartosz Grzybowski. “Applications, Properties and Synthesis of w-Functionalized n-Alkanethiols and Disulfides - the Building Blocks of Self-Assembled Monolayers.” <i>Current Organic Chemistry</i>. Bentham Science, 2005. <a href=\"https://doi.org/10.2174/1385272043369421\">https://doi.org/10.2174/1385272043369421</a>.","apa":"Witt, D., Klajn, R., Barski, P., &#38; Grzybowski, B. (2005). Applications, properties and synthesis of w-functionalized n-alkanethiols and disulfides - the building blocks of self-assembled monolayers. <i>Current Organic Chemistry</i>. Bentham Science. <a href=\"https://doi.org/10.2174/1385272043369421\">https://doi.org/10.2174/1385272043369421</a>","ieee":"D. Witt, R. Klajn, P. Barski, and B. Grzybowski, “Applications, properties and synthesis of w-functionalized n-alkanethiols and disulfides - the building blocks of self-assembled monolayers,” <i>Current Organic Chemistry</i>, vol. 8, no. 18. Bentham Science, pp. 1763–1797, 2005."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"day":"26","page":"154-159","doi":"10.1016/j.cub.2005.01.008","year":"2005","oa":1,"publication":"Current Biology","intvolume":"        15","scopus_import":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","external_id":{"pmid":["15668172 "]},"citation":{"short":"R.K. Tran, J.G. Henikoff, D. Zilberman, R.F. Ditt, S.E. Jacobsen, S. Henikoff, Current Biology 15 (2005) 154–159.","mla":"Tran, Robert K., et al. “DNA Methylation Profiling Identifies CG Methylation Clusters in Arabidopsis Genes.” <i>Current Biology</i>, vol. 15, no. 2, Elsevier, 2005, pp. 154–59, doi:<a href=\"https://doi.org/10.1016/j.cub.2005.01.008\">10.1016/j.cub.2005.01.008</a>.","ieee":"R. K. Tran, J. G. Henikoff, D. Zilberman, R. F. Ditt, S. E. Jacobsen, and S. Henikoff, “DNA methylation profiling identifies CG methylation clusters in Arabidopsis genes,” <i>Current Biology</i>, vol. 15, no. 2. Elsevier, pp. 154–159, 2005.","apa":"Tran, R. K., Henikoff, J. G., Zilberman, D., Ditt, R. F., Jacobsen, S. E., &#38; Henikoff, S. (2005). DNA methylation profiling identifies CG methylation clusters in Arabidopsis genes. <i>Current Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cub.2005.01.008\">https://doi.org/10.1016/j.cub.2005.01.008</a>","chicago":"Tran, Robert K., Jorja G. Henikoff, Daniel Zilberman, Renata F. Ditt, Steven E. Jacobsen, and Steven Henikoff. “DNA Methylation Profiling Identifies CG Methylation Clusters in Arabidopsis Genes.” <i>Current Biology</i>. Elsevier, 2005. <a href=\"https://doi.org/10.1016/j.cub.2005.01.008\">https://doi.org/10.1016/j.cub.2005.01.008</a>.","ama":"Tran RK, Henikoff JG, Zilberman D, Ditt RF, Jacobsen SE, Henikoff S. DNA methylation profiling identifies CG methylation clusters in Arabidopsis genes. <i>Current Biology</i>. 2005;15(2):154-159. doi:<a href=\"https://doi.org/10.1016/j.cub.2005.01.008\">10.1016/j.cub.2005.01.008</a>","ista":"Tran RK, Henikoff JG, Zilberman D, Ditt RF, Jacobsen SE, Henikoff S. 2005. DNA methylation profiling identifies CG methylation clusters in Arabidopsis genes. Current Biology. 15(2), 154–159."},"date_updated":"2021-12-14T09:12:26Z","department":[{"_id":"DaZi"}],"extern":"1","title":"DNA methylation profiling identifies CG methylation clusters in Arabidopsis genes","date_published":"2005-01-26T00:00:00Z","publisher":"Elsevier","pmid":1,"abstract":[{"lang":"eng","text":"Cytosine DNA methylation in vertebrates is widespread, but methylation in plants is found almost exclusively at transposable elements and repetitive DNA [1]. Within regions of methylation, methylcytosines are typically found in CG, CNG, and asymmetric contexts. CG sites are maintained by a plant homolog of mammalian Dnmt1 acting on hemi-methylated DNA after replication. Methylation of CNG and asymmetric sites appears to be maintained at each cell cycle by other mechanisms. We report a new type of DNA methylation in Arabidopsis, dense CG methylation clusters found at scattered sites throughout the genome. These clusters lack non-CG methylation and are preferentially found in genes, although they are relatively deficient toward the 5′ end. CG methylation clusters are present in lines derived from different accessions and in mutants that eliminate de novo methylation, indicating that CG methylation clusters are stably maintained at specific sites. Because 5-methylcytosine is mutagenic, the appearance of CG methylation clusters over evolutionary time predicts a genome-wide deficiency of CG dinucleotides and an excess of C(A/T)G trinucleotides within transcribed regions. This is exactly what we find, implying that CG methylation clusters have contributed profoundly to plant gene evolution. We suggest that CG methylation clusters silence cryptic promoters that arise sporadically within transcription units."}],"publication_status":"published","publication_identifier":{"issn":["0960-9822"],"eissn":["1879-0445"]},"main_file_link":[{"url":"https://doi.org/10.1016/j.cub.2005.01.008","open_access":"1"}],"status":"public","_id":"9491","type":"journal_article","article_type":"original","date_created":"2021-06-07T10:24:30Z","author":[{"full_name":"Tran, Robert K.","first_name":"Robert K.","last_name":"Tran"},{"full_name":"Henikoff, Jorja G.","last_name":"Henikoff","first_name":"Jorja G."},{"last_name":"Zilberman","first_name":"Daniel","orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","full_name":"Zilberman, Daniel"},{"first_name":"Renata F.","last_name":"Ditt","full_name":"Ditt, Renata F."},{"full_name":"Jacobsen, Steven E.","first_name":"Steven E.","last_name":"Jacobsen"},{"first_name":"Steven","last_name":"Henikoff","full_name":"Henikoff, Steven"}],"oa_version":"Published Version","quality_controlled":"1","article_processing_charge":"No","volume":15,"language":[{"iso":"eng"}],"issue":"2","month":"01"},{"article_type":"original","type":"journal_article","_id":"9514","date_created":"2021-06-07T13:12:41Z","publication_identifier":{"issn":["1474-760X"],"eissn":["1465-6906"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1186/gb-2005-6-11-r90"}],"status":"public","article_number":"R90","issue":"11","month":"10","volume":6,"article_processing_charge":"No","language":[{"iso":"eng"}],"oa_version":"Published Version","quality_controlled":"1","author":[{"full_name":"Tran, Robert K.","last_name":"Tran","first_name":"Robert K."},{"full_name":"Zilberman, Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","orcid":"0000-0002-0123-8649","last_name":"Zilberman","first_name":"Daniel"},{"full_name":"de Bustos, Cecilia","last_name":"de Bustos","first_name":"Cecilia"},{"first_name":"Renata F.","last_name":"Ditt","full_name":"Ditt, Renata F."},{"full_name":"Henikoff, Jorja G.","last_name":"Henikoff","first_name":"Jorja G."},{"last_name":"Lindroth","first_name":"Anders M.","full_name":"Lindroth, Anders M."},{"full_name":"Delrow, Jeffrey","last_name":"Delrow","first_name":"Jeffrey"},{"full_name":"Boyle, Tom","first_name":"Tom","last_name":"Boyle"},{"full_name":"Kwong, Samson","first_name":"Samson","last_name":"Kwong"},{"last_name":"Bryson","first_name":"Terri D.","full_name":"Bryson, Terri D."},{"full_name":"Jacobsen, Steven E.","first_name":"Steven E.","last_name":"Jacobsen"},{"last_name":"Henikoff","first_name":"Steven","full_name":"Henikoff, Steven"}],"scopus_import":"1","publication":"Genome Biology","intvolume":"         6","oa":1,"year":"2005","doi":"10.1186/gb-2005-6-11-r90","day":"19","publication_status":"published","abstract":[{"text":"Background:\r\nDNA methylation occurs at preferred sites in eukaryotes. In Arabidopsis, DNA cytosine methylation is maintained by three subfamilies of methyltransferases with distinct substrate specificities and different modes of action. Targeting of cytosine methylation at selected loci has been found to sometimes involve histone H3 methylation and small interfering (si)RNAs. However, the relationship between different cytosine methylation pathways and their preferred targets is not known.\r\nResults:\r\nWe used a microarray-based profiling method to explore the involvement of Arabidopsis CMT3 and DRM DNA methyltransferases, a histone H3 lysine-9 methyltransferase (KYP) and an Argonaute-related siRNA silencing component (AGO4) in methylating target loci. We found that KYP targets are also CMT3 targets, suggesting that histone methylation maintains CNG methylation genome-wide. CMT3 and KYP targets show similar proximal distributions that correspond to the overall distribution of transposable elements of all types, whereas DRM targets are distributed more distally along the chromosome. We find an inverse relationship between element size and loss of methylation in ago4 and drm mutants.\r\nConclusion:\r\nWe conclude that the targets of both DNA methylation and histone H3K9 methylation pathways are transposable elements genome-wide, irrespective of element type and position. Our findings also suggest that RNA-directed DNA methylation is required to silence isolated elements that may be too small to be maintained in a silent state by a chromatin-based mechanism alone. Thus, parallel pathways would be needed to maintain silencing of transposable elements.","lang":"eng"}],"title":"Chromatin and siRNA pathways cooperate to maintain DNA methylation of small transposable elements in Arabidopsis","pmid":1,"publisher":"Springer Nature","date_published":"2005-10-19T00:00:00Z","citation":{"mla":"Tran, Robert K., et al. “Chromatin and SiRNA Pathways Cooperate to Maintain DNA Methylation of Small Transposable Elements in Arabidopsis.” <i>Genome Biology</i>, vol. 6, no. 11, R90, Springer Nature, 2005, doi:<a href=\"https://doi.org/10.1186/gb-2005-6-11-r90\">10.1186/gb-2005-6-11-r90</a>.","short":"R.K. Tran, D. Zilberman, C. de Bustos, R.F. Ditt, J.G. Henikoff, A.M. Lindroth, J. Delrow, T. Boyle, S. Kwong, T.D. Bryson, S.E. Jacobsen, S. Henikoff, Genome Biology 6 (2005).","ieee":"R. K. Tran <i>et al.</i>, “Chromatin and siRNA pathways cooperate to maintain DNA methylation of small transposable elements in Arabidopsis,” <i>Genome Biology</i>, vol. 6, no. 11. Springer Nature, 2005.","ista":"Tran RK, Zilberman D, de Bustos C, Ditt RF, Henikoff JG, Lindroth AM, Delrow J, Boyle T, Kwong S, Bryson TD, Jacobsen SE, Henikoff S. 2005. Chromatin and siRNA pathways cooperate to maintain DNA methylation of small transposable elements in Arabidopsis. Genome Biology. 6(11), R90.","ama":"Tran RK, Zilberman D, de Bustos C, et al. Chromatin and siRNA pathways cooperate to maintain DNA methylation of small transposable elements in Arabidopsis. <i>Genome Biology</i>. 2005;6(11). doi:<a href=\"https://doi.org/10.1186/gb-2005-6-11-r90\">10.1186/gb-2005-6-11-r90</a>","chicago":"Tran, Robert K., Daniel Zilberman, Cecilia de Bustos, Renata F. Ditt, Jorja G. Henikoff, Anders M. Lindroth, Jeffrey Delrow, et al. “Chromatin and SiRNA Pathways Cooperate to Maintain DNA Methylation of Small Transposable Elements in Arabidopsis.” <i>Genome Biology</i>. Springer Nature, 2005. <a href=\"https://doi.org/10.1186/gb-2005-6-11-r90\">https://doi.org/10.1186/gb-2005-6-11-r90</a>.","apa":"Tran, R. K., Zilberman, D., de Bustos, C., Ditt, R. F., Henikoff, J. G., Lindroth, A. M., … Henikoff, S. (2005). Chromatin and siRNA pathways cooperate to maintain DNA methylation of small transposable elements in Arabidopsis. <i>Genome Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1186/gb-2005-6-11-r90\">https://doi.org/10.1186/gb-2005-6-11-r90</a>"},"extern":"1","department":[{"_id":"DaZi"}],"date_updated":"2021-12-14T09:09:41Z","external_id":{"pmid":["16277745"]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9"},{"issue":"5","month":"10","article_processing_charge":"No","volume":15,"language":[{"iso":"eng"}],"oa_version":"None","quality_controlled":"1","author":[{"full_name":"Zilberman, Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","orcid":"0000-0002-0123-8649","last_name":"Zilberman","first_name":"Daniel"},{"first_name":"Steven","last_name":"Henikoff","full_name":"Henikoff, Steven"}],"_id":"9529","type":"journal_article","article_type":"review","date_created":"2021-06-08T09:05:56Z","publication_identifier":{"issn":["0959-437X"]},"status":"public","abstract":[{"text":"Eukaryotic organisms have the remarkable ability to inherit states of gene activity without altering the underlying DNA sequence. This epigenetic inheritance can persist over thousands of years, providing an alternative to genetic mutations as a substrate for natural selection. Epigenetic inheritance might be propagated by differences in DNA methylation, post-translational histone modifications, and deposition of histone variants. Mounting evidence also indicates that small interfering RNA (siRNA)-mediated mechanisms play central roles in setting up and maintaining states of gene activity. Much of the epigenetic machinery of many organisms, including Arabidopsis, appears to be directed at silencing viruses and transposable elements, with epigenetic regulation of endogenous genes being mostly derived from such processes.","lang":"eng"}],"publication_status":"published","title":"Epigenetic inheritance in Arabidopsis: Selective silence","publisher":"Elsevier","date_published":"2005-10-01T00:00:00Z","pmid":1,"citation":{"ieee":"D. Zilberman and S. Henikoff, “Epigenetic inheritance in Arabidopsis: Selective silence,” <i>Current Opinion in Genetics and Development</i>, vol. 15, no. 5. Elsevier, pp. 557–562, 2005.","ama":"Zilberman D, Henikoff S. Epigenetic inheritance in Arabidopsis: Selective silence. <i>Current Opinion in Genetics and Development</i>. 2005;15(5):557-562. doi:<a href=\"https://doi.org/10.1016/j.gde.2005.07.002\">10.1016/j.gde.2005.07.002</a>","ista":"Zilberman D, Henikoff S. 2005. Epigenetic inheritance in Arabidopsis: Selective silence. Current Opinion in Genetics and Development. 15(5), 557–562.","chicago":"Zilberman, Daniel, and Steven Henikoff. “Epigenetic Inheritance in Arabidopsis: Selective Silence.” <i>Current Opinion in Genetics and Development</i>. Elsevier, 2005. <a href=\"https://doi.org/10.1016/j.gde.2005.07.002\">https://doi.org/10.1016/j.gde.2005.07.002</a>.","apa":"Zilberman, D., &#38; Henikoff, S. (2005). Epigenetic inheritance in Arabidopsis: Selective silence. <i>Current Opinion in Genetics and Development</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.gde.2005.07.002\">https://doi.org/10.1016/j.gde.2005.07.002</a>","mla":"Zilberman, Daniel, and Steven Henikoff. “Epigenetic Inheritance in Arabidopsis: Selective Silence.” <i>Current Opinion in Genetics and Development</i>, vol. 15, no. 5, Elsevier, 2005, pp. 557–62, doi:<a href=\"https://doi.org/10.1016/j.gde.2005.07.002\">10.1016/j.gde.2005.07.002</a>.","short":"D. Zilberman, S. Henikoff, Current Opinion in Genetics and Development 15 (2005) 557–562."},"date_updated":"2021-12-14T09:13:13Z","department":[{"_id":"DaZi"}],"extern":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","external_id":{"pmid":["16085410"]},"scopus_import":"1","publication":"Current Opinion in Genetics and Development","intvolume":"        15","doi":"10.1016/j.gde.2005.07.002","year":"2005","page":"557-562"},{"article_type":"original","_id":"11904","type":"journal_article","date_created":"2022-08-17T11:16:56Z","status":"public","publication_identifier":{"issn":["1386-145X"],"eissn":["1573-1413"]},"oa_version":"None","quality_controlled":"1","author":[{"orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"full_name":"Chang, Bay-Wei","last_name":"Chang","first_name":"Bay-Wei"},{"full_name":"Milch, Brian","first_name":"Brian","last_name":"Milch"},{"full_name":"Brin, Sergey","last_name":"Brin","first_name":"Sergey"}],"issue":"2","month":"06","volume":8,"article_processing_charge":"No","language":[{"iso":"eng"}],"doi":"10.1007/s11280-004-4870-6","day":"01","page":"101-126","year":"2005","scopus_import":"1","related_material":{"record":[{"id":"11860","relation":"earlier_version","status":"public"}]},"publication":"World Wide Web","intvolume":"         8","citation":{"ieee":"M. H. Henzinger, B.-W. Chang, B. Milch, and S. Brin, “Query-free news search,” <i>World Wide Web</i>, vol. 8, no. 2. Springer Nature, pp. 101–126, 2005.","apa":"Henzinger, M. H., Chang, B.-W., Milch, B., &#38; Brin, S. (2005). Query-free news search. <i>World Wide Web</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11280-004-4870-6\">https://doi.org/10.1007/s11280-004-4870-6</a>","ista":"Henzinger MH, Chang B-W, Milch B, Brin S. 2005. Query-free news search. World Wide Web. 8(2), 101–126.","chicago":"Henzinger, Monika H, Bay-Wei Chang, Brian Milch, and Sergey Brin. “Query-Free News Search.” <i>World Wide Web</i>. Springer Nature, 2005. <a href=\"https://doi.org/10.1007/s11280-004-4870-6\">https://doi.org/10.1007/s11280-004-4870-6</a>.","ama":"Henzinger MH, Chang B-W, Milch B, Brin S. Query-free news search. <i>World Wide Web</i>. 2005;8(2):101-126. doi:<a href=\"https://doi.org/10.1007/s11280-004-4870-6\">10.1007/s11280-004-4870-6</a>","mla":"Henzinger, Monika H., et al. “Query-Free News Search.” <i>World Wide Web</i>, vol. 8, no. 2, Springer Nature, 2005, pp. 101–26, doi:<a href=\"https://doi.org/10.1007/s11280-004-4870-6\">10.1007/s11280-004-4870-6</a>.","short":"M.H. Henzinger, B.-W. Chang, B. Milch, S. Brin, World Wide Web 8 (2005) 101–126."},"extern":"1","date_updated":"2023-02-21T16:30:56Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"text":"Many daily activities present information in the form of a stream of text, and often people can benefit from additional information on the topic discussed. TV broadcast news can be treated as one such stream of text; in this paper we discuss finding news articles on the web that are relevant to news currently being broadcast.\r\n\r\nWe evaluated a variety of algorithms for this problem, looking at the impact of inverse document frequency, stemming, compounds, history, and query length on the relevance and coverage of news articles returned in real time during a broadcast. We also evaluated several postprocessing techniques for improving the precision, including reranking using additional terms, reranking by document similarity, and filtering on document similarity. For the best algorithm, 84–91% of the articles found were relevant, with at least 64% of the articles being on the exact topic of the broadcast. In addition, a relevant article was found for at least 70% of the topics.","lang":"eng"}],"title":"Query-free news search","publisher":"Springer Nature","date_published":"2005-06-01T00:00:00Z"}]