نتایج جستجو برای: analytical matching
تعداد نتایج: 269283 فیلتر نتایج به سال:
Many approaches have been proposed for monitoring the eutrophication of Case 2 waters using remote sensing data. Semi-analytical algorithms and spectrum matching are two major approaches for chlorophyll-a (Chla) retrieval. Semi-analytical algorithms provide indices correlated with phytoplankton characteristics, (e.g., maximum and minimum absorption peaks). Algorithms’ indices are correlated wit...
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
The problem of uniform exact model matching is studied via state and output feedback, for a class of linear time-varying analytic systems. The following two major issues are resolved: The nessecary and sufficient conditions for the problem to have a solution and the general analytical expressions for the controller matrices. A major feature of the proposed approach, is that it reduces the unifo...
In this paper, two techniques namely Mode Matching technique and Green’s function technique are used to solve analytically the Forward Problem for a finite right circular cylinder. These techniques are compared in terms of analytical derivation and numerical results.
Agents and Peer-to-Peer Computing: Towards P2P-Based Resource Allocation in Competitive Environments
Peer-to-peer frameworks are known to be robust and scalable to large numbers of agents. Recent resource allocation studies have leveraged this by using peer-to-peer frameworks for the implementation of resource matching algorithms. In this paper, we present a matching protocol for multiagent resource allocation in a competitive peer-to-peer environment; this work marks the first solution to the...
In this paper we develop an analytical fluid model for TCP Reno based on delay differential equations. Using this model, we have developed a prototype for a fluid based simulation tool for TCP. We empirically validate this model by matching the window, throughput and queue evolution curves obtained from the model to that offered by a simulation output. We claim that this analytical model provid...
A new stereo matching algorithm is introduced that performs iterative refinement on the results of adaptive support-weight stereo matching. During each iteration of disparity refinement, adaptive support-weights are used by the algorithm to penalize disparity differences within local windows. Analytical results show that the addition of iterative refinement to adaptive support-weight stereo mat...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید