Cognitive models in biomimetic pattern cognition

We describe a new model which is based on the concept of cognizing theory. The method identifies subsets of the data which are embedded in arbitrary oriented lower dimensional space. We definite k-mean covering, and study its property. Covering subsets of points are repeatedly sampled to construct trial geometry space of various dimensions. The sampling corresponding to the feature space having the best cognition ability between a mode near zero and the rest is selected and the data points are partitioned on the basis of the best cognition ability. The repeated sampling then continues recursively on each block of the data. We propose this algorithm based on cognition models. The experimental results for face recognition demonstrate that the correct rejection rate of the test samples excluded in the classes of training samples is very high and effective.

Unique Covering Problems with Geometric Sets

The Exact Cover problem takes a universe U of n elements, a family F of m subsets of U and a positive integer k, and decides whether there exists a subfamily(set cover) F' of size at most k such that each element is covered by exactly one set. The Unique Cover problem also takes the same input and decides whether there is a subfamily F' subset of F such that at least k of the elements F' covers are covered uniquely(by exactly one set). Both these problems are known to be NP-complete. In the parameterized setting, when parameterized by k, Exact Cover is W1]-hard. While Unique Cover is FPT under the same parameter, it is known to not admit a polynomial kernel under standard complexity-theoretic assumptions. In this paper, we investigate these two problems under the assumption that every set satisfies a given geometric property Pi. Specifically, we consider the universe to be a set of n points in a real space R-d, d being a positive integer. When d = 2 we consider the problem when. requires all sets to be unit squares or lines. When d > 2, we consider the problem where. requires all sets to be hyperplanes in R-d. These special versions of the problems are also known to be NP-complete. When parameterizing by k, the Unique Cover problem has a polynomial size kernel for all the above geometric versions. The Exact Cover problem turns out to be W1]-hard for squares, but FPT for lines and hyperplanes. Further, we also consider the Unique Set Cover problem, which takes the same input and decides whether there is a set cover which covers at least k elements uniquely. To the best of our knowledge, this is a new problem, and we show that it is NP-complete (even for the case of lines). In fact, the problem turns out to be W1]-hard in the abstract setting, when parameterized by k. However, when we restrict ourselves to the lines and hyperplanes versions, we obtain FPT algorithms.

Smooth sets for borel equivalence relations and the covering property for σ-ideals of compact sets

This thesis is divided into three chapters. In the first chapter we study the smooth sets with respect to a Borel equivalence realtion E on a Polish space X. The collection of smooth sets forms σ-ideal. We think of smooth sets as analogs of countable sets and we show that an analog of the perfect set theorem for Σ¹₁ sets holds in the context of smooth sets. We also show that the collection of Σ¹₁ smooth sets is ∏¹₁ on the codes. The analogs of thin sets are called sparse sets. We prove that there is a largest ∏¹₁ sparse set and we give a characterization of it. We show that in L there is a ∏¹₁ sparse set which is not smooth. These results are analogs of the results known for the ideal of countable sets, but it remains open to determine if large cardinal axioms imply that ∏¹₁ sparse sets are smooth. Some more specific results are proved for the case of a countable Borel equivalence relation. We also study I(E), the σ-ideal of closed E-smooth sets. Among other things we prove that E is smooth iff I(E) is Borel.

In chapter 2 we study σ-ideals of compact sets. We are interested in the relationship between some descriptive set theoretic properties like thinness, strong calibration and the covering property. We also study products of σ-ideals from the same point of view. In chapter 3 we show that if a σ-ideal I has the covering property (which is an abstract version of the perfect set theorem for Σ¹₁ sets), then there is a largest ∏¹₁ set in I^int (i.e., every closed subset of it is in I). For σ-ideals on 2^ω we present a characterization of this set in a similar way as for C₁, the largest thin ∏¹₁ set. As a corollary we get that if there are only countable many reals in L, then the covering property holds for Σ¹₂ sets.

Countability and star covering properties

Whenever P is a topological property, we say that a topological space is star P if whenever U is an open cover of X, there is a subspace A subset of X with property P such that X = St(A, U). We study the relationships of star P properties for P is an element of {Lindelof, sigma-compact, countable} with other Lindelof type properties. (C) 2010 Elsevier B.V. All rights reserved.

Algorithms for Geometric Matching, Clustering, and Covering

With the popularization of GPS-enabled devices such as mobile phones, location data are becoming available at an unprecedented scale. The locations may be collected from many different sources such as vehicles moving around a city, user check-ins in social networks, and geo-tagged micro-blogging photos or messages. Besides the longitude and latitude, each location record may also have a timestamp and additional information such as the name of the location. Time-ordered sequences of these locations form trajectories, which together contain useful high-level information about people's movement patterns.

The first part of this thesis focuses on a few geometric problems motivated by the matching and clustering of trajectories. We first give a new algorithm for computing a matching between a pair of curves under existing models such as dynamic time warping (DTW). The algorithm is more efficient than standard dynamic programming algorithms both theoretically and practically. We then propose a new matching model for trajectories that avoids the drawbacks of existing models. For trajectory clustering, we present an algorithm that computes clusters of subtrajectories, which correspond to common movement patterns. We also consider trajectories of check-ins, and propose a statistical generative model, which identifies check-in clusters as well as the transition patterns between the clusters.

The second part of the thesis considers the problem of covering shortest paths in a road network, motivated by an EV charging station placement problem. More specifically, a subset of vertices in the road network are selected to place charging stations so that every shortest path contains enough charging stations and can be traveled by an EV without draining the battery. We first introduce a general technique for the geometric set cover problem. This technique leads to near-linear-time approximation algorithms, which are the state-of-the-art algorithms for this problem in either running time or approximation ratio. We then use this technique to develop a near-linear-time algorithm for this

shortest-path cover problem.

Efficiency comparison of Markov Chain Monte Carlo simulation with subset simulation (MCMC/ss) to standard Monte Carlo Simulation (sMC) for extreme event scenarios

Standard Monte Carlo (sMC) simulation models have been widely used in AEC industry research to address system uncertainties. Although the benefits of probabilistic simulation analyses over deterministic methods are well documented, the sMC simulation technique is quite sensitive to the probability distributions of the input variables. This phenomenon becomes highly pronounced when the region of interest within the joint probability distribution (a function of the input variables) is small. In such cases, the standard Monte Carlo approach is often impractical from a computational standpoint. In this paper, a comparative analysis of standard Monte Carlo simulation to Markov Chain Monte Carlo with subset simulation (MCMC/ss) is presented. The MCMC/ss technique constitutes a more complex simulation method (relative to sMC), wherein a structured sampling algorithm is employed in place of completely randomized sampling. Consequently, gains in computational efficiency can be made. The two simulation methods are compared via theoretical case studies.

Higher order universal one-way hash functions from the subset sum assumption

Universal One-Way Hash Functions (UOWHFs) may be used in place of collision-resistant functions in many public-key cryptographic applications. At Asiacrypt 2004, Hong, Preneel and Lee introduced the stronger security notion of higher order UOWHFs to allow construction of long-input UOWHFs using the Merkle-Damgård domain extender. However, they did not provide any provably secure constructions for higher order UOWHFs. We show that the subset sum hash function is a kth order Universal One-Way Hash Function (hashing n bits to m < n bits) under the Subset Sum assumption for k = O(log m). Therefore we strengthen a previous result of Impagliazzo and Naor, who showed that the subset sum hash function is a UOWHF under the Subset Sum assumption. We believe our result is of theoretical interest; as far as we are aware, it is the first example of a natural and computationally efficient UOWHF which is also a provably secure higher order UOWHF under the same well-known cryptographic assumption, whereas this assumption does not seem sufficient to prove its collision-resistance. A consequence of our result is that one can apply the Merkle-Damgård extender to the subset sum compression function with ‘extension factor’ k+1, while losing (at most) about k bits of UOWHF security relative to the UOWHF security of the compression function. The method also leads to a saving of up to m log(k+1) bits in key length relative to the Shoup XOR-Mask domain extender applied to the subset sum compression function.

The subset sum problem in Keno modelling

Aspects of Keno modelling throughout the Australian states of Queensland, New South Wales and Victoria are discussed: the trivial Heads or Tails and the more interesting Keno Bonus, which leads to consideration of the subset sum problem. The most intricate structure is where Heads or Tails and Keno Bonus are combined, and here, the issue of independence arises. Closed expressions for expected return to player are presented in each case.

Human CD141(+) (BDCA-3)(+) dendritic cells (DCs) represent a unique myeloid DC subset that cross-presents necrotic cell antigens

The characterization of human dendritic cell (DC) subsets is essential for the design of new vaccines. We report the first detailed functional analysis of the human CD141(+) DC subset. CD141(+) DCs are found in human lymph nodes, bone marrow, tonsil, and blood, and the latter proved to be the best source of highly purified cells for functional analysis. They are characterized by high expression of toll-like receptor 3, production of IL-12p70 and IFN-beta, and superior capacity to induce T helper 1 cell responses, when compared with the more commonly studied CD1c(+) DC subset. Polyinosine-polycytidylic acid (poly I:C)-activated CD141(+) DCs have a superior capacity to cross-present soluble protein antigen (Ag) to CD8(+) cytotoxic T lymphocytes than poly I:C-activated CD1c(+) DCs. Importantly, CD141(+) DCs, but not CD1c(+) DCs, were endowed with the capacity to cross-present viral Ag after their uptake of necrotic virus-infected cells. These findings establish the CD141(+) DC subset as an important functionally distinct human DC subtype with characteristics similar to those of the mouse CD8 alpha(+) DC subset. The data demonstrate a role for CD141(+) DCs in the induction of cytotoxic T lymphocyte responses and suggest that they may be the most relevant targets for vaccination against cancers, viruses, and other pathogens.

Southern New England Social and Community Plan 2009 - Covering Local Government Authorities: Armidale Dumaresq, Guyra, Uralla and Walcha

The Southern New England (SNE) Social and Community Plan is a guide to collaborative, integrated planning involving the three spheres of government, the community and commercial sectors. The Plan is based on social justice principles such as: • Equity - fairness in resource distribution, particularly for those most in need • Access - fairer access for everyone to the economic resources and services essential to meeting their basic needs and improving their quality of life • Rights - recognition and promotion of civil rights • Participation - better opportunities for genuine participation and consultation about decisions affecting people's lives. The Plan is also aimed at improving the accountability of decision-makers, and should help the councils, in conjunction with their communities meet the state government's social justice commitments. Preparation of a social and community plan is required at least every five years, and as with most councils, Armidale Dumaresq Council (ADC) has produced two already, one in 1999 and one in 2004, following the amalgamation of the former Armidale City and Dumaresq Shire Councils in 2000. Those Councils formerly prepared their own Plans in 1999, based on shared consultancy work on a community profile. This is the first joint Southern New England Plan, featuring Armidale Dumaresq, Walcha, Uralla and Guyra Councils. This Social Plan has aimed to identify and address the needs of the local community by: • describing who makes up the community • summarising key priority issues • assessing the effectiveness of any previous plans • recommending strategic ways for council and other government and non-government agencies to met community needs.

Mitochondrial membrane potential in a small subset of artemisinin-induced dormant plasmodium falciparum parasites in vitro

Artemisinin induced dormancy is a proposed mechanism for failures of mono-therapy and is linked with artemisinin resistance in Plasmodium falciparum. The biological characterization and dynamics of dormant parasites are not well understood. Here we report that following dihydroartemisinin (DHA) treatment in vitro, a small subset of morphologically dormant parasites was stained with rhodamine 123 (RH), a mitochondrial membrane potential (MMP) marker, and persisted to recovery. FACS sorted RH-positive parasites resumed growth at 10,000/well while RH-negative parasites failed to recover at 5 million/well. Furthermore, transcriptional activity for mitochondrial enzymes was only detected in RH-positive dormant parasites. Importantly, after treating dormant parasites with different concentrations of atovaquone, a mitochondrial inhibitor, the recovery of dormant parasites was delayed or stopped. This demonstrates that mitochondrial activity is critical for survival and regrowth of dormant parasites and that RH staining provides a means of identifying these parasites. These findings provide novel paths for studying and eradicating this dormant stage.

Novel protective covering to enhance concrete resistance against projectile impact

A novel protective covering with a layered and staggered structure was proposed to protect concrete against projectile impact. Experimental study was conducted to investigate the ballistic behaviour of the concrete targets against 12.7 mm armour-piercing incendiary projectile at velocities ranging from 537.7 to 596.5 m/s. The results showed that the concrete targets with protective covering exhibited superior integrity with no damage on the distal surface, whereas the concrete targets without protective covering were fractured with penetrating cracks throughout the thickness of the target. Moreover, the protected concrete targets displayed significantly reduced penetration depth compared with the concrete targets without protective covering. The protective covering with epoxy adhesive interlayers had a bigger protection factor than that with silicone sealant interlayers, but the former suffered more severe damage than the latter.

Difference covering arrays and pseudo-orthogonal Latin squares

A pair of Latin squares, A and B, of order n, is said to be pseudo-orthogonal if each symbol in A is paired with every symbol in B precisely once, except for one symbol with which it is paired twice and one symbol with which it is not paired at all. A set of t Latin squares, of order n, are said to be mutually pseudo-orthogonal if they are pairwise pseudo-orthogonal. A special class of pseudo-orthogonal Latin squares are the mutually nearly orthogonal Latin squares (MNOLS) first discussed in 2002, with general constructions given in 2007. In this paper we develop row complete MNOLS from difference covering arrays. We will use this connection to settle the spectrum question for sets of 3 mutually pseudo-orthogonal Latin squares of even order, for all but the order 146.

In search of Gustav: The story of the Lilienfeld (later Lynfield) family covering the last 200 years 1800-1920

This is the first of three books about the history of Geoffrey Lynfield's family. It is about four Lilienfeld brothers--Geoffrey Lynfield's grandfather and his brothers. They were born in the Jewish enclave of Marburg and ended up in South Africa when and where the first diamonds were discovered. The manuscript also includes photographs and documents.

Dacomitinib versus erlotinib in patients with EGFR-mutated advanced nonsmall-cell lung cancer (NSCLC): Pooled subset analyses from two randomized trials

Background: The irreversible epidermal growth factor receptor (EGFR) inhibitors have demonstrated efficacy in NSCLC patients with activating EGFR mutations, but it is unknown if they are superior to the reversible inhibitors. Dacomitinib is an oral, small-molecule irreversible inhibitor of all enzymatically active HER family tyrosine kinases. Methods: The ARCHER 1009 (NCT01360554) and A7471028 (NCT00769067) studies randomized patients with locally advanced/metastatic NSCLC following progression with one or two prior chemotherapy regimens to dacomitinib or erlotinib. EGFR mutation testing was performed centrally on archived tumor samples. We pooled patients with exon 19 deletion and L858R EGFR mutations from both studies to compare the efficacy of dacomitinib to erlotinib. Results: One hundred twenty-one patients with any EGFR mutation were enrolled; 101 had activating mutations in exon 19 or 21. For patients with exon19/21 mutations, the median progression-free survival was 14.6 months [95% confidence interval (CI) 9.0–18.2] with dacomitinib and 9.6 months (95% CI 7.4–12.7) with erlotinib [unstratified hazard ratio (HR) 0.717 (95% CI 0.458–1.124), two-sided log-rank, P = 0.146]. The median survival was 26.6 months (95% CI 21.6–41.5) with dacomitinib versus 23.2 months (95% CI 16.0–31.8) with erlotinib [unstratified HR 0.737 (95% CI 0.431–1.259), two-sided log-rank, P = 0.265]. Dacomitinib was associated with a higher incidence of diarrhea and mucositis in both studies compared with erlotinib. Conclusions: Dacomitinib is an active agent with comparable efficacy to erlotinib in the EGFR mutated patients. The subgroup with exon 19 deletion had favorable outcomes with dacomitinib. An ongoing phase III study will compare dacomitinib to gefitinib in first-line therapy of patients with NSCLC harboring common activating EGFR mutations (ARCHER 1050; NCT01774721). Clinical trials number: ARCHER 1009 (NCT01360554) and A7471028 (NCT00769067).