<rdf:RDF xmlns:community="http://www.bibsonomy.org/ontologies/2008/05/community#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xml:base="http://www.bibsonomy.org/concept/tag/Operator"><owl:Ontology rdf:about=""><rdfs:comment>BibSonomy publications for /concept/tag/Operator</rdfs:comment><owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/></owl:Ontology><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/23ec3ae28329554805678203bae0e90ec/brazovayeye"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/23ec3ae28329554805678203bae0e90ec/brazovayeye"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/gecco2002/gecco-2002-14.pdf"/><swrc:date>Thu Jun 19 17:46:40 CEST 2008</swrc:date><swrc:address>New York</swrc:address><swrc:booktitle>GECCO 2002: Proceedings of the Genetic and
                 Evolutionary Computation Conference</swrc:booktitle><swrc:month>9-13 July</swrc:month><swrc:pages>853--860</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Morgan Kaufmann Publishers"/></swrc:publisher><swrc:title>Using Schema Theory To Explore Interactions Of
                 Multiple Operators</swrc:title><swrc:year>2002</swrc:year><swrc:keywords>interaction, length schema genetic bias, variable algorithms, linear operator proportion, theory, programming, structures </swrc:keywords><swrc:abstract>In the last two years the schema theory for Genetic
                 Programming (GP) has been applied to the problem of
                 understanding the length biases of a variety of
                 crossover and mutation operators on variable length
                 linear structures. In these initial papers, operators
                 were studied in isolation. In practice, however, they
                 are typically used in various combinations, and in this
                 paper we present the first schema theory analysis of
                 the complex interactions of multiple operators. In
                 particular, we apply the schema theory to the use of
                 standard subtree crossover, full mutation, and grow
                 mutation (in varying proportions) to variable length
                 linear structures in the one-then-zeros problem. We
                 then show how the results can be used to guide choices
                 about the relative proportion of these operators in
                 order to achieve certain structural goals during a
                 run.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="San Francisco, CA 94104, USA" swrc:key="address"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="1-55860-878-8" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Nicholas Freitag {McPhee}"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Riccardo Poli"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="W. B. Langdon"/></rdf:_1><rdf:_2><swrc:Person swrc:name="E. Cant{\&#039;u}-Paz"/></rdf:_2><rdf:_3><swrc:Person swrc:name="K. Mathias"/></rdf:_3><rdf:_4><swrc:Person swrc:name="R. Roy"/></rdf:_4><rdf:_5><swrc:Person swrc:name="D. Davis"/></rdf:_5><rdf:_6><swrc:Person swrc:name="R. Poli"/></rdf:_6><rdf:_7><swrc:Person swrc:name="K. Balakrishnan"/></rdf:_7><rdf:_8><swrc:Person swrc:name="V. Honavar"/></rdf:_8><rdf:_9><swrc:Person swrc:name="G. Rudolph"/></rdf:_9><rdf:_10><swrc:Person swrc:name="J. Wegener"/></rdf:_10><rdf:_11><swrc:Person swrc:name="L. Bull"/></rdf:_11><rdf:_12><swrc:Person swrc:name="M. A. Potter"/></rdf:_12><rdf:_13><swrc:Person swrc:name="A. C. Schultz"/></rdf:_13><rdf:_14><swrc:Person swrc:name="J. F. Miller"/></rdf:_14><rdf:_15><swrc:Person swrc:name="E. Burke"/></rdf:_15><rdf:_16><swrc:Person swrc:name="N. Jonoska"/></rdf:_16></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2740d2c642605e589a59e1f6534576ff7/brazovayeye"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2740d2c642605e589a59e1f6534576ff7/brazovayeye"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://cswww.essex.ac.uk/staff/rpoli/papers/Poli-CEC2001.pdf"/><swrc:date>Thu Jun 19 17:46:40 CEST 2008</swrc:date><swrc:address>COEX, World Trade Center, 159 Samseong-dong,
                 Gangnam-gu, Seoul, Korea</swrc:address><swrc:booktitle>Proceedings of the 2001 Congress on Evolutionary
                 Computation CEC2001</swrc:booktitle><swrc:month>27-30 May</swrc:month><swrc:pages>1062--1069</swrc:pages><swrc:publisher><swrc:Organization swrc:name="IEEE Press"/></swrc:publisher><swrc:title>Exact {GP} Schema Theory for Headless Chicken
                 Crossover and Subtree Mutation</swrc:title><swrc:year>2001</swrc:year><swrc:keywords>subtree biases headless algorithms, programming, mutation, schema crossover, theory, operator genetic chicken </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="0-7803-6658-1" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Riccardo Poli"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Nicholas F. McPhee"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2797af734fa2ebc20d8ad574c5a7eeddd/brazovayeye"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2797af734fa2ebc20d8ad574c5a7eeddd/brazovayeye"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><swrc:date>Thu Jun 19 17:46:40 CEST 2008</swrc:date><swrc:journal>IEEE Transactions on Systems, Man and Cybernetics,
                 Part C: Applications and Reviews</swrc:journal><swrc:number>3</swrc:number><swrc:pages>287--300</swrc:pages><swrc:title>Fingerprint classification based on learned features</swrc:title><swrc:volume>35</swrc:volume><swrc:year>Aug</swrc:year><swrc:keywords>method, discovery, algorithm, feature Bayesian image database, methods, programming, NIST-4 Bayes genetic feature-learning databases operator extraction, learning algorithms, classifier, identification, classification fingerprint processing operations (artificial classification, primitive visual intelligence), composite </swrc:keywords><swrc:abstract>In this paper, we present a fingerprint classification
                 approach based on a novel feature-learning algorithm.
                 Unlike current research for fingerprint classification
                 that generally uses well defined meaningful features,
                 our approach is based on Genetic Programming (GP),
                 which learns to discover composite operators and
                 features that are evolved from combinations of
                 primitive image processing operations. Our experimental
                 results show that our approach can find good composite
                 operators to effectively extract useful features. Using
                 a Bayesian classifier, without rejecting any
                 fingerprints from the NIST-4 database, the correct
                 rates for 4- and 5-class classification are 93.3percent
                 and 91.6percent, respectively, which compare favourably
                 with other published research and are one of the best
                 results published to date.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="1094-6977" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="10.1109/TSMCC.2005.848167" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Xuejun Tan"/></rdf:_1><rdf:_2><swrc:Person swrc:name="B. Bhanu"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Yingqiang Lin"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2c1ec904e4b2599058ebb909a3f55c759/brazovayeye"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2c1ec904e4b2599058ebb909a3f55c759/brazovayeye"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://ieeexplore.ieee.org/iel5/3477/18067/00836383.pdf"/><swrc:date>Thu Jun 19 17:35:00 CEST 2008</swrc:date><swrc:journal>IEEE Transactions on Systems, Man and Cybernetics --
                 Part B: Cybernetics</swrc:journal><swrc:month>April</swrc:month><swrc:number>2</swrc:number><swrc:pages>351--357</swrc:pages><swrc:title>A two-level hybrid evolutionary algorithm for modeling
                 one-dimensional dynamic systems by higher-order {ODE}
                 models</swrc:title><swrc:volume>40</swrc:volume><swrc:year>2000</swrc:year><swrc:keywords>operator differential computation, THEMA, genetic systems, models, algorithms, crossover ODE one-dimensional equation, two-level dynamic evolutionary programming, algorithm, hybrid modeling ordinary </swrc:keywords><swrc:abstract>This paper presents a new algorithm for modeling
                 one-dimensional (1-D) dynamic systems by higher-order
                 ordinary differential equation (HODE) models instead of
                 the ARMA models as used in traditional time series
                 analysis. A two-level hybrid evolutionary modeling
                 algorithm (THEMA) is used to approach the modeling
                 problem of HODE&#039;s for dynamic systems. The main idea of
                 this modeling algorithm is to embed a genetic algorithm
                 (GA) into genetic programming (GP), where GP is
                 employed to optimize the structure of a model (the
                 upper level), while a GA is employed to optimize the
                 parameters of the model (the lower level). In the GA,
                 we use a novel crossover operator based on a nonconvex
                 linear combination of multiple parents which works
                 efficiently and quickly in parameter optimization
                 tasks. Two practical examples of time series are used
                 to demonstrate the THEMA&#039;s effectiveness and
                 advantages.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="1083-4419" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="7 pages" swrc:key="size"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Hong-Qing Cao"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Li-Shan Kang"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Tao Guo"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Yu-Ping Chen"/></rdf:_4><rdf:_5><swrc:Person swrc:name="Hugo {de Garis}"/></rdf:_5></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/208eb1d1d0882e757fa9dab931e9e9a47/brazovayeye"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/208eb1d1d0882e757fa9dab931e9e9a47/brazovayeye"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://hdl.handle.net/1826/1131"/><swrc:date>Thu Jun 19 17:35:00 CEST 2008</swrc:date><swrc:journal>Journal of Sound and Vibration</swrc:journal><swrc:month>30 May</swrc:month><swrc:number>1-2</swrc:number><swrc:pages>213--226</swrc:pages><swrc:title>Establishment of the mathematical model for diagnosing
                 the engine valve faults by genetic programming</swrc:title><swrc:volume>293</swrc:volume><swrc:year>2006</swrc:year><swrc:keywords>diagnosis, operator algorithms, genetic Fault programming, Engine valve, Immigration </swrc:keywords><swrc:abstract>Available machine fault diagnostic methods show
                 unsatisfactory performances on both on-line and
                 intelligent analyses because their operations involve
                 intensive calculations and are labour intensive. Aiming
                 at improving this situation, this paper describes the
                 development of an intelligent approach by using the
                 Genetic Programming (abbreviated as GP) method.
                 Attributed to the simple calculation of the
                 mathematical model being constructed, different kinds
                 of machine faults may be diagnosed correctly and
                 quickly. Moreover, human input is significantly reduced
                 in the process of fault diagnosis. The effectiveness of
                 the proposed strategy is validated by an illustrative
                 example, in which three kinds of valve states inherent
                 in a six-cylinders/four-stroke cycle diesel engine,
                 i.e. normal condition, valve-tappet clearance and gas
                 leakage faults, are identified. In the example, 22
                 mathematical functions have been specially designed and
                 8 easily obtained signal features are used to construct
                 the diagnostic model. Different from existing GPs, the
                 diagnostic tree used in the algorithm is constructed in
                 an intelligent way by applying a power-weight
                 coefficient to each feature. The power-weight
                 coefficients vary adaptively between 0 and 1 during the
                 evolutionary process. Moreover, different evolutionary
                 strategies are employed, respectively for selecting the
                 diagnostic features and functions, so that the
                 mathematical functions are sufficiently and in the
                 meantime, the repeated use of signal features may be
                 fully avoided. The experimental results are illustrated
                 diagrammatically in the following sections.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="OAI-PMH server at dspace.lib.cranfield.ac.uk" swrc:key="bibsource"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="0022-460X" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="oai:dspace.lib.cranfield.ac.uk:1826/1131" swrc:key="oai"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="en" swrc:key="language"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="doi:10.1016/j.jsv.2005.09.004" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Wen-Xian Yang"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2badf367278f9c548fa8c9971c7a3997e/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2badf367278f9c548fa8c9971c7a3997e/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V18-40PGX9N-6/1/2b51d539702cd08ffb3283da3986ff1c"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Signal Processing</swrc:journal><swrc:month>Aug</swrc:month><swrc:number>8</swrc:number><swrc:pages>1469--1487</swrc:pages><swrc:title>Hybrid human-machine binary morphological operator design. An independent
	constraint approach</swrc:title><swrc:volume>80</swrc:volume><swrc:year>2000</swrc:year><swrc:keywords>operator Morphological </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Junior Barrera"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Edward R. Dougherty"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Marcel Brun"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/27ef89cc6105c7649ca779086fb9b2058/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/27ef89cc6105c7649ca779086fb9b2058/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V1D-448R1X6-C/1/baf28e9d0f4ab5920e926c6718fc7435"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Statistics \&amp; Probability Letters</swrc:journal><swrc:month>Mar</swrc:month><swrc:number>4</swrc:number><swrc:pages>333--338</swrc:pages><swrc:title>Rates of convergence for everywhere-positive Markov chains</swrc:title><swrc:volume>22</swrc:volume><swrc:year>1995</swrc:year><swrc:keywords>operator Compact </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="J. R. Baxter"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Jeffrey S. Rosenthal"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2a07840077c2bed902b68e459047fc7d3/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2a07840077c2bed902b68e459047fc7d3/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V18-48XCY0V-94/1/27ab8b7c69bef7b30492801129646786"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Signal Processing</swrc:journal><swrc:month>Jan</swrc:month><swrc:number>1</swrc:number><swrc:pages>1--16</swrc:pages><swrc:title>A skimming technique for fast accurate edge detection</swrc:title><swrc:volume>26</swrc:volume><swrc:year>1992</swrc:year><swrc:keywords>gradient operator Differential </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="E. R. Davies"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2b07bd3c17f23b9b3ed38bca4cd4901db/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2b07bd3c17f23b9b3ed38bca4cd4901db/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V0M-44N9KBP-2/1/638594a400f8fdadf25ff6187dbc62d3"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Journal of Statistical Planning and Inference</swrc:journal><swrc:month>Feb</swrc:month><swrc:number>2</swrc:number><swrc:pages>93--108</swrc:pages><swrc:title>Spectral domains of vector harmonizable processes</swrc:title><swrc:volume>100</swrc:volume><swrc:year>2002</swrc:year><swrc:keywords>Weakly processes harmonizable operator </swrc:keywords><swrc:day>01</swrc:day><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Y{\^u}ichir{\^o} Kakihara"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/296a0ed5154b0caa6967c5756e5f02421/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/296a0ed5154b0caa6967c5756e5f02421/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V18-4BF630R-2/1/ae7e6cac807cd1cf8334753892bd2578"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Signal Processing</swrc:journal><swrc:month>Apr</swrc:month><swrc:number>4</swrc:number><swrc:pages>763--784</swrc:pages><swrc:title>The &#034;switch-on&#034; problem for linear time-invariant operators</swrc:title><swrc:volume>84</swrc:volume><swrc:year>2004</swrc:year><swrc:keywords>LTI operator </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="J. M. Lilly"/></rdf:_1><rdf:_2><swrc:Person swrc:name="E. E. Lettvin"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/23efedeb8051c1790be7cb87e28ffb5b0/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/23efedeb8051c1790be7cb87e28ffb5b0/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V1D-3SNV16X-1M/1/a2f59d3b790768fe7b4f3371b2e5410b"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Statistics \&amp; Probability Letters</swrc:journal><swrc:month>May</swrc:month><swrc:number>4</swrc:number><swrc:pages>367--372</swrc:pages><swrc:title>The structure of generalized domains of semistable attraction</swrc:title><swrc:volume>33</swrc:volume><swrc:year>1997</swrc:year><swrc:keywords>Operator laws semistable </swrc:keywords><swrc:day>16</swrc:day><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Mark M. Meerschaert"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Hans-Peter Scheffler"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2984aaef6c3e9252e4e5a191f5adbba75/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2984aaef6c3e9252e4e5a191f5adbba75/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V1D-3YCN1N9-4/1/296aa7138d765a4231f0ec8fceeb9439"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Statistics \&amp; Probability Letters</swrc:journal><swrc:month>Sep</swrc:month><swrc:number>4</swrc:number><swrc:pages>305--314</swrc:pages><swrc:title>A semigroup approach to poisson approximation with respect to the
	point metric</swrc:title><swrc:volume>24</swrc:volume><swrc:year>1995</swrc:year><swrc:keywords>approximation, Poisson Operator semigroups </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Bero Roos"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2df50587ba00dbf8d7dbe0fc0e1eb6ade/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2df50587ba00dbf8d7dbe0fc0e1eb6ade/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V1D-3XHH69M-8/1/a1a603abfd639a1d232784cd8d1b1194"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Statistics \&amp; Probability Letters</swrc:journal><swrc:month>Jul</swrc:month><swrc:number>4</swrc:number><swrc:pages>385--392</swrc:pages><swrc:title>On estimation of the spectral measure of certain nonnormal operator
	stable laws</swrc:title><swrc:volume>43</swrc:volume><swrc:year>1999</swrc:year><swrc:keywords>Operator stable laws </swrc:keywords><swrc:day>15</swrc:day><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Hans-Peter Scheffler"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2d0b446458c32492474364871292f1fd1/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2d0b446458c32492474364871292f1fd1/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V1D-4R0CJY8-11/1/85f5675271831a437d51713aa847c13e"/><swrc:date>Wed Apr 23 22:05:04 CEST 2008</swrc:date><swrc:journal>Statistics \&amp; Probability Letters</swrc:journal><swrc:month>Apr</swrc:month><swrc:number>6</swrc:number><swrc:pages>780--784</swrc:pages><swrc:title>Some results on subordination, selfdecomposability and operator semi-stability</swrc:title><swrc:volume>78</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>semi-selfdecomposability Operator </swrc:keywords><swrc:day>15</swrc:day><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Gyeong Suk Choi"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/235100e6659b0c37ba4a69a04576e2c14/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/235100e6659b0c37ba4a69a04576e2c14/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V8V-45GVWNP-18/1/fa5e98410889c532ff3f4d3ede7e31c7"/><swrc:date>Wed Apr 23 14:55:19 CEST 2008</swrc:date><swrc:journal>Computational Statistics \&amp; Data Analysis</swrc:journal><swrc:month>May</swrc:month><swrc:number>3</swrc:number><swrc:pages>333--344</swrc:pages><swrc:title>Implicit construction of McCulloch&#039;s G matrix for the numerical evaluation of Fisher information matrixes</swrc:title><swrc:volume>11</swrc:volume><swrc:year>1991</swrc:year><swrc:keywords>Vec({\textperiodcentered}) operator </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Giovanni B. Moneta"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2fc87a2a0f3e2b2dda9a4731ab0bb257e/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2fc87a2a0f3e2b2dda9a4731ab0bb257e/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V1B-484N61C-15/1/86ec58a890a29b1f7750cc2380a35bb1"/><swrc:date>Tue Apr 22 14:25:45 CEST 2008</swrc:date><swrc:journal>Stochastic Processes and their Applications</swrc:journal><swrc:month>Oct</swrc:month><swrc:number>1</swrc:number><swrc:pages>169--175</swrc:pages><swrc:title>The effect of boundary conditions on the density of states for random Schr{\&#034;o}dinger operators</swrc:title><swrc:volume>23</swrc:volume><swrc:year>1986</swrc:year><swrc:keywords>operator Schr{\&#034;o}dinger </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="J. Droese"/></rdf:_1><rdf:_2><swrc:Person swrc:name="W. Kirsch"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2bd8dfa43c9f417bbcb5bcdbf6166a5cb/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2bd8dfa43c9f417bbcb5bcdbf6166a5cb/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V1B-3WP2CNV-2/1/9c6e4808cb12b18c9d5d061ec126b53e"/><swrc:date>Tue Apr 22 14:25:45 CEST 2008</swrc:date><swrc:journal>Stochastic Processes and their Applications</swrc:journal><swrc:month>Oct</swrc:month><swrc:number>1</swrc:number><swrc:pages>11--33</swrc:pages><swrc:title>Stochastic representation of diffusions corresponding to divergence form operators</swrc:title><swrc:volume>63</swrc:volume><swrc:year>1996</swrc:year><swrc:keywords>form operator Divergence </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Andrzej Rozkosz"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2fa490d70b13b377db2209c69718aad21/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2fa490d70b13b377db2209c69718aad21/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V1B-4GGWDJ0-1/1/b5397ef065c4c4e86515493cad6bdebb"/><swrc:date>Tue Apr 22 14:25:45 CEST 2008</swrc:date><swrc:journal>Stochastic Processes and their Applications</swrc:journal><swrc:month>Nov</swrc:month><swrc:number>11</swrc:number><swrc:pages>1764--1781</swrc:pages><swrc:title>On the solutions of nonlinear stochastic fractional partial differential equations in one spatial dimension</swrc:title><swrc:volume>115</swrc:volume><swrc:year>2005</swrc:year><swrc:keywords>operator derivative Fractional </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Latifa Debbi"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Marco Dozzi"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2f81ce71e45a5b7a7537b0d5a47d787a1/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2f81ce71e45a5b7a7537b0d5a47d787a1/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6V1B-45Y6HW8-1/1/9d9f2392e4d10e0a7898ea1341757c79"/><swrc:date>Tue Apr 22 14:25:45 CEST 2008</swrc:date><swrc:journal>Stochastic Processes and their Applications</swrc:journal><swrc:month>Jan</swrc:month><swrc:number>1</swrc:number><swrc:pages>101--122</swrc:pages><swrc:title>On a decomposition of symmetric diffusions with reflecting boundary conditions</swrc:title><swrc:volume>103</swrc:volume><swrc:year>2003</swrc:year><swrc:keywords>form Divergence operator </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Andrzej Rozkosz"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2dbf8732479a624eabf5bdf507f438f2a/smicha"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2dbf8732479a624eabf5bdf507f438f2a/smicha"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.sciencedirect.com/science/article/B6TVG-3SR41V9-2T/1/198bf135e91d979f26c0f087c0c25c06"/><swrc:date>Tue Apr 22 10:36:30 CEST 2008</swrc:date><swrc:journal>Physica A: Statistical and Theoretical Physics</swrc:journal><swrc:month>Jul</swrc:month><swrc:number>3-4</swrc:number><swrc:pages>535--548</swrc:pages><swrc:title>Dynamics of one-site fermionic model in the presence of precessing
	magnetic field</swrc:title><swrc:volume>241</swrc:volume><swrc:year>1997</swrc:year><swrc:keywords>Matrix operator </swrc:keywords><swrc:day>15</swrc:day><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="A. C. Aguiar Pinto"/></rdf:_1><rdf:_2><swrc:Person swrc:name="R. Bruno"/></rdf:_2><rdf:_3><swrc:Person swrc:name="M. T. Thomaz"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></rdf:RDF>