# Tag Info

6

I don't know about robotics, but ontologies are part of the standard toolkit for modern expert systems, especially those with a natural language processing component. For example, consider the process of performing literature searches for systematic reviews in medicine. Of the millions of medical studies out there, reviewers need to find the 20 or so high-...

4

IBM's question-answering system, Watson, used the ontology DBPedia in their evidence scoring algorithms to compete (and win) the Jeopardy Challenge.

3

Ontologies abstractly defined are "representation of knowledge": the object and their relations. Basically the ontology represent the knowledge exploited by the "intelligent" agent. Now in practice, ontologies can be used either as: a structured knowledge representation for domain-specific databases a structured data format for interoperability of ...

3

Ontology gives you a power to model, reason and manage complex data systems from different domains. For example Natural Language Processing (NLP), Molecular Biology and Bioinformatic, Wireless Sensor Networks, to name a few. Considering semantic web (RDF-based) as a special use case of ontology-based systems, there are many companies and commercials on that ...

2

The angle between the projections of the target point, along the host surfaces, is technically called Triangulation Angle.

2

There is a fairly strong connection between ontologies and APIs. An ontology can be regarded roughly as a word-based API. Many are associated with web-based languages in XML part of the so-called semantic web also defined here. Tim Berners Lee, the inventor of the web, has strongly advocated the semantic web & has written on it. Here are two simple ...

2

In order to get valid paths in the free space from paths in the graph $G=(V,E)$ that is constructed via the trapezoidal decomposition, we require that all edges of $G$ lie inside the free space. The segment between two centers of adjacent trapezoids is not always fully contained inside the free space. For example, consider a square and take a slightly ...

1

If we focus solely on the dispensing operation, we can formulate this as a Set Cover Problem. Namely, we are given a set of tips that have already aspirated some source liquids and we are asked to minimze the number of dispense operations to fill up a given column of target vials. In this simplified set up, we aren't allowed to go back and aspirate new ...

1

$$\mathcal{N}(x|m,\Sigma)=(2\pi)^{-k/2}|\Sigma|^{-1/2}\exp\left(-2^{-1}(x-m)^T\Sigma^{-1}(x-m)\right)$$ where $x,m$ are vectors of dimension $k$, $\Sigma$ is a $k\times k$ matrix, $|\Sigma|$ is its determinant. The vector $m$ represents the mean of the multivariate normal, and $\Sigma$ the covariance matrix, which must be positive definite.

1

The way we decide is we try to solve it and see if we are successful; or we look to see whether someone else has solved it (e.g., in the research literature). Usually the question doesn't really make sense, as it is not well-defined what it means to "solve" or "deal with" a problem. It's not like in mathematics, where it is a crisp black-and-white. ...

1

A Kalman filter is a reasonable choice for this. It is useful for tracking the movement of an object, as it can be used with a model for the physics of the movement of an object.

1

I assume by "comparable part of the area" you mean that they should all scan a region of equal area. Additionally, knowing what kind of plane area you have would be helpful, is it convex, is it concave, is it just a regular polygon? If you know this then there are easier ways to do it. So assuming you want for the worst case, a concave polygon, the best ...

1

If you use wall following with the right hand, you should place your hand on the right wall. For the pledge algorithm your source says It's a guaranteed way to reach an exit on the outer edge of any 2D Maze from any point in the middle, however it's not able to do the reverse, i.e. find a solution within the Maze. There is no guarantee that the exit ...

Only top voted, non community-wiki answers of a minimum length are eligible