This specification describes how DNS SRV records, DNS TXT records, and well-known URIs can be used together or separately to locate CalDAV (Calendaring Extensions to Web Distributed Authoring and Versioning (WebDAV)) or CardDAV (vCard Extensions to WebDAV) services. Information about the current status of this document, any errata, and how to provide feedback on it may be obtained at in effect ...

Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...

Let f(z) = 1 z+2z+2 and note that on the real axis f corresponds to the integrand above. From the equation x2 + 2x + 2 = 0 and the quadratic formula, we find that the singularities of f are −1± i and both are clearly simple poles. Let R > √ 2, c1 : z = x (−R ≤ x ≤ R), and c2 : z = Re (0 ≤ θ ≤ π). Then c = c1+c2 is a simple closed contour that contains −1+i in its interior (see figure). By the R...

This paper presents a research on object detection using image processing and neural network, entitled Nipple Detection for Obscene Pictures. Our research work is designed to enhance the effectiveness of pornography detection system by locating nipples in the picture to make sure that the given picture really contains human nudity. Our nipple detection model composing of human skin detection wh...

In the previous lecture, we covered a series of online/offline edge-weighted Steiner tree/forest problems. This lecture extends the discussion to the node-weighted scope. In particular, we will study the nodeweighted Steiner tree/forest problem and introduce an offline O(logn)−approximation polynomial-time algorithm[KR95]. It is well known there is no polynormial-time algorithm that achieves o(...

Locating specific chunks (records) of information within documents on the web is an interesting and nontrivial problem. If the problem of locating and separating records can be solved well, the longstanding problem of grouping extracted values into appropriate relationships in a record structure can be more easily resolved. Our solution is a hybrid of two well established techniques: (1) ontolo...