Auswahl der wissenschaftlichen Literatur zum Thema „Convent of Lindau“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Convent of Lindau" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Convent of Lindau"
1
Mănăstireanu, Dănuţ. „C. S. Lewis, Reluctant Convert and (not so) Ordinary Anglican“. Linguaculture 2014, Nr. 2 (01.12.2014): 57–65. http://dx.doi.org/10.1515/lincu-2015-0030.
Der volle Inhalt der QuelleAnnotation:
Abstract After some passing considerations on the reception of Lewis in Romania, the present paper discusses the role played by Anglicanism in the late personal commitment of C.S. Lewis to the Christian faith, after years of atheism, scepticism, and agnosticism. It argues that in fact Anglicanism contributed very little to Lewis’s (re)conversion to Christianity. Furthermore, the paper agrees with the generally accepted idea that the particular calling that Lewis felt he had, that of being a Christian apologist, made him wary of being associated with the defence of any specific Christian tradition. In virtue of this special calling, Lewis also reacted quite strongly against certain aspects of Anglicanism, like, for instance, the ordination of women to priesthood, which he perceived as an obstacle to ecumenism and, implicitly, to an effective defence of the Christian faith in the public arena. In spite of all this, there is little doubt that Lewis has fully and unreservedly adopted Anglicanism as his preferred version of Christianity. From this particular stance, the life and ministry of C.S. Lewis made a huge public impact in the twentieth century and beyond. In light of the undeniable influence he had on the intellectual and religious scene in the last hundred years, one may ask not so much how Anglican was Lewis, but, rather, ‘why isn’t Anglicanism more like Lewis’.
2
Gefter, S. L., und A. L. Piven. „Implicit Linear Nonhomogeneous Difference Equation in Banach and Locally Convex Spaces“. Zurnal matematiceskoj fiziki, analiza, geometrii 15, Nr. 3 (25.06.2019): 336–53. http://dx.doi.org/10.15407/mag15.03.336.
Der volle Inhalt der Quelle
3
Indraningsih, Indraningsih, Yulvian Sani und Raphaella Widiastuti. „EVALUATION OF FARMERS APPRECIATION IN REDUCING PESTICIDE BY ORGANIC FARMING PRACTICE“. Indonesian Journal of Agricultural Science 6, Nr. 2 (25.10.2016): 59. http://dx.doi.org/10.21082/ijas.v6n2.2005.59-68.
Der volle Inhalt der QuelleAnnotation:
Vegetables and dairy milk are important commodities in Pangalengan and Lembang, West Java. However, agrochemicals are used intensively and excessively in production system. Therefore, pesticide residues and contamination commonly occurred in agricultural products and environments. The study aimed to assess farmers’ attitudes on pesticide toxicity and reducing pesticide residues in animal and food crops products, and investigate the attitude changes of farmers on pesticide use. It was an on-farm research and farmers were directly involved in the study. The attitude change was analyzed on questionnaire and interview base for over 99 respondents in Pangalengan and Lembang between 2001 and 2003. Samples of soils, weeds, cabbages and milk were collected for pesticide residue analysis. Results showed that farmers did not aware on toxicity effects of pesticides in both animal and human health. There was misinterpretation among the farmers where pesticides were regarded as drugs rather than toxic compound to increase productivity. The organochlorines/OCs (lindane and heptachlor) were common pesticide contaminants found in soils of 7.9- 11.4 ppb, but no organophospates (OPs) were detected. Both OCs and OPs were also detected in soils of Lembang at a range of 11.53-65.63 ppb and 0.6-2.6 ppb, respectively. There were pesticide residues detected in weeds collected from Pangalengan (8.93 ppb lindane, 2.05 ppb heptachlor, and 33.27 ppb chlorpyriphos methyl/CPM and Lembang (6.45 ppb lindane, 2.65 ppb endosulfan, 6.85 ppb diazinon, and 0.5 ppb CPM). Only endosulfan with least residue level (0.1 ppb) was detected in organic cabbages, whereas lindane was detected much higher (3.7 ppb) in non-organic cabbages. Pesticide residues were not detected in milk of dairy cattle fed on by-products of organic cabbages, but lindane was still present in milk of dairy cattle fed on non-organic cabbages for 7 days subsequently. The present study indicates that the organic farming practice may reduce pesticide residues in animal and agricultural products. Farmers appreciated that pesticides may cause residual effects on their products (95.2%) and affected public health and environment (92.9%). Therefore, they were willing to convert their agricultural practices to organic farming (69.1%).
4
Indraningsih, Indraningsih, Yulvian Sani und Raphaella Widiastuti. „EVALUATION OF FARMERS APPRECIATION IN REDUCING PESTICIDE BY ORGANIC FARMING PRACTICE“. Indonesian Journal of Agricultural Science 6, Nr. 2 (25.10.2016): 59. http://dx.doi.org/10.21082/ijas.v6n2.2005.p59-68.
Der volle Inhalt der QuelleAnnotation:
Vegetables and dairy milk are important commodities in Pangalengan and Lembang, West Java. However, agrochemicals are used intensively and excessively in production system. Therefore, pesticide residues and contamination commonly occurred in agricultural products and environments. The study aimed to assess farmers’ attitudes on pesticide toxicity and reducing pesticide residues in animal and food crops products, and investigate the attitude changes of farmers on pesticide use. It was an on-farm research and farmers were directly involved in the study. The attitude change was analyzed on questionnaire and interview base for over 99 respondents in Pangalengan and Lembang between 2001 and 2003. Samples of soils, weeds, cabbages and milk were collected for pesticide residue analysis. Results showed that farmers did not aware on toxicity effects of pesticides in both animal and human health. There was misinterpretation among the farmers where pesticides were regarded as drugs rather than toxic compound to increase productivity. The organochlorines/OCs (lindane and heptachlor) were common pesticide contaminants found in soils of 7.9- 11.4 ppb, but no organophospates (OPs) were detected. Both OCs and OPs were also detected in soils of Lembang at a range of 11.53-65.63 ppb and 0.6-2.6 ppb, respectively. There were pesticide residues detected in weeds collected from Pangalengan (8.93 ppb lindane, 2.05 ppb heptachlor, and 33.27 ppb chlorpyriphos methyl/CPM and Lembang (6.45 ppb lindane, 2.65 ppb endosulfan, 6.85 ppb diazinon, and 0.5 ppb CPM). Only endosulfan with least residue level (0.1 ppb) was detected in organic cabbages, whereas lindane was detected much higher (3.7 ppb) in non-organic cabbages. Pesticide residues were not detected in milk of dairy cattle fed on by-products of organic cabbages, but lindane was still present in milk of dairy cattle fed on non-organic cabbages for 7 days subsequently. The present study indicates that the organic farming practice may reduce pesticide residues in animal and agricultural products. Farmers appreciated that pesticides may cause residual effects on their products (95.2%) and affected public health and environment (92.9%). Therefore, they were willing to convert their agricultural practices to organic farming (69.1%).
5
Dragomir, S. S. „REFINEMENTS AND REVERSES OF F ́EJER’S INEQUALITIES FOR CONVEX FUNCTIONS ON LINEAR SPACES“. Issues of Analysis 27, Nr. 3 (November 2020): 99–118. http://dx.doi.org/10.15393/j3.art.2020.8830.
Der volle Inhalt der Quelle
6
Sisca, Vivi, Aju Deska, Syukri Syukri, Zilfa Zilfa und Novesar Jamarun. „Synthesis and Characterization of CaO Limestone from Lintau Buo Supported by TiO2 as a Heterogeneous Catalyst in the Production of Biodiesel“. Indonesian Journal of Chemistry 21, Nr. 4 (05.08.2021): 979. http://dx.doi.org/10.22146/ijc.64675.
Der volle Inhalt der QuelleAnnotation:
Biodiesel constitutes an alternative to diesel fuel, developing a base catalyst in cost efficiency and reducing the impact on the environment due to toxic waste and excessive chemicals. This study employed a mixture of an oxide catalyst, CaO/TiO2, which was ably synthesized as a heterogeneous catalyst to convert waste frying oil (WFO) into biodiesel. Heterogeneous catalysts have been characterized by XRD, FT-IR, TEM, SEM-EDX, and BET to identify their crystal type, morphology, composition, and surface area. Catalytic activity was affected by the amount, oil/methanol ratio, reaction temperature, and duration. A 94% biodiesel yield was achieved by optimizing the following reaction parameters: 5wt.%, 6:1 methanol: oil, 65 °C, for 4 h. The addition of TiO2 to CaO improves the catalyst stability and transforms the reactants into products. The structure and characteristics of TiO2 maintained stability and supported CaO well. Its repeated biodiesel fuel production demonstrated the catalyst stability from WFO throughout the transesterification reaction.
7
Ghose, Ritu, Patricia Persaud und Robert W. Clayton. „Basin Structure for Earthquake Ground Motion Estimates in Urban Los Angeles Mapped with Nodal Receiver Functions“. Geosciences 13, Nr. 11 (24.10.2023): 320. http://dx.doi.org/10.3390/geosciences13110320.
Der volle Inhalt der QuelleAnnotation:
We constrained sedimentary basin structure using a nodal seismic array consisting of ten dense lines that overlie multiple basins in the northern Los Angeles area. The dense array consists of 758 seismic nodes, spaced ~250–300 m apart along linear transects, that recorded ground motions for 30–35 days. We applied the receiver function (RF) technique to 16 teleseismic events to investigate basin structure. Primary basin-converted phases were identified in the RFs. A shear wave velocity model produced in a separate study using the same dataset was incorporated to convert the basin time arrivals to depth. The deepest part of the San Bernardino basin was identified near the Loma Linda fault at a depth of 2.4 km. Basin depths identified at pierce points for separate events reveal lateral changes in basin depth across distances of ~2–3 km near individual stations. A significant change in basin depth was identified within a small distance of ~4 km near the San Jacinto fault. The San Gabriel basin exhibited the largest basin depths of all three basins, with a maximum depth of 4.2 km. The high lateral resolution from the dense array helped to reveal more continuous structures and reduce uncertainties in the RFs interpretation. We discovered a more complex basin structure than previously identified. Our findings show that the basins’ core areas are not the deepest, and significant changes in basin depth were observed near some faults, including the San Jacinto fault, Fontana fault, Red Hill fault and Indian Hill fault.
8
Arnaout, Angel, Susan Robertson, Kianoosh Keyhanian, Megan Hopkins, Linda Liao, Vida Talebian, Arif Awan et al. „Abstract PD11-02: PD11-02 A Phase II Randomized Window of Opportunity Trial Evaluating Cytotoxic and Immunomodulatory effects of Intratumoral INT230-6 in Early Stage Breast Cancer: the INVINCIBLE Trial“. Cancer Research 83, Nr. 5_Supplement (01.03.2023): PD11–02—PD11–02. http://dx.doi.org/10.1158/1538-7445.sabcs22-pd11-02.
Der volle Inhalt der QuelleAnnotation:
Abstract Background: The majority of breast cancers outside of the triple negative subtype are considered immunological quiescent and are therefore minimally responsive to immunotherapies. One potential method to combat this is through local therapies that induce cell death, thereby exposing tumor antigens, providing adjuvants for anti-tumor immune priming, and potentially increasing responsiveness to immunotherapies. We have conducted a randomized, Phase 2 presurgical Window-Of-Opportunity trial for intratumoral (IT) INT230-6 (comprising VINblastine (VIN) Cisplatin (VIN)) evaluating clinical and BioLogical Effects in patients with early-stage operable Breast Cancer (the INVINCIBLE trial- https://clinicaltrials.gov/ct2/show/NCT04781725). INT230-6 contains a dispersion enhancer molecule (SHAO) with the cytotoxic agents and is designed to cause tumor necrosis by dispersion throughout the tumor and diffusion into cancer cells. Previous in vitro studies have demonstrated that INT230-6 halts cancer cell replication and induces cell death recruiting dendritic cells and T-cells to the tumor microenvironment. In this trial, IT injections of INT230-6 are conducted to 1) exploit the potential of regional cytotoxic chemotherapy on breast cancer in vivo and 2) assess the immune response within the tumor, microenvironment and systemically in the host blood prior to surgical resection. Methods: Women with newly diagnosed and awaiting surgery for early-stage intermediate or high-grade T1-T2 invasive breast cancers were recruited to the trial. The study has two parts. Part I was a randomized (2:1) open label trial comparing 1-3 doses of INT230-6 injected weekly versus no treatment prior to surgery to evaluate safety, feasibility, and optimal drug dosing. Part II was a double-blinded randomized (2:1) trial where patients received one IT dose of INT230-6 vs saline injection. The primary objective was to estimate the proportion of patients with tumor necrosis and complete cell cycle arrest (CCCA) at the time of surgery compared to control. In addition, we performed targeted sequencing and proteomic profiling in tumour samples from the INT230-6 clinical trial. Results: The study recruited 90 patients with age ranges of 40-77 yrs (mean = 60 yrs) with tumors ranging from 1.5-4.3 cm (mean = 2.4cm). No surgeries were delayed or altered as a result of trial participation and the most common (>10%) AEs were injection site pain, injection site reaction and nausea/vomiting. Compared to the control group, up to 95% tumor necrosis was present in varying biologic subtypes and histologies, including invasive lobular carcinoma. Preliminary gene expression analysis showed significant differential gene expression between the baseline biopsy and surgical specimens. Pathway analysis identified genes associated with TCR signaling, B cells, T cells, chemokine signaling and NF-κB signaling were significantly changed in the post treatment samples. There was a relative increase in CD4 and CD8 T cells and B and NK cells within the tumor and in the tumour microenvironment. Conclusion: Preliminary evidence shows that a single dose of INT230-6 can cause substantial tumor necrosis and stimulate an immune response in breast cancers prior to surgery with minimal adverse effects and good tolerability. This window of opportunity clinical trial demonstrates that INT230-6 injection is a novel and simple method to convert traditionally immune quiescent breast cancers into immunogenic tumors. This can open the door to future potential immunotherapeutic options in early stage breast cancer. Citation Format: Angel Arnaout, Susan Robertson, Kianoosh Keyhanian, Megan Hopkins, Linda Liao, Vida Talebian, Arif Awan, John MS Bartlett, Gregory R. Pond, Lazlo Radvanyi, Lewis H. Bender, Ian B. Walters, Vanessa Lopez Ozuna, Melanie Spears. PD11-02 A Phase II Randomized Window of Opportunity Trial Evaluating Cytotoxic and Immunomodulatory effects of Intratumoral INT230-6 in Early Stage Breast Cancer: the INVINCIBLE Trial [abstract]. In: Proceedings of the 2022 San Antonio Breast Cancer Symposium; 2022 Dec 6-10; San Antonio, TX. Philadelphia (PA): AACR; Cancer Res 2023;83(5 Suppl):Abstract nr PD11-02.
9
Jiang, Haowen, Clifford Jiajun He, Albert M. Li, Bo He, Yang Li, Meng-Ning Zhou und Jiangbin Ye. „Mitochondrial uncoupling inhibits reductive carboxylation in cancer cells“. Molecular Cancer Research, 26.06.2023. http://dx.doi.org/10.1158/1541-7786.mcr-23-0049.
Der volle Inhalt der QuelleAnnotation:
Abstract When the electron transport chain (ETC) function is impaired, cancer cells rely on reductive carboxylation (RC) to convert α-ketoglutarate (αKG) to citrate for macromolecular synthesis, thereby promoting tumor growth. Currently, there is no viable therapy to inhibit RC for cancer treatment. In this study, we demonstrate that the mitochondrial uncoupler treatment effectively inhibits RC in cancer cells. Mitochondrial uncoupler treatment activates the ETC and increases the NAD+/NADH ratio. Using U-13C-glutamine and 1-13C-glutamine tracers, we show that mitochondrial uncoupling accelerates the oxidative TCA cycle and blocks RC under hypoxia, in von Hippel-Lindau (VHL) tumor suppressor-deficient kidney cancer cells, or under anchorage-independent growth condition. Together, these data demonstrate that mitochondrial uncoupling redirects α-KG from RC back to the oxidative TCA cycle, highlighting that the NAD+/NADH ratio is one key switch that determines the metabolic fate of α-KG. Inhibiting RC could be a key mechanism by which mitochondrial uncouplers inhibit tumor growth.
10
Rathod, H. T., und K. V. Vijayakumar. „Numerical Integration Over A Linear Convex Polyhedron Using An All Hexahedral Discretisation And Gauss Legendre Formulas“. International Journal Of Engineering And Computer Science, 28.04.2016. http://dx.doi.org/10.18535/ijecs/v5i4.37.
Der volle Inhalt der QuelleDissertationen zum Thema "Convent of Lindau"
1
Detsch, Denise Trevisoli 1983. „Sobre problemas associados a cones de segunda ordem“. [s.n.], 2011. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306040.
Der volle Inhalt der QuelleAnnotation:
Orientador: Maria Aparecida Diniz EhrhardtDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica
Made available in DSpace on 2018-08-18T12:52:22Z (GMT). No. of bitstreams: 1 Detsch_DeniseTrevisoli_M.pdf: 1081241 bytes, checksum: c29e7e81ee2ecb8467802991fc75be51 (MD5) Previous issue date: 2011
Resumo: Este trabalho teve como foco o estudo de problemas SOCP, tanto nos seus aspectos teóricos quanto nos seus aspectos práticos. Problemas SOCP são problemas convexos de otimização nos quais uma função linear 'e minimizada sobre restrições lineares e restrições de cone quadrático. Tivemos dois objetivos principais: estudar o conceito, as aplicações e os métodos de resolução de problemas SOCP, permitindo verificar a viabilidade de trabalhar com tais problemas; e verificar na prática o benefício de se utilizar uma ferramenta específica de SOCP para a resolução de problemas que se enquadram nessa classe. Para a avaliação prática utilizamos um software de otimização genérica (fmincon) e outro específico de SOCP (CVXOPT). A análise ficou concentrada nos requisitos robustez, número de iterações e variação do tempo com o aumento da dimensão dos problemas. Diante dos resultados obtidos com os testes numéricos, pudemos concluir que 'e interessante usar SOCP sempre que possível
Abstract: This dissertation focuses on the study of SOCP problems, both in its theoretical, and in its practical aspects. SOCP problems are convex optimization problems in which a linear function is minimized over linear constraints and second-order cone constraints. We had two main objectives: study the concept, applications and methods for solving the SOCP problem, making it possible to verify the feasibility of working with such problems; and to verify the practical benefits of using a SOCP specific tool for the resolution of problems of this class. The experimental evaluation used a generic optimization software (fmincon) and other SOCP specific software (CVXOPT). The analysis was concentrated on the robustness, number of iterations and time variation with the increasing scale of the problems. From results obtained with the numerical tests, we concluded that SOCP is worth to be used whenever possible
Mestrado
Matematica Aplicada
Mestre em Matemática Aplicada
2
Moura, Phablo Fernando Soares. „Recoloração convexa de grafos: algoritmos e poliedros“. Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-19112013-193725/.
Der volle Inhalt der QuelleAnnotation:
Neste trabalho, estudamos o problema a recoloração convexa de grafos, denotado por RC. Dizemos que uma coloração dos vértices de um grafo G é convexa se, para cada cor tribuída d, os vértices de G com a cor d induzem um subgrafo conexo. No problema RC, é dado um grafo G e uma coloração de seus vértices, e o objetivo é recolorir o menor número possível de vértices de G tal que a coloração resultante seja convexa. A motivação para o estudo deste problema surgiu em contexto de árvores filogenéticas. Sabe-se que este problema é NP-difícil mesmo quando G é um caminho. Mostramos que o problema RC parametrizado pelo número de mudanças de cor é W[2]-difícil mesmo se a coloração inicial usa apenas duas cores. Além disso, provamos alguns resultados sobre a inaproximabilidade deste problema. Apresentamos uma formulação inteira para a versão com pesos do problema RC em grafos arbitrários, e então a especializamos para o caso de árvores. Estudamos a estrutura facial do politopo definido como a envoltória convexa dos pontos inteiros que satisfazem as restrições da formulação proposta, apresentamos várias classes de desigualdades que definem facetas e descrevemos os correspondentes algoritmos de separação. Implementamos um algoritmo branch-and-cut para o problema RC em árvores e mostramos os resultados computacionais obtidos com uma grande quantidade de instâncias que representam árvores filogenéticas reais. Os experimentos mostram que essa abordagem pode ser usada para resolver instâncias da ordem de 1500 vértices em 40 minutos, um desempenho muito superior ao alcançado por outros algoritmos propostos na literatura.In this work we study the convex recoloring problem of graphs, denoted by CR. We say that a vertex coloring of a graph G is convex if, for each assigned color d, the vertices of G with color d induce a connected subgraph. In the CR problem, given a graph G and a coloring of its vertices, we want to find a recoloring that is convex and minimizes the number of recolored vertices. The motivation for investigating this problem has its roots in the study of phylogenetic trees. It is known that this problem is NP-hard even when G is a path. We show that the problem CR parameterized by the number of color changes is W[2]-hard even if the initial coloring uses only two colors. Moreover, we prove some inapproximation results for this problem. We also show an integer programming formulation for the weighted version of this problem on arbitrary graphs, and then specialize it for trees. We study the facial structure of the polytope defined as the convex hull of the integer points satisfying the restrictions of the proposed ILP formulation, present several classes of facet-defining inequalities and the corresponding separation algorithms. We also present a branch-and-cut algorithm that we have implemented for the special case of trees, and show the computational results obtained with a large number of instances. We considered instances which are real phylogenetic trees. The experiments show that this approach can be used to solve instances up to 1500 vertices in 40 minutes, comparing favorably to other approaches that have been proposed in the literature.
3
Souza, Valeska Martins de. „PROJETO DE CONTROLADOR ROBUSTO VIA OTIMIZAÇÃO CONVEXA“. Universidade Federal do Maranhão, 2002. http://tedebc.ufma.br:8080/jspui/handle/tede/319.
Der volle Inhalt der QuelleAnnotation:
Made available in DSpace on 2016-08-17T14:52:45Z (GMT). No. of bitstreams: 1
Valeska Martins Souza.pdf: 622283 bytes, checksum: 075dc5eb2d1ecc78b4ecd96ae57ab70e (MD5)
Previous issue date: 2002-02-13In this dissertation a new methodology of based convex optimization in linear matrix inaqualities is proposal as basic instrument for the synthesis of robust controllers of discrete and linear dynamic systems that take care of to the specifications of perturbations of worse case.
Nesta dissertação é proposta uma nova metodologia de otimização convexa baseada em desigualdades matriciais lineares como instrumento básico para a síntese de controladores robustos de sistemas dinâmicos discretos e lineares que atendam às especificações de pertubações de pior caso.
4
Deswarte, Raphaël. „Régression linéaire et apprentissage : contributions aux méthodes de régularisation et d’agrégation“. Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLX047/document.
Der volle Inhalt der QuelleAnnotation:
Cette thèse aborde le sujet de la régression linéaire dans différents cadres, liés notamment à l’apprentissage. Les deux premiers chapitres présentent le contexte des travaux, leurs apports et les outils mathématiques utilisés. Le troisième chapitre est consacré à la construction d’une fonction de régularisation optimale, permettant par exemple d’améliorer sur le plan théorique la régularisation de l’estimateur LASSO. Le quatrième chapitre présente, dans le domaine de l’optimisation convexe séquentielle, des accélérations d’un algorithme récent et prometteur, MetaGrad, et une conversion d’un cadre dit “séquentiel déterministe" vers un cadre dit “batch stochastique" pour cet algorithme. Le cinquième chapitre s’intéresse à des prévisions successives par intervalles, fondées sur l’agrégation de prédicteurs, sans retour d’expérience intermédiaire ni modélisation stochastique. Enfin, le sixième chapitre applique à un jeu de données pétrolières plusieurs méthodes d’agrégation, aboutissant à des prévisions ponctuelles court-terme et des intervalles de prévision long-termeThis thesis tackles the topic of linear regression, within several frameworks, mainly linked to statistical learning. The first and second chapters present the context, the results and the mathematical tools of the manuscript. In the third chapter, we provide a way of building an optimal regularization function, improving for instance, in a theoretical way, the LASSO estimator. The fourth chapter presents, in the field of online convex optimization, speed-ups for a recent and promising algorithm, MetaGrad, and shows how to transfer its guarantees from a so-called “online deterministic setting" to a “stochastic batch setting". In the fifth chapter, we introduce a new method to forecast successive intervals by aggregating predictors, without intermediate feedback nor stochastic modeling. The sixth chapter applies several aggregation methods to an oil production dataset, forecasting short-term precise values and long-term intervals
5
Ostrovskii, Dmitrii. „Reconstruction adaptative des signaux par optimisation convexe“. Thesis, Université Grenoble Alpes (ComUE), 2018. http://www.theses.fr/2018GREAM004/document.
Der volle Inhalt der QuelleAnnotation:
Nous considérons le problème de débruitage d'un signal ou d'une image observés dans le bruit gaussien. Dans ce problème les estimateurs linéaires classiques sont quasi-optimaux quand l'ensemble des signaux, qui doit être convexe et compact, est connu a priori. Si cet ensemble n'est pas spécifié, la conception d'un estimateur adaptatif qui ``ne connait pas'' la structure cachée du signal reste un problème difficile. Dans cette thèse, nous étudions une nouvelle famille d'estimateurs des signaux satisfaisant certains propriétés d'invariance dans le temps. De tels signaux sont caractérisés par leur structure harmonique, qui est généralement inconnu dans la pratique.Nous proposons des nouveaux estimateurs capables d'exploiter la structure harmonique inconnue du signal è reconstruire. Nous démontrons que ces estimateurs obéissent aux divers "inégalités d'oracle," et nous proposons une implémentation algorithmique numériquement efficace de ces estimateurs basée sur des algorithmes d'optimisation de "premier ordre." Nous évaluons ces estimateurs sur des données synthétiques et sur des signaux et images réellesWe consider the problem of denoising a signal observed in Gaussian noise.In this problem, classical linear estimators are quasi-optimal provided that the set of possible signals is convex, compact, and known a priori. However, when the set is unspecified, designing an estimator which does not ``know'' the underlying structure of a signal yet has favorable theoretical guarantees of statistical performance remains a challenging problem. In this thesis, we study a new family of estimators for statistical recovery of signals satisfying certain time-invariance properties. Such signals are characterized by their harmonic structure, which is usually unknown in practice. We propose new estimators which are capable to exploit the unknown harmonic structure of a signal to reconstruct. We demonstrate that these estimators admit theoretical performance guarantees, in the form of oracle inequalities, in a variety of settings.We provide efficient algorithmic implementations of these estimators via first-order optimization algorithm with non-Euclidean geometry, and evaluate them on synthetic data, as well as some real-world signals and images
6
Cox, Bruce. „Applications of accuracy certificates for problems with convex structure“. Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/39489.
Der volle Inhalt der QuelleAnnotation:
Applications of accuracy certificates for problems with convex structure This dissertation addresses the efficient generation and potential applications of accuracy certificates in the framework of “black-box-represented” convex optimization problems - convex problems where the objective and the constraints are represented by “black boxes” which, given on input a value x of the argument, somehow (perhaps in a fashion unknown to the user) provide on output the values and the derivatives of the objective and the constraints at x. The main body of the dissertation can be split into three parts. In the first part, we provide our background --- state of the art of the theory of accuracy certificates for black-box-represented convex optimization. In the second part, we extend the toolbox of black-box-oriented convex optimization algorithms with accuracy certificates by equipping with these certificates a state-of-the-art algorithm for large-scale nonsmooth black-box-represented problems with convex structure, specifically, the Non-Euclidean Restricted Memory Level (NERML) method. In the third part, we present several novel academic applications of accuracy certificates. The dissertation is organized as follows: In Chapter 1, we motivate our research goals and present a detailed summary of our results. In Chapter 2, we outline the relevant background, specifically, describe four generic black-box-represented generic problems with convex structure (Convex Minimization, Convex-Concave Saddle Point, Convex Nash Equilibrium, and Variational Inequality with Monotone Operator), and outline the existing theory of accuracy certificates for these problems. In Chapter 3, we develop techniques for equipping with on-line accuracy certificates the state-of-the-art NERML algorithm for large-scale nonsmooth problems with convex structure, both in the cases when the domain of the problem is a simple solid and in the case when the domain is given by Separation oracle. In Chapter 4, we develop several novel academic applications of accuracy certificates, primarily to (a) efficient certifying emptiness of the intersection of finitely many solids given by Separation oracles, and (b) building efficient algorithms for convex minimization over solids given by Linear Optimization oracles (both precise and approximate). In Chapter 5, we apply accuracy certificates to efficient decomposition of “well structured” convex-concave saddle point problems, with applications to computationally attractive decomposition of a large-scale LP program with the constraint matrix which becomes block-diagonal after eliminating a relatively small number of possibly dense columns (corresponding to “linking variables”) and possibly dense rows (corresponding to “linking constraints”).
7
Delyon, Alexandre. „Shape Optimisation Problems Around the Geometry of Branchiopod Eggs“. Electronic Thesis or Diss., Université de Lorraine, 2020. http://www.theses.fr/2020LORR0123.
Der volle Inhalt der QuelleAnnotation:
Dans cette thèse nous nous intéressons à un problème de mathématiques appliquées à la biologie. Le but est d'expliquer la forme des œufs d'Eulimnadia, un petit animal appartenant à la classe des Branchiopodes, et plus précisément les Limnadiides. En effet, d'après la théorie de l'évolution il est raisonnable de penser que la forme des êtres vivants où des objets issus d'êtres vivants est optimisée pour garantir la survie et l'expansion de l'espèce en question. Pour ce faire nous avons opté pour la méthode de modélisation inverse. Cette dernière consiste à proposer une explication biologique à la forme des œufs, puis de la modéliser sous forme d'un problème de mathématique, et plus précisément d'optimisation de forme, que l'on cherche à résoudre pour enfin comparer la forme obtenue à la forme réelle des œufs. Nous avons étudié deux modélisations, l'une amenant à des problèmes de géométrie et de packing, l'autre à des problèmes d'optimisation de forme en élasticité linéaire. Durant la résolution du premier problème issue de la modélisation, une autre question mathématique s'est naturellement posée à nous, et nous sommes parvenus à la résoudre, donnant lieu à l'obtention du diagramme de Blaschke Santalo (A,D,r) complet. En d'autre mots nous pouvons répondre à la question suivante : étant donné trois nombres A,D, et r positifs, est-il possible de trouver un ensemble convexe du plan dont l'aire est égale à A, le diamètre égal à D, et le rayon du cercle inscrit égal à r ?In this thesis we are interested in a problem of mathematics applied to biology. The aim is to explain the shape of the eggs of Eulimnadia, a small animal belonging to the class Branchiopods}, and more precisely the Limnadiidae. Indeed, according to the theory of evolution it is reasonable to think that the shape of living beings or objects derived from living beings is optimized to ensure the survival and expansion of the species in question. To do this we have opted for the inverse modeling method. The latter consists in proposing a biological explanation for the shape of the eggs, then modeling it in the form of a mathematical problem, and more precisely a shape optimisation problem which we try to solve and finally compare the shape obtained to the real one. We have studied two models, one leading to geometry and packing problems, the other to shape optimisation problems in linear elasticity. After the resolution of the first modeling problem, another mathematical question naturally arose to us, and we managed to solve it, resulting in the complete Blaschke-Santalò (A,D,r) diagram. In other words we can answer the following question: given three positive numbers A,D, and r, and it is possible to find a convex set of the plane whose area is equal to A, diameter equal to D, and radius of the inscribed circle equal to r
8
Karas, Elizabeth Wegner. „Exemplos de trajetória central mal comportada em otimização convexa e um algoritmo de filtros para programação não linear“. Florianópolis, SC, 2002. http://repositorio.ufsc.br/xmlui/handle/123456789/82651.
Der volle Inhalt der QuelleAnnotation:
Tese (doutorado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia de Produção.Made available in DSpace on 2012-10-19T17:03:59Z (GMT). No. of bitstreams: 1 186157.pdf: 1340419 bytes, checksum: 96d87b8ae1c485061c1b898b42e15bc5 (MD5)
Neste trabalho apresentamos alguns exemplos de trajetória central mal comportada em otimização convexa. Alguns destes exemplos se parecem com uma antena de TV, contendo uma infinidade de segmentos horizontais de comprimento constante. Outros tem a forma de ziguezague com variação infinita. Mostramos que estes exemplos podem ocorrer mesmo que as funções envolvidas sejam infinitamente diferenciáveis. Apresentamos também, nesta tese, um algoritmo de filtro para programação não linear e provamos sua convergência global para pontos estacionários. Cada iteração é composta em duas fases totalmente independentes, e o único acoplamento entre elas é estabelecido pelo filtro. Sob hipóteses padrões, nós mostramos dois resultados: para o filtro com um tamanho mínimo, o algoritmo gera um ponto de acumulação estacionário; para um filtro levemente maior, todos os pontos de acumulação são estacionários.
9
Oliveira, André Marcorin de. „Estimating and control of Markov jump linear systems with partial observation of the operation mode“. Universidade de São Paulo, 2018. http://www.teses.usp.br/teses/disponiveis/3/3139/tde-01032019-144518/.
Der volle Inhalt der QuelleAnnotation:
In this thesis, we present some contributions to the Markov jump linear systems theory in a context of partial information on the Markov chain. We consider that the state of the Markov chain cannot be measured, but instead there is only an observed variable that could model an asynchronous phenomenon between the application and the plant, or a simple fault detection and isolation device. In this formulation, we investigate the problem of designing controllers and filters depending only on the observed variable in the context of H2, H?, and mixed H2/H? control theory. Numerical examples and academic applications are presented for active-fault tolerant control systems and networked control systems.Nesta tese, apresentamos algumas contribuições para a teoria de sistemas lineares com saltos markovianos em um contexto de observação parcial da cadeia de Markov. Consideramos que o estado da cadeia de Markov não pode ser medido, porém existe uma variável observada que pode modelar um fenômeno assíncrono entre a aplicação e a planta, ou ainda um dispositivo de detecção de falhas simples. Através desse modelo, investigamos o problema da síntese de controladores e filtros que dependem somente da variável observada no contexto das teorias de controle H2, H?, e misto H2/H?. Exemplos numéricos e aplicações acadêmicas são apresentadas no âmbito dos sistemas de controle tolerantes a falhas e dos sistemas de controle através da rede.
10
Marins, Fernando Augusto Silva. „Estudos de programas em redes lineares por partes“. [s.n.], 1987. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260695.
Der volle Inhalt der QuelleAnnotation:
Orientador : Clovis Perin FilhoTese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica
Made available in DSpace on 2018-07-14T20:12:42Z (GMT). No. of bitstreams: 1 Marins_FernandoAugustoSilva_D.pdf: 8217799 bytes, checksum: 742307af34df06fe0a33afc37f0dd706 (MD5) Previous issue date: 1987
Resumo: Este trabalho propõe um refinamentodo metodo simplex especializado para Programas em Redes Lineares por Partes, denomi nado MSFV. Este refinamento e uma extensão do conceito de bases fortemente viáveis para Programas em Redes, desenvolvido por W.H. Cunningham. A viabilidade forte e mantida por meio de uma regra de saida especifica, para escolha da variável básica que deve deixar a base em cada iteração do simplex. Prova-se que, o uso de viabilidade forte em conjunto com regras de entrada adequadas, evita os fenômenos de ciclagem ("cycling") e de empacamento ("stalling"). Alem disto são apresentados resultados computacionais testando o MSFV combinado com várias regras de entrada. Adicionalmente, é realizada uma investigação do desempenho do MSFV incorporando a Tecnica de Mudança de Escala, proposta por Edmonds e Kar
Abstract: This work proposes a refinementof the simplex method especialized for solving Piecewise-Linear Network Programs, named MSFV. Such a refinement is an extension of the strongly feasible bases concept for Network Programs, developed by W.H. Cunningham. Strongly feasibility is preserved by a specific leaving variable selection rule at each simplex ite~ation. It is proved that the use of strong feasibility together with adequate entering variable selection rules prevents two phenomena cycling (ciclic sequence of degenerate iterations) and stall ing (exponentially long sequence of degenerated iterations). Moreover it is reported a computational testing of MSFV linked with several entering variable selection rules. In addition, it is investigated the performance of MSFV with theScaling Technique, proposed by Edmonds and Kar
Doutorado
Bücher zum Thema "Convent of Lindau"
1
Eremin, I. I. Theory of linear optimization. Utrecht: VSP, 2002.
Den vollen Inhalt der Quelle finden
2
Deville, R. Smoothness and renormings in Banach spaces. Harlow, Essex, England: Longman Scientific & Technical, 1993.
Den vollen Inhalt der Quelle finden
3
Deville, Robert. Smoothness and renormings in Banach spaces. Harlow: Longman Scientific and Technical, 1993.
Den vollen Inhalt der Quelle finden
4
Maraschio, Nicoletta, Hrsg. Firenze e la lingua italiana fra nazione ed Europa. Florence: Firenze University Press, 2007. http://dx.doi.org/10.36253/978-88-6453-170-0.
Der volle Inhalt der QuelleAnnotation:
Il volume raccoglie gli atti del convegno "Firenze e la lingua italiana tra nazione ed Europa" che si è tenuto nei giorni 27-28 maggio 2004 presso l'Aula Magna dell'Università degli Studi di Firenze e l'Accademia della Crusca. Firenze ha avuto, come è noto, un ruolo centrale nel processo di unificazione linguistica nazionale e grazie alla sua vocazione internazionale ha promosso la diffusione e la conoscenza della lingua e della cultura italiana in Europa e nel mondo. Al di là di ogni ottica celebrativa, quindi, il convegno ha permesso una discussione aperta sull'identità culturale della città nel contesto contemporaneo, attraverso una riflessione critica sulla sua storia (in particolare su alcuni momenti significativi della cultura fiorentina tra Otto e Novecento) e sul suo primato linguistico.
5
Glauco, Sanga, Hrsg. Koinè in Italia dalle origini al Cinquecento: Atti del convegno di Milano e Pavia 25-26 settembre 1987. Bergamo: P. Lubrina, 1990.
Den vollen Inhalt der Quelle finden
6
Perez-Garcia, C. Locally convex spaces over non-Archimedean valued fields. New York: Cambridge University Press, 2009.
Den vollen Inhalt der Quelle finden
7
Neubauer, Andreas. Tikhonov-regularization of ill-posed linear operator equations on closed convex sets. Wien: VWGÖ, 1986.
Den vollen Inhalt der Quelle finden
8
Bertelé, Matteo, Angela Bianco und Alessia Cavallaro. Le Muse fanno il girotondo: Jurij Lotman e le arti. Venice: Edizioni Ca' Foscari, 2019. http://dx.doi.org/10.30687/978-88-6969-352-6.
Der volle Inhalt der QuelleAnnotation:
Giunta alla sua terza pubblicazione, la collana Obratnaja perspektiva | La Prospettiva rovesciata continua la sua missione di indagine e divulgazione di aspetti rilevanti della cultura figurativa russa, approfondendo l’apporto specifico di influenti personalità. Questo volume è dedicato alla figura di Jurij Lotman (1922-1993), il cui pensiero ha ispirato studiosi e pensatori di ogni disciplina e provenienza, come è ben dimostrato dalla presente selezione di interventi, pubblicati in lingua originale, e presentati da studiosi di diverse nazionalità e giovani ricercatori italiani in occasione del convegno «Le Muse fanno il girotondo. Jurij Lotman e le arti» e del seminario propedeutico al convegno stesso. A chiudere la rassegna lotmaniana e il presente volume, entrambi a cura del Centro Studi sulle Arti della Russia (CSAR) dell’Università Ca’ Foscari Venezia, si propone una selezione di disegni realizzati da Lotman, oggi conservati presso le Università di Tallinn e Tartu.
9
Berge, Claude. Topological spaces: Including a treatment of multi-valued functions, vector spaces, and convexity. Mineola, N.Y: Dover Publications, 1997.
Den vollen Inhalt der Quelle finden
10
Milman, Vitali D. Asymptotic theory of finite dimensional normed spaces. 2. Aufl. Berlin: Springer, 2001.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Convent of Lindau"
1
den Hertog, D. „Introduction of IPMs“. In Interior Point Approach to Linear, Quadratic and Convex Programming, 1–8. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-011-1134-8_1.
Der volle Inhalt der Quelle
2
den Hertog, D. „The logarithmic barrier method“. In Interior Point Approach to Linear, Quadratic and Convex Programming, 9–71. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-011-1134-8_2.
Der volle Inhalt der Quelle
3
den Hertog, D. „The center method“. In Interior Point Approach to Linear, Quadratic and Convex Programming, 73–109. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-011-1134-8_3.
Der volle Inhalt der Quelle
4
den Hertog, D. „Reducing the complexity for LP“. In Interior Point Approach to Linear, Quadratic and Convex Programming, 111–43. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-011-1134-8_4.
Der volle Inhalt der Quelle
5
den Hertog, D. „Discussion of other IPMs“. In Interior Point Approach to Linear, Quadratic and Convex Programming, 145–67. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-011-1134-8_5.
Der volle Inhalt der Quelle
6
den Hertog, D. „Summary, conclusions and recommendations“. In Interior Point Approach to Linear, Quadratic and Convex Programming, 169–73. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-011-1134-8_6.
Der volle Inhalt der Quelle
7
Augustová, Karolína. „Photovoice as a Research Tool of the “Game” Along the “Balkan Route”“. In IMISCOE Research Series, 197–215. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-67608-7_11.
Der volle Inhalt der QuelleAnnotation:
AbstractMigratory pathways across the borders of South Eastern Europe have been commonly recognised within public and policy discourses as the ‘Balkan Route’ (Frontex, 2018; UNHCR, 2019). Yet those pathways do not follow one linear route across the official border checkpoints of former Yugoslav states – Serbia and Bosnia, to the European Union – Croatia and Hungary (Obradovic-Wochnik & Bird, 2019; Stojić & Vilenica, 2019). As often encountered by displaced populations, the journeys consist of perpetually moving onward and being pushed backward across diverse European towns, highways, mountains, forests, rivers, minefields, and camps, necessary to cross to reach western or northern Europe. Displaced people stranded in Serbia and Bosnia generally call their border crossing attempts the ‘game’; the term that conveys the daily mobility struggles, violence and deaths.
8
Bechberger, Lucas, und Kai-Uwe Kühnberger. „Generalizing Psychological Similarity Spaces to Unseen Stimuli“. In Language, Cognition, and Mind, 11–36. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-69823-2_2.
Der volle Inhalt der QuelleAnnotation:
AbstractThe cognitive framework of conceptual spaces proposes to represent concepts as regions in psychological similarity spaces. These similarity spaces are typically obtained through multidimensional scaling (MDS), which converts human dissimilarity ratings for a fixed set of stimuli into a spatial representation. One can distinguish metric MDS (which assumes that the dissimilarity ratings are interval or ratio scaled) from nonmetric MDS (which only assumes an ordinal scale). In our first study, we show that despite its additional assumptions, metric MDS does not necessarily yield better solutions than nonmetric MDS. In this chapter, we furthermore propose to learn a mapping from raw stimuli into the similarity space using artificial neural networks (ANNs) in order to generalize the similarity space to unseen inputs. In our second study, we show that a linear regression from the activation vectors of a convolutional ANN to similarity spaces obtained by MDS can be successful and that the results are sensitive to the number of dimensions of the similarity space.
9
Tan, Yong Kiam, Marijn J. H. Heule und Magnus O. Myreen. „cake_lpr: Verified Propagation Redundancy Checking in CakeML“. In Tools and Algorithms for the Construction and Analysis of Systems, 223–41. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72013-1_12.
Der volle Inhalt der QuelleAnnotation:
AbstractModern SAT solvers can emit independently checkable proof certificates to validate their results. The state-of-the-art proof system that allows for compact proof certificates is propagation redundancy (PR). However, the only existing method to validate proofs in this system with a formally verified tool requires a transformation to a weaker proof system, which can result in a significant blowup in the size of the proof and increased proof validation time. This paper describes the first approach to formally verify PR proofs on a succinct representation; we present (i) a new Linear PR (LPR) proof format, (ii) a tool to efficiently convert PR proofs into LPR format, and (iii) , a verified LPR proof checker developed in CakeML. The LPR format is backwards compatible with the existing LRAT format, but extends the latter with support for the addition of PR clauses. Moreover, is verified using CakeML ’s binary code extraction toolchain, which yields correctness guarantees for its machine code (binary) implementation. This further distinguishes our clausal proof checker from existing ones because unverified extraction and compilation tools are removed from its trusted computing base. We experimentally show that LPR provides efficiency gains over existing proof formats and that the strong correctness guarantees are obtained without significant sacrifice in the performance of the verified executable.
10
Gieras, Jacek F. „Review of Construction“. In Linear Induction Drives, 1–33. Oxford University PressOxford, 1994. http://dx.doi.org/10.1093/oso/9780198593812.003.0001.
Der volle Inhalt der QuelleAnnotation:
Abstract Linear electric motors belong to the group of special electrical machines that convert electrical energy directly into mechanical energy of translatory motion. Linear electric motors can be classified as follows:
Konferenzberichte zum Thema "Convent of Lindau"
1
Araújo, J., M. Campêlo und G. H. De Sousa. „Calculando o número de envoltória nas convexidades P3 e P3⇤ †“. In III Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2018.3176.
Der volle Inhalt der QuelleAnnotation:
Um subconjunto de vértices S em um grafo G = (V, E) é convexo na convexidade P3 (resp. P 3⇤ ) se todo vértice v 2 V (G) \ S não possuir dois vizinhos (resp. que não sejam adjacentes entre si) em S. A envoltória convexa de S é o menor conjunto convexo que o contém. Um conjunto de envoltória é um conjunto cuja envoltória convexa é V (G). O número de envoltória é a cardinalidade de um conjunto de envoltória mínimo. Neste trabalho, propomos e estudamos duas formulações de programação linear-inteira para determinar o número de envoltória de um grafo nas convexidades P3 e P 3⇤ , que acreditamos serem as primeiras na literatura. Realizamos experimentos computacionais para avaliar seus desempenhos.
2
„Convegno SISD Lugano 2023“. In Atti Convegno SISD Lugano. Bibliothèque de l'OProM, 2024. http://dx.doi.org/10.55456/sisd1.
Der volle Inhalt der QuelleAnnotation:
Raffaele Pinto (Università di Barcellona). PRESENTAZIONE del SISD Mirco Cittadini. Dante e il mondo infero: Hillman interprete (in)consapevole della Commedia Raffaele Pinto (Università di Barcellona). Cervantes e Dante Paola Vecchi (Università di Bologna). La Commissione per i Testi di Lingua e Dante: una storia fra Otto e Novecento Erminia Ardissino (Università di Torino). "Anni di nostalgia" e anni di formazione: Dante nel romanzo di Kenzaburo Oe Gabriella Gavagnin (Università di Barcellona). L’Ulisse dantesco in Mercè Rodoreda Francesco Luti (Università di Barcellona). Dante in João Guimarães Rosa Bruno Pinchard (Università Lyon 3). Saint John Perse e Dante Valeria Giannantonio (Università di Chieti). Il lirismo di Eliot tra Pound, il simbolismo francese e Dante Gianni Vacchelli. L'attualità inattuale di Dante: per una ermeneutica della liberazione Roberta Capelli (Università di Trento). Dante e il Modernismo: Pound, Eliot e Joyce Marianna Esposito Vinzi (Education nationale Académie de Paris). Toni Morrison e Dante Gandolfo Cascio (Università di Utrecht). American Papers: Dante e Borgese Carla Rossi (Università di Zurigo/Università del Salento). Il Dante di J. L. Borges
3
Alden, Mohammed Jamal, und Xin Wang. „Robust and Resilient Control for Time-Delay Wind Energy Conversion System“. In ASME 2015 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/imece2015-50286.
Der volle Inhalt der QuelleAnnotation:
Wind energy is the fastest growing and most promising renewable energy resource. A robust and resilient delay independent control framework with a H∞ performance objective for a time delayed variable speed permanent magnet synchronous generator based wind energy conversion system is proposed. Based on the nonlinear dynamics, a third order linearized model for the wind energy conversion system is developed. It is assumed that the system has unstructured bounded uncertainties and it is exposed to bounded L2 type of disturbances. Moreover, fixed time delays are assumed to be existed in the input and state feedback signals. Linear matrix inequalities are utilized to convert the problem of controller existence into a convex optimization problem. Computer simulations conducted in Matlab verified the effectiveness of the proposed control in achieving asymptotic stability and meet the H∞ performance objective requirements.
4
Arbabian, Morteza. „System to convert rotational momentum into versatile linear propulsion“. In AIAA Propulsion and Energy 2021 Forum. Reston, Virginia: American Institute of Aeronautics and Astronautics, 2021. http://dx.doi.org/10.2514/6.2021-3250.
Der volle Inhalt der Quelle
5
Macia, Narciso F., und Ha Van Nguyen. „Electrical, Micro-Power Generation Using a Fluidic Oscillator“. In ASME 2005 International Mechanical Engineering Congress and Exposition. ASMEDC, 2005. http://dx.doi.org/10.1115/imece2005-82791.
Der volle Inhalt der QuelleAnnotation:
This paper presents a fluidic device capable of generating electrical micro-power from a steady air pressure source. The Fluidic Driven Piezoelectric Generator (FDPG) relies on a fluidic pressure-controlled oscillator, a fluidic linear proportional amplifier with its output ports connected to its input ports, to convert a steady air pressure into an oscillating air pressure. The piezoelectric device then converts the oscillating air pressure into an AC electrical voltage that is available for rectification and subsequent source of electrical power. This project has demonstrated that the FDPG produces 0.55W of electrical power, with an air pressure supply of 2.0 psig. This translates to an efficiency of 35%. This paper compares the predicted power level output of an analytical model to the proof-of-concept plastic model. The fluidic oscillator model was implemented in an equivalent electrical circuit using PSPICE. This approach has applications in remote or portable pneumatic applications where intelligent instrumentation and control are needed yet no battery or auxiliary electrical power is available to drive an electronic microcontroller.
6
de Berg, Mark, Jiří Matoušek und Otfried Schwarzkopf. „Piecewise linear paths among convex obstacles“. In the twenty-fifth annual ACM symposium. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/167088.167224.
Der volle Inhalt der Quelle
7
Diamond, Steven, und Stephen Boyd. „Convex Optimization with Abstract Linear Operators“. In 2015 IEEE International Conference on Computer Vision (ICCV). IEEE, 2015. http://dx.doi.org/10.1109/iccv.2015.84.
Der volle Inhalt der Quelle
8
Afsharrad, Amirhossein, Ahmadreza Moradipari und Sanjay Lall. „Convex Methods for Constrained Linear Bandits“. In 2024 European Control Conference (ECC). IEEE, 2024. http://dx.doi.org/10.23919/ecc64448.2024.10591173.
Der volle Inhalt der Quelle
9
Lan, Zhiyong, Xie Bin und Luo Xun Hua. „The Thrust Fluctuation Resistance Weakend of Single-Stage Convex Stepped Auxiliary Tooth Structure PMLSM“. In 2021 13th International Symposium on Linear Drives for Industry Applications (LDIA). IEEE, 2021. http://dx.doi.org/10.1109/ldia49489.2021.9505727.
Der volle Inhalt der Quelle
10
Yu, Zhibin, Artur J. Jaworski und Scott Backhaus. „Design of a Low-Cost Thermoacoustic Electricity Generator and Its Experimental Verification“. In ASME 2010 10th Biennial Conference on Engineering Systems Design and Analysis. ASMEDC, 2010. http://dx.doi.org/10.1115/esda2010-24598.
Der volle Inhalt der QuelleAnnotation:
This paper describes the design and testing of a low cost thermoacoustic generator. A travelling-wave thermoacoustic engine with a configuration of a looped-tube resonator is designed and constructed to convert heat to acoustic power. A commercially available, low-cost loudspeaker is adopted as the alternator to convert the engine’s acoustic power to electricity. The whole system is designed using linear thermoacoustic theory. The optimization of different parts of the thermoacoustic generator, as well as the matching between the thermoacoustic engine and the alternator are discussed in detail. A detailed comparison between the preliminary test results and linear thermoacoustic predictions is provided.
Berichte der Organisationen zum Thema "Convent of Lindau"
1
Filipiak, Katarzyna, Dietrich von Rosen, Martin Singull und Wojciech Rejchel. Estimation under inequality constraints in univariate and multivariate linear models. Linköping University Electronic Press, März 2024. http://dx.doi.org/10.3384/lith-mat-r-2024-01.
Der volle Inhalt der QuelleAnnotation:
In this paper least squares and maximum likelihood estimates under univariate and multivariate linear models with a priori information related to maximum effects in the models are determined. Both loss functions (the least squares and negative log-likelihood) and the constraints are convex, so the convex optimization theory can be utilized to obtain estimates, which in this paper are called Safety belt estimates. In particular, the complementary slackness condition, common in convex optimization, implies two alternative types of solutions, strongly dependent on the data and the restriction. It is experimentally shown that, despite of the similarity to the ridge regression estimation under the univariate linear model, the Safety belt estimates behave usually better than estimates obtained via ridge regression. Moreover, concerning the multivariate model, the proposed technique represents a completely novel approach.
2
Sethi, S., und M. I. Taksar. Deterministic Equivalent for a Continuous Linear-Convex Stochastic Control Problem. Fort Belvoir, VA: Defense Technical Information Center, September 1987. http://dx.doi.org/10.21236/ada187818.
Der volle Inhalt der Quelle
3
Bai, Z. D., C. R. Rao und L. C. Zhao. MANOVA Type Tests Under a Convex Discrepancy Function for the Standard Multivariate Linear Model. Fort Belvoir, VA: Defense Technical Information Center, Januar 1993. http://dx.doi.org/10.21236/ada271031.
Der volle Inhalt der Quelle
4
Keogh, Brendan, Dan Golding und Taylor Hardwick. Australian Music and Games 2023 Benchmark. Queensland University of Technology and Swinburne University of Technology, 2023. http://dx.doi.org/10.5204/rep.eprints.243139.
Der volle Inhalt der QuelleAnnotation:
Digital games are a global cultural force, of which music is a foundational aspect. Music is crucial for digital games to develop atmosphere, convey narratives, and frame player interactions. At the same time, digital games provide musicians exciting new opportunities to experiment with dynamic, adaptive, and non-linear music structures. However, writing, producing, licensing, and implementing music for digital games also poses new challenges to existing screen music practices and business models. This benchmark is the first ever investigation into the scope and scale of Australia’s game music sector. It reveals a great diversity of working arrangements, career pathways, and skill sets among game music workers. It exposes entrenched and emerging challenges facing the field that require a rethinking of conventional approaches, and identifies new opportunities for Australian game music to flourish and grow.