996 resultados para program verification
Resumo:
The purpose of this paper is to examine the extent to which the existing US Coastal Zone Management (CZM) program represents Integrated Coastal Management (ICM). The actions taken at Rio de Janeiro in June 1992 as part of the United Nations Conference on Environment and Development (UNCED) could eventually impact the policies of the US in such a way as to encourage better integration of US coastal and ocean management efforts.
Resumo:
National Laboratory for Parallel and Distributed Processing; The University of Hong Kong
Resumo:
Association for Computing Machinery, ACM; IEEE; IEEE Computer Society; SIGSOFT
Resumo:
The glass transition temperatures (T-g) of PS/PPO blends with different compositions were studied under various pressures by means of a PVT-100 analyzer. A general relation of T-g and pressure of the PS/PPO system was deduced by fitting the experimental T-g's. Couchman volume-based equation was testified with the aid of those data. It was found that the experimental T-g's do not obey the Couchman equation of glass transition temperature based on thermodynamic theory. According to our studies, the major reason of the deviation is caused by the neglect of DeltaV(mix). (C) 2001 Published by Elsevier Science Ltd.
Resumo:
Ill-health prevails in the workplace. A key problem encountered in the area of stress management is a lack of research into the way job burnout turns into mental problems, especially depressive symptoms, the most prevalent and costly psychiatric condition in the workplace. This research belongs to a cross-discipline area of industrial psychiatry and organizational behavior, which has seldom been investigated before. This research will contribute to the theoretical development of organizational behavior, especially to stress management and industrial psychiatry. This study aims to explore etiological factors and mechanisms of depressive symptoms of workers in the financial industry. By using literature review, semi-structured interviews and surveys as the major research methods, this Ph.D. study systematically investigated the risk factors of workers’ depressive symptoms within and outside of the work area. These risk factors are worker-work environment fits, work family conflicts, and workers’ psychological vulnerabilities to depression. A thorough literature review and 20 semi-structured interviews of brokers in different kinds of financial markets show the feasibility and necessity of this Ph.D. study when it comes to the issue of financial workers’ depressive symptoms. Two surveys of workplace-etiological factors of depressive symptoms were conducted among 244 financial workers and 1024 financial workers. This cross-sample verification showed that worker-work environment fit was a good framework to study risk factors of workers’ depressive symptoms. Results revealed that job demands-abilities misfit could lead to job burnout which in turn contributed to worker’s depressive symptoms; besides this, work effort-reward imbalance could directly cause workers’ depressive symptoms. Emotional labor enhanced the positive effect of job burnout on workers’ depressive symptoms. In the third study, a prominent risk factor outside of the work area, namely work family conflict, and workers’ psychological vulnerabilities of depression were included with workplace etiological factors to investigate the overall predictive model of depressive symptoms of financial workers. The survey was conducted among the same 1024 financial workers. Results indicated that work effort-reward imbalance, job burnout and work interfering in family life were three external etiological factors of workers’ depressive symptoms. Neuroticism, autonomy and low emotional intelligence were three individual etiological factors which had a positive effect on workers’ depressive symptoms. Moreover, neuroticism enhanced the relationship between job burnout and depressive symptoms as well as between work interfering in family life and depressive symptoms. Autonomy aggravated the relationship between job burnout and depressive symptoms. However, emotional intelligence attenuated the relationship between job burnout and depressive symptoms as well as between work effort-reward imbalance and depressive symptoms. Besides, workers’ dysfunctional attitudes played a partial mediating role in the relationships between above etiological factors and depressive symptoms. In the same sample, research evidence of impairments of workers’ depressive symptoms to their work-life quality was also obtained. Specifically, depressive symptoms could predict workers’ presenteeism, absenteeism and turnover intention. Their subjective well-being was also lowered when suffering more severe depressive symptoms. This research provides a theoretical basis to management practices targeted to set up the Employee Assistance Program or even more specilised rehabilitation programs for workers with depressive symptoms so as to improve their work-life quality and and establish a harmonious enterprise.
Resumo:
Recognizing standard computational structures (cliches) in a program can help an experienced programmer understand the program. We develop a graph parsing approach to automating program recognition in which programs and cliches are represented in an attributed graph grammar formalism and recognition is achieved by graph parsing. In studying this approach, we evaluate our representation's ability to suppress many common forms of variation which hinder recognition. We investigate the expressiveness of our graph grammar formalism for capturing programming cliches. We empirically and analytically study the computational cost of our recognition approach with respect to two medium-sized, real-world simulator programs.
Resumo:
Introducing function sharing into designs allows eliminating costly structure by adapting existing structure to perform its function. This can eliminate many inefficiencies of reusing general componentssin specific contexts. "Redistribution of intermediate results'' focuses on instances where adaptation requires only addition/deletion of data flow and unused code removal. I show that this approach unifies and extends several well-known optimization classes. The system performs search and screening by deriving, using a novel explanation-based generalization technique, operational filtering predicates from input teleological information. The key advantage is to focus the system's effort on optimizations that are easier to prove safe.
Resumo:
The key to understanding a program is recognizing familiar algorithmic fragments and data structures in it. Automating this recognition process will make it easier to perform many tasks which require program understanding, e.g., maintenance, modification, and debugging. This report describes a recognition system, called the Recognizer, which automatically identifies occurrences of stereotyped computational fragments and data structures in programs. The Recognizer is able to identify these familiar fragments and structures, even though they may be expressed in a wide range of syntactic forms. It does so systematically and efficiently by using a parsing technique. Two important advances have made this possible. The first is a language-independent graphical representation for programs and programming structures which canonicalizes many syntactic features of programs. The second is an efficient graph parsing algorithm.
Resumo:
Artificial Intelligence research involves the creation of extremely complex programs which must possess the capability to introspect, learn, and improve their expertise. Any truly intelligent program must be able to create procedures and to modify them as it gathers information from its experience. [Sussman, 1975] produced such a system for a 'mini-world'; but truly intelligent programs must be considerably more complex. A crucial stepping stone in AI research is the development of a system which can understand complex programs well enough to modify them. There is also a complexity barrier in the world of commercial software which is making the cost of software production and maintenance prohibitive. Here too a system which is capable of understanding complex programs is a necessary step. The Programmer's Apprentice Project [Rich and Shrobe, 76] is attempting to develop an interactive programming tool which will help expert programmers deal with the complexity involved in engineering a large software system. This report describes REASON, the deductive component of the programmer's apprentice. REASON is intended to help expert programmers in the process of evolutionary program design. REASON utilizes the engineering techniques of modelling, decomposition, and analysis by inspection to determine how modules interact to achieve the desired overall behavior of a program. REASON coordinates its various sources of knowledge by using a dependency-directed structure which records the justification for each deduction it makes. Once a program has been analyzed these justifications can be summarized into a teleological structure called a plan which helps the system understand the impact of a proposed program modification.
Resumo:
A program was written to solve calculus word problems. The program, CARPS (CALculus Rate Problem Solver), is restricted to rate problems. The overall plan of the program is similar to Bobrow's STUDENT, the primary difference being the introduction of "structures" as the internal model in CARPS. Structures are stored internally as trees. Each structure is designed to hold the information gathered about one object. A description of CARPS is given by working through two problems, one in great detail. Also included is a critical analysis of STUDENT.
Resumo:
SIR is a computer system, programmed in the LISP language, which accepts information and answers questions expressed in a restricted form of English. This system demonstrates what can reasonably be called an ability to "understand" semantic information. SIR's semantic and deductive ability is based on the construction of an internal model, which uses word associations and property lists, for the relational information normally conveyed in conversational statements. A format-matching procedure extracts semantic content from English sentences. If an input sentence is declarative, the system adds appropriate information to the model. If an input sentence is a question, the system searches the model until it either finds the answer or determines why it cannot find the answer. In all cases SIR reports its conclusions. The system has some capacity to recognize exceptions to general rules, resolve certain semantic ambiguities, and modify its model structure in order to save computer memory space. Judging from its conversational ability, SIR, is a first step toward intelligent man-machine communication. The author proposes a next step by describing how to construct a more general system which is less complex and yet more powerful than SIR. This proposed system contains a generalized version of the SIR model, a formal logical system called SIR1, and a computer program for testing the truth of SIR1 statements with respect to the generalized model by using partial proof procedures in the predicate calculus. The thesis also describes the formal properties of SIR1 and how they relate to the logical structure of SIR.
Resumo:
A computer program, named ADEPT (A Distinctly Empirical Prover of Theorems), has been written which proves theorems taken from the abstract theory of groups. Its operation is basically heuristic, incorporating many of the techniques of the human mathematician in a "natural" way. This program has proved almost 100 theorems, as well as serving as a vehicle for testing and evaluating special-purpose heuristics. A detailed description of the program is supplemented by accounts of its performance on a number of theorems, thus providing many insights into the particular problems inherent in the design of a procedure capable of proving a variety of theorems from this domain. Suggestions have been formulated for further efforts along these lines, and comparisons with related work previously reported in the literature have been made.