You are looking at all articles with the topic "Computing". We found 530 matches.

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

🔗 Computing 🔗 China 🔗 East Asia 🔗 Writing systems 🔗 Hong Kong

Han unification is an effort by the authors of Unicode and the Universal Character Set to map multiple character sets of the so-called CJK languages into a single set of unified characters. Han characters are a common feature of written Chinese (hanzi), Japanese (kanji), and Korean (hanja).

Modern Chinese, Japanese and Korean typefaces typically use regional or historical variants of a given Han character. In the formulation of Unicode, an attempt was made to unify these variants by considering them different glyphs representing the same "grapheme", or orthographic unit, hence, "Han unification", with the resulting character repertoire sometimes contracted to Unihan.

Unihan can also refer to the Unihan Database maintained by the Unicode Consortium, which provides information about all of the unified Han characters encoded in the Unicode Standard, including mappings to various national and industry standards, indices into standard dictionaries, encoded variants, pronunciations in various languages, and an English definition. The database is available to the public as text files and via an interactive website. The latter also includes representative glyphs and definitions for compound words drawn from the free Japanese EDICT and Chinese CEDICT dictionary projects (which are provided for convenience and are not a formal part of the Unicode Standard).

🔗 Computing 🔗 Microsoft Windows 🔗 Microsoft Windows/Computing 🔗 Microsoft

Resilient File System (ReFS), codenamed "Protogon", is a Microsoft proprietary file system introduced with Windows Server 2012 with the intent of becoming the "next generation" file system after NTFS.

ReFS was designed to overcome problems that had become significant over the years since NTFS was conceived, which are related to how data storage requirements had changed. The key design advantages of ReFS include automatic integrity checking and data scrubbing, removal of the need for running chkdsk, protection against data degradation, built-in handling of hard disk drive failure and redundancy, integration of RAID functionality, a switch to copy/allocate on write for data and metadata updates, handling of very long paths and filenames, and storage virtualization and pooling, including almost arbitrarily sized logical volumes (unrelated to the physical sizes of the used drives).

These requirements arose from two major changes in storage systems and usage – the size of storage in use (large or massive arrays of multi-terabyte drives now being fairly common), and the need for continual reliability. As a result, the file system needs to be self-repairing (to prevent disk checking from being impractically slow or disruptive), along with abstraction or virtualization between physical disks and logical volumes.

ReFS was initially added to Windows Server 2012 only, with the aim of gradual migration to consumer systems in future versions; this was achieved as of Windows 8.1. The initial versions removed some NTFS features, such as disk quotas, alternate data streams, and extended attributes. Some of these were re-implemented in later versions of ReFS.

In early versions (2012–2013), ReFS was similar to or slightly faster than NTFS in most tests, but far slower when full integrity checking was enabled, a result attributed to the relative newness of ReFS. Pre-release concerns were also voiced by one blogger over Storage Spaces, the storage system designed to underpin ReFS, which reportedly could fail in a manner that prevented ReFS from recovering automatically.

The ability to create ReFS volumes was removed in Windows 10's 2017 Fall Creators Update for all editions except Enterprise and Pro for Workstations.

The cluster size of a ReFS volume is either 4 KiB or 64 KiB.

🔗 Computing 🔗 Computing/Software

In software development, the yo-yo problem is an anti-pattern that occurs when a programmer has to read and understand a program whose inheritance graph is so long and complicated that the programmer has to keep flipping between many different class definitions in order to follow the control flow of the program. It often happens in object-oriented programming. The term comes from comparing the bouncing attention of the programmer to the up-down movement of a toy yo-yo. Taenzer, Ganti, and Podar described the problem by name, explaining: "Often we get the feeling of riding a yoyo when we try to understand one of these message trees."

Most practices of object-oriented programming recommend keeping the inheritance graph as shallow as possible, in part to avoid this problem. The use of composition instead of inheritance is also strongly preferred, although this still requires that a programmer keep multiple class definitions in mind at once.

More generally, the yo-yo problem can also refer to any situation where a person must keep flipping between different sources of information in order to understand a concept.

Object-oriented design techniques such as documenting layers of the inheritance hierarchy can reduce the effect of this problem, as they collect in one place the information that the programmer is required to understand.

🔗 Computing 🔗 Robotics

The Viterbi algorithm is a dynamic programming algorithm for obtaining the maximum a posteriori probability estimate of the most likely sequence of hidden states—called the Viterbi path—that results in a sequence of observed events, especially in the context of Markov information sources and hidden Markov models (HMM).

The algorithm has found universal application in decoding the convolutional codes used in both CDMA and GSM digital cellular, dial-up modems, satellite, deep-space communications, and 802.11 wireless LANs. It is now also commonly used in speech recognition, speech synthesis, diarization, keyword spotting, computational linguistics, and bioinformatics. For example, in speech-to-text (speech recognition), the acoustic signal is treated as the observed sequence of events, and a string of text is considered to be the "hidden cause" of the acoustic signal. The Viterbi algorithm finds the most likely string of text given the acoustic signal.

🔗 Computing 🔗 Computing/Computer Security

An .XIP file is a XAR archive which can be digitally signed for integrity. The .XIP file format was introduced in OS X 10.9, along with Apple's release of Swift. .XIP allows for a digital signature to be applied and verified on the receiving system before the archive is expanded. When a XIP file is opened (by double-clicking), Archive Utility will automatically expand it (but only if the digital signature is intact).

Apple has reserved the right to use the .XIP file format exclusively, removing it from public use since release. Starting with macOS Sierra, only .XIP archives signed by Apple will be expanded. Developers who had been using .XIP archives were required to move to using signed installer packages or disk images.

🔗 Technology 🔗 Computing 🔗 Mathematics

A slide rule is a hand-operated mechanical calculator consisting of slidable rulers for evaluating mathematical operations such as multiplication, division, exponents, roots, logarithms, and trigonometry. It is one of the simplest analog computers.

Slide rules exist in a diverse range of styles and generally appear in a linear, circular or cylindrical form. Slide rules manufactured for specialized fields such as aviation or finance typically feature additional scales that aid in specialized calculations particular to those fields. The slide rule is closely related to nomograms used for application-specific computations. Though similar in name and appearance to a standard ruler, the slide rule is not meant to be used for measuring length or drawing straight lines. Nor is it designed for addition or subtraction, which is usually performed using other methods, like using an abacus. Maximum accuracy for standard linear slide rules is about three decimal significant digits, while scientific notation is used to keep track of the order of magnitude of results.

English mathematician and clergyman Reverend William Oughtred and others developed the slide rule in the 17th century based on the emerging work on logarithms by John Napier. It made calculations faster and less error-prone than evaluating on paper. Before the advent of the scientific pocket calculator, it was the most commonly used calculation tool in science and engineering. The slide rule's ease of use, ready availability, and low cost caused its use to continue to grow through the 1950s and 1960s, even as desktop electronic computers were gradually introduced. But after the handheld scientific calculator was introduced in 1972 and became inexpensive in the mid-1970s, slide rules became largely obsolete, so most suppliers departed the business.

In the United States, the slide rule is colloquially called a slipstick.

🔗 Computing 🔗 Philosophy 🔗 Futures studies 🔗 Artificial Intelligence

TESCREAL is a neologism proposed by computer scientist Timnit Gebru and philosopher Émile P. Torres. An acronym, it stands for Transhumanism, Extropianism, Singularitarianism, (modern) Cosmism, Rationalists (the internet community, not to be confused with other uses of the term), Effective Altruism, and Longtermism. Gebru and Torres argue that these ideologies should be treated as an "interconnected and overlapping" group with shared origins. They claim these constitute a movement that allows its proponents to use the threat of human extinction to justify expensive or detrimental projects and consider it pervasive in social and academic circles in Silicon Valley centered on artificial intelligence. As such, the acronym is sometimes used to criticize a perceived belief system associated with Big Tech.

🔗 Computing 🔗 Computing/Early computers

Mailüfterl is a nickname for the Austrian Binär dezimaler Volltransistor-Rechenautomat (binary-decimal fully transistorized computing automaton), an early transistorized computer. Other early transistorized computers included TRADIC, Harwell CADET and TX-0.

Mailüfterl was built from May 1956 to May 1958 at the Vienna University of Technology by Heinz Zemanek.

Heinz Zemanek had come to an agreement with Konrad Zuse, whose company Zuse KG would finance the work of Rudolf Bodo, who helped build the Mailüfterl, also that all circuit diagrams of the Z22 were supplied to Bodo and Zemanek, and that after the Mailüfterl project Bodo should work for the Zuse KG to help build the transistorized Z23.

The first program, computation of the prime 5,073,548,261, was executed in May 1958. Completion of the software continued until 1961. The nickname was coined by Zemanek: "Even if it cannot match the rapid calculation speed of American models called 'Whirlwind' or 'Typhoon', it will be enough for a 'Wiener Mailüfterl'" (Viennese May breeze).

The computer has 3,000 transistors, 5,000 diodes, 1,000 assembly platelets, 100,000 solder joints, 15,000 resistors, 5,000 capacitors and about 20,000 metres (66,000 ft) of wire. It is 4 meters (13 ft) wide, 2.5 meters (8.2 ft) high, and 50 centimeters (20 in) deep. The machine was comparable in calculating power to what were then considered small vacuum-tube computers. Calculations and representation of values worked using the BCD system.

Zemanek later said about his project that it was a "semi-illegal" undertaking of an assistant professor, which he and a group of students realized without official authorization, and hence without financial support, from the university. In 1954 he traveled to Philips in the Netherlands, where he asked for a donation in kind. Transistors, invented seven years before and just beginning to be available commercially, were very difficult to obtain in quantity at any price, but Zemanek received a commitment for 1,000 rather slow hearing-aid transistors, and Philips finally shipped a total of 4,000 high-quality transistors to the Austrians.

🔗 Internet 🔗 Computing 🔗 Freedom of speech 🔗 Computing/Websites

GitHub has been the target of censorship from governments using methods ranging from local Internet service provider blocks, intermediary blocking using methods such as DNS hijacking and man-in-the-middle attacks, and denial-of-service attacks on GitHub's servers from countries including China, India, Russia, and Turkey. In all of these cases, GitHub has been eventually unblocked after backlash from users and technology businesses or compliance from GitHub.

🔗 Computing 🔗 Denmark 🔗 Food and drink 🔗 Beer

Free Beer, originally known as Vores øl - An open source beer (Danish for: Our Beer), is the first brand of beer with an "open"/"free" brand and recipe. The recipe and trademark elements are published under the Creative Commons CC BY-SA license.

The beer was created in 2004 by students at the IT University in Copenhagen together with artist collective Superflex, to illustrate how concepts of the FOSS movement might be applied outside the digital world. The "Free Beer" concept illustrates also the connection between the long tradition of freely sharing cooking recipes with the FOSS movement, which tries to establish this sharing tradition also for the "recipes" of software, the source code. The "Free beer" concept received an overall positive reception from international press and media for the political message, was presented on many exhibitions and conferences, and inspired many breweries in adopting the concept.