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
Requirements of Compression in Key-Value Stores
A key–value store is a de facto standard database for unstructured big data. Key–value stores, such as Google’s LevelDB and Meta’s RocksDB, have emerged as a popular solution for managing unstructured data due to their ability to handle diverse data types with a simple key–value abstraction. Simultaneously, a multitude of data management tools have actively adopted compression techniques, such as Snappy and Zstd, to effectively reduce data volume.
  • 342
  • 27 Oct 2023
Topic Review
Random Number Generation
Ever since the antiquity, random number generation has played an important role both in common everyday life activities, such as leisure games, as well as in the advancement of science. Such means as dice and coins have been employed since the ancient times in order to generate random numbers that were used for gambling, dispute resolution, leisure games, and perhaps even fortune-telling. The theory behind the generation of random numbers, as well as the ability to potentially predict the outcome of this process, has been heavily studied and exploited by mathematics, in an attempt to either ensure the randomness of the process, to gain an advantage in correctly predicting its future outcomes, or to approximate the results of rather complicated computations. Especially in cryptography, random numbers are used due to the aforementioned properties, so that attackers have no other option but to guess the secret. This fact, in conjunction with the ongoing digitalisation of our world, has led to an interest in random number generation within the framework of computer science. In this context, random number generation systems are classified into two main categories: pseudorandom number generators and true random number generators, with the former generating sequences of numbers that appear to be random, but are in fact completely predictable when the initial value (being referred to as the seed) and conditions used for the number generation process are known, and with the latter generating truly random sequences of numbers that can only be predicted (correctly) with negligible probability, even if the initial value and conditions are known. 
  • 797
  • 24 Mar 2023
Topic Review
Rack Locations in the Mobile-Rack Picking System
The flexible movement of racks in the mobile-rack picking system (MRPS) significantly improves the picking efficiency of e-commerce orders with the characteristics of “one order multi–items” and creates a challenging problem of how to place racks in the warehouse. This is because the placement of each rack in the MRPS directly influences the distance that racks need to be moved during order picking, which in turn affects the order picking efficiency.
  • 113
  • 23 Feb 2024
Topic Review
Platform Supply Chain Coordination Considering Fresh-Keeping Service
With changes in demand and the emergence of new distribution channels, consumer-centric buyer’s markets for many products have been formed. The platform supply chain has been continuously optimized and upgraded. Supply chain leaders have moved downstream to the end of the supply chain. The operational value has been further enhanced. The corresponding systematic construction of the platform supply chain has become an important driving force for future development. 
  • 160
  • 09 Oct 2023
Topic Review
Pan-Tompkins Algorithm
The Pan-Tompkins algorithm is commonly used to detect QRS complexes in electrocardiographic signals (ECG). The QRS complex represents the ventricular depolarization and the main spike visible in an ECG signal (see figure). This feature makes it particularly suitable for measuring heart rate, the first way to assess the heart health state. In the first derivation of Einthoven of a physiological heart, the QRS complex is composed by a downward deflection (Q wave), an high upward deflection (R wave) and a final downward deflection (S wave). The Pan-Tompkins algorithm applies a series of filters to highlight the frequency content of this rapid heart depolarization and removes the background noise. Then, it squares the signal to amplify the QRS contribute. Finally, it applies adaptive thresholds to detect the peaks of the filtered signal. The algorithm was proposed by Jiapu Pan and Willis J. Tompkins in 1985, in the journal IEEE Transactions on Biomedical Engineering . The performance of the method was tested on an annotated arrhythmia database (MIT/BIH) and evaluated also in presence of noise. Pan and Tompkins reported that the 99.3 percent of QRS complexes was correctly detected.
  • 3.6K
  • 24 Oct 2022
Topic Review
Non-Malleable Codes
The notion of non-malleable codes was introduced in 2010 by Dziembowski, Pietrzak, and Wichs, for relaxing the notion of error-correction and error-detection. Informally, a code is non-malleable if the message contained in a modified code-word is either the original message, or a completely unrelated value. Non-malleable codes provide a useful and meaningful security guarantee in situations where traditional error-correction and error-detection is impossible; for example, when the attacker can completely overwrite the encoded message. Although such codes do not exist if the family of "tampering functions" F is completely unrestricted, they are known to exist for many broad tampering families F.
  • 377
  • 16 Nov 2022
Topic Review
Multiple Traveling Salesperson Problems
Multiple traveling salesperson problems (mTSP) are a collection of problems that generalize the classical traveling salesperson problem (TSP). In a nutshell, an mTSP variant seeks a minimum-cost collection of m paths that visit all vertices of a given weighted complete graph. Conceptually, mTSP lies between TSP and vehicle routing problems (VRP).
  • 989
  • 20 Jul 2023
Topic Review
Multi-View Stereo Method
As a 3D reconstruction method, multi-view stereoscopic (MVS) plays a vital role in 3D computer vision, and has a wide range of applications in the fields of virtual reality, augmented reality, and autonomous driving. With the rapid development of deep learning technology in the field of computer vision, the learning-based multi-view stereo method has produced advanced results.
  • 130
  • 18 Mar 2024
Topic Review
Maze Solving Algorithm
There are a number of different maze solving algorithms, that is, automated methods for the solving of mazes. The random mouse, wall follower, Pledge, and Trémaux's algorithms are designed to be used inside the maze by a traveler with no prior knowledge of the maze, whereas the dead-end filling and shortest path algorithms are designed to be used by a person or computer program that can see the whole maze at once. Mazes containing no loops are known as "simply connected", or "perfect" mazes, and are equivalent to a tree in graph theory. Thus many maze solving algorithms are closely related to graph theory. Intuitively, if one pulled and stretched out the paths in the maze in the proper way, the result could be made to resemble a tree.
  • 1.4K
  • 08 Nov 2022
Topic Review
Mathematical Modeling to Estimate Photosynthesis
Photosynthesis is a process that indicates the productivity of crops. The estimation of this variable can be achieved through methods based on mathematical models.
  • 1.0K
  • 22 Jun 2022
  • Page
  • of
  • 5
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
Feedback