Search results for "VECTORS"
showing 10 items of 601 documents
Connections of reference vectors and different types of preference information in interactive multiobjective evolutionary algorithms
2016
We study how different types of preference information coming from a human decision maker can be utilized in an interactive multiobjective evolutionary optimization algorithm (MOEA). The idea is to convert different types of preference information into a unified format which can then be utilized in an interactive MOEA to guide the search towards the most preferred solution(s). The format chosen here is a set of reference vectors which is used within the interactive version of the reference vector guided evolutionary algorithm (RVEA). The proposed interactive RVEA is then applied to the multiple-disk clutch brake design problem with five objectives to demonstrate the potential of the idea in…
Multi-party metering: An architecture for privacy-preserving profiling schemes
2013
Several privacy concerns about the massive deploy- ment of smart meters have been arisen recently. Namely, it has been shown that the fine-grained temporal traces generated by these meters can be correlated with different users behaviors. A new architecture, called multi-party metering, for enabling privacy-preserving analysis of high-frequency metering data without requiring additional complexity at the smart meter side is here proposed. The idea is to allow multiple entities to get a share of the high-frequency metering data rather than the real data, where this share does not reveal any information about the real data. By aggregating the shares provided by different users and publishing …
Comparison of Numerical Methods in the Contrast Imaging Problem in NMR
2013
International audience; In this article, the contrast imaging problem in nuclear magnetic resonance is modeled as a Mayer problem in optimal control. A first synthesis of locally optimal solutions is given in the single-input case using geometric methods based on Pontryagin's maximum principle. We then compare these results using direct methods and a moment-based approach, and make a first step towards global optimality. Finally, some preliminary results are given in the bi-input case.
New chimaeric hepatitis B virus core particles carrying hantavirus (serotype Puumala) epitopes: immunogenicity and protection against virus challenge
1999
Virus-like particles generated by the heterologous expression of virus structural proteins are able to potentiate the immunogenicity of foreign epitopes presented on their surface. In recent years epitopes of various origin have been inserted into the core antigen of hepatitis B virus (HBV) allowing the formation of chimaeric HBV core particles. Chimaeric core particles carrying the 45 N-terminal amino acids of the Puumala hantavirus nucleocapsid protein induced protective immunity in bank voles, the natural host of this hantavirus. Particles applied in the absence of adjuvant are still immunogenic and partially protective in bank voles. Although a C-terminally truncated core antigen of HBV…
Intravitreal delivery of AAV-NDI1 provides functional benefit in a murine model of Leber hereditary optic neuropathy.
2012
Leber hereditary optic neuropathy (LHON) is a mitochondrially inherited form of visual dysfunction caused by mutations in several genes encoding subunits of the mitochondrial respiratory NADH-ubiquinone oxidoreductase complex (complex I). Development of gene therapies for LHON has been impeded by genetic heterogeneity and the need to deliver therapies to the mitochondria of retinal ganglion cells (RGCs), the cells primarily affected in LHON. The therapy under development entails intraocular injection of a nuclear yeast gene NADH-quinone oxidoreductase (NDI1) that encodes a single subunit complex I equivalent and as such is mutation independent. NDI1 is imported into mitochondria due to an e…
A Surrogate-assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-objective Optimization
2018
We propose a surrogate-assisted reference vector guided evolutionary algorithm for computationally expensive optimization problems with more than three objectives. The proposed algorithm is based on a recently developed evolutionary algorithm for many-objective optimization that relies on a set of adaptive reference vectors for selection. The proposed surrogateassisted evolutionary algorithm uses Kriging to approximate each objective function to reduce the computational cost. In managing the Kriging models, the algorithm focuses on the balance of diversity and convergence by making use of the uncertainty information in the approximated objective values given by the Kriging models, the distr…
Searching for Jumbled Patterns in Strings
2009
On Approximate Jumbled Pattern Matching in Strings
2011
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of a Parikh vector q in the text s requires finding a substring t of s with p(t) = q. This can be viewed as the task of finding a jumbled (permuted) version of a query pattern, hence the term Jumbled Pattern Matching. We present several algorithms for the approximate version of the problem: Given a string s and two Parikh vectors u, v (the query bounds), find all maximal occurrences in s of some Parikh vector q such that u <= q <= v. This definition encompasses several natural versions of approximate Parikh vector search. We present an algorithm solving this problem …
Operators on Partial Inner Product Spaces: Towards a Spectral Analysis
2014
Given a LHS (Lattice of Hilbert spaces) $V_J$ and a symmetric operator $A$ in $V_J$, in the sense of partial inner product spaces, we define a generalized resolvent for $A$ and study the corresponding spectral properties. In particular, we examine, with help of the KLMN theorem, the question of generalized eigenvalues associated to points of the continuous (Hilbertian) spectrum. We give some examples, including so-called frame multipliers.
Numerical range and positive block matrices
2020
We obtain several norm and eigenvalue inequalities for positive matrices partitioned into four blocks. The results involve the numerical range $W(X)$ of the off-diagonal block $X$, especially the distance $d$ from $0$ to $W(X)$. A special consequence is an estimate, $$\begin{eqnarray}\text{diam}\,W\left(\left[\begin{array}{@{}cc@{}}A & X\\ X^{\ast } & B\end{array}\right]\right)-\text{diam}\,W\biggl(\frac{A+B}{2}\biggr)\geq 2d,\end{eqnarray}$$ between the diameters of the numerical ranges for the full matrix and its partial trace.