This work defines the concepts of strong efficient dominating set and intuitionistic fuzzy graph. We also introduce an graph a number graphs. The dominant in graphs has some limitations that are studied, derived..

‎in this article‎, ‎we introduce a new type iterative scheme for‎ ‎approximating common fixed points of two asymptotically‎ ‎nonexpansive mappings is defined‎, ‎and weak and strong convergence‎ ‎theorem are proved for the new iterative scheme in a uniformly‎ ‎convex banach space‎. ‎the results obtained in this article‎ ‎represent an extension as well as refinement of previous known‎ ‎resu...

a definition of two jointly asymptotically nonexpansive mappings s and t on uniformly convex banach space e is studied to approximate common fixed points of two such mappings through weak and strong convergence of an ishikawa type iteration scheme generated by s and t on a bounded closed and convex subset of e. as a consequence of the notion of two jointly asymptotically nonexpansive maps, we c...

we introduce a new one-step iteration process to approximate common fixed points of twononexpansive mappings in banach spaces and prove weak convergence of the iterative sequence using (i)opial’s condition and (ii) kadec-klee property. strong convergence theorems are also established in banachspaces and uniformly convex banach spaces under the so-called condition ( a ), which is weaker thancom...

A classic ‘reference’ variable provides an indirect way to access a variable or aggregate. packetC, [1] a language for network packet processing, has specialized requirements for references that apply to aggregates, based on domain-specific, extended data types. The primary functional requirement is to defer selecting particular aggregates until runtime. In addition, requirements for high progr...

This paper presents novel and efficient strategies to spatially adapt the amount of computational effort applied based on the local dynamics of a free surface flow, for classic weakly compressible SPH (WCSPH). Using a convenient and readily parallelizable block-based approach, different regions of the fluid are assigned differing time steps and solved at different rates to minimize computationa...

We examine the problem of how to ensure behavioral consistency of an object-oriented system after its schema has been updated. The problem is viewed from the perspective of both the strongly typed and the untyped language model. Solutions are compared in both models using C++ and CLOS as examples.