نتایج جستجو برای: biedenharn k r
تعداد نتایج: 766800 فیلتر نتایج به سال:
The quasi-shuffle product and mixable shuffle product are both generalizations of the shuffle product and have both been studied quite extensively recently. We relate these two generalizations and realize quasi-shuffle product algebras as subalgebras of mixable shuffle product algebras. As an application, we obtain Hopf algebra structures in free Rota-Baxter algebras.
To cite this article: R. Ahas, A. Aasa, Y. Yuan, M. Raubal, Z. Smoreda, Y. Liu, C. Ziemlicki, M. Tiru & M. Zook (2015) Everyday space–time geographies: using mobile phone-based sensor data to monitor urban activity in Harbin, Paris, and Tallinn, International Journal of Geographical Information Science, 29:11, 2017-2039, DOI: 10.1080/13658816.2015.1063151 To link to this article: http://dx.doi....
Justin E. Harbison, Lara R. Dugas, William Brieger, Bamidele O. Tayo, Tunrayo Alabi, Dale A. Schoeller, and Amy Luke Division of Epidemiology, Department of Public Health Sciences, Loyola University School of Medicine, Maywood Illinois; Department of International Health, Bloomberg School of Public Health, John Hopkins University, Baltimore Maryland; Geospatial Laboratory, Research for Developm...
crops of parautocthonous megabreccia (MBu) in Uzboi Valles ~x km from the rim of Holden crater. PARAUTOCHTHONOUS MEGABRECCIAS AND POSSIBLE EVIDENCE OF IMPACT-INDUCED HYDROTHERMAL ALTERATION IN HOLDEN CRATER, MARS. L. L. Tornabene, G. R. Osinski, and A. S. McEwen, Lunar and Planetary Lab, University of Arizona, 1541 E. University Blvd., Tucson, Arizona, 85721, USA ([email protected], De...
The quasi-shuffle product and mixable shuffle product are both generalizations of the shuffle product and have both been studied quite extensively recently. We relate these two generalizations and realize quasi-shuffle product algebras as subalgebras of mixable shuffle product algebras. This allows us to extend a previous result of Hopf algebra structure on Baxter algebras.
Let G = (V, E) be a simple undirected graph with a set V of vertices and a set E of edges. Each vertex v ∈ V has a demand d(v) ∈ Z+ and a cost c(v) ∈ R+, where Z+ and R+ denote the set of nonnegative integers and the set of nonnegative reals, respectively. The source location problem with vertex-connectivity requirements in a given graph G asks to find a set S of vertices minimizing ∑ v∈S c(v) ...
Although there are many books about behavioral research methods, there are very few guidebooks. This review describes a book by Jon S. Bailey and Mary R. Burch that has been written specifically as a guide for the new researcher. Replete with helpful tips on navigating the research process, the book is organized into 10 sequential research steps that guide the reader through each phase of conce...
Justin E. Harbison, Lara R. Dugas, William Brieger, Bamidele O. Tayo, Tunrayo Alabi, Dale A. Schoeller, and Amy Luke Division of Epidemiology, Department of Public Health Sciences, Loyola University School of Medicine, Maywood Illinois; Department of International Health, Bloomberg School of Public Health, John Hopkins University, Baltimore Maryland; Geospatial Laboratory, Research for Developm...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید