Sharif Digital Repository

Experimental and numerical methods were used to investigate the Magnus phenomena over a spinning projectile. The pressure force acting on the surface of a spinning projectile was measured for various cases by employing a relatively novel experimental technique. A set of miniature pressure sensors along with a data acquisition board, battery and storage memory were placed inside a spinning model and the surface pressure were obtained through a remotely controlled system. Circumferential pressures of the model for both rotational and static conditions were obtained at two different free stream Mach numbers of 0.4 and 0.8 and at different angles of attack. The results showed the ability of this... 

A combination of measurements of the inclusive top-quark pair production cross-section performed by ATLAS and CMS in proton–proton collisions at centre-of-mass energies of 7 and 8 TeV at the LHC is presented. The cross-sections are obtained using top-quark pair decays with an opposite-charge electron–muon pair in the final state and with data corresponding to an integrated luminosity of about 5 fb−1 at s = 7 TeV and about 20 fb−1 at s = 8 TeV for each experiment. The combined cross-sections are determined to be 178.5 ± 4.7 pb at s = 7 TeV and 243.3−5.9+6.0 pb at s = 8 TeV with a correlation of 0.41, using a reference top-quark mass value of 172.5 GeV. The ratio of the combined cross-sections... 

Let D be a division algebra with center F and K a (not necessarily central) subfield of D. An element a ∈ D is called left algebraic (resp. right algebraic) over K, if there exists a non-zero left polynomial a0 + a1x + ⋯ + anxn (resp. right polynomial a0 + xa1 + ⋯ + xnan) over K such that a0 + a1a + ⋯ + anan = 0 (resp. a0 + aa1 + ⋯ + anan). Bell et al. proved that every division algebra whose elements are left (right) algebraic of bounded degree over a (not necessarily central) subfield must be centrally finite. In this paper we generalize this result and prove that every division algebra whose all multiplicative commutators are left (right) algebraic of bounded degree over a (not... 

Let A be an n-square non-negative matrix. If A contains no s × t zero submatrix, where s + t = n, then it is called fully indecomposable. Moreover, a graph G is said to be fully indecomposable if its adjacency matrix is fully indecomposable. In this paper we provide some necessary and sufficient conditions for a graph to be fully indecomposable. Among other results we prove that a regular connected graph is fully indecomposable if and only if it is not bipartite. © 2017 University of Calgary  

Let D be a division algebra with center F and K a (not necessarily central) subfield of D. An element a ∈ D is called left algebraic (resp. right algebraic) over K, if there exists a non-zero left polynomial a0 + a1x + ⋯ + anxn (resp. right polynomial a0 + xa1 + ⋯ + xnan) over K such that a0 + a1a + ⋯ + anan = 0 (resp. a0 + aa1 + ⋯ + anan). Bell et al. proved that every division algebra whose elements are left (right) algebraic of bounded degree over a (not necessarily central) subfield must be centrally finite. In this paper we generalize this result and prove that every division algebra whose all multiplicative commutators are left (right) algebraic of bounded degree over a (not... 

Creativity is a promoting factor in organizations. Having employees in structured and organized configurations in a creative manner, helps in improving the productivity. We investigate different structural aspects of teams' network organization and the creativity within a knowledge development program (KDP). The proposed methodology being equipped with a heuristic clustering technique, classifies the employees with respect to creativity parameters and configures a creativity matrix. Applying the creativity matrix, clustering is performed via mathematical programming. For large problems, a genetic algorithm (GA) is developed to solve the mathematical model. We also employ the Taguchi method... 

With the development of modern sports, the design and production of sportswear play an essential role, especially in many modern difficult and dangerous sports. Selection of fibre fabrics is the most important factor because this influences the performance and efficiency, while ensuring protection and physical comfort. In recent years, the demand for smart materials and textiles has been increasing all around the world. Many investigations have been carried out into developing smart textiles that support the better performance of athletes. A smart textile is an intelligent system that is able to sense environmental conditions and electrical, thermal, mechanical, chemical, and magnetic... 

Let R be a commutative ring with identity, and let A(R) be the set of ideals with non-zero annihilator. The annihilating-ideal graph of R is defined as the graph AG(R) with the vertex set A(R)* = A(R) {0}, and two distinct vertices I and J are adjacent if and only if IJ = 0. In this paper, we study some connections between the graph theoretic properties of this graph and some algebraic properties of a commutative ring. We prove that if AG(R) is a tree, then either AG(R) is a star graph or a path of order 4 and, in the latter case, R = F × S, where F is a field and S is a ring with a unique non-trivial ideal. Moreover, we prove that if R has at least three minimal prime ideals, then AG(R) is... 

Suppose that R is a commutative ring with identity. Let A(R) be the set of all ideals of R with non-zero annihilators. The annihilating-ideal graph of R is defined as the graph AG(R) with the vertex set A( R)*=A(R)(0) and two distinct vertices I and J are adjacent if and only if IJ=(0). In Behboodi and Rakeei (2011) [8], it was conjectured that for a reduced ring R with more than two minimal prime ideals, girth(AG(R))=3. Here, we prove that for every (not necessarily reduced) ring R, ω(AG(R))<|Min(R)|, which shows that the conjecture is true. Also in this paper, we present some results on the clique number and the chromatic number of the annihilating-ideal graph of a commutative ring. Among... 

When a transparent plane-parallel plate is illuminated at a boundary region by a parallel monochromatic beam of light, Fresnel diffraction occurs because of the abrupt change in phase imposed by the finite change in refractive index at the plate boundary. The intensity of the diffraction fringes varies periodically with changes in the optical path difference of the light passing through the plate edge. The optical path difference depends on the incident angle of the light, the refractive index of the plate and surrounding medium, and the wavelength of the light. Plotting the intensity of the diffraction fringes versus optical path difference provides a general phase shift method for phase... 

Co–Zr doped Ni ferrite substituted polyaniline (PANI) nanocomposites were prepared using polymerization reaction method. NiFeCo0.5Zr0.5O4 with 12.5%, 25%, 37.5% and 50% PANI (A1, A2, A3 and A4) were used to obtain better photocatalytic efficiency. XRD, UV/VIS, BET, and FESEM were employed to characterize the PANI/ferrite nanocomposites. The effect of reaction time and nanoparticle concentrations on the photocatalytic degradation were thoroughly evaluated. XRD analysis confirmed the phase of NiFeCo0·5Zr0·5O4ferrite, while FESEM analysis was performed to investigate the surface morphology of the nanocomposites. The crystallinity was increased with the Co–Zr doped Ni ferrite contents in the... 

The energy of a graph G, E(G), is the sum of absolute values of the eigenvalues of its adjacency matrix. Gutman et al. proved that for every cubic graph of order n, E(G)≥n. Here, we improve this result by showing that if G is a connected subcubic graph of order n≥8, then E(G)≥1.01n. Also, we prove that if G is a traceable subcubic graph of order n≥8, then E(G)>1.1n. Let G be a connected cubic graph of order n≥8, it is shown that E(G)>n+2. It was proved that if G is a connected cubic graph of order n, then E(G)≤1.65n. Also, in this paper we would like to present the best lower bound for the energy of a connected cubic graph. We introduce an infinite family of connected cubic graphs whose for... 

For a graph G the Sombor index of G is defined as (Formula Presented) , where d(u) is the degree of u in G. In the current paper, we study the structure of a graph with minimum Sombor index among all graphs with fixed order and fixed size. It is shown that in every graph with minimum Sombor index the difference between minimum and maximum degrees is at most 1. © 2022 University of Kragujevac, Faculty of Science. All rights reserved  

A graph G is called an odd (even) graph if for every vertex v ∈ V (G), dG(v) is odd (even). Let G be a graph of even order. Scott in 1992 proved that the vertices of every connected graph of even order can be partitioned into some odd induced forests. We denote the minimum number of odd induced subgraphs which partition V (G) by od(G). If all of the subgraphs are forests, then we denote it by odF (G). In this paper, we show that if G is a connected subcubic graph of even order or G is a connected planar graph of even order, then odF (G) ≤ 4. Moreover, we show that for every tree T of even order odF (T) ≤ 2 and for every unicyclic graph G of even order odF (G) ≤ 3. Also, we prove that if G is... 

In transportation literature, User Equilibrium (UE) has been widely studied since early 1950's, many studies of which define equilibrium flow of traffic for uncapacitated networks based on Wardrop's first principle, implying also a Nash Equilibrium (NE). Although, in general, the two equilibria (UE and NE) are not explicitly the same, they are shown to be equivalent under special conditions for uncapacitated UE, when volume delay functions are separable, continuous, non-decreasing and non-negative. A good deal of research is devoted to explain UE in capacitated networks based on Wardrop's first principle and the concept of generalized costs. However, UE for capacitated networks, even under... 

The trip demand information in the form of the origin-destination (OD) matrix is an essential input to the transportation studies. Obtaining such a matrix by conventional methods needs considerable amount of time, cost, and manpower. Since obtaining traffic volume data for the links of the transportation network is easy, recently many researchers have tried to obtain trip demand matrix by using this information. Among them, Spiess introduced the gradient method which is applicable for real large scale networks. The gradient method is an iterative procedure which starts from an initial O-D matrix and at each iteration tries to reach a matrix which generates flows closer to the observed flows... 

This paper describes the influence of a fractional melting process on the reduction of interdendritic phases, which in turn have an impact on the tensile strength of ZA-27 alloys. The procedure consists of compressing a semi-solid specimen through a porous grinding disc, resulting on coarsening of the dendritic phase, reduction of the microporosity and homogenization of the alloy. © 2002 Elsevier Science B.V. All rights reserved  

Low-speed wind tunnel experiments were conducted to examine the effects of jet exit behavior on the near-field characteristics of jets in crossflow. To better understand this problem, a row of six square jets were perpendicularly injected into the main turbulent flow. The jet-to-crossflow velocity ratios examined were 0.25, 0.5 and 1.0, while the jet spacing to jet diameter was 3.0. No significant temperature differences between the jet and the crossflow were introduced. The analysis of the vertical structure of the transverse jets, including focusing on the jet shear layer and the vorticity dynamics of the exiting jets, is complicated. The vorticity around the circumference of the jets was... 

The orthogonal array design has been used to determine the optimum conditions for gold recovery from Zarshuran refractory gold sulflde ore (Iran) by direct cyanidation and roasting-cyanidation. The Taguchi method was used as the experimental design to determine the optimum conditions of dissolution behavior of gold with cyanidation and roasting-cyanidation from Zarshuran refractory gold ore. The experimental conditions were studied in the range of 10-12 for pH, 20-40 for time(h), 400-1200 for cyanide content (g/ton) and 30 -40 for percent solid(%). Orthogonal array (OA) L9 (34) consisting of four parameters each with three levels, was chosen. From this study for direct cyanidation the total... 

Spectrum sensing is the basic step in cognitive radio networks. Its accuracy directly affects spectrum utilization. In this paper we propose a new method for blind cooperative spectrum sensing using spatial information. We model our sensing matrix as a graph, taking advantage of signal and spatial correlation of antennas. We prove that the general settings of the problem are hard to approximate. Taking spatial information into account, we propose a new scheme to find white space subregions. Cognitive radio users residing in the region may be able to transmit, but must keep their transmission power to the extent that no interference is caused to primary receivers out of the region