Spelling suggestions: "subject:"eomputer program"" "subject:"aomputer program""
291 |
Data-parallel programming with multiple inheritance on the connection machineGirimaji, Sanjay 01 April 1990 (has links)
The demand for computers is oriented toward faster computers and newer computers are being built with more than one CPU. These computers require sophisticated software to program them. One such approach to program the multiple CPU machines is through the use of object-oriented programming techniques. An example of such an approach is the use of C* on the Connection Machine.
Though C* supports many of the object-oriented concepts, it does not support the concept of software reuse through inheritance. This thesis introduces a new language called C*±+ , an extension of C* language to support inheritance. We also discuss the issues invloved in the implementation of multiple inheritance in programming languages.
This thesis describes the differences between C** and C* . It also discusses the various issues involved in the design and implementation of the translator from C** to C* . It also illustrates the advantages of programming in C*++ through an example. Since C*++ is designed to support software reuse which allows the users to create quality software in shorter time, it is anticipated that C*+ will have widespread use in programming the Connection Machine.
|
292 |
Natural feature extraction as a front end for simultaneous localization and mapping.Kiang, Kai-Ming, Mechanical & Manufacturing Engineering, Faculty of Engineering, UNSW January 2006 (has links)
This thesis is concerned with algorithms for finding natural features that are then used for simultaneous localisation and mapping, commonly known as SLAM in navigation theory. The task involves capturing raw sensory inputs, extracting features from these inputs and using the features for mapping and localising during navigation. The ability to extract natural features allows automatons such as robots to be sent to environments where no human beings have previously explored working in a way that is similar to how human beings understand and remember where they have been. In extracting natural features using images, the way that features are represented and matched is a critical issue in that the computation involved could be wasted if the wrong method is chosen. While there are many techniques capable of matching pre-defined objects correctly, few of them can be used for real-time navigation in an unexplored environment, intelligently deciding on what is a relevant feature in the images. Normally, feature analysis that extracts relevant features from an image is a 2-step process, the steps being firstly to select interest points and then to represent these points based on the local region properties. A novel technique is presented in this thesis for extracting a small enough set of natural features robust enough for navigation purposes. The technique involves a 3-step approach. The first step involves an interest point selection method based on extrema of difference of Gaussians (DOG). The second step applies Textural Feature Analysis (TFA) on the local regions of the interest points. The third step selects the distinctive features using Distinctness Analysis (DA) based mainly on the probability of occurrence of the features extracted. The additional step of DA has shown that a significant improvement on the processing speed is attained over previous methods. Moreover, TFA / DA has been applied in a SLAM configuration that is looking at an underwater environment where texture can be rich in natural features. The results demonstrated that an improvement in loop closure ability is attained compared to traditional SLAM methods. This suggests that real-time navigation in unexplored environments using natural features could now be a more plausible option.
|
293 |
Structured development of an asynchronous forth processor using trace theory.Newlands, D.A., mikewood@deakin.edu.au January 1989 (has links)
This thesis examines the use of a structured design methodology in the design of asynchronous circuits so that high level constructs can be specified purely in terms of signal exchanges and without the intrusion of lower level concepts. Trace theory is used to specify a multi-processor Forth machine at a high level then part of the design is further elaborated using trace theory operations to (insure that the behaviours of the lower level constructs will combine to give the high level specified behaviour without locking or other hazards. A novel form of threaded language to take advantage of the machine architecture is developed. At suitable points the design is tested by simulation. The stack element which is designed is reduced to an electric circuit which is itself tested by simulation to verify the design.
|
294 |
Fuzzy concepts and formal methods.Matthews, Chris, mikewood@deakin.edu.au January 2001 (has links)
It has been recognised that formal methods are useful as a modelling tool in requirements engineering. Specification languages such as Z permit the precise and unambiguous modelling of system properties and behaviour. However some system problems, particularly those drawn from the information systems problem domain, may be difficult to model in crisp or precise terms. It may also be desirable that formal modelling should commence as early as possible, even when our understanding of parts of the problem domain is only approximate. This thesis suggests fuzzy set theory as a possible representation scheme for this imprecision or approximation. A fuzzy logic toolkit that defines the operators, measures and modifiers necessary for the manipulation of fuzzy sets and relations is developed. The toolkit contains a detailed set of laws that demonstrate the properties of the definitions when applied to partial set membership. It also provides a set of laws that establishes an isomorphism between the toolkit notation and that of conventional Z when applied to boolean sets and relations. The thesis also illustrates how the fuzzy logic toolkit can be applied in the problem domains of interest. Several examples are presented and discussed including the representation of imprecise concepts as fuzzy sets and relations, system requirements as a series of linguistically quantified propositions, the modelling of conflict and agreement in terms of fuzzy sets and the partial specification of a fuzzy expert system. The thesis concludes with a consideration of potential areas for future research arising from the work presented here.
|
295 |
Distributed parallel computation using standard MLChattopadhyay, Vaishali, January 2007 (has links) (PDF)
Thesis (M.S. in computer science)--Washington State University, December 2007. / Includes bibliographical references (p. 97-102).
|
296 |
Lego TC logo as a learning environment in problem-solving in advanced supplementary level design & technology with pupils aged 16-19Lo, Ting-kau. January 1992 (has links)
Thesis (M.Ed.)--University of Hong Kong, 1992. / Includes bibliographical references (leaf 154-160). Also available in print.
|
297 |
Electra : integrating constraints, condition-based dispatching, and features exclusion into the multiparadigm language LedaZamel, Nabil M. 06 December 1994 (has links)
Multiparadigm languages are languages that are designed to support more than
one style of programming. Leda is a strongly-typed multiparadigm programming
language that supports imperative, functional, object-oriented, and logic programming.
The constraint programming paradigm is a declarative style of programming
where the programmer is able to state relationships among some entities and expect
the system to maintain the validity of these relationships throughout program execution.
The system accomplishes this either by invoking user-defined fixes that impose
rigid rules governing the evolution of the entities, or by finding suitable values to
be assigned to the constrained entities without violating any active constraint. Constraints,
due to their declarative semantics, are suitable for the direct mapping of the
characteristics of a number of mechanisms including: consistency checks, constraint-directed
search, and constraint-enforced reevaluation, among others. This makes
constraint languages the most appropriate languages for the implementation of a
large number of applications such as scheduling, planning, resource allocation, simulation,
and graphical user interfaces.
The semantics of constraints cannot be easily emulated by other constructs
in the paradigms that are offered by the language Leda. However, the constraint
paradigm does not provide any general control constructs. The lack of general control
constructs impedes this paradigm's ability to naturally express a large number
of problems. This dissertation presents the language Electra, which integrates the
constraint paradigm into the language Leda by creating a unified construct that
provides the ability to express the conventional semantics of constraints with some
extensions. Due to the flexibility of this construct, the programmer is given the
choice of either stating how a constraint is to be satisfied or delegating that task to
the constraint-satisfier. The concept of providing the programmer with the ability to
express system-maintained relations, which is the basic characteristic of constraints,
provided a motivation for enhancing other paradigms with similar abilities. The
functional paradigm is extended by adding to it the mechanism of condition-based
dispatching which is similar to argument pattern-matching. The object-oriented
paradigm is extended by allowing feature exclusion which is a form of inheritance
exception. This dissertation claims that the integration provided by the language
Electra will enable Leda programmers to reap the benefits of the paradigm of constraints
while overcoming its limitations. / Graduation date: 1995
|
298 |
Java bytecode compilation for high-performance, platform-independent logical inferenceArte, Ashish. Sturgill, David Brian. January 2005 (has links)
Thesis (M.S.)--Baylor University, 2005. / Includes bibliographical references (p. 146-148).
|
299 |
QUICKTALK: A Smalltalk-80 dialect for defining primitive methodsBallard, Mark B. 04 1900 (has links) (PDF)
M.S. / Computer Science & Engineering / QUICKTALK is a dialect of Smalltalk-80 that can be compiled directly into native machine code, instead of virtual machine bytecodes. The dialect includes "hints" on the class of method arguments, instance variables, and class variables. The dialect is designed to describe primitive Smalltalk methods. Improved performance over bytecodes is achieved by eliminating the interpreter loop on bytecode execution, by reducing the number of message send/returns via binding some target methods at compilation, and by eliminating redundant class checking. Changes to the Smalltalk- 80 system and compiler to support the dialect are identified and performance measurements are given.
|
300 |
Direct Fitting of Analytical Potential Functions to Diatomic Molecular Spectroscopic DataSeto, Jenning January 2000 (has links)
The standard practice of spectroscopic data reduction is generally to fit data to level energy expansions in terms of the vibrational and rotational quantum numbers. However, the utility of such expressions is limited because they extrapolate poorly and they need very large sets of parameters, many of which have no independent physical significance. One method of addressing these problems is to fit the spectroscopic data directly to analytical potential energy functions incorporating the natural physical behaviour of the molecule in question. Although there have been a number of successful applications of this approach, there are still certain problems associated with the types of potential forms being used. This thesis will explore some of these problems and determine how effective the potential forms being used are for a number of specific cases.
|
Page generated in 0.0474 seconds