Search

These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]

These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]

These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM PUBLISHER]

The ACM Richard Tapia Celebration of Diversity in Computing is the premier venue to acknowledge, promote, and celebrate diversity in computing. This paper provides an overview of the history of the conference and some of the outcomes of the conference in terms of benefits to the diverse community in computing. The Tapia conference also provides a venue for presenting the following awards: the CMD-IT University Award for Retention of Minorities and Students with Disabilities in Computer Science and the Richard A. Tapia Achievement Award for Scientific Scholarship, Civic Science and Diversifying Computing. The Tapia Conferences are sponsored by the Association for Computing Machinery and presented by the Center for Minorities and People With Disabilities in Information Technology (CMD-IT). [ABSTRACT FROM AUTHOR]

A set of $k~(\geqslant 2)$ spanning trees in the underlying graph of a network topology is called completely independent spanning trees, (CISTs for short), if they are pairwise edge-disjoint and inner-node-disjoint. Particularly, if $k=2$ , the two CISTs are called a dual-CIST. However, it has been proved that determining if there exists a dual-CIST in a graph is an NP-hard problem. Kwong et al. [IEEE/ACM Transactions Networking 19(5) 1543–1556, 2011] defined that a routing is protected, if there is an alternate with loop-free forwarding, when a single link or node failure occurs. Shortly afterward, Tapolcai [Optim. Lett. 7(4) 723–730, 2013] showed that a network possessing a dual-CIST suffices to establish a protection routing. It is well-known that Cayley graphs have a large number of desirable properties of interconnection networks. Although many results of constructing dual-CISTs on interconnection networks have been proposed in the literature, so far, the work has not been dealt with on Cayley graphs due to that their expansions are in exponential scalability. In this paper, we try to make a breakthrough of this work on some famous subclasses of Cayley graphs, including alternating group networks, bubble-sort network, and star networks. We first propose tree searching algorithms for helping the construction of dual-CISTs on low-dimensional networks. Then, by inductive construction, we show that dual-CISTs on high-dimensional networks can also be constructed agreeably. As a result, we can configure protection routings by using the constructed dual-CISTs. In addition, we complement some analysis with a simulation study of the proposed construction to evaluate the corresponding performance. [ABSTRACT FROM AUTHOR]

In this paper, we develop a novel angle-domain adaptive filtering (ADAF)-based frequency synchronization method for the uplink of a massive multiple-input multiple-output multiuser network, which is applicable for users with either separate or overlapped angle-of-arrival (AoA) regions. For each user, we first introduce the angle-constraining matrix (ACM), which consists of a set of selected match-filter beamformers pointing to the AoAs of the interested user. Then, the adaptive beamformers can be acquired by appropriately designing the ADAF vectors. Such beamformer can achieve two-stage adaptive multiuser interference (MUI) suppression, i.e., inherently suppressing the MUI from non-overlapping users by ACM in the first stage and substantially mitigating the MUI from adjacent overlapping users by ADAF vectors in the second stage. For both separate and mutually overlapping users, the carrier frequency offset (CFO) estimation and subsequent data detection can be performed independently for each user, which significantly reduces computational complexity. Moreover, ADAF is rather robust to imperfect AoA knowledge and side cluster of scatterers, making itself promising for multiuser uplink transmission. We also analyze the performance of CFO estimation and obtain an approximated closed-form expression of mean-squared error. The effectiveness of the proposed method and its superiority over the existing methods are demonstrated by numerical results. [ABSTRACT FROM AUTHOR]

This article describes the new ACM International Conference on Interactive Experiences for Television and Online Video (ACM TVX) and provides a recap of the 1st ACM TVX, which took place in Newcastle Upon Tyne, UK, from 25-27 June 2014. [ABSTRACT FROM PUBLISHER]

These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]

These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]

These instructions give guidelines for preparing papers for this publication. Presents information for authors publishing in this journal. [ABSTRACT FROM AUTHOR]

The article offers information on the Ken Kennedy Award offered by the Institute of Electrical & Electronics Engineers (IEEE) Computer Society and the Association for Computing Machinery (ACM). Ken Kennedy is also described, noting that he was the founder of the computer science program at Rice University and was seen as an international expert in the field of high-performance computing.

A biography of Bernard A. Galler, first editor in chief of the "Annals of the History of Computing" is presented. He was bor in Chicago, Illinois in October 1928 to well-educated Jewish parents, Morris and Polia Galler. He met his future wife, Enid Harris, while attending the University of Chicago. He was involved with the Association for Computing Machinery (ACM). He steeped up to become the associated director of the computing center in 1966.

This article presents information on the need to evaluate different methods of developing software. According to the Software Engineering section of the Association for Computing Machinery, software development requires choosing the tools, methods and approaches that are most applicable for a given development environment. A group of new development methods have evolved under the general label "agile development." The agile movement includes several distinct and competing methodologies. It is further noted in the article that the software engineering practitioners should develop an awareness of and skill in performing ethical analysis in order to evaluate development methods from a more sophisticated perspective.

The article focuses on the work of Edmund Berkeley,organizer of the Association of Computing Machinery in 1947, on symbolic logic and explores how this knowledge shaped his ideas about early electronic computers. The study also explores how he applied symbolic logic and human reasoning to the design of relay computers. He is also known as the president of Berkeley Enterprises, through which he marketed computer kits such as the Simple Simon and Brainiac, as well as kits for Squee the robot squirrel and automatic learning machines. He also wrote the first popular book on electronic computers, "Giant Brains or Machines That Think," and edited the journal "Computers and Automation." Berkeley began to apply symbolic logic to insurance decisions about classes of people in the 1930s, in an effort to prove that human computers using mathematical logic could make better business decisions than they could using only standard actuarial calculations. His attempts to introduce an electronic computer into the Prudential Insurance Co. operations after World War II foundered on questions of this new machine's ability to handle routine actuarial and accounting work more efficiently than the existing IBM punched card system.

Reports that the IEEE Computer Society and the Association of Computing Machinery approved the Software Engineering Code of Ethics and Professional Practice. Approval as consensus of two of the largest bodies of computing professionals in the world; Projects to help define the software engineering profession.