779 research outputs found
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Living green: Conference proceedings of the living green scientific conference
No full textPresentaties van Livinggreen Scientific Conference: Stimulating energy efficiency in households - Comparison of the Livinggreen.eu methods to theory – Daphne Geelen Engaging households in sustainable renovation – Exploration of a complementary approach - Meijer, S.A., Geelen, D.V., Franken, V., Kersten, W.C., Crul. M.R.M From community resilience towards urban resilience: exploring the grassroot initiatives’ role in cities - Meijer, S.A., van Timmeren, A., Crul, M.R.M., Brezet, H.C. Sense of history: capturing and utilizing immaterial values for sustainable heritage protection - Franken, V., Meijer, S.A.Design EngineeringIndustrial Design Engineerin
On the Rank of Cyclic Latin Squares
No full textRecently, Fang, Shiu and Pan [3] suggested a new way to generate uniform designs based on cyclic Latin squares. The new designs have better uniformity than some other known uniform designs. In their paper, Fang, Shiu and Pan indicated that the rank of the cyclic Latin squares used in the construction of uniform designs is important and they wanted to know the maximum and the minimum possible values of the rank of all cyclic Latin squares. In this paper we prove that the maximum value of the rank of cyclic Latin squares of order n is n while the minimum value is 1 1 + = å f( ) p i t i s where n p i t i s = = Õ 1 is the prime decomposition of n and f is the Euler function. Key Words and Phrases: Cyclic Latin square, circulant matrix, experimental design, uniform design. 1991 Mathematics Subject Classification: 15A36, 11C20, 62K99 1. Introduction The uniform designs were proposed by Fang and Wang [2, 4, 8] as a kind of experimental designs and have been successfully applied i..
The New Grand Balloon
No full textArticle about the ascent of Charles Green's balloon on September 23, 1836 from Vauxhall Gardens. Includes an account written by one of the passengers and an account written by Green. An accompanying illustration shows the balloon in the air with the ten passengers and spectators watching from a tower window.For more information about this item, visit https://archivesspace.mit.edu/repositories/2/digital_objects/74
The New Grand Balloon
No full textArticle published in the Weekly Chronicle about the ascent of Charles Green's balloon on September 23, 1836 from Vauxhall Gardens. From an account written by one of the passengers and an account written by Green. An accompanying illustration shows the balloon in the air with the ten passengers and spectators watching from a tower window.For more information about this item, visit https://archivesspace.mit.edu/repositories/2/digital_objects/68
Extremal Hosoya index and Merrifield–Simmons index of hexagonal spiders
No full textAbstractFor any graph G, let m(G) and i(G) be the numbers of matchings (i.e., the Hosoya index) and the number of independent sets (i.e., the Merrifield–Simmons index) of G, respectively. In this paper, we show that the linear hexagonal spider and zig-zag hexagonal spider attain the extremal values of Hosoya index and Merrifield–Simmons index, respectively
Hong Kong Medical Forum, 1996: programme book : 13th - 14th July 1996, Hotel Furama Kempinski Hong Kong
No full textpublished_or_final_versionWelcome message Lam, Shiu-kum Lam, Shiu-kumOrganizing committeeProgrammeAcknowledgment 25Prevention and screening in osteoporosis Seeman, Ego Seeman, Ego 5The epidemiology of osteoporotic fracture of proximal femur and is outcome in Hong Kong Chiu, Kwong-yuen, Peter Chiu, Kwong-yuen, Peter 8The role of calcium and vitamin D in osteoporosis Kung, Annie W.C. Kung, Annie W.C. 9Inhitors of bone resorption and stimulators of bone formation Seeman, Ego Seeman, Ego 10Update on methods if diagnosis for tuberculosis Yuen, Kwok-yung Yuen, Kwok-yung 12HIV/AIDS: learning from new findings Lee, Shui-shan Lee, Shui-shan 13Rapid diagnosis of cytomegalovirus and other viral infections Peiris, Joseph Sriyal Malik Peiris, Joseph Sriyal Malik 14Gene therapy for respiratory disease Geddes, Duncan M. Geddes, Duncan M. 15Advances and controversies in sleep related breathing disorders Ip, Mary Ip, Mary 16The genetics of asthma Geddes, Duncan M. Geddes, Duncan M. 17Current treatment of non-small cell carcinoma of lung (NSCLC) based on staging Lam, Wah-kit Lam, Wah-kit 18Strategies for the treatment of heart failure Ikram, Hamid Ikram, Hamid 19Management of acute myocardial infarction Lau, Chu-pak Lau, Chu-pak 20Management of coronary artery disease: Drugs, PTCA or surgery? Ho, David Ho, David 22Diastolic heart failure Ikram, Hamid Ikram, Hamid 2
The coefficients of Laplacian characteristic polynomials of graphs
No full textAbstractLi et al. [J.X. Li, W.C. Shiu, A. Chang, The number of spanning trees of a graph, Appl. Math. Lett. 23 (2010) 286–290] obtained some upper bounds for the number of spanning trees of graphs. In this paper, we characterize the connected graph G with the connectivity κ (resp. edge-connectivity κ′ and chromatic number χ) which has the maximal coefficients of the Laplacian characteristic polynomial. Since the number of spanning trees of a graph G is determined by one of the coefficients of the Laplacian characteristic polynomial of G, we generalize the results by Li et al
Mayor W.C. Donahue
No full textPhotograph - A member of the Order of the Royal Purple presents a cheque to Mayor William Clifford Donahue for the skating rink fund. Athabasca, Alberta. April 15, 196
The strong chromatic index of complete cubic Halin graphs
No full textAbstractA complete cubic Halin graph is a cubic Halin graph whose characteristic tree is a complete cubic tree, in which all leaves are at the same distance from the root vertex. In this work, we determine the strong chromatic index of the complete cubic Halin graph
- …
