Auswahl der wissenschaftlichen Literatur zum Thema „Oriented path“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Oriented path" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Oriented path"
Nešetřil, Jaroslav, und Xuding Zhu. „Path homomorphisms“. Mathematical Proceedings of the Cambridge Philosophical Society 120, Nr. 2 (August 1996): 207–20. http://dx.doi.org/10.1017/s0305004100074806.
Der volle Inhalt der QuelleMaxová, Jana, und Jaroslav Nešetřil. „On oriented path double covers“. Discrete Mathematics 233, Nr. 1-3 (April 2001): 371–80. http://dx.doi.org/10.1016/s0012-365x(00)00253-3.
Der volle Inhalt der QuelleJunkkari, Marko, Johanna Vainio, Kati Iltanen, Paavo Arvola, Heidi Kari und Jaana Kekäläinen. „Path Expressions in SQL“. Journal of Database Management 27, Nr. 3 (Juli 2016): 1–22. http://dx.doi.org/10.4018/jdm.2016070101.
Der volle Inhalt der QuelleXiao-Ying Wu, Xiao-Ying Wu, Xin-Qian Fan Xiao-Ying Wu, Bing-Yan Wei Xin-Qian Fan und Qian-Han Zhang Bing-Yan Wei. „A Path Planning Method for Logistics Oriented Drone Flight Routes“. 電腦學刊 34, Nr. 5 (Oktober 2023): 179–87. http://dx.doi.org/10.53106/199115992023103405013.
Der volle Inhalt der QuelleBorst, C., M. Mulder, M. M. van Paassen und J. A. Mulder. „Path-Oriented Control/Display Augmentation for Perspective Flight-Path Displays“. Journal of Guidance, Control, and Dynamics 29, Nr. 4 (Juli 2006): 780–91. http://dx.doi.org/10.2514/1.16469.
Der volle Inhalt der QuelleNguyen, S., D. Pretolani und L. Markenzon. „On some path problems on oriented hypergraphs“. RAIRO - Theoretical Informatics and Applications 32, Nr. 1-3 (1998): 1–20. http://dx.doi.org/10.1051/ita/1998321-300011.
Der volle Inhalt der QuelleLacevic, Bakir, und Paolo Rocco. „Safety-oriented path planning for articulated robots“. Robotica 31, Nr. 6 (21.02.2013): 861–74. http://dx.doi.org/10.1017/s0263574713000143.
Der volle Inhalt der QuelleLi, Xiaohong, Ran Liu, Zhiyong Feng und Ke He. „Threat modeling-oriented attack path evaluating algorithm“. Transactions of Tianjin University 15, Nr. 3 (Juni 2009): 162–67. http://dx.doi.org/10.1007/s12209-009-0029-y.
Der volle Inhalt der QuelleReid, K. B., und Keith Wayland. „Minimum path decompositions of oriented cubic graphs“. Journal of Graph Theory 11, Nr. 1 (1987): 113–18. http://dx.doi.org/10.1002/jgt.3190110115.
Der volle Inhalt der QuelleChaturvedi, Santosh K. „Recovery Oriented Services: Obstacle is the Path“. Journal of Psychosocial Rehabilitation and Mental Health 1, Nr. 2 (Dezember 2014): 43–45. http://dx.doi.org/10.1007/s40737-014-0018-x.
Der volle Inhalt der QuelleDissertationen zum Thema "Oriented path"
Strandberg, Morten. „Robot path planning : an object-oriented approach“. Doctoral thesis, KTH, Signals, Sensors and Systems, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-18.
Der volle Inhalt der QuellePath planning has important applications in many areas, for example industrial robotics, autonomous systems, virtual prototyping, and computer-aided drug design. This thesis presents a new framework for developing and evaluating path planning algorithms. The framework is named CoPP (Components for Path Planning). It consists of loosely coupled and reusable components that are useful for building path planning applications. The framework is especially designed to make it easy to do fair comparisons between different path planning algorithms.
CoPP is also designed to allow almost any user-defined moving system. The default type of moving system is a robot class, which is capable of describing tree-like kinematic chains. Additional features of this robot class are: joint couplings, numerical or closed-form inverse kinematics, and hierarchical robot representations. The last feature is useful when planning for complex systems like a mobile platform equipped with an arm and a hand.
During the last six years, Rapidly-exploring Random Trees (RRTs) have become a popular framework for developing randomized path planning algorithms. This thesis presents a method for augmenting bidirectional RRT-planners with local trees. For problems where the solution trajectory has to pass through several narrow passages, local trees help to reduce the required planning time.
To reduce the work needed for programming of industrial robots, it is desirable to allow task specifications at a very high level, leaving it up to the robot system to figure out what to do. Here we present a fast and flexible pick-and-place planner. Given an object that has to be moved to another position, the planner chooses a suitable grasp of the object and finds motions that bring the object to the desired position. The planner can also handle constraints on, e.g., the orientation of the manipulated object.
For planning of pick-and-place tasks it is necessary to choose a grasp suitable to the task. Unless the grasp is given, some sort of grasp planning has to be performed. This thesis presents a fast grasp planner for a three- fingered robot hand. The grasp planner could be used in an industrial setting, where a robot is to pick up irregularly shaped objects from a conveyor belt. In conjunction with grasp planning, a new method for evaluating grasp stability is presented.
Adams, Gregory (Gregory David) 1965 Carleton University Dissertation Computer Science. „Describing groups of interacting objects using path expressions“. Ottawa.:, 1992.
Den vollen Inhalt der Quelle findende, Gosson de Varennes Serge. „Multi-oriented Symplectic Geometry and the Extension of Path Intersection Indices“. Doctoral thesis, Växjö universitet, Matematiska och systemtekniska institutionen, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-400.
Der volle Inhalt der QuelleShaha, Bartholomew. „Leadership for process-oriented social development: a path towards building community“. Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B29697906.
Der volle Inhalt der QuelleEscher, P. C. „Pythia : an object-oriented gas path analysis computer program for general applications“. Thesis, Cranfield University, 1995. http://dspace.lib.cranfield.ac.uk/handle/1826/3457.
Der volle Inhalt der QuelleHong, Luke. „Spatial navigation in fiddler crabs: Goal oriented path integration of Uca pugilator“. University of Cincinnati / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1384850701.
Der volle Inhalt der QuelleBoggs, James Darrell. „Accessing Geospatial Services in Limited Bandwidth Service-Oriented Architecture (SOA) Environments“. NSUWorks, 2013. http://nsuworks.nova.edu/gscis_etd/97.
Der volle Inhalt der QuelleTarhini, Batoul. „Oriented paths in digraphs and the S-packing coloring of subcubic graph“. Electronic Thesis or Diss., Bourgogne Franche-Comté, 2023. http://www.theses.fr/2023UBFCK079.
Der volle Inhalt der QuelleThis PhD thesis is divided into two principal parts: Part I delves into the existenceof oriented paths in digraphs, aiming to establish a connection between a digraph'schromatic number and the existence of specific oriented paths within it as subdigraphs. Digraphs contained in any n-chromatic digraph are called n-universal. We consider two conjectures: Burr's conjecture, which states that every oriented tree of order n is (2n-2)-universal, and El Sahili's conjeture which states that every oriented path of order n is n-universal. For oriented paths in general, the best bound is given by Burr, that is every oriented path of order n is (n − 1)^2-universal. Our objective is to study the existence of an integer k such that any digraph with a chromatic number k, contains a copy of a given oriented path with three blocks as its subdigraph. To achieve our goals, we rely significantly on fundamental concepts, including, induction on the order of a given digraph, final forests, leveling techniques, and strategic digraph decomposition methods. A path P (k1, k2, k3) is an oriented path consisting of k1 forward arcs, followed by k2 backward arcs, and then by k3 forward arcs. For the path P(k,1,l), we have confirmed El Sahili's conjecture in Hamiltonian digraphs. More clearly, we have established the existence of any path P (k, 1, l) of order n in any n-chromatic Hamiltonian digraph. And depending on this result concerning Hamiltonian digraphs, we proved the correctness of El Sahili's conjecture on a more general class of digraphs which is digraphs containing a Hamiltonian directed path. We introduce a new technique which is represented by a decomposition of the digraph into subdigraphs defined by a series of successive operations applied to the digraph relying on the famous theorem of Roy which establishes the existence of a directed path of order n in any n-chromatic digraph. This technique has proven to be instrumental in establishing new linear bounds for the chromatic number of digraphs that lack an oriented path with three blocks. In deed, using this technique, we proved that the path P(k,1,l) satisfies Burr's conjecture.Moreover, for any path with three blocks, P(k,l,r) we establish a linear bound for the chromatic number which improves all the previously reached bounds. In Part II we study the problem of S-packing coloring in graphs. Given a non-decreasing sequence S = (s1, s2, . . . , sk) of positive integers, an S-packing coloring of a graph G is a partition of the vertex set of G into k subsets{V1, V2, . . . , Vk} such that for each 1 ≤ i ≤ k, the distance between any two dis-tinct vertices u and v in Vi is at least si + 1. Our focus is centered on an intriguing conjecture proposed by Brešar et al., which states that packing chromatic number of the subdivision of any subcubic graph is at most 5. Our desired aim is to provide a confirmation of this conjecture for specific classes of subcubic graphs, and to address the unresolved issues raised within this subject matter. An observation for Gastineau and Togni states that if a graph G is (1, 1, 2, 2)-packing colorable, then the chromatic number of its subdivision graph S(G) is at most 5, and hence it satisfies the conjecture. Depending on this observation, and in order to prove the correctness of the conjecture for the class of cubic Halin graphs, we studied its S-packing coloring aiming to prove that it admits a (1, 1, 2, 2)- packing coloring. We proved that a cubic Halin graph is (1, 1, 2, 3)-packing colorable, then it is (1, 1, 2, 2)-packing colorable, and so we confirm the conjecture for this class. Moreover, Gastineau and Togni, after proving that every subcubic graph is (1, 2, 2, 2, 2, 2, 2)-packing colorbale, have posed an open problem on whether every subcubic graph is (1, 2, 2, 2, 2, 2)-packing colorable. We answer this question in affirmative in the particular class we worked on; we proved that cubic Halin graphs are (1, 2, 2, 2, 2, 2)-packing colorable
Lewis, Tracy L. „Design Readiness: An Exploratory Model of Object-Oriented Design Performance“. Diss., Virginia Tech, 2004. http://hdl.handle.net/10919/28545.
Der volle Inhalt der QuellePh. D.
Suweon, Kim. „The political economy of aid-oriented foreign policy change: elite perspectives on mercantilism in Korea and Ghana“. Thesis, University of the Western Cape, 2014. http://hdl.handle.net/11394/4021.
Der volle Inhalt der QuelleThe thesis examines how elite perspectives on foreign aid affect the subsequent path of aid dependence. The focus is on aid-seeking foreign policy change. Two foreign policy change cases are examined for the study, which took place in Korea under Park Chung-hee and in Ghana under Rawlings through a lens of comparative historical analysis. The thesis aims to make two original contributions to knowledge. First, it explains recipient foreign policy using two different forms of mercantilism, and second, it reveals the dependent path created by the mercantilist oriented elite. Mercantilism in the thesis is used as dual-frameworked concept. First, it is a lens to see state behaviour. Despite the fact that mercantilism has been mainly used to explain a donor‘s behaviour, it can elucidate that of an aid-recipient state when the aid-seeking country is in dire need of the foreign aid for the survival of the state. The thesis applies mercantilism to explain aid-receiving countries‘behaviour. Second, more importantly, mercantilism also explains elite perspectives. The elite in aid receiving countries search for foreign aid not only for the wealth and power of their state, but also for the prosperity and survival of themselves. Mercantilism is used as an ostensible principle in practicing the private search for advantages of the elite. The thesis uses the dual-mercantilism idea to examine aid-seeking foreign policy in Korea and Ghana. In Korea, the elite saw the key to their survival in industrialising the nation, and their search for foreign aid took place based on that raison d’être. In Ghana, on the other hand, the elite found the way to their survival and prosperity in acquiring more foreign aid and the aid per se became the ultimate goal. The thesis finds industrial mercantilism a useful framework to understand the elite perspective in Korea
Bücher zum Thema "Oriented path"
Huang, J. C. Path-oriented program analysis. Cambridge: Cambridge University Press, 2008.
Den vollen Inhalt der Quelle findenT, Karamouzis Stamos, und United States. National Aeronautics and Space Administration. Scientific and Technical Information Division., Hrsg. A path-oriented matrix-based knowledge representation system. [Washington, DC]: National Aeronautics and Space Administration, Office of Management, Scientific and Technical Information Program, 1993.
Den vollen Inhalt der Quelle findenT, Karamouzis Stamos, und United States. National Aeronautics and Space Administration. Scientific and Technical Information Division., Hrsg. A path-oriented matrix-based knowledge representation system. [Washington, DC]: National Aeronautics and Space Administration, Office of Management, Scientific and Technical Information Program, 1993.
Den vollen Inhalt der Quelle findenT, Karamouzis Stamos, und United States. National Aeronautics and Space Administration. Scientific and Technical Information Division., Hrsg. A path-oriented matrix-based knowledge representation system. [Washington, DC]: National Aeronautics and Space Administration, Office of Management, Scientific and Technical Information Program, 1993.
Den vollen Inhalt der Quelle findenFeyock, Stefan. A path-oriented matrix-based knowledge representation system. Hampton, Va: Langley Research Center, 1993.
Den vollen Inhalt der Quelle findenRandhir, Singh. Indian politics today: An argument for socialism-oriented path of development. Delhi: Aakar Books, 2009.
Den vollen Inhalt der Quelle findenRandhir, Singh. Indian politics today: An argument for socialism-oriented path of development. Delhi: Aakar Books, 2009.
Den vollen Inhalt der Quelle findenRandhir, Singh. Indian politics today: An argument for socialism-oriented path of development. Delhi: Aakar Books, 2009.
Den vollen Inhalt der Quelle findenRandhir, Singh. Indian politics today: An argument for socialism-oriented path of development. Delhi: Aakar Books, 2009.
Den vollen Inhalt der Quelle findenRandhir, Singh. Indian politics today: An argument for socialism-oriented path of development. Delhi: Aakar Books, 2009.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Oriented path"
Mueck, Thomas A., und Martin L. Polaschek. „Aggregation Path Indexing“. In Index Data Structures in Object-Oriented Databases, 123–40. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6213-9_5.
Der volle Inhalt der QuelleYang, Yong, Long Wang, Jing Gu und Ying Li. „Transparently Capturing Execution Path of Service/Job Request Processing“. In Service-Oriented Computing, 879–87. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-03596-9_63.
Der volle Inhalt der QuelleLiang, Tingting, Liang Chen, Jian Wu, Hai Dong und Athman Bouguettaya. „Meta-Path Based Service Recommendation in Heterogeneous Information Networks“. In Service-Oriented Computing, 371–86. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46295-0_23.
Der volle Inhalt der QuelleAltunay, M., D. Brown, G. Byrd und R. Dean. „Trust-Based Secure Workflow Path Construction“. In Service-Oriented Computing – ICSOC 2007, 382–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11596141_29.
Der volle Inhalt der QuelleSarcar, Vaskaran. „Important Features in Java’s Enhancement Path“. In Interactive Object-Oriented Programming in Java, 423–39. Berkeley, CA: Apress, 2019. http://dx.doi.org/10.1007/978-1-4842-5404-2_14.
Der volle Inhalt der QuelleCai, Zhicheng, Xiaoping Li und Jatinder N. D. Gupta. „Critical Path-Based Iterative Heuristic for Workflow Scheduling in Utility and Cloud Computing“. In Service-Oriented Computing, 207–21. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45005-1_15.
Der volle Inhalt der QuelleChen, Niu, An Liu, Guanfeng Liu, Jiajie Xu und Lei Zhao. „Representation Learning Based Query Decomposition for Batch Shortest Path Processing in Road Networks“. In Service-Oriented Computing, 257–72. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-91431-8_16.
Der volle Inhalt der QuelleOomoto, Eitetsu, Makoto Kamitani und Toshiyuki Takamatsu. „Path Existence Constraints in Object-Oriented Databases“. In Information Organization and Databases, 45–58. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/978-1-4615-1379-7_4.
Der volle Inhalt der QuelleToivonen, Hannu, Sébastien Mahler und Fang Zhou. „A Framework for Path-Oriented Network Simplification“. In Lecture Notes in Computer Science, 220–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13062-5_21.
Der volle Inhalt der QuelleMaleszka, Marcin, und Ngoc Thanh Nguyen. „Path-Oriented Integration Method for Complex Trees“. In Agent and Multi-Agent Systems. Technologies and Applications, 84–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30947-2_12.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Oriented path"
Gotlieb, Arnaud, und Matthieu Petit. „Path-oriented random testing“. In the 1st international workshop. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1145735.1145740.
Der volle Inhalt der QuelleGotlieb, Arnaud, und Matthieu Petit. „Constraint Reasoning in Path-Oriented Random Testing“. In 2008 32nd Annual IEEE International Computer Software and Applications Conference. IEEE, 2008. http://dx.doi.org/10.1109/compsac.2008.78.
Der volle Inhalt der Quelle„AN OPEN OBJECT ORIENTED PATH PLANNING SYSTEM“. In 2nd International Conference on Informatics in Control, Automation and Robotics. SciTePress - Science and and Technology Publications, 2005. http://dx.doi.org/10.5220/0001177600170024.
Der volle Inhalt der QuelleHayasaka, Mitsuo, Thavisak Manodham und Tetsuya Miki. „A Novel Path Protection Scheme with FEC Path in Connection Oriented Networks“. In 2006 Asia-Pacific Conference on Communications. IEEE, 2006. http://dx.doi.org/10.1109/apcc.2006.255823.
Der volle Inhalt der QuelleLiang, Bomiao, Yan Xu, Fushuan Wen, Ivo Palu, Weijia Liu, Yusheng Xue, Yuquan Liu und Huiyu Shang. „Fast Path-Oriented Strategy for Power System Restoration“. In 2019 Electric Power Quality and Supply Reliability Conference (PQ) & 2019 Symposium on Electrical Engineering and Mechatronics (SEEM). IEEE, 2019. http://dx.doi.org/10.1109/pq.2019.8818244.
Der volle Inhalt der QuelleJian, Su, Weng Wenyong und Wang Zebing. „A Teaching Path for Java Object Oriented Programming“. In 2009 International Forum on Information Technology and Applications (IFITA). IEEE, 2009. http://dx.doi.org/10.1109/ifita.2009.229.
Der volle Inhalt der QuelleKang, Gitae, Yong Bum Kim, Won Suk You, Young Hun Lee, Hyun Seok Oh, Hyungpil Moon und Hyouk Ryeol Choi. „Sampling-based path planning with goal oriented sampling“. In 2016 IEEE International Conference on Advanced Intelligent Mechatronics (AIM). IEEE, 2016. http://dx.doi.org/10.1109/aim.2016.7576947.
Der volle Inhalt der QuelleZhang, Minjin, Huawei Li und Xiaowei Li. „Multiple Coupling Effects Oriented Path Delay Test Generation“. In 26th IEEE VLSI Test Symposium (vts 2008). IEEE, 2008. http://dx.doi.org/10.1109/vts.2008.9.
Der volle Inhalt der QuelleWu, Jing, Xinlin He, Miao Shang und Wenming Ma. „Exploration on Development Path for Application-oriented Universities“. In Proceedings of the 2018 8th International Conference on Education and Management (ICEM 2018). Paris, France: Atlantis Press, 2019. http://dx.doi.org/10.2991/icem-18.2019.10.
Der volle Inhalt der QuelleMajumder, Md Badruddoja, Mesbah Uddin, Garrett S. Rose und Jeyavijayan Rajendran. „Sneak path enabled authentication for memristive crossbar memories“. In 2016 IEEE Asian Hardware-Oriented Security and Trust (AsianHOST). IEEE, 2016. http://dx.doi.org/10.1109/asianhost.2016.7835568.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Oriented path"
Nguyen, Daniel. Workflow Critical Path: A Data-Oriented Critical Path Metric for Holistic HPC Workflows. Portland State University Library, Januar 2000. http://dx.doi.org/10.15760/etd.7369.
Der volle Inhalt der QuelleGreen, Alastair, Paolo Guagliardo und Leonid Libkin. Property graphs and paths in GQL: Mathematical definitions. Linked Data Benchmark Council, Oktober 2021. http://dx.doi.org/10.54285/ldbc.tzjp7279.
Der volle Inhalt der QuelleManzano, Osmel, und José Luis Saboin. Reverse Causality between Oil Policy and Fiscal Policy?: The Venezuelan Experience. Inter-American Development Bank, Mai 2021. http://dx.doi.org/10.18235/0003290.
Der volle Inhalt der QuelleAnzolin, Guendalina. Productive Development Policies in the Mining Value Chain: Policy Opportunity and Alignment. Inter-American Development Bank, Dezember 2021. http://dx.doi.org/10.18235/0003886.
Der volle Inhalt der QuelleFedasiuk, Ryan, und Jacob Feldgoise. The Youth Thousand Talents Plan and China’s Military. Center for Security and Emerging Technology, August 2020. http://dx.doi.org/10.51593/20200041.
Der volle Inhalt der QuelleBray, Jonathan, Ross Boulanger, Misko Cubrinovski, Kohji Tokimatsu, Steven Kramer, Thomas O'Rourke, Ellen Rathje, Russell Green, Peter Robertson und Christine Beyzaei. U.S.—New Zealand— Japan International Workshop, Liquefaction-Induced Ground Movement Effects, University of California, Berkeley, California, 2-4 November 2016. Pacific Earthquake Engineering Research Center, University of California, Berkeley, CA, März 2017. http://dx.doi.org/10.55461/gzzx9906.
Der volle Inhalt der QuelleBieder, Corinne, René Amalberti, Jean Pariès, Hervé Laroche, Eric Marsden und Caroline Kamaté. Industrial safety in the age of “living with”: Uncertainty, complexity and rising expectations. Fondation pour une Culture de Sécurité Industrielle, April 2024. http://dx.doi.org/10.57071/420lwu.
Der volle Inhalt der QuelleKin, Eunjin, Jungyoon Choi und Sang Yeon Min. Efficacy and safety of herbal medicines external application with Tuina in congenital muscular torticollis : A systematic review and meta-analysis protocol. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, Januar 2022. http://dx.doi.org/10.37766/inplasy2022.1.0017.
Der volle Inhalt der Quelle