842 resultados para data movement problem
Resumo:
Cover title.
Resumo:
"Contract No. AT(40-1)-2077."
Resumo:
Cover has: Research series. Bulletin no. 21. California. Employment Stabilization Commission.
Resumo:
Mode of access: Internet.
Resumo:
Includes index.
Resumo:
A concept has been developed where characteristic load cycles of longwall shields can describe most of the interaction between a longwall support and the roof. A characteristic load cycle is the change in support pressure with time from setting the support against the roof to the next release and movement of the support. The concept has been validated through the back-analysis of more than 500 000 individual load cycles in five longwall panels at four mines and seven geotechnical domains. The validation process depended upon the development of new software capable of both handling the large quantity of data emanating from a modern longwall and accurately delineating load cycles. Existing software was found not to be capable of delineating load cycles to a sufficient accuracy. Load-cycle analysis can now be used quantitatively to assess the adequacy of support capacity and the appropriateness of set pressure for the conditions under which a longwall is being operated. When linked to a description of geotechnical conditions, this has allowed the development of a database for support selection for greenfield sites. For existing sites, the load-cycle characteristic concept allows for a diagnosis of strata-support problem areas, enabling changes to be made to set pressure and mining strategies to manage better, or avoid, strata control problems. With further development of the software, there is the prospect of developing a system that is able to respond to changes in strata-support interaction in real time.
Resumo:
The current trend among many universities is to increase the number of courses available online. However, there are fundamental problems in transferring traditional education courses to virtual formats. Delivering current curricula in an online format does not assist in overcoming the negative effects on student motivation which are inherent in providing information passively. Using problem-based learning (PBL) online is a method by which computers can become a tool to encourage active learning among students. The delivery of curricula via goal-based scenarios allows students to learn at different rates and can successfully shift online learning from memorization to discovery. This paper reports on a Web-based e-health course that has been delivered via PBL for the past 12 months. Thirty distance-learning students undertook postgraduate courses in e-health delivered via the Internet (asynchronous communication). Data collected via online student surveys indicated that the PBL format was both flexible and interesting. PBL has the potential to increase the quality of the educational experience of students in online environments.
Resumo:
In this paper a constructive method of data structures solving an array maintenance problem is offered. These data structures are defined in terms of a family of digraphs which have previously been defined, representing solutions for this problem. We present as well a prototype of the method in Haskell.
Resumo:
The strategy to control the noxious water hyacinth requires reliable data base on the magnitude of the weed problem. This report which presents up to date (1997) information on distribution, coverage and movement of the weed in Uganda is intended to provide this basis as suppliment to other inputs for control planning. The report is the first in a series being prepared by FIRI from results the "Water hyacinth. research project" whose major goal is to supply information needed to define and focus the scope of the control process for water hyacinth in view of the fact that the weed is to remain a permanent feature of the aquatic landscape of Uganda. Water hyacinth is firmly established in lakes Victoria, Kyoga Albert and along the River Nile, distributed in two distinct forms namely as stationary fringes the shoreline and as mobile mats and large "fields" usually found in sheltered bays.
Resumo:
2009
Resumo:
Universidade Estadual de Campinas . Faculdade de Educação Física
Resumo:
Universidade Estadual de Campinas. Faculdade de Educação Física
Resumo:
Universidade Estadual de Campinas . Faculdade de Educação Física
Resumo:
This study describes the sperm morphology of the mayfly Hexagenia (Pseudeatonica) albivitta (Ephemeroptera). Its spermatozoon measures approximately 30 μm of which 9 μm corresponds to the head. The head is composed of an approximately round acrosomal vesicle and a cylindrical nucleus. The nucleus has two concavities, one in the anterior tip, where the acrosomal vesicle is inserted and a deeper one at its base, where the flagellum components are inserted. The flagellum is composed of an axoneme, a mitochondrion and a dense rod adjacent to the mitochondrion. A centriolar adjunct is also observed surrounding the axoneme in the initial portion of the flagellum and extends along the flagellum for at least 2 μm, surrounding the axoneme in a half-moon shape. The axoneme is the longest component of the flagellum, and it follows the 9+9+0 pattern, with no central pair of microtubules. At the posterior region of the flagellum, the mitochondrion has a dumb-bell shape in cross sections that, together with the rectangular mitochondrial-associated rod, is responsible for the flattened shape of the flagellum. An internal membrane is observed surrounding both mitochondrion and its associated structure.
Resumo:
Hub-and-spoke networks are widely studied in the area of location theory. They arise in several contexts, including passenger airlines, postal and parcel delivery, and computer and telecommunication networks. Hub location problems usually involve three simultaneous decisions to be made: the optimal number of hub nodes, their locations and the allocation of the non-hub nodes to the hubs. In the uncapacitated single allocation hub location problem (USAHLP) hub nodes have no capacity constraints and non-hub nodes must be assigned to only one hub. In this paper, we propose three variants of a simple and efficient multi-start tabu search heuristic as well as a two-stage integrated tabu search heuristic to solve this problem. With multi-start heuristics, several different initial solutions are constructed and then improved by tabu search, while in the two-stage integrated heuristic tabu search is applied to improve both the locational and allocational part of the problem. Computational experiments using typical benchmark problems (Civil Aeronautics Board (CAB) and Australian Post (AP) data sets) as well as new and modified instances show that our approaches consistently return the optimal or best-known results in very short CPU times, thus allowing the possibility of efficiently solving larger instances of the USAHLP than those found in the literature. We also report the integer optimal solutions for all 80 CAB data set instances and the 12 AP instances up to 100 nodes, as well as for the corresponding new generated AP instances with reduced fixed costs. Published by Elsevier Ltd.