Search results for "upper"
showing 10 items of 987 documents
Nearly tight bounds on the learnability of evolution
2002
Evolution is often modeled as a stochastic process which modifies DNA. One of the most popular and successful such processes are the Cavender-Farris (CF) trees, which are represented as edge weighted trees. The Phylogeny Construction Problem is that of, given /spl kappa/ samples drawn from a CF tree, output a CF tree which is close to the original. Each CF tree naturally defines a random variable, and the gold standard for reconstructing such trees is the maximum likelihood estimator of this variable. This approach is notoriously computationally expensive. We show that a very simple algorithm, which is a variant on one of the most popular algorithms used by practitioners, converges on the t…
Complete weights andv-peak points of spaces of weighted holomorphic functions
2006
We examine the geometric theory of the weighted spaces of holomorphic functions on bounded open subsets ofC n ,C n ,H v (U) and\(H_{v_o } (U)\), by finding a lower bound for the set of weak*-exposed and weak*-strongly exposed points of the unit ball of\(H_{v_o } (U)'\) and give necessary and sufficient conditions for this set to be naturally homeomorphic toU. We apply these results to examine smoothness and strict convexity of\(H_{v_o } (U)\) and\(H_v (U)\). We also investigate whether\(H_{v_o } (U)\) is a dual space.
How Low Can Approximate Degree and Quantum Query Complexity Be for Total Boolean Functions?
2012
It has long been known that any Boolean function that depends on n input variables has both degree and exact quantum query complexity of Omega(log n), and that this bound is achieved for some functions. In this paper we study the case of approximate degree and bounded-error quantum query complexity. We show that for these measures the correct lower bound is Omega(log n / loglog n), and we exhibit quantum algorithms for two functions where this bound is achieved.
On the effect of analog noise in discrete-time analog computations
1998
We introduce a model for analog computation with discrete time in the presence of analog noise that is flexible enough to cover the most important concrete cases, such as noisy analog neural nets and networks of spiking neurons. This model subsumes the classical model for digital computation in the presence of noise. We show that the presence of arbitrarily small amounts of analog noise reduces the power of analog computational models to that of finite automata, and we also prove a new type of upper bound for the VC-dimension of computational models with analog noise.
Creating a semantically-enhanced cloud services environment through ontology evolution
2014
Currently, the availability of Web resources has grown enormously to the point that whatever a user needs at a given moment can potentially be found on the Internet. These resources are not limited to data items anymore, functionality delivered through some sort of service architectural model is also offered on the Internet. In the last few years, cloud computing has emerged as one of the most popular computing models to provide services over the Internet. However, as the number of available cloud services increases, the problem of service discovery and selection arises. Experience indicates that semantic technologies can provide the basis for enhanced and more precise search processes. In …
Mobile Ontologies
2008
The number of mobile subscribers in the world is soon reaching the three billion mark. According to the newest estimates, majority of the subscribers are already in the developing countries, whereas the number of subscribers in the industrialized countries is about to stagnate around one billion. Because especially in the developing countries the only access to Internet are mobile devices, developing high quality services based on them grows in importance. Ontologies are an important ingredient towards more complicated mobile services and wider usage of mobile terminals. In this article, we first discuss ontology and epistemology concepts in general. After that, we review ontologies in the …
High Precision Conservative Surface Mesh Generation for Swept Volumes
2015
We present a novel, efficient, and flexible scheme to generate a high-quality mesh that approximates the outer boundary of a swept volume. Our approach comes with two guarantees. First, the approximation is conservative, i.e., the swept volume is enclosed by the generated mesh. Second, the one-sided Hausdorff distance of the generated mesh to the swept volume is upper bounded by a user defined tolerance. Exploiting this tolerance the algorithm generates a mesh that is adapted to the local complexity of the swept volume boundary, keeping the overall output complexity remarkably low. The algorithm is two-phased: the actual sweep and the mesh generation. In the sweeping phase, we introduce a g…
Dynamic Channel Aggregation Strategies in Cognitive Radio Networks with Spectrum Adaptation
2011
In cognitive radio networks, channel aggregation techniques which combine several channels together as one channel have been proposed in many MAC protocols. In this paper, spectrum adaptation is proposed in channel aggregation and two strategies which dynamically adjust channel occupancy of ongoing traffic flows are further developed. The performance of these strategies is evaluated using continuous time Markov chain models. Moreover, models in the quasi-stationary regime are analyzed and the closed-form capacity expression is derived in this regime. Numerical results demonstrate that the capacity of the secondary network can be improved by using channel aggregation with spectrum adaptation.
Parameter optimization for amplify-and-forward relaying systems with pilot symbol assisted modulation scheme
2009
Article published in the journal:Wireless Sensor Network Also available from publisher: http://dx.doi.org/10.4236/wsn.2009.11003 Cooperative diversity is a promising technology for future wireless networks. In this paper, we consider a cooperative communication system operating in an amplify-and-forward (AF) mode with a pilot symbol assisted modulation (PSAM) scheme. It is assumed that a linear minimum mean square estimator (LMMSE) is used for the channel estimation at the receiver. A simple and easy-to-evaluate asymptotical upper bound (AUB) of the symbol-error-rate (SER) is derived for uncoded AF cooperative communication systems with quadrature amplitude modulation (QAM) constellations. …
Domain-Specific OWL Ontology Visualization with OWLGrEd
2015
The OWLGrEd ontology editor allows graphical visualization and authoring of OWL 2.0 ontologies using a compact yet intuitive presentation that combines UML class diagram notation with textual Manchester syntax for expressions. We present an extension mechanism for OWLGrEd that allows adding custom information areas, rules and visual effects to the ontology presentation thus enabling domain specific OWL ontology visualizations. The usage of OWLGrEd and its extensions is demonstrated on ontology engineering examples involving custom annotation visualizations, advanced UML class dia-gram constructs and integrity constraints in semantic database schema design.