25 results
Search Results
2. Quantum clustering drives innovations: A bibliometric and patentometric analysis.
- Author
-
Deshmukh, Shradha and Mulay, Preeti
- Subjects
- *
BIBLIOMETRICS , *QUANTUM computing , *PATENT applications , *ELECTRONICS engineers , *COMPUTER science - Abstract
The paper presents a bibliometric analysis from 2014 to 2020 of the emerging and engaging field of quantum computing called Quantum Machine Learning (QML). The study discusses the analysis results from the comprehensive high indexed databases worldwide such as Institute of Electrical and Electronics Engineers (IEEE), Scopus, Web of Science (WOS), Google Scholar and the Association for Computing Machinery (ACM). Tools like iMapbuilder, IBM and SPSS Statistics are used to provide meaningful insights and flawless representations of the extracted data. There has been little research to provide a macroscopic overview of renowned authors, subject areas, funding agencies and patent applications related to Quantum Clustering (QC). The result and analysis of this study show an interesting fact, most researchers are now aware of quantum technology from the past few years. The purpose of bibliometric and patentometric analysis papers is to figure out the importance and utility of the QC research area. Most of the countries are taking an initiative to seek attention towards QC but the analysis shows that China and the US are leading. The survey revealed that the maximum numbers of publications of QC are from Physics and Astronomy followed by Computer Science. [ABSTRACT FROM AUTHOR]
- Published
- 2021
3. Quantum clustering drives innovations: A bibliometric and patentometric analysis.
- Author
-
Deshmukh, Shradha and Mulay, Preeti
- Subjects
- *
BIBLIOMETRICS , *QUANTUM computing , *PATENT applications , *ELECTRONICS engineers , *COMPUTER science - Abstract
The paper presents a bibliometric analysis from 2014 to 2020 of the emerging and engaging field of quantum computing called Quantum Machine Learning (QML). The study discusses the analysis results from the comprehensive high indexed databases worldwide such as Institute of Electrical and Electronics Engineers (IEEE), Scopus, Web of Science (WOS), Google Scholar and the Association for Computing Machinery (ACM). Tools like iMapbuilder, IBM and SPSS Statistics are used to provide meaningful insights and flawless representations of the extracted data. There has been little research to provide a macroscopic overview of renowned authors, subject areas, funding agencies and patent applications related to Quantum Clustering (QC). The result and analysis of this study show an interesting fact, most researchers are now aware of quantum technology from the past few years. The purpose of bibliometric and patentometric analysis papers is to figure out the importance and utility of the QC research area. Most of the countries are taking an initiative to seek attention towards QC but the analysis shows that China and the US are leading. The survey revealed that the maximum numbers of publications of QC are from Physics and Astronomy followed by Computer Science. [ABSTRACT FROM AUTHOR]
- Published
- 2021
4. Sharing Ideas, Writing Apps, and Creating a Professional Web Presence.
- Author
-
Guzdial, Mark
- Subjects
- *
BLOGS , *RESEARCH papers (Students) , *AUTOMATION , *COMPUTER science , *IPHONE software - Abstract
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.
- Published
- 2009
- Full Text
- View/download PDF
5. Introducing Research for Practice.
- Author
-
BAILIS, PETER, PETER, SIMON, and SHERRY, JUSTINE
- Subjects
- *
COMPUTER science research , *SERVER farms (Computer network management) , *HISTORY of technology , *COMPUTER science , *TWENTY-first century - Abstract
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).
- Published
- 2016
- Full Text
- View/download PDF
6. Abstracts from Other ACM Publications.
- Subjects
- *
COMPUTER science , *PUBLICATIONS , *DISTRIBUTED computing , *COMPUTER networks , *TELECOMMUNICATION systems - Abstract
The article presents some abstracts of papers related to computer science which appeared in the publications of the Association for Computing Machinery. The first abstract entitled "A Complexity Theory Based on Boolean Algebra," by S. Skyum and L.G. Valiant, was published in the April 1985 issue of the "Journal of the ACM." According to the paper, a projection of a Boolean function is a function obtained by substituting for each of its variables a variable, the negation of a variable, or a constant. The abstract entitled"Optimal Static Load Balancing in Distributed Computer Systems," by Asser N. Tantawi and Don Towsley, was published in the April 1985 issue of the "Journal of the ACM." According to this paper, a distributed computer system that consists of a set of heterogeneous host computers connected in an arbitrary fashion by a communications network is considered. A general model is developed for such a distributed computer system, in which the host computers and the communications network are represented by product-form queuing networks.
- Published
- 1985
7. professional activities.
- Subjects
- *
INFORMATION technology , *COMPUTER science , *CONFERENCES & conventions , *COMPUTER graphics - Abstract
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.
- Published
- 1982
8. Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs.
- Author
-
Le, Hoang-Oanh and Le, Van Bang
- Subjects
- *
PLANAR graphs , *BIPARTITE graphs , *GRAPH algorithms , *HARDNESS , *COMPUTER science , *ALGORITHMS - Abstract
Let B = (X , Y , E) be a bipartite graph. A half-square of B has one color class of B as vertex set, say X; two vertices are adjacent whenever they have a common neighbor in Y. Every planar graph is a half-square of a planar bipartite graph, namely of its subdivision. Until recently, only half-squares of planar bipartite graphs, also known as map graphs (Chen et al., in: Proceedings of the thirtieth annual ACM symposium on the theory of computing, STOC '98, pp 514–523. 10.1145/276698.276865, 1998; J ACM 49(2):127–138. 10.1145/506147.506148, 2002), have been investigated, and the most discussed problem is whether it is possible to recognize these graphs faster and simpler than Thorup's O (n 120) -time algorithm (Thorup, in: Proceedings of the 39th IEEE symposium on foundations of computer science (FOCS), pp 396–405. 10.1109/SFCS.1998.743490, 1998). In this paper, we identify the first hardness case, namely that deciding if a graph is a half-square of a balanced bisplit graph is NP-complete. (Balanced bisplit graphs form a proper subclass of star convex bipartite graphs). For classical subclasses of tree convex bipartite graphs such as biconvex, convex, and chordal bipartite graphs, we give good structural characterizations of their half-squares that imply efficient recognition algorithms. As a by-product, we obtain new characterizations of unit interval graphs, interval graphs, and of strongly chordal graphs in terms of half-squares of biconvex bipartite, convex bipartite, and of chordal bipartite graphs, respectively. Good characterizations of half-squares of star convex and star biconvex bipartite graphs are also given, giving linear-time recognition algorithms for these half-squares. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
9. New Tools and Connections for Exponential-Time Approximation.
- Author
-
Bansal, Nikhil, Chalermsook, Parinya, Laekhanukit, Bundit, Nanongkai, Danupon, and Nederlof, Jesper
- Subjects
- *
HYPERGRAPHS , *APPROXIMATION algorithms , *INDEPENDENT sets , *GRAPH algorithms , *COMBINATORICS , *COMPUTER science , *GEOMETRIC connections - Abstract
In this paper, we develop new tools and connections for exponential time approximation. In this setting, we are given a problem instance and an integer r > 1 , and the goal is to design an approximation algorithm with the fastest possible running time. We give randomized algorithms that establish an approximation ratio of r for maximum independent set in O ∗ (exp (O ~ (n / r log 2 r + r log 2 r))) time, r for chromatic number in O ∗ (exp (O ~ (n / r log r + r log 2 r))) time, (2 - 1 / r) for minimum vertex cover in O ∗ (exp (n / r Ω (r))) time, and (k - 1 / r) for minimum k-hypergraph vertex cover in O ∗ (exp (n / (k r) Ω (k r))) time. (Throughout, O ~ and O ∗ omit polyloglog (r) and factors polynomial in the input size, respectively.) The best known time bounds for all problems were O ∗ (2 n / r) (Bourgeois et al. in Discret Appl Math 159(17):1954–1970, 2011; Cygan et al. in Exponential-time approximation of hard problems, 2008). For maximum independent set and chromatic number, these bounds were complemented by exp (n 1 - o (1) / r 1 + o (1)) lower bounds (under the Exponential Time Hypothesis (ETH)) (Chalermsook et al. in Foundations of computer science, FOCS, pp. 370–379, 2013; Laekhanukit in Inapproximability of combinatorial problems in subexponential-time. Ph.D. thesis, 2014). Our results show that the naturally-looking O ∗ (2 n / r) bounds are not tight for all these problems. The key to these results is a sparsification procedure that reduces a problem to a bounded-degree variant, allowing the use of approximation algorithms for bounded-degree graphs. To obtain the first two results, we introduce a new randomized branching rule. Finally, we show a connection between PCP parameters and exponential-time approximation algorithms. This connection together with our independent set algorithm refute the possibility to overly reduce the size of Chan's PCP (Chan in J. ACM 63(3):27:1–27:32, 2016). It also implies that a (significant) improvement over our result will refute the gap-ETH conjecture (Dinur in Electron Colloq Comput Complex (ECCC) 23:128, 2016; Manurangsi and Raghavendra in A birthday repetition theorem and complexity of approximating dense CSPs, 2016). [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
10. Exploration of polygons in online social networks.
- Author
-
Zhou, Xiaoping, Liang, Xun, Zhao, Jichao, Zhiyuli, Aakas, and Zhang, Haiyan
- Subjects
- *
ONLINE social networks , *GRAPH theory , *POLYGONS , *SOCIAL networks , *SCIENCE conferences , *COMPUTER science - Abstract
Online social networks have continued to attract increased attention since the introduction of this concept nearly three decades ago. Consequently, a study about the workings of online social networks may help in understanding the structure of human society and the characteristics of generic complex networks. Over the past few years, interest in neighboring nodes, which are the number of nodes between any two nodes, the number of neighbors and how many triangles are present in a social network have produced the concepts of a six-degree separation (Milgram, Psychol Today 2(1):60–67, 1967; Backstrom et al., Proceedings of the 4th annual ACM web science conference, p 33–42, 2012), a heavy tail in the degree distribution (Barabási, Albert, Science 286(5439):509–512, 1999) and a high clustering coefficient (Luce, Perry, Psychometrika 14(2):95–116, 1949; Watts, Strogatz, Nature 393(6684):440–442, 1998; Amaral et al., Proc Natl Acad Sci USA 97(21):11149–11152, 2000). In a similar manner, researchers have also been curious about how many polygons are present in a given online social network. Although much effort has been expended (Dantzig et al., International symposium on theory of graphs, p 77–83, 1967; Kamae, IEEE Trans Circuit Theory 14(2):166–171, 1967; Gotlieb, Corneil, Commun ACM 10(12):780–783, 1967; Welch, J ACM 13(2):205–210, 1966; Tiernan, Commun ACM 13(12):722–726, 1970; Tarjan, SIAM J Comput 2(3):211–216, 1973; Johnson, SIAM J Comput 4:77–84, 1975; Mateti, Deo, SIAM J Comput 5(5):90–99, 1976; Marinari et al., Europhys Lett 73(3):301–307, 2005), studying this subject, the inability to enumerate polygons has stymied an in depth understanding of the properties of polygons in an online social network. In the study described in this paper, the estimated number of polygons in an online social network is revealed. It was found that in the current widely used online social networks, e.g., Facebook, Twitter, the number of polygons increases drastically when the length of a polygon is below a set value and then it decreases rapidly. The average length of the network polygons was calculated and it was found that online social networks contain a relatively large average length of polygons. Based on this perspective, a massive labyrinth of polygons would make the online social networks appear to be very complicated. To further investigate this area, a generalized clustering coefficient was explored. Results showed that the generalized clustering coefficient appeared to descend exponentially with the length of polygon and expeditiously approached zero. This result suggested that the polygons with large lengths should be ignored in many scenarios. Since the polygons with lengths greater than five appeared to have little impact on the network, the online social networks appeared to be less complex than anticipated. The polygon is one of the fundamental problems in graph theory and complex networks, so that the work reported here may be beneficial for many disciplines, including transportation [7], engineering [8], computer science [9–16], physics (Birmelé et al., Proceedings of the 24th annual ACM–SIAM symposium on discrete algorithms, p 1884–1896, 2013), sociology (Motter, Albert, Phys Today 65:43, 2012), epidemiology (Feld, Am J Sociol 96(6):1464–1477, 1991; Cohen et al., Phys Rev Lett 91(24):12343, 2002), psychology (Sun et al., Sci Rep 4(6188):5099–5099, 2014), biology (Feiler, Kleinbaum, Psychol Sci, 2015), medicine (Kincaid, Pilette, Comput Appl Biosci Cabios 8:267–273, 1992), geography (Kim et al., Lancet 386(9989):145–153, 2015), etc. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
11. Abstracts from Other ACM Publications.
- Subjects
- *
COMPUTER science , *PUBLICATIONS , *INFORMATION technology , *DISTRIBUTED computing , *SIMULATION methods & models - Abstract
The article presents abstracts of research papers related to computer science, which have been published in various publications of the Association for Computing Machinery. The research paper "Complexity of Network Synchronization," examines the problem of simulating a synchronous network by an asynchronous network. A new simulation technique, referred to as a synchronizer, which is a new, simple methodology for designing efficient distributed algorithms in asynchronous networks, has been proposed. The synchronizer exhibits a trade-off between its communication and time complexities, which is proved to be within a constant factor of the lower bound. The article "How to Assign Votes in a Distributed System," discusses distributed processing. In a distributed system, one strategy for achieving mutual exclusion of groups of nodes without communication is to assign to each node a number of votes. Only a group with a majority of votes can execute the critical operations, and mutual exclusion is achieved because at any given time there is at most one such group.
- Published
- 1985
12. Abstracts from Other ACM Publications.
- Subjects
- *
COMPUTER science , *PUBLICATIONS , *DATA structures , *ELECTRONIC file management , *DATABASES - Abstract
The article presents some abstracts of papers related to computer science which appeared in other publications of the Association for Computing Machinery . The abstract entitled "Generating Binary Trees Using Rotations," by David Zerling, was published in the July 1985 issue of the "Journal of the ACM." In this paper, the authors developed a new algorithm that, for the first time, exploited the rotational geometry of binary trees to enable to lexicographically generate the computer representations of these trees in average time O(1) per tree. The abstract entitled "Uniform Hashing is Optimal," by Andrew C. Yao, was published in the July 1985 issue of the "Journal of the ACM." The abstract entitled "Adding Range Restriction Capability to Dynamic Data Structures," by Dan E. Willard and George S. Lueker, was published in the July 1985 issue of the "Journal of the ACM." According to this paper, a database is said to allow range restrictions if one may request that only records with some specified field in a specified range be considered when answering a given query.
- Published
- 1985
13. professional activities.
- Subjects
- *
CONFERENCES & conventions , *COMPUTER simulation , *COMPUTER science , *JOINT ventures - Abstract
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.
- Published
- 1981
14. Towards a Historical Notion of ‘Turing—the Father of Computer Science’.
- Author
-
Daylight, Edgar G.
- Subjects
- *
COMPUTER science , *SCHOLARS , *HISTORY - Abstract
In the popular imagination, the relevance of Turing's theoretical ideas to people producing actual machines was significant and appreciated by everybody involved in computing from the moment he published his 1936 paper ‘On Computable Numbers’. Careful historians are aware that this popular conception is deeply misleading. We know from previous work by Campbell-Kelly, Aspray, Akera, Olley, Priestley, Daylight, Mounier-Kuhn, Haigh, and others that several computing pioneers, including Aiken, Eckert, Mauchly, and Zuse, did not depend on (let alone were they aware of) Turing's 1936 universal-machine concept. Furthermore, it is not clear whether any substance in von Neumann's celebrated 1945 ‘First Draft Report on the EDVAC’ is influenced in any identifiable way by Turing's work. This raises the questions: (i) When does Turing enter the field? (ii) Why did the Association for Computing Machinery (ACM) honor Turing by associating his name to ACM's most prestigious award, the Turing Award? Previous authors have been rather vague about these questions, suggesting some date between 1950 and the early 1960s as the point at which Turing is retroactively integrated into the foundations of computing and associating him in some way with the movement to develop something that people call computer science. In this paper, based on detailed examination of hitherto overlooked primary sources, attempts are made to reconstruct networks of scholars and ideas prevalent in the 1950s, and to identify a specific group ofactors interested in theorizing about computations in computers and attracted to the idea of language as a frame in which to understand computation. By going back to Turing's 1936 paper and, more importantly, to re-cast versions of Turing's work published during the 1950s (Rosenbloom, Kleene, Markov), I identify the factors that made this group of scholars particularly interested in Turing's work and provided the original vector by which Turing became to be appreciated in retrospect as the father of computer science. [ABSTRACT FROM PUBLISHER]
- Published
- 2015
- Full Text
- View/download PDF
15. Top 10 Downloads from ACM's Digital Library.
- Subjects
- *
DIGITAL libraries , *COMPUTER science , *COMPUTER programming , *PROGRAMMING languages , *SYSTEMS software - Abstract
The article presents a list of papers, courses and magazines downloaded, in July 2005, from the Association of Computing Machinery's digital library. Some of the papers that were downloaded are: "Architectures for a Temporal Workflow Management System," by Carlo Combi, Giuseppe Pozzi and published in the March 2004 issue of the journal "Proceedings of the 2004 ACM Symposium on Applied Computing"; and "The Google File System," by Sanjay Ghemawat, Howard Gobioff and Shun-Tak Leung and published in the October 2003 issue of the journal "Proceedings of the 19th ACM Symposium on Operating Systems Principles." Some of the courses that were downloaded are: Introduction to the Java Programming Language; UML Fundamentals; Data Modeling; Beginning to Program With the Java Programming Language; Project Management: Initiation and Plan Launch; and Basic Programming in C.
- Published
- 2005
- Full Text
- View/download PDF
16. acm news.
- Subjects
- *
ASSOCIATIONS, institutions, etc. , *PRESSURE groups , *COMPUTER science , *COMPUTER users , *EDUCATION - Abstract
This article reports on recent developments related to the Association for Computing Machinery (ACM). The ACM Nominating Committee is preparing to nominate candidates for Regional Representatives to Council from the Northeast, North Central, Pacific, and South Central regions. The elected representatives--one from each region--will serve a three-year term effective from June 1, 1975. The Special Interest Group on Computer Uses in Education has proposed two sessions for ACM 74. A session of four technical papers has been proposed. These four papers exhibit a rich variety of types of computer use in learning. One emphasizes the technique of artificial intelligence. Another paper by a Japanese author describes an ambitious computer managed system. The third paper illustrates a system that couples tape recorders to a minicomputer. And the fourth paper suggests the important role of the computer in self-paced courses. A new Committee on International Scientific and Technical Information Programs has been established within the Commission on International Relations of the National Academy of Sciences--National Research Council.
- Published
- 1974
17. Finding Themes.
- Author
-
Krakovsky, Marina
- Subjects
- *
DIGITAL humanities , *COMPUTER engineering , *COMPUTER science - Abstract
An interview with David Blei, a professor at Columbia University and a recipient of the Association for Computing Machinery (ACM)-Infosys Foundation Award, is presented. He discusses his 2003 paper on latent Dirichlet allocation (LDA). He talks about his favorite applications of LDA, such as its uses is in the digital humanities. He also discusses the Bayesian nonparametric methods and approximate posterior inference that he is working on.
- Published
- 2014
- Full Text
- View/download PDF
18. Top 10 Downloads from ACM's Digital Library.
- Subjects
- *
COMPUTER architecture , *INFORMATION technology , *COMPUTER-generated imagery , *COMPUTERS , *COMPUTER science - Abstract
The article presents information on some of the most popular papers from ACM's refereed journals and conference proceedings. Some of these topics are "Architectures for a Temporal Workflow Management System," "Piecewise-linear Surface Approximation from Noisy Scattered Samples," "Case Studies on Testing Object-Oriented Programs," "Distributed Ray Tracing," "Security in Embedded Systems," "UML Fundamentals," "Project Management: Initiation and Plan Launch," "The Profession of IT: Who are We," "Emerging Business Models for Mobile Brokerage Services," and "Physically-Based Computer Animation."
- Published
- 2005
- Full Text
- View/download PDF
19. Peter Wegner Reviews the Changing Image of Computing Surveys.
- Subjects
- *
COMPUTER science , *TECHNOLOGICAL innovations , *ELECTRONIC publishing , *ELECTRONIC information resources - Abstract
The article presents a review of the changing image of the periodical "Computing Surveys." During the last 2 years, Computing Surveys has introduced short, 2-page papers to complement the long 30- to 50- page traditional papers. Association of Computing Machinery (ACM)'s 50th anniversary year was commemorated with two special issues, one on perspectives in computing (March, 1996), examining current technology and one on strategic directions in computing (December, 1996) looking towards the future. The December, 1996 issue of the periodical demonstrates the feasibility of joint hard copy/electronic publication. It is economically feasible to publish a 1000-page special issue of which about 300 pages appear in hard copy and the remainder electronically. The ACM electronic repository in www.acm.org will increasingly supplement its hard-copy publications with electronic value. One of the side effects of short articles is to make "Computing Surveys" more participatory. Another participatory activity designed to recognize student talent is the ACM student paper competition.
- Published
- 1997
20. president's letter - YOU ARE THE FUTURE OF HISTORY.
- Author
-
Kocher, Bryan and Bruemmer, Bruce H.
- Subjects
- *
ARCHIVAL institutes & workshops , *COMPUTER science , *RECORDS management , *UNIVERSITIES & colleges - Abstract
The article focuses on the death of Edmund C. Berkeley, principal founder of the Association for Computing Machinery (ACM), and the preservation of Berkeley's records and papers at the Charles Babbage Institute (CBI) in the University of Minnesota. The records date from the 1940s and contain correspondence, memoranda and subject files on the ethical use of computers, education in computing and computer programming languages. The author described the aim of the CBI to preserve valuable historical records and collections relating to computer organizations and professionals.
- Published
- 1989
- Full Text
- View/download PDF
21. ACM News.
- Subjects
- *
COMPUTER science , *MEETINGS , *NEWSLETTERS , *HIGHER education , *BUSINESS communication - Abstract
The article presents news briefs related to the Association for Computing Machinery (ACM). Focusing on 1985 regional representatives election results, it states that regional representatives have been elected to serve from July 1, 1985, to June 30, 1988. Herbert Maisel has been appointed chairman of the Ad hoc Committee on Inter-society Liaison. Maisel is also a Council Member-at-Large and the chairman of the External Activities Board. The Berlin Continuing Engineering Education Program is offering its fall series of seminars on industrial electronics and robotics in Berlin. At its March 13, 1985 meeting the Executive Committee of the ACM approved joint membership agreements with the "Beigisch Instituut voor Regeltechniek en Automatizering" (BIRA). These agreements will take effect from July 1, 1985. Members of the BIRA are accepted as voting Members of ACM. It also notes that the technical contributions appearing in the ACM journals are normally original papers that have not been published elsewhere. Widely disseminated conference proceedings and newsletters are a form of publication, although they are usually only semi archival and are often unrefered.
- Published
- 1985
22. Editorial Definition for Computing Practices.
- Author
-
Sibley, Edgar H. and Aiken, Robert M.
- Subjects
- *
NEWSPAPER sections, columns, etc. , *COMPUTER systems , *ELECTRONIC data processing , *COMPUTER science - Abstract
This article offers information on the Computing Practices section of the magazine "Communications of the ACM." The section focuses on articles with a message about general ideas and techniques that can be transferred from one place to another. Instead of technical papers, the section concentrates on discussions of how, what, why and when to use the computing methods and systems. Topics that cover areas of interest to readers of the section include improvement of the systems design process, future of computing, and implication of new theory to application systems.
- Published
- 1980
23. Editorial Policy.
- Author
-
Denning, Peter J.
- Subjects
- *
JOURNALISTIC editing , *EDUCATIONAL technology , *EDUCATIONAL surveys , *COMPUTER science - Abstract
The article presents information about the editorial policy of the journal ACM Computing Surveys. The author provides a brief background of the journal focusing on its emergence and purpose. In the late 1960s the U.S.-based Association of Computing Machinery perceived a need to provide a journal to its members to help them discover new specialties, and to help practitioners stay abreast. The journal began publication in March 1969 with Bill Dorn as editor-in chief and Myrtle Kellington as executive editor. The difference between surveys and tutorials are analyzed in the article. The main difference is that a survey paper assumes its audience has a general knowledge of the field, it emphasizes an overall view of the literature. A tutorial assumes its audience is inexpert; it emphasizes the basic concepts of the field. The primary purpose of a survey is a guided tour through the literature in an area, while the purpose of a tutorial is explaining a topic's basic concept. The author throws some light on the choice of publications in the journal.
- Published
- 1977
- Full Text
- View/download PDF
24. ACM Proceedings and Special Publications.
- Subjects
- *
COMPUTER operating systems , *COMPUTER architecture , *COMPUTER software , *PROGRAMMING languages , *COMPUTER science , *BIBLIOGRAPHY - Abstract
The article lists several publications from the Association for Computing Machinery (ACM). Some of them are Proceedings of the Symposium on Architectural Support for Programming Languages and Operating Systems; Abstracts of the 1982 ACM Computer Science Conference; The Papers of the Thirteenth SIGCSE Technical Symposium on Computer Science Education; 1981 Winter Simulation Conference Proceedings; ACM 81 Conference Proceedings; Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture.
- Published
- 1982
25. acm news.
- Subjects
- *
AWARDS , *COMPUTER science , *PROGRAMMING languages - Abstract
The article presents information related to the winners of various awards in computer science. The winner of the 1977 Turing Award is John Backus of International Business Machines Corp. Presented to an individual selected for his contributions of a technical nature made to the computing community, the Turing Award is Association of Computing Machinery's (ACM) most prestigious technical award. It is being given to Backus for profound, influential, and lasting contributions to the design of practical high-level programming systems, notably through his work on Fortran, and for seminal publication of formal procedures for the specification of programming languages. The ACM Council has voted to double the amount of the Turing Award to $2000 effective with the next winner. The requirements on the part of the recipient, to give a lecture at the annual ACM meeting and to present a paper for publication, remain the same.
- Published
- 1977
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.