This study investigated 1) whether the effect of teacher-developed graphic organizers vis-à-vis student-developed ones was more significant on improving intermediate EFL learners’ writing, and 2) whether the use of both graphic organizers had any impact on their writing. The participants were selected in two stages: 130 students sat for a piloted proficiency test. Those who scored above half of...

Graphic statics is undergoing a renaissance, with computerized visual representation becoming both easier and more spectacular as time passes. While methods of the past are revived, little emphasis has been placed on studying mathematics behind these methods. Due to considerable advances our mathematical understanding since birth graphic statics, we can learn lot by examining old from modern vi...

Let d = d1 ≤ d2 ≤ · · · ≤ dn be a non-decreasing sequence of n positive integers, whose sum is even. Let Gn,d denote the set of graphs with vertex set [n] = {1, 2, . . . , n} in which the degree of vertex i is di. Let Gn,d be chosen uniformly at random from Gn,d. It will be apparent from Section 4.3 that the sequences we are considering will all be graphic. We give a condition on d under which ...

This paper proposes a simple method for realizing a multi-screen immersive display using one PC with dual graphic cards and workflow on which CG creators can create animation movie. This method realizes a multi-screen immersive display without any special hard ware and engineering technology. We implement the non-interactive, non-stereo projection system which projects the integrated movie cons...

In this paper we provide two recognition algorithms for the class of signed-graphic matroids along with necessary and sufficient conditions for a matroid to be signed-graphic. Specifically, we provide a polynomial-time algorithm which determines whether a given binary matroid is signed-graphic and an algorithm which determines whether a general matroid given by an independece oracle is binary s...

There are many functions of the degree sequence of a graph which give lower bounds on the independence number of the graph. In particular, for every graph G, α(G) ≥ R(d(G)), where R is the residue of the degree sequence of G. We consider the precision of this estimate when it is applied to semi-regular degree sequences. We show that the residue nearly always gives the best possible estimate on ...

The purpose of the present study was to obtain detailed photographic sequences and lip motion data on which lip models for brass instruments may be more accurately based. The study expands upon an earlier study by Martin @J. Acoust. Soc. Am. 13, 305–307 ~1942!# by using advanced fiber-optic stroboscopy, a real instrument mouthpiece, and by studying two dynamic levels. The trombone was selected ...