37 research outputs found
An Examination of the Globalisation of Authorship in Publishing in 20 Leading Marketing Journals
No full textPurpose of this paper is to examine the global contribution of academics to marketing literature between 1999 and 2003, based on an examination of the location of academics institution of employment, as reported in published works. The data is used to evaluate the global dispersion of publishing.\ud
Design/approach. The paper uses the method of content analysis where the authorship of all articles in 20 leading marketing journals between 1999 and 2003 is examined. An empirical examination of performance was undertaken across geographic regions. There was also an examination of whether the quality of journal affected regional performance.\ud
Findings. The research found that there is a significant "bias" of authorship within the 20 journals examined, with the majority of works published by academics at institutions in North America. There is some variation in regional performance based on the type of journal examined. Limitations. There was no attempt to empirically examine why differences might exist. The study only focused on a sample of 20 English language journals over 5 years. These journals have been included in studies that list the leading marketing journal for US and European academics. Practical Implications. The research suggests that there may in fact be regional differences in publishing behaviour. It is unclear if these differences relate to variations in the "objectives" of institutions within each country or other factors, such as the North American publish-or-perish mentality. The research posits that a marketing knowledge may be unnecessarily restricted, if there is a bias against non-North American perspectives. Originality. While there have been other works examining research performance of institutions, there has been limited examination in marketing on the nation in which authors work and none have used a broad cross-section of journals. This work takes a global "snapshot" of national research performance within marketing
The Quest for Citations: Drivers of Article Impact
No full textWhy do some articles become building blocks for future scholars, while many others remain unnoticed? We aim to answer this question by contrasting, synthesizing and simultaneously testing three scientometric perspectives – universalism, social constructivism and presentation – on the influence of article and author characteristics on article citations. To do so, we study all articles published in a sample of five major journals in marketing from 1990 to 2002 that are central to the discipline. We count the number of citations each of these articles has received and regress this count on an extensive set of characteristics of the article (i.e. article quality, article domain, title length, the use of attention grabbers and expositional clarity), and the author (i.e. author visibility and author personal promotion). We find that the number of citations an article in the marketing discipline receives, depends upon “what one says†(quality and domain), on “who says it†(author visibility and personal promotion) and not so much on “how one says it†(title length, the use of attention grabbers, and expositional clarity). Our insights contribute to the marketing literature and are relevant to scientific stakeholders, such as the management of scientific journals and individual academic scholars, as they strive to maximize citations. They are also relevant to marketing practitioners. They inform practitioners on characteristics of the academic journals in marketing and their relevance to decisions they face. On the other hand, they also raise challenges towards making our journals accessible and relevant to marketing practitioners: (1) authors visible to academics are not necessarily visible to practitioners; (2) the readability of an article may hurt academic credibility and impact, while it may be instrumental in influencing practitioners; (3) it remains questionable whether articles that academics assess to be of high quality are also managerially relevant.Impact;Citation Analysis;Referencing;Scientometrics;Cite
Correction for Fall 1984
No full textIn the Fall 1984 issue of the Southern Business Review. Dr. P. R Chandy, Assistant Professor of Finance in the College of Business Administration at North Texas State University, was credited as author of the article, A Linear Programming Model for the Selction of Optimal Government Bond Portfolios. The credits should have included the following co-authors:
Dr. Richard Cherry, Chairman
Department of Management. Marketing and Finance
College of Business
Lamar University
Mr. Thomas Anderson
Aramco Executive
Saudi Arabi
Electrical remodelling of the left and right atria due to rheumatic mitral stenosis
No full textPublished on behalf of the European Society of Cardiology. All rights reserved. © The Author 2008.AimsTo characterize the atrial remodelling in mitral stenosis (MS).Methods and resultsTwenty-four patients with severe MS undergoing commissurotomy and 24 controls were studied. Electrophysiological evaluation was performed in 12 patients in each group by positioning multi-electrode catheters in both atria to determine the following: effective refractory period (ERP) at 10 sites at 600 and 450 ms; conduction time; conduction delay at the crista terminalis (CT); and vulnerability for atrial fibrillation (AF). P-wave duration (PWD) was determined on the surface ECG. In the remaining 12 patients in each group, electroanatomic maps of both atria were created to determine conduction velocity and identify regions of low voltage and electrical silence. Patients with MS had larger left atria (LA) (P ConclusionAtrial remodelling in MS is characterized by LA enlargement, loss of myocardium, and scarring associated with widespread and site-specific conduction abnormalities and no change or an increase in ERP. These abnormalities were associated with a heightened inducibility of AF.Bobby John, Martin K. Stiles, Pawel Kuklik, Sunil T. Chandy, Glenn D. Young, Lorraine Mackenzie, Lukasz Szumowski, George Joseph, Jacob Jose, Stephen G. Worthley, Jonathan M. Kalman and Prashanthan Sander
Ensuring Public Realm Through Private- private Partnership, in the Context of Rapid Urbanization (Case of CBD area Kochi)
No full textAbstractIn the context of rapid urbanization, the lack of public space development is one of the major issues of commercial development in city cores of Kerala. The reasons of this issue are related to land division. In the present context, there are lacks of guidelines to regulate the minimum size of plot during plot subdivision. The individual plot of small size is not feasible for high density commercial development. The land reconstitutions like feasible solutions were adopted by the individual developers to develop large commercial blocks. The public spaces developed as the result of these changes are segregated, introverted and self contained entities like, space inside the commercial malls, shopping centers etc. The intent of this research is to develop the real-estate policies as an urban design tool to create an integrated public space network system in commercial core of the city, and to develop a framework of strategies for the space management models like Private-Private partnership to integrate the existing isolated hybrid spaces in to the city fabric, and to create new integrated system of public space network. A sample precinct of M.G road stretch of Kochi was taken up for demonstration after a detailed analysis of various parameters of open space such as ecology, land use, morphological pattern, and transportation infrastructure
Benchmarking checkpointing algorithms in Stream Processing Engines
No full textThe use of data streams has increased a lot over the last two decades or so. andWith this increase comes the need for fast and consistent fault recovery. Rollbackrecovery mechanisms from traditional distributed systems have been adapted successfully for stream engines. These mechanisms can be categorized into one of three different categories; uncoordinated, coordinated and communication induced protocols. While most well-known stream engines implement a variant of the coordinated Chandy-Lamport algorithm, there is no practical comparison available that actually confirms whether this is the optimal solution for data streams specifically. Compared to traditional distributed processing solutions, stream processing has a higher need for low latencies due to the continuously generated input. This paper aims to create more insight into the advantages and disadvantages of these solutions by implementing a checkpointing algorithm for each of these categories. These are then benchmarked using various workloads and evaluated using a number of metrics such as latency, throughput, recovery times and network overhead. From these results, it can be concluded that a coordinated approach indeed outperforms uncoordinated solutions across all of these metrics, most likely due to the need for message logging in both the uncoordinated and communication induced scenarios. Additionally the benchmarks indicate that the overhead of the communication induced approach does not outweigh its benefits, due to the rarity of the occurrence of the so-called domino effect.Computer Science | Web Information System
Dynamic UNITY
No full textiii The writing of a doctoral dissertation is a massive undertaking, and simply can’t be completed without the contributions and support, academic and otherwise, of many people aside from the author. I take this opportunity to acknowledge the major contributors and supporters. I am extremely grateful to my primary adviser, Professor K. Mani Chandy, for supporting me during my time at Caltech and for allowing me the freedom to explore research fields that were interesting to me and to also take on some unrelated, and sometimes time-intensive, side projects; little did I know at the beginning that my work would end up using his own as a foundation and springboard. I am also deeply grateful to Professor Jason Hickey for the incredible support, encouragement and assistance he has given me during the late stages of my work. He is my secondary adviser, but denoting him as such understates his contributions. Thanks also to Professor Jehoshua (Shuki) Bruck and Professor Alain Martin, the other two members of my committee, for their participation and feedback on my work. It has been a privilege to work with the former and current members of Professor Chandy’
Parallel algorithms for standard cell placement using simulated annealing
No full textAs modern VLSI designs have become larger and more complicated, the computational requirements for design automation tools have also increased. As a result, the parallelization of these tools is of great importance. One of the more computationally intensive parts of the entire VLSI design process is the placement process. Simulated-annealing-based approaches have been the most popular and effective methods for cell placement. In this thesis, parallelization approaches to simulated-annealing-based standard cell placement are presented.In this work, four parallel algorithms have been investigated, with two that provide scalable behavior as well as acceptable quality. The first is the parallel moves approach based on work by Kim (1,2). The second algorithm is a multiple Markov chains approach that gives nearly linear speedups with very little loss of quality. This approach is suitable for small scale multiprocessors and for circuits that are small enough to fit in the memory of a single node. The next algorithm is known as speculative computation and is not as effective. The final algorithm addresses the memory scalability problems by partitioning the circuit across the nodes. This circuit-partitioned approach provides speedups to larger numbers of processors with little loss of quality. All of the algorithms have been implemented using the ProperCAD II environment (3), and the circuit-partitioned work has also been implemented using the Message Passing Interface (MPI) (4).The placement algorithms discussed above dealt only with minimization of the wirelength and indirectly area minimization. For current high density circuits, this approach is no longer appropriate, and more performance driven techniques are needed. We have, therefore, also developed a new algorithm for sequential timing driven cell placement. Because the addition of timing driven features to standard cell placement adds significant overhead to the computation, time, we have also developed an algorithm for its parallelization.Made available in DSpace on 2011-05-07T13:11:07Z (GMT). No. of bitstreams: 2
license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5)
9712216.pdf: 3899706 bytes, checksum: 6ceb92599f2db5fa5ed6ddd7aca97b9a (MD5)
Previous issue date: 1996Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding ([email protected]) on 2011-05-07T14:51:22Z
Item is restricted indefinitely.Restriction data tranferred 2014-07-01T11:23:33-05:00
Original Data
Group with Access UIUC Users [automated]
Release Date: none
Reason: ETDs are only available to UIUC Users without author permissionETDs are only available to UIUC Users without author permissionU of I Onl
Exact and approximate solution to probabilistic models of computer system behaviour part 1
No full textNumérisation avec OCR réalisée en 2024. La reconnaissance de caractères du PDF (format PDF/A) peut comporter des erreurs. Pour toutes informations complémentaires et les partages de propriété, merci de contacter le service IES [email protected] paper is a survey of certain known results concerning networks of queues. The choice of the topices presented has been made with special emphasis on mathematical results which can be applied to the analysis and synthesis of mathematical or simulation models of complex computer Systems in which an ensemble of resources is shared among a set of user programs. The subjects covered include the Jackson, and Gordon and Newell theorems ; the work-rate theorems of Chang, Lavenberg and Traiger ; the Baskett, Chandy, Muntz, Palacios resuit, and the equivalence and decomposition technique of Courtois, and Avi-Itzhak and Heyman. A companion paper' (Part II.) will present some new results of the author concerning diffusion approximations as well as a brief review of previous work on the subject.Nous présentons dans cet article une synthèse de certains résultats mathématiques concernant les réseaux de files d'attente et qui s'appliquent à l'étude des performances des systèmes informatiques. Il s'agit, en particulier, du théorème de Baskett-Chandy-Muntz-Palacios concernant les solutions en forme de produit des équations de Chapman-Kolmogorov à l'état d'équilibre pour des réseaux de files d'attente Markoviens, des théorèmes de Chang-Lavenberg-Traiger sur les taux d'activité des serveurs , des méthodes d'équivalence et de décomposition de Avi-Itzhak, Heyman et Courtois. Nous rappelons aussi les résultats plus anciens de Jackson et de Gordon-Newell
