Topic: computing (Page 11)

You are looking at all articles with the topic "computing". We found 523 matches.

Hint: To view all topics, click here. Too see the most popular topics, click here instead.

πŸ”— BonziBuddy

πŸ”— Internet πŸ”— Computing πŸ”— Marketing & Advertising πŸ”— Computing/Software πŸ”— Computing/Computer Security

BonziBuddy, stylized as BonziBUDDY, (pronounced BON-zee-bud-ee) was a freeware desktop virtual assistant made by Joe and Jay Bonzi. Upon a user's choice, it would share jokes and facts, manage downloading using its download manager, sing songs, and talk, among other functions.

The software used Microsoft Agent technology similar to Office Assistant, and originally sported Peedy, a green parrot and one of the characters available with Microsoft Agent. Later versions of BonziBuddy in May 2000 featured its own character: Bonzi, the purple gorilla. The program also used a text to speech voice to interact with the user. The voice was called Sydney and taken from an old Lernout & Hauspie Microsoft Speech API 4.0 package. It is often referred to in some software as Adult Male #2.

Some versions of the software were described as spyware and adware. BonziBuddy was discontinued in 2004 after the company behind it faced lawsuits regarding the software and was ordered to pay fines. Bonzi's website remained open after the discontinuation of BonziBuddy and was said to be a virus, but was shut down at the end of 2008.

Discussed on

πŸ”— Seam Carving

πŸ”— Computing

Seam carving (or liquid rescaling) is an algorithm for content-aware image resizing, developed by Shai Avidan, of Mitsubishi Electric Research Laboratories (MERL), and Ariel Shamir, of the Interdisciplinary Center and MERL. It functions by establishing a number of seams (paths of least importance) in an image and automatically removes seams to reduce image size or inserts seams to extend it. Seam carving also allows manually defining areas in which pixels may not be modified, and features the ability to remove whole objects from photographs.

The purpose of the algorithm is image retargeting, which is the problem of displaying images without distortion on media of various sizes (cell phones, projection screens) using document standards, like HTML, that already support dynamic changes in page layout and text but not images.

Image Retargeting was invented by Vidya Setlur, Saeko Takage, Ramesh Raskar, Michael Gleicher and Bruce Gooch in 2005. The work by Setlur et al. won the 10-year impact award in 2015.

Discussed on

πŸ”— Homomorphic encryption

πŸ”— Computing πŸ”— Mathematics πŸ”— Computing/Software πŸ”— Cryptography πŸ”— Cryptography/Computer science πŸ”— Computing/Computer Security

Homomorphic encryption is a form of encryption that allows computation on ciphertexts, generating an encrypted result which, when decrypted, matches the result of the operations as if they had been performed on the plaintext.

Homomorphic encryption can be used for privacy-preserving outsourced storage and computation. This allows data to be encrypted and out-sourced to commercial cloud environments for processing, all while encrypted. In highly regulated industries, such as health care, homomorphic encryption can be used to enable new services by removing privacy barriers inhibiting data sharing. For example, predictive analytics in health care can be hard to apply due to medical data privacy concerns, but if the predictive analytics service provider can operate on encrypted data instead, these privacy concerns are diminished.

Discussed on

πŸ”— Fallacies of Distributed Computing

πŸ”— Computing πŸ”— Computing/Software πŸ”— Computing/Networking

The fallacies of distributed computing are a set of assertions made by L Peter Deutsch and others at Sun Microsystems describing false assumptions that programmers new to distributed applications invariably make.

Discussed on

πŸ”— Jazelle DBX: Allow ARM processors to execute Java bytecode in hardware

πŸ”— Computing πŸ”— Computing/Computer hardware πŸ”— Computing/Software πŸ”— Java

Jazelle DBX (direct bytecode execution) is an extension that allows some ARM processors to execute Java bytecode in hardware as a third execution state alongside the existing ARM and Thumb modes. Jazelle functionality was specified in the ARMv5TEJ architecture and the first processor with Jazelle technology was the ARM926EJ-S. Jazelle is denoted by a "J" appended to the CPU name, except for post-v5 cores where it is required (albeit only in trivial form) for architecture conformance.

Jazelle RCT (Runtime Compilation Target) is a different technology based on ThumbEE mode; it supports ahead-of-time (AOT) and just-in-time (JIT) compilation with Java and other execution environments.

The most prominent use of Jazelle DBX is by manufacturers of mobile phones to increase the execution speed of Java ME games and applications. A Jazelle-aware Java virtual machine (JVM) will attempt to run Java bytecode in hardware, while returning to the software for more complicated, or lesser-used bytecode operations. ARM claims that approximately 95% of bytecode in typical program usage ends up being directly processed in the hardware.

The published specifications are very incomplete, being only sufficient for writing operating system code that can support a JVM that uses Jazelle. The declared intent is that only the JVM software needs to (or is allowed to) depend on the hardware interface details. This tight binding facilitates the hardware and JVM evolving together without affecting other software. In effect, this gives ARM Holdings considerable control over which JVMs are able to exploit Jazelle. It also prevents open source JVMs from using Jazelle. These issues do not apply to the ARMv7 ThumbEE environment, the nominal successor to Jazelle DBX.

Discussed on

πŸ”— Father of the moderm tiling WMs proposed for deletion in Wikipedia.

πŸ”— Computing πŸ”— Computing/Software

dwm is a dynamic, minimalist tiling window manager for the X Window System that has influenced the development of several other X window managers, including xmonad and awesome. It is externally similar to wmii, but internally much simpler. dwm is written purely in C for performance and security in addition to simplicity, and lacks any configuration interface besides editing the source code. One of the project's guidelines is that the source code is intended to never exceed 2000 SLOC, and options meant to be user-configurable are all contained in a single header file.

Discussed on

πŸ”— Diffie-Hellman key exchange, explained using colors

πŸ”— Computing πŸ”— Computer science πŸ”— Cryptography πŸ”— Cryptography/Computer science

Diffie–Hellman key exchange is a method of securely exchanging cryptographic keys over a public channel and was one of the first public-key protocols as conceived by Ralph Merkle and named after Whitfield Diffie and Martin Hellman. DH is one of the earliest practical examples of public key exchange implemented within the field of cryptography.

Traditionally, secure encrypted communication between two parties required that they first exchange keys by some secure physical means, such as paper key lists transported by a trusted courier. The Diffie–Hellman key exchange method allows two parties that have no prior knowledge of each other to jointly establish a shared secret key over an insecure channel. This key can then be used to encrypt subsequent communications using a symmetric key cipher.

Diffie–Hellman is used to secure a variety of Internet services. However, research published in October 2015 suggests that the parameters in use for many DH Internet applications at that time are not strong enough to prevent compromise by very well-funded attackers, such as the security services of large governments.

The scheme was published by Whitfield Diffie and Martin Hellman in 1976, but in 1997 it was revealed that James H. Ellis, Clifford Cocks, and Malcolm J. Williamson of GCHQ, the British signals intelligence agency, had previously shown in 1969 how public-key cryptography could be achieved.

Although Diffie–Hellman key agreement itself is a non-authenticated key-agreement protocol, it provides the basis for a variety of authenticated protocols, and is used to provide forward secrecy in Transport Layer Security's ephemeral modes (referred to as EDH or DHE depending on the cipher suite).

The method was followed shortly afterwards by RSA, an implementation of public-key cryptography using asymmetric algorithms.

Expired U.S. Patent 4,200,770 from 1977 describes the now public-domain algorithm. It credits Hellman, Diffie, and Merkle as inventors.

Discussed on

πŸ”— WikiWikiWeb

πŸ”— Computing πŸ”— Perl

The WikiWikiWeb is the first-ever wiki, or user-editable website. It was launched on 25 March 1995 by its inventor, programmer Ward Cunningham, to accompany the Portland Pattern Repository website discussing software design patterns. The name WikiWikiWeb originally also applied to the wiki software that operated the website, written in the Perl programming language and later renamed to "WikiBase". The site is frequently referred to by its users as simply "Wiki", and a convention established among users of the early network of wiki sites that followed was that using the word with a capitalized W referred exclusively to the original site.

Discussed on

πŸ”— Koomey's law

πŸ”— Computing

Koomey's law describes a trend in the history of computing hardware: for about a half-century, the number of computations per joule of energy dissipated doubled about every 1.57 years. Professor Jonathan Koomey described the trend in a 2010 paper in which he wrote that "at a fixed computing load, the amount of battery you need will fall by a factor of two every year and a half."

This trend had been remarkably stable since the 1950s (R2 of over 98%). But in 2011, Koomey re-examined this data and found that after 2000, the doubling slowed to about once every 2.6 years. This is related to the slowing of Moore's Law, the ability to build smaller transistors; and the end around 2005 of Dennard scaling, the ability to build smaller transistors with constant power density.

"The difference between these two growth rates is substantial. A doubling every year and a half results in a 100-fold increase in efficiency every decade. A doubling every two and a half years yields just a 16-fold increase", Koomey wrote.

Discussed on