Subject:
All Disciplines Arts & Humanities Biology & Life Sciences Business & Economics Chemistry & Materials Science Computer Science & Mathematics Engineering Environmental & Earth Sciences Medicine & Pharmacology Physical Sciences Public Health & Healthcare Social Sciences
Sort:
Hottest Latest Alphabetical (A-Z) Alphabetical (Z-A)
Type:
All Topic Review Biography
Topic Review
HP Operations Manager
HP Operations Manager is a System monitoring package manufactured by Hewlett-Packard (HP). HP Operations Manager is part of HP Operations Center that includes too: On May 20, 2015 HP started the migration for HP OM users to Operations Manager i, very similar names for very different softwares architectures. On September 1, 2016 HP Enterprise announced the End of Sale of HP Operations Manager for Windows (OMW) 9.0x and HP Operations Manager for Windows Basic Suite (OMW BS) 9.0x and all customerswas migrate to HPE Operations Bridge Suite, a hybrid IT monitoring solution.
  • 1.3K
  • 14 Oct 2022
Topic Review
Enterprise Client-server Backup
Enterprise client-server" backup software describes a class of software applications that back up data from a variety of client computers centrally to one or more server computers, with the particular needs of enterprises in mind. They may employ a scripted client–server backup model with a backup server program running on one computer, and with small-footprint client programs (referred to as "agents" in some applications) running on the other computer(s) being backed up—or alternatively as another process on the same computer as the backup server program. Enterprise-specific requirements include the need to back up large amounts of data on a systematic basis, to adhere to legal requirements for the maintenance and archiving of files and data, and to satisfy short-recovery-time objectives. To satisfy these requirements (which World Backup Day (31 March) highlights), it is typical for an enterprise to appoint a backup administrator—who is a part of office administration rather than of the IT staff and whose role is "being the keeper of the data". In a client-server backup application, the server program initiates the backup activity by the client program. This is distinct from a "personal" backup application such as Apple's Time Machine, in which "Time Machine runs on each Mac, independently of any other Macs, whether they're backing up to the same destination or a different one." If the backup server and client programs are running on separate computers, they are connected in either a single platform or a mixed platform network. The client-server backup model was originated when magnetic tape was the only financially-feasible storage medium for doing backups of multiple computers onto a single archive file;[note 1][note 2] because magnetic tape is a sequential access medium, it was imperative (barring "multiplexed backup") that the client computers be backed up one at a time—as initiated by the backup server program. What is described in the preceding paragraph is the "two-tier" configuration (in one application's diagram, the second-tier backup server program is named "server" preceded by the name of the application, and first-tier "agents" are backing up interactive server applications). That configuration controls the backup server program via either an integrated GUI or a separate Administration Console. In some client-server backup applications, a "three-tier" configuration splits off the backup and restore functions of the server program to run on what are called media servers—computers to which devices containing archive files are attached either locally or as Network-attached storage (NAS). In those applications, the decision on which media server a script is to run on is controlled using another program called either a master server or an optional central admin. server.
  • 356
  • 14 Oct 2022
Topic Review
Range Encoding
Range encoding is an entropy coding method defined by G. Nigel N. Martin in a 1979 paper, which effectively rediscovered the FIFO arithmetic code first introduced by Richard Clark Pasco in 1976. Given a stream of symbols and their probabilities, a range coder produces a space-efficient stream of bits to represent these symbols and, given the stream and the probabilities, a range decoder reverses the process. Range coding is very similar to arithmetic encoding, except that encoding is done with digits in any base, instead of with bits, and so it is faster when using larger bases (e.g. a byte) at small cost in compression efficiency. After the expiration of the first (1978) arithmetic coding patent, range encoding appeared to clearly be free of patent encumbrances. This particularly drove interest in the technique in the open source community. Since that time, patents on various well-known arithmetic coding techniques have also expired.
  • 406
  • 14 Oct 2022
Topic Review
Amira
Amira (pronounce: Ah-meer-ah) is a software platform for 3D and 4D data visualization, processing, and analysis. It is being actively developed by Thermo Fisher Scientific in collaboration with the Zuse Institute Berlin (ZIB), and commercially distributed by Thermo Fisher Scientific.
  • 612
  • 14 Oct 2022
Topic Review
Root-Finding Algorithm
In mathematics and computing, a root-finding algorithm is an algorithm for finding zeroes, also called "roots", of continuous functions. A zero of a function f, from the real numbers to real numbers or from the complex numbers to the complex numbers, is a number x such that f(x) = 0. As, generally, the zeroes of a function cannot be computed exactly nor expressed in closed form, root-finding algorithms provide approximations to zeroes, expressed either as floating point numbers or as small isolating intervals, or disks for complex roots (an interval or disk output being equivalent to an approximate output together with an error bound). Solving an equation f(x) = g(x) is the same as finding the roots of the function h(x) = f(x) – g(x). Thus root-finding algorithms allow solving any equation defined by continuous functions. However, most root-finding algorithms do not guarantee that they will find all the roots; in particular, if such an algorithm does not find any root, that does not mean that no root exists. Most numerical root-finding methods use iteration, producing a sequence of numbers that hopefully converge towards the root as a limit. They require one or more initial guesses of the root as starting values, then each iteration of the algorithm produces a successively more accurate approximation to the root. Since the iteration must be stopped at some point these methods produce an approximation to the root, not an exact solution. Many methods compute subsequent values by evaluating an auxiliary function on the preceding values. The limit is thus a fixed point of the auxiliary function, which is chosen for having the roots of the original equation as fixed points, and for converging rapidly to these fixed points. The behaviour of general root-finding algorithms is studied in numerical analysis. However, for polynomials, root-finding study belongs generally to computer algebra, since algebraic properties of polynomials are fundamental for the most efficient algorithms. The efficiency of an algorithm may depend dramatically on the characteristics of the given functions. For example, many algorithms use the derivative of the input function, while others work on every continuous function. In general, numerical algorithms are not guaranteed to find all the roots of a function, so failing to find a root does not prove that there is no root. However, for polynomials, there are specific algorithms that use algebraic properties for certifying that no root is missed, and locating the roots in separate intervals (or disks for complex roots) that are small enough to ensure the convergence of numerical methods (typically Newton's method) to the unique root so located.
  • 10.4K
  • 14 Oct 2022
Topic Review
FOCAL-69
FOCAL-69 was the landmark version of the FOCAL programming language, more widely publicized than the original version of the language created in 1968. FOCAL-69, created by Richard Merrill is important because: It was the basis for all later derivatives of the language (some of which branched off from one another); It was the language the classic BASIC game Hamurabi was first written in; It became a popular language on Russian microcomputers.
  • 441
  • 14 Oct 2022
Topic Review
Heurist
Heurist is an online database designed for digital research objects including bibliographic records, web bookmarks, historical events, document annotations, images, contemporary stories and other data which is rich in text and classification data, and often heterogeneous. Heurist was originally designed by Ian Johnson (from 2005) and developed by the (now disbanded) Arts eResearch unit (AeR) at the University of Sydney. It continues to be developed within the Faculty of Arts. It was released as Open Source software in May 2013 (version 3.1.0), originally on Google Code, later moved to GitHub, and a free web service for low-demand academic databases is available at http://heurist.sydney.edu.au - other free services are listed in the project web site (http://HeuristNetwork.org). Heurist was developed to overcome two problems identified as common to researchers in the Humanities (and others): It aims to tackle the first issue by providing a web service supporting the on-demand creation and configuration of new databases through a web interface. It aims to tackle the second issue by allowing the storage and interlinking of a wide variety of research data, notes, annotations and digital attachments in a single shared database, while providing individual ‘views’ on this data and workgroup-owned and private areas for research in progress.
  • 343
  • 14 Oct 2022
Topic Review
Spectral Estimation of Multidimensional Signals
Power spectral estimation forms the basis for distinguishing and tracking signals in the presence of noise and extracting information from available data. One dimensional signals are expressed in terms of a single domain while multidimensional signals are represented in wave vector and frequency spectrum. Therefore, spectral estimation in the case of multidimensional signals gets a bit tricky.
  • 505
  • 14 Oct 2022
Topic Review
WannaCry Ransomware Attack
The WannaCry ransomware attack was a worldwide cyberattack in May 2017 by the WannaCry ransomware cryptoworm, which targeted computers running the Microsoft Windows operating system by encrypting data and demanding ransom payments in the Bitcoin cryptocurrency. It propagated through EternalBlue, an exploit developed by the United States National Security Agency (NSA) for older Windows systems. EternalBlue was stolen and leaked by a group called The Shadow Brokers a month prior to the attack. While Microsoft had released patches previously to close the exploit, much of WannaCry's spread was from organizations that had not applied these, or were using older Windows systems that were past their end-of-life. These patches were imperative to organizations' cyber security but many were not implemented due to ignorance of their importance. Some have claimed a need for 24/7 operation, aversion to risking having formerly working applications breaking because of patch changes, lack of personnel or time to install them, or other reasons. The attack began at 07:44 UTC on 12 May 2017 and was halted a few hours later at 15:03 UTC by the registration of a kill switch discovered by Marcus Hutchins. The kill switch prevented already infected computers from being encrypted or further spreading WannaCry. The attack was estimated to have affected more than 200,000 computers across 150 countries, with total damages ranging from hundreds of millions to billions of United States dollar . Security experts believed from preliminary evaluation of the worm that the attack originated from North Korea or agencies working for the country. In December 2017, the United States and United Kingdom formally asserted that North Korea was behind the attack. A new variant of WannaCry forced Taiwan Semiconductor Manufacturing Company (TSMC) to temporarily shut down several of its chip-fabrication factories in August 2018. The virus spread to 10,000 machines in TSMC's most advanced facilities.
  • 1.8K
  • 14 Oct 2022
Topic Review
Distributed Ledger Technology Law
Distributed ledger technology law ("DLT law") (also called Blockchain law,, Lex Cryptographia or Algorithmic legal order ) is not yet defined and recognized but an emerging field of law due to the recent dissemination of distributed ledger technology application in business and governance environment.
  • 395
  • 14 Oct 2022
  • Page
  • of
  • 371
Featured Entry Collections
>>

Featured Books

>>
Encyclopedia of Social Sciences
Encyclopedia of COVID-19
Encyclopedia of Fungi
Encyclopedia of Digital Society, Industry 5.0 and Smart City
Video Production Service
Feedback