On strong centerpoints

Let P be a set of n points in R-d and F be a family of geometric objects. We call a point x is an element of P a strong centerpoint of P w.r.t..F if x is contained in all F is an element of F that contains more than cn points of P, where c is a fixed constant. A strong centerpoint does not exist even when F is the family of halfspaces in the plane. We prove the existence of strong centerpoints with exact constants for convex polytopes defined by a fixed set of orientations. We also prove the existence of strong centerpoints for abstract set systems with bounded intersection. (C) 2014 Elsevier B.V. All rights reserved.

Novel Biobjective Clustering (BiGC) Based on Cooperative Game Theory

We propose a new approach to clustering. Our idea is to map cluster formation to coalition formation in cooperative games, and to use the Shapley value of the patterns to identify clusters and cluster representatives. We show that the underlying game is convex and this leads to an efficient biobjective clustering algorithm that we call BiGC. The algorithm yields high-quality clustering with respect to average point-to-center distance (potential) as well as average intracluster point-to-point distance (scatter). We demonstrate the superiority of BiGC over state-of-the-art clustering algorithms (including the center based and the multiobjective techniques) through a detailed experimentation using standard cluster validity criteria on several benchmark data sets. We also show that BiGC satisfies key clustering properties such as order independence, scale invariance, and richness.

Hybrid Working Set Algorithm for SVM Learning With a Kernel Coprocessor on FPGA

Support vector machines (SVM) are a popular class of supervised models in machine learning. The associated compute intensive learning algorithm limits their use in real-time applications. This paper presents a fully scalable architecture of a coprocessor, which can compute multiple rows of the kernel matrix in parallel. Further, we propose an extended variant of the popular decomposition technique, sequential minimal optimization, which we call hybrid working set (HWS) algorithm, to effectively utilize the benefits of cached kernel columns and the parallel computational power of the coprocessor. The coprocessor is implemented on Xilinx Virtex 7 field-programmable gate array-based VC707 board and achieves a speedup of upto 25x for kernel computation over single threaded computation on Intel Core i5. An application speedup of upto 15x over software implementation of LIBSVM and speedup of upto 23x over SVMLight is achieved using the HWS algorithm in unison with the coprocessor. The reduction in the number of iterations and sensitivity of the optimization time to variation in cache size using the HWS algorithm are also shown.

Feedback on HE in FE bids

An analysis of the bids submitted to the HE in FE programme call for proposals as part of Circular 4/06. The call was for projects to implement and pilot e-learning technologies within one or more HE course delivered in one or more FE college.

Logarithmic Potential Theory on Riemann Surfaces

We develop a logarithmic potential theory on Riemann surfaces which generalizes logarithmic potential theory on the complex plane. We show the existence of an equilibrium measure and examine its structure. This leads to a formula for the structure of the equilibrium measure which is new even in the plane. We then use our results to study quadrature domains, Laplacian growth, and Coulomb gas ensembles on Riemann surfaces. We prove that the complement of the support of the equilibrium measure satisfies a quadrature identity. Furthermore, our setup allows us to naturally realize weak solutions of Laplacian growth (for a general time-dependent source) as an evolution of the support of equilibrium measures. When applied to the Riemann sphere this approach unifies the known methods for generating interior and exterior Laplacian growth. We later narrow our focus to a special class of quadrature domains which we call Algebraic Quadrature Domains. We show that many of the properties of quadrature domains generalize to this setting. In particular, the boundary of an Algebraic Quadrature Domain is the inverse image of a planar algebraic curve under a meromorphic function. This makes the study of the topology of Algebraic Quadrature Domains an interesting problem. We briefly investigate this problem and then narrow our focus to the study of the topology of classical quadrature domains. We extend the results of Lee and Makarov and prove (for n ≥ 3) c ≤ 5n-5, where c and n denote the connectivity and degree of a (classical) quadrature domain. At the same time we obtain a new upper bound on the number of isolated points of the algebraic curve corresponding to the boundary and thus a new upper bound on the number of special points. In the final chapter we study Coulomb gas ensembles on Riemann surfaces.

Michelle Cliffs Abeng and No telephone to heaven: a call to resistance

Escritores/as pós-coloniais têm se engajado em denunciar o doloroso legado da escravidão e do colonialismo, através da recuperação de histórias previamente apropriadas e distorcidas por narrativas mestras. A investigação e a narrativização do passado esquecido de ex-colônias têm sido uma estratégia empregada no sentido de se reconstruir identidades que foram fragmentadas devido às múltiplas opressões sofridas ou testemunhadas por autores. Michelle Cliff é uma romancista, poeta, e ensaísta diaspórica, nascida na Jamaica e que vive nos Estados Unidos. Ela é uma das muitas vozes pós-coloniais comprometidas com uma literatura de resistência que luta pela descolonização cultural e encoraja o sentimento de pertencimento. O objetivo dessa dissertação é analisar os romances de cunho autobiográfico de Cliff, Abeng (1984) e No Telephone to Heaven (1987), que lidam com questões relacionadas às práticas coloniais e pós-coloniais. Os dois romances retratam a saga da protagonista Clare Savage, através da qual Cliff revela o impacto da colonização no Caribe, denuncia as configurações de poder geradas a partir dos imbricamentos entre raça, gênero e classe, e critica a maneira deturpada como a história da Jamaica é transmitida e disseminada através da educação colonial à qual os Jamaicanos são submetidos. A autora também explora os efeitos que as diásporas exercem no processo de construção identitária e o movimento de resgate e recriação de uma história própria por parte dos sujeitos diaspóricos

Ghana coastal fisheries governance dialogue: Presentations, discussions and outcomes from a stakeholder forum on issues for reforming governance of Ghana’s coastal fisheries

This meeting, the second national Fisheries Governance Dialogue, aimed to help stakeholders in the fisheries sector generate a shared understanding of critical lessons and pathways for fisheries co-management success in Ghana. This was a direct response to the call from both fisheries communities and the government of Ghana for a radical change from the way fisheries resources are currently being managed. The meeting was attended by 60 men and women from stakeholder organizations and communities, and commenced with presentations on co-management experiences from local, regional and international participants. This was followed by panel discussions to extract lessons that specifically related to successfully implementing co-management in Ghana’s fisheries. Finally, breakout groups addressed in greater detail some issues of importance to fisheries governance reform in Ghana. While fisheries co-management is not a new concept in Ghana, participants heard that previous attempts to initiate these systems proved unsustainable. A number of lessons were drawn from these past experiences.

The effects of sediment transport on grain-size distributions

Changes in statistics (mean, sorting, and skewness) describing grain-size distributions have long been used to speculate on the direction of sediment transport. We present a simple model whereby the distributions of sediment in transport are related to their source by a sediment transfer function which defines the relative probability that a grain within each particular class interval will be eroded and transported. A variety of empirically derived transfer functions exhibit negatively skewed distributions (on a phi scale). Thus, when a sediment is being eroded, the probability of any grain going into transport increases with diminishing grain size throughout more than half of its size range. This causes the sediment in transport to be finer and more negatively skewed than its source, whereas the remaining sediment (a lag) must become relatively coarser and more positively skewed. Flume experiments show that the distributions of transfer functions change from having a highly negative skewness to being nearly symmetrical (although still negatively skewed) as the energy of the transporting process increases. We call the two extremes low-energy and high-energy transfer functions , respectively. In an expanded sediment-transport model, successive deposits in the direction of transport are related by a combination of two transfer functions. If energy is decreasing and the transfer functions have low-energy distributions, successive deposits will become finer and more negatively skewed. If, however, energy is decreasing, but the initial transfer function has a high-energy distribution, successive deposits will become coarser and more positively skewed. The variance of the distributions of lags, sediment in transport, and successive deposits in the down-current direction must eventually decrease (i.e., the sediments will become better sorted). We demonstrate that it is possible for variance first to increase, but suggest that, in reality, an increasing variance in the direction of transport will seldom be observed, particularly when grain-size distributions are described in phi units. This model describing changes in sediment distributions was tested in a variety of environments where the transport direction was known. The results indicate that the model has real-world validity and can provide a method to predict the directions of sediment transport

Functional gold nanoparticles for studying the interaction of lectin with glycosyl complex on living cellular surfaces

In this study. lectin-conjugated gold nanoparticles (GNPs) were prepared by standard biotin-streptavidin chemistry. The lectin-conjugated GNPs call be used as ail indicator for studying the interaction of lectin with glycosyl complex on living cellular Surfaces due to the high affinity of the lectin with saccharides. The interactions of two well-known lectins (Ricinus communis agglutinin and concanavalin A) and three different cell lines (HeLa, 293, and 293T) were selected here to establish this assay. Highly binding affinity of R. communis agglutinin with cells was demonstrated by conventional microscopic and UV-visible spectroscopic Studies. In addition, the binding process can be inhibited by galactose, giving further proof of the binding mechanism. (c) 2009 Elsevier Inc. All rights reserved.

Missions the chief end of the Christian Church; also, the qualifications, duties, and trials, of an Indian Missionary: being the substance of services held on the 7th March, in St. Andrew's Church, Edinburgh, at the ordination of the Rev. Thomas Smith.

http://books.google.com/books?vid=OCLC55772204

On the Convergence of Statistical Techniques for Inferring Network Traffic Demands

Accurate knowledge of traffic demands in a communication network enables or enhances a variety of traffic engineering and network management tasks of paramount importance for operational networks. Directly measuring a complete set of these demands is prohibitively expensive because of the huge amounts of data that must be collected and the performance impact that such measurements would impose on the regular behavior of the network. As a consequence, we must rely on statistical techniques to produce estimates of actual traffic demands from partial information. The performance of such techniques is however limited due to their reliance on limited information and the high amount of computations they incur, which limits their convergence behavior. In this paper we study strategies to improve the convergence of a powerful statistical technique based on an Expectation-Maximization iterative algorithm. First we analyze modeling approaches to generating starting points. We call these starting points informed priors since they are obtained using actual network information such as packet traces and SNMP link counts. Second we provide a very fast variant of the EM algorithm which extends its computation range, increasing its accuracy and decreasing its dependence on the quality of the starting point. Finally, we study the convergence characteristics of our EM algorithm and compare it against a recently proposed Weighted Least Squares approach.

On the Stable Paths Problem and a Restricted Variant

Interdomain routing on the Internet is performed using route preference policies specified independently, and arbitrarily by each Autonomous System in the network. These policies are used in the border gateway protocol (BGP) by each AS when selecting next-hop choices for routes to each destination. Conflicts between policies used by different ASs can lead to routing instabilities that, potentially, cannot be resolved no matter how long BGP is run. The Stable Paths Problem (SPP) is an abstract graph theoretic model of the problem of selecting nexthop routes for a destination. A stable solution to the problem is a set of next-hop choices, one for each AS, that is compatible with the policies of each AS. In a stable solution each AS has selected its best next-hop given that the next-hop choices of all neighbors are fixed. BGP can be viewed as a distributed algorithm for solving SPP. In this report we consider the stable paths problem, as well as a family of restricted variants of the stable paths problem, which we call F stable paths problems. We show that two very simple variants of the stable paths problem are also NP-complete. In addition we show that for networks with a DAG topology, there is an efficient centralized algorithm to solve the stable paths problem, and that BGP always efficiently converges to a stable solution on such networks.

On the Origin of Power Laws in Internet Topologies

Recent empirical studies have shown that Internet topologies exhibit power laws of the form for the following relationships: (P1) outdegree of node (domain or router) versus rank; (P2) number of nodes versus outdegree; (P3) number of node pairs y = x^α within a neighborhood versus neighborhood size (in hops); and (P4) eigenvalues of the adjacency matrix versus rank. However, causes for the appearance of such power laws have not been convincingly given. In this paper, we examine four factors in the formation of Internet topologies. These factors are (F1) preferential connectivity of a new node to existing nodes; (F2) incremental growth of the network; (F3) distribution of nodes in space; and (F4) locality of edge connections. In synthetically generated network topologies, we study the relevance of each factor in causing the aforementioned power laws as well as other properties, namely diameter, average path length and clustering coefficient. Different kinds of network topologies are generated: (T1) topologies generated using our parametrized generator, we call BRITE; (T2) random topologies generated using the well-known Waxman model; (T3) Transit-Stub topologies generated using GT-ITM tool; and (T4) regular grid topologies. We observe that some generated topologies may not obey power laws P1 and P2. Thus, the existence of these power laws can be used to validate the accuracy of a given tool in generating representative Internet topologies. Power laws P3 and P4 were observed in nearly all considered topologies, but different topologies showed different values of the power exponent α. Thus, while the presence of power laws P3 and P4 do not give strong evidence for the representativeness of a generated topology, the value of α in P3 and P4 can be used as a litmus test for the representativeness of a generated topology. We also find that factors F1 and F2 are the key contributors in our study which provide the resemblance of our generated topologies to that of the Internet.