34 results on '"discrete structure"'
Search Results
2. ФОРМУВАННЯ ДИСКРЕТНОЇ СТРУКТУРИ АЗОТОВАНИХ ПОКРИТТІВ РІВНОЇ ЗНОСОСТІЙКОСТІ
- Subjects
втомна міцність ,fatigue strength ,азотування ,лазер ,зносостійкість ,discrete structure ,wear resistance ,nitriding ,дискретна структура ,laser - Abstract
It was considered the peculiarities of prior laser treatment influence on the structure and properties of nitrided layers on steel surface. The general regularities of influence of laser beam parameters and the pattern of treatment on contact fatigue and tribological properties of the coatings. Strengthening of metal products according to the grid-cell scheme of discrete processing increases the contact fatigue strength and wear resistance of the coating due to the minimization of the stress-deformed state. Розглянуто особливості впливу схеми попередньої лазерної обробки на будову і властивості азотованих шарів на сталях. Установлено основні закономірності впливу контурно – променевих схем лазерного зміцнення на контакту втомну міцність і трибологічні характеристики покриттів. Визначено, що зміцнення металевих виробів за сітчасто – стільниковою схемою дискретної обробки підвищує контактну втомну міцність та зносостійкість покриття за рахунок мінімізації напружено деформованого стану.
- Published
- 2022
3. Dominant point detection based on discrete curve structure and applications.
- Author
-
Nasser, Hayat, Ngo, Phuc, and Debled-Rennesson, Isabelle
- Subjects
- *
ALGORITHMS , *POLYGONS , *HEURISTIC algorithms , *CURVATURE , *GEOMETRIC surfaces - Abstract
In this paper, we investigate the problem of dominant point detection on digital curves which consists in finding points with local maximum curvature. Thanks to previous studies of the decomposition of curves into sequence of discrete structures [1–3] , namely maximal blurred segments of width ν [4] , an initial algorithm has been proposed in [5] to detect dominant points. However, an heuristic strategy is used to identify the dominant points. We now propose a modified algorithm without heuristics but a simple measure of angle. In addition, two applications are as well presented: (1) polygonal simplification to reduce the number of detected dominant points by associating a weight to each of them, and (2) classification using the polygon issued from the reduced dominant points. The experimental results demonstrate the efficiency and robustness of the proposed method. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
4. Dynamic fracture of a discrete media under moving load.
- Author
-
Gorbushin, Nikolai and Mishuris, Gennady
- Subjects
- *
CRACK propagation (Fracture mechanics) , *MECHANICAL loads , *DISPLACEMENT (Mechanics) , *FLUX (Energy) , *ANISOTROPY - Abstract
Most of the research concerning crack propagation in discrete media is carried out for specific types of external loading: displacements on the boundaries, or constant energy fluxes or feeding waves originating from infinity. In this paper the action of a moving load is analysed on the simplest lattice model: a thin strip, where the fault propagates in the middle portion as the result of the moving force acting on the destroyed part of the structure. We study both analytically and numerically how the load amplitude and its velocity influence the possible solutions, and specifically the way the fracture process reaches its steady-state regimes. We present the relation between the possible steady-state crack speeds and the loading parameters, as well as the energy release rate. In particular, we show that there exists a class of loading regimes corresponding to each point on the energy-speed diagram (and thus determine the same limiting steady-state regime). The phenomenon of the ”forbidden regimes” is discussed in detail, from both the points of view of force and energy. For a sufficiently anisotropic structure, we find a stable steady-state propagation corresponding to the ”slow” crack. Numerical simulations reveal various ways by which the process approaches - or fails to approach - the steady-state regime. The results extend our understanding of fracture processes in discrete structures, and reveal some new questions that should be addressed. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
5. NEW MX2 AND M'Cl3 (M = Cu, Zn; M'= Y, Dy, Pr; X = Cl, Br) MALEATO COMPLEXES AND TETRAPHENYLANTIMONY FORMIATE ADDUCT: SYNTHESIS AND INFRARED STUDY.
- Author
-
SEYE, DAME, DIOP, CHEIKH ABDOUL KHADIR, TOURE, ASSANE, and DIOP, LIBASSE
- Subjects
YTTRIUM compounds ,SUPRAMOLECULAR chemistry ,LIGAND binding (Biochemistry) ,CHELATING agents ,INFRARED spectroscopy - Abstract
Eleven complexes and adduct have been synthesized and studied by infrared. The suggested structures are discrete with tetrahedral, trigonal bipyramidal, square planar or octahedral environments around Zn, Ni, Hg and Cu centres - the coordination number is eight in the yttrium compound and ten in the dysprosium one-. The maleate anion behaves as a bidentate, a monochelating, a bichelating or a tetradentate ligand while the formiate anion behaves as a monodentate ligand. For compounds containing a protonated amine or a methanol molecule, when hydrogen bonds are considered a supramolecular architecture may be obtained. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
6. AMINO PHENYLARSENIATO ADDUCTS OF SnPh3Cl (R = Bu, Ph) : SYNTHESIS AND INFRARED STUDY
- Author
-
BOCAR TRAORÉ, LIBASSE DIOP, and MAMADOU SIDIBÉ
- Subjects
coordinating phenylarseniat ,discrete structure ,hydrogen bonds ,supramolecular architectures ,tin centre ,Chemical technology ,TP1-1185 - Abstract
Six new phenylarseniato adducts and derivatives containing SnR3 (R = Bu, Ph) residue have been synthesized and studied by infrared spectroscopy. The suggested structures are discrete, the anion behaving as a bi- or tri- dentate ligand. When the cation is involved through hydrogen bonds, supramolecular architectures are obtained.
- Published
- 2013
7. NEW PERCHLORATO ADDUCTS: SYNTHESIS AND INFRARED STUDY
- Author
-
OMAR GUEYE and LIBASSE DIOP
- Subjects
discrete structure ,monodentate or bidentate perchlorate anion ,Chemical technology ,TP1-1185 - Abstract
Five perchlorato adducts have been synthesized and studied by infrared. The structures are discrete, the perchlorate anion behaving a monodentate or a bidentate ligand.
- Published
- 2013
8. SYNTHESIS AND INFRARED STUDY OF SOME NEW SnC2O4Cl2 ADDUCTS AND COMPLEXES
- Author
-
HASSAN ALLOUCH and LIBASSE DIOP
- Subjects
infrared ,discrete structure ,SnC2O4Cl2 adducts ,supramolecular architecture ,tetrahedral or octahedral environment ,Chemical technology ,TP1-1185 - Abstract
Eight new SnC2O4Cl2 adducts and derivatives have been synthesized and studied by infrared. Ionic discrete structures have been suggested on the basis of infrared data, the environment around the tin (IV) centre being tetrahedral or octahedral.
- Published
- 2013
9. NEW R2NH2OH (R = Cy, Bu) ADDUCTS OF MX2, MX3 OR MX5: SYNTHESIS AND INFRARED STUDY
- Author
-
NDONGO GUEYE, LIBASSE DIOP, and LAMINE DIOP
- Subjects
discrete structure ,octahedral environment ,Sb adducts ,Chemical technology ,TP1-1185 - Abstract
When Cy2NH and Bu2NH in the presence of a very little amount of water are allowed to react with metal halide CdBr2, SbCl3 or SbCl5, hydroxyl adducts with protonated amines as adverse cations were obtained. Their infrared study allows concluding the presence of OH- linked to the metallic center.
- Published
- 2013
10. NEW COMPLEX SELENITO AND OXALATO ADDUCTS CONTAINING SnPh3 AND SnPh2 RESIDUES: SYNTHESIS AND SPECTROSCOPIC STUDIES
- Author
-
SEYDI MANSOUR SECK, WALY DIALLO, LIBASSE DIOP, and LORENZO STIEVANO
- Subjects
bi-unidentate selenito oxyanion ,discrete structure ,IR and Mössbauer techniques ,inserted C2O4(SnPh3)2 ,selenito organotin complexes ,trans bipyramidal residue ,Chemical technology ,TP1-1185 - Abstract
Three new organotin complexes (two selenito and an oxalate one) adducts have been synthesized and studied by infrared and Mössbauer techniques. A discrete structure is suggested with a bi-unidentate selenito oxyanion and trans bipyramidal SnPh3 residue; the oxalato adduct can be seen as an insertion compound between C2O4(SnPh3)2 and [Cu(En)3]C2O4•4SnPh2C2O4. This last compound has a discrete ionic structure with cis coordinated SnPh2 residues.
- Published
- 2012
11. SYNTHESIS AND INFRARED STUDY OF SOME HYDROGENOMOLYBDATO AND MOLYBDATO ADDUCTS OF SbF3, HgPh2 AND MX2 (M = Cd, Hg; X = Cl, Br)
- Author
-
Mounirou Ciss, Djibril Fall, Libasse Diop, Ibrahima Cissé, and Serigne Fallou Pouye
- Subjects
coordinating molybdate ,discrete structure ,IR spectra ,Chemical technology ,TP1-1185 - Abstract
Seven molybdato and hydrogenomolybdato new adducts with HgPh2, HgCl2, HgBr2, CdCl2, CdBr2 and SbF3 have been synthesized and characterized by infrared spectroscopy. The suggested structures are discrete, the oxyanions behaving as polychelating ligands. When non symmetrical cations are involved, supramolecular architectures are obtained.
- Published
- 2012
12. Ph3CCOOSnPh3.Ph3PO AND Ph3CCOOSnPh3.Ph3AsO: SYNTHESIS AND INFRARED STUDY
- Author
-
ABDOU MBAYE, ALEXIS BIENVENU BELEKE, CHEIKH ABDOUL KHADIR DIOP, and LIBASSE DIOP
- Subjects
discrete structure ,infrared spectroscopy ,mondentate ligand ,trigonal bipyramidal environment ,Chemical technology ,TP1-1185 - Abstract
The mixture of ethanolic solutions of Ph3CCOOSnPh3 and Ph3PO or Ph3AsO gives Ph3CCOOSnPh3.Ph3PO and Ph3CCOOSnPh3.Ph3AsO adducts which have been characterized by infrared spectroscopy. A discrete structure is suggested for both, the environment around the tin centre being trigonal bipyramidal, the triphenylacetate anion behaving as a mondentate ligand.
- Published
- 2014
13. (Me4N)2O2CSO3Sn(O2CSO3)2.7Me4NSnCl5: SYNTHESIS AND INFRARED STUDY
- Author
-
Daouda Ndoye and Libasse Diop
- Subjects
coordinating O2CSO3H- ,discrete structure ,pentagonal environment ,supramolecular architecture ,Chemical technology ,TP1-1185 - Abstract
On allowing Me4NO2CSO3H (in water) to react with SnCl4 (in ethanol) the studied complex is obtained. The suggested structure is discrete, the anion behaving as a polydentate and chelating ligand, the environment around tin being octahedral.
- Published
- 2014
14. Artistic features of discrete structure in german novel
- Author
-
Valeeva, Alfiia Revanerovna, Gilfanova, Gulnara Tavkilevna, Nikulina, Elena Alexandrovna, Valeeva, Alfiia Revanerovna, Gilfanova, Gulnara Tavkilevna, and Nikulina, Elena Alexandrovna
- Abstract
The article deals with the key stages of the formation and development of German fragmentary prose in the 19th–20th centuries. Using the materials from German novels of the 20th century, the authors analyze the artistic devices that motivate the discreteness of the narrative and determine their artistic function – the manifestation and structuring of aesthetic information. Based on the analysis of artistic devices, the aesthetic content of the discrete novel structure is identified which depends on the writers' worldview. The discrete structure has proven to be a universal art form that has shaped the typological features of the modern novel., O artigo trata das principais etapas da formação e desenvolvimento da prosa fragmentária alemã nos séculos 19-20. Usando os materiais dos romances alemães do século XX, os autores analisam os dispositivos artísticos que motivam a discrição da narrativa e determinam sua função artística - a manifestação e estruturação da informação estética. Com base na análise dos dispositivos artísticos, é identificado o conteúdo estético da discreta estrutura da novela, que depende da visão de mundo dos escritores. A estrutura discreta provou ser uma forma de arte universal que moldou as características tipológicas do romance moderno., El artículo aborda las principales etapas de la formación y el desarrollo de la prosa fragmentaria alemana en los siglos XIX y XX. Utilizando los materiales de obras novelescas alemanas del siglo XX, los autores analizan los dispositivos artísticos que motivan la discreción de la narración y determinan su función artística: la manifestación y estructuración de la información estética. A partir del análisis de los dispositivos artísticos, se identifica el contenido estético de la estructura discreta de la novela, que depende de la visión del mundo de los escritores. La estructura discreta resultó ser una forma de arte universal que configuró los rasgos tipológicos de la novela moderna.
- Published
- 2021
15. Dominant point detection based on discrete curve structure and applications
- Author
-
Hayat Nasser, Phuc Ngo, Isabelle Debled-Rennesson, Applying Discrete Algorithms to Genomics and Imagery (ADAGIO), Department of Algorithms, Computation, Image and Geometry (LORIA - ALGO), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)
- Subjects
Maximum curvature ,polygonal simplication ,Discrete curve ,Computer Networks and Communications ,Applied Mathematics ,[SCCO.COMP]Cognitive science/Computer science ,maximal blurred segments ,classication ,020207 software engineering ,02 engineering and technology ,discrete structure ,Theoretical Computer Science ,Combinatorics ,Computational Theory and Mathematics ,Robustness (computer science) ,Polygonal chain ,Dominant point detection ,Polygon ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Heuristics ,Algorithm ,Dominant point ,Mathematics - Abstract
In this paper, we investigate the problem of dominant point detection on digital curves which consists in finding points with local maximum curvature. Thanks to previous studies of the decomposition of curves into sequence of discrete structures [1] , [2] , [3] , namely maximal blurred segments of width ν [4] , an initial algorithm has been proposed in [5] to detect dominant points. However, an heuristic strategy is used to identify the dominant points. We now propose a modified algorithm without heuristics but a simple measure of angle. In addition, two applications are as well presented: (1) polygonal simplification to reduce the number of detected dominant points by associating a weight to each of them, and (2) classification using the polygon issued from the reduced dominant points. The experimental results demonstrate the efficiency and robustness of the proposed method.
- Published
- 2018
16. NEW MX2 AND M’Cl3 (M = Cu, Zn; M’= Y, Dy, Pr; X = Cl, Br) MALEATO COMPLEXES AND TETRAPHENYLANTIMONY FORMIATE ADDUCT: SYNTHESIS AND INFRARED STUDY
- Author
-
Bcheikh Abdoul Khadir Diop, Dame Seye, Assane Toure, and Libasse Diop
- Subjects
Technology ,bidentate, bichelating, discrete structure, supramolecular architecture ,lcsh:T ,Infrared ,Chemistry ,discrete structure ,Engineering (General). Civil engineering (General) ,lcsh:Technology ,Adduct ,bichelating ,lcsh:TA1-2040 ,bidentate ,TA1-2040 ,lcsh:Engineering (General). Civil engineering (General) ,supramolecular architecture ,Nuclear chemistry - Abstract
Eleven complexes and adduct have been synthesized and studied by infrared. The suggested structures are discrete with tetrahedral, trigonal bipyramidal, square planar or octahedral environments around Zn, Ni, Hg and Cu centres – the coordination number is eight in the yttrium compound and ten in the dysprosium one-. The maleate anion behaves as a bidentate, a monochelating, a bichelating or a tetradentate ligand while the formiate anion behaves as a monodentate ligand. For compounds containing a protonated amine or a methanol molecule, when hydrogen bonds are considered a supramolecular architecture may be obtained.
- Published
- 2018
17. Mechanically Durable Memristor Arrays Based on a Discrete Structure Design
- Author
-
Xun Cao, Yaqing Liu, Xiaodong Chen, Changxian Wang, Ming Wang, Zequn Cui, Alfred Iing Yoong Tok, Changjin Wan, Zhuangjian Liu, Wan Ru Leow, Dingjie Lu, Yizhong Huang, Liang Pan, Ting Wang, School of Materials Science and Engineering, Institute of High Performance Computing, A*STAR, Institute of Materials Research and Engineering, A*STAR, Innovative Centre for Flexible Devices, and Max Planck-NTU Joint Lab for Artificial Senses
- Subjects
Materials science ,Materials [Engineering] ,business.industry ,Information storage ,Mechanical Engineering ,Discrete Structure ,Stretchable electronics ,Soft robotics ,Memristor ,Mechanical Damage Endurance ,law.invention ,Mechanics of Materials ,law ,Electronic engineering ,Structure design ,General Materials Science ,business ,Wearable technology - Abstract
Memristors constitute a promising functional component for information storage and in-memory computing in flexible and stretchable electronics including wearable devices, prosthetics, and soft robotics. Despite tremendous efforts made to adapt conventional rigid memristors to flexible and stretchable scenarios, stretchable and mechanical-damage-endurable memristors, which are critical for maintaining reliable functions under unexpected mechanical attack, have never been achieved. Here, the development of stretchable memristors with mechanical damage endurance based on a discrete structure design is reported. The memristors possess large stretchability (40%) and excellent deformability (half-fold), and retain stable performances under dynamic stretching and releasing. It is shown that the memristors maintain reliable functions and preserve information after extreme mechanical damage, including puncture (up to 100 times) and serious tearing situations (fully diagonally cut). The structural strategy offers new opportunities for next-generation stretchable memristors with mechanical damage endurance, which is vital to achieve reliable functions for flexible and stretchable electronics even in extreme and highly dynamic environments. Submitted/Accepted version T.W. and Z.C. contributed equally to this work. The project was supported by the National Research Foundation (NRF), Prime Minister’s office, Singapore, under its NRF Investigatorship (NRF-NRFI2017-07), Singapore Ministry of Education (MOE2017-T2-2-107 and MOE2019-T2-2-022), and the Agency for Science, Technology and Research (A*STAR) under its Advanced Manufacturing and Engineering (AME) Programmatic Funding Scheme (project #A18A1b0045).
- Published
- 2021
18. Artistic features of discrete structure in german novel
- Author
-
Gulnara Tavkilevna Gilfanova, Alfiia Revanerovna Valeeva, and Elena Nikulina
- Subjects
Language. Linguistic theory. Comparative grammar ,P101-410 ,Embryology ,LC8-6691 ,media_common.quotation_subject ,P1-1091 ,Cell Biology ,Art ,Fragmentary prose ,Special aspects of education ,language.human_language ,German ,Discrete structure ,language ,Montage principle ,Issue of time and memory ,Anatomy ,Philology. Linguistics ,Humanities ,Multiperspectivity ,Developmental Biology ,media_common - Abstract
espanolEl articulo aborda las principales etapas de la formacion y el desarrollo de la prosa fragmentaria alemana en los siglos XIX y XX. Utilizando los materiales de obras novelescas alemanas del siglo XX, los autores analizan los dispositivos artisticos que motivan la discrecion de la narracion y determinan su funcion artistica: la manifestacion y estructuracion de la informacion estetica. A partir del analisis de los dispositivos artisticos, se identifica el contenido estetico de la estructura discreta de la novela, que depende de la vision del mundo de los escritores. La estructura discreta resulto ser una forma de arte universal que configuro los rasgos tipologicos de la novela moderna. portuguesO artigo trata das principais etapas da formacao e desenvolvimento da prosa fragmentaria alema nos seculos 19-20. Usando os materiais dos romances alemaes do seculo XX, os autores analisam os dispositivos artisticos que motivam a discricao da narrativa e determinam sua funcao artistica - a manifestacao e estruturacao da informacao estetica. Com base na analise dos dispositivos artisticos, e identificado o conteudo estetico da discreta estrutura da novela, que depende da visao de mundo dos escritores. A estrutura discreta provou ser uma forma de arte universal que moldou as caracteristicas tipologicas do romance moderno. EnglishThe article deals with the key stages of the formation and development of German fragmentary prose in the 19th–20th centuries. Using the materials from German novels of the 20th century, the authors analyze the artistic devices that motivate the discreteness of the narrative and determine their artistic function – the manifestation and structuring of aesthetic information. Based on the analysis of artistic devices, the aesthetic content of the discrete novel structure is identified which depends on the writers' worldview. The discrete structure has proven to be a universal art form that has shaped the typological features of the modern novel.
- Published
- 2021
19. Power of Enumeration - Recent Topics on BDD/ZDD-Based Techniques for Discrete Structure Manipulation
- Author
-
Shin-ichi Minato
- Subjects
Theoretical computer science ,Computer science ,Structure (category theory) ,02 engineering and technology ,discrete structure ,Power (physics) ,Artificial Intelligence ,Hardware and Architecture ,ZDD ,020204 information systems ,graph algorithm ,0202 electrical engineering, electronic engineering, information engineering ,Enumeration ,020201 artificial intelligence & image processing ,Computer Vision and Pattern Recognition ,Graph algorithms ,Electrical and Electronic Engineering ,Algorithm ,BDD ,Software - Abstract
Discrete structure manipulation is a fundamental technique for many problems solved by computers. BDDs/ZDDs have attracted a great deal of attention for twenty years, because those data structures are useful to efficiently manipulate basic discrete structures such as logic functions and sets of combinations. Recently, one of the most interesting research topics related to BDDs/ZDDs is Frontier-based search method, a very efficient algorithm for enumerating and indexing the subsets of a graph to satisfy a given constraint. This work is important because many kinds of practical problems can be efficiently solved by some variations of this algorithm. In this article, we present recent research activity related to BDD and ZDD. We first briefly explain the basic techniques for BDD/ZDD manipulation, and then we present several examples of the state-of-the-art algorithms to show the power of enumeration.
- Published
- 2017
20. Application of the Method of Integral Equations to the Description of Brewster Reflection of Light From Discrete Structured Media.
- Author
-
Kadochkin, A.
- Abstract
A theoretical explanation is given to the experiments on Brewster reflection of light from the surface of certain liquids on the basis of the near field effects in a transitional layer. The consideration was carried out within the framework of the concept of a discrete continuous dielectric in which the fields of the dipoles of discretely distributed atoms inside the Lorentz sphere surrounding the observation point are taken into account. [ABSTRACT FROM AUTHOR]
- Published
- 2001
- Full Text
- View/download PDF
21. A discrete approach for polygonal approximation of irregular noise contours
- Author
-
Phuc Ngo, Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Applying Discrete Algorithms to Genomics and Imagery (ADAGIO), Department of Algorithms, Computation, Image and Geometry (LORIA - ALGO), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)
- Subjects
Computer science ,Process (computing) ,Structure (category theory) ,ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION ,[SCCO.COMP]Cognitive science/Computer science ,[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV] ,Image processing ,Context (language use) ,0102 computer and information sciences ,02 engineering and technology ,Polygonal representation ,[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM] ,01 natural sciences ,Digital image ,Noise ,010201 computation theory & mathematics ,Robustness (computer science) ,Discrete structure ,Computer Science::Computer Vision and Pattern Recognition ,[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV] ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Algorithm ,Data compression ,Dominant point - Abstract
International audience; Polygonal approximation is often involved in many applications of computer vision, image processing and data compression. In this context, we are interested in digital curves extracted from contours of objects contained in digital images. In particular, we propose a fully discrete structure, based on the notion of blurred segments, to study the geometrical features on such curves and apply it in a process of polygonal approximation. The experimental results demonstrate the robustness of the proposed method to local variation and noise on the curve.
- Published
- 2019
22. Influence of fracture criteria on dynamic fracture propagation in a discrete chain
- Author
-
Gennady Mishuris, G. A. Volkov, Nikolai Gorbushin, and Gennaro Vitucci
- Subjects
Dynamic fractures ,Work (thermodynamics) ,Cracks ,Dynamic fracture ,Computational Mechanics ,FOS: Physical sciences ,02 engineering and technology ,Time dependent fracture ,Discrete chain ,Fracture propagation ,Incubation time ,Steady-state regime ,Tuler-Butcher ,0203 mechanical engineering ,Chain (algebraic topology) ,Fracture criteria ,Range (statistics) ,Mathematics ,Condensed Matter - Materials Science ,Steady-state propagation ,Crack propagation ,Isotropy ,Materials Science (cond-mat.mtrl-sci) ,Chains ,Mechanics ,Dynamic fracture, Fracture criteria, Discrete chain, Incubation time, Tuler-Butcher, Chains, Crack propagation, Cracks, Discrete structure, Dynamic fractures, Fracture criteria, Steady-state propagation, Steady-state regime, Time dependent fracture, Fracture ,16. Peace & justice ,021001 nanoscience & nanotechnology ,020303 mechanical engineering & transports ,Fracture ,Mechanics of Materials ,Discrete structure ,Modeling and Simulation ,Fracture (geology) ,0210 nano-technology - Abstract
The extent to which time-dependent fracture criteria affect the dynamic behavior of fracture in a discrete structure is discussed in this work. The simplest case of a semi-infinite isotropic chain of oscillators has been studied. Two history-dependent criteria are compared to the classical one of threshold elongation for linear bonds. The results show that steady-state regimes can be reached in the low subsonic crack speed range where it is impossible according to the classical criterion. Repercussions in terms of load and crack opening versus velocity are explained in detail. A strong qualitative influence of history-dependent criteria is observed at low subsonic crack velocities, especially in relation to achievable steady-state propagation regimes.
- Published
- 2018
23. Power of Enumeration - Recent Topics on BDD/ZDD-Based Techniques for Discrete Structure Manipulation
- Author
-
Minato, Shin-ichi and Minato, Shin-ichi
- Abstract
Discrete structure manipulation is a fundamental technique for many problems solved by computers. BDDs/ZDDs have attracted a great deal of attention for twenty years, because those data structures are useful to efficiently manipulate basic discrete structures such as logic functions and sets of combinations. Recently, one of the most interesting research topics related to BDDs/ZDDs is Frontier-based search method, a very efficient algorithm for enumerating and indexing the subsets of a graph to satisfy a given constraint. This work is important because many kinds of practical problems can be efficiently solved by some variations of this algorithm. In this article, we present recent research activity related to BDD and ZDD. We first briefly explain the basic techniques for BDD/ZDD manipulation, and then we present several examples of the state-of-the-art algorithms to show the power of enumeration.
- Published
- 2017
24. Techniques of BDD/ZDD : Brief History and Recent Activity
- Author
-
Shin-ichi Minato
- Subjects
Mathematical logic ,Combinational logic ,Theoretical computer science ,algorithm ,Binary decision diagram ,Computer science ,Graph theory ,data structure ,discrete structure ,Data structure ,Probability theory ,Artificial Intelligence ,Hardware and Architecture ,ZDD ,Algebraic operation ,Influence diagram ,Computer Vision and Pattern Recognition ,Set theory ,Electrical and Electronic Engineering ,BDD ,Software ,decision diagram - Abstract
Discrete structures are foundational material for computer science and mathematics, which are related to set theory, symbolic logic, inductive proof, graph theory, combinatorics, probability theory, etc. Many problems solved by computers can be decomposed into discrete structures using simple primitive algebraic operations. It is very important to represent discrete structures compactly and to execute efficiently tasks such as equivalency/validity checking, analysis of models, and optimization. Recently, BDDs (Binary Decision Diagrams) and ZDDs (Zero-suppressed BDDs) have attracted a great deal of attention, because they efficiently represent and manipulate large-scale combinational logic data, which are the basic discrete structures in various fields of application. Although a quarter of a century has passed since Bryant's first idea, there are still a lot of interesting and exciting research topics related to BDD and ZDD. BDD/ZDD is based on in-memory data processing techniques, and it enjoys the advantage of using random access memory. Recent commodity PCs are equipped with gigabytes of main memory, and we can now solve large-scale problems which used to be impossible due to memory shortage. Thus, especially since 2000, the scope of BDD/ZDD methods has increased. This survey paper describes the history of, and recent research activity pertaining to, techniques related to BDD and ZDD.
- Published
- 2013
25. Применения дискретных покрытий в режущих инструментах
- Subjects
стальные инструменты ,шероховатость поверхности ,дискретная структура ,износостойкие покрытия ,wear-resistant coating ,cutting tool ,discrete structure - Abstract
Рассмотрены примеры практического использования режущих инструментов из быстрорежущих сталей, твердых сплавов и керамики с износостойкими защитными покрытиями. Показано, что инструменты с покрытиями, имеющими дискретную структуру, характеризуются большей стойкостью и обеспечивают получение обработанной поверхности с меньшей шероховатостью. The examples of practical use of cutting tools made of high-speed steel, carbide and ceramic wear-resistant coating. It is shown that the coated tools having a discrete structure, characterized by longer lifetime and provides the treated surface with less roughness.
- Published
- 2016
26. Algorithmic aspects of a general modular decomposition theory
- Author
-
F. de Montgolfier, Michel Habib, Binh-Minh Bui-Xuan, Vincent Limouzy, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), and Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS)
- Subjects
FOS: Computer and information sciences ,Vertex (graph theory) ,Modular Decomposition ,Homogeneous relation ,[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS] ,G.2 ,Generalization ,G.2.2 ,0102 computer and information sciences ,02 engineering and technology ,01 natural sciences ,Graph ,Algorithmics ,Computer Science - Data Structures and Algorithms ,0202 electrical engineering, electronic engineering, information engineering ,E.1, G.2, G2.2 ,Discrete Mathematics and Combinatorics ,Data Structures and Algorithms (cs.DS) ,Axiom ,Mathematics ,Discrete mathematics ,Decomposition ,business.industry ,Applied Mathematics ,Discrete Structure ,Graph theory ,Modular design ,Tree decomposition ,Modular decomposition ,Tree structure ,E.1 ,010201 computation theory & mathematics ,020201 artificial intelligence & image processing ,business ,Algorithms ,Intersecting submodular function ,MathematicsofComputing_DISCRETEMATHEMATICS - Abstract
A new general decomposition theory inspired by modular graph decomposition is presented. This helps in unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs, this new notion called homogeneous modules not only captures the classical graph modules but also allows handling 2-connected components, star-cutsets, and other vertex subsets.The main result is that most of the nice algorithmic tools developed for the modular decomposition of graphs still apply efficiently on our generalisation of modules. Besides, when an essential axiom is satisfied, almost all the important properties can be retrieved. For this case, an algorithm given by Ehrenfeucht, Gabow, McConnell and Sullivan [A. Ehrenfeucht, H. Gabow, R. McConnell, S. Sullivan, An O(n2) Divide-and-Conquer Algorithm for the prime tree decomposition of two-structures and modular decomposition of graphs, Journal of Algorithms 16 (1994) 283–294.] is generalised and yields a very efficient solution to the associated decomposition problem.
- Published
- 2009
27. Efficient dominant point detection based on discrete curve structure
- Author
-
Isabelle Debled-Rennesson, Hayat Nasser, Phuc Ngo, Applying Discrete Algorithms to Genomics and Imagery (ADAGIO), Department of Algorithms, Computation, Image and Geometry (LORIA - ALGO), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)
- Subjects
Maximum curvature ,polygonal simplification ,Discrete curve ,05 social sciences ,050301 education ,[SCCO.COMP]Cognitive science/Computer science ,020206 networking & telecommunications ,02 engineering and technology ,discrete structure ,[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG] ,Combinatorics ,Robustness (computer science) ,Dominant point detection ,0202 electrical engineering, electronic engineering, information engineering ,Heuristics ,0503 education ,Algorithm ,Mathematics ,Dominant point - Abstract
In this paper, we investigate the problem of dominant point detection on digital curves which consists in finding points with local maximum curvature. Thanks to previous studies of the decomposition of curves into sequence of discrete structuresi¾?[5---7], namely maximal blurred segments of width $$\nu $$i¾?[13], an initial algorithm has been proposed ini¾?[14] to detect dominant points. However, an heuristic strategy is used to identify the dominant points. We now propose a modified algorithm without heuristics but a simple measure of angle. In addition, an application of polygonal simplification is as well proposed to reduce the number of detected dominant points by associating a weight to each of them. The experimental results demonstrate the efficiency and robustness of the proposed method.
- Published
- 2015
28. 文書要約と関係学習のための離散構造に基づいた数値最適化法
- Author
-
Nishino, Masaaki, 山本, 章博, 黒橋, 禎夫, and 阿久津, 達也
- Subjects
Machine Learning ,Text Summarization ,Discrete Structure ,Relational Learning ,Numerical Optimization ,Natural Language Processing - Published
- 2014
29. Numerical Optimization Methods based on Discrete Structure for Text Summarization and Relational Learning
- Author
-
Nishino, Masaaki and Nishino, Masaaki
- Published
- 2014
30. Some exact and explicit solutions to a two-component, discrete, nonlinear Schrödinger model
- Author
-
İsmail Aslan, TR59752, Aslan, İsmail, and Izmir Institute of Technology. Mathematics
- Subjects
Physics ,Energy transfer ,Dinger equation ,Periodic structures ,Structure (category theory) ,General Physics and Astronomy ,Expansion methods ,Schrödinger equation ,Nonlinear system ,symbols.namesake ,Classical mechanics ,Natural processes ,Discrete structure ,Component (UML) ,symbols ,Periodic wave ,Effective tool - Abstract
Natural processes and phenomena often display discrete structure. The discrete nonlinear Schrödinger equations are used in both physics and biology to model periodic optical structures and energy transfer in proteins. In this study, we present a new application of the (G′/G)-expansion method to special, coupled, discrete, nonlinear Schrödinger-type equations. This application is shown to be an effective tool for constructing solitary and periodic wave profiles with arbitrary parameters. In addition, we provide rational solutions that have not been explicitly computed before.
- Published
- 2011
31. Techniques of BDD/ZDD : Brief History and Recent Activity
- Author
-
Minato, Shin-ichi and Minato, Shin-ichi
- Abstract
Discrete structures are foundational material for computer science and mathematics, which are related to set theory, symbolic logic, inductive proof, graph theory, combinatorics, probability theory, etc. Many problems solved by computers can be decomposed into discrete structures using simple primitive algebraic operations. It is very important to represent discrete structures compactly and to execute efficiently tasks such as equivalency/validity checking, analysis of models, and optimization. Recently, BDDs (Binary Decision Diagrams) and ZDDs (Zero-suppressed BDDs) have attracted a great deal of attention, because they efficiently represent and manipulate large-scale combinational logic data, which are the basic discrete structures in various fields of application. Although a quarter of a century has passed since Bryant's first idea, there are still a lot of interesting and exciting research topics related to BDD and ZDD. BDD/ZDD is based on in-memory data processing techniques, and it enjoys the advantage of using random access memory. Recent commodity PCs are equipped with gigabytes of main memory, and we can now solve large-scale problems which used to be impossible due to memory shortage. Thus, especially since 2000, the scope of BDD/ZDD methods has increased. This survey paper describes the history of, and recent research activity pertaining to, techniques related to BDD and ZDD.
- Published
- 2013
32. Techniques of BDD/ZDD : Brief History and Recent Activity
- Author
-
1000010374612, Minato, Shin-ichi, 1000010374612, and Minato, Shin-ichi
- Abstract
Discrete structures are foundational material for computer science and mathematics, which are related to set theory, symbolic logic, inductive proof, graph theory, combinatorics, probability theory, etc. Many problems solved by computers can be decomposed into discrete structures using simple primitive algebraic operations. It is very important to represent discrete structures compactly and to execute efficiently tasks such as equivalency/validity checking, analysis of models, and optimization. Recently, BDDs (Binary Decision Diagrams) and ZDDs (Zero-suppressed BDDs) have attracted a great deal of attention, because they efficiently represent and manipulate large-scale combinational logic data, which are the basic discrete structures in various fields of application. Although a quarter of a century has passed since Bryant's first idea, there are still a lot of interesting and exciting research topics related to BDD and ZDD. BDD/ZDD is based on in-memory data processing techniques, and it enjoys the advantage of using random access memory. Recent commodity PCs are equipped with gigabytes of main memory, and we can now solve large-scale problems which used to be impossible due to memory shortage. Thus, especially since 2000, the scope of BDD/ZDD methods has increased. This survey paper describes the history of, and recent research activity pertaining to, techniques related to BDD and ZDD.
- Published
- 2013
33. Interactions between (Me4N)(2)C2O4 center dot SnPh2C2O4 center dot H2O and some Lewis acids: Synthesis, IR and Mossbauer studies of new trinuclear dioxalato complexes
- Author
-
UCL - SST/IMCN - Institute of Condensed Matter and Nanosciences, Kane, Hayat Qamar, Okio, Kochikpa A., Fall, Alioune, Diop, Libasse, Russo, U., Mahieu, Bernard, UCL - SST/IMCN - Institute of Condensed Matter and Nanosciences, Kane, Hayat Qamar, Okio, Kochikpa A., Fall, Alioune, Diop, Libasse, Russo, U., and Mahieu, Bernard
- Abstract
Five new trinuclear dioxalato diphenyltin (IV) adducts with SnR2Cl2, (R = Ph, Bu, Me), CdCl2 and SbCl3 have been synthesized Discrete structures have been suggested on the basis of infrared and Mossbauer data, the oxalate behaving as a bichelating ligand.
- Published
- 2010
34. Elementary Differential Calculus on Discrete, Continuous and Hybrid Spaces
- Author
-
Howard Blair, Blair, Howard, Howard Blair, and Blair, Howard
- Abstract
We unify a variety of continuous and discrete types of change of state phenomena using a scheme whose instances are differential calculi on structures that embrace both topological spaces and graphs as well as hybrid ramifications of such structures. These calculi include the elementary differential calculus on real and complex vector spaces. One class of spaces that has been increasingly receiving attention in recent years is the class of convergence spaces [cf. Heckmann, R., TCS v.305, (159--186)(2003)]. The class of convergence spaces together with the continuous functions among convergence spaces forms a Cartesian-closed category CONV that contains as full subcategories both the category TOP of topological spaces and an embedding of the category DIGRAPH of reflexive directed graphs. (More can importantly be said about these embeddings.) These properties of CONV serve to assure that we can construct continuous products of continuous functions, and that there is always at least one convergence structure available in function spaces with respect to which the operations of function application and composition are continuous. The containment of TOP and DIGRAPH in CONV allows to combine arbitrary topological spaces with discrete structures (as represented by digraphs) to obtain hybrid structures, which generally are not topological spaces. We give a differential calculus scheme in CONV that addresses three issues in particular. 1. For convergence spaces $X$ and $Y$ and function $f: X longrightarrow Y$, the scheme gives necessary and sufficient conditions for a candidate differential $df: X longrightarrow Y$ to be a (not necessarily "the", depending on the spaces involved) differential of $f$ at $x_0$. 2. The chain rule holds and the differential relation between functions distributes over Cartesian products: e.g. if $Df$, $Dg$ and $Dh$ are, respectively, differentials of $f$ at $(g(x_0),h(x_0))$ and $g$ and $h$ at $x_0$, then $Df circ (Dg times Dh)$ is a differential
- Published
- 2007
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.