Communication of the ACM Magazine 5/2019 Vol 62 # 5 Negative Image of Women in Computing


SKU: 18014 Category:


Communication of the ACM Magazine 5/2019 Vol 62 # 5 Negative Image of Women in Computing

Communications of the ACM is the monthly journal of the Association for Computing Machinery. It was established in 1958, with Saul Rosen as its first managing editor. It is sent to all ACM members. Articles are intended for readers with backgrounds in all areas of computer science and information systems.

Quantum hype and quantum skepticism

Don’t ignore the cost of ’embedded energy’

Implementing guidelines for governance, oversight of AI, and automation

Questioning quantum
Researchers hunt for ways to keep quantum computing honest.

Code talkers
Using voice input to write programs.

Deep insecurities: the internet of things shifts technology risk
A more connected world sounds alluring, but without better protections, the Internet of Things could lead to disaster.

COLUMN: Law and technology

Continuity and change in internet law
The fundamentals of the field of Internet law have remained consistent, but details have evolved in response to technological innovation.

COLUMN: Privacy and security

Encryption and surveillance
Why the law-enforcement access question will not just go away.

What does it mean for a computing curriculum to succeed?
Examining the expansion, proliferation, and integration of computing education everywhere.

Enterprise wi-fi: we need devices that are secure by default
Seeking to increase awareness of WPA2 Enterprise network security technology flaws and reduce risk to users.

Achieving digital permanence
The many challenges to maintaining stored information and ways to overcome them.

Online event processing
Achieving consistency where distributed transactions have failed.

Net neutrality: unexpected solution to blockchain scaling
Cloud-delivery networks could dramatically improve blockchains’ scalability, but clouds must be provably neutral first.

Countering the negative image of women in computing
A positive image would inspire the capable but underrepresented who might otherwise give up on computing.

The limit of blockchains: infeasibility of a smart Obama-Trump contract
Although smart contracts are Turing complete, it is a misconception that they can fulfill all routine contracts.

Algorithmic randomness
Tracing some of the latest advancements in algorithmic randomness.

SECTION: Research highlights

Technical perspective: Compressing matrices for large-scale machine learning

Compressed linear algebra for declarative large-scale machine learning
Large-scale Machine Learning (ML) algorithms are often iterative, using repeated read-only data access and I/O-bound matrix-vector multiplications. Hence, it is crucial for performance to fit the data into single-node or distributed main memory to …

Like old times
From the intersection of computational science and technological speculation, with boundaries limited only by our ability to imagine what could be.

The Furby singularity promises eternal conversation with the untimely departed.

Security and privacy
Linear algebra algorithms
Machine learning
Quantum computing
API languages
Artificial intelligence
Codes of ethics
Computing / technology policy
Computing standards, RFCs and guidelines
Digital libraries and archives
E-commerce infrastructure
Electronic commerce
Event-driven architectures
Human computer interaction (HCI)
Information storage technologies
IT governance
Law, social and behavioral sciences
Models of computation
Network algorithms
Network security
Network services
Quantum computation
Quantum error correction and fault tolerance
Quantum technologies
Random order and robust communication complexity
Randomness, geometry and discrete structures
Security in hardware
Software and application security
Software and its engineering
Software development methods
Software development techniques
Wireless access points, base stations and infrastructure

Address label on cover. Minor wear to cover. Otherwise in unread condition. More pictures may be in description (which it is suggested you read!)