Learn More
Aiming to build a complete benchmark for better evaluation of existing ontology systems, we extend the well-known Lehigh University Benchmark in terms of inference and scalability testing. The extended benchmark, named University Ontology Benchmark (UOBM), includes both OWL Lite and OWL DL ontologies covering a complete set of OWL Lite and DL constructs,(More)
Keywords: Discrete Homological nontrivial critical point Morse theory Local linking a b s t r a c t In this paper, the existence and multiplicity results of solutions are obtained for the discrete nonlinear two point boundary value problem (BVP) ÀD 2 uðk À 1Þ ¼ kf ðk; uðkÞÞ k 2 þ is a parameter. By using the critical point theory and Morse theory, we obtain(More)
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and computation between a master and several workers. Multi-round scheduling has been used for divisible work-loads in previous work and our contribution is as follows. We use " uniform(More)
In this paper, we propose a novel approach for learning generic visual vocabulary. We use diffusion maps to automatically learn a semantic visual vocabulary from abundant quantized midlevel features. Each midlevel feature is represented by the vector of pointwise mutual information (PMI). In this midlevel feature space, we believe the features produced by(More)
—Many applications in scientific and engineering domains are structured as large numbers of independent tasks with low granularity. These applications are thus amenable to straightforward parallelization, typically in master-worker fashion, provided that efficient scheduling strategies are available. Such applications have been called divisible loads(More)
—In this paper, we derive the closed-form delay distributions of slotted ALOHA and nonpersistent carrier sense multiple access (CSMA) protocols under steady state. Three retrans-mission policies are analyzed. We find that under a binary exponential backoff retransmission policy, finite average delay and finite delay variance can be guaranteed for 2 and 4 3,(More)
Color naming, which relates colors with color names, can help people with a semantic analysis of images in many computer vision applications. In this paper, we propose a novel salient color names based color descriptor (SCNCD) to describe colors. SCNCD utilizes salient color names to guarantee that a higher probability will be assigned to the color name(More)
Divisible load applications occur in many fields of science and engineering, can be easily parallelized in a master-worker fashion, but pose several scheduling challenges. While a number of approaches have been proposed that allocate work to workers in a single round, using multiple rounds improves overlap of computation with communication. Unfortunately,(More)
—The random access channel (RACH) in a universal terrestrial radio access-frequency division duplex (UTRA-FDD) system is a contention-based channel mainly used to carry control information from mobile stations (MS) to base stations (BS). The transmission of a random access request contains two steps: preamble transmission and message transmission. In(More)
Orthogonal Variable Spreading Factor (OVSF) codes are used in both UTRA-FDD and UTRA-TDD of the third-generation (3G) mobile communication systems. They can support multirate transmissions for mobile terminals with multicode transmission capabilities. In this paper, a new OVSF code assignment scheme, namely " Multicode Multirate Compact Assignment " (MMCA),(More)