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
Cognitive Evaluation Theory
Cognitive evaluation theory (CET) is a theory in psychology that is designed to explain the effects of external consequences on internal motivation. Specifically, CET is a sub-theory of self-determination theory that focuses on competence and autonomy while examining how intrinsic motivation is affected by external forces in a process known as motivational "crowding out." CET uses three propositions to explain how consequences affect internal motivation:
  • 3.0K
  • 30 Nov 2022
Topic Review
Gauss's Lemma (Polynomial)
In algebra, Gauss's lemma, named after Carl Friedrich Gauss, is a statement about polynomials over the integers, or, more generally, over a unique factorization domain (that is, a ring that has a unique factorization property similar to the fundamental theorem of arithmetic). Gauss's lemma underlies all the theory of factorization and greatest common divisors of such polynomials. Gauss's lemma asserts that the product of two primitive polynomials is primitive (a polynomial with integer coefficients is primitive if it has 1 as a greatest common divisor of its coefficients). A corollary of Gauss's lemma, sometimes also called Gauss's lemma, is that a primitive polynomial is irreducible over the integers if and only if it is irreducible over the rational numbers. More generally, a primitive polynomial has the same complete factorization over the integers and over the rational numbers. In the case of coefficients in a unique factorization domain R, "rational numbers" must be replaced by "field of fractions of R". This implies that, if R is either a field, the ring of integers, or a unique factorization domain, then every polynomial ring (in one or several indeterminates) over R is a unique factorization domain. Another consequence is that factorization and greatest common divisor computation of polynomials with integers or rational coefficients may be reduced to similar computations on integers and primitive polynomials. This is systematically used (explicitly or implicitly) in all implemented algorithms (see Polynomial greatest common divisor and Factorization of polynomials). Gauss's lemma, and all its consequences that do not involve the existence of a complete factorization remain true over any GCD domain (an integral domain over which greatest common divisors exist). In particular, a polynomial ring over a GCD domain is also a GCD domain. If one calls primitive a polynomial such that the coefficients generate the unit ideal, Gauss's lemma is true over every commutative ring. However, some care must be taken, when using this definition of primitive, as, over a unique factorization domain that is not a principal ideal domain, there are polynomials that are primitive in the above sense and not primitive in this new sense.
  • 3.0K
  • 28 Nov 2022
Topic Review
Word Lists by Frequency
Word lists by frequency are lists of a language's words grouped by frequency of occurrence within some given text corpus, either by levels or as a ranked list, serving the purpose of vocabulary acquisition. A word list by frequency "provides a rational basis for making sure that learners get the best return for their vocabulary learning effort" (Nation 1997), but is mainly intended for course writers, not directly for learners. Frequency lists are also made for lexicographical purposes, serving as a sort of checklist to ensure that common words are not left out. Some major pitfalls are the corpus content, the corpus register, and the definition of "word". While word counting is a thousand years old, with still gigantic analysis done by hand in the mid-20th century, natural language electronic processing of large corpora such as movie subtitles (SUBTLEX megastudy) has accelerated the research field. In computational linguistics, a frequency list is a sorted list of words (word types) together with their frequency, where frequency here usually means the number of occurrences in a given corpus, from which the rank can be derived as the position in the list.
  • 3.0K
  • 29 Nov 2022
Topic Review
Network Intrusion Detection Systems Using Artificial Intelligence/Machine Learning
The rapid growth of the Internet and communications has resulted in a huge increase in transmitted data. These data are coveted by attackers and they continuously create novel attacks to steal or corrupt these data. The growth of these attacks is an issue for the security of systems and represents one of the biggest challenges for intrusion detection. An intrusion detection system (IDS) is a tool that helps to detect intrusions by inspecting the network traffic. Although many researchers have studied and created new IDS solutions, IDS still needs improving in order to have good detection accuracy while reducing false alarm rates. 
  • 2.9K
  • 23 Dec 2022
Topic Review
Yan Tan Tethera
Yan Tan Tethera is a sheep-counting rhyme/system traditionally used by shepherds in Northern England and earlier in some other parts of Britain. Until the Industrial Revolution, the use of traditional number systems was common among shepherds, especially in the fells of the Lake District. The Yan Tan Tethera system was also used for counting stitches in knitting. The words derive from a Brythonic Celtic language. Though most of these number systems fell out of use by 1910, some are still in use. The word yan or yen for "one" in some northern English dialects generally represents a regular development in Northern English in which the Old English long vowel /ɑː/ was broken into /ie/, /ia/ and so on. This explains the shift to yan and ane from the Old English ān, which is itself derived from the Proto-Germanic *ainaz. Another example of this development is the Northern English word for "home", hame, which has forms such as hyem, yem and yam all deriving from the Old English hām.
  • 2.9K
  • 20 Nov 2022
Topic Review
List of Doom Source Ports
This article is a list of unofficial source ports of the Doom engine, which was originally used in the video game Doom. Most often, the source ports presented here are modifications made by the Doom community, as opposed to the official Doom versions produced by id Software or affiliated companies. The Doom engine's source code was released to the public on December 23, 1997. Although Doom was originally created for MS-DOS, the original source release was for the subsequent Linux version, due to the use of a proprietary sound library in the DOS version. The original purpose of source ports was cross-platform compatibility, but shortly after the release of the Doom source code, programmers were correcting old, unaddressed Doom bugs and deficiencies in their own source ports, and later on introducing their own modifications to enhance game features and alter gameplay. The source code was originally released under a proprietary license that prohibited commercial use and did not require programmers to provide the source code for the modifications they released in executable form, but it was later re-released on October 3, 1999 under the GNU General Public License after requests from the community.
  • 2.9K
  • 06 Feb 2023
Topic Review
Delphi (IDE)
Delphi is an integrated development environment (IDE) for rapid application development of desktop, mobile, web, and console software, developed by Embarcadero Technologies. It is also an event-driven language. Delphi's compilers use their own Object Pascal dialect of Pascal and generate native code for Microsoft Windows, macOS (IA-32 only), iOS, Android and Linux (x64 only). Since 2016, there have been new releases of Delphi every six months, with new platforms being added approximately every second release. Delphi includes a code editor, a visual designer, an integrated debugger, a source code control component, and support for third-party plugins. The code editor features Code Insight (code completion), Error Insight (real-time error-checking), and refactoring. The visual forms designer has traditionally used Visual Component Library (VCL) for native Windows development, but the FireMonkey (FMX) platform was later added for cross-platform development. Database support in Delphi is very strong. A Delphi project of a million lines to compile in a few seconds – one benchmark gave 170,000 lines per second. Delphi was originally developed by Borland as a rapid application development tool for Windows as the successor of Turbo Pascal. Delphi added full object-oriented programming to the existing language, and since then the language has grown to support generics and anonymous methods, and native Component Object Model (COM) support. In 2006, Borland’s developer tools section was transferred from Borland to a wholly owned subsidiary known as CodeGear, which was sold to Embarcadero Technologies in 2008. In 2015, Embarcadero was purchased by Idera Software, but the Embarcadero mark was retained for the developer tools division. Delphi and its C++ counterpart, C++Builder, are interoperable. They share many core components, notably the IDE, VCL, and much of the runtime library. In addition, they can be used jointly in a project. For example, C++Builder 6 and later can consume Delphi source code and C++ in one project, while packages compiled with C++Builder can be used from within Delphi. In 2007, the products were released jointly as RAD Studio, a shared host for Delphi and C++Builder, which can be purchased with either or both.
  • 2.9K
  • 02 Nov 2022
Topic Review
Location-Based Social Networks
There are several definitions for “geosocial network” or “location-based social network”: the first formal definition was given by Quercia et al. in 2010, who defined it as “a type of social networking in which geographic services and capabilities such as geocoding and geotagging are used to enable additional social dynamics”. One year later, Zheng refined this definition by stating that “a location-based social network (LBSN) does not only mean adding a location to an existing social network so that people in the social structure can share location embedded information but also consists of the new social structure made up of individuals connected by the interdependency derived from their locations in the physical world as well as their location-tagged media content, such as photos, video, and texts”. In 2013, Roick and Heuser defined LBSNs simply as “social network sites that include location information into shared contents”. Finally, one most recent definition is given by Armenatzoglou and Papadias and is the following: “geosocial network (GeoSN) is an online social network augmented by geographical information”.
  • 2.9K
  • 17 Jan 2022
Topic Review
Cryptography
Cryptography, or cryptology (from Ancient Greek: "hidden, secret"; and γράφειν graphein, "to write", or -λογία -logia, "study", respectively), is the practice and study of techniques for secure communication in the presence of adversarial behavior. More generally, cryptography is about constructing and analyzing protocols that prevent third parties or the public from reading private messages. Modern cryptography exists at the intersection of the disciplines of mathematics, computer science, information security, electrical engineering, digital signal processing, physics, and others. Core concepts related to information security (data confidentiality, data integrity, authentication, and non-repudiation) are also central to cryptography. Practical applications of cryptography include electronic commerce, chip-based payment cards, digital currencies, computer passwords, and military communications. Cryptography prior to the modern age was effectively synonymous with encryption, converting readable information (plaintext) to unintelligible nonsense text (ciphertext), which can only be read by reversing the process (decryption). The sender of an encrypted (coded) message shares the decryption (decoding) technique only with intended recipients to preclude access from adversaries. The cryptography literature often uses the names "Alice" (or "A") for the sender, "Bob" (or "B") for the intended recipient, and "Eve" (or "E") for the eavesdropping adversary. Since the development of rotor cipher machines in World War I and the advent of computers in World War II, cryptography methods have become increasingly complex and their applications more varied. Modern cryptography is heavily based on mathematical theory and computer science practice; cryptographic algorithms are designed around computational hardness assumptions, making such algorithms hard to break in actual practice by any adversary. While it is theoretically possible to break into a well-designed system, it is infeasible in actual practice to do so. Such schemes, if well designed, are therefore termed "computationally secure"; theoretical advances (e.g., improvements in integer factorization algorithms) and faster computing technology require these designs to be continually reevaluated, and if necessary, adapted. Information-theoretically secure schemes that cannot be broken even with unlimited computing power, such as the one-time pad, are much more difficult to use in practice than the best theoretically breakable, but computationally secure, schemes. The growth of cryptographic technology has raised a number of legal issues in the Information Age. Cryptography's potential for use as a tool for espionage and sedition has led many governments to classify it as a weapon and to limit or even prohibit its use and export. In some jurisdictions where the use of cryptography is legal, laws permit investigators to compel the disclosure of encryption keys for documents relevant to an investigation. Cryptography also plays a major role in digital rights management and copyright infringement disputes in regard to digital media.
  • 2.9K
  • 28 Nov 2022
Topic Review
Integration of Blockchain Technology with Cloud Computing
Blockchain technology’s desirable characteristics are decentralization, integrity, immutability, verification, fault tolerance, anonymity, audibility, and transparency. There are many benefits of blockchain technology concerning cloud computing, including those associated with business data handling, privacy, and encryption. 
  • 2.9K
  • 29 Nov 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