Готові списки джерел за темами / Extension bases

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Добірка наукової літератури з теми "Extension bases"

Автор: Grafiati

Опубліковано: 28 вересня 2024

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Extension bases".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Extension bases"

Chen, Yuqun. "Gröbner–Shirshov Bases for Extensions of Algebras." Algebra Colloquium 16, no. 02 (June 2009): 283–92. http://dx.doi.org/10.1142/s1005386709000285.

Повний текст джерела

Анотація:

An algebra [Formula: see text] is called an extension of the algebra M by B if M2 = 0, M is an ideal of [Formula: see text] and [Formula: see text] as algebras. In this paper, by using Gröbner–Shirshov bases, we characterize completely the extensions of M by B. An algorithm to find the conditions of an algebra A to be an extension of M by B is obtained.

Стилі APA, Harvard, Vancouver, ISO та ін.

Hantash, Ra’edOmar Abu, and Mohammed H. AbuH Abu Yunis. "Distal extension bases: Removable partial dentures." Journal of Indian Prosthodontic Society 9, no. 4 (2009): 186. http://dx.doi.org/10.4103/0972-4052.206949.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Antoniou, G., and C. K. MacNish. "Conservative extension concepts for nonmonotonic knowledge bases." International Journal of Intelligent Systems 15, no. 9 (2000): 859–77. http://dx.doi.org/10.1002/1098-111x(200009)15:9<859::aid-int3>3.0.co;2-e.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Zhang, Aixian, and Keqin Feng. "Normal Bases on Galois Ring Extensions." Symmetry 10, no. 12 (December 3, 2018): 702. http://dx.doi.org/10.3390/sym10120702.

Повний текст джерела

Анотація:

Normal bases are widely used in applications of Galois fields and Galois rings in areas such as coding, encryption symmetric algorithms (block cipher), signal processing, and so on. In this paper, we study the normal bases for Galois ring extension R / Z p r , where R = GR ( p r , n ) . We present a criterion on the normal basis for R / Z p r and reduce this problem to one of finite field extension R ¯ / Z ¯ p r = F q / F p ( q = p n ) by Theorem 1. We determine all optimal normal bases for Galois ring extension.

Стилі APA, Harvard, Vancouver, ISO та ін.

Boveda, Eugenia. "Reseña / Comunicación y Chagas. Bases para un diálogo urgente." +E: Revista de Extensión Universitaria, no. 16.Ene-Jun (June 9, 2022): e0004. http://dx.doi.org/10.14409/extension.2022.16.ene-jun.e0004.

Повний текст джерела

Анотація:

Se trata de una recopilación de reflexiones y recomendaciones que surgieron, desde Argentina, a partir de la organización del 1° Conversatorio sobre Comunicación y Chagas (14 de abril de 2020), entre integrantes del grupo ¿De qué hablamos cuando hablamos de Chagas?, el Programa Nacional de Chagas del Ministerio de Salud de la Nación Argentina y la Universidad Nacional del Litoral, junto a una diversidad de actores sociales de distintos puntos del país y del exterior.Este libro pretende ser una herramienta clave para lograr un cambio en la percepción social del Chagas, con el propósito de que cada vez sean más las voces que hablen del tema desde perspectivas críticas, contextualizadas y multidimensionales. Asimismo, constituye un material de consulta para todas aquellas personas interesadas y/o vinculadas con esta problemática, cualquiera sea el ámbito o disciplina de abordaje y el contexto donde este vínculo tenga lugar. En particular, la extensión universitaria resulta un escenario clave por los diálogos que la misma habilita entre actores y saberes diversos.

Стилі APA, Harvard, Vancouver, ISO та ін.

PICKETT, ERIK JARL. "CONSTRUCTION OF SELF-DUAL INTEGRAL NORMAL BASES IN ABELIAN EXTENSIONS OF FINITE AND LOCAL FIELDS." International Journal of Number Theory 06, no. 07 (November 2010): 1565–88. http://dx.doi.org/10.1142/s1793042110003654.

Повний текст джерела

Анотація:

Let F/E be a finite Galois extension of fields with abelian Galois group Γ. A self-dual normal basis for F/E is a normal basis with the additional property that Tr F/E(g(x), h(x)) = δg, h for g, h ∈ Γ. Bayer-Fluckiger and Lenstra have shown that when char (E) ≠ 2, then F admits a self-dual normal basis if and only if [F : E] is odd. If F/E is an extension of finite fields and char (E) = 2, then F admits a self-dual normal basis if and only if the exponent of Γ is not divisible by 4. In this paper, we construct self-dual normal basis generators for finite extensions of finite fields whenever they exist. Now let K be a finite extension of ℚp, let L/K be a finite abelian Galois extension of odd degree and let [Formula: see text] be the valuation ring of L. We define AL/K to be the unique fractional [Formula: see text]-ideal with square equal to the inverse different of L/K. It is known that a self-dual integral normal basis exists for AL/K if and only if L/K is weakly ramified. Assuming p ≠ 2, we construct such bases whenever they exist.

Стилі APA, Harvard, Vancouver, ISO та ін.

KOO, JA KYUNG, DONG HWA SHIN, and DONG SUNG YOON. "NORMAL BASES FOR MODULAR FUNCTION FIELDS." Bulletin of the Australian Mathematical Society 95, no. 3 (March 2, 2017): 384–92. http://dx.doi.org/10.1017/s0004972716001362.

Повний текст джерела

Анотація:

We provide a concrete example of a normal basis for a finite Galois extension which is not abelian. More precisely, let $\mathbb{C}(X(N))$ be the field of meromorphic functions on the modular curve $X(N)$ of level $N$. We construct a completely free element in the extension $\mathbb{C}(X(N))/\mathbb{C}(X(1))$ by means of Siegel functions.

Стилі APA, Harvard, Vancouver, ISO та ін.

Mehta, Ritu, and Sanket Agrawal. "Embracing the organic way: is consumer preference the same for all brands?" International Journal of Retail & Distribution Management 48, no. 5 (April 13, 2020): 453–64. http://dx.doi.org/10.1108/ijrdm-09-2019-0311.

Повний текст джерела

Анотація:

PurposeThe growing market for organic products presents a tremendous opportunity for marketers to extend their existing brands. However, there is hardly any research that investigates the factors extension from an organic parent brand is preferred over extension into same product category for success of such brand extensions. This paper investigates the role of two different bases consumers may use to evaluate the extension into organic product – organic status of the parent brand and its similarity to the extended product category.Design/methodology/approachThe study involved a 2 × 2 (organic versus regular parent brand and same versus different product category) between-subjects factorial design. Data collected from 164 postgraduate students presented with one of the four scenarios were analysed using ANOVA.FindingsThe results reveal that extensions from organic parent brand versus regular brand, and in the same product category versus different category, are evaluated more favourably. Moreover, extension from an organic parent brand is preferred over extension into same product category.Originality/valueThe research contributes to the extant literature on branding and retailing by building on categorisation theory to explain consumer preference for brand extension when launching a new organic product. The findings provide valuable insights to practitioners to launch a new organic product using brand extension.

Стилі APA, Harvard, Vancouver, ISO та ін.

Capps, Richard H. "Extension and replacement bases for semisimple Lie algebras." Journal of Mathematical Physics 27, no. 4 (April 1986): 914–23. http://dx.doi.org/10.1063/1.527164.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Jouini, Abdellatif, and Khalifa Trimèche. "Biorthogonal multiresolution analyses and decompositions of Sobolev spaces." International Journal of Mathematics and Mathematical Sciences 28, no. 9 (2001): 517–34. http://dx.doi.org/10.1155/s0161171201010936.

Повний текст джерела

Анотація:

The object of this paper is to construct extension operators in the Sobolev spacesHk(]−∞,0])andHk([0,+∞[)(k≥0). Then we use these extensions to get biorthogonal wavelet bases inHk(ℝ). We also give a construction inL2([−1,1])to see how to obtain boundaries functions.

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Extension bases"

Martin, Exertier François. "Extension orientée objet d'un SGBD relationnel." Grenoble 1, 1991. http://tel.archives-ouvertes.fr/tel-00004715.

Повний текст джерела

Анотація:

L'objectif de ce travail est la conception et la réalisation d'un Système de Gestion de Base de Données Relationnel (SGBDR) intégrant les concepts et la technologie "objets". Le principe de notre approche est d'étendre les domaines relationnels aux types abstraits (ADT) et revient à coupler de façon relativement faible les concepts et mécanismes objets au modèle et à un système relationnels. Cela introduit des problèmes de modélisation et d'optimisation nouveaux qui restent à étudier. Dans un premier temps, le modèle de données et les caractéristiques de l'extension sont définis. La notion de type abstrait est introduite pour exprimer de nouveaux domaines : un ADT définit une structure de données et un ensemble de méthodes (fonctions) qui constituent son unique interface de manipulation. Un mécanisme d'héritage simple est offert. Des constructeurs sont disponibles pour définir la structure de données d'un type ; on introduit ainsi la notion d'objet complexe. Le concept de partage, associé à l'identité d'objet, est un apport important de ce travail. Le langage associé au modèle est une extension de SQL appelée ESQL ; le langage d'écriture des méthodes actuellement disponible est une extension de C. La mise en oeuvre d'un tel système consiste à développer les composants nécessaires au support d'objets et à les intégrer à un noyau de SGBDR existant. Elle permet de mettre en évidence trois modules principaux. Le gestionnaire de types est un complément du gestionnaire de catalogue relationnel qui gère les définitions d'ADT. Le gestionnaire de méthodes regroupe un ensemble de fonctions allant de la compilation à l'exécution. Le gestionnaire d'objets assure le stockage et la manipulation des objets complexes (instances d'ADT) ; cette partie à notamment permis d'étudier des techniques évoluées de stockage d'objets

Стилі APA, Harvard, Vancouver, ISO та ін.

BENMOHAMED, MOHAMED. "Etude des bases de donnees localisees de grande extension." Paris 7, 1993. http://www.theses.fr/1993PA077013.

Повний текст джерела

Анотація:

L'une des caracteristiques des bases de donnees localisees de grande extension est l'augmentation reguliere du volume de donnees en fonction de la taille de la zone couverte, de la richesse souhaitee et de la frequence de mise a jour. Pour optimiser l'acces aux donnees, il est necessaire de decouper l'espace en partitions. Pour effectuer des applications spatio-temporelles, on conserve l'historique des donnees dans la bd. Il est aussi interessant de modeliser les operations au meme titre que les donnees

Стилі APA, Harvard, Vancouver, ISO та ін.

Mello, Thiago Castilho de. "Sobre bases normais para extensões galoisianas de corpos." Universidade de São Paulo, 2008. http://www.teses.usp.br/teses/disponiveis/55/55135/tde-21052008-150202/.

Повний текст джерела

Анотація:

Neste trabalho apresentamos várias demonstrações do Teorema da Base Normal para certos tipos de extensões galoisianas de corpos, algumas existenciais e outras construtivas, destacando as diferenças e dificuldades de cada situação. Apresentamos também generalizações de tal teorema e mostramos que toda extensão galoisiana de grau ímpar de corpos admite uma base normal autodual com respeito µa forma bilinear traço
In this work we present several demonstrations of The Normal Basis Theorem for certain kinds of galoisian extensions of fields, some of them existential and others constructive, pointing the diffculties and differences in each situation. We also present generalizations of such theorem and show that every odd degree galoisian extension of fields admits a self-dual normal base with respect to the trace bilinear map

Стилі APA, Harvard, Vancouver, ISO та ін.

Mopolo-Moke, Gabriel. "Nice-c++ : une extension c++ pour la programmation persistante a partir d'un serveur de bases d'objets." Nice, 1991. http://www.theses.fr/1991NICE4516.

Повний текст джерела

Анотація:

Le projet tootsi est un projet de recherche europeen qui a debute en fevrier 1989 et prend fin en fevrier 1991. Il vise l'amelioration de l'utilisation des serveurs et banques de donnees existants. Pour mener a bien ce projet, un certain nombre d'outils de developpement ont ete juges necessaires notamment un langage de programmation susceptible de supporter des types complexes et multimedias, la notion de la persistance, le partage et certains liens semantiques tels que l'heritage et l'association. Le langage selectionne c++ ne possede pas toutes ces caracteristiques. Cette etude a pour but de proposer, dans le cadre du projet tootsi, une approche d'extension du langage c++ vers la programmation persistante et la prise en compte de nouveaux types. Notre demarche consiste a ne pas reecrire ou modifier le compilateur c++ mais au contraire a utiliser les concepts d'abstraction de donnees, de polymorphisme et d'heritage deja presents dans ce langage. Dans une premiere partie nous faisons l'etat de l'art dans le domaine de la programmation orientee-objets et de la programmation persistante. Ce systeme est defini par: 1) un modele de programmation fonde sur l'extension du modele d'objets et du systeme de type c++; 2) des interfaces de manipulation des objets et meta-objets; 3) un serveur d'objets pour la gestion de persistance. L'objectif finale de notre travail est de permettre a nice-c++ de supporter: les types complexes et multimedias, les liens d'association, la persistance et le partage afin de repondre aux besoins du projet tootsi

Стилі APA, Harvard, Vancouver, ISO та ін.

Buyukcan, Mehmet. "Preservation And Shelf Life Extension Of Shrimps And Mussels By High Hydrostatic Pressure(hpp)." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/3/12607290/index.pdf.

Повний текст джерела

Анотація:

Shrimp and mussel samples were cleaned, washed and exposed to steam before freezing. HHP treatment was performed at combinations of 200, 220 and 250 MPa at 25, 30, 40 and 50°
C for 10 and 20 minutes. Microbial analysis were performed by analyzing the effect of treatments on the microbial reduction in the samples. Based on the results of the microbial reduction, the best combinations of HHP treatments were determined as 250 MPa, 50°
C, 10 minute for shrimps and 220 MPa, 50°
C, 10 minute for mussels where total microbial inactivation was achieved. Storage analysis was performed on the samples, treated at the selected HHP combinations and stored at room (25°
C) and refrigeration temperatures (4°
C). For the storage analysis, variations in Total Volatile Bases (TVB-N) and pH were measured. According to the results evaluated, shelf-life of the shrimps were detected as 10 and 16 days for storage at room and refrigeration temperature, respectively as compared to 4 days of untreated sample at 4oC. Similarly shelf-life for the mussel samples were obtained as 12 days for storage at room and 18 day for storage at refrigeration temperature as compared to 4 days of untreated sample at 4oC. HHP-at the studied parameters for shrimps and mussels- can be offered as an alternative method for the preservation of shell-fish instead of conventional frozen food technology, which is currently used in the industry, since it gives the opportunity to handle the samples at lower temperatures for the post-production period resulting in both reduction of energy required and operational costs without sacrificing from the quality as measured by microbial reduction, TVB-N and pH.

Стилі APA, Harvard, Vancouver, ISO та ін.

Hmida, Hmida. "Extension des Programmes Génétiques pour l’apprentissage supervisé à partir de très larges Bases de Données (Big data)." Thesis, Paris Sciences et Lettres (ComUE), 2019. http://www.theses.fr/2019PSLED047.

Повний текст джерела

Анотація:

Dans cette thèse, nous étudions l'adaptation des Programmes Génétiques (GP) pour surmonter l'obstacle du volume de données dans les problèmes Big Data. GP est une méta‐heuristique qui a fait ses preuves pour les problèmes de classification. Néanmoins, son coût de calcul est un frein à son utilisation avec les larges bases d’apprentissage. Tout d'abord, nous effectuons une revue approfondie enrichie par une étude comparative expérimentale des algorithmes d'échantillonnage utilisés avec GP. Puis, à partir des résultats de l'étude précédente, nous proposons quelques extensions basées sur l'échantillonnage hiérarchique. Ce dernier combine des algorithmes d'échantillonnage actif à plusieurs niveaux et s’est prouvé une solution appropriée pour mettre à l’échelle certaines techniques comme TBS et pour appliquer GP à un problème Big Data (cas de la classification des bosons de Higgs). Par ailleurs, nous formulons une nouvelle approche d'échantillonnage appelée échantillonnage adaptatif, basée sur le contrôle de la fréquence d'échantillonnage en fonction du processus d'apprentissage, selon les schémas fixe, déterministe et adaptatif. Enfin, nous présentons comment transformer une implémentation GP existante (DEAP) en distribuant les évaluations sur un cluster Spark. Nous démontrons comment cette implémentation peut être exécutée sur des clusters à nombre de nœuds réduit grâce à l’échantillonnage. Les expériences montrent les grands avantages de l'utilisation de Spark pour la parallélisation de GP
In this thesis, we investigate the adaptation of GP to overcome the data Volume hurdle in Big Data problems. GP is a well-established meta-heuristic for classification problems but is impaired with its computing cost. First, we conduct an extensive review enriched with an experimental comparative study of training set sampling algorithms used for GP. Then, based on the previous study results, we propose some extensions based on hierarchical sampling. The latter combines active sampling algorithms on several levels and has proven to be an appropriate solution for sampling techniques that can’t deal with large datatsets (like TBS) and for applying GP to a Big Data problem as Higgs Boson classification.Moreover, we formulate a new sampling approach called “adaptive sampling”, based on controlling sampling frequency depending on learning process and through fixed, determinist and adaptive control schemes. Finally, we present how an existing GP implementation (DEAP) can be adapted by distributing evaluations on a Spark cluster. Then, we demonstrate how this implementation can be run on tiny clusters by sampling.Experiments show the great benefits of using Spark as parallelization technology for GP

Стилі APA, Harvard, Vancouver, ISO та ін.

Tawbi, Chawki. "Adactif : extension d'un SGBD à l'activité par une approche procédurale basée sur les rendez-vous." Toulouse 3, 1996. http://www.theses.fr/1996TOU30262.

Повний текст джерела

Анотація:

L'activite dans les sgbd est mise en uvre grace aux regles evenement-condition-action (eca) qui servent a specifier le comportement actif du systeme et sa reaction vis a vis des situations rencontrees dans la bd et dans son environnement. L'evenement specifie le moment du declenchement de la regle, la condition verifie si l'etat de la bd necessite l'execution de l'action qui a son tour execute des operations en reponse a l'evenement. Ces operations peuvent servir a annuler la cause de l'evenement ou a executer ses consequences. Dans les travaux effectues durant la these, nous nous sommes interesses a un langage dote de mecanismes temps-reel afin de s'en inspirer pour etendre un sgbd passif a l'activite. Nous nous sommes inspires des taches ada et de leur mecanisme de synchronisation (les rendez-vous) pour implanter les regles dans notre sgbd actif baptise adactif. Les regles dans adactif sont considerees comme des taches actives attendant un rendez-vous du systeme en l'occurence de l'evenement declenchant. Chaque tache a en charge la verification d'une condition et, si elle est satisfaite, l'execution de l'action associee decrite de facon procedurale. Les taches dans adactif ont ete realisees a l'aide des processus unix et evoluent en parallele. La synchronisation dans le systeme, quant a elle, est mise en uvre a l'aide des pipe-line unix. D'autre part, comme les evenements composes (formes d'une combinaison d'evenements) jouent un role important dans les sgbd actifs, nous proposons un mecanisme de detection de ce type d'evenements base lui aussi sur le principe de tache et de rendez-vous. Ainsi, un evenement compose est detecte par une regle en attente de rendez-vous avec les evenements composants. Lorsque ces derniers sont au rendez-vous, et apres que la composition ait ete realisee, cette regle signale l'evenement compose au systeme. Cette approche permettra a l'utilisateur de specifier ses propres operateurs de composition conformement a la semantique de son application

Стилі APA, Harvard, Vancouver, ISO та ін.

LECUBIN, FLORENCE. "Synthese et etude de nouvelles bases heterocycliques : extension des motifs de reconnaissance de l'adn double brin par les oligonucleotides anti-genes." Paris 11, 1999. http://www.theses.fr/1999PA112083.

Повний текст джерела

Анотація:

La strategie anti-gene est fondee sur la capacite des oligonucleotides de type oligopyrimidines de reconnaitre des sequences oligopurine_oligopyrimidine d'un adn double brin, par formation d'une triple helice. Dans ces systemes, la reconnaissance et la specificite de sequences sont liees a la formation de liaisons hydrogenes de type hoogsteen entre les bases du troisieme brin et les sites donneurs ou accepteurs du brin homopurine dans le grand sillon de la double helice. Cependant, une inversion des paires de bases (pyrimidine_purine) destabilise considerablement la triple helice. Les travaux presentes dans cette these ont pour objectif d'elaborer de nouveaux analogues d'oligonucleotides qui puissent reconnaitre toute sequence cible quelque soit sa composition en nucleosides. Nous avons synthetise des bases heterocycliques susceptibles de reconnaitre les paires de bases t_a et c_g. Leur construction a mis en jeu une reaction de couplage de type stille. Nous avons ensuite etudie par rmn #1h, dans un solvant organique, la reconnaissance des paires t_a et c_g par ces nouvelles bases qui peuvent former trois liaisons hydrogenes. Cette approche constitue un moyen rapide de preselection des bases modifiees avant d'entreprendre leur incorporation dans des oligonucleotides, qui a ete effectuee au moyen d'unites serinol. La determination de la stabilite des triplex formes, par mesure des temperatures de fusion, a mis en evidence une trop grande flexibilite du systeme d'incorporation. Ce resultat nous a conduits a aborder la synthese de c-nucleosides derives des bases heterocycliques, en vue de conserver le squelette des enchainements phosphodiesters de l'adn.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ghederim, Alexandra. "Une extension des modèles sémantiques par un ordre sur les attributs : application à la migration de schémas relationnels vers des schémas orientés objet." Lyon 1, 1996. http://www.theses.fr/1996LYO10303.

Повний текст джерела

Анотація:

La modelisation des systemes d'information et les applications de bases de donnees deviennent de plus en plus complexes. Dans ce contexte ou la quantite d'information augmente et se diversifie, ou les approches utilisateurs divergent et se multiplient et ou des nouvelles technologies s'imposent, le processus de conception de schemas de bases de donnees est de plus en plus difficile et laborieux. La demande des utilisateurs s'oriente de plus en plus vers des systemes capables de leur offrir une modelisation fidele a leur univers et des meilleures performances par rapport aux fonctions qu'ils doivent remplir. Pour une meilleure modelisation de schemas de bases de donnees orientes objet nous proposons dans cette these une extension du modele semantique graphe semantique normalise (pich90) qui est le graphe semantique normalise avec ordre (gsno). Ce modele ajoute un complement de specification formelle en privilegiant un sous-ensemble d'attributs et l'ordonnant. Il modelise mieux les relations entre les informations et permet de mieux repondre au contexte de l'utilisateur. Un autre aspect tres actuel dans le domaine des bases de donnees est la recuperation des anciennes bases relationnelles et leur migration vers les nouveaux systemes a objets. Ce processus passe inexorablement par une transformation conceptuelle entre ces deux modeles logiques, transformation qui a souvent besoin d'un complement d'information. Utilisant ce modele semantique etendu (gsno), comme modele conceptuel intermediaire, nous avons concu un outil automatique de conception de schemas statiques de bases de donnees orientees objet et de migration de schemas de bases de donnees relationnels vers des schemas de bases de donnees orientes objet

Стилі APA, Harvard, Vancouver, ISO та ін.

Collet, Philippe. "Un modele fonde sur les assertions pour le genie logiciel et les bases de donnees : application au langage oqual, une extension d'eiffel." Nice, 1997. http://www.theses.fr/1997NICE5130.

Повний текст джерела

Анотація:

La reutilisation de composants par une approche objet necessite un haut niveau de qualite de documentation et de fiabilite, qu'il est difficile d'obtenir dans un contexte d'evolution incessante. L'approche assertionnelle constitue un bon compromis entre les preuves et les developpements sans rigueur. Notre introduction des quantifications, sur des collections d'instances et des extensions de types, augmente de maniere significative l'expressivite actuelle des assertions du langage eiffel. Comme leur evolution necessite une technique d'exploration voisine de celle requise pour les bases de donnees, nous proposons un modele et un support d'execution communs a ces deux domaines. Pour determiner les moments et les techniques d'evaluation les plus appropries pour les quantifications, nous proposons une classification des assertions qui exprime les intentions semantiques de chaque assertion. Nous definissons alors oqual comme une extension d'eiffel pour exprimer des formules logiques avec quantification, qui servent aux assertions et aux criteres de requetes de bases de donnees. Des raccourcis de saisie, combines a une presentation proche du langage mathematique, permettent d'ecrire facilement des assertions, expressives et lisibles, ainsi que des requetes selectives avec emboitement. Nous etudions les aspects methodologiques de notre langage a travers des exemples concrets, de specification par assertions et de prototypage a l'aide de requetes. La realisation d'un traducteur d'oqual en eiffel montre la faisabilite de l'approche, en utilisant une technique de reification par necessite. De maniere plus exploratoire, nous proposons un systeme d'armement semi-automatique des assertions, base sur une perception de l'evolution de la construction d'un systeme, pour faciliter l'utilisation et ameliorer les performances. Les resultats que nous obtenons offrent de multiples perspectives et participent au rapprochement des domaines du genie logiciel et des bases de donnees.

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "Extension bases"

Bindlish, Vishva. Evaluation of T & V-based extension in Burkina Faso. Washington, D.C: World Bank, 1993.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

J, Sahrmann Glenn, and United States. National Aeronautics and Space Administration. Scientific and Technical Information Division, eds. Hierarchic plate and shell models based on p-extension. [Washington, D.C.?]: National Aeronautics and Space Administration, Scientific and Technical Information Division, 1988.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Szabo, B. A. Hierarchic plate and shell models based on p-extension. Hampton, Va: Langley Research Center, 1988.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Szabo, B. A. Hierarchic plate and shell models based on p-extension. St. Louis, MO: Center for Computational Mechanics, Washington University, 1987.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Shih, Hsu-Shih, and David L. Olson. TOPSIS and its Extensions: A Distance-Based MCDM Approach. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-09577-1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dr, Place Frank, ed. The impact of agroforestry-based soil fertility replenishment practices on the poor in western Kenya. Washington, D.C: International Food Policy Research Institute, 2005.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Moyo, Sam. A review of the class and gender basis of agricultural extension services in Zimbabwe's communal areas. Harare: Zimbabwe Institute of Development Studies, 1992.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Huidobro, Rodrigo Ávila. Universidad, territorio y transformación social: Reflexiones en torno a procesos de aprendizaje en movimiento. Avellaneda, Provincia de Buenos Aires, Argentina: UNDAV Ediciones, Universidad Nacional de Avellaneda, 2014.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Melin, Patricia, and Gabriela E. Martinez. Extension of the Fuzzy Sugeno Integral Based on Generalized Type-2 Fuzzy Logic. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-16416-4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

K, Clarke Marianne, and Dobson Eric, eds. Technology-based economic development: A study of state and federal technical extension services. Washington: U.S. G.P.O., 1990.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Extension bases"

Horáček, Jan, and Martin Kreuzer. "3BA: A Border Bases Solver with a SAT Extension." In Mathematical Software – ICMS 2018, 209–17. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96418-8_25.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Bühmann, Lorenz, Ricardo Usbeck, Axel-Cyrille Ngonga Ngomo, Muhammad Saleem, Andreas Both, Valter Crescenzi, Paolo Merialdo, and Disheng Qiu. "Web-Scale Extension of RDF Knowledge Bases from Templated Websites." In The Semantic Web – ISWC 2014, 66–81. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11964-9_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Burden-Gulley, Susan M., Maryanne Pendergast, Vance Lemmon, and P. Sonderegger. "The role of cell adhesion molecule L1 in axonal extension, growth cone motility, and signal transduction." In Molecular Bases of Axonal Growth and Pathfinding, 415–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-60905-3_29.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Schemmel, Klaus-Peter. "An extension of buchberger's algorithm to compute all reduced gröbner bases of a polynomial ideal." In Lecture Notes in Computer Science, 300–310. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-51517-8_130.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Seretan, Violeta. "Extensions." In Syntax-Based Collocation Extraction, 103–22. Dordrecht: Springer Netherlands, 2010. http://dx.doi.org/10.1007/978-94-007-0134-2_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Johnson, Dana T. "Unit Extensions." In Beyond Base Ten, 103–4. New York: Routledge, 2021. http://dx.doi.org/10.4324/9781003233282-18.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Becker, Thomas, and Volker Weispfenning. "Field Extensions and the Hilbert Nullstellensatz." In Gröbner Bases, 293–333. New York, NY: Springer New York, 1993. http://dx.doi.org/10.1007/978-1-4612-0913-3_8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Gaál, István. "Cubic Relative Extensions." In Diophantine Equations and Power Integral Bases, 207–27. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-23865-0_13.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Gaál, István. "Quartic Relative Extensions." In Diophantine Equations and Power Integral Bases, 229–64. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-23865-0_14.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

de Cooman, Gert, Enrique Miranda, and Marco Zaffalon. "Independent Natural Extension." In Computational Intelligence for Knowledge-Based Systems Design, 737–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14049-5_75.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Extension bases"

Wieching, Gundolf, Kobus Clote, Hans-Rainer Klöckner, Fernando Camilo, Filippo Maria Zerbi, Pontsho Maruping, and Michael Kramer. "Updates on MeerKAT+, the MeerKAT radio telescope extension project." In Ground-based and Airborne Telescopes X, edited by Heather K. Marshall, Jason Spyromilio, and Tomonori Usuda, 39. SPIE, 2024. http://dx.doi.org/10.1117/12.3018630.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Zheng, Su, Gang Xiao, Ge Yan, Meng Dong, Yao Li, Hong Chen, Yuzhe Ma, Bei Yu, and Martin Wong. "Model-based OPC Extension in OpenILT." In 2024 2nd International Symposium of Electronics Design Automation (ISEDA), 568–73. IEEE, 2024. http://dx.doi.org/10.1109/iseda62518.2024.10617951.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Dorodnykh, N. O., and A. Y. Yurin. "An RVML extension for modeling fuzzy rule bases." In 1st International Workshop on Advanced Information and Computation Technologies and Systems 2020. Crossref, 2021. http://dx.doi.org/10.47350/aicts.2020.04.

Повний текст джерела

Анотація:

Rules are still the most widespread way to represent expert knowledge despite the popularity of semantic technologies. The effective use of rules in decision-making in the case of inaccurate or uncertain information requires the development of specialized means and software for visual and generative programming. This paper considers an extension of the Rule Visual Modeling Language called FuzzyRVML designed for modeling fuzzy rule bases. FuzzyRVML supports a fuzzy datatype, concepts of a linguistic variable, terms, and certainty factors. The descriptions of FuzzyRVML basic elements, main constructions, and an illustrative example containing FuzzyCLIPS source code generation are presented. The evaluation and implementation of this notation are made based on the Personal Knowledge Base Designer software.

Стилі APA, Harvard, Vancouver, ISO та ін.

Wheeler, Timothy J., and Andrew K. Packard. "An extension of sigma-point Kalman filtering using nonlinear estimator bases." In 2009 American Control Conference. IEEE, 2009. http://dx.doi.org/10.1109/acc.2009.5160723.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Daelemans, Walter M. P. "A tool for the automatic creation, extension and updating of lexical knowledge bases." In the third conference. Morristown, NJ, USA: Association for Computational Linguistics, 1987. http://dx.doi.org/10.3115/976858.976870.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Corea, Carl, Matthias Thimm, and Patrick Delfmann. "Measuring Inconsistency over Sequences of Business Rule Cases." In 18th International Conference on Principles of Knowledge Representation and Reasoning {KR-2021}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/kr.2021/64.

Повний текст джерела

Анотація:

We investigate inconsistency and culpability measures for multisets of business rule bases. As companies might encounter thousands of rule bases daily, studying not only individual rule bases separately, but rather also their interrelations, becomes necessary. As current works on inconsistency measurement focus on assessing individual rule bases, we therefore present an extension of those works in the domain of business rules management. We show how arbitrary culpability measures (for single rule bases) can be automatically transformed for multisets, propose new rationality postulates for this setting, and investigate the complexity of central aspects regarding multi-rule base inconsistency measurement.

Стилі APA, Harvard, Vancouver, ISO та ін.

Massi, Fernanda de Oliveira, Aguinaldo dos Santos, and Natalia Ferraz Reis. "Smart clothing and e-waste: Design heuristics oriented to life cycle extension." In SDS 2023 - IX SIMPÓSIO DE DESIGN SUSTENTÁVEL. Grupo de Pesquisa Virtuhab/UFSC, 2023. http://dx.doi.org/10.29183/978-65-00-87779-3.sds2023.p613-624.

Повний текст джерела

Анотація:

With the advancement of emerging technologies in fashion and the development of smart clothing, the perspective of a new waste in the sector arises, the e-waste, or electronic waste. Therefore, it becomes relevant to investigate ways to mitigate the environmental impacts of WEEE from smart clothing still in the conceptual stage of the design of these products. In this way, this research aims to identify in the literature the main concepts, emphases and challenges of sustainability in smart clothing, as well as to relate the specificities of this type of product with existing heuristics focused on the extension of the life cycle. For this, the Systematic and Unsystematic Bibliographic Review method was used. As a result, three tables were obtained with heuristics focused on reuse, repair and recycling and the implications of each one of them in smart clothing. It is expected that these results provide bases for further research on WEEE from smart clothing, as well as verification and validation of the investigated heuristics.

Стилі APA, Harvard, Vancouver, ISO та ін.

Dorodnykh, N. O., Y. V. Kotlov, O. A. Nikolaychuk, V. M. Popov, and A. Y. Yurin. "End-user development of knowledge bases for semi-automated formation of task cards." In 3rd International Workshop on Information, Computation, and Control Systems for Distributed Environments 2021. Crossref, 2021. http://dx.doi.org/10.47350/iccs-de.2021.05.

Повний текст джерела

Анотація:

The complexity of creating artificial intelligence applications remains high. One of the factors that cause such complexity is the high qualification requirements for developers in the field of programming. Development complexity can be reduced by using methods and tools based on a paradigm known as End-user development. One of the problems that requires the application of the methods of this paradigm is the development of intelligent systems for supporting the search and troubleshooting onboard aircraft. Some tasks connected with this problem are identified, including the task of dynamic formation of task cards for troubleshooting in terms of forming a list of operations. This paper presents a solution to this problem based on some principles of End-user development: model-driven development, visual programming, and wizard form-filling. In particular, an extension of the Prototyping expert systems based on transformations technology, which implements the End-user development, is proposed in the context of the problem to be solved for Sukhoi Superjet aircraft. The main contribution of the work is as follows: expanded the main technology method by supporting event trees formalism (as a popular expert method for formalizing scenarios for the development of problem situations and their localization); created a domain-specific tool (namely, Extended event tree editor) for building standard and extended event trees, including for diagnostic tasks; developed a module for supporting transformations of XML-like event tree representation format for the knowledge base prototyping system – Personal knowledge base designer. A description of the proposed extension and the means of its implementation, as well as an illustrative example, are provided.

Стилі APA, Harvard, Vancouver, ISO та ін.

Unwin, Stephen D., Peter P. Lowry, and Michael Y. Toyooka. "Component Degradation Susceptibilities as the Bases for Modeling Reactor Aging Risk." In ASME 2010 Pressure Vessels and Piping Division/K-PVP Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/pvp2010-25750.

Повний текст джерела

Анотація:

The extension of nuclear power plant operating licenses beyond 60 years in the United States will be necessary if we are to meet national energy needs while addressing the issues of carbon and climate. Characterizing the operating risks associated with aging reactors is problematic because the principal tool for risk-informed decision-making, Probabilistic Risk Assessment (PRA), is not ideally-suited to addressing aging systems. The components most likely to drive risk in an aging reactor — the passives — receive limited treatment in PRA, and furthermore, standard PRA methods are based on the assumption of stationary failure rates: a condition unlikely to be met in an aging system. A critical barrier to modeling passives aging on the wide scale required for a PRA is that there is seldom sufficient field data to populate parametric failure models, and nor is there always the availability of practical physics models to predict out-year component reliability. The methodology described here circumvents some of these data and modeling needs by using materials degradation metrics, integrated with conventional PRA models, to produce risk importance measures for specific aging mechanisms and component types. We suggest that these measures have multiple applications, from the risk-screening of components to the prioritization of materials research.

Стилі APA, Harvard, Vancouver, ISO та ін.

Hauke, Krzysztof, Mievzyslaw L. Owoc, and Maciej Pondel. "Building Data Mining Models in the Oracle 9i Environment." In 2003 Informing Science + IT Education Conference. Informing Science Institute, 2003. http://dx.doi.org/10.28945/2697.

Повний текст джерела

Анотація:

Data Mining (DM) is a very crucial issue in knowledge discovery processes. The basic facilities to create data mining models were implemented successfully on Oracle 9i as the extension of the database server. DM tools enable developers to create Business Intelligence (BI) applications. As a result Data Mining models can be used as support of knowledge-based management. The main goal of the paper is to present new features of the Oracle platform in building and testing DM models. Authors characterize methods of building and testing Data Mining models available on the Oracle 9i platform, stressing the critical steps of the whole process and presenting examples of practical usage of DM models. Verification techniques of the generated knowledge bases are discussed in the mentioned environment.

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Extension bases"

Lee, Huey-Lin, Thomas Hertel, Brent Sohngen, and Navin Ramankutty. Towards An Integrated Land Use Database for Assessing the Potential for Greenhouse Gas Mitigation. GTAP Technical Paper, December 2005. http://dx.doi.org/10.21642/gtap.tp25.

Повний текст джерела

Анотація:

This paper describes the GTAP Land Use Data Base designed to support integrated assessments of the potential for greenhouse gas mitigation. It disaggregates land use by agro-ecological zone (AEZ). To do so, it draws upon global land cover data bases, as well as state-of-the-art definition of AEZs from the FAO and IIASA. Agro-ecological zoning segments a parcel of land into smaller units according to agro-ecological characteristics, including: precipitation, temperature, soil type, terrain conditions, etc. Each zone has a similar combination of constraints and potential for land use. In the GTAP-AEZ Data Base, there are 18 AEZs, covering six different lengths of growing period spread over three different climatic zones. Land using activities include crop production, livestock raising, and forestry. In so doing, this extension of the standard GTAP Data Base permits a much more refined characterization of the potential for shifting land use amongst these different activities. When combined with information on greenhouse gas emissions, this data base permits economists interested in integrated assessment of climate change to better assess the role of land use change in greenhouse gases mitigation strategies.

Стилі APA, Harvard, Vancouver, ISO та ін.

Lutz, Carsten, and Dirk Walther. PDL with Negation of Atomic Programs. Technische Universität Dresden, 2003. http://dx.doi.org/10.25368/2022.129.

Повний текст джерела

Анотація:

Propositional dynamic logic (PDL) is one of the most succesful variants of modal logic. To make it even more useful for applications, many extensions of PDL have been considered in the literature. A very natural and useful such extension is with negation of programs. Unfortunately, it is long-known that reasoning with the resulting logic is undecidable. In this paper, we consider the extension of PDL with negation of atomic programs, only. We argue that this logic is still useful, e.g. in the context of description logics, and prove that satisfiability is decidable and EXPTIME-complete using an approach based on Büchi tree automata.

Стилі APA, Harvard, Vancouver, ISO та ін.

Baader, Franz, and Rafael Peñaloza. Blocking and Pinpointing in Forest Tableaux. Technische Universität Dresden, 2008. http://dx.doi.org/10.25368/2022.165.

Повний текст джерела

Анотація:

Axiom pinpointing has been introduced in description logics (DLs) to help the used understand the reasons why consequences hold by computing minimal subsets of the knowledge base that have the consequence in consideration. Several pinpointing algorithms have been described as extensions of the standard tableau-based reasoning algorithms for deciding consequences from DL knowledge bases. Although these extensions are based on similar ideas, they are all introduced for a particular tableau-based algorithm for a particular DL, using specific traits of them. In the past, we have developed a general approach for extending tableau-based algorithms into pinpointing algorithms. In this paper we explore some issues of termination of general tableaux and their pinpointing extensions. We also define a subclass of tableaux that allows the use of so-called blocking conditions, which stop the execution of the algorithm once a pattern is found, and adapt the pinpointing extensions accordingly, guaranteeing its correctness and termination.

Стилі APA, Harvard, Vancouver, ISO та ін.

Baader, Franz, and Rafael Peñaloza. Axiom Pinpointing in General Tableaux. Aachen University of Technology, 2007. http://dx.doi.org/10.25368/2022.159.

Повний текст джерела

Анотація:

Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing minimal (maximal) subsets of the knowledge base that have (do not have) the consequence in question. The pinpointing algorithms described in the DL literature are obtained as extensions of the standard tableau-based reasoning algorithms for computing consequences from DL knowledge bases. Although these extensions are based on similar ideas, they are all introduced for a particular tableau-based algorithm for a particular DL. The purpose of this paper is to develop a general approach for extending a tableau-based algorithm to a pinpointing algorithm. This approach is based on a general definition of „tableaux algorithms,' which captures many of the known tableau-based algorithms employed in DLs, but also other kinds of reasoning procedures.

Стилі APA, Harvard, Vancouver, ISO та ін.

Baader, Franz, and Rafael Peñaloza. Pinpointing in Terminating Forest Tableaux. Technische Universität Dresden, 2008. http://dx.doi.org/10.25368/2022.166.

Повний текст джерела

Анотація:

Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing minimal (maximal) subsets of the knowledge base that have (do not have) the consequence in question. The pinpointing algorithms described in the DL literature are obtained as extensions of the standard tableau-based reasoning algorithms for computing consequences from DL knowledge bases. Although these extensions are based on similar ideas, they are all introduced for a particular tableau-based algorithm for a particular DL. The purpose of this paper is to develop a general approach for extending a tableau-based algorithm to a pinpointing algorithm. This approach is based on a general definition of „tableau algorithms,' which captures many of the known tableau-based algorithms employed in DLs, but also other kinds of reasoning procedures.

Стилі APA, Harvard, Vancouver, ISO та ін.

Karp, D. Display-Based Address Sorting for the IMAP4 SORT Extension. RFC Editor, July 2010. http://dx.doi.org/10.17487/rfc5957.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Jonglez, B., and J. Chroboczek. Delay-Based Metric Extension for the Babel Routing Protocol. RFC Editor, September 2024. http://dx.doi.org/10.17487/rfc9616.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Cheng, B., and D. Wiggins. Dynamic Link Exchange Protocol (DLEP) Control-Plane-Based Pause Extension. Edited by L. Berger. RFC Editor, October 2019. http://dx.doi.org/10.17487/rfc8651.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Xu, X., C. Jacquenet, R. Raszuk, T. Boyes, and B. Fee. Virtual Subnet: A BGP/MPLS IP VPN-Based Subnet Extension Solution. RFC Editor, March 2016. http://dx.doi.org/10.17487/rfc7814.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Swallow, G., M. Chen, G. Fioccola, and G. Mirsky. Extension of RFC 6374-Based Performance Measurement Using Synonymous Flow Labels. Edited by S. Bryant. RFC Editor, May 2024. http://dx.doi.org/10.17487/rfc9571.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!