Search

The author discusses computational methods utilized in the peer review process. It examines the availability of data in peer review, and experimentation in peer review design. It also discusses author identity bias, overall subjectivity in peer review, and author incentives.

The article presents the results of a study which investigated the correlation between the acceptance rate and impact rating of conference papers in the field of computer science. The papers with the highest impact ratings were found to be associated with highly selective conferences, defined as those which rejected between 70 and 85 percent of papers submitted. Such papers, on average, had higher impact ratings than papers which were published in journals without being presented at conferences. A rejection rate of 85 percent or more tended to suppress submission levels and reduce impact factors, while an acceptance rate over 30 percent was associated with less prestigious conferences.

The article discusses the publication process for academic papers in computer science (CS) and provides a proposal for CSPub (clean-slate or computer science publication), an open-access publication system. The author identifies problems which he believes could be addressed by CSPub including low acceptance rates, the resubmission of rejected papers, and short incremental work which is published due to the demands of promotion and tenure systems.

The article discusses the status of research papers published by computer science (CS) conferences, as compared with those published in CS journals. Debate has occurred in relation to the proper way in which to qualify the research presented in a paper. Problems exist in determining the quality of research in various journals due to the wide array of publication opportunities available. A scale that has been created to measure the quality of conference papers in a variety of ways, such as citations and rejection rates, is discussed.

This article reports that research conferences are often the most desirable venues for presenting research results. For academic computer scientists and engineers, preferring conferences over journals is so common that they even lobby administrators to ensure that conference papers can be viewed in the same light as journal papers in other fields. Hence, the health of conferences is vital to the computer science research mission. One conventional indication of health is the number of submissions and the acceptance rate at the conference. Calls for papers often include encouraging words for big idea or new direction papers. The problem is that reviewers see so many regular papers it is just too difficult to switch gears and be more understanding when evaluating bolder papers with holes in arguments or missing measurements. Program committees typically start with a ranked list of papers based on the average of numerical ratings in order to cope with the large number of submissions. Big idea papers are sure to get some poor evaluations, which cause them to drop down the list.

The article presents information on self-plagiarism in computer science. Students submit assignments inherited from their friends, online paper-mills provide term papers on popular topics, and occasionally researchers are found falsifying data or publishing the work of others as their own. Self-plagiarism occurs when authors reuse portions of their previous writings in subsequent research papers. Occasionally, the derived paper is simply a retitled and reformatted version of the original one, but more frequently it is assembled from bits and pieces of previous work. Incorporating texts or ideas from previously published work while unaware of the existence of that work. Incorporating texts or ideas from previously published work when writing to a community different from that in which the original work was published. Missing from the ACM and IEEE policy documents is any discussion of what the consequences of ignoring the rules and guidelines might be and whose responsibility it is to prevent plagiarized and self-plagiarized papers from being published. In contrast, most university course syllabi address the definition of plagiarism and who will look for it, as well as its potential consequences.

The author discusses collusion rings in computer science research, and his experiences with and knowledge of attempts to undermine peer-review of computer science conference publications. According to the author, collusion rings go beyond the computer architecture field. The author describes the peer-review process, how a collusion ring works, and outlines how the computer research field should respond.

In this article, various experts on computer science (CS) offer guides relating to the best of CS research. Particular focus is given to how to determine what papers are worth taking the time to read. Additional topics discussed include the ACM (Association for Computing Machinery), how datacenters are changing the way Web servers are designed and the notion of Network Functions Virtualization (NFV).

The article discusses the lack of efficiency in how research data within the Computer Science discipline are shared. The author uses the acronym FAIR -- findable, accessible, interoperable, and reusable -- to capture how data should be made available at conferences and in journals.

The author presents an argument that the field of computer science should move away from its use of conferences as a venue for the primary publication of research papers, and adopt an approach more in line with that of other scholarly disciplines, which would involve the use of peer-reviewed journals as the primary venue for publication of original research, and conferences as a forum for professional discussions and networking.

The article offers the author's comments on a proposal by the Publications Board of the Association for Computing Machinery to bring together conference papers and publishing of journal articles on computer science research. According to the author, compared to journal reviewing, conference process has clear advantages that this proposal maintains.

The article invites papers from research scholars for several conferences related to computer science and technology.

The article discusses the deployment of machine learning technology in production environments. The authors describe the algorithms which constitute and shape machine learning protocols with a focus on papers on subjects including the MauveDB project to integrate machine learning technology into relational databases, scalable response prediction for online advertising, and optimization of neural network queries for object detection in video streams.

The article presents information on a research paper related to computer programming and debugging, which won an award in the 1981 George E. Forsythe Student Paper Competition. The research paper "A Program Testing Assistant," by David Chapman, a graduate student, was selected because of its original and incisive research into program development and debugging. The competition memorializes George E. Forsythe, president of the Association for Computing Machinery from 1964 to 1966, and leader in the development of computer science as a separate discipline. Chapman will receive a cash award of 500 dollars and a certificate. The papers of the first competition were refereed and judged by a committee of graduate students. The tradition has continued, with each competition administered by the graduate students at a major university with the assistance of a faculty advisor. For 1981, it was a committee of graduate students in computer science at Cornell University, New York, with professor David J. Gries serving as faculty advisor.

Excerpts from blogs posted on the Association for Computing Machinery (ACM) Web site are presented, as well as reader comments related to the blogs, on topics such as reading academic research papers, encouraging students to create computer programs, and the significance of Web visibility.

The Burrows-Wheeler Transform (BWT) is an invertible text transformation that permutes symbols of a text according to the lexicographical order of its suffixes. BWT is the main component of popular lossless compression programs (such as bzip2) as well as recent powerful compressed indexes (such as the r-index7), central in modern bioinformatics. The compressibility of BWT is quantified by the number r of equal-letter runs in the output. Despite the practical significance of BWT, no nontrivial upper bound on r is known. By contrast, the sizes of nearly all other known compression methods have been shown to be either always within a polylog n factor (where n is the length of the text) from z, the size of Lempel--Ziv (LZ77) parsing of the text, or much larger in the worst case (by an nε factor for ε > 0). In this paper, we show that r = O (z log² n) holds for every text. This result has numerous implications for text indexing and data compression; in particular: (1) it proves that many results related to BWT automatically apply to methods based on LZ77, for example, it is possible to obtain functionality of the suffix tree in O (z polylog n) space; (2) it shows that many text processing tasks can be solved in the optimal time assuming the text is compressible using LZ77 by a sufficiently large polylog n factor; and (3) it implies the first nontrivial relation between the number of runs in the BWT of the text and of its reverse. In addition, we provide an O (z polylog n)-time algorithm converting the LZ77 parsing into the run-length compressed BWT. To achieve this, we develop several new data structures and techniques of independent interest. In particular, we define compressed string synchronizing sets (generalizing the recently introduced powerful technique of string synchronizing sets11) and show how to efficiently construct them. Next, we propose a new variant of wavelet trees for sequences of long strings, establish a nontrivial bound on their size, and describe efficient construction algorithms. Finally, we develop new indexes that can be constructed directly from the LZ77 parsing and efficiently support pattern matching queries on text substrings. [ABSTRACT FROM AUTHOR]

The article presents tips on academic publishing for computer scientists. Specific guides to publication for the NeurIPS and VLDB conference series are offered and "maximalist" and "perfectionist" strategies for publication are compared with respect to top-tier journals and the most prestigious conferences.

The article discusses the factors that affect the sharing of research artifacts relating to computer systems according to the authors. Topics covered include the importance of sharing research artifacts for repeatability and benefaction, the research studies the evaluated the willingness of computer science researchers in sharing code and data, and details relating to the three measures of weak repeatability determined by the authors.

Invites papers to be included in conferences sponsored by the Association of Computing Machinery.

This article presents information about last date of paper submission to the various conferences related to computer industry. Symposium on Moving Boundary Problems will be organized during September 26-28, 1977, at Riverside Motor Lodge, Gatlinburg, Tennessee. Researchers can submit their papers till June 15, 1977. The symposium is sponsored by the U.S. Army Research Office and Union Carbide Corp. Fifth Annual ACM (Association for computing Machinery) SIGACT- SIGPLAN Symposium on Principles of Programming Languages will be organized from January 23-25, 1978, at Tucson, Arizona. It is sponsored by ACM SIGACT-SIGPLAN. The last date of paper submission is August 19, 1977. Fourth International Conference on Computer Communication will be organized at Kyoto, Japan, during September 26-29, 1978. It will be sponsored by International Council for Computer Communication. Papers for the conference can be submitted till November 30, 1977. Lawrence Symposium on Systems and Decision Sciences is to be held at Lawrence Hall of Science, Berkeley, California, during October 3-4, 1977. Researchers can submit their papers till June 15, 1977.

The article presents information on the professional activities of the Association for Computing Machinery (ACM). Papers describing original research are sought for the Fifteenth ACM Symposium on Theory of Computing, which is scheduled to be held from April 25, 1983 to April 27, 1983 in Boston, Massachusetts. Typical, but not exclusive, topics of interest include: algorithms and data structures; automata and formal languages; computability; complexity theory, etc. A call for participation has been issued for the Tenth Annual Conference of the ACM's Special Interest Group on Computer Graphics, which is scheduled to be held from July 25, 1983 to July 29, 1983 in Detroit, Michigan. Submissions are invited for both technical program paper and panel sessions. Previously unpublished papers in all areas of computer graphics and interactive techniques are sought. Appropriate topics include display techniques; graphics software systems and languages; graphics hardware; robotics; and any applications of graphics. Video or film material that is an integral component of the work must accompany the paper.

This article presents the form and the content of the paper most likely to be accepted for publication in a respected computer science journal in 1997 for the benefit of potential authors requiring advice on publishing of their papers. The 1st annual conference on Research in Computational Molecular Biology will take place at Santa Fe, New Mexico in January 1997. Human-Centered Design of Organizational Memory Systems will be held at Pyrenees, France in January 1997. CANPC'97: Workshop on Communication & Architectural Support For Network-Based Parallel Computing will be held at San Antonio, Texas in February 1997.

Invites research papers on Computer Science to be published in various sectors of the industry.

The article reports on some professional activities taking place in the United States related to computer science. As a cooperative venture undertaken by 15 organizations, the "National Educational Computing Conference," held in Kansas City, Missouri, has presented a major work regarding computers in instruction to promote interaction among all levels in computer uses in education. It also intends to develop and coordinate the various professional groups involved with computer uses in instruction and to produce a proceedings documenting the status of computers in education. Papers are invited from individuals representing all academic disciplines and research areas in educational computing. It further reports that papers describing original research in the formal analysis of computing problems are being sought for the "Fourteenth Annual Association for Computing Machinery Symposium on Theory of Computing," held during May 5-7, 1982, in San Francisco, California. The Fifteenth Annual Simulation Symposium is to be held during March 17-19, 1982, in Tampa, Florida. The list contains information about some other activities as well.

The article offers advice on how to make the field of computing more inclusive. Particular focus is given to how this relates to the work of the Association for Computing Machinery (ACM). Additional topics discussed include making technology accessible for people with disabilities, SIGCHI, the ACM Special Interest Group on Computer-Human Interaction, and a telepresence robots.

This article presents information on some forthcoming events related to computer science. The International Symposium on Distributed Databases will be held from March 12 to 14, 1980 in Versailles, France. The 13th Annual Simulation Symposium will be held from March 19 to 21, 1980 in Tampa, Florida. The Sixth International ALLC Symposium on Computers in Literary and Linguistic Research will be held from March 28 to April 3, 1980 at the University of Cambridge in England. The 4th International IFAC Conference on Instrumentation and Automation in the Paper, Rubber, Plastics, and Polymerization Industries will be held from June 3 to 6, 1980 in Belgium. The Seventh Conference on Electronic Computation will be held from August 6 to 8, 1979 in Saint Louis, Missouri. The IFAC Symposium on Computer Applications in Large Scale Power Systems will be held from August 16 to 18, 1979 in Bangalore, India. The Silver Anniversary International Meeting of the Society for General Systems Research will be held from August 20 to 24, 1979 in London, England.

The article presents information which provides a calendar of events on computer programming to be conducted in various parts of the world. Association for Computing Machine's (ACM) calendar policy is to list open computer science meetings that are held on a not-for-profit basis. Annual Meeting of the Australasian Association for Logic will be held on October 20-21, 1979 in Australia. Symposium on Formal Language Theory will be held in California during the period of December 13-14, 1979. Workshop on Interconnection Networks for Parallel and Distributed Processing will be conducted during April 21-22, 1980. The 4th International Symposium on Programming will be conducted during April 20-22, 1980 in France.

This article focuses on news briefs related to the March 1977 issue of the journal "Communications of the ACM." The committee invites students whose Bachelor degrees will not have been received before April 1, 1977 to submit papers. High school students are also eligible to participate in the competition. The Awards Committee reminds members of the Association that it welcomes awards candidates suggested by ACM members. The 1977 edition of the Administrative Directory of Chairmen of University and College Computer Science Departments and Directors of Computer Centers has been published by ACM. The Awards Committee reminds members of the Association that it welcomes awards candidates suggested by ACM members. The 1977 edition of the Administrative Directory of Chairmen of University and College Computer Science Departments and Directors of Computer Centers has been published by ACM.

Analyzes the proposed American Standard Vocabulary of Information Processing and the Vocabulary of Terms Used in Information Processing developed by the Federation for Information Processing and the International Computation Centre. Influence of earlier works on the vocabularies; Distinctive contributions; Caliber of the technical experts involved and the prestige of the sponsoring organizations.

The article discusses the conference peer-review process and ways in which it can be improved. Because it has become impossible to distinguish valid research papers from hoaxes at jargon-filled high-technology computer conferences, the author suggests that the quality of computer science conferences is being questioned. He proposes a systematic understanding of quality assurance at computer conferences as a phenomenon that needs analysis and a solution with a look at responsibility and ethics among professionals.

This article focuses on conferences related to computer programs. Architecture. The program for the Fourth Annual Symposium on Computer Architecture, sponsored by ACM SIGARCH and IEEEes and scheduled for March 23-25 at the Sheraton Silver Spring Motor Inn, Silver Spring, Maryland, will include two special tutorials: Microprocessor Architecture at the Chip Level and Microprocessor System Architecture: Application to Industrial Control; The 1977 IEEE Workshop on Picture Data Description and Management will be held April 21-22,The 1977 IEEE International Symposium on Information Theory will be held on the campus of Cornell University, Ithaca, New York, on October 10-14, 1977. 1977 at the Sheraton-Chicago Hotel. Its program, consisting of invited and contributed papers and panel discussions, will include sessions on: vector graphics; picture description and parsing techniques; pictorial databases; picture machines and image processors.

Similarity search is a fundamental algorithmic primitive, widely used in many computer science disciplines. Given a set of points S and a radius parameter r > 0, the r-near neighbor (r-NN) problem asks for a data structure that, given any query point q, returns a point p within distance at most r from q. In this paper, we study the r-NN problem in the light of individual fairness and providing equal opportunities: all points that are within distance r from the query should have the same probability to be returned. The problem is of special interest in high dimensions, where Locality Sensitive Hashing (LSH), the theoretically leading approach to similarity search, does not provide any fairness guarantee. In this work, we show that LSH-based algorithms can be made fair, without a significant loss in efficiency. We propose several efficient data structures for the exact and approximate variants of the fair NN problem. Our approach works more generally for sampling uniformly from a subcollection of sets of a given collection and can be used in a few other applications. We also carried out an experimental evaluation that highlights the inherent unfairness of existing NN data structures. [ABSTRACT FROM AUTHOR]