IEEE Computer Society Career Center

Marking the 75th anniversary of the IEEE Computer Society (CS), Computer is launching this new President's Profile format and has asked Megha Ben, the chair of IEEE CS's Student and Young Professional Activities, to talk with CS President Forrest Shull about how his active volunteering experiences - including as IEEE Software's editor in chief and a Board of Governors member - have shaped his leadership style, career, and vision for the future. Sharing his experiences and driving technical interests, he highlights his priorities for the coming year, including increasing the Society's focus on the needs of the student and young professional members, given the key role they play in our future success.

With parallel and distributed computing (PDC) now wide-spread, modern computing programs must incorporate PDC within the curriculum. ACM and IEEE Computer Society's Computer Science curricular guidelines have recommended exposure to PDC concepts since 2013. More recently, a variety of initiatives have made PDC curricular content, lectures, and labs freely available for undergraduate computer science programs. Despite these efforts, progress in ensuring computer science students graduate with sufficient PDC exposure has been uneven.This paper discusses the impact of ABET's revised criteria that have required exposure to PDC to achieve accreditation for computer science programs since 2018. The authors reviewed 20 top ABET-accredited computer science programs and analyzed how they covered the required PDC components in their curricula. Using their own institutions as case studies, the authors examine in detail how three different ABET-accredited computer science programs covered PDC using different approaches, yet meeting the PDC requirements of these ABET criteria. The paper also shows how ACM/IEEE Computer Society curricular guidelines for computer engineering and software engineering programs, along with ABET accreditation criteria, can cover PDC.

This is the second in a series of columns about IFIP, the International Federation for Information Processing. In the previous (December 2006) column, we discussed the general organization and scope of IFIP. IFIP's members are computing societies, one per country except for the USA, where both ACM and the IEEE Computer Society are members.

I is both an honor and pleasure to report that IEEE Transactions on Computers (TC) has enjoyed yet another successful year in 2009 and, justifi ably, it continues to be recognized as one of the fl agship publications of the IEEE Computer Society. Our motto “Leading worldwide innovation and technical excellence in computers” defi nes our mantra with respect to our glorious past (2010 will be the 59th year of publication) and an ever bright future. In 2009, we have seen the continuation of the growth pattern as experienced over the last few years: The number of submissions is in excess of 650, while maintaining a time-to-fi rst decision at just above three months (93 days to be precise). Overall, the acceptance rate is nearly 30 percent and TC has successfully published numerous Special Sections (SSs) on areas of interest to the readership. Additionally, the 2008 impact factor of TC stands at 2.61, i.e. at its highest level as per IEEE CS records and in the top 10 percent of all ISI-indexed journals in computer-related areas. The publication queue of TC remains healthy, albeit as Editor-In-Chief I have experienced an increase in the number of submissions that are clearly out-of-scope; I invite potential contributors to make themselves familiar with the goals and objectives of TC, thus avoiding a likely disappointment upon notifi cation due to an early administrative rejection. While every effort is being made to match expertise in the Editorial Board with submissions, this may not always be possible and makes an early decision fair to all parties involved. Hence, do not hesitate to visit the IEEE Computer Society Web site and, in particular, the newly redesigned TC web page (http://www.computer.org/tc). A further feature of TC is the rigorous and effi cient process of manuscript review; the unabated objective of this publication remains the dissemination of results of the highest quality and technical impact. Hence, acceptance is very competitive and can be recommended only upon positive recommendations from all reviewers. As such, revisions are pursued only when supported by public and private comments from reviewers and Associate Editors (AEs); hence a revision is recommended only if a manuscript is considered to have the likely potential of a fi nal acceptance. It is my responsibility as EIC to ensure that while maintaining fairness, the review process proceeds on a timely basis by not incurring unnecessary delays due to either clearly poor quality in incoming submissions and/or the requirement of an excessive delay due to a lengthy revision. In some cases the “Revise and Resubmit” decision is used to alert the authors of the defi ciencies of a manuscript early on, while enticing them to further pursue an additional submission of their revised work. In my opinion, acceptance criteria will continue in the future to be more stringent, thus further increases in the paper rejection rate should be expected. The role of an EIC is certainly not an easy one; as the number of submissions to TC increases, my load and commitment have also increased. Throughout my appointment I have replied to authors with celerity to clarify their concerns, while preserving the confi dentiality of the review process; however, do not hesitate to directly contact the AE in charge of your manuscript if a more detailed assessment of its status is required. Recently, the IEEE Computer Society has undergone major restructuring in operation to ensure that the continued satisfaction of all parties will be preserved in the future as we shift to an even more electronic dimension for all facets of publication activities. During 2009, the Editorial Board of TC has been enlarged in both scope and expertise. Many of our outstanding AEs have completed their terms and, on behalf of the IEEE CS, I would like to thank the following individuals for an outstanding job: Valmir Barbosa, Guiseppe Lipari, Alessandro Mei, C. Siva Ram Murthy, Bharadwaj Veeravalli, Cho-Li Wang, Zhiwei Xu, and Xiaodong Zhang The following colleagues are the new members of the Editorial Board of TC and their biographies can be found in the next pages: D.R. Avresky , Jianer Chen , Rajiv Gupta, Lizy Kurian John, Ethan Miller, Behrooz Parhami, Micheal Raynal, Jon Weissman, Cheng-Wen Wu, and Jie Wu I look forward to working with them to further enhance the standing of TC among our technical community and better serve you in the months ahead. I have the uttermost confi dence that 2010 will be yet another stellar year for TC and as always, do not hesitate to contact me at lombardi@ece.neu.edu for help and clarifi cation related to your manuscript.

It is with pleasure that the IEEE Computer Society welcomes this opportunity to participate with ACM members concerned with education of computer scientists and computer engineers. It is hoped that this cooperation will continue in the future. Described in this panel presentation will be the results of two years of concentrated development by members of the IEEE Computer Society Education Committee towards cohesive and flexible model curricula for 4-year computer science and engineering programs. This effort was initiated in May 1974, and since has resulted in eight working sessions, has involved 20 active module developers, has called upon nearly 40 outside reviewers, and has sought cooperation with academia, industry, the ACM and the DISE Committee. The first test of the model curricula was held in June 1976 at a IEEE Computer Society Educators Workshop; a test that seemed to be passed as judged by those attending the workshop.Specifically, this panel presentation will introduce the IEEE Computer Society effort, will place the effort in historical perspective, and will describe in detail the need as seen by many educators. It will dwell briefly on past contributions by similar committees, will provide a definition of computer science and engineering and will provide a pictorial outline of the 17 modules that comprise the five subject areas of the proposed curricula. This will be followed with selected examples of possible implementation strategies. The presentation will close with a summary of future work and a short comparison of the IEEE and ACM efforts.

The 2-way quantum finite automaton introduced by Kondacs and Watrous [Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997, IEEE Computer Society, pp. 66--75] can accept nonregular languages with bounded error in polynomial time. If we restrict the head of the automaton to moving classically and to moving only in one direction, the acceptance power of this 1-way quantum finite automaton is reduced to a proper subset of the regular languages. In this paper we study two different models of 1-way quantum finite automata. The first model, termed measure-once quantum finite automata, was introduced by Moore and Crutchfield [ Theoret. Comput. Sci., 237 (2000), pp. 275--306], and the second model, termed measure-many quantum finite automata, was introduced by Kondacs and Watrous [Proceedings of the38th Annual Symposium on Foundations of Computer Science, 1997, IEEE Computer Society, pp. 66--75]. We characterize the measure-once model when it is restricted to accepting with bounded error and show that, without that restriction, it can solve the word problem over the free group. We also show that it can be simulated by a probabilistic finite automaton and describe an algorithm that determines if two measure-once automata are equivalent. We prove several closure properties of the classes of languages accepted by measure-many automata, including inverse homomorphisms, and provide a new necessary condition for a language to be accepted by the measure-many model with bounded error. Finally, we show that piecewise testable sets can be accepted with bounded error by a measure-many quantum finite automaton, introducing new construction techniques for quantum automata in the process.

IEEE Computer Society - Publications Seek 2025 Editors in Chief

IEEE INFOCOM 2004 - The Conference on Computer Communications - Twenty Third Annual Joint Conference of the IEEE Computer and Communications Societies - Vol. 4 - Title Page

IEEE INFOCOM '91. The Conference on Computer Communications. Proceedings. Tenth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking in the 90s (Cat. No.91CH2979-3)

As Bill Gropp prepares to lead the IEEE Computer Society (CS) as its president in 2022, he has a conversation with 2021 IEEE CS President Forrest Shull and gives us insight into key areas of opportunity and growth for the Society and his perspective on the unique importance of CS volunteers and members in advancing the field of computing.

“A National Educational TV Series at Pre-College Level for Personal Computing and Computer Literacy”, David C. Rine, Western Illinois University. Under grants from the IEEE Computer Society, The Johns Hopkins University, Radio Shack and other agencies, the International Instructional TV Cooperative, source of instructional TV materials to all educational TV networks nation-wide and internationally, has finished and is marketing the implementation of a six-course national educational TV series aimed at the pre-college level in the area of personal computing and computer literacy. The name of the project is “Personal Computing: An Adventure of the Mind”. The objectives of this new series are to illustrate the uses of personal computing, to demonstrate the interface of humans and machines, to identify the fundamentals of communication in personal computing, and to motivate students to be innovative in their own applications of personal computing. Since the personal computer is viewed by many as a mind multiplier, a further objective of this educational TV series is to greatly increase the number of minds that can be multiplied, by taking Personal Computing to millions of children in classrooms across the country. Education and informational programs are closely allied in that both attempt to communicate facts, concepts, and ideas. Both need to be designed with specific objectives in mind. Some of the objectives to be discussed are both attitudinal and informational in nature; that is, they deal with feelings as well as facts. The underlying thrust throughout is that . . . LEARNING CAN BE FUN!

We obtain the first deterministic extractors for sources generated (or sampled) by small circuits of bounded depth. Our main results are: (1) We extract k(k/nd) O(1) bits with exponentially small error from n-bit sources of min-entropy k that are generated by functions f: {0, 1} ℓ → {0, 1} n where each output bit depends on ≤ d input bits. In particular, we extract from NC 0 sources, corresponding to d = O(1). (2) We extract k(k/n 1+γ) O(1) bits with super-polynomially small error from n-bit sources of min-entropy k that are generated by poly(n)-size AC 0 circuits, for any γ> 0. As our starting point, we revisit the connection by Trevisan and Vadhan (FOCS 2000) between circuit lower bounds and extractors for sources generated by circuits. We note that such extractors (with very weak parameters) are equivalent to lower bounds for generating distributions (FOCS 2010; with Lovett, CCC 2011). Building on those bounds, we prove that the sources in (1) and (2) are (close to) a convex combination of high-entropy “bit-block ” sources. Introduced here, such sources are a special case of affine ones. As extractors for (1) and (2) one can use the extractor for low-weight affine sources by Rao (CCC 2009). Along the way, we exhibit an explicit boolean function b: {0, 1} n → {0, 1} such that poly(n)-size AC 0 circuits cannot generate the distribution (Y, b(Y)), solving a problem about the complexity of distributions. Independently, De and Watson (RANDOM 2011) obtain a result similar to (1) in the special case d = o(lg n). Supported by NSF grant CCF-0845003.

IEEE Computer Society: Be at the Center of It All House Advertisement

Cross-company vs. single-company web effort models using the Tukutuku database: An extended study

We are delighted to welcome our colleagues from the UK, Europe and the rest of the world to this 15th UKSim International Conference on Modelling and Simulation, held at Emmanuel College, Cambridge, UK. It follows in the footsteps of last year's successful event, which represented the 14th UKSim International Conference on Modelling and Simulation, also held at Emmanuel College. The conference program committee has organized an exciting and balanced program comprising presentations from distinguished experts in the field, and important and wide-ranging contributions on state-of-the-art research that provide new insights into the latest innovations in the field of modelling and simulation. Being the UKSim's 15th large international conference, we are hopeful that its outstanding technical content contributed by leading researchers in the field from UK, Europe and worldwide will ensure its continued success. UKSim 2013 is technically co-sponsored by IEEE Computer Society (UK & RI) and IEEE Region 8 (Europe, Africa and Middle East), UK Simulation Society, European Federation of Simulation Societies (EUROSIM), European Council for Modelling and Simulation (ECMS), Asia Modelling and Simulation Section, Kingston University, Imperial College, Machine Intelligence Research Labs (MIR Labs), Norwegian University of Science and Technology, and Nottingham Trent University, University of Technology Malaysia (UTM), University of Science Malaysia (USM) and University of Malaysia in Sabah, University of Technology Mara, University of Malaysia in Perlis, and University of Malaysia in Pahang.