نتایج جستجو برای: solution mapping

تعداد نتایج: 653311  

2012
JIE XIN JIAQIAN HU HONG LU George M. Zaslavsky

In this paper, we study the solution of the fractional nonlinear Ginzburg-Landau(FNGL) equation with weak initial data in the weighted Lebesgue spaces. The existence of a solution to this equation is proved by the contraction-mapping principle.

Journal: :IEEE Trans. Systems, Man, and Cybernetics 1990
C. S. George Lee C. L. Philip Chen

This paper presents two efficient mapping algorithms for scheduling the robot inverse dynamics computation consisting of m computational modules with precedence relationship to be executed on a multiprocessor system consisting ofp identical homogeneous processors with processor and communication costs to achieve minimum computation time. An objective function is defined in terms of the sum of t...

2007
Grzegorz Krawczyk

The display of high dynamic range images and video requires a tone mapping algorithm to depict their original appearance on existing display devices whose capabilities in terms of dynamic range are insufficient. The insightful application of knowledge about human visual system can assure high fidelity of depiction in such an algorithm. In this thesis, we design new tone mapping models and impro...

2005
Yongjian Huang Nigel Shadbolt

Ontology is important in sharing and reusing knowledge. It also plays a crucial role in the development of Semantic Web. The paper discusses the DL(Description Logic) and graph view on ontology. Different perspectives have different models and approaches on ontology mapping. The paper presents how the two different approaches handle ontology mapping, respectively. We argue that a combination of...

2004
Huiyong Xiao Isabel F. Cruz Feihong Hsu

A huge amount of data on the Web may be heterogeneous with respect to syntax, schemata and semantics. For instance, XML and RDF provide two completely different paradigms for modeling Web data. In this paper, we focus on the issue of mapping representations in an ontology-based framework that aims at integrating XML and RDF sources. We propose a solution that utilizes a new mapping language cal...

Journal: :JCSE 2008
Yuan An Alexander Borgida John Mylopoulos

There is general agreement that the problem of data semantics has to be addressed for XML data to become machine-processable. This problem can be tackled by defining a semantic mapping between an XML schema and an ontology. Unfortunately, creating such mappings is a tedious, time-consuming, and error-prone task. To alleviate this problem, we present a solution that heuristically discovers seman...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده برق و الکترونیک 1390

there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور استان مازندران - دانشکده ریاضی 1390

abstract this thesis includes five chapter : the first chapter assign to establish fuzzy mathematics requirement and introduction of liner programming in thesis. the second chapter we introduce a multilevel linear programming problems. the third chapter we proposed interactive fuzzy programming which consists of two phases , the study termination conditions of algorithm we show a satisfac...

Journal: :international journal of nonlinear analysis and applications 2016
kamal fallahi aris aghanians

in this work‎, ‎we formulate chatterjea contractions using graphs in metric spaces endowed with a graph ‎‎and‏ ‎‎‎‎investigate ‎the ‎existence‎ ‎of ‎fixed ‎points ‎for such mappings ‎under two different hypotheses‎. we also discuss the uniqueness of the fixed point. the given result is a generalization of chatterjea's fixed point theorem from metric spaces to metric spaces endowed with a graph.

Journal: :international journal of nonlinear analysis and applications 0
kamal fallahi department of mathematics, payame noor university, p.o. box 19395-3697, tehran, iran aris aghanians department of mathematics, payame noor university, p.o. box 19395-3697, tehran, iran

in this work‎, ‎we formulate chatterjea contractions using graphs in metric spaces endowed with a graph ‎‎and‏ ‎‎‎‎investigate ‎the ‎existence‎ ‎of ‎fixed ‎points ‎for such mappings ‎under two different hypotheses‎. we also discuss the uniqueness of the fixed point. the given result is a generalization of chatterjea's fixed point theorem from metric spaces to metric spaces endowed with a g...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید