Encyclopedia
Scholarly Community
Encyclopedia
Entry
Video
Image
Journal
Book
News
About
Log in/Sign up
Submit
Entry
Video
Image
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
Knowledge Graph
The Google Knowledge Graph is a knowledge base used by Google and its services to enhance its search engine's results with information gathered from a variety of sources. The information is presented to users in an infobox next to the search results. Knowledge Graph infoboxes were added to Google's search engine in May 2012, starting in the United States, with international expansion by the end of the year. The information covered by Google's Knowledge Graph grew quickly after launch, tripling its size within seven months (covering 570 million entities and 18 billion facts) and answering "roughly one-third" of the 100 billion monthly searches Google processed in May 2016. It has been criticized for providing answers without source attribution or citation. Information from the Knowledge Graph is presented as a box, which Google has referred to as the "knowledge panel", to the right (top on mobile) of search results. According to Google, this information is retrieved from many sources, including the CIA World Factbook, Wikidata, and Wikipedia. In October 2016, Google announced that the Knowledge Graph held over 70 billion facts; by May 2020, this had grown to 500 billion facts on 5 billion entities. There is no official documentation of how the Knowledge Graph is implemented. It is used to answer direct spoken questions in Google Assistant and Google Home voice queries.
1.5K
02 Dec 2022
Topic Review
Robotic Platform for Horticulture
The modern level of development of infocommunication and computer technologies, microprocessor technology and equipment, communication and positioning makes possible the development and practical application of automated and robotic technologies and technical means to improve the efficiency of agricultural production. Currently, intensive horticulture is becoming increasingly widespread due to rapid fruiting and high yield rates. At the same time, the process of harvesting apples in intensive horticulture is the most time-consuming, and harvesting is carried out mainly by a team of pickers. In the production process of cultivating fruit crops, this is an important final stage which requires the development of automated devices and robotic platforms with a control system capable of offline harvesting.
824
02 Dec 2022
Topic Review
Semantic Segmentation of Medical Images
There have been major developments in deep learning in computer vision since the 2010s. Deep learning has contributed to a wealth of data in medical image processing, and semantic segmentation is a salient technique in this field. Lesion detection is one of the primary objectives of medical imaging, as the size and location of lesions are often directly associated with a patient’s diagnosis, treatment, and prognosis. Since the development of computer vision algorithms, however, researchers have begun to utilize these algorithms in the field of medical imaging.
408
02 Dec 2022
Topic Review
Vision-Based Structural Vibration Tracking Using a Digital Camera
Computer-vision-based target tracking can be applied to structural vibration monitoring, but current target tracking methods suffer from noise in digital image processing. A new target-tracking method based on the sparse optical flow technique is introduced to improve the accuracy in tracking the target, especially when the target has a large displacement. The proposed method utilizes the ORB technique to maintain a variety of keypoints and combines the multi-level strategy with a sparse optical flow algorithm to search the keypoints with a large motion vector for tracking. Then, an outlier removal method based on Hamming distance and interquartile range (IQR) score is introduced to minimize the error. The proposed target tracking method is verified through a lab experiment---a three-story shear building structure subjected to various harmonic excitations. It is compared with existing sparse optical flow-based target tracking methods and target tracking methods based on three other types of techniques, i.e., feature matching, dense optical flow, and template matching. The results show that the performance of target tracking is greatly improved through the use of a multi-level strategy and the proposed outlier removal method. The proposed sparse optical flow-based target tracking method achieves the best accuracy compared to other existing target tracking methods.
570
01 Dec 2022
Topic Review
Virtual Synchrony
Virtual synchrony is an interprocess message passing (sometimes called ordered, reliable multicast) technology. Virtual synchrony systems allow programs running in a network to organize themselves into process groups, and to send messages to groups (as opposed to sending them to specific processes). Each message is delivered to all the group members, in the identical order, and this is true even when two messages are transmitted simultaneously by different senders. Application design and implementation is greatly simplified by this property: every group member sees the same events (group membership changes and incoming messages) in the same order. A virtually synchronous service is typically implemented using a style of programming called state machine replication, in which a service is first implemented using a single program that receives inputs from clients through some form of remote message passing infrastructure, then enters a new state and responds in a deterministic manner. The initial implementation is then transformed so that multiple instances of the program can be launched on different machines, using a virtually synchronous message passing system to replicate the incoming messages over the members. The replicas will see the same events in the same order, and are in the same states, hence they will make the same state transitions and remain in a consistent state. The replication of the service provides a form of fault-tolerance: if a replica fails (by crashing), the others remain and can continue to provide responses. Different members of the replica group can also be programmed to subdivide the workload, typically by using the group membership to determine their respective roles. This permits a group of N members to run as much as N times faster than a single member, or to handle N times as many requests, while continuing to offer fault-tolerance in the event of a crash. Virtual synchrony is distinguished from classical state machine replication because the model includes features whereby a programmer can request early (optimistic) delivery of messages, or relaxed forms of ordering. When used appropriately, these features can enable substantial speedup. However, the programmer needs to be sure that the relaxation of guarantees will not compromise correctness. For example, in a service that uses locking to protect concurrently updated data, the messaging system can be instructed to use an inexpensive form of message ordering, in which the messaging system respects the ordering in which individual senders send messages (FIFO guarantee) but does not attempt to impose an agreed order if messages are sent concurrently by different senders. Provided that the sender indeed held locks on the data, it can be shown that FIFO ordering suffices for correctness. The benefit is that FIFO ordering is much less costly to implement than total ordering for concurrent messages. To give another example, by delivering messages optimistically, virtual synchrony systems can outperform the Paxos that is normally required for implementation of state machine replication: Paxos normally requires a 2-phase protocol, whereas optimistic virtual synchrony protocols can deliver messages immediately upon their arrival. However, this could result in a violation of the safety property of the state machine replication model. To prevent such problems, the programmer who uses this feature is required to invoke a primitive called flush, which delays the caller until any optimistically delivered messages have reached all of the group members. Provided that the programmer understands this behavior and is careful to call flush before interacting with external clients or persistent storage, higher performance can be achieved without loss of safety. The flexibility associated with these limited forms of event reordering and optimistic early delivery permit virtual synchrony platforms to achieve extremely high data rates while still preserving very strong fault-tolerance and consistency guarantees.
1.2K
01 Dec 2022
Topic Review
Completion (Algebra)
In abstract algebra, a completion is any of several related functors on rings and modules that result in complete topological rings and modules. Completion is similar to localization, and together they are among the most basic tools in analysing commutative rings. Complete commutative rings have a simpler structure than general ones, and Hensel's lemma applies to them. In algebraic geometry, a completion of a ring of functions R on a space X concentrates on a formal neighborhood of a point of X: heuristically, this is a neighborhood so small that all Taylor series centered at the point are convergent. An algebraic completion is constructed in a manner analogous to completion of a metric space with Cauchy sequences, and agrees with it in case R has a metric given by a non-Archimedean absolute value.
662
01 Dec 2022
Topic Review
μ-Recursive Function
In mathematical logic and computer science, the general recursive functions (often shortened to recursive functions) or μ-recursive functions are a class of partial functions from natural numbers to natural numbers that are "computable" in an intuitive sense. In computability theory, it is shown that the μ-recursive functions are precisely the functions that can be computed by Turing machines(this is one of the theorems that supports the Church–Turing thesis). The μ-recursive functions are closely related to primitive recursive functions, and their inductive definition (below) builds upon that of the primitive recursive functions. However, not every μ-recursive function is a primitive recursive function—the most famous example is the Ackermann function. Other equivalent classes of functions are the λ-recursive functions and the functions that can be computed by Markov algorithms. The subset of all total recursive functions with values in {0,1} is known in computational complexity theory as the complexity class R.
2.2K
01 Dec 2022
Topic Review
Blockchain Overview
Blockchain technology integrates a hash algorithm, digital signature, point-to-point transmission, consensus mechanism, and other existing technologies, so it is characterized by anti-fraud, traceability, security, and trust. Supply chain refers to the network chain structure formed by upstream and downstream enterprises involved in the activities of providing products or services to end users in the process of production and circulation.
631
01 Dec 2022
Topic Review
Ten Rays Model
The ten-ray model is a model applied to the transmissions in the urban area, to generate a model of ten rays typically four rays more are added to the six rays model, these are ([math]\displaystyle{ R3 }[/math] and [math]\displaystyle{ R4 }[/math] bouncing on both sides of the wall); This incorporate paths from one to three reflections: specifically, there is the LOS (Line of sight), GR (ground reflected), SW (single-wall reflected), DW (double-wall reflected), TW (triple-wall reflected), WG (wall-ground reflected) and GW (ground-wall reflected paths). Where each one of the paths bounces on both sides of the wall. Experimentally, it has been demonstrated that the ten ray model simulates or can represent the propagation of signals through a dielectric canyon, in it which the rays that travel from a transmitter point to a receiver point bounce many times. As example for this model it is assume: a rectilinear free space with two walls, one upper and the other lower, from which two vertical bases are positioned at their ends, these are the transmitting and receiving antennas that it’s locate in such a way that their heights don’t surpass the limits of the top wall; Achieved this the structure acts as free space for its functioning similar to that of a dielectric canyon of signals propagation, since the rays transmitted from the transmitting antenna will collide each side of the upper and lower walls infinity of times (for this example up to 3 reflections) until reaching the receiving antenna. During the course of the rays for each reflection they suffer, part of the energy of the signal is dissipated in each reflection, normally after the third reflection of said ray its resulting component which is a retro-reflected ray is insignificant with a negligible energy.
448
01 Dec 2022
Topic Review
Pointman (User Interface)
Pointman is a seated user interface for controlling one's avatar in a 3D virtual environment. It combines head tracking, a gamepad, and sliding foot pedals to provide positional control over many aspects of the avatar's posture. Pointman was developed by the US Naval Research Laboratory (NRL) to support the use of dismounted infantry simulation for USMC training and mission rehearsal. NRL's goal in developing Pointman was to extend the range and precision of actions supported by virtual simulators, to better represent what infantrymen can do.
244
01 Dec 2022
Page
of
371
Featured Entry Collections
>>
Featured Books
>>
Encyclopedia of Social Sciences
Chief Editor:
Michael McAleer
Encyclopedia of COVID-19
Chief Editor:
Stephen Bustin
Encyclopedia of Fungi
Chief Editor:
Luis V. Lopez-Llorca
Encyclopedia of Digital Society, Industry 5.0 and Smart City
Chief Editor:
Sandro Serpa
Entry
Video
Image
Journal
Book
News
About
Log in/Sign up
New Entry
New Video
New Images
About
Terms and Conditions
Privacy Policy
Advisory Board
Contact
Partner
ScholarVision Creations
Feedback
Top
Feedback
×
Help Center
Browse our user manual, common Q&A, author guidelines, etc.
Rate your experience
Let us know your experience and what we could improve.
Report an error
Is something wrong? Please let us know!
Other feedback
Other feedback you would like to report.
×
Did you find what you were looking for?
Love
Like
Neutral
Dislike
Hate
0
/500
Email
Do you agree to share your valuable feedback publicly on
Encyclopedia
’s homepage?
Yes, I agree. Encyclopedia can post it.
No, I do not agree. I would not like to post my testimonial.
Webpage
Upload a screenshot
(Max file size 2MB)
Submit
Back
Close
×