Results 181 to 190 of about 8,099 (211)
Some of the next articles are maybe not open access.
Iteration Partitioning for Resolving Stride Conflicts on Cache-Coherent Multiprocessors
1993 International Conference on Parallel Processing - ICPP'93 Vol2, 1993We develop compile-time iteration partitioning techniques for private-cache shared-memory mulriprocessors. Our techniques assign loop iterations to a set of processors so that cache coherency traffic due io interprocessor communication is minimized and load balance is maintained.
Karen A. Tomko, Santosh G. Abraham
openaire +1 more source
On resolving acyclic partitions of graphs.
Ars Comb., 2004A resolving \(k\)-partition of a graph \(G\) is an ordered partition of its vertex-set into \(k\) parts such that all vertices have a different vector of closest distances to these parts. The lowest \(k\) for which such a partition exists, without cycle inside any part, is the resolving acyclic number \(a_r(G)\). Among others, it is shown that for any \
Varaporn Saenpholphat, Ping Zhang 0004
openaire +1 more source
Structural Analysis of Octagonal Nanotubes via Double Edge-Resolving Partitions
In materials science, the open nanotube derived from an octagonal grid is one of the most important and extensively researched compounds. Finding strategies for representing a variety of chemical compounds so that different compounds can have different representations is necessary for the investigation of chemical structures.
Amal S Alali +2 more
exaly +2 more sources
Unity-resolving states and generalised Golden-Thompson bounds on partition functions
Journal of Physics A, 1980It is shown that certain sets of normalised unity-resolving (e.g. coherent) states in Hilbert space serve to generate upper bounds on the partition function of a given Hamiltonian in that space. These bounds may be viewed as generalisations of bounds derived previously by Golden, Thompson, Hepp and Lieb (see Phys. Rev. A, vol.8, p.2517, 1973).
H Leschke
exaly +2 more sources
Resolving resource partitioning in parrotfishes (Scarini) using microhistology of feeding substrata
Coral Reefs, 2020Parrotfishes (Scarini) are considered key agents in coral reef health and recovery, but the drivers of parrotfish–coral dynamics remain contentious. The prevailing view of parrotfishes as ecosystem engineers is based on the perceived removal of algal turf, macroalgae and sediment, but these are effects of feeding, not causes.
Georgina M. Nicholson +1 more
openaire +1 more source
Space- and Time-Resolved Dynamics of Fast Electrons and of the Energy Partition Into Cold Electrons
IEEE Transactions on Plasma Science, 2008Through the time- and space-resolved interferometry of a short-pulse low-energy probe beam reflecting on the rear surface of a solid target irradiated on its front surface by a high-intensity laser, we have measured a very abrupt expansion of the target rear surface.
ANTICI, PATRIZIO +12 more
openaire +2 more sources
Sharp bounds of partition resolvability of convex polytopes
Journal of Combinatorial Mathematics and Combinatorial Computing<p>Graph theory serves as a central and dynamic framework for the design and analysis of networks. Convex polytopes, as fundamental geometric entities, encompass a rich variety of mathematical structures and problems. The basic theory of convex polytopes involves the study of faces, normal cones, duality—particularly polarity—along with ...
openaire +1 more source
Physica Scripta, 1985
Summary: In the resolvent methods for solving the Schrödinger equation, the eigenvalues are represented by simple poles of the so-called Weinstein function, whereas the eigenfunctions are represented by expressions of the form \(\infty/\infty\). We show that there exists a simple identity which permits the evaluation of the eigenfunction, and which ...
openaire +1 more source
Summary: In the resolvent methods for solving the Schrödinger equation, the eigenvalues are represented by simple poles of the so-called Weinstein function, whereas the eigenfunctions are represented by expressions of the form \(\infty/\infty\). We show that there exists a simple identity which permits the evaluation of the eigenfunction, and which ...
openaire +1 more source
Fault-Tolerant Partition Resolvability in Chemical Graphs
Polycyclic Aromatic Compounds, 2022Kamran Azhar +3 more
openaire +1 more source
Colour Class Domination equivalence partition and Colourful resolving sets in graphs
Punjab University Journal of MathematicsLet H = (V,E) be a simple graph. A subset S of V(H) is an equivalence set if the subgraph induced by S is component-wise complete. Let P = {V1,V2, , Vk} be a partition of V (H) where each Vi,1 ≤ i ≤ k is an equivalence set of H. The partition P is called a colourful domination equivalence partition if the set D = {u1,u2, , uk} where ui,1 ≤ i ≤ k are ...
J. Sivakumar +3 more
openaire +1 more source

