Flue-cured tobacco, mechanization and labor : impacts of alternative production levels /

Mode of access: Internet.

Corn earworm rearing mechanization /

Issued Dec. 1976.

Progress of farm mechanization /

Cover title.

The mechanization, automation, and increased effectiveness of the clinical laboratory ; a status report.

Mode of access: Internet.

Automation of underground truck haulage

This paper reviews the state-of-the art in the automation of underground truck haulage. Past attemps at automating LHDs and haul trucks are described and their particular strengths and weaknesses are listed. We argue that the simple auto-tram...

Qualitative theorem proving in linear constraints

We know, from the classical work of Tarski on real closed fields, that elimination is, in principle, a fundamental engine for mechanized deduction. But, in practice, the high complexity of elimination algorithms has limited their use in the realization of mechanical theorem proving. We advocate qualitative theorem proving, where elimination is attractive since most processes of reasoning take place through the elimination of middle terms, and because the computational complexity of the proof is not an issue. Indeed what we need is the existence of the proof and not its mechanization. In this paper, we treat the linear case and illustrate the power of this paradigm by giving extremely simple proofs of two central theorems in the complexity and geometry of linear programming.

Selection of Optimal Time-to-go in Generalized Vector Explicit Guidance

A new method of selection of time-to-go (t(go)) for Generalized Vector Explicit Guidance (GENEX) law have been proposed in this paper. t(go) is known to be an important parameter in the control and cost function of GENEX guidance law. In this paper the formulation has been done to find an optimal value of t(go) that minimizes the performance cost. Mechanization of GENEX with this optimal t(go) reduces the lateral acceleration demand and consequently increases the range of the interceptor. This new formulation of computing t(go) comes in closed form and thus it can be implemented onboard. This new formulation is applied in the terminal phase of an surface-to-air interceptor for an angle constrained engagement. Results generated by simulation justify the use of optimal t(go).

Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

Management of inland capture fisheries and challenges in fish production in Nigeria

The paper critically examines the trend in fish production in Nigeria. The problem of excessive mismanagement and lack of attention by relevant agencies are still common place in inland water bodies. The paper discusses these mismanagement practices which are non compliance with the existing rules and regulations on good fishing methods, uncontrollable, unorthodox and obnoxious fishing practices, destruction of the natural breeding grounds and the collapse of the fishery due to massive over fishing. The challenges posed by the fishing methods as well as the effect of different gears and mechanization of fishing crafts on fish production are discussed. The paper recommends ways to increase domestic fish production in inland water bodies, which include a well planned strategy of restocking the existing reservoirs after careful scientific study, enforcement of the existing laws and regulation based on community participation. Training of stakeholders on the code of practice for responsible fisheries (CPRF), extension of subsidies to fisher folks, the traditional practices, which encourage the adherence to close season and other fish conservation and utilization strategies, are also advocated

Projetos de cuidado em Fisioterapia

As práticas de cuidado em fisioterapia, em muitas situações, resgatam a função do fisioterapeuta de executor de técnicas que lhe era atribuída nos primórdios da profissão. Ao exercer essa função meramente técnica, muitas vezes deixando-se substituir pelo equipamento nas suas ações, o profissional compromete o estabelecimento do vínculo terapeuta-paciente, contribuindo para o esvaziamento do encontro em saúde. Nessas situações, predomina o êxito técnico (a eficiência na realização do procedimento) sobre o sucesso prático (os benefícios trazidos para vida das pessoas). Para que o sucesso prático seja atingido, é fundamental que haja o questionamento sobre o que sonham as pessoas, profissionais e pacientes, para as suas vidas e para a saúde, quais são suas perspectivas e projetos de vida, seus projetos de felicidade. Nesse sentido, é imprescindível considerar, também, os projetos de felicidade dos profissionais da saúde enquanto sujeitos desse encontro. Afinal, é a partir deles que o profissional elabora o seu projeto de cuidado para cada paciente. Assim, esse trabalho buscou compreender os elementos que configuram a construção de projetos de cuidado em fisioterapia a partir da reflexão dos próprios fisioterapeutas. Para tanto, utilizou-se a metodologia qualitativa de pesquisa por meio de entrevistas semi-estruturadas para que fossem produzidas narrativas da história de vida do trabalho. Os discursos foram analisados integralmente e a categorização foi feita em três sub-temas: exercício profissional, relação com os pacientes e reflexões. Foi possível perceber que muitos dos arranjos de trabalho estabelecidos visam coibir o vínculo profissional-paciente, transformando-o em valor de troca e mercantilizando a relação terapêutica. Expropriada do vínculo, a prática se resume à realização de procedimentos independentes de sua finalidade, minando as possibilidades de sucesso prático. Nesse caso, não é a tecnologia que gera o afastamento e a mecanização, mas são as estratégias de mercantilização do cuidado fisioterápico. Essa situação só pode ocorrer por um processo de subordinação do profissional e seu saber, o que está fortemente associado a condições de trabalho exploratórias. Podemos dizer que a mercantilização do cuidado facilita a restrição sobre as condições de trabalho e também é fruto dela. O problema é que essa restrição é vista pelos profissionais como não definitiva, mas como um caminho para se alcançar reconhecimento na busca pelo exercício liberal da fisioterapia. A intenção desse estudo não foi traçar um plano normativo de conduta para a profissão, mas imaginamos que o equacionamento dessas questões passa necessariamente pelo reconhecimento, pelas inquietações e indignações com o problema. O que se espera, portanto, é facilitar esse processo de desconforto por meio da proximidade dessas questões trazidas pelas narrativas.

Transportation of fish in India: problems and prospects

India has a long coast line of about 4,800 km along which fish landing centers are scattered. Fish catches are showing an upward trend consequent on rapid mechanization of fishing crafts. Economic utilization of the landed fish is an essential prerequisite for the proper development of Indian fishing and fish processing industries.

The Development of Ceylon's fisheries (a symposium)

In July, 1964, it was decided that a Government Fisheries Corporation be set up. At the request of the Directors-designate of this Corporation a series of lectures on the development of Ceylon's fisheries was organised by the Fisheries Research Station, all except two being delivered at a seminar on 15th September, 1964. The speakers were asked to prepare and submit their texts and these are presented in the sequence in which the talks themselves were delivered: 1. Ceylon's fisheries: past and future (A.C.J. Weerekoon) 2. Fisheries by-products (C.St.E. Gunesekara) 3. The role of technology in fisheries development in Ceylon (N.N. De Silva) 4. Seaweeds (M. Durairatnam) 5. Coastal fisheries (T.P. Goonewardente) 6. The trawler fishery (A.S. Mendis) 7. A review of Japan's tuna long-line fishery in the Indian Ocean (K. Sivasubramaniam) 8. Off shore and deep sea fishery for larger scombroids in the Indian Ocean (K. Sivasubramaniam) 9. The development of fresh water fisheries in Ceylon (H.H.A. Indrasena) 10. Brackish-water fish farming in Ceylon (T.G. Pillai) 11. The role of inland waters in relation to the development of Ceylon's fisheries and a note on the pearl oyster fishery (C.H. Fernando) 12. The mechanization of the inshore fisheries and the relationship to fisheries development in Ceylon (E. Kvaran)

Comparative efficiencies of mechanized fishing crafts introduced in India

India started mechanization of fishing craft in early 1950. The traditional craft was subjected to technical scrutiny and some of them mechanized with good results. However, due to limitations inherent in the traditional craft, it was found necessary to develop new series of crafts suitable for the operation of modern fishing gears in areas hitherto unexplored. The impetus given to the development of infrastructure like freezing, canning and ice plants, and quickly expanding export market, increased the demand for marine products, hence craft for immediate, as well as long-term needs had to be introduced. In this article the author discusses design of fishing vessels, information from experience used in development of vessels, designs of distant water vessels, productivity studies, income and expenditure, economic values, production cost, and productivity.