A special case of the linear programming problem, the transportation problem, is the subject of this thesis. The development of a solution to the transportation problem is based on fundamental concepts from the theory of linear algebra and matrices.

No description available.

No description available.

No description available.

No description available.

The C programming language offers a high degree of control and freedom to programmers. This makes it a powerful tool, but it also gives the language a steep learning curve. One difficulty that many new C programmers face is in figuring out how to analyze and debug their code, as well as the output. There exists a variety of tools that can be used to assist in debugging. They can offer aid by identifying certain types of errors and by providing meaningful output that helps the user understand and correct those errors. The following seven debugging tools have been tested and analyzed in order to ascertain when and how each one of them might be most useful: Valgrind, GCC Address Sanitizer, Clang Address Sanitizer, Mtrace, Memwatch, Electric Fence, and Dmalloc. They have been tested using anonymous code submitted by actual students for C programming labs in order to see how many errors, and of which sort, each tool catches. The results of these tests, as well as their implications, are presented here.

by Chi-keung Luk. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1993. / Includes bibliographical references (leaves 169-174). / Preface --- p.xi / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Programming Languages --- p.2 / Chapter 1.2 --- Programming Paradigms --- p.2 / Chapter 1.2.1 --- What is a programming paradigm --- p.2 / Chapter 1.2.2 --- Which came first? Languages or paradigms? --- p.2 / Chapter 1.2.3 --- Overview of some paradigms --- p.4 / Chapter 1.2.4 --- A spectrum of paradigms --- p.6 / Chapter 1.2.5 --- Mulitparadigm systems --- p.7 / Chapter 1.3 --- The Objectives of this research --- p.8 / Chapter 2 --- "Studies of the object-oriented, the logic and the functional paradigms" --- p.10 / Chapter 2.1 --- The Object-Oriented Paradigm --- p.10 / Chapter 2.1.1 --- Basic components --- p.10 / Chapter 2.1.2 --- Motivations --- p.11 / Chapter 2.1.3 --- Some related issues --- p.12 / Chapter 2.1.4 --- Computational models for object-oriented programming --- p.16 / Chapter 2.2 --- The Functional Paradigm --- p.18 / Chapter 2.2.1 --- Basic concepts --- p.18 / Chapter 2.2.2 --- Lambda calculus --- p.20 / Chapter 2.2.3 --- The characteristics of functional programs --- p.21 / Chapter 2.2.4 --- Practicality of functional programming --- p.25 / Chapter 2.3 --- The Logic Paradigm --- p.28 / Chapter 2.3.1 --- Relations --- p.28 / Chapter 2.3.2 --- Logic programs --- p.29 / Chapter 2.3.3 --- The opportunity for parallelism --- p.30 / Chapter 2.4 --- Summary --- p.31 / Chapter 3 --- A survey of some existing multiparadigm languages --- p.32 / Chapter 3.1 --- Logic + Object-Oriented --- p.33 / Chapter 3.1.1 --- LogiC++ --- p.33 / Chapter 3.1.2 --- Intermission --- p.34 / Chapter 3.1.3 --- Object-Oriented Programming in Prolog (OOPP) --- p.36 / Chapter 3.1.4 --- Communication Prolog Unit (CPU) --- p.37 / Chapter 3.1.5 --- DLP --- p.37 / Chapter 3.1.6 --- Representing Objects in a Logic Programming Language with Scoping Constructs (OLPSC) --- p.39 / Chapter 3.1.7 --- KSL/Logic --- p.40 / Chapter 3.1.8 --- Orient84/K --- p.41 / Chapter 3.1.9 --- Vulcan --- p.42 / Chapter 3.1.10 --- The Bridge approach --- p.43 / Chapter 3.1.11 --- Discussion --- p.44 / Chapter 3.2 --- Functional + Object-Oriented --- p.46 / Chapter 3.2.1 --- PROOF --- p.46 / Chapter 3.2.2 --- A Functional Language with Classes (FLC) --- p.47 / Chapter 3.2.3 --- Common Lisp Object System (CLOS) --- p.49 / Chapter 3.2.4 --- FOOPS --- p.50 / Chapter 3.2.5 --- Discussion --- p.51 / Chapter 3.3 --- Logic + Functional --- p.52 / Chapter 3.3.1 --- HOPE --- p.52 / Chapter 3.3.2 --- FUNLOG --- p.54 / Chapter 3.3.3 --- F* --- p.55 / Chapter 3.3.4 --- LEAF --- p.56 / Chapter 3.3.5 --- Applog --- p.57 / Chapter 3.3.6 --- Discussion --- p.58 / Chapter 3.4 --- Logic + Functional + Object-Oriented --- p.61 / Chapter 3.4.1 --- Paradise --- p.61 / Chapter 3.4.2 --- LIFE --- p.62 / Chapter 3.4.3 --- UNIFORM --- p.63 / Chapter 3.4.4 --- G --- p.64 / Chapter 3.4.5 --- FOOPlog --- p.66 / Chapter 3.4.6 --- Logic and Objects (L&O) --- p.66 / Chapter 3.4.7 --- Discussion --- p.67 / Chapter 4 --- The design of a multiparadigm language I --- p.70 / Chapter 4.1 --- An Object-Oriented Framework --- p.71 / Chapter 4.1.1 --- A hierarchy of classes --- p.71 / Chapter 4.1.2 --- Program structure --- p.71 / Chapter 4.1.3 --- Parametric classes --- p.72 / Chapter 4.1.4 --- Inheritance --- p.73 / Chapter 4.1.5 --- The meanings of classes and methods --- p.75 / Chapter 4.1.6 --- Objects and messages --- p.75 / Chapter 4.2 --- The logic Subclasses --- p.76 / Chapter 4.2.1 --- Syntax --- p.76 / Chapter 4.2.2 --- Distributed inference --- p.76 / Chapter 4.2.3 --- Adding functions and expressions to logic programs --- p.77 / Chapter 4.2.4 --- State modelling --- p.79 / Chapter 4.3 --- The functional Subclasses --- p.80 / Chapter 4.3.1 --- The syntax of functions --- p.80 / Chapter 4.3.2 --- Abstract data types --- p.81 / Chapter 4.3.3 --- Augmented list comprehensions --- p.82 / Chapter 4.4 --- The Semantic Foundation of I Programs --- p.84 / Chapter 4.4.1 --- T1* : Transform functions into Horn clauses --- p.84 / Chapter 4.4.2 --- T2*: Transform object-oriented features into pure logic --- p.85 / Chapter 4.5 --- Exploiting Parallelism in I Programs --- p.89 / Chapter 4.5.1 --- Inter-object parallelism --- p.89 / Chapter 4.5.2 --- Intra-object parallelism --- p.92 / Chapter 4.6 --- Discussion --- p.96 / Chapter 5 --- An implementation of a prototype of I --- p.99 / Chapter 5.1 --- System Overview --- p.99 / Chapter 5.2 --- I-to-Prolog Translation --- p.101 / Chapter 5.2.1 --- Pass 1 - lexical and syntax analysis --- p.101 / Chapter 5.2.2 --- Pass 2 - Class Table Construction and Semantic Checking --- p.101 / Chapter 5.2.3 --- Pass 3 - Determination of Multiple Inheritance Precedence --- p.105 / Chapter 5.2.4 --- Pass 4 - Translation of the directive part --- p.110 / Chapter 5.2.5 --- Pass 5 - Creation of Prolog source code for an I object --- p.110 / Chapter 5.2.6 --- Using expressions in logic methods --- p.112 / Chapter 5.3 --- I-to-LML Translation --- p.114 / Chapter 5.4 --- The Run-time Handler --- p.117 / Chapter 5.4.1 --- Object Management --- p.118 / Chapter 5.4.2 --- Process Management and Message Passing --- p.121 / Chapter 6 --- Some applications written in I --- p.125 / Chapter 6.1 --- Modeling of a State Space Search --- p.125 / Chapter 6.2 --- A Solution to the N-queen Problem --- p.129 / Chapter 6.3 --- Object-Oriented Modeling of a Database --- p.131 / Chapter 6.4 --- A Simple Expert System --- p.133 / Chapter 6.5 --- Summary --- p.138 / Chapter 7 --- Conclusion and future work --- p.139 / Chapter 7.1 --- Conclusion --- p.139 / Chapter 7.2 --- Future Work --- p.141 / Chapter A --- Language manual --- p.146 / Chapter A.1 --- Introduction --- p.146 / Chapter A.2 --- Syntax --- p.146 / Chapter A.2.1 --- The lexical specification --- p.146 / Chapter A.2.2 --- The syntax specification --- p.149 / Chapter A3 --- Classes --- p.152 / Chapter A.4 --- Object Creation and Method Invocation --- p.153 / Chapter A.5 --- The logic Subclasses --- p.155 / Chapter A.6 --- The functional Subclasses --- p.156 / Chapter A.7 --- Types --- p.158 / Chapter A.8 --- Mutable States --- p.158 / Chapter B --- User's guide --- p.160 / Chapter B.1 --- System Calls --- p.160 / Chapter B.2 --- Configuration Parameters --- p.162 / Chapter B.3 --- Errors --- p.163 / Chapter B.4 --- Implementation Limits --- p.164 / Chapter B.5 --- How to install the system --- p.164 / Chapter B.6 --- How to use the system --- p.164 / Chapter B.7 --- How to recompile the system --- p.166 / Chapter B.8 --- Directory arrangement --- p.167 / Chapter C --- List of publications --- p.168 / Bibliography --- p.169

We discuss P#, our implementation of a tool which allows interoperation between a concurrent superset of the Prolog programming language and C#. This enables Prolog to be used as a native implementation language for Microsoft's .NET platform. P# compiles a linear logic extension of Prolog to C# source code. We can thus create C# objects from Prolog and use C#'s graphical, networking and other libraries. P# was developed from a modified port of the Prolog to Java translator, Prolog Cafe. We add language constructs on the Prolog side which allow concurrent Prolog code to be written. We add a primitive predicate which evaluates a Prolog structure on a newly forked thread. Communication between threads is based on the unification of variables contained in such a structure. It is also possible for threads to communicate through a globally accessible table. All of the new features are available to the programmer through new built-in Prolog predicates. We present three case studies. The first is an application which allows several users to modify a database. The users are able to disconnect from the database and to modify their own copies of the data before reconnecting. On reconnecting, conflicts must be resolved. The second is an object-oriented assistant, which allows the user to query the contents of a C# namespace or Java package. The third is a tool which allows a user to interact with a graphical display of the inheritance tree. Finally, we optimize P#'s runtime speed by translating some Prolog predicates into more idiomatic C# code than is produced by a naive port of Prolog Cafe. This is achieved by observing that semi-deterministic predicates (being those which always either fail or succeed with exactly one solution) that only call other semi-deterministic predicates enjoy relatively simple control flow. We make use of the fact that Prolog programs often contain predicates which operate as functions, and that such predicates are usually semi-deterministic.

Lei, Ka Man. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2013. / Includes bibliographical references (leaves 81-83). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts also in Chinese.

在日常生活中，我們經常會接觸到資料序列。例如機器所作出的每一個動作、模擬下的每一個狀態或是琴譜上的每一個音符，都是各種資料序列。當事情隨時間而不斷產生變化時，這些資料序列中便會有無限多個的資料。一般而言，許多問題都可建模為有限定義域的約束滿足問題。可是對於一些問題中有隨時間而產生變化的量值，在建模時便會面對很多困難。當這些問題被建模為約束滿足問題時，為了配合有限的定義域，我們通常只能把問題限制於一段固定的時間間隔中。然而，在許多情況下，很多有用的資訊會因我們的限制而流失。隨時間而變化的數值猶如一串無窮無盡的資料流。我們為此提出對無限資料串流作約束編程。無限長的資料串流使得在表示、處理和推理時，都產生一定的難度。我們設計了一套建模語育，當中包括用於資料串流的運算子。我們針對兩類資料串流集合:一些具有最終重覆樣式的串流干日一些可構成ω-正規語育的串流。根據這兩類資料串流集合的特性，我們提出兩種求解方法。當問題涉及具有最終重覆樣式的串流時，我們會把問題分割成一系列無限個有限定義域的子問題，並把子問題逐一求解出來。而當問題的所有解可構成ω-正規語言時，我們會以搜尋樹來求解，並在過程中規避一些相等於己搜尋的空間。以這方法得出的搜尋圖，其形狀同構於用以表達所有解的自動機。同時，我們亦透過定義從最終重覆樣式的串流中得出偏好值的函數，以便對無限資料串流作約束優化。在求解中藉由執行一致性概念，我們可以減少搜尋空間。我們實作了一個求解程式，用以把問題從建模語言中建立模形，並且求得解答。從一些以模擬問題及生產音樂的實驗可以印證，我們所提出對無限資料串流作約束編程的建模及解決方法的可行性。 / Sequences of data items can be found in many daily life problems. Examples are the actions of a controller in each step, states of a simulation, and notes in a piece of music. When the problems go on forever, the sequences become infinite. While many problems can be modeled as finite domain constraint satisfaction problems (CSPs), it is difficult to model problems which contain timevarying quantities over discrete time points. The constrained variables thus usually represent only a limited scope of the quantities in a finite time interval. As a result, some useful information may be lost. Time varying-quantities in the problems resemble streams of data over discrete time points. We propose constraint programming on infinite data streams. The infinite nature of streams raises difficulties in representation, manipulation, and reasoning. We design a modeling language to specify the problems. Operators are adopted to manipulate the stream values. We identify two classes of stream sets: streams with ultimately periodic patterns and streams that form an ω-regular language. According to the structure of stream sets, we propose different solution techniques to solve the CSPs. A problem involving ultimately periodic streams is divided into an infinite sequence of finite domain sub-problems. We solve the sub-problems in the sequence iteratively. A problem with solution set forming an ω-regular language is solved by tree search which avoids searching indefinitely in an infinite domain by detecting equivalent visited search space. The resultant search graph is isomorphic to an automaton representing the solution set. Optimization on the problems is made possible with a measurement of preferences on ultimately periodic streams. Consistency notions are enforced during search to reduce search space. We implement a solver to interpret and solve the problems with stream variables. Experiments on problems in some simulations and music generation are conducted to show the feasibility of modeling and solving the stream CSPs. / Detailed summary in vernacular field only. / Siu, Fai Keung. / "October 2012." / Thesis (Ph.D.)--Chinese University of Hong Kong, 2013. / Includes bibliographical references (leaves 115-119). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Constraint Satisfaction and Constraint Optimization --- p.1 / Chapter 1.2 --- Infinite Data Streams --- p.2 / Chapter 1.3 --- Motivations and Goals --- p.3 / Chapter 1.4 --- Overview of the Thesis --- p.4 / Chapter 2 --- Background --- p.6 / Chapter 2.1 --- Constraint Satisfaction Problems --- p.6 / Chapter 2.1.1 --- Backtracking Tree Search --- p.8 / Chapter 2.1.2 --- Consistency Notions --- p.12 / Chapter 2.2 --- Constraint Optimization Problems --- p.15 / Chapter 2.3 --- Regular Languages and Finite State Automata --- p.20 / Chapter 2.4 --- Infinite Data Streams --- p.22 / Chapter 2.4.1 --- Pointwise Operators --- p.23 / Chapter 2.4.2 --- Temporal Operators --- p.24 / Chapter 3 --- Constraint Satisfaction on Ultimately Periodic Streams --- p.26 / Chapter 3.1 --- Stream Constraint Satisfaction Problem --- p.26 / Chapter 3.1.1 --- Stream Variables and Stream Variable Domains --- p.26 / Chapter 3.1.2 --- Stream Constraints --- p.27 / Chapter 3.1.3 --- Stream CSP --- p.28 / Chapter 3.2 --- Ultimately Periodic Streams --- p.31 / Chapter 3.3 --- Solving St-CSPs for UP Solutions --- p.35 / Chapter 3.3.1 --- Translation Scheme --- p.38 / Chapter 3.3.2 --- Excluding Solutions in Non-canonical Form --- p.42 / Chapter 3.4 --- Modeling Examples and Experiments --- p.44 / Chapter 3.4.1 --- The Game of Life --- p.46 / Chapter 3.4.2 --- The n-Puzzle Problem --- p.50 / Chapter 3.4.3 --- The Traffic Light Problem --- p.55 / Chapter 4 --- Stream Constraint Satisfaction for Omega-Regular Solution Sets --- p.60 / Chapter 4.1 --- Stream Constraint Satisfaction Problem --- p.60 / Chapter 4.2 --- Solving St-CSPs for Omega-Regular Solution Sets --- p.63 / Chapter 4.2.1 --- Search Tree --- p.63 / Chapter 4.2.2 --- Instantaneous CSP --- p.64 / Chapter 4.2.3 --- Search Algorithm --- p.65 / Chapter 4.2.4 --- Solution Sets of St-CSPs --- p.66 / Chapter 4.2.5 --- Primitive Stream Constraints --- p.69 / Chapter 4.3 --- Consistency Algorithm --- p.76 / Chapter 4.4 --- Modeling Examples and Experiments --- p.79 / Chapter 4.4.1 --- Simulation of Juggling --- p.79 / Chapter 4.4.2 --- Digit Invader Game --- p.82 / Chapter 4.4.3 --- Towards Generating Jazzy Harmonization --- p.83 / Chapter 5 --- Stream Constraint Optimization --- p.86 / Chapter 5.1 --- Infinite Streams as Domain of Objective Function --- p.86 / Chapter 5.1.1 --- Straight Line Representation of Cumulative Sum of Datons --- p.87 / Chapter 5.1.2 --- Trend Comparison --- p.94 / Chapter 5.2 --- Constraint Optimization on Ultimately Periodic Streams --- p.96 / Chapter 5.3 --- Modeling Examples and Experiments --- p.98 / Chapter 5.3.1 --- The Game of Life --- p.101 / Chapter 5.3.2 --- The n-Puzzle Problem --- p.101 / Chapter 5.3.3 --- The Traffic Light Problem --- p.103 / Chapter 5.4 --- Alternative Objective Functions --- p.105 / Chapter 6 --- Related Work --- p.108 / Chapter 6.1 --- Model Checking --- p.108 / Chapter 6.2 --- Dynamic Constraint Satisfaction Problems --- p.109 / Chapter 6.3 --- Cyclic Scheduling --- p.109 / Chapter 6.4 --- Dataflow Programming Language --- p.110 / Chapter 7 --- Concluding Remarks --- p.112 / Chapter 7.1 --- Contributions --- p.112 / Chapter 7.2 --- Future Work --- p.114 / Bibliography --- p.115