acm-header
Sign In

Communications of the ACM

Communications of the ACM

In the Virtual Extension


Contributed article DOI: 10.1145/1941487.1941515
Challenges and Business Models for Mobile Location-based Services and Advertising

Subhankar Dhar and Upkar Varshney

Location-based services have attracted considerable attention due to their potential to transform mobile communications and the potential for a range of highly personalized and context-aware services. Since the days of early location-tracking functionalities introduced in Japan in 2001 and in some U.S. networks, location-based services have made considerable progress.

The potential for location-based services is evident from powerful and ubiquitous wireless devices that are growing in popularity. Many surveys predict billions of dollars in revenues for mobile advertising. Mobile network operators are well positioned to take up a significant percentage of this advertising revenue as they negotiate deals with content providers. Recent deals between media companies, advertising agencies, and the Internet/software industry also demonstrate significant optimism for future growth.

However, there are many challenges that have slowed down the deployment, offering, and wide-scale adoption of location-based services. The challenges include emerging technologies, suitable applications, and business models. This article addresses both technical- and business-related challenges in location-based services, specifically in mobile advertising. The authors explore how location-based mobile advertising can generate revenues and sustain successful business models. However, they are quick to note that while mobile advertising will become more pervasive and profitable, it will not happen before key technical and business challenges are addressed.

Back to Top

Contributed article DOI: 10.1145/1941487.1941516
Is Open Source Security a Myth?

Guido Schryen

During the past few decades we became accustomed to acquiring software by procuring licenses for a proprietary or binary-only immaterial object. We regard software as a product we have to pay for, just as we would pay for material objects. However, in more recent years, this widely cultivated habit has begun to be accompanied by a software model characterized by software that comes with a compilable source code. This type of software is referred to as open source software (OSS).

While there is consensus that opening up source code to the public increases the number of reviewers, the impact of open source on software security remains controversial. While the security discussion is rife with beliefs and guesses, only a few quantitative models and some empirical studies appear in the literature; and most of those studies examine only one or a few packages.

This article presents a comprehensive empirical investigation of published vulnerabilities and patches of 17 widely deployed open source and closed source software packages. The empirical analysis uses comprehensive vulnerability data contained in the NIST National Vulnerability Database and a newly compiled data set of vulnerability patches. Based on these comprehensive data sets, this study is capable of providing empirical evidence that open source and closed source software development do not significantly differ in terms of vulnerability disclosure and vendors' patching behaviora phenomenon that has been widely assumed, but hardly investigated.

Back to Top

Contributed article DOI: 10.1145/1941487.1941517
Invisible Work in Standard Bibliometric Evaluation of Computer Science

Jacques Wainer, Siome Goldenstein, and Cleo Billa

Multidisciplinary committees routinely make strategic decisions, rule on subjects ranging from faculty promotion to grant awards, and rank and compare scientists. Though they may use different criteria for evaluations in subjects as disparate as history and medicine, it seems logical for academic institutions to group together mathematics, computer science, and electrical engineering for comparative evaluation by these committees.

These evaluations will be more frequent as the number of scientists increases. Since the number of funding sources grows more slowly, and research practices vary among different subjects, using the same criteria in different areas may produce notable injustices. The ongoing discussion on CS research evaluation helps build the case for the CS community defending itself from expected injustices in future comparative evaluations.

Traditional assessment criteria are based on Thomson Reuters' Web of Science (WoS) indexing service, quantifying the production and number of citations of individual scientists, university departments, whole universities, countries, and scientific areas.

Here, the authors provide some quantitative evidence of unfairness, defining researchers' invisible work as an estimation of all their scientific publications not indexed by WoS or Scopus. Thus, the work is not counted as part of scientists' standard bibliometric evaluations. To compare CS invisible work to that of physics, mathematics, and electrical engineering, they generated a controlled sample of 50 scientists from each of these fields and focused on the distribution of invisible work rate for each of them using statistical tests.

Back to Top

Footnotes

DOI: http://doi.acm.org/10.1145/1941487.1941490


©2011 ACM  0001-0782/11/0500  $10.00

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and full citation on the first page. Copyright for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or fee. Request permission to publish from permissions@acm.org or fax (212) 869-0481.

The Digital Library is published by the Association for Computing Machinery. Copyright © 2011 ACM, Inc.


 

No entries found