 |
 | ftp://ftp.cs.ust.hk/pub/comp101/outline.ps, 19940302
COMP 101 Computing Fundamentals Spring, 1994 Instructors: Dr.Scott Deerwester Section: L1 Room: 3559 Telephone: 6985 Email: scott@cs.ust.hk Of ce hours: Monday,14:30 15:30 and by email appointment Research area: Information retrievaland analysis Personal interests: Weight lifting, music Dr.AlexKean |
| ftp://ftp.cs.ust.hk/pub/techreport/93/tr93-9.ps.gz, 19940306
Aligning Parallel English-Chinese Texts Statistically with Lexical Criteria Dekai Wu Technical Report HKUST-CS93-9 August 1993 Department of Computer Science The Hong Kong University of Science & Technology Clear Water Bay, Kowloon, Hong Kong dekai@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/techreport/93/tr93-11.ps.gz, 19940306
Complex, Complex Enough, Too Complex A Comparison of Dynamical Neural Models Michael Stiber , Jos e P. Segundo , Eric Altshuler , and Nikola Jurisic Technical Report HKUST-CS93-11 October 1993 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, |
| ftp://ftp.cs.ust.hk/pub/techreport/93/tr93-12.ps.gz, 19940306
Theoretical Analysis of Constructive Neural Networks Tin-Yau Kwok & Dit-Yan Yeung Technical Report HKUST-CS93-12 November 1993 Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon Hong Kong |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-1.ps.gz, 19940306
Visual Language for Behavioral Specifications of Reactive Systems Lewis H. Chau Gary K. Chan lewis@cs.ust.hk csckk@cs.ust.hk Department of Computer Science Hong Kong University of Science & Technology Clear Water Bay, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/techreport/93/tr93-7.ps.gz, 19940306
Learning In Neural Models With Complex Dynamicsz Michael Stiber and Jos e P. Segundoy Technical Report HKUST-CS93-7 April 1993 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong yDepartment of Anatomy and Cell Biology and Brain Research |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-3.ps.gz, 19940306
A Computational Theory of Decision Networks Nevin Lianwen Zhang Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong February 17, 1994 |
| ftp://ftp.cs.ust.hk/pub/techreport/93/tr93-5.ps.gz, 19940306
Arnol d Map Synthesis for Periodically Forced Oscillators z Michael Stiber and W. J. Karplusy Technical Report HKUST-CS93-5 March 1993 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong yComputer Science Department University of |
| ftp://ftp.cs.ust.hk/pub/techreport/93/tr93-4.ps.gz, 19940306
A Formal Characterization of A Domain Independent Abductive Reasoning Systemy Alex Kean Technical Report HKUST-CS93-4 November 17, 1993 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong yThis report is a revised version of the author's |
| ftp://ftp.cs.ust.hk/pub/techreport/93/tr93-2.ps.gz, 19940306
Asynchronous Consistency Restoration under Epsilon Serializability Pamela Drew1 Dept. of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong email: pam@cs.ust.hk Calton Pu Dept. of Computer Science and Engineering Oregon Graduate Institute 19600 N.W. von |
| ftp://ftp.cs.ust.hk/pub/techreport/93/tr93-15.ps.gz, 19940306
Developing a Dynamic Mechanism for Conceptual Clustering in an OODBMS Qing Li and Man Sheung Yuen, Michelle Technical Report HKUST-CS93-15 December 1993 Department of Computer Science Hong Kong University of Science & Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/techreport/93/tr93-8.ps.gz, 19940306
Biological Computation: Neurons, Networks, and Nonlinear Dynamics Michael Stiber , Jos e P. Segundo, Taishin Nomura, Shunsuke Sato, Shinji Doi, and Jean-Fran cois Vibert Technical Report HKUST-CS93-X August 1993 Department of Computer Science The Hong Kong University of Science and Technology Clear |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-5.ps.gz, 19940309
Han Character Font Sharing Across Incompatible Bitmap File Formats Man-Chi Pong 1 & Fung Fung Lee 2 & Ricky Yeung 3 & Yongguang Zhang 4 Technical Report HKUST-CS94-5 March 1994 1 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-4.ps.gz, 19940309
The Management of Interdependent Asynchronous Transactions in Heterogeneous Database Environments Lyman Do and Pamela Drew1 Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong email: flyman, pamg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-6.ps.gz, 19940310
Transient Responses in Dynamical Neural Models Michael Stiber and Jos e P. Segundo Technical Report HKUST-CS94-6 March 1994 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong Department of Anatomy and Cell Biology and Brain Research |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-7.ps.gz, 19940311
A Corrigendum for the Optimized-IPIA by ALEX KEAN and GEORGE TSIKNIS Technical Report TR94-7 A Corrigendum for the Optimized-IPIA ALEX KEAN KEAN@CS.UST.HK Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong GEORGE TSIKNIS |
| ftp://ftp.cs.ust.hk/pub/lzhang/canai94.ps.gz, 19940315
A simple approach to Bayesian network computations Nevin Lianwen Zhang Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong David Poole Department of Computer Science University of British Columbia Vancouver, B.C., V6T 1Z2, Canada |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-8.ps.gz, 19940317
A Probabilistic Query Language Beat W uthrich The Hong Kong University of Science and Technology Clear Water Bay Kowloon, Hong Kong e-mail: beat@cs.ust.hk phone: (852) 358 7013 fax: (852) 358 1477 March 16, 1994 Abstract1 We define a new query language for data and knowledge bases. This language is able |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-2.ps.gz, 19940511
Knowledge Discovery in Databases Beat W uthrich The Hong Kong University of Science and Technology Clear Water Bay Kowloon, Hong Kong e-mail: beat@cs.ust.hk phone: (852) 358 7013 fax: (852) 358 1477 May 11, 1994 |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-2A.ps.gz, 19940511
Knowledge Discovery in Databases Beat W uthrich The Hong Kong University of Science and Technology Clear Water Bay Kowloon, Hong Kong e-mail: beat@cs.ust.hk phone: (852) 358 7013 fax: (852) 358 1477 May 11, 1994 |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-2B.ps.gz, 19940511
31 Company Turnover Profitability(%) A 800 8 B 860 14 C 620 18 D 1460 6 E 450 12 F 1600 5 Figure 11: An example of a (relational) table. 2.1 FQL We start introducing FQL . Consider a manager who is posed the problem of a cash surplus and who thus considers the acquisition of another company. Suppose the |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-9.ps.gz, 19940526
Widest Empty Corridor with Multiple Links and Right-angle Turns Siu-Wing Cheng Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-10B.ps.gz, 19940701
Synaptic Coding of Time-Varying Spike Trains Michael Stiber , Li Yan , and Jos e P. Segundo Technical Report HKUST-CS94-10 June 1994 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong Department of Anatomy and Cell Biology and Brain |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-10A.ps.gz, 19940701
Time-Varying Neural Inputs Michael Stiber , Li Yan , Jos e P. Segundo , and Jean-Franc ois Vibert Technical Report HKUST-CS94-10 June 1994 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong Department of Anatomy and Cell Biology and |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-10C.ps.gz, 19940701
Frequency-Modulated Neural Inputs and an Alphabet for Synaptic Coding Michael Stiber , Li Yan , Jos e P. Segundo , and Jean-Franc ois Vibert Technical Report HKUST-CS94-10 June 1994 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-11.ps.gz, 19940701
Managing Time and Uncertainty Beat W uthrich The Hong Kong University of Science and Technology Clear Water Bay Kowloon, Hong Kong e-mail: beat@cs.ust.hk phone: (852) 358 7013 fax: (852) 358 1477 June 29, 1994 |
| ftp://ftp.cs.ust.hk/pub/scc/icse94.ps.gz, 19940713
(To be published in the 16th IEEE International Conference on Software Engineering, Sorrento, Italy, May 1994) An Integrated Method for Effective Behaviour Analysis of Distributed Systems (Research Paper) S.C. Cheung J. Kramer Department of Computing, Imperial College 180 Queen s Gate, London SW7 2BZ, |
| ftp://ftp.cs.ust.hk/pub/scc/sigsoft93.ps.gz, 19940713
( To Appear in the Proc. ACM SIGSOFT'93: Symposium on the Foundations of Software Engineering, Los Angeles, California, December 1993) 1 Enhancing Compositional Reachability Analysis with Context Constraints S.C. Cheung J. Kramer Department of Computing Imperial College of Science, Technology and |
| ftp://ftp.cs.ust.hk/pub/scc/tse94.ps.gz, 19940713
Tractable Dataflow Analysis for Distributed Systems1 Shing Chi CHEUNG Jeff KRAMER Department of Computing Imperial College of Science, Technology and Medicine 180 Queen's Gate, London, SW7 2BZ, UK Email: {scc, jk}@doc.ic.ac.uk Technical Report: DoC 94/8 20th April 1994 |
| ftp://ftp.cs.ust.hk/pub/scc/esec93.ps.gz, 19940713
(To be published in the Proc. of the 4th European Software Engineering Conference ESEC'93.) Tractable Flow Analysis for Anomaly Detection in Distributed Programs S.C. Cheung J. Kramer Department of Computing, Imperial College of Science, Technology and Medicine 180 Queen's Gate, London SW7 2BZ, UK. |
| ftp://ftp.cs.ust.hk/pub/scc/ase95.ps.gz, 19940720
1 Contextual Local Analysis for Design of Distributed Systems Shing Chi Cheung Jeff Kramer Department of Computer Science Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong Department of Computing Imperial College of Science, Technology and Medicine, London SW7 2BZ, UK |
| ftp://ftp.cs.ust.hk/pub/dekai/pacling93.Wu.ps.Z, 19940924
In PACLING-93, 1st Conf. of the Pacific Association for Computational Linguistics, Vancouver: Apr. 93, 323{332. An Image-Schematic System of Thematic Roles Dekai Wu Department of Computer Science The Hong Kong University of Science & Technology Clear Water Bay, Hong Kong dekai@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/dekai/ijcai93.Wu.ps.Z, 19940924
In IJCAI-93, 13th International Joint Conference on Artificial Intelligence, Chamberry, France: Aug. 93, 1290 1296. Approximating Maximum-Entropy Ratings for Evidential Parsing and Semantic Interpretation Dekai Wu Department of Computer Science The Hong Kong University of Science & Technology Clear |
| ftp://ftp.cs.ust.hk/pub/dekai/aaai93.Wu.ps.Z, 19940924
In AAAI-93, 11th National Conference on Artificial Intelligence, Washington, D.C.: Jul. 93, 790 795. Estimating Probability Distributions over Hypotheses with Variable Unification Dekai Wu Department of Computer Science The Hong Kong University of Science & Technology Clear Water Bay, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/dekai/tr93.Wu.ps.Z, 19940924
Aligning Parallel English-Chinese Texts Statistically with Lexical Criteria Dekai Wu Technical Report HKUST-CS93-9 August 1993 Department of Computer Science The Hong Kong University of Science & Technology Clear Water Bay, Kowloon, Hong Kong dekai@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/ahmad/CPE/review-form.ps, 19941028
Concurrency: Practice and Experience Review Form (Please return by December 25, 1994) Reviewer s name and affiliation: (will be withheld from authors) _______________________________________________________________________________ Paper#: Referee #: Title: Author(s): |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-13.ps.gz, 19941114
1 An Architecture for Homogenizing Federated Databases Kamalakar Karlapalem Qing Li Chung-Dak Shum Technical Report HKUST-CS94-13 July 1994 2 An Architecture for Homogenizing Federated Databases Kamalakar Karlapalem Qing Li Chung-Dak Shum Department of Computer Science Hong Kong University of Science |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-18.ps.gz, 19941114
Countermeasures and Tradeoffs for a Class of Covert Timing Channels James W. Gray, III 1 Hong Kong University of Science and Technology |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-39.ps.gz, 19941216
Document Ranking on Weight-Partitioned Signature Files Dik Lun Lee and Liming Reny Technical Report HKUST-CS94-39 December 16, 1994 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong yDepartment of Computer and Information Science The |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-38.ps.gz, 19941219
Auto-associative Learning of On-line Handwriting using Recurrent Neural Networks Dit-Yan Yeung, Kei-Wai Yeung Technical Report HKUST-CS94-38 November 1994 Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon Hong Kong Tel: +852-2-358-6977 Fax: |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-37.ps.gz, 19941219
ASCOC: A Recurrent Neural Network Model for Grammatical Inference Dit-Yan Yeung, Kei-Wai Yeung Technical Report HKUST-CS94-37 September 1994 Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon Hong Kong Tel: +852-2-358-6977 Fax: +852-2-358-1477 |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-4.revised.ps.gz, 19950124
The Management of Interdependent Asynchronous Transactions in Heterogeneous Database Environments1 Lyman Do and Pamela Drew2 Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong email: flyman, pamg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-36.ps.gz, 19950124
Information Filtering for Planning in Partially Observable Stochastic Domains Nevin Lianwen Zhang and Brent Boerlagey Technical Report HKUST-CS94-36 January 24, 1995 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong yGeneral Reasoning # |
| ftp://ftp.cs.ust.hk/pub/pam/formalism.ps.gz, 19950130
Formal Description of Local Asynchronous Updates in Multidatabase Environmentsy Lyman Do and Pamela Drew Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong email: flyman, pamg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-04.ps.gz, 19950208
Knowledge Discovery in Databases Beat W uthrich The Hong Kong University of Science and Technology Clear Water Bay Kowloon, Hong Kong e-mail: beat@cs.ust.hk phone: (852) 2358 7013 fax: (852) 2358 1477 February 3, 1995 1 |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-03.ps.gz, 19950213
1 Compositional Reachability Analysis of Finite-State Distributed Systems with User-Specified Constraints Shing-chi Cheung* and Jeff Kramer Technical Report HKUST-CS95-3 January 1995 *Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/techreport/92/tr92-5.ps.gz, 19950213
Dynamics of Synaptic Transfer in Living and Simulated Neuronsz Michael Stiber and Jos e P. Segundoy Technical Report HKUST-CS92-5 October 1992 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong yDepartment of Anatomy and Cell Biology and |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-02.ps.gz, 19950213
Integrated Behaviour Analysis of Distributed Systems Shing-chi Cheung* and Jeff Kramer Technical Report HKUST-CS95-2 January 1995 *Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong (email: scc@cs.ust.hk) Department of Computing The |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-01.ps.gz, 19950213
Active Database Management of Global Data Integrity Constraints in Heterogeneous Database Environments1 Lyman Do and Pamela Drew2 Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong email: flyman, pamg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-32.ps.gz, 19950214
In AMTA-94, Association for Machine Translation in the Americas, Columbia, MD: Oct. 94, 206{213. LEARNING AN ENGLISH-CHINESE LEXICON FROM A PARALLEL CORPUS Dekai Wu Xuanyin Xia |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-30.ps.gz, 19950214
In ACL-94, 32nd Annual Meeting of the Assoc. for Computational Linguistics, Las Cruces, NM: Jun. 94, 88{87. ALIGNING A PARALLEL ENGLISH-CHINESE CORPUS STATISTICALLY WITH LEXICAL CRITERIA Dekai Wu HKUST Department of Computer Science University of Science & Technology Clear Water Bay, Hong Kong Internet: |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-31.ps.gz, 19950214
In WVLC-2, Second Annual Workshop on Very Large Corpora (COLING-94), Kyoto: Aug. 94. Statistical Augmentation of a Chinese Machine-Readable Dictionary Pascale Fung Dekai Wu Columbia University HKUST Computer Science Department Department of Computer Science New York, NY 10027 University of Science & |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-33.ps.gz, 19950214
In ANLP-94, Fourth Conference on Applied Natural Language Processing, Stuttgart: Oct. 94, 180 181. IMPROVING CHINESE TOKENIZATION WITH LINGUISTIC FILTERS ON STATISTICAL LEXICAL ACQUISITION Dekai Wu Department of Computer Science University of Science & Technology (HKUST) Clear Water Bay, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-06.ps.gz, 19950222
Inference with causal independence in the CPSC networky Nevin Lianwen Zhang Technical Report HKUST-CS95-06 February 22, 1995 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong yUAI'95 submission. |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-05.ps.gz, 19950222
Policy Filtering for Planning in Partially Observable Stochastic Domainsy Nevin Lianwen Zhang Technical Report HKUST-CS95-05 February 21, 1995 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong yUAI'95 submission. |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-08.ps.gz, 19950302
Context Constraint for Automated Compositional Reachability Analysis Shing-chi Cheung* and Jeff Kramer Technical Report HKUST-CS95-8 March 1995 *Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong (email: scc@cs.ust.hk) Department of |
| ftp://ftp.cs.ust.hk/pub/dekai/amta94.Wu_Xia.ps.Z, 19950302
In AMTA-94, Association for Machine Translation in the Americas, Columbia, MD: Oct. 94, 206{213. LEARNING AN ENGLISH-CHINESE LEXICON FROM A PARALLEL CORPUS Dekai Wu Xuanyin Xia HKUST Department of Computer Science University of Science & Technology Clear Water Bay, Hong Kong fdekai,samxiag@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-09.ps.gz, 19950302
1 Checking Subsystem Safety Properties in Compositional Reachability Analysis Shing-chi Cheung* and Jeff Kramer Technical Report HKUST-CS95-9 March 1995 *Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong (email: scc@cs.ust.hk) |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.npl95.ps.gz, 19950314
Improving the Approximation and Convergence Capabilities of Projection Pursuit Learning March 14, 1995 |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-12.ps.gz, 19950421
Net comparison: an adaptive and effective method for scene change detectiony Wei Xiong, John Chung-Mong Lee, Ding-Gang Shen Technical Report HKUST-CS95-12 April 13, 1995 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong yThis research |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-14.ps.gz, 19950421
A Robust Approach for Camera Break Detection in Color Video Sequence y John Chung-Mong Lee, Dixon Man-Ching IP Technical Report HKUST-CS95-14 April 21, 1995 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong yThis research was supported |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-10.ps.gz, 19950422
A theory of the visual motion coding in the primary visual cortexy Zhaoping Li Technical Report HKUST-CS95-10 April 21, 1995 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong yWork supported by the Research Grant Council of Hong Kong. |
| ftp://ftp.cs.ust.hk/pub/scc/WAPSE.slide.ps.gz, 19950501
Workshop on Asian Approaches to Software Engineering - scc 1 Workshop on Asian Approaches to Software Engineering - April 1995 Automated Behaviour Analysis in the Design of Distributed Software Systems S.C. Cheung scc@cs.ust.hk Department of Computer Science Hong Kong University of Science and |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-21.ps.gz, 19950510
Advanced Functions for Conceptual Clustering in O-O Databases1 Qing Li Technical Report HKUST-CS95-21 May 1995 Department of Computer Science Hong Kong University of Science & Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/ahmad/CASCH/survey-tc.ps.Z, 19950527
- 0 - Analysis, Evaluation, and Comparison of Algorithms for Scheduling Task Graphs on Parallel Processors Ishfaq Ahmad, Yu-Kwong Kwok Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong Min-You Wu Department of Computer Science State |
| ftp://ftp.cs.ust.hk/pub/lzhang/uai95.ps.gz, 19950529
Inference with Causal Independence in the CPSC Network Nevin Lianwen Zhang Dept. of Computer Science, University of Science & Technology, Hong Kong lzhang@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/lzhang/uai94.ps.gz, 19950529
Intercausal Independence and Heterogeneous Factorization Nevin Lianwen Zhang Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong lzhang@cs.ust.hk David Poole Department of Computer Science University of British Columbia Vancouver, B.C., |
| ftp://ftp.cs.ust.hk/pub/scc/sigsoft95.ps.gz, 19950603
Compositional Reachability Analysis of Finite-State Distributed Systems with User-Specified Constraints S.C. Cheung Department of Computer Science Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong J. Kramer Department of Computing Imperial College of Science, Technology and |
| ftp://ftp.cs.ust.hk/pub/dekai/acl95.Wu.ps.Z, 19950719
To appear in ACL-95, 33nd Annual Meeting of the Assoc. for Computational Linguistics, Cambridge, MA: Jun. 95. An Algorithm for Simultaneously Bracketing Parallel Texts by Aligning Words Dekai Wu HKUST Department of Computer Science University of Science & Technology Clear Water Bay, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/dekai/wvlc95.Wu.ps.Z, 19950719
To appear in WVLC-3, Third Annual Workshop on Very Large Corpora (at ACL-95), Cambridge, MA: Jun. 95. Trainable Coarse Bilingual Grammars for Parallel Text Bracketing Dekai Wu HKUST Department of Computer Science University of Science & Technology Clear Water Bay, Hong Kong dekai@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/kamal/jcse.ps, 19950719
1 A Mixed Fragmentation Methodology For Initial Distributed Database Design Shamkant B. Navathe Georgia Institute of Technology Kamalakar Karlapalem Hong Kong University of Science and Technology Minyoung Ra Korea Military Academy To appear in Journal of Computers and Software Engineering |
| ftp://ftp.cs.ust.hk/pub/kamal/coopis.ps, 19950719
CapBasED-AMS|A Framework for Capability{Based and Event{Driven Activity Management System1 Kamalakar Karlapalem Helen P. Yeung Patrick C. K. Hung Department of Computer Science University of Science and Technology Clear Water Bay, Kowloon, Hong Kong. e-mail: fkamal,heleny,cshckg@cs.ust.hk Research |
| ftp://ftp.cs.ust.hk/pub/kamal/hodfa.ps, 19950719
1 An Architecture for Homogenizing Federated Databases Kamalakar Karlapalem Qing Li Chung-Dak Shum Technical Report HKUST-CS94-13 July 1994 2 An Architecture for Homogenizing Federated Databases Kamalakar Karlapalem Qing Li Chung-Dak Shum Department of Computer Science Hong Kong University of Science |
| ftp://ftp.cs.ust.hk/pub/kamal/mater.ps, 19950719
Materialization of Redesigned Distributed Relational Databases1 Kamalakar Karlapalem Hong Kong University of Science and Technology Department of Computer Science Clearwater Bay, Kowloon, Hong Kong e-mail: kamal@cs.ust.hk Phone: (852) 358 6991 Fax: (852) 358 1477 Shamkant B. Navathe Georgia Institute of |
| ftp://ftp.cs.ust.hk/pub/dekai/tmi95.Fung_Wu.ps.Z, 19950719
To appear in TMI-95, Sixth International Conf. on Theoretical and Methodological Issues in Machine Translation, Leuven, Belgium: Jul. 95. Coerced Markov Models for Cross-Lingual Lexical-Tag Relations Pascale Fung and Dekai Wuy Technical Report HKUST-CS95-24 May 1995 Columbia University Computer Science |
| ftp://ftp.cs.ust.hk/pub/kamal/part.ps, 19950719
Partitioning Schemes for Object Oriented Databases1 Kamalakar Karlapalem Qing Li University of Science and Technology Department of Computer Science Clear Water Bay Kowloon, Hong Kong e-mail: fkamal,qingg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/kamal/sigrec.ps, 19950719
1 HODFA: An Architectural Framework for Homogenizing Heterogeneous Legacy Databases1 Kamalakar Karlapalem Qing Li Chung-Dak Shum Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong e-mail: {kamal, qing, shum}@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/kamal/main.ps, 19950719
Memory Access and Selectivity Estimation Methods forReal-Time Main-Memory Databases Babak Hamidzadeh Kamalakar Karlapalem Helen Yeung (hamidzad@cs.ust.hk) (kamal@cs.ust.hk) (heleny@cs.ust.hk) Computer Science Department, University of Science and Technology Clear Water Bay,Kowloon, Hong Kong Technical |
| ftp://ftp.cs.ust.hk/pub/dekai/tmi95.Wu.ps.Z, 19950719
To appear in TMI-95, Sixth International Conf. on Theoretical and Methodological Issues in Machine Translation, Leuven, Belgium: Jul. 95. Grammarless Extraction of Phrasal Translation Examples from Parallel Texts Dekai Wu Technical Report HKUST-CS95-23 May 1995 HKUST Department of Computer Science |
| ftp://ftp.cs.ust.hk/pub/kamal/policy.ps, 19950719
Optimal Redesign Policies to Support Dynamic Processing of Applications on a Distributed Relational Database System1 Kamalakar Karlapalem Department of Computer Science University of Science and Technology Clear Water Bay, Kowloon, Hong Kong. Phone: + 852 358 6991 Fax: + 852 358 1477 e-mail: |
| ftp://ftp.cs.ust.hk/pub/kamal/query.ps, 19950719
Query Driven Data Allocation Algorithms for Distributed Database Systems1 Kamalakar Karlaplem Ng Moon Pun University of Science and Technology Department of Computer Science Clear Water Bay, Kowloon, Hong Kong e-mail: kamal@cs.ust.hk Phone: +852 2358 6991 Fax: +852 2358 1477 |
| ftp://ftp.cs.ust.hk/pub/kamal/method.ps, 19950719
1 Method Induced Partitioning Schemes in Object-oriented Databases* Kamalakar Karlapalem Qing Li SteFan Vieweg Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong Fax: + (852) 2358-1477 email: {kamal,qing,stefan}@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/muppala/sens.ps, 19950722
GSPN Models: Sensitivity Analysis and Applications 1 Jogesh K. Muppala and Kishor S. Trivedi2 Department of Computer Science, Duke University, Durham, NC { 27706 (919) - 660 - 6553 jkm@cs.duke.edu, kst@cs.duke.edu Appeared in Proc. of the 28th ACM Southeast Region Conf., Greeneville, SC, Apr. 1990, pp. |
| ftp://ftp.cs.ust.hk/pub/csricky/A4/survey-part95.ps.gz, 19950727
Performance Comparison of Algorithms for Static Scheduling of DAGs to Multiprocessors1 Ishfaq Ahmad, Yu-Kwong Kwok Department of Computer Science The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong Min-You Wu Department of Computer Science State University of New York at |
| ftp://ftp.cs.ust.hk/pub/csricky/survey-part95-camera.ps.gz, 19950727
Performance Comparison of Algorithms for Static Scheduling of DAGs to Multiprocessors1 Ishfaq Ahmad, Yu-Kwong Kwok Department of Computer Science The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong Min-You Wu Department of Computer Science State University of New York at |
| ftp://ftp.cs.ust.hk/pub/ulrich/pstv95.ps.gz, 19950826
An approach to testing distributed software systems Andreas Ulrich*, Samuel T. Chanson Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong e-mail: {ulrich, chanson}@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.icann95.ps.gz, 19950829
IMPROVING THE APPROXIMATION AND CONVERGENCE CAPABILITIES OF PROJECTION PURSUIT LEARNING Tin-Yau Kwok (jamesk@cs.ust.hk) Dit-Yan Yeung (dyyeung@cs.ust.hk) Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon Hong Kong (852) 2358 6977 |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-37.ps.gz, 19950901
This report will appear in Volume 1000 of Springer-Verlag LNCS, 1995. Standard Generalized Markup Language: Mathematical and Philosophical Issues y Derick Wood Technical Report HKUST-CS95-37 July 1995 Department of Computer Science The Hong Kong University of Science & Technology Clear Water Bay, |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-39.ps.gz, 19950901
Visibility in Semi-Convex Spacesz Sven Schuierer and Derick Woody Technical Report HKUST-CS95-39 June 1995 Institut f ur Informatik Universit at Freiburg Rheinstr. 10{12 D-79104 Freiburg Germany yDepartment of Computer Science Hong Kong University of Science & Technology Clear Water Bay, Kowloon Hong |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-33.ps.gz, 19950901
To appear: Vision Geometry IV Conf., as part of SPIE's Intnl. Symp. on Optical Sc., Eng., and Instrmtn., July, 1995. Three-Dimensional Strong Convexity and Visibilityz Eugene Fink and Derick Woody Technical Report HKUST-CS95-33 June 1995 Department of Computer Science Carnegie{Mellon University |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-40.ps.gz, 19950901
Efficient Planning in Stochastic Domains through Exploiting Problem Characteristics Nevin Lianwen Zhang Department of Computer Science The Hong Kong University of Science and Technolgy Clear Water Bay, Kowloon, Hong Kong lzhang@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-32.ps.gz, 19950901
This report is accepted for publication in the July 1995 issue of Computer Standards and Interfaces. From Data Representation to Data Model: Meta-Semantic Issues in the Evolution of SGMLz Darrell R. Raymond , Frank Tompa , and Derick Woody Technical Report HKUST-CS95-32 June 1995 Department of Computer |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-17.ps.gz, 19950901
The Grail Papers: Version 2.3z Darrell R. Raymond and Derick Woody Technical Report HKUST-CS95-17 May 1995 Department of Computer Science University of Western Ontario London, Ontario N2L 5B7 Canada yDepartment of Computer Science Hong Kong University of Science & Technology Clear Water Bay, Kowloon |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/005-006.ps, 19950906
|
| ftp://ftp.cs.ust.hk/pub/comp251.L1/003-004.ps, 19950906
|
| ftp://ftp.cs.ust.hk/pub/comp251.L1/001-002.ps, 19950906
|
| ftp://ftp.cs.ust.hk/pub/comp251.L1/009-010.ps, 19950908
|
| ftp://ftp.cs.ust.hk/pub/comp251.L1/013-014.ps, 19950908
|
| ftp://ftp.cs.ust.hk/pub/comp251.L1/015-016.ps, 19950908
|
| ftp://ftp.cs.ust.hk/pub/comp251.L1/011-012.ps, 19950908
|
| ftp://ftp.cs.ust.hk/pub/comp251.L1/017-018.ps, 19950908
|
| ftp://ftp.cs.ust.hk/pub/comp251.L1/007-008.ps, 19950908
|
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-42.ps.gz, 19950910
BALANCE|A Flexible Parallel Load Balancing System for Heterogeneous Computing Systems and Networksy Chi-Chung Hui , Samuel T. Chanson , Pui-Man Chui , and Ka-Ming Lau Technical Report HKUST-CS95-42 September 8, 1995 Department of Computer Science The Hong Kong University of Science and Technology Clear |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-43.ps.gz, 19950911
Constructive Feedforward Neural Networks for Regression Problems: A Survey Tin-Yau Kwok & Dit-Yan Yeung Technical Report HKUST-CS95-43 September 1995 Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon Hong Kong fjamesk,dyyeungg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/pam/laceinv.ps.gz, 19950912
A Heterogeneous Database Management Architecture to Support Tailored User Views over Interdatabase Constraints1 Lyman Do, Pamela Drew, and Wilson Tang Department of Computer Science Hong Kong University of Science and Technology Kowloon, Hong Kong email: flyman,pam,cswstangg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/pam/smartcourier.ps.gz, 19950912
The Smart Courier Approach to Consistency Management across Multiple Information Sources Lyman Do and Pamela Drew Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong email: flyman,pamg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/pam/constraint_trxn.ps.gz, 19950912
Constraint Enforcement Transaction Processing in Multidatabase Architectures Lyman Do and Pamela Drew Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong flyman,pamg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/pam/asynch_in_activedb.ps.gz, 19950912
Active Database Management of Global Data Integrity Constraints in Heterogeneous Database Environments1 Lyman Do and Pamela Drew2 Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong email: flyman, pamg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/pam/metadata.ps.gz, 19950912
A Heterogeneous Geographic Information Architecture For Hong Kong Infrastructure Systems 14 P. Milne, S. Milton, and J. Smith, Geographical Object-Oriented Databases: a Case Study , International Journal of Geographic Information Systems, Vol. 7, pp. 39-56, 1993. S. Morehouse, The ARC/INFO |
| ftp://ftp.cs.ust.hk/pub/pam/laceabs.ps.gz, 19950912
Templeton, M., Brill, D., Chen, A., Dao, S., Lund, E., Macgregor, R., and Ward, P., Mermaid: A front-end to distributed heterogeneous databases, Proc. IEEE 75 (5), 695-708, 1987. M. Templeton and D. Van Buer, Replicated and Fragmented Relation Update in INTERVISO , Data Integration, Inc. |
| ftp://ftp.cs.ust.hk/pub/pam/migration.ps.gz, 19950912
On Database Technology For Information System Migration and Evolution1 Pamela Drew Department of Computer Science Hong Kong University of Science and Technology Kowloon, Hong Kong pam@cs.ust.hk 1.0 The Problem Information has become the cornerstone of many organizational activities from decision making |
| ftp://ftp.cs.ust.hk/pub/pam/asynch_in_esr.ps.gz, 19950912
The Management of Interdependent Asynchronous Transactions in Heterogeneous Database Environments1 Lyman Do and Pamela Drew2 Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong email: flyman, pamg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/pam/v_arch.ps.gz, 19950912
: An Evolvable System Architecture for Heterogeneous Information Resource Management Lyman Do and Pamela Drew y Department of Computer Science Hong Kong University of Science and Technology Kowloon, Hong Kong email: flyman, pamg@cs.ust.hk 1 Introduction Today's business enterprises can be viewed as a |
| ftp://ftp.cs.ust.hk/pub/pam/metadataexchange.ps.gz, 19950912
1 Metadata Management for Geographic Information Exchange1 Pamela Drew and Jerry Ying2 Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong Internet: {pam, jying} @cs.ust.hk 1.0 Introduction Hong Kong is a major, and rapidly developing, metropolis in |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-44.ps.gz, 19950913
To appear: Theoretical Computer Science, 1996. Structural Equivalence and ET0L Grammarsx Kai Salomaa , Derick Woody, and Sheng Yuz Technical Report HKUST-CS95-44 September 1995 Department of Mathematics University of Turku Turku Finland yDepartment of Computer Science Hong Kong University of Science & |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/Lecture03.ps, 19950914
Prepared by: Chan Man Yee, Mandy (csmychan, 94211829) & Fung Wai Kit, Tony (cstony, 94209333) COMP251 Lecture Note for Week 2 Monday (11 Sept 95) Page 1 of 2 Functional Programming In Pure functional programming , everything is accomplished via functions in the mathematical sense. Consider this C |
| ftp://ftp.cs.ust.hk/pub/gray/thesis.ps.gz, 19950915
|
| ftp://ftp.cs.ust.hk/pub/comp251.L1/Lecture04.ps, 19950918
Exceptions in ML Certain functions are undefined on certain inputs. e.g. sqrt: RfiR is undefined on negative values. /: R RfiR is undefined when its second argument is zero. hd: 'a list fi 'a is undefined for the empty list. - hd(); uncaught exception Hd the name of the exception - 3.0 / 0.0; uncaught |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/Lecture05.ps, 19950925
Chan Man Yee, Mandy (csmychan, 94211829) Eddy Poon (cshcpoon, 94093423) COMP251 Lecture Note for Week 3 Monday (18 Sept 95) Page 1 of 3 The lie from the last lecture: In ML, an operator or function is either polymorphic and allows any type to be substituted for the type variable or it isn t polymorphic |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/Lecture06.ps, 19950925
Chan Man Yee, Mandy (csmychan, 94211829) Eddy Poon (cshcpoon, 94093423) COMP251 Lecture notes for Week 3 Thursday (21 Sept 95) Page 1 of 5 Most General Unifier A unifier s for E1 and E2 is a most general unifier (mgu) if for all other unifier, say s , E1s is an instance of E1s. That is, there exist s |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/Lecture07.ps, 19950928
Lecture Section 1 Instructor: James W. Gray, III 25 September 1995 COMP 251 (FALL 1995) Lecture Notes -- the 7th lecture Page 1 Prepared by : Fu Ho Yam Addy (csaddy@cs.ust.hk) Unification (continue of the last 2 lectures) the result of the question which find |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/Lecture08.ps, 19951005
Prepared by: Chan Man Yee, Mandy (csmychan, 94211829) & Fung Wai Kit, Tony (cstony, 94209333) COMP251 Lecture Note for Week 4 Thursday (28 Sept 95) Page 1 of 2 Programmer-defined (Recursive) datatypes In ML, we have several built-in datatypes (eg. int) as well as operators (called type constructors) to |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/Lecture09.ps, 19951008
COMP251 Lecture Note for Week 5 on Oct. 2, 95(MON) Page 1 of 3 Eddy Poon cshcpoon@cs.ust.hk Type Inference When inferring the type of an ML expression, say e, ML takes into account the environment of e. For example: - val L = ; val L = : int list - fun f(x) = (x,L); val f = fn: a -> ( |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/hw1.soln.ps, 19951008
COMP 251, Lecture 1 Instructor: James W. Gray, III Fall 1995 Homework 1 (with Solutions) 1. Write an unambiguous context-free grammer for expressions with a (binary) assignment operator, =, binary operators && and jj, unary operator !, parentheses for grouping subexpressions, and operands given by the |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/Lecture10.ps, 19951010
COMP251 Lecture Note on Oct 5, 1995 (THU) Ng Yuet Yeung Enoch (csyyng@ug.cs.ust.hk) Page 1 of 3 Clarification of last lecture: An identifier is generic in two cases: 1) When it is bound by a let expression, e.g., in the expression: let x = e1 in e2 x is generic in e2 only. 2) After an identifier has |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/Lecture11.ps, 19951012
Logic Programming (Prolog) Review of functions and relations: For a function f: A fi B, for every element x A, there is at most one element y B such that f(x) = y. For a relation R: A B, there can be many y B that are related to x by R. e.g. (x, y1) R, (x, y2) R and y1 y2. We can think of an n-ary |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/hw2.soln.ps, 19951015
COMP 251, Lecture 1 Instructor: James W. Gray, III Fall 1995 Homework 2 (Unification and Type Inference)|With Solutions 1. Consider a language of expressions where integers are constants, uppercase letters are variables, and lowercase letters are operators. For each of the following pairs of terms, |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/Lecture12.ps, 19951016
How does Prolog process Queries Consider the rules from last lecture (1) app( , Y, Y). (2) app( , Y, ) :- app(X,Y,Z). When we asked the query : | - app(X,Y,). One of the responses (but not the first) was : X = Y = . How does Prolog use the above two rules to prove this |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.accv95.ps.gz, 19951017
A Unified Framework for Handwritten Character Recognition using Deformable Models Kwok-Wai Cheung, Dit-Yan Yeung and Roland T. Chin Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Hong Kong Email: william@cs.ust.hk, dyyeung@cs.ust.hk, roland@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/exam1.soln.ps, 19951021
Principles of Programming Languages|COMP 251 Lecture 1 Instructor: James W. Gray, III 19 Oct 1995 (Fall term) Examination 1 (with solutions) There are a total of 100 points. 1. Write an unambiguous context-free grammer for the subset of ML type expressions containing the following. ffl |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/prolog.ps, 19951021
Using Quintus Prolog|The Basics Notes by James W. Gray, III Last modified: October 22, 1995 This document gives some very basic information on using Quintus Prolog, release 3, at HKUST. 1. Getting Access (Instructions for Faculty): There are a limited number of licenses for Quintus Prolog. Currently, we |
| ftp://ftp.cs.ust.hk/pub/dlee/oo/cikm94.ps.gz, 19951027
Using Path Information for Query Processing in Object-Oriented Database Systems Dik L. Lee and Wang-chien Lee Department of Computer and Information Science The Ohio State University Columbus, Ohio 43210-1277 fdlee, wleeg@cis.ohio-state.edu |
| ftp://ftp.cs.ust.hk/pub/dlee/ir/optimal-sig.ps.gz, 19951027
Optimal Weight Assignment for Signature Generation Chun-wu Roger Leng Dik Lun Lee Department of Computer and Information Science The Ohio State University 2036, Neil Ave Columbus, OHIO 43210-1277 April 24, 1995 Abstract Previous work on superimposed coding are characterized by two aspects. First, it is |
| ftp://ftp.cs.ust.hk/pub/dlee/ir/hytrem-ipm.ps, 19951027
Massive Parallelism on the Hybrid Text Retrieval Machine Dik L. Lee* Department of Computer Science, Hong Kong University of Science and Technology Clear Water Bay, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/dlee/mobile/rutgers-cacm.ps.gz, 19951027
Mobile Wireless Computing: Solutions and Challenges in Data Management1 Tomasz Imielinski B. R. Badrinath Department. of Computer Science Rutgers University New Brunswick, NJ 08903 e-mail:fimielins,badri@cs.rutgers.edug |
| ftp://ftp.cs.ust.hk/pub/dlee/mobile/sig+cache-J.ps.gz, 19951027
Using Signature and Caching Techniques for Information Filtering in Wireless and Mobile Environments Wang-chien Lee Dik Lun Lee Dept of Computer and Information Science Department of Computer Science The Ohio State University University of Science and Technology Columbus, Ohio 43210-1277, USA Clear |
| ftp://ftp.cs.ust.hk/pub/dlee/oo/ride95.ps.gz, 19951027
Proceedings of the Fifth International Workshop on Research Issues in Data Engineering 10 On Processing Nested Queries in Distributed Object-Oriented Database Systems Wang-Chien Lee Department of Computer and Information Science The Ohio State University Columbus, Ohio 43210-1277, USA |
| ftp://ftp.cs.ust.hk/pub/dlee/ir/wt-psf.ps.gz, 19951027
Document Ranking on Weight-Partitioned Signature Files Dik Lun Lee and Liming Ren The Ohio State University November, 1994 |
| ftp://ftp.cs.ust.hk/pub/dlee/oo/hk92.ps.gz, 19951027
Proceedings of the 2nd International Computer Science Conference, Hong Kong, Dec. 1992, 616-622. 616 SIGNATURE FILE METHODS FOR INDEXING OBJECT-ORIENTED DATABASE SYSTEMS Wang-chien Lee and Dik L. Lee Department of Computer and Information Science, Ohio State University Columbus, Ohio 43210-1277 |
| ftp://ftp.cs.ust.hk/pub/dlee/ir/partial-rank.ps.gz, 19951027
Implementations of Partial Document Ranking Using Inverted Files Wai Yee Peter Wong Dik Lun Lee Department of Computer and Information Science, Ohio State University, 2036 Neil Ave, Columbus, Ohio 43210, U.S.A. May 1992 |
| ftp://ftp.cs.ust.hk/pub/dlee/ir/icde96-www.ps, 19951027
Search and Ranking Algorithms for Locating Resources on the World Wide Web Budi Yuwono Dik L. Lee Department of Computer and Department of Computer Science Information Science Hong Kong University of Science The Ohio State University and Technology Columbus, Ohio, U.S.A. Clear Water Bay, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/dlee/ir/part-sig.ps.gz, 19951027
Partitioned Signature File: Design Issues and Performance Evaluation1 Dik Lun Lee Chun-wu Leng Department of Computer and Information Science The Ohio State University 2036, Neil Ave Columbus, OHIO 43210-1277 January 1989 |
| ftp://ftp.cs.ust.hk/pub/dlee/ir/multilevel-tkde.ps.gz, 19951027
Efficient Signature File Methods for Text Retrieval Dik Lun Lee Young Man Kim Gaurav Patel Department of Computer and Information Science, Ohio State University Columbus, Ohio 43210-1277 May 14, 1995 |
| ftp://ftp.cs.ust.hk/pub/dlee/oo/dasfaa95.ps.gz, 19951027
Proceedings of the 4th International Conference on Database Systems for Advanced Applications 107 Combining Indexing Technique with Path Dictionary for Nested Object Queries Wang-Chien Lee Dept. of Computer & Information Science The Ohio State University Columbus, Ohio 43210-1277, USA |
| ftp://ftp.cs.ust.hk/pub/dlee/oo/ics94.ps.gz, 19951027
Proceedings of International Computer Symposium 1994, Dec. 12-15, NCTU, Hsinchu, Taiwan, R.O.C. 1172 Short Cuts for Traversals in Object-Oriented Database Systems Wang-Chien Lee and Dik Lun Lee Department of Computer and Information Science, Ohio State University Columbus, Ohio 43210-1277, USA fwlee, |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/Lecture16.ps, 19951103
COMP 251 - Principles of Programming Languages Lecture 1 30/10/95 ~ 1 ~ Parsing in Prolog (cont.) Consider the rules for fi | . | . discussed in last lecture: Here s another application of cut: We can add a cut into our rule for parsing fi ., viz., n_rule(X, n(T1, dot, |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/Lecture17.ps, 19951111
Parsing in Prolog (continued) The major point about d_rule is that querying d_rule(X,Y,T), where X is a string starting from a digit and Y and T are variables, will instantiate Y with the rest of the list after parsing X as far as possible. We translate fi as : ds_rule(X,Y,ds(T1,T2)) :- |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/Lecture18.ps, 19951111
Prepared by : Cheung Chun Yu, Cliff (csccy) Comp 251 : Lecture Note for 6th Nov 1995 page 1 of 3 Data Representation (Continued) Design of an array datatypes: For usability : we want the lower and upperbounds on indexes to be determined at runtime and check on each access (at runtime). For efficiency : |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/hwk3.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Assignment 3 (15%): Unsupervised Bayesian Classification Using AutoClass Due date: 14 & 23 November 1995, in class Preamble Unlike the previous two assignments, this assignment is more open-ended. It is also |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/f95/read-ac.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (AutoClass) Required Reading ffl P. Cheeseman, J. Kelly, M. Self, J. Stutz, W. Taylor, D. Freeman (1988). AutoClass: a Bayesian classification system. Proceedings of the Fifth International |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/hwk1.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Assignment 1: Incremental Learning of Decision Trees Due date: 10 October 1995, in class Objective Decision tree learning algorithms such as ID3 and C4.5 have become standard topics even in some undergraduate |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/hwk2.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Assignment 2: Feedforward Neural Networks Due date: 24 October 1995, in class Preamble There are many existing neural network simulators. Proprietary commercial packages are usually not very flexible, making |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/f95/hwk3.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Assignment 3 (15%): Unsupervised Bayesian Classification Using AutoClass Due date: 14 & 23 November 1995, in class Preamble Unlike the previous two assignments, this assignment is more open-ended. It is also |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/f95/hwk4.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Assignment 4 (10%): Hidden Markov Models & Reinforcement Learning Due date: 29 November 1995, 5:00pm, to Brenda 1. The standard form of hidden Markov models (HMM), as studied in class, involves only one |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/read-cluster.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (Conceptual Clustering) Required Reading ffl M.N. Murty, A.K. Jain (1995). Knowledge-based clustering scheme for collection management and retrieval of library books. Pattern Recognition, |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/f95/read-mde.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (Mixture Density Estimation) Required Reading ffl X.D. Huang, Y. Ariki, M.A. Jack (1990). Hidden Markov Models for Speech Recognition, Section 2.1{2.4. Edinburgh University Press. Further Reading |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/read-ac.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (AutoClass) Required Reading ffl P. Cheeseman, J. Kelly, M. Self, J. Stutz, W. Taylor, D. Freeman (1988). AutoClass: a Bayesian classification system. Proceedings of the Fifth International |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/f95/read-tree.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (Tree-based Methods) Required Reading ffl J.R. Quinlan (1986). Induction of decision trees. Machine Learning, 1(1):81{106. ffl T. Mitchell, R. Caruana, D. Freitag, J. McDermott, D. Zabowski |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/f95/hwk2.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Assignment 2: Feedforward Neural Networks Due date: 24 October 1995, in class Preamble There are many existing neural network simulators. Proprietary commercial packages are usually not very flexible, making |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/f95/read-rl.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (Reinforcement Learning) Required Reading ffl S.J. Russell, P. Norvig (1995). Artificial Intelligence: A Modern Approach, Chapter 20. Prentice-Hall. Further Reading ffl C.J.C.H. Watkins, P. Dayan |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/read-tree.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (Tree-based Methods) Required Reading ffl J.R. Quinlan (1986). Induction of decision trees. Machine Learning, 1(1):81{106. ffl T. Mitchell, R. Caruana, D. Freitag, J. McDermott, D. Zabowski |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/f95/read-pac.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (PAC Learning) Required Reading ffl S.J. Russell, P. Norvig (1995). Artificial Intelligence: A Modern Approach, 552{560. Prentice-Hall. Further Reading ffl L.G. Valiant (1984). A theory of the |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/f95/hwk1.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Assignment 1: Incremental Learning of Decision Trees Due date: 10 October 1995, in class Objective Decision tree learning algorithms such as ID3 and C4.5 have become standard topics even in some undergraduate |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/f95/read-cluster.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (Conceptual Clustering) Required Reading ffl M.N. Murty, A.K. Jain (1995). Knowledge-based clustering scheme for collection management and retrieval of library books. Pattern Recognition, |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/f95/courseinfo.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Tue & Thu 9:30-10:50am, Rm 3416 Dr. Dit-Yan Yeung (Rm 3541, dyyeung@cs.ust.hk, x6977) Course Description The ability to learn is central to both natural and artificial intelligence. Some major machine |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/read-rl.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (Reinforcement Learning) Required Reading ffl S.J. Russell, P. Norvig (1995). Artificial Intelligence: A Modern Approach, Chapter 20. Prentice-Hall. Further Reading ffl C.J.C.H. Watkins, P. Dayan |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/read-nn.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (Neural Networks) Required Reading ffl D.E. Rumelhart, G.E. Hinton, R.J. Williams (1986). Learning internal representations by error propagation. Parallel Distributed Processing, Volume 1, |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/read-mde.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (Mixture Density Estimation) Required Reading ffl X.D. Huang, Y. Ariki, M.A. Jack (1990). Hidden Markov Models for Speech Recognition, Section 2.1{2.4. Edinburgh University Press. Further Reading |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/hw3.soln.ps, 19951113
COMP 251, Lecture 1 Instructor: James W. Gray, III Fall 1995 Homework 3 1. Consider the following declaration. VAR A: ARRAY OF DOUBLE; Suppose a data object of type DOUBLE takes two words in a word-addressable machine. Show the descriptor for A, including bounds, strides, and its virtual |
| ftp://ftp.cs.ust.hk/pub/csricky/DCP-ieee.ps.gz, 19951113
- 1 - Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors Yu-Kwong Kwok and Ishfaq Ahmad1 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong Corresponding Author: Ishfaq Ahmad Email: |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/f95/read-nn.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (Neural Networks) Required Reading ffl D.E. Rumelhart, G.E. Hinton, R.J. Williams (1986). Learning internal representations by error propagation. Parallel Distributed Processing, Volume 1, |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/f95/read-hmm.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (Hidden Markov Models) Required Reading ffl X.D. Huang, Y. Ariki, M.A. Jack (1990). Hidden Markov Models for Speech Recognition, Chapter 5. Edinburgh University Press. Further Reading ffl L.R. |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/courseinfo.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Tue & Thu 9:30-10:50am, Rm 3416 Dr. Dit-Yan Yeung (Rm 3541, dyyeung@cs.ust.hk, x6977) Course Description The ability to learn is central to both natural and artificial intelligence. Some major machine |
| ftp://ftp.cs.ust.hk/pub/csricky/A4/dcp-tpds.ps.gz, 19951113
- 1 - Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors Yu-Kwong Kwok and Ishfaq Ahmad1 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong Corresponding Author: Ishfaq Ahmad Email: |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/read-pac.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (PAC Learning) Required Reading ffl S.J. Russell, P. Norvig (1995). Artificial Intelligence: A Modern Approach, 552{560. Prentice-Hall. Further Reading ffl L.G. Valiant (1984). A theory of the |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/read-hmm.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (Hidden Markov Models) Required Reading ffl X.D. Huang, Y. Ariki, M.A. Jack (1990). Hidden Markov Models for Speech Recognition, Chapter 5. Edinburgh University Press. Further Reading ffl L.R. |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/hwk4.ps.gz, 19951113
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Assignment 4 (10%): Hidden Markov Models & Reinforcement Learning Due date: 29 November 1995, 5:00pm, to Brenda 1. The standard form of hidden Markov models (HMM), as studied in class, involves only one |
| ftp://ftp.cs.ust.hk/pub/gray/draft.ps.gz, 19951115
DRAFT: November 14, 1995. Not for distribution or citation. 1 A Logical Approach to Multilevel Security of Probabilistic Systems James W. Gray, III Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon, HONG KONG Paul F. Syversony Center for High |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp523/s95/hwk3.ps.gz, 19951115
Hong Kong University of Science and Technology COMP523: Artificial Neural Networks Spring Semester, 1994/95 Homework Assignment 3: Learning Algorithm for a Recurrent Neural Network Architecture Due date: 25 April 1995 As discussed in class, the recurrent neural network architecture shown below can |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp523/hwk2.ps.gz, 19951115
Hong Kong University of Science and Technology COMP523: Artificial Neural Networks Spring Semester, 1994/95 Homework Assignment 2: Supervised Learning in Feedforward Neural Networks Due date: 13 April 1995 Introduction In this assignment, you are required to perform some supervised learning experiments |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp523/courseinfo.ps.gz, 19951115
Hong Kong University of Science and Technology COMP523: Artificial Neural Networks Spring Semester, 1994/95 Tue 2:00-3:20pm & Thu 2:30-3:50pm, Rm 3311 Dr. Dit-Yan Yeung (Rm 3541, dyyeung@cs.ust.hk, x6977) Course Description Artificial neural network (ANN) models are computational models inspired by |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp523/s95/hwk1.ps.gz, 19951115
Hong Kong University of Science and Technology COMP523: Artificial Neural Networks Spring Semester, 1994/95 Homework Assignment 1 Due date: 9 March 1995 Perceptron learning can be applied to winner-take-all groups (see Section 4.2 of textbook). 1. State the perceptron convergence theorem for |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp523/s95/hwk2.ps.gz, 19951115
Hong Kong University of Science and Technology COMP523: Artificial Neural Networks Spring Semester, 1994/95 Homework Assignment 2: Supervised Learning in Feedforward Neural Networks Due date: 13 April 1995 Introduction In this assignment, you are required to perform some supervised learning experiments |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp523/hwk4.ps.gz, 19951115
Hong Kong University of Science and Technology COMP523: Artificial Neural Networks Spring Semester, 1994/95 Homework Assignment 4: Self-Organizing Maps Due date: 13 May 1995 Introduction In this assignment, you are asked to perform some unsupervised learning experiments using a self-organizing map (SOM) |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp523/hwk3.ps.gz, 19951115
Hong Kong University of Science and Technology COMP523: Artificial Neural Networks Spring Semester, 1994/95 Homework Assignment 3: Learning Algorithm for a Recurrent Neural Network Architecture Due date: 25 April 1995 As discussed in class, the recurrent neural network architecture shown below can |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp523/hwk1.ps.gz, 19951115
Hong Kong University of Science and Technology COMP523: Artificial Neural Networks Spring Semester, 1994/95 Homework Assignment 1 Due date: 9 March 1995 Perceptron learning can be applied to winner-take-all groups (see Section 4.2 of textbook). 1. State the perceptron convergence theorem for |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp523/s95/courseinfo.ps.gz, 19951115
Hong Kong University of Science and Technology COMP523: Artificial Neural Networks Spring Semester, 1994/95 Tue 2:00-3:20pm & Thu 2:30-3:50pm, Rm 3311 Dr. Dit-Yan Yeung (Rm 3541, dyyeung@cs.ust.hk, x6977) Course Description Artificial neural network (ANN) models are computational models inspired by |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp523/s95/hwk4.ps.gz, 19951115
Hong Kong University of Science and Technology COMP523: Artificial Neural Networks Spring Semester, 1994/95 Homework Assignment 4: Self-Organizing Maps Due date: 13 May 1995 Introduction In this assignment, you are asked to perform some unsupervised learning experiments using a self-organizing map (SOM) |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.iccpol95.ps.gz, 19951116
Chinese glyph generation using character composition and beauty evaluation metrics Pak-Keung Lai ( )1, Man-Chi Pong ( )2, Dit-Yan Yeung ( ) Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong e-mail: pklai@lawhk.hku.hk, |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.iconip94.ps.gz, 19951116
ASCOC: A Locally Recurrent Neural Network Model for Grammatical Inference Dit-Yan Yeung, Kei-Wai Yeung Department of Computer Science Hong Kong University of Science and Technology |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.issipnn94a.ps.gz, 19951116
A Theoretically Sound Learning Algorithm for Constructive Neural Networks Tin-Yau Kwok (jamesk@cs.ust.hk) Dit-Yan Yeung (dyyeung@cs.ust.hk) Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon Hong Kong |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.icnn93.ps.gz, 19951116
EXPERIMENTAL ANALYSIS OF INPUT WEIGHT FREEZING IN CONSTRUCTIVE NEURAL NETWORKS Tin-Yau Kwok Dit-Yan Yeung (jamesk@uxmail.ust.hk) (dyyeung@uxmail.ust.hk) Department of Computer Science Hong Kong University of Science and Technology |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.icsc95.ps.gz, 19951116
On-line Handwritten Alphanumeric Character Recognition Using Feature Sequences Xiaolin Li and Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon, HONG KONG Internet: fxiaolin,dyyeungg@cs.ust.hk Fax: +852-2358-1477 |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.issipnn94b.ps.gz, 19951116
Gabriel Networks: Self-Organizing Neural Networks for Adaptive Vector Quantization Kwok-Leung Mou (klmou@cs.ust.hk) Dit-Yan Yeung (dyyeung@cs.ust.hk) Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon Hong Kong |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.icnn95.ps.gz, 19951116
Efficient Cross-Validation for Feedforward Neural Networks Tin-Yau Kwok (jamesk@cs.ust.hk) and Dit-Yan Yeung (dyyeung@cs.ust.hk) Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon Hong Kong |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.icnn94.ps.gz, 19951116
Constructive Neural Networks: Some Practical Considerations Tin-Yau Kwok Dit-Yan Yeung |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/f95/read-ebl.ps.gz, 19951118
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (Explanation-based Learning) Required Reading ffl T.M. Mitchell, R.M. Keller, S.T. Kedar-Cabelli (1986). Explanation-based generalization: a unifying view. Machine Learning, 1(1):47{80. Further |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/read-ebl.ps.gz, 19951118
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (Explanation-based Learning) Required Reading ffl T.M. Mitchell, R.M. Keller, S.T. Kedar-Cabelli (1986). Explanation-based generalization: a unifying view. Machine Learning, 1(1):47{80. Further |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/exam2.soln.ps, 19951119
Principles of Programming Languages|COMP 251 Lecture 1 Instructor: James W. Gray, III 16 Nov 1995 (Fall term) Examination 2, with solutions 1. Consider the following program skeleton. var X : array of integer; procedure P(var Y : array of integer) /* Y is passed by |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-41.ps.gz, 19951121
Strong Restricted-Orientation Convexityz Eugene Fink and Derick Woody Technical Report HKUST-CS95-41 September 1995 Department of Computer Science Carnegie{Mellon University Pittsburgh, PA 15213 U. S. A. yDepartment of Computer Science Hong Kong University of Science & Technology Clear Water Bay, |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/Lecture19.ps, 19951121
COMP251 Lecture note Page 1 of 2 Ng Yuet Yeung Enoch (csyyng@ug.cs.ust.hk) Object-Oriented Programming and C++ Basic idea of Object-Oriented Programming: When solving a problem, identify the objects in the problem domain and design your programs around those objects. An object is an intentionally vague |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-45.ps.gz, 19951121
Generalized Halfspaces in Restricted-Orientation Convexityz Eugene Fink and Derick Woody Technical Report HKUST-CS95-45 September 1995 Department of Computer Science Carnegie{Mellon University Pittsburgh, PA 15213 U. S. A. yDepartment of Computer Science Hong Kong University of Science & Technology |
| ftp://ftp.cs.ust.hk/pub/dwood/darrell/jsc.ps.gz, 19951121
J. Symbolic Computation (1995) 11, 1{000 Grail : A C++ Library for Automata and Expressions Darrell Raymondy Derick Woodz (Received January 1994) Grail is a package for symbolic manipulation of finite-state automata and regular expressions. It provides most standard operations on automata and |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-46.ps.gz, 19951121
Fundamentals of Restricted-Orientation Convexityz Eugene Fink and Derick Woody Technical Report HKUST-CS95-46 September 1995 Department of Computer Science Carnegie{Mellon University Pittsburgh, PA 15213 U. S. A. yDepartment of Computer Science Hong Kong University of Science & Technology Clear Water |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-48.ps.gz, 19951122
Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost1 Tony W. Lai2 Derick Wood3 September 27, 1995 |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/f95/read-appl.ps.gz, 19951123
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (More Applications) Further Reading ffl B.A. Kumar, K. Duraiswamy, K. Sarukesi (1992). A new approach to machine learning systems and its application to the development of an ITS. Journal of |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/read-appl.ps.gz, 19951123
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Reading List (More Applications) Further Reading ffl B.A. Kumar, K. Duraiswamy, K. Sarukesi (1992). A new approach to machine learning systems and its application to the development of an ITS. Journal of |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.pr93.ps.gz, 19951124
Constructive Neural Networks as Estimators of Bayesian Discriminant Functions1 Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon Hong Kong 17 February 1992 |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.nips95.ps.gz, 19951124
Predictive Q-Routing: A Memory-based Reinforcement Learning Approach to Adaptive Traffic Control Samuel P.M. Choi, Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong fpmchoi,dyyeungg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/Lecture21.ps, 19951127
COMP251 - Principles of Programming Languages Lecture 23 : 20 - 11 -95 1 Name : Yeung Yiu Wai Student I.D. : 94211063 Email : csyyw@cs.ug.ust.hk C++ Class Design( Continued ) Overload operators Recall that ML has overloaded operators, C++ not only has overloaded operators, but operators can be |
| ftp://ftp.cs.ust.hk/pub/dekai/Wu_Xia.95.ps.gz, 19951128
Machine Translation, 9:3-4, 285{313 (1995) c 1995 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Large-Scale Automatic Extraction of an English-Chinese Translation Lexicon DEKAI WU dekai@cs.ust.hk XUANYIN XIA samxia@cs.ust.hk Department of Computer Science, HKUST, University of |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/Lecture22.ps, 19951128
COMP 251 - Principles of Programming Languages Lecture 1 23/11/95 ~ 1 ~ C++ Templates Recall that in ML, functions and data structures can have types that contain type variables such as a. i.e. they can be polymorphic. In C++, we can use templates to do the same kind of thing. One important difference |
| ftp://ftp.cs.ust.hk/pub/pam/geochg.ps.gz, 19951130
1 GeoChange: An Experiment in Wide-Area Database Services for Geographic Information Exchange Pamela Drew and Jerry Ying1 Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong Internet: {pam, jying} @cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/Lecture23.ps, 19951205
COMP 251 COMP 251 Instructor: James W. Gray, III Lecture 23 (27 Nov) Prepared by: David, Chan Yuk Ming (csymchan) Page 1 Inline functions in C++ We want a mechanism to implement small functions without the overhead of a function call. This is especially true in C++, since we often write short functions |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/Lecture24.ps, 19951205
Prepared by : Wong Ming Ho (csmhwong) 1 of 4 Comp251 : Lecture Note for 30th Nov, 1995 Inheritance and Code Reuse The ffiirrsstt major use of inheritance in C++ is to support reuse of code (in the base class). Consider the problem domain of displaying windows on a computer screen. We want to display |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/hwk5.ps.gz, 19951207
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Assignment 5 (5%): PAC Learning Due date: 7 December 1995, in class 1. For any finite hypothesis space H, prove that VCdim(H) <= log2 jHj: (1) 2. Based on (1), can we conclude that the sample complexity bound |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/hw4.soln.ps, 19951207
COMP 251, Lecture 1 Instructor: James W. Gray, III Fall 1995 Homework 4 (Block Structure), with solutions I recommend you do two of the following three questions. If you have lots of spare time and you really want to do more, do all three, but that shouldn't be necessary for you to understand the ideas |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp522/f95/hwk5.ps.gz, 19951207
Hong Kong University of Science and Technology COMP522: Machine Learning Fall Semester, 1995/96 Assignment 5 (5%): PAC Learning Due date: 7 December 1995, in class 1. For any finite hypothesis space H, prove that VCdim(H) <= log2 jHj: (1) 2. Based on (1), can we conclude that the sample complexity bound |
| ftp://ftp.cs.ust.hk/pub/comp251.L1/Lecture25.ps, 19951211
Comp 251 principle of programming language Lecture 25 (4 th Dec,1995) Page 1 by Lau Hon Ching (cshclau) Inheritance and Abstract Classes (The 2nd major use of inheritance) Suppose we re designing a system that gets audio (sound) data from several microphones connected to a computer. The microphones can |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.icdar95.ps.gz, 19951218
A Grammatical Inference Approach to On-line Handwriting Modeling and Recognition: A Pilot Study1 Dit-Yan Yeung (dyyeung@cs.ust.hk) Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tr94-34.ps.gz, 19960104
Constrained Independence System and Triangulations of Planar Point Sets1 Siu-Wing Cheng2 Yin-Feng Xu3 |
| ftp://ftp.cs.ust.hk/pub/techreport/95/tr95-20.ps.gz, 19960104
A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets1 Siu-Wing Cheng2 Chi-Keung Tang3 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/dekai/anlp94.Wu_Fung.ps.Z, 19960105
In ANLP-94, Fourth Conference on Applied Natural Language Processing, Stuttgart: Oct. 94, 180 181. IMPROVING CHINESE TOKENIZATION WITH LINGUISTIC FILTERS ON STATISTICAL LEXICAL ACQUISITION Dekai Wu Department of Computer Science University of Science & Technology (HKUST) Clear Water Bay, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/pam/dodrew.ps.gz, 19960109
Interactions of Concurrent Workflow Processes over Shared Informationy Lyman Do and Pamela Drew Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong flyman,pamg@cs.ust.hk 1 Introduction There are two run-time functions particularly important in a |
| ftp://ftp.cs.ust.hk/pub/video/papers/accv95.ps.gz, 19960109
Video Segment Indexing Through Classification and Interactive View-based Query John Chung-Mong Leey, Wei Xiongy, Ding-Gang Shenzand Ruihua May yDepartment of Computer Science The Hong Kong University of Science & Technology, Hong Kong zInstitute of Optic-Fibre Technology Shanghai Jiaotong University, |
| ftp://ftp.cs.ust.hk/pub/video/papers/NetCMP.ps.gz, 19960111
Net comparison: A Versatile and Efficient method for Scene Change Detection Wei Xiong John Chung-Mong Lee Department of Computer Science Hong Kong University of Science and Technology, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/video/papers/vdb-spie96.ps.gz, 19960111
An Experimental Video Database Management System Based on Advanced Object-Oriented Techniques Liu Sheng HUANG John Chung-Mong LEE Qing LI Wei XIONG Data/Knowledge Base Group Artificial Intelligence Group Dept of Computer Science Dept of Computer Science Hong Kong University of Science and Technology, |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/sc2c-r4rs.ps.gz, 19960118
Scheme->C Index to the 4 Revised Report on the Algorithmic Language Scheme 15 March 1993 bit-and bit-lsh Implementation Notes bit-not bit-or bit-rsh bit-xor Scheme->C is an implementation of the language c-byte-ref c-byte-set! 4 Scheme as described in the Revised Report on the c-double-ref c-double-set! |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/sc2c-r4rs.ps.gz, 19960118
Scheme->C Index to the 4 Revised Report on the Algorithmic Language Scheme 15 March 1993 bit-and bit-lsh Implementation Notes bit-not bit-or bit-rsh bit-xor Scheme->C is an implementation of the language c-byte-ref c-byte-set! 4 Scheme as described in the Revised Report on the c-double-ref c-double-set! |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/r4rs.ps.gz, 19960118
Revised4 Report on the Algorithmic Language Scheme WILLIAM CLINGER AND JONATHAN REES (Editors) H. ABELSON R. K. DYBVIG C. T. HAYNES G. J. ROZAS N. I. ADAMS IV D. P. FRIEDMAN E. KOHLBECKER G. L. STEELE JR. D. H. BARTLEY R. HALSTEAD D. OXLEY G. J. SUSSMAN G. BROOKS C. HANSON K. M. PITMAN M. WAND Dedicated |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/sc2c-embed.ps.gz, 19960118
Embedded Scheme->C -- 1 February 1993 One of the major goals of Scheme->C was to build a Scheme compiler and runtime system that could coexist with other programming languages. While this effort has been quite successful, Scheme->C has not offered everything needed by applications that wish to embed a |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/sc2c-intro.ps.gz, 19960118
An Introduction to Scheme->C in 19 Prompts 12 August 1988 Scheme->C is an implementation of the language Scheme. Besides the usual interpreter, the implementation includes an unusual compiler which compiles Scheme to C. This allows stand-alone programs and programs combining Scheme and other programming |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/sc2c-embed.ps.gz, 19960118
Embedded Scheme->C -- 1 February 1993 One of the major goals of Scheme->C was to build a Scheme compiler and runtime system that could coexist with other programming languages. While this effort has been quite successful, Scheme->C has not offered everything needed by applications that wish to embed a |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/sc2c-intro.ps.gz, 19960118
An Introduction to Scheme->C in 19 Prompts 12 August 1988 Scheme->C is an implementation of the language Scheme. Besides the usual interpreter, the implementation includes an unusual compiler which compiles Scheme to C. This allows stand-alone programs and programs combining Scheme and other programming |
| ftp://ftp.cs.ust.hk/pub/gbaciu/papers/afront.ps.gz, 19960119
Advancing Front Meshing for Radiosity Solutions George Baciu and Rico K. W. Tsang The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/video/papers/MVA94.ps.gz, 19960121
A Robust Approach for Camera Break Detection in Color Video Sequence 1 John Chung-Mong LEE and Dixon Man-Ching IP Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/video/papers/vdb1.ps.gz, 19960124
VIMS: A Video Information Manipulation System John Chung-Mong LEE Qing LI Wei XIONG Dept of Computer Science Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-04.ps.gz, 19960124
Knowledge Discovery in Databases Beat W uthrich The Hong Kong University of Science and Technology Clear Water Bay Kowloon, Hong Kong e-mail: beat@cs.ust.hk phone: (852) 2358 7013 fax: (852) 2358 1477 January 23, 1996 1 |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-4Chap4.ps.gz, 19960125
Chapter 4 Time We have seen that uncertainty is a frequently occurring phenomenon of information or data. Another phenomenon is time. In many practical (discovery) applications it is not only crucial to store (predict respectively) information but also to keep track of when the information is valid. If |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-4Chap3.ps.gz, 19960125
Chapter 3 Uncertainty In chapter 1 we saw that uncertainty is an important concept for knowledge discovery. Firstly, the discovered rules will very unlikely be able to predict every case one hundred percent accurately. The predictions are therefore uncertain. Secondly, even when discoverying knowledge |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-04Chap5.ps.gz, 19960125
Chapter 5 Learning Propositional Rules and Decision Trees In section 2.1 we introduced the syntax and the semantics of propositional rules which are equivalent in expressive power to decision trees. In this section we introduce basic symbolic machine learning techniques. More details on the topics |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-4Chap10.ps.gz, 19960125
Chapter 10 Discovering Timely Information Novel techniques to forecast daily currency exchange rates and a system that incorporates these techniques are presented. Forecastings are obtained from automatically generated probabilistic decision rules, threshold values and global optimization techniques for |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-4Chap6.ps.gz, 19960125
Chapter 6 Learning Datalog Rules We outline ways and means to learn Datalog rules. Datalog programs are function-free Logic Programs and therefore the research area dealing with the learning of Datalog programs is also known under the name Inductive Logic Programming. As mentioned in chapter 2, |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-04Chap2.ps.gz, 19960125
Chapter 2 Rule Languages We have seen that one way - the most popular one - of discovering knowledge is to learn deduction rules from training examples and information kept in a database or knowledge base. The generation or discovery of rules can also be supported by user interaction and can thus be |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-04Chap3.ps.gz, 19960125
Chapter 3 Uncertainty In chapter 1 we saw that uncertainty is an important concept for knowledge discovery. Firstly, the discovered rules will very unlikely be able to predict every case one hundred percent accurately. The predictions are therefore uncertain. Secondly, even when discoverying knowledge |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-4Biblio.ps.gz, 19960125
Bibliography S-Plus, Guide to Statistical and Mathematical Analysis, version 3.2. December 1993. Mit dem Rechner Risiken erkennen (Detecting Risks with Computers). Finanz und Wirtschaft, 24 Dec 1994. in German. Moderne Prognose Instumente F ur Finanzm arkte (Modern Forecasting Instruments |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-4Chap1.ps.gz, 19960125
Chapter 1 Introduction This chapter provides a short overview on the topics covered by the course COMP337/COMP537 Knowledge Discovery in Databases taught in Spring 96 at the Hong Kong University of Science and Technology. We intend to cover the following topics. 1.1 Course Outline ffl Overview and |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-4Chap5.ps.gz, 19960125
Chapter 5 Learning Propositional Rules and Decision Trees In section 2.1 we introduced the syntax and the semantics of propositional rules which are equivalent in expressive power to decision trees. In this section we introduce basic symbolic machine learning techniques. More details on the topics |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-4Chap8.ps.gz, 19960125
Chapter 8 Consistent Forecastings 8.1 Introduction In various application domains such as business, manufacturing and medicine, forecasting and discovery tools become increasingly important . Sales managers base forecasts on various product history variables; marketers consider the complex set of |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-04Chap8.ps.gz, 19960125
Chapter 8 Consistent Forecastings 8.1 Introduction In various application domains such as business, manufacturing and medicine, forecasting and discovery tools become increasingly important . Sales managers base forecasts on various product history variables; marketers consider the complex set of |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-04contents.ps.gz, 19960125
Knowledge Discovery in Databases Beat W uthrich The Hong Kong University of Science and Technology Clear Water Bay Kowloon, Hong Kong e-mail: beat@cs.ust.hk phone: (852) 2358 7013 fax: (852) 2358 1477 January 23, 1996 1 |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-04Chap10.ps.gz, 19960125
Chapter 10 Discovering Timely Information Novel techniques to forecast daily currency exchange rates and a system that incorporates these techniques are presented. Forecastings are obtained from automatically generated probabilistic decision rules, threshold values and global optimization techniques for |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-4Chap7.ps.gz, 19960125
Chapter 7 Learning Probabilistic Datalog In this chapter we give the theoretical aspects underlying the system ProbKB. 7.1 Handling Rule Probabilities The calculus of probabilistic Datalog introduced in section 3.3 does not show how to handle conditional probabilities of rules but only deals with |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-04Chap6.ps.gz, 19960125
Chapter 6 Learning Datalog Rules We outline ways and means to learn Datalog rules. Datalog programs are function-free Logic Programs and therefore the research area dealing with the learning of Datalog programs is also known under the name Inductive Logic Programming. As mentioned in chapter 2, |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-4Chap2.ps.gz, 19960125
Chapter 2 Rule Languages We have seen that one way - the most popular one - of discovering knowledge is to learn deduction rules from training examples and information kept in a database or knowledge base. The generation or discovery of rules can also be supported by user interaction and can thus be |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-04Chap7.ps.gz, 19960125
Chapter 7 Learning Probabilistic Datalog In this chapter we give the theoretical aspects underlying the system ProbKB. 7.1 Handling Rule Probabilities The calculus of probabilistic Datalog introduced in section 3.3 does not show how to handle conditional probabilities of rules but only deals with |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-4ChapAck.ps.gz, 19960125
CHAPTER 10. DISCOVERING TIMELY INFORMATION 156 Acknowledgements I am very grateful to my postgraduate students Tong Wing Chung, Krishnan Sankaran and Cho Wing Sing. This book would not have been written without their collaboration and their contributions. Most of the systems mentioned herein have been |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-04Chap9.ps.gz, 19960125
Chapter 9 Learning Probabilistic FQL* We present the data mining tool DISCOVER. describes and gives access to a database contains objects or patients each with the following information. 1. LCORE (patient's internal temperature in C): high (> 37), mid (>= 36 and <= 37), low (< 36) 2. LSURF |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-4Chap9.ps.gz, 19960125
Chapter 9 Learning Probabilistic FQL* We present the data mining tool DISCOVER. describes and gives access to a database contains objects or patients each with the following information. 1. LCORE (patient's internal temperature in C): high (> 37), mid (>= 36 and <= 37), low (< 36) 2. LSURF |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-4contents.ps.gz, 19960125
Knowledge Discovery in Databases Beat W uthrich The Hong Kong University of Science and Technology Clear Water Bay Kowloon, Hong Kong e-mail: beat@cs.ust.hk phone: (852) 2358 7013 fax: (852) 2358 1477 January 23, 1996 1 |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-04Chap1.ps.gz, 19960125
Chapter 1 Introduction This chapter provides a short overview on the topics covered by the course COMP337/COMP537 Knowledge Discovery in Databases taught in Spring 96 at the Hong Kong University of Science and Technology. We intend to cover the following topics. 1.1 Course Outline ffl Overview and |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-04Biblio.ps.gz, 19960125
Bibliography S-Plus, Guide to Statistical and Mathematical Analysis, version 3.2. December 1993. Mit dem Rechner Risiken erkennen (Detecting Risks with Computers). Finanz und Wirtschaft, 24 Dec 1994. in German. Moderne Prognose Instumente F ur Finanzm arkte (Modern Forecasting Instruments |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-04ChapAck.ps.gz, 19960125
CHAPTER 10. DISCOVERING TIMELY INFORMATION 156 Acknowledgements I am very grateful to my postgraduate students Tong Wing Chung, Krishnan Sankaran and Cho Wing Sing. This book would not have been written without their collaboration and their contributions. Most of the systems mentioned herein have been |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-04Chap4.ps.gz, 19960125
Chapter 4 Time We have seen that uncertainty is a frequently occurring phenomenon of information or data. Another phenomenon is time. In many practical (discovery) applications it is not only crucial to store (predict respectively) information but also to keep track of when the information is valid. If |
| ftp://ftp.cs.ust.hk/pub/lzhang/courseUai/lec2.ps, 19960129
2. Probabilistic reasoning (a). Bayesian newtorks In the intentional approach: ffl A problem domain is modelled by a list of variables x1, x2, : : : , xn, ffl Knowledge about the problem domain is represented by a joint probability P (x1; x2; : : : ; xn). Advantages: ffl Clear semantics, ffl In theory, |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp523/s95/hwk5.ps.gz, 19960201
Hong Kong University of Science and Technology COMP523: Artificial Neural Networks Spring Semester, 1994/95 Homework Assignment 5: Hopfield Model for Optimizing Switching Control Due date: 23 May 1995 Statement of the Problem In many networking applications, switching control is a crucial issue which |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/set1.ps.gz, 19960201
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1996 Problem Set 1: Programming in Scheme Due: 9 February 1996, in lecture Preamble The exercises in this problem set were adapted from Springer and Friedman's Scheme and the Art of Programming. The |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp523/hwk5.ps.gz, 19960201
Hong Kong University of Science and Technology COMP523: Artificial Neural Networks Spring Semester, 1994/95 Homework Assignment 5: Hopfield Model for Optimizing Switching Control Due date: 23 May 1995 Statement of the Problem In many networking applications, switching control is a crucial issue which |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/set1.ps.gz, 19960201
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1996 Problem Set 1: Programming in Scheme Due: 9 February 1996, in lecture Preamble The exercises in this problem set were adapted from Springer and Friedman's Scheme and the Art of Programming. The |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/mitsc-ref.ps.gz, 19960205
MIT Scheme Reference Manual Edition 1.52 beta for Scheme Release 7.4 30 May 1995 by Chris Hanson the MIT Scheme Team and a cast of thousands Copyright c 1988-95 Massachusetts Institute of Technology This material was developed by the Scheme project at the Massachusetts Institute of Technology, |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/mitsc-user.ps.gz, 19960205
MIT Scheme User's Manual Edition 1.27 beta for Scheme Release 7.4 May 30, 1995 by Stephen Adams Chris Hanson and the MIT Scheme Team Copyright c 1991-95 Massachusetts Institute of Technology This material was developed by the Scheme project at the Massachusetts Institute of Technology, Department of |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/mitsc-user.ps.gz, 19960205
MIT Scheme User's Manual Edition 1.27 beta for Scheme Release 7.4 May 30, 1995 by Stephen Adams Chris Hanson and the MIT Scheme Team Copyright c 1991-95 Massachusetts Institute of Technology This material was developed by the Scheme project at the Massachusetts Institute of Technology, Department of |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect2.ps, 19960209
COMP 361 DATA COMMUNICATIONS 1 DATA COMMUNICATIONS COMP 361 DATA COMMUNICATIONS 2 Data Transmission Data transmission from a sender to a receiver requires the use of a transmission medium: - Guided media: twisted pair, coaxial cable, fiber optic cable - Unguided media: microwave, satellite transmission, |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect4.ps, 19960209
COMP 361 DATA COMMUNICATIONS 29 Analog Modulation Carrier signal Modulating signal Amplitude modulated wave Phase-modulated wave Frequency-modulated wave COMP 361 DATA COMMUNICATIONS 30 Digital Transmission Digital data is transferred along a single communication path one bit at a time Synchronization |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect1.ps, 19960209
COMP 361 INTRODUCTION 1 COMP 361 COMPUTER COMMUNICATION NETWORKS Jogesh K. Muppala Section L2 COMP 361 INTRODUCTION 2 INTRODUCTION COMP 361 INTRODUCTION 3 Computer Communications Information technology has been the driving force this century There has been a revolution in the way information is |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect3.ps, 19960209
COMP 361 DATA COMMUNICATIONS 17 Guided Media: Coaxial Cable It is constructed using an outer hollow cylindrical conductor enclosing an inner single wire conductor Used in long distance telephone and tele- vision (cable) transmission and distribution Used to construct local area networks Data rate is |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect6.ps, 19960209
COMP 361 MEDIUM ACCESS SUBLAYER 1 MEDIUM ACCESS SUBLAYER COMP 361 MEDIUM ACCESS SUBLAYER 2 Local and Metropolitan Area Networks Local area networks (LANs) and metropolitan area networks (MANs) are designed to interconnect computers within a small geographical area like a room, building, campus, or a |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect5.ps, 19960209
COMP 361 DATA COMMUNICATIONS 37 RS-232-C Specifications The procedural specification indicates the protocol and handshaking used in the exchange of data User dials numbers Dial digits DTR on RI on RTS on Tone on CD on DTR on DCR on Short delay CTS on TxDData tones Tone off RxD CD off CTS off RTS on RTS |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-05.ps.gz, 19960212
Incorporation of Context Constraints for Compositional Reachability Analysis Shing-chi Cheung* and Jeff Kramer Technical Report HKUST-CS96-5 February 1996 *Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong (email: scc@cs.ust.hk) |
| ftp://ftp.cs.ust.hk/pub/bli/180/courseinfo.ps, 19960213
HKUST Computer Science SYLLABUS (by week) 1. Introduction, hardware and software, high level programming versus low level programming; 2. Assembly language programming, registers, memory, programming model, DOS and BIOS interrupt calls; 3. Data representation, binary arithmetic; 4. 1 s complement, 2 s |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect1.ps, 19960214
COMP 361 INTRODUCTION 1 COMP 361 COMPUTER COMMUNICATION NETWORKS Jogesh K. Muppala Section L2 COMP 361 INTRODUCTION 2 INTRODUCTION COMP 361 INTRODUCTION 3 Computer Communications Information technology has been the driving force this century There has been a revolution in the way information is |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect2.ps, 19960214
COMP 361 DATA COMMUNICATIONS 1 DATA COMMUNICATIONS COMP 361 DATA COMMUNICATIONS 2 Data Transmission Data transmission from a sender to a receiver requires the use of a transmission medium: - Guided media: twisted pair, coaxial cable, fiber optic cable - Unguided media: microwave, satellite transmission, |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect3.ps, 19960214
COMP 361 DATA COMMUNICATIONS 17 Guided Media: Coaxial Cable It is constructed using an outer hollow cylindrical conductor enclosing an inner single wire conductor Used in long distance telephone and tele- vision (cable) transmission and distribution Used to construct local area networks Data rate is |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect4.ps, 19960214
COMP 361 DATA COMMUNICATIONS 29 Analog Modulation Carrier signal Modulating signal Amplitude modulated wave Phase-modulated wave Frequency-modulated wave COMP 361 DATA COMMUNICATIONS 30 Digital Transmission Digital data is transferred along a single communication path one bit at a time Synchronization |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect5.ps, 19960214
COMP 361 DATA COMMUNICATIONS 37 RS-232-C Specifications The procedural specification indicates the protocol and handshaking used in the exchange of data User dials numbers Dial digits DTR on RI on RTS on Tone on CD on DTR on DCR on Short delay CTS on TxDData tones Tone off RxD CD off CTS off RTS on RTS |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect6.ps, 19960214
COMP 361 MEDIUM ACCESS SUBLAYER 1 MEDIUM ACCESS SUBLAYER COMP 361 MEDIUM ACCESS SUBLAYER 2 Local and Metropolitan Area Networks Local area networks (LANs) and metropolitan area networks (MANs) are designed to interconnect computers within a small geographical area like a room, building, campus, or a |
| ftp://ftp.cs.ust.hk/pub/bli/180/lec5.ps, 19960214
HKUST 1 Computer Science COMP 180 Lecture 5 Today s Topics Assembly Language -- Revisit Pseudo-ops Some useful directives Some useful operators Some arithmetic instructions Data representation. HKUST 2 Computer Science COMP 180 Lecture 5 The Structure of Assembly Language Programs The assembly language |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/hwk1.ps.gz, 19960215
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1996 Programming Assignment 1: A Search Due: 29 February 1996, 5pm (Part A); 11 March 1996, 5pm (Part B) Part A: Warming Up with the 8-Puzzle Problem Description Detailed description of the 8-puzzle |
| ftp://ftp.cs.ust.hk/pub/bli/180/lec1.ps, 19960215
COMP 180 INTRODUCTION 1 COMP 180 COMPUTER ORGANIZATION Dr. Bo Li Room 3505 E-Mail: BLI@cs.ust.hk COMP 180 INTRODUCTION 2 NOTICES Section 1 versus Section 2 Lab requirements Homework Assignment Midterm Examination (week 8) Final Examination Q & A Notes and Syllabus --> Library Reserve Office Hours 15:00 |
| ftp://ftp.cs.ust.hk/pub/csricky/ispan96-camera.ps.gz, 19960215
Abstract1 In this paper, we survey algorithms that allocate a parallel program represented by an edge-weighted directed acyclic graph (DAG), also called a task graph or macrodataflow graph, to a set of homogeneous processors, with the objective of minimizing the completion time. We analyze 21 such |
| ftp://ftp.cs.ust.hk/pub/bli/180/lec2.ps, 19960215
HKUST 1 Computer Science COMP 180 Lecture 2 Today s Topics Basic Computer Components Operation of CPU Data path Secondary memory Magnetic disks Magnetic tapes Input/Output structures of main-frame computers and PC s Terminals Modem HKUST 2 Computer Science COMP 180 Lecture 2 Computer Architecture |
| ftp://ftp.cs.ust.hk/pub/bli/180/lec3.ps, 19960215
HKUST 1 Computer Science COMP 180 Lecture 3 Today s Topics Main Memory Structure. Q & A. Assembly Language. Assembler. Linker. Intel 8088 HKUST 2 Computer Science COMP 180 Lecture 3 Memory System (1) Main Memory It is also called RAM or Primary Storage (2) Secondary Memory Magnetic Tapes, Magnetic |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/set2.ps.gz, 19960215
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1996 Problem Set 2: Problem Solving as Search Due: 1 March 1996, in lecture The exercises in this problem set are from the textbook. Exercises 4.1, 4.4, 5.1, 5.8a Optional 4.7, 5.16 |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/set2.ps.gz, 19960215
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1996 Problem Set 2: Problem Solving as Search Due: 1 March 1996, in lecture The exercises in this problem set are from the textbook. Exercises 4.1, 4.4, 5.1, 5.8a Optional 4.7, 5.16 |
| ftp://ftp.cs.ust.hk/pub/csricky/A4/survey-ispan96.ps.gz, 19960215
Abstract1 In this paper, we survey algorithms that allocate a parallel program represented by an edge-weighted directed acyclic graph (DAG), also called a task graph or macrodataflow graph, to a set of homogeneous processors, with the objective of minimizing the completion time. We analyze 21 such |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/hwk1.ps.gz, 19960215
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1996 Programming Assignment 1: A Search Due: 29 February 1996, 5pm (Part A); 11 March 1996, 5pm (Part B) Part A: Warming Up with the 8-Puzzle Problem Description Detailed description of the 8-puzzle |
| ftp://ftp.cs.ust.hk/pub/bli/180/lec6.ps, 19960217
HKUST 1 Computer Science COMP 180 Lecture 6 Today s Topics Conversion among different number system. Binary arithmetic. Signed Binary Numbers 1 s complement 2 s complement HKUST 2 Computer Science COMP 180 Lecture 6 Conversion from decimal to binary, octal, and hex. By repeated division or |
| ftp://ftp.cs.ust.hk/pub/dekai/cemnlp96-annex.ps.gz, 19960219
(advph(sadv ) , )(nounph(modph(aa(a )))(nounph(noun(nc ))))(clause(nounph(modph(aa(vi1 )))(nounph(noun(nc ))))(verbph(vi1(vadv )(vi1 )))) , (clause(verbph(verbph(vn(neg )(vn(auxvb(aux ))(vn )))(nounph(modph(aa(a )))(nounph(noun(nc )))))(verbph(advph(sadv ))(verbph(vn )(nounph(noun(nc ))))))) , |
| ftp://ftp.cs.ust.hk/pub/roland/cell.ps.Z, 19960221
Automated Analysis of Nerve-Cell Images Using Active Contour Models1 Ying-Lun Fok x, Joseph Chan z and Roland T. Chin xy y Electrical & Computer Engineering University of Wisconsin, Madison, Wisconsin 53706 x Computer Science Department Hong Kong University of Science & Technology z Division of |
| ftp://ftp.cs.ust.hk/pub/roland/concave.ps.Z, 19960221
Decomposition of Arbitrarily-Shaped Morphological Structuring Elements Hochong Park and Roland T. Chin* Department of Electrical and Computer Engineering University of Wisconsin - Madison Madison, Wisconsin 53706 |
| ftp://ftp.cs.ust.hk/pub/roland/hajj.2d.ps.Z, 19960221
A 2D Multirate Bayesian Framework For Multiscale Feature Detection Hazem H. Hajj, Truong Q. Nguyen, and Roland T. Chin |
| ftp://ftp.cs.ust.hk/pub/roland/convex.ps.Z, 19960221
Optimal Decomposition of Convex Morphological Structuring Elements for 4-Connected Parallel Array Processors Hochong Park and Roland T. Chin Department of Electrical and Computer Engineering University of Wisconsin - Madison 1415 Johnson Drive Madison, Wisconsin 53706 |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/topic05.ps.gz, 19960222
COMP221: Fundamentals of Artificial Intelligence Topic 5: Knowledge Representation and Reasoning Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Knowledge Representation and Reasoning 1 Knowledge-Based Agents ffl Two main |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/topic05.ps.gz, 19960222
COMP221: Fundamentals of Artificial Intelligence Topic 5: Knowledge Representation and Reasoning Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Knowledge Representation and Reasoning 1 Knowledge-Based Agents ffl Two main |
| ftp://ftp.cs.ust.hk/pub/roland/deform.ps.Z, 19960222
Deformable Contours: Modeling and Extraction1 Kok F. Lai and Roland T. Chin |
| ftp://ftp.cs.ust.hk/pub/lzhang/kr92.ps.gz, 19960223
Stepwise-Decomposable Influence Diagrams (Nevin) Lianwen Zhang and David Poole Department of Computer Science University of British Columbia Vancouver, B.C., V6T 1Z2, Canada E-mail: lzhang@cs.ubc.ca poole@cs.ubc.ca |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/sol-quiz1.ps, 19960223
Department of Computer Science The Hong Kong University of Science and Technology COMP 361 Sec. 2 (Spring 1996) Quiz 1 1 COMP 361 Computer Communication Networks/Section 2 Spring Semester 1996 Quiz 1 Date: February 16, 1996 Time: 11:30 - 11:50 (20 minutes) Instructions: 1. Please write your name, |
| ftp://ftp.cs.ust.hk/pub/lzhang/ais94.ps.gz, 19960223
Minimizing decision table sizes in influence diagrams: dimension shrinking1 Nevin Lianwen Zhang2, Runping Qi and David Poole Department of Computer Science University of British Columbia Vancouver, B.C. V6T 1Z2, CANADA |
| ftp://ftp.cs.ust.hk/pub/lzhang/uai93.ps.gz, 19960223
Incremental computation of the value of perfect information in stepwise-decomposable influence diagrams (Nevin) Lianwen Zhang, Runping Qi, and David Poole Department of Computer Science University of British Columbia Vancouver, B.C., Canada flzhang, qi, pooleg@cs.ubc.ca |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4sol-quiz1.ps, 19960223
Dept. of CS/HKUST COMP 361 Sec. 2 (Spring 1996) Quiz 1 2 Student ID:____________________ 3. An asynchronous transmission system uses a start bit of length one bit time, and a stop bit of length two bit times. The character length, including the parity bit is 6 bit times. What is the percentage overhead |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect9.ps, 19960227
COMP 361 MEDIUM ACCESS SUBLAYER 21 IEEE 802.4 Token Bus Medium options: The medium access control technique is the token bus algorithm Medium access control A control frame is used to carry out ring maintenance operations Option Transmission medium Signalling technique Data rate (Mbps) Max. Seg. length |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect9.ps, 19960227
COMP 361 MEDIUM ACCESS SUBLAYER 21 IEEE 802.4 Token Bus Medium options: The medium access control technique is the token bus algorithm Medium access control A control frame is used to carry out ring maintenance operations Option Transmission medium Signalling technique Data rate (Mbps) Max. Seg. length |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/topic02.ps.gz, 19960229
COMP221: Fundamentals of Artificial Intelligence Topic 2: Scheme Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Scheme 1 The Scheme Programming Language ffl Scheme: { A dialect of Lisp { Interactive functional |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/topic02.ps.gz, 19960229
COMP221: Fundamentals of Artificial Intelligence Topic 2: Scheme Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Scheme 1 The Scheme Programming Language ffl Scheme: { A dialect of Lisp { Interactive functional |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/topic01.ps.gz, 19960229
COMP221: Fundamentals of Artificial Intelligence Topic 1: Introduction Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Introduction 1 Artificial Intelligence ffl The term Artificial Intelligence (AI)" was first coined in |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/topic03.ps.gz, 19960229
COMP221: Fundamentals of Artificial Intelligence Topic 3: Problem Solving as Search Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Problem Solving as Search 1 Problem-Solving Agents ffl Key ideas: { To determine what the |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/topic04.ps.gz, 19960229
COMP221: Fundamentals of Artificial Intelligence Topic 4: Game Playing Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Game Playing 1 Games as Search Problems ffl Mainly two-player games are considered. ffl Two-player |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/topic01.ps.gz, 19960229
COMP221: Fundamentals of Artificial Intelligence Topic 1: Introduction Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Introduction 1 Artificial Intelligence ffl The term Artificial Intelligence (AI)" was first coined in |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/topic06.ps.gz, 19960229
COMP221: Fundamentals of Artificial Intelligence Topic 6: First-Order Logic Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 First-Order Logic 1 Why First-Order Logic ffl Propositional logic is limited in representation |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/topic06.ps.gz, 19960229
COMP221: Fundamentals of Artificial Intelligence Topic 6: First-Order Logic Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 First-Order Logic 1 Why First-Order Logic ffl Propositional logic is limited in representation |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/topic04.ps.gz, 19960229
COMP221: Fundamentals of Artificial Intelligence Topic 4: Game Playing Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Game Playing 1 Games as Search Problems ffl Mainly two-player games are considered. ffl Two-player |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/topic03.ps.gz, 19960229
COMP221: Fundamentals of Artificial Intelligence Topic 3: Problem Solving as Search Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Problem Solving as Search 1 Problem-Solving Agents ffl Key ideas: { To determine what the |
| ftp://ftp.cs.ust.hk/pub/avi/pubs/pixelInteraction.ps.Z, 19960303
Spatial non-linearities of grayscale CRT pixels Avi C. Naiman Walter Makous Center for Visual Science Psychology Department University of Rochester Rochester, New York, 14627 |
| ftp://ftp.cs.ust.hk/pub/avi/pubs/jaggies.SID.95.ps.Z, 19960303
10.1 / Naiman 10.1: The Visibility of Higher-Level Jags A. C. Naiman Hong Kong University of Science and Technology, Kowloon, Hong Kong W. Makous University of Rochester, Rochester, NY |
| ftp://ftp.cs.ust.hk/pub/avi/pubs/jaggies.SID.94.ps.Z, 19960303
15.3: Late-News Paper: Jagged Edges and Their Visibility A. C. Naiman Hong Kong University of Science and Technology, Kowloon, Hong Kong W. Makous Center for Visual Science, University of Rochester, Rochester, NY |
| ftp://ftp.cs.ust.hk/pub/avi/pubs/jaggies.PG.ps.Z, 19960303
International Conference Proceedings Pacific Graphics'94 / CADDM'94 August 26 29, 1994, Beijing, China COMPUTING THE JAGGEDNESS OF EDGES Avi C. Naiman Department of Computer Science, Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong Walter Makous Center for Visual |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect10.ps, 19960305
COMP 361 MEDIUM ACCESS SUBLAYER 33 Comparison of Protocols In general there is no clear winner Property CSMA/CD Token Bus Token Ring Protocol Simple Complex Complex Addition/ Deletion Simple Bus maintenance Ring maintenance Delay Non-deterministic Deterministic Deterministic Priorities Not possible |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect10.ps, 19960305
COMP 361 MEDIUM ACCESS SUBLAYER 33 Comparison of Protocols In general there is no clear winner Property CSMA/CD Token Bus Token Ring Protocol Simple Complex Complex Addition/ Deletion Simple Bus maintenance Ring maintenance Delay Non-deterministic Deterministic Deterministic Priorities Not possible |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-01.ps.gz, 19960305
Theoretical Analysis of the Heterogeneous Dynamic Load Balancing Problem Using a Hydro-Dynamic Approachy Chi-Chung Hui and Samuel T. Chanson Technical Report HKUST-CS96-01 March 5, 1996 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/bli/180/lecture9-10.ps, 19960306
COMP 180 Lecture 9-10 1 of 17 Today s Topic Addressing Modes (8088) 8088 Registers Register Immediate Direct Register Indirect Base-Plus-Index Register Relative Base Relative-Plus-Index COMP 180 Lecture 9-10 2 of 17 8088 Registers (Re-visit) Data Registers: AX (accumulator), BX (Base register), CX |
| ftp://ftp.cs.ust.hk/pub/video/papers/txture-classif.ps.gz, 19960307
1 An Efficient and Effective Texture Classification Approach Using a New Notion in Wavelet Theory1 Jian-Feng Liu and John Chung-Mong Lee Department of Computer Science, Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong Email: jane@cs.ust.hk or cmlee@cs.ust.hk < Abstract> |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/trset1.ps, 19960307
COMP 361 - Spring 1996 March 7, 1996 1 COMP 361 - Spring 1996 Training Problem Set 1 1. Compute the bandwidth needed to transmit square wave with data transmission rate of 2 Mbps and without the DC component, if only the fundamental frequency and first three harmonics are transmitted. Solution: The bit |
| ftp://ftp.cs.ust.hk/pub/dekai/ijcai95.Wu.ps.Z, 19960309
To appear in IJCAI-95, Proc. of the 14th International Joint Conference on Artificial Intelligence, Montreal: Aug. 95. Stochastic Inversion Transduction Grammars, with Application to Segmentation, Bracketing, and Alignment of Parallel Corpora Dekai Wu Technical Report HKUST-CS95-30 June 1995 HKUST |
| ftp://ftp.cs.ust.hk/pub/bli/180/lec7-8.ps, 19960309
HKUST 1 Computer Science COMP 180 Lecture 7-8 Today s Topics Finite precision numbers. Floating point numbers. HKUST 2 Computer Science COMP 180 Lecture 7-8 Finite precision numbers. The arithmetic used by computer differs in certain ways from the arithmetic we use. The numbers used in computer is |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/set3.ps.gz, 19960311
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1996 Problem Set 3: First-Order Logic and Reasoning Due: 22 March 1996, in lecture The exercises in this problem set are from the textbook. Exercises ffl 7.2 ffl 7.6 (modified): Write axioms describing |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/set3.ps.gz, 19960311
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1996 Problem Set 3: First-Order Logic and Reasoning Due: 22 March 1996, in lecture The exercises in this problem set are from the textbook. Exercises ffl 7.2 ffl 7.6 (modified): Write axioms describing |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect14.ps, 19960312
COMP 361 DATA LINK LAYER 1 DATA LINK LAYER COMP 361 DATA LINK LAYER 2 Why Data Link Layer The data link layer is responsible for efficient and reliable communication across a physical link The data link layer must provide: - Frame synchronization: cleary identify the beginning and end of each frame |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/topic08.ps.gz, 19960312
COMP221: Fundamentals of Artificial Intelligence Topic 8: Probabilistic Reasoning Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Probabilistic Reasoning 1 Pure Logical Agents Are Inadequate ffl The logical agent approach |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4sol-quiz2.ps, 19960312
Department of Computer Science The Hong Kong University of Science and Technology COMP 361 Sec. 2 (Spring 1996) Quiz 2 1 COMP 361 Computer Communication Networks/Section 2 Spring Semester 1996 Quiz 2 Date: March 8, 1996 Time: 11:30 - 11:50 (20 minutes) Instructions: 1. Please write your name, student ID |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect14.ps, 19960312
COMP 361 DATA LINK LAYER 1 DATA LINK LAYER COMP 361 DATA LINK LAYER 2 Why Data Link Layer The data link layer is responsible for efficient and reliable communication across a physical link The data link layer must provide: - Frame synchronization: cleary identify the beginning and end of each frame |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/sol-quiz2.ps, 19960312
Department of Computer Science The Hong Kong University of Science and Technology COMP 361 Sec. 2 (Spring 1996) Quiz 2 1 COMP 361 Computer Communication Networks/Section 2 Spring Semester 1996 Quiz 2 Date: March 8, 1996 Time: 11:30 - 11:50 (20 minutes) Instructions: 1. Please write your name, student ID |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/topic08.ps.gz, 19960312
COMP221: Fundamentals of Artificial Intelligence Topic 8: Probabilistic Reasoning Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Probabilistic Reasoning 1 Pure Logical Agents Are Inadequate ffl The logical agent approach |
| ftp://ftp.cs.ust.hk/pub/pam/GIS_slides.ps.gz, 19960314
Drew Historical Maps in GIS March , 1996 Integration of Technologies (Information) Could consider an integration of the two technologies (word/image mapper inside MVD browser and GIS) and hence, the types of information they support well. GIS already support annotation-to-feature mapping via a |
| ftp://ftp.cs.ust.hk/pub/william/cheung.accv95.ps.gz, 19960314
A Unified Framework for Handwritten Character Recognition using Deformable Models Kwok-Wai Cheung, Dit-Yan Yeung and Roland T. Chin Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Hong Kong Email: william@cs.ust.hk, dyyeung@cs.ust.hk, roland@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/william/cheung.dm_survey_draft.ps.gz, 19960314
Deformable Models for Visual Pattern Recognition: A Survey Kwok-Wai Cheung, We-Ming Go, Dit-Yan Yeung, Roland T. Chin Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Hong Kong Email: fwilliam, williamg, dyyeung, rolandg@cs.ust.hk February 9, 1996 |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/topic07.ps.gz, 19960315
COMP221: Fundamentals of Artificial Intelligence Topic 7: Logical Reasoning Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Logical Reasoning 1 Inference Rules ffl Inference rules for propositional logic and FOL: { Modus |
| ftp://ftp.cs.ust.hk/pub/bli/180/lecture11-12.ps, 19960315
HKUST 1 Computer Science COMP 180 Lecture 11 Today s Topics Procedures Stack Jumps HKUST 2 Computer Science COMP 180 Lecture 11 Example - Program Structure Figure 2.5 (J. T. Godfrey s book -- IBM Microcomputer Assembly Language) HKUST 3 Computer Science COMP 180 Lecture 11 Pseudo-ops segname SEGMENT |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.cvpr96.ps.gz, 19960315
Competitive Mixture of Deformable Models for Pattern Classification Kwok-Wai Cheung Dit-Yan Yeung Roland T. Chin Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Hong Kong fwilliam, dyyeung, rolandg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/topic07.ps.gz, 19960315
COMP221: Fundamentals of Artificial Intelligence Topic 7: Logical Reasoning Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Logical Reasoning 1 Inference Rules ffl Inference rules for propositional logic and FOL: { Modus |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/trset2.ps, 19960316
COMP 361 Sect. 2 (Spring 96) Training Problem Set 2 1 COMP 361-Spring 1996 Training Problem Set 2 1. Explain the flaw in the following logic. Packet switching requires control and address bits to be added to each packet. This causes considerable overhead in packet switching. In circuit switching, |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/sockets.ps, 19960318
COMP 361 sockets 24 TCP client example: #include inet.h main(int argc, char *argv) int sockfd; struct sockaddr_in serv_addr; pname = argv; /* Fill in the structure serv_addr with the address of the server that we want to connect with. */ bzero((char *) &serv_addr, sizeof(serv_addr)); |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/phase1.ps, 19960318
COMP 361 Spring 96 Course Project 1 Description of the project(Phase 1) The subject of the course project is implementation of a client-server Student Registration System based on connection oriented protocol (TCP). This is a group project for a group of two students. Each group of students are required |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/trset3.ps, 19960318
COMP 361 Sect. 2 (Spring 96) Training Problem Set 3 1 COMP 361 - Spring 96 Training Problem Set 3 1. Explain the meaning of the terms signal propagation delay and transmission time. Assuming the velocity of signal propagation in a metallic conductor is 2 108 m/s, assume packet sizes are P bits each, |
| ftp://ftp.cs.ust.hk/pub/bli/seminar_3.19/presentation.ps, 19960320
Channel Access Protocols for High Speed Optical LANs: Bo Li Department of Computer Science Hong Kong University of Science and Technology Kowloon, Hong Kong Claims ffl This is not a paper. ffl This is not a talk on (All) Optical Networks (AONs) ffl This is not a solution oriented presentation. + 1 |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect16.ps, 19960320
COMP 361 DATA LINK LAYER 17 Sliding Window Protocol Performance If two stations exchange data, and if one of them has data and an acknowledgement to send, then it sends both together in one frame, thus saving communication capacity This is referred to as piggybacking 0.2 0.4 0.6 0.8 1 0.1 1 10 100 1000 |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect16.ps, 19960320
COMP 361 DATA LINK LAYER 17 Sliding Window Protocol Performance If two stations exchange data, and if one of them has data and an acknowledgement to send, then it sends both together in one frame, thus saving communication capacity This is referred to as piggybacking 0.2 0.4 0.6 0.8 1 0.1 1 10 100 1000 |
| ftp://ftp.cs.ust.hk/pub/bli/180/lecture13-14.ps, 19960321
COMP 180 Lecture 13-14 1 of 18 Input/Output Four different I/O schemes are commonly used: Programmed I/O with busy waiting o memory-mapped I/O o port-mapped I/O (also called isolated I/O or I/O-mapped I/O) Interrupt-driven I/O DMA I/O I/O using data channels and I/O processors. COMP 180 Lecture 13-14 2 |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect17.ps, 19960325
COMP 361 DATA LINK LAYER 33 Performance of stop-and- wait ARQ We define utilization as: where Tf is time for transmitter to emit a single frame, and Tt is total time engaged in the transmission of a single frame For error-free operation using stop-andwait ARQ: where Tp is the propogation delay and |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect17.ps, 19960325
COMP 361 DATA LINK LAYER 33 Performance of stop-and- wait ARQ We define utilization as: where Tf is time for transmitter to emit a single frame, and Tt is total time engaged in the transmission of a single frame For error-free operation using stop-and- wait ARQ: where Tp is the propogation delay and |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect18.ps, 19960327
COMP 361 DATA LINK LAYER 41 HDLC - Stations Three types of stations are supported: 1.Primary station: has the responsibility for controlling the operation of the link. Frames issued by primary are called commands. 2.Secondary station: operates under the control of the primary station. Frames issued by |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect18.ps, 19960327
COMP 361 DATA LINK LAYER 41 HDLC - Stations Three types of stations are supported: 1.Primary station: has the responsibility for controlling the operation of the link. Frames issued by primary are called commands. 2.Secondary station: operates under the control of the primary station. Frames issued by |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/topic09-example.ps.gz, 19960401
Example: Flashlight Diagnosis ffl Belief network: Bulb Battery VoltageBeam ffl Variables: Variable Possible Values Bulb Good Dead Battery Good (>2.8V) Weak (2.0{2.8V) Dead (<2.0V) Beam Bright Weak Dead Voltage >2.8V 2.0{2.8V <2.0V ffl The list of possible values (states) for each variable is mutually |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/topic09.ps.gz, 19960401
COMP221: Fundamentals of Artificial Intelligence Topic 9: Probabilistic Networks Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Probabilistic Networks 1 Belief Networks ffl A belief network is a compact graphical |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/topic09.ps.gz, 19960401
COMP221: Fundamentals of Artificial Intelligence Topic 9: Probabilistic Networks Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Probabilistic Networks 1 Belief Networks ffl A belief network is a compact graphical |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/topic09-example.ps.gz, 19960401
Example: Flashlight Diagnosis ffl Belief network: Bulb Battery VoltageBeam ffl Variables: Variable Possible Values Bulb Good Dead Battery Good (>2.8V) Weak (2.0{2.8V) Dead (<2.0V) Beam Bright Weak Dead Voltage >2.8V 2.0{2.8V <2.0V ffl The list of possible values (states) for each variable is mutually |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/set4.ps.gz, 19960402
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1996 Problem Set 4: Probabilistic Reasoning Due: 12 April 1996, in lecture The exercises in this problem set are from the textbook. Exercises ffl 14.3 ffl 14.6 ffl 14.8 ffl 15.1 |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/set4.ps.gz, 19960402
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1996 Problem Set 4: Probabilistic Reasoning Due: 12 April 1996, in lecture The exercises in this problem set are from the textbook. Exercises ffl 14.3 ffl 14.6 ffl 14.8 ffl 15.1 |
| ftp://ftp.cs.ust.hk/pub/csricky/CPFD-spdp94-camera.ps.gz, 19960408
Abstract1 Communication overhead is one of the main factors that can limit the speedup of parallel programs on messagepassing parallel architectures. This limiting factor is more predominant in distributed systems such as clusters of homogeneous or heterogeneous workstations. However, excessive |
| ftp://ftp.cs.ust.hk/pub/csricky/A4/cpfd-spdp94.ps.gz, 19960408
Abstract1 Communication overhead is one of the main factors that can limit the speedup of parallel programs on messagepassing parallel architectures. This limiting factor is more predominant in distributed systems such as clusters of homogeneous or heterogeneous workstations. However, excessive |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect19.ps, 19960409
COMP 361 NETWORK LAYER 1 NETWORK LAYER COMP 361 NETWORK LAYER 2 The Network Layer The data link layer was primarily responsible for reliable transfer of information across a physical link The network layer is responsible for providing transfer of data from the source to the destination The network layer |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/hwk2.ps.gz, 19960409
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1996 Programming Assignment 2: Bayesian Belief Networks Due: 30 April 1996 Netica API The Netica API (Application Program Interface) is a library of C-callable functions for working with Bayesian |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/hwk2.ps.gz, 19960409
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1996 Programming Assignment 2: Bayesian Belief Networks Due: 30 April 1996 Netica API The Netica API (Application Program Interface) is a library of C-callable functions for working with Bayesian |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect19.ps, 19960409
COMP 361 NETWORK LAYER 1 NETWORK LAYER COMP 361 NETWORK LAYER 2 The Network Layer The data link layer was primarily responsible for reliable transfer of information across a physical link The network layer is responsible for providing transfer of data from the source to the destination The network layer |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/courseinfo.ps.gz, 19960411
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1996 Instructor Dit-Yan Yeung, Rm 3541, 2358-6977, dyyeung@cs.ust.hk, http://www.cs.ust.hk/~dyyeung/ Office hours: Tuesday 10:00am{12:00noon (or by appointment) Teaching Assistant Sam P.M. Choi, Rm |
| ftp://ftp.cs.ust.hk/pub/bli/180/lec17.ps, 19960411
COMP 180 Lecture 17 1 Todays Topics Combinational circuits. Arithmetic circuits COMP 180 Lecture 17 2 Combinatorial Circuits Logic circuits can be classified into two types: - Combinatorial circuits: The outputs of these circuits are dependent only on the present inputs to the circuit (representable by |
| ftp://ftp.cs.ust.hk/pub/bli/180/lec16.ps, 19960411
COMP 180 Lecture 16 1 Today s Topic Transistor Logic gates (Integrated Circuits) Truth Tables Boolean Algebra COMP 180 Lecture 16 2 Digital Logic Digital computers are built using digital circuits Digital circuits are built using logic gates Logic gates are built out of electronic devices like |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/courseinfo.ps.gz, 19960411
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1996 Instructor Dit-Yan Yeung, Rm 3541, 2358-6977, dyyeung@cs.ust.hk, http://www.cs.ust.hk/~dyyeung/ Office hours: Tuesday 10:00am{12:00noon (or by appointment) Teaching Assistant Sam P.M. Choi, Rm |
| ftp://ftp.cs.ust.hk/pub/dwood/tong/thesis.ps.gz, 19960413
TreeDraw: A Tree-Drawing System by Tong Luo A thesis presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of Master of Mathematics in Computer Science Waterloo, Ontario, Canada, 1993 c Tong Luo 1993 I hereby declare that I am the sole author of this thesis. I |
| ftp://ftp.cs.ust.hk/pub/csricky/A4/fast-icpp96.ps.gz, 19960413
Abstract1 The DAG scheduling problem is a rich land of research and a plethora of algorithms for solving this problem have been reported in the literature. However, designing a scheduling algorithm of low complexity without sacrificing performance remains a challenging obstacle from a practical |
| ftp://ftp.cs.ust.hk/pub/csricky/FAST-icpp96-camera.ps.gz, 19960413
Abstract1 The DAG scheduling problem is a rich land of research and a plethora of algorithms for solving this problem have been reported in the literature. However, designing a scheduling algorithm of low complexity without sacrificing performance remains a challenging obstacle from a practical |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-07.ps.gz, 19960414
Multiparameter QoS admission control for ATM queues with Partial Buffer Sharing Mechanism y Jelena Mi<=si c and Samuel T. Chanson Technical Report HKUST-CS96-07 April 14, 1996 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong yThis |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/trset4.ps, 19960415
COMP 361 Sec. 2 (Spring 1996) Training Problem Set 4 1 COMP 361 - Spring 1996 Training problem set 4 1. A channel has a data rate of R bps and a propagation delay of t seconds per kilometer. The distance between the sending and receiving nodes is L kilometers. Nodes exchange fixedsize frames of B bits. |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/topic10.ps.gz, 19960415
COMP221: Fundamentals of Artificial Intelligence Topic 10: Machine Learning Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Machine Learning 1 Learning Agents ffl Agents that can learn from experience as a result of |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/topic10.ps.gz, 19960415
COMP221: Fundamentals of Artificial Intelligence Topic 10: Machine Learning Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Machine Learning 1 Learning Agents ffl Agents that can learn from experience as a result of |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect21.ps, 19960417
COMP 361 NETWORK LAYER 21 Traffic Control Scope Host Packet-switched node Packet-switching network Hop level (node-to-node) Entry-to-exit level Stream scope (internal virtual circuit) Network access level (node-to-node) Host-to-host level (exter nal vir tual circuit, transport connection) Host Network |
| ftp://ftp.cs.ust.hk/pub/dwood/vlad/india.ps, 19960417
Foundations for Faster External Sorting (Extended Abstract) Vladimir Estivill-Castro1 and Derick Wood2 1 LANIA, R ebsamen 80, Xalapa, Veracruz 91090, M exico. vlad@xalapa.lania.mx 2 Department of Computer Science,University of Western Ontario, London, Ontario N6A-5B7, Canada. dwood@csd.uwo.ca |
| ftp://ftp.cs.ust.hk/pub/dwood/vlad/ext.ps, 19960417
External Sorting and Nearly Sortedness1 Vladimir Estivill-Castro2 Derick Wood3 |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect21.ps, 19960417
COMP 361 NETWORK LAYER 21 Traffic Control Scope Host Packet-switched node Packet-switching network Hop level (node-to-node) Entr y-to-exit level Stream scope (inter nal virtual circuit) Network access level (node-to-node) Host-to-host level (external virtual circuit, transport connection) Host Network |
| ftp://ftp.cs.ust.hk/pub/dwood/vlad/var.ps, 19960417
An Adaptive Generic Sorting Algorithm that Uses Variable Partitioning1 Vladimir Estivill-Castro2 Derick Wood3 |
| ftp://ftp.cs.ust.hk/pub/dwood/vlad/conn.ps, 19960417
An Adaptive Sorting Algorithm for the Connection Machine CM-2 Vladimir Estivill-Castro LANIA R ebsamen 80 Xalapa 91000, Ver. M exico Derick Wood Department of Computer Science University of Waterloo Waterloo, Ontario N2L 3G2 Canada |
| ftp://ftp.cs.ust.hk/pub/dwood/vlad/survey.ps, 19960417
1 A Survey of Adaptive Sorting Algorithms Vladimir Estivill-Castro LANIA R ebsamen 80 Xalapa, Veracruz 91000, M exico Derick Wood Department of Computer Science University of Western Ontario London, Ontario N6A 5B7, Canada The design and analysis of adaptive sorting algorithms has made important |
| ftp://ftp.cs.ust.hk/pub/dwood/vlad/generic.ps, 19960417
An Adaptive Generic Sorting Algorithm that Uses Variable Partitioning Vladimir Estivill-Castro1 Derick Wood2 |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/topic11.ps.gz, 19960418
COMP221: Fundamentals of Artificial Intelligence Topic 11: Decision Trees Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Decision Trees 1 Decision Trees as Performance Elements ffl Simple decision trees represent Boolean |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.icann96.ps.gz, 19960418
Bayesian Regularization in Constructive Neural Networks Tin-Yau Kwok (jamesk@cs.ust.hk) Dit-Yan Yeung (dyyeung@cs.ust.hk) Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon Hong Kong |
| ftp://ftp.cs.ust.hk/pub/bli/180/lec19.ps, 19960418
COMP 180 Lecture 19 1 Today s Topic Clocks Flip-Flops Sequential circuits. Memory Access COMP 180 Lecture 19 2 Clocks In digital circuits, the order of events is critical Clocks are used to achieve the synchronization and sequencing of operations in digital circuits A clock is a circuit built around a |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/topic11.ps.gz, 19960418
COMP221: Fundamentals of Artificial Intelligence Topic 11: Decision Trees Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Decision Trees 1 Decision Trees as Performance Elements ffl Simple decision trees represent Boolean |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/phase2.ps, 19960419
COMP 361 Spring 1996 Course Project (Phase 2) 1 Deadline for Phase 2 Section 1 and 2 : Mid-night of 11/5 (i.e. before 23:59 of 11/5) 2 Description of the project The subject of the second phase of the course project is the implementation of a Student Registration System based on a connection-oriented |
| ftp://ftp.cs.ust.hk/pub/bli/180/lec20.ps, 19960420
COMP 180 Lecture 20 1 Today s Topic Microprocessor Bus COMP 180 Lecture 20 2 Microprocessors Microprocessors are single chip CPUs A typical microprocessor has from 40-132 pins for communicating with the other devices of the computing system Microprocessor pins are of three types: Address, Data and |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4sol-midterm.ps, 19960420
Dept. of CS/HKUST COMP 361 Sec. 2 (Spring 1996) Midterm Examination 5 Student ID: SOLUTION 7. Compare the delay in sending an x-bit message over a k-hop path in a circuit-switched network and in a (lightly-loaded) packet-switched network. The circuit set-up time is s seconds, the propagation delay is d |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect22.ps, 19960423
COMP 361 NETWORK LAYER 41 Internet Protocol (IP) Internet protocol (IP) provides an unreliable, connectionless delivery mechanism - Unreliable: delivery is not guaranteed - Connectionless: each packet is treated independent of others - Best-effor t delivery: software makes an earnest attempt to deliver |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect22.ps, 19960423
COMP 361 NETWORK LAYER 41 Internet Protocol (IP) Internet protocol (IP) provides an unreliable, connectionless delivery mechanism - Unreliable: delivery is not guaranteed - Connectionless: each packet is treated independent of others - Best-effort delivery: software makes an earnest attempt to deliver |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/topic12.ps.gz, 19960425
COMP221: Fundamentals of Artificial Intelligence Topic 12: Perceptrons Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Perceptrons 1 Biological Neurons AxonCell body or SomaNucleusDendriteSynapsesAxonal arborizationAxon |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/topic12.ps.gz, 19960425
COMP221: Fundamentals of Artificial Intelligence Topic 12: Perceptrons Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Perceptrons 1 Biological Neurons AxonCell body or SomaNucleusDendriteSynapsesAxonal arborizationAxon |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect23.ps, 19960426
COMP 361 TRANSPORT LAYER 1 TRANSPORT LAYER COMP 361 TRANSPORT LAYER 2 Transport Layer The transport layer should provide reliable end-to-end transfer of data independent of the underlying communication system It should provide end-to-end error and flow control Transpor t Entity Transpor t Entity |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect23.ps, 19960426
COMP 361 TRANSPORT LAYER 1 TRANSPORT LAYER COMP 361 TRANSPORT LAYER 2 Transport Layer The transport layer should provide reliable end-to-end transfer of data independent of the underlying communication system It should provide end-to-end error and flow control Transport Entity Transport Entity Interface |
| ftp://ftp.cs.ust.hk/pub/bli/180/lec21-22.ps, 19960427
COMP 180 Lecture 21 1 Today s Topics Virtual memory Cache Claim: Memory system is the bottleneck of the Von Neumann system. COMP 180 Lecture 21 2 Virtual Memory Memory size problem. Early day s memory size, - IBM 650 (late 1950s) --> 2K words. - DEC PDP-1 --> 4K words (18 bits). Overlay technique - the |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/hwk3.ps.gz, 19960429
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1996 Programming Assignment 3: Learning Decision Trees Due: 15 May 1996 Preamble You have already learned a simple decision tree learning algorithm in class. In this assignment, you will explore some |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/hwk3.ps.gz, 19960429
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1996 Programming Assignment 3: Learning Decision Trees Due: 15 May 1996 Preamble You have already learned a simple decision tree learning algorithm in class. In this assignment, you will explore some |
| ftp://ftp.cs.ust.hk/pub/pam/au.ps.gz, 19960429
Interactions of Concurrent Workflow Processes over Shared Informationy Lyman Do and Pamela Drew Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong flyman,pamg@cs.ust.hk 1 Introduction There are two run-time functions particularly important in a |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-11.ps.gz, 19960501
The Roles and Views of Multimedia Objects Raymond K. Wong , H. Lewis Chau , and Frederick H. Lochovsky Technical Report HKUST-CS96-11 April 25, 1996 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-10.ps.gz, 19960501
A Non-Volatile Storage for Volatile Information Raymond K. Wong , H. Lewis Chau , and Frederick H. Lochovsky Technical Report HKUST-CS96-10 April 25, 1996 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/bli/180/lec23.ps, 19960501
COMP 180 Lecture 23 1 Today s Topics Microprogramming COMP 180 Lecture 23 2 THE MICROPROGRAMMING LEVEL High-Level Language Level Assembly Language Level Operating System Level Conventional Machine Level Microprogramming Level Digital Logic Level 1 2 3 4 5 HARDWARE FIRMWARE APPLICATION SOFTWARE SOFTWARE |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-09.ps.gz, 19960501
DOOR = `Object with Roles' + `Schema Evolution' Raymond K. Wong , H. Lewis Chau , and Frederick H. Lochovsky Technical Report HKUST-CS96-9 April 25, 1996 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/trset5.ps, 19960502
COMP 361 Sec. 2 (Spring 1996) Training Problem Set 5 1 COMP 361 - Spring 1996 Training problem set 5 1. If delays are recorded as 8-bit numbers in a 100 node network, and delay vectors are exchanged twice a second, how much bandwidth per (full duplex) line is wasted by using the distributed routing |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect25.ps, 19960503
COMP 361 SESSION/PRESENTATION LAYER 1 SESSION LAYER COMP 361 SESSION/PRESENTATION LAYER 2 Why Session Layer The lower layers (physical, data link, network, and transport) of the OSI model are concerned with providing reliable and efficient end-to-end communications The upper layers are mainly concerned |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect25.ps, 19960503
COMP 361 SESSION/PRESENTATION LAYER 1 SESSION LAYER COMP 361 SESSION/PRESENTATION LAYER 2 Why Session Layer The lower layers (physical, data link, network, and transport) of the OSI model are concerned with providing reliable and efficient end-to-end communications The upper layers are mainly concerned |
| ftp://ftp.cs.ust.hk/pub/muppala/paper.ps, 19960504
A Petri Net Approach for Logical Inference of Clauses Jogesh K. Muppala Dept. of Computer Science The Hong Kong University of Science and Technology Clear Water Bay Kowloon, Hong Kong muppala@cs.ust.hk Chuang Lin Information Science Institute State Information Centre Beijing 100045 China clin@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/dwood/sven/ii40.ps.gz, 19960505
Restricted Orientation Visibility Sven Schuierery Derick Wood z Dezember 1991 |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/topic13.ps.gz, 19960506
COMP221: Fundamentals of Artificial Intelligence Topic 13: Planning Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Planning 1 A Simple Planning Agent function SIMPLE-PLANNING-AGENT( percept) returns an action static: KB, |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/topic13.ps.gz, 19960506
COMP221: Fundamentals of Artificial Intelligence Topic 13: Planning Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Spring 1996 COMP221 Planning 1 A Simple Planning Agent function SIMPLE-PLANNING-AGENT( percept) returns an action static: KB, |
| ftp://ftp.cs.ust.hk/pub/bli/180/lec24.ps, 19960506
COMP 180 Lecture 24 1 Today s Topics Microprogramming (Cont) COMP 180 Lecture 24 2 AN EXAMPLE MICROARCHITECTURE PC AC SP IR TIR +1 -1 AMASK SMASK A B C D E F MAR MBR AMUX A latch Shifter B latch ALU A bus B bus C bus L0 L1 To address bus To data bus M0 M1 M2 M3 Address out Data in A0 F0 F1 N |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/set5.ps.gz, 19960507
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1996 Problem Set 5: Planning Due: 17 May 1996, in lecture The exercises in this problem set are from the textbook. Exercises ffl 11.1 ffl 11.4 (modified): Define a set of Strips operators that can be |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s96/set5.ps.gz, 19960507
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1996 Problem Set 5: Planning Due: 17 May 1996, in lecture The exercises in this problem set are from the textbook. Exercises ffl 11.1 ffl 11.4 (modified): Define a set of Strips operators that can be |
| ftp://ftp.cs.ust.hk/pub/bli/180/lec25.ps, 19960508
COMP 180 Lecture 25 1 The Microprogram In the microarchitecture, PC, AC and SP are used to hold the three Mac-1 registers IR is the instruction register and TIR holds a temporary copy of IR for decoding the opcode AMASK is the address mask 007777 (octal) for separating out the opcode and the address |
| ftp://ftp.cs.ust.hk/pub/avi/forStephanKeith/naiman.ps.Z, 19960508
Interactive Teaching Modules for Computer Graphics Avi C. Naiman Department of Computer Science Hong Kong University of Science & Technology |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect26.ps, 19960509
COMP 361 APPLICATION LAYER 1 APPLICATION LAYER COMP 361 APPLICATION LAYER 2 Application Layer The application layer provides access to the networking environment for the users and also provides distributed information services These services are frequently used by the users, and do not need to be |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect26.ps, 19960509
COMP 361 APPLICATION LAYER 1 APPLICATION LAYER COMP 361 APPLICATION LAYER 2 Application Layer The application layer provides access to the networking environment for the users and also provides distributed information services These services are frequently used by the users, and do not need to be |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-12.ps.gz, 19960510
DOOR: A Dynamic Object-Oriented Data Model with Roles Raymond K. Wong , H. Lewis Chau , and Frederick H. Lochovsky Technical Report HKUST-CS96-12 May 8, 1996 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/bli/180/lec26.ps, 19960511
COMP 180 Lecture 26 1 Today s Topics Evolution of computer architecture Pipelining RISC processors COMP 180 Lecture 26 2 Evolution of Computer Architecture Conventional computers based on VonNeumann design use: - A single CPU - A few internal registers - An external memory - An assembly language |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect27.ps, 19960513
COMP 361 HIGH SPEED NETWORKING 1 HIGH SPEED NETWORKING COMP 361 HIGH SPEED NETWORKING 2 High Speed Networks Traditionally computer networks were mainly designed to carry data The rapid developments in computer technology has made it feasible to implement powerful computers supporting compute intensive |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect27.ps, 19960513
COMP 361 HIGH SPEED NETWORKING 1 HIGH SPEED NETWORKING COMP 361 HIGH SPEED NETWORKING 2 High Speed Networks Traditionally computer networks were mainly designed to carry data The rapid developments in computer technology has made it feasible to implement powerful computers supporting compute intensive |
| ftp://ftp.cs.ust.hk/pub/comp180/solution4.ps, 19960514
1) Pascal n:= a Mac-1 loco 234h ;load the address of a in ac addd 220h ;add the value of i to ac ; therefore ac will contain the address ; of a swap ;place the address of a in sp lodl 0 ;place the value of a in ac stod 120h ;store the value in n Mic-1 (list of microinstruction used to |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.iconip96.ps.gz, 19960514
Reference Priors for Neural Networks: Laplace versus Gaussian Tin-Yau Kwok (jamesk@cs.ust.hk), Dit-Yan Yeung (dyyeung@cs.ust.hk) Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon Hong Kong |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4sol-quiz3.ps, 19960514
Dept. of CS/HKUST COMP 361 Sec. 2 (Spring 1996) Quiz 2 2 Student ID:____________________ 2. A channel has a data rate of 100 kbps and a propogation delay of 10 msec/km. The distance between the sending and the receiving nodes is 500 km. Nodes exchange fixed-size frames of 1000 bits. Assume that ACK |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/sol-quiz3.ps, 19960514
Department of Computer Science The Hong Kong University of Science and Technology COMP 361 Sec. 2 (Spring 1996) Quiz 2 1 COMP 361 Computer Communication Networks/Section 2 Spring Semester 1996 Quiz 3 Date: April 19, 1996 Time: 11:30 - 11:50 (20 minutes) Instructions: 1. Please write your name, student |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4sol-quiz4.ps, 19960514
Dept. of CS/HKUST COMP 361 Sec. 2 (Spring 1996) Quiz 4 2 Student ID:____________________ 2. Design the bridge protocol architecture for the following internetworking system. Specify the frame structure of the protocol data unit (PDU) at the point t6. (15 points) 3. Answer the following true/false |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/sol-quiz4.ps, 19960514
Department of Computer Science The Hong Kong University of Science and Technology COMP 361 Sec. 2 (Spring 1996) Quiz 4 1 COMP 361 Computer Communication Networks/Section 2 Spring Semester 1996 Quiz 4 Date: May 3, 1996 Time: 11:30 - 11:50 (20 minutes) Instructions: 1. Please write your name, student ID |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-13.ps.gz, 19960515
Automatic Video Data Structuring through Shot Partitioning and Key Frame Selectiony Wei XIONG , John Chung-Mong LEE , and Rui-Hua MA Technical Report HKUST-CS96-13 May 16, 1996 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong yThis |
| ftp://ftp.cs.ust.hk/pub/bli/180/lec27.ps, 19960515
COMP 180 Lecture 27 1 Today s Topics RISC processors Distinction between RISC and CISC Multiple registers Overlapping register windows COMP 180 Lecture 27 2 Why RISC The reason, computers had so many machine instructions is to be able to handle interpretation of the many high level languages. Some |
| ftp://ftp.cs.ust.hk/pub/csricky/A4/dcp-icpp94.ps.gz, 19960520
Abstract1 An algorithm for compile-time static scheduling of task graphs onto multiprocessors is proposed. The proposed algorithm, which is called Dynamic Critical Path (DCP) scheduling algorithm, is different from previously reported algorithms in a number of ways. First, it determines the critical |
| ftp://ftp.cs.ust.hk/pub/csricky/BSA-spdp95-camera.ps.gz, 19960520
Abstract1 We propose an algorithm for scheduling and allocation of parallel programs to message-passing architectures. The algorithm considers arbitrary computation and communication costs, arbitrary network topology, link contention and underlying communication routing strategy. While our technique is |
| ftp://ftp.cs.ust.hk/pub/csricky/A4/cpfd-icpp94.ps.gz, 19960520
A New Approach To Scheduling Parallel Programs Using Task Duplication Ishfaq Ahmad and Yu-Kwong Kwok Department of Computer Science Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong Abstract1 In this paper, we explore the problem of scheduling parallel programs using |
| ftp://ftp.cs.ust.hk/pub/csricky/PBSA-ipps95-camera.ps.gz, 19960520
Abstract1 The objective of this research is to propose a lowcomplexity static scheduling and allocation algorithm for message-passing architectures by considering factors such as communication delays, link contention, message routing and network topology. As opposed to the conventional list-scheduling |
| ftp://ftp.cs.ust.hk/pub/bli/180/lec28.ps, 19960520
COMP 180 Lecture 28 1 Today s Topic Reviews COMP 180 Lecture 28 2 Boolean Algebra Sum-of-Product Product-of-Sum Truth Table Boolean Identities. Basic rules Logic expression and minimization COMP 180 Lecture 28 3 Karnaugh Maps n variables and 2n cells. Labeling --> only one input variable is different |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-14.ps.gz, 19960520
page 1 Devising a Flexible Event Model on Top of a Common Data/Knowledge Storage Manager* L.C. Chan Qing Li Technical Report HKUST-CS96-14 Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong E-mail: {lcchan, qing}@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/csricky/A4/bsa-spdp95.ps.gz, 19960520
Abstract1 We propose an algorithm for scheduling and allocation of parallel programs to message-passing architectures. The algorithm considers arbitrary computation and communication costs, arbitrary network topology, link contention and underlying communication routing strategy. While our technique is |
| ftp://ftp.cs.ust.hk/pub/csricky/CPFD-icpp94-camera.ps.gz, 19960520
A New Approach To Scheduling Parallel Programs Using Task Duplication Ishfaq Ahmad and Yu-Kwong Kwok Department of Computer Science Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong Abstract1 In this paper, we explore the problem of scheduling parallel programs using |
| ftp://ftp.cs.ust.hk/pub/csricky/A4/pbsa-ipps95.ps.gz, 19960520
Abstract1 The objective of this research is to propose a lowcomplexity static scheduling and allocation algorithm for message-passing architectures by considering factors such as communication delays, link contention, message routing and network topology. As opposed to the conventional list-scheduling |
| ftp://ftp.cs.ust.hk/pub/csricky/DCP-icpp94-camera.ps.gz, 19960520
Abstract1 An algorithm for compile-time static scheduling of task graphs onto multiprocessors is proposed. The proposed algorithm, which is called Dynamic Critical Path (DCP) scheduling algorithm, is different from previously reported algorithms in a number of ways. First, it determines the critical |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.iwfhr96.ps.gz, 19960521
Recognition of Handwritten Digits Using Deformable Models Kwok-Wai Cheung, Dit-Yan Yeung and Roland T. Chin Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong Email: fwilliam,dyyeung,rolandg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/william/cheung.cvpr96.ps.gz, 19960521
Competitive Mixture of Deformable Models for Pattern Classification Kwok-Wai Cheung Dit-Yan Yeung Roland T. Chin Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Hong Kong fwilliam, dyyeung, rolandg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/dwood/anne/treetex93.ps.gz, 19960527
Drawing Trees Nicely with TEX1 Anne Br uggemann-Klein2 Derick Wood3 May 27, 1996 |
| ftp://ftp.cs.ust.hk/pub/csricky/BSA-jpdc-rev.ps.gz, 19960604
- 1 - Bubble Scheduling: An Efficient Algorithm for Compile-Time Scheduling of Tasks and Messages on Parallel Architectures Yu-Kwong Kwok and Ishfaq Ahmad1 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong Corresponding Author: Ishfaq |
| ftp://ftp.cs.ust.hk/pub/csricky/tmp/BSA-jpdc-rev.ps.gz, 19960604
- 1 - Bubble Scheduling: An Efficient Algorithm for Compile-Time Scheduling of Tasks and Messages on Parallel Architectures Yu-Kwong Kwok and Ishfaq Ahmad1 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong Corresponding Author: Ishfaq |
| ftp://ftp.cs.ust.hk/pub/avi/pubs/wavefront.ps.Z, 19960605
78 Error Diffusion: Wavefront Traversal and Contrast Considerations Avi C. Naiman and David T. W. Lam Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong Phone: +852 2358-6997 Fax: +852 2358-1477 e-mail: avi@cs.ust.hk and dada@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/avi/pubs/cgmodules.ps.Z, 19960605
Computer Graphics August 1996 1 Interactive Teaching Modules for Computer Graphics Avi C. Naiman Department of Computer Science Hong Kong University of Science & Technology |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-17.ps.gz, 19960610
Chinese Glyph Generation by Heuristic Search Pak-Keung Lai, Dit-Yan Yeung & Man-Chi Pong Technical Report HKUST-CS96-17 June 1996 Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon Hong Kong fpklai,dyyeung,mcpongg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-18.ps.gz, 19960611
1 To appear in ICPR-96, Proceedings of the 13th International Conference on Pattern Recognition, Aug. 96. Efficient and Effective Texture Classification Using Wavelet Frame Packet Analysis Jian-Feng Liu* John Chung-Mong Lee* Technical Report HKUST-CS96-18 June 8, 1996 * Department of Computer Science |
| ftp://ftp.cs.ust.hk/pub/dominic/papers/ssh_kerberos.ps, 19960614
Evaluation of Secure Shell and Kerberos Dominic Chi-Yuen Lai (dominic@cs.ust.hk) Keith Kam-Hing Lau (keithlau@cs.ust.hk) 18th May, 1996 Chapter 1 Introduction In the old days, say one or two decades ago, people did not consider much on computer network security, probably they needed not because the |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/hsfsys.ps.gz, 19960622
NIST Form-Based Handprint Recognition System NISTIR 5469 Michael D. Garris, James L. Blue, Gerald T. Candela, Darrin L. Dimmick, Jon Geist, Patrick J. Grother, Stanley A. Janet, and Charles L. Wilson National Institute of Standards and Technology, Building 225, Room A216 Gaithersburg, Maryland 20899 |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/s96/hsfsys.ps.gz, 19960622
NIST Form-Based Handprint Recognition System NISTIR 5469 Michael D. Garris, James L. Blue, Gerald T. Candela, Darrin L. Dimmick, Jon Geist, Patrick J. Grother, Stanley A. Janet, and Charles L. Wilson National Institute of Standards and Technology, Building 225, Room A216 Gaithersburg, Maryland 20899 |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/s96/topic01.ps.gz, 19960624
COMP300M: Introduction to Pattern Recognition Topic 1: Introduction Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Summer 1996 COMP300M Introduction Pattern Recognition ffl Pattern recognition can be defined as the categorization of input |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/Lect1.ps, 19960624
Introduction to Database Systems COMP231 (Summer 1996) Introduction 1 What are Database Systems Introduction to Database Systems COMP231 (Summer 1996) Introduction 2 What is a Database Data: factual (undoubted) information used as a basis for reasoning, discussion, or calculation A database is a |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/topic01.ps.gz, 19960624
COMP300M: Introduction to Pattern Recognition Topic 1: Introduction Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Summer 1996 COMP300M Introduction Pattern Recognition ffl Pattern recognition can be defined as the categorization of input |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/Lect2.ps, 19960624
Introduction to Database Systems COMP231 (Summer 1996) Introduction 1 Entity-Relationship (ER) Data Model Introduction to Database Systems COMP231 (Summer 1996) Introduction 2 Database Design Process REQUIREMENTS COLLECTION AND ANALYSIS CONCEPTUAL DESIGN LOGICAL DESIGN (DATA MODEL MAPPING) PHYSICAL |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/A4Lect2.ps, 19960624
Introduction to Database Systems COMP231 (Summer 1996) Introduction 19 Relationships with higher Degree The Benjamin/Cummings Publishing Company, Inc. 1994, Elmasri/Navathe, Fundamentals of Database Systems, Second Edition (a) SUPPLY SName PartNo SUPPLIER Quantity PROJECT PART ProjName (b) PartNo M N |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-19.ps.gz, 19960625
An Adaptive Generic Sorting Algorithm that Uses Variable Partitioningz Vladimir Estivill-Castro and Derick Woody Technical Report HKUST-CS96-19 June 1996 School of Information Systems Queensland University of Technology Red Hill Q4059 Australia yDepartment of Computer Science Hong Kong University of |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-20.ps.gz, 19960625
Multiple-Guard Kernels of Simple Polygonsz Sven Schuierer and Derick Woody Technical Report HKUST-CS96-20 June 1996 Institut f ur Informatik Universit at Freiburg Rheinstr. 10{12 D-79104 Freiburg Germany yDepartment of Computer Science Hong Kong University of Science & Technology Clear Water Bay, |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/courseinfo.ps.gz, 19960625
Hong Kong University of Science and Technology COMP300M: Introduction to Pattern Recognition Summer 1996 Instructor Dit-Yan Yeung, Rm 3541, 2358-6977, dyyeung@cs.ust.hk, http://www.cs.ust.hk/~dyyeung/ Office hours: Tuesday 10:00am{12:00noon (or by appointment) Class Schedule Lecture: Tuesday & Wednesday |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-22.ps.gz, 19960626
Relaxed AVL Trees, Main-Memory Databases, and Concurrencyx Otto Nurmi , Eljas Soisalon-Soinineny, and Derick Woodz Technical Report HKUST-CS96-22 June 1996 Department of Computer Science University of Helsinki Teollisuuskatu 23 SF-05100 Helsinki, Finland yLaboratory of Information Processing Science |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/topic02.ps.gz, 19960626
COMP300M: Introduction to Pattern Recognition Topic 2: Bayes Decision Theory Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Summer 1996 COMP300M Bayes Decision Theory Classifier Training and Classification ffl Training: Classifier |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-23.ps.gz, 19960626
O-Convexity: Computing Hulls, Approximations, and Orientation Setsz V. Martynchik , N. Metelski , and Derick Woody Technical Report HKUST-CS96-23 June 1996 Institute of Mathematics Belarussian Academy of Sciences Surganova str. 11 Minsk, 220072 Belarus yDepartment of Computer Science Hong Kong |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/s96/topic02.ps.gz, 19960626
COMP300M: Introduction to Pattern Recognition Topic 2: Bayes Decision Theory Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Summer 1996 COMP300M Bayes Decision Theory Classifier Training and Classification ffl Training: Classifier |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-24.ps.gz, 19960626
Grail: Engineering Automata in C++, Version 2.5z Darrell R. Raymond and Derick Woody Technical Report HKUST-CS96-24 June 1996 Department of Computer Science University of Western Ontario London, Ontario N2L 5B7 Canada yDepartment of Computer Science Hong Kong University of Science & Technology Clear |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/cedar.ps.gz, 19960627
A System to Read Names and Addresses on Tax Forms Sargur N. Srihari, Yong-Chul Shin, Vemulapati Ramanaprasad and Dar-Shyang Lee Center of Excellence for Document Analysis and Recognition and Department of Computer Science State University of New York at Buffalo Buffalo, NY 14260 |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/s96/cedar.ps.gz, 19960627
A System to Read Names and Addresses on Tax Forms Sargur N. Srihari, Yong-Chul Shin, Vemulapati Ramanaprasad and Dar-Shyang Lee Center of Excellence for Document Analysis and Recognition and Department of Computer Science State University of New York at Buffalo Buffalo, NY 14260 |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-25.ps.gz, 19960627
Three-Dimensional Restricted-Orientation Convexityz Eugene Fink and Derick Woody Technical Report HKUST-CS96-25 June 1996 Department of Computer Science Carnegie{Mellon University Pittsburgh, PA 15213 U. S. A. yDepartment of Computer Science Hong Kong University of Science & Technology Clear Water Bay, |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-26.ps.gz, 19960627
Restricted-Orientation Halfspacesz Eugene Fink and Derick Woody Technical Report HKUST-CS96-26 June 1996 Department of Computer Science Carnegie{Mellon University Pittsburgh, PA 15213 U. S. A. yDepartment of Computer Science Hong Kong University of Science & Technology Clear Water Bay, Kowloon Hong Kong |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-27.ps.gz, 19960627
Generalizing Halfspacesz Eugene Fink and Derick Woody Technical Report HKUST-CS96-27 June 1996 Department of Computer Science Carnegie{Mellon University Pittsburgh, PA 15213 U. S. A. yDepartment of Computer Science Hong Kong University of Science & Technology Clear Water Bay, Kowloon Hong Kong |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-28.ps.gz, 19960627
Tabular formatting problemsz Xinxin Wang and Derick Woody Technical Report HKUST-CS96-28 June 1996 NorTel P.O. Box 3511, Station C Ottawa, Ontario K1Y 4H7 Canada yDepartment of Computer Science Hong Kong University of Science & Technology Clear Water Bay, Kowloon Hong Kong |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/A4Lect3.ps, 19960629
Introduction to Database Systems COMP231 (Spring 1995) Relational Data Model 1 Relational Data Model Relational Algebra Introduction to Database Systems COMP231 (Spring 1995) Relational Data Model 2 Relational Model Concepts Relation (informally): A table of values. Each column in the table has a column |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/Lect3.ps, 19960629
Introduction to Database Systems COMP231 (Spring 1995) Relational Data Model 1 Relational Data Model Relational Algebra Introduction to Database Systems COMP231 (Spring 1995) Relational Data Model 2 Relational Model Concepts Relation (informally): A table of values. Each column in the table has a column |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.tnn96.ps.gz, 19960629
IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 7, NO. 5, SEPTEMBER 1996 1 Use of Bias Term in Projection Pursuit Learning Improves Approximation and Convergence Properties Tin-Yau Kwok and Dit-Yan Yeung, Member, IEEE |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-29.ps.gz, 19960701
Xtable|A Tabular Editor and Formatterz Xinxin Wang and Derick Woody Technical Report HKUST-CS96-29 June 1996 NorTel P.O. Box 3511, Station C Ottawa, Ontario K1Y 4H7 Canada yDepartment of Computer Science Hong Kong University of Science & Technology Clear Water Bay, Kowloon Hong Kong |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-21.ps.gz, 19960701
Instruction Computation in Subset Constructionz J. Howard Johnson and Derick Woody Technical Report HKUST-CS96-21 June 1996 Institute for Information Technology National Research Council Nepean, Ontario Canada yDepartment of Computer Science Hong Kong University of Science & Technology Clear Water Bay, |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/A4Lect4.ps, 19960702
Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 30 Summary of SQL Queries A query in SQL can consist of up to six clauses, but only the first two are mandatory SELECT FROM
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/Lect4.ps, 19960702
Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 1 SQL Part 11 1. These transparencies were taken from the Transparency masters for the Fundamentals of Database systems text book. Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 2 Data Definition |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/A4Lect1.ps, 19960702
Introduction to Database Systems COMP231 (Summer 1996) Introduction 21 Classification of DBMSs Based on the data model used: Traditional: Relational, Network, Hierarchical. Emerging: Object-oriented, Semantic, EntityRelationship, others. Other classifications: Single-user vs. multi-user (most DBMSs). |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-30.ps.gz, 19960703
SGML and Exceptionsz Pekka Kilpel ainen and Derick Woody Technical Report HKUST-CS96-30 June 1996 Department of Computer Science University of Helsinki Helsinki Finland yDepartment of Computer Science Hong Kong University of Science & Technology Clear Water Bay, Kowloon Hong Kong |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/s96/hwk1.ps.gz, 19960703
Hong Kong University of Science and Technology COMP300M: Introduction to Pattern Recognition Summer 1996 Assignment 1: Parametric Classifier with Gaussian Density Functions Due: 15 July 1996, 5:00pm Classifier In this assignment, you will implement a simple parametric classifier with multivariate |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/hwk1.ps.gz, 19960703
Hong Kong University of Science and Technology COMP300M: Introduction to Pattern Recognition Summer 1996 Assignment 1: Parametric Classifier with Gaussian Density Functions Due: 15 July 1996, 5:00pm Classifier In this assignment, you will implement a simple parametric classifier with multivariate |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/topic03.ps.gz, 19960704
COMP300M: Introduction to Pattern Recognition Topic 3: Parametric Classifiers Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Summer 1996 COMP300M Parametric Classifiers Parametric Learning ffl Each probability density function of a |
| ftp://ftp.cs.ust.hk/pub/muppala/real-time.ps, 19960704
On Modeling Performance of Real-Time Systems in the Presence of Failures Jogesh K. Muppala1 Dept. of Electrical Engineering Duke University Durham, NC 27706 Steven P. Woolet IBM Research Triangle Park, NC 27709 Kishor S. Trivedi 2 Dept. of Electrical Engineering Duke University Durham, NC 27706 |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/s96/topic03.ps.gz, 19960704
COMP300M: Introduction to Pattern Recognition Topic 3: Parametric Classifiers Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Summer 1996 COMP300M Parametric Classifiers Parametric Learning ffl Each probability density function of a |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/Lect6.ps, 19960705
Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 1 Tuple Relational Calculus Domain Relational Calculus Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 2 Introduction A formal language based on first-order predicate calculus Many commercial |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/Lect5.ps, 19960705
Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 1 SQL Part II1 1. These transparencies were taken from the Transparency masters for the Fundamentals of Database systems text book. Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 2 Data |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/A4Lect5.ps, 19960705
Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 27 Cursors (Cont.) E2: writeln('enter the department name:'); readln(DNAME); $SELECT DNUMBER INTO %DNUMBER FROM DEPARTMENT WHERE DNAME= % DNAME; $DECLARE EMP CURSOR FOR SELECT SSN, FNAME, MINIT, LNAME, SALARY FROM EMPLOYEE |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/A4Lect6.ps, 19960705
Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 19 Domain Relational Calculus Query 6: Find the names of employees without dependents Q6:{ qs | ($ t) (EMPLOYEE(qrstuvwxyz) and (not($ l) (DEPENDENT(Imno) and t=l))) } Query 7: List the names of managers who have at least one |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/A4Lect7.ps, 19960707
Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 28 Data Retrieval in QBE WORKS_ON PROJECT ESSN PNO HOURS _PX >20 PNAME PNO PLOCATION DNUM P. _PX P. WORKS_ON PROJECT ESSN PNO HOURS _PX >20 PNAME PNO PLOCATION DNUM P.CNT._EX G._PX P. CONDITIONS CNT._EX > 2 Introduction to |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/Lect7.ps, 19960707
Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 1 QUEL QBE Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 2 Introduction QUEL is the query language for INGRES DBMS Developed at University of California, Berkeley, in 1970 s Based on tuple |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/s96/topic04.ps.gz, 19960708
COMP300M: Introduction to Pattern Recognition Topic 4: Nearest-Neighbor Classifiers Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Summer 1996 COMP300M Nearest-Neighbor Classifiers Introduction ffl Nearest-neighbor classifiers are |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/topic04.ps.gz, 19960708
COMP300M: Introduction to Pattern Recognition Topic 4: Nearest-Neighbor Classifiers Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Summer 1996 COMP300M Nearest-Neighbor Classifiers Introduction ffl Nearest-neighbor classifiers are |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/A4Lect8.ps, 19960708
Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 23 EXAMPLE PID CNAME LOT# AREA LOTS1A fd1 fd2 AREA CNAME LOTS1AY fd5 PID LOT# AREA LOTS1AX A B C R fd1 fd2 Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 22 BCNF (Boyce-Codd Normal Form) A relation |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/Lect8.ps, 19960708
Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 1 Relational Database Design Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 2 Informal Design Guidelines for Relational Databases What is relational database design The grouping of attributes to |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/proj.ps.gz, 19960709
Hong Kong University of Science and Technology COMP300M: Introduction to Pattern Recognition Summer 1996 Project: Handwritten Digit Recognition Due: 9 August 1996, 11:59pm Preamble You are expected to team up as a group of two to do this project. Handwriting Data The data you will use for this project |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/s96/proj.ps.gz, 19960709
Hong Kong University of Science and Technology COMP300M: Introduction to Pattern Recognition Summer 1996 Project: Handwritten Digit Recognition Due: 9 August 1996, 11:59pm Preamble You are expected to team up as a group of two to do this project. Handwriting Data The data you will use for this project |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/s96/topic05.ps.gz, 19960709
COMP300M: Introduction to Pattern Recognition Topic 5: Probabilistic Neural Network Classifier Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Summer 1996 COMP300M Probabilistic Neural Network Classifier Introduction ffl Like nearest-neighbor |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/topic05.ps.gz, 19960709
COMP300M: Introduction to Pattern Recognition Topic 5: Probabilistic Neural Network Classifier Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Summer 1996 COMP300M Probabilistic Neural Network Classifier Introduction ffl Like nearest-neighbor |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/Lect9.ps, 19960712
Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 24 Relational Databases Design Algorithms Normal forms are not sufficient criteria for a good design Example: Any relation with two attributes is always in BCNF so we can create 2-attribute relations arbitrarily and get BCNF |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/A4Lect9.ps, 19960712
Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 36 Dangling Tuples Sometimes the attributes of a relation are "partitioned" into several relations with the primary key repeated in each of the relations Tuples whose primary key does not appear in all of the relations are |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/A4Lect10.ps, 19960713
Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 22 Using B-Trees and B+-Trees as Dynamic Multi-level Indexes If a deletion causes a node to become less than half full it must be merged with neighboring nodes Difference between B-tree and B+-tree: In a B-tree, pointers to |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/Lect10.ps, 19960713
Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 1 File Organization and Index Structures Introduction to Database Systems COMP231 (Summer 1996) Relational Data Model 2 Disk Storage Devices Offer high storage capacity and low cost. Data stored as magnetized areas on magnetic |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/topic06.ps.gz, 19960715
COMP300M: Introduction to Pattern Recognition Topic 6: Layered Neural Network Classifiers Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Summer 1996 COMP300M Layered Neural Network Classifiers Another Approach ffl Unlike parametric |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/s96/topic06.ps.gz, 19960715
COMP300M: Introduction to Pattern Recognition Topic 6: Layered Neural Network Classifiers Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Summer 1996 COMP300M Layered Neural Network Classifiers Another Approach ffl Unlike parametric |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/s96/hwk2.ps.gz, 19960716
Hong Kong University of Science and Technology COMP300M: Introduction to Pattern Recognition Summer 1996 Assignment 2: Nearest-Neighbor Classifiers Due: 27 July 1996, 5:00pm Classifiers This assignment is essentially the same as the previous assignment but with the parametric classifier replaced by |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/hwk2.ps.gz, 19960716
Hong Kong University of Science and Technology COMP300M: Introduction to Pattern Recognition Summer 1996 Assignment 2: Nearest-Neighbor Classifiers Due: 27 July 1996, 5:00pm Classifiers This assignment is essentially the same as the previous assignment but with the parametric classifier replaced by |
| ftp://ftp.cs.ust.hk/pub/dlee/leec/www/20.ps, 19960719
c Dik L. Lee User Interface { Browsing the Map (c) Briefcase icon expanded. (d) Briefcase icon shrinked. |
| ftp://ftp.cs.ust.hk/pub/dlee/leec/www/19.ps, 19960719
c Dik L. Lee User Interface (a) WISE home page. (b) Response from WISE. |
| ftp://ftp.cs.ust.hk/pub/dlee/leec/www/1-18.ps, 19960719
c Dik L. Lee Resource Discovery and Integration on the World Wide Web Dik L. Lee Department of Computer Science Hong Kong University of Science and Technology July, 1996 c Dik L. Lee Outline ffl Overview of Information Retrieval Techniques ffl Information Retrieval on the World Wide Web ffl WWW Index |
| ftp://ftp.cs.ust.hk/pub/dlee/leec/www/21-64.ps, 19960719
c Dik L. Lee Ranking Algorithms: Boolean spreading activation ffl A query term found on a page contributes c1 to the score of the page and c2 to the scores of all pages pointed at by the page. Typically, c2 << c1. ffl Frequency information is ignored. Ri;q = MX j=1 Ii;j; where Ii;j = |
| ftp://ftp.cs.ust.hk/pub/beat/thesis.ps.gz, 19960722
A SYSTEM TO FORECAST CURRENCY EXCHANGE RATES BY KRISHNAN P. SANKARAN A Thesis Presented to The Hong Kong University of Science and Technology In Partial Fulfillment of the Requirements for the Degree of Master of Philosophy in Computer Science Hong Kong January 1996 Copyright c by Krishnan P. Sankaran |
| ftp://ftp.cs.ust.hk/pub/beat/icde.ps.gz, 19960722
On Updates and Inconsistency Repairing in Knowledge Bases B. W uthrich ECRC, Arabellastr. 17 D-8000 Munich 81, Germany |
| ftp://ftp.cs.ust.hk/pub/beat/kdd.ps.gz, 19960722
Toward a Formal Framework for Comparing KD Techniques B. W uthrich Hong Kong University of Science & Technology Clear Water Bay, Kowloon, Hong Kong beat@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/dlee/leec/mobile/slides.ps, 19960722
c Dik L. Lee Information Filtering, Caching, and Channel Allocation on Wireless Channels Dik L. Lee Department of Computer Science Hong Kong University of Science and Technology July, 1996 c Dik L. Lee Overview ffl Introduction ffl System Architecture ffl Constraints and Characteristics ffl Information |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/A4Lect11.ps, 19960722
Introduction to Database Systems COMP231 (Summer 1996) Query Processing & Optimization 24 Heuristic Algebraic Optimization 5.Using rules 3, 4, 7, and 11 concerning the cascading of and commuting of with other operations, break down and move the projection attributes down the tree as far as possible by |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/Lect11.ps, 19960722
Introduction to Database Systems COMP231 (Summer 1996) Query Processing & Optimization 1 Query Processing Optimization Introduction to Database Systems COMP231 (Summer 1996) Query Processing & Optimization 2 Introduction A DBMS uses different techniques to process, optimize and execute high-level |
| ftp://ftp.cs.ust.hk/pub/beat/sig-ws.ps.gz, 19960722
Data Mining Opportunities In Very Large Object Oriented Databases Beat W uthrich Kamalakar Karlapalem Department Of Computer Science University of Science and Technology Clear Water Bay, Kowloon, HONG KONG. fbeat,kamalg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/beat/tkde.ps.gz, 19960722
Probabilistic Knowledge Bases Beat W uthrich The Hong Kong University of Science and Technology Clear Water Bay Kowloon, Hong Kong e-mail: beat@cs.ust.hk phone: (852) 358 7013 fax: (852) 358 1477 1 |
| ftp://ftp.cs.ust.hk/pub/beat/dpdr.ps.gz, 19960722
Discovering Probabilistic Decision Rules Beat W uthrich 1 The Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong e-mail: beat@cs.ust.hk phone: (852) 2358 7013 fax: (852) 2358 1477 1Part of the work was performed while the author was at ECRC, Arabellastr. 17, 81925 Munich, |
| ftp://ftp.cs.ust.hk/pub/dlee/leec/java/35-58.ps.gz, 19960724
Applets versus Applications ffl A Java program may exist in two forms: Java applet which must run on a Java-enabled browser and Java stand-alone application which runs as an independent process. ffl Applets are useful for software distribution. ffl An applet enforces a standard on the functionality and |
| ftp://ftp.cs.ust.hk/pub/dlee/leec/java/33.ps.gz, 19960724
Power of Java|ImageMap as An Example ffl Traditional imagemap: no feedback until user clicked. ffl Netscape client-side imagemap: displays cryptic URL on status bar. |
| ftp://ftp.cs.ust.hk/pub/dlee/leec/java/1-32.ps.gz, 19960724
Web Application Development with Java and Javascript Dik L. Lee Department of Computer Science Hong Kong University of Science and Technology July/August, 1996 Overview ffl Network-based applications ffl World Wide Web ffl Java ffl Javascript ffl Problems and impacts Internet-Based Information Systems) |
| ftp://ftp.cs.ust.hk/pub/dlee/leec/java/34.ps.gz, 19960724
ffl Java imagemap: displays custom messages on status bar, high-lights hot-spots, plays sound clips. |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/Lect12.ps, 19960726
Introduction to Database Systems COMP231 (Summer 1996) Transaction Management and Concurrency Control 1 Transaction Processing Concurrency Control Introduction to Database Systems COMP231 (Summer 1996) Transaction Management and Concurrency Control 2 Introduction Single-User Versus Mutiuser Systems |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/A4Lect12.ps, 19960726
Introduction to Database Systems COMP231 (Summer 1996) Transaction Management and Concurrency Control 40 Conservative TO Basic TO proceeds to execute an operation as soon as it receives it This may give rise to too many restarts of the rejected transactions Conservative TO delays proceeds to delay the |
| ftp://ftp.cs.ust.hk/pub/keithlau/smalltest.ps, 19960730
-3 -2 -1 1 2 3 -3 -2 -1 1 2 -1 -0.5 0.5 1 theta tau Phi(theta, tau) |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/s96/topic09.ps.gz, 19960803
COMP300M: Introduction to Pattern Recognition Topic 9: Performance Measures Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Summer 1996 COMP300M Performance Measures Performance at Character Level ffl Notation: N = total number of characters |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/topic09.ps.gz, 19960803
COMP300M: Introduction to Pattern Recognition Topic 9: Performance Measures Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Summer 1996 COMP300M Performance Measures Performance at Character Level ffl Notation: N = total number of characters |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/A4sol-midterm.ps, 19960804
Computer Science HKUST Summer 1996 COMP 231 Midterm Exam 1 COMP 231 - DATABASE MANAGEMENT SYSTEMS MIDTERM EXAM SOLUTIONS Note that there can be multiple solutions for the questions, one solution is concisely presented. I. Entity Relationship Diagram (Sub-Total 25 Points) Consider a university database |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/A4Lect14.ps, 19960804
Introduction to Database Systems COMP231 (Summer 1996) Recovery 1 Security Introduction to Database Systems COMP231 (Summer 1996) Recovery 2 Security Usually refers to security from malicious access or misuse Some forms of malicious access: unauthorized reading of data unauthorized modification of data |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/Lect14.ps, 19960804
Introduction to Database Systems COMP231 (Summer 1996) Recovery 1 Security Introduction to Database Systems COMP231 (Summer 1996) Recovery 2 Security Usually refers to security from malicious access or misuse Some forms of malicious access: unauthorized reading of data unauthorized modification of data |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/Lect13.ps, 19960805
Introduction to Database Systems COMP231 (Summer 1996) Recovery 1 Recovery Introduction to Database Systems COMP231 (Summer 1996) Recovery 2 Failures in DBMSs Transaction Failures Transaction aborts due to software bugs, or deadlocks Average of 3% of transactions abort abnormally (not user-intended) |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/A4Lect15.ps, 19960805
Introduction to Database Systems COMP231 (Summer 1996) Hierarchical and Network Datamodels 1 Hierarchical Data Model Network Data Model Introduction to Database Systems COMP231 (Spring 1995) Hierarchical & Network Data Model 2 Hierarchical Data Model The model is used by: - IBM s Information Management |
| ftp://ftp.cs.ust.hk/pub/csricky/A4/dalloc-jsac.ps.gz, 19960805
- 1 - Design and Evaluation of Data Allocation Algorithms for Distributed Multimedia Database Systems Yu-Kwong Kwok, Kamalakar Karlapalem, Ishfaq Ahmad and Ng Moon Pun Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/csricky/alloc-jsac-proof.ps.gz, 19960805
- 1 - Design and Evaluation of Data Allocation Algorithms for Distributed Multimedia Database Systems Yu-Kwong Kwok, Kamalakar Karlapalem, Ishfaq Ahmad and Ng Moon Pun Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/A4Lect13.ps, 19960805
Introduction to Database Systems COMP231 (Summer 1996) Recovery 12 Handling Media Failures Secondary Stable Storage Local Recovery Manager Database Buffer Manager Database (Volatile database) Buffers Fetch Flush Main Memory Storage read write read write Stable Log read write Log Buffers read write |
| ftp://ftp.cs.ust.hk/pub/kamal/comp231/Lect15.ps, 19960805
Introduction to Database Systems COMP231 (Summer 1996) Hierarchical and Network Datamodels 1 Hierarchical Data Model Network Data Model Introduction to Database Systems COMP231 (Spring 1995) Hierarchical & Network Data Model 2 Hierarchical Data Model The model is used by: - IBM s Information Management |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/s96/topic08.ps.gz, 19960806
COMP300M: Introduction to Pattern Recognition Topic 8: Multi-Classifier Systems Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Summer 1996 COMP300M Multi-Classifier Systems Introduction ffl For a given pattern recognition problem, usually a |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/topic08.ps.gz, 19960806
COMP300M: Introduction to Pattern Recognition Topic 8: Multi-Classifier Systems Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Summer 1996 COMP300M Multi-Classifier Systems Introduction ffl For a given pattern recognition problem, usually a |
| ftp://ftp.cs.ust.hk/pub/beat/lab4.ps, 19960809
HKUST Computer Science Comp104: Computer Fundamentals & Programming Fall Semester, 1996 Lab of week 5 (your TA will demonstrate you a model solution at the end of the lab section) Write a program to read in a string of characters that represent a Roman numeral and then convert it to Arabic form (an |
| ftp://ftp.cs.ust.hk/pub/bli/infocom97/paper.ps, 19960809
1 Analysis of a Hybrid Cutoff Priority Scheme for Multiple Classes of Traffic in Multimedia Wireless Networks Chuang Lin*, Bo Li and Samuel T. Chanson Department of Computer Science Hong Kong University of Science & Technology, Hong Kong Clear Water Bay, Kowloon, Hong Kong {clin, bli, chanson}@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/beat/lec6.ps, 19960809
COMP 104 Page 1 Chapter 6 #include void main () { void enter(int&, int&); void swap (int&, int&); void print(int, int); int n1, n2; enter(n1, n2); swap(n1,n2); print(n1,n2); void enter(int& x, int& y) { cout << endl << Enter two numbers> ; cin >> x >> y; } void swap (int& i, int& j) { int |
| ftp://ftp.cs.ust.hk/pub/beat/lec5.ps, 19960809
COMP 104 Page 1 Chapter 5 count_star = 0; while (count_star < n) cout << * ; count_star++; for (count_star = 0; line < n; count_star++) cout << * ; count_star = 1; do cout << * ; count_star++; } while (count_star < n); COMP 104 Page 2 while statement #include #include int |
| ftp://ftp.cs.ust.hk/pub/beat/lab2.ps, 19960809
HKUST Computer Science Comp104: Computer Fundamentals & Programming Fall Semester, 1996 Lab of week 3 (your TA will demonstrate you a model solution at the end of the lab section) Write a program that will calculate and print out bills for the Hong Kong water company. The water rates vary depending on |
| ftp://ftp.cs.ust.hk/pub/beat/lab6.ps, 19960809
HKUST Computer Science Comp104: Computer Fundamentals & Programming Fall Semester, 1996 Lab of week 9 (your TA will demonstrate you a model solution at the end of the lab section) Design and implement a C++ class to model a telephone directory for a company. The directory should contain space for up to |
| ftp://ftp.cs.ust.hk/pub/beat/lec1.ps, 19960809
COMP 104 Page 1 Chapter 1: Overview of Computers and Programming n Information processing n Computer organization n Hardware generations & categories n Software generations & categories n Data representation & coding schemes n Programming languages n Programming COMP 104 Page 2 INFORMATION PROCESSING n |
| ftp://ftp.cs.ust.hk/pub/beat/lec7.ps, 19960809
COMP 104 Page 1 Chapter 7 n From we get (p.335) : INT_MAX, INT_MIN, LONG_MAX, SHRT_MAX, ... n From we get (p. 350) : tolower(c), isdigit(c), isspace(c), isupper(c), ... n Complements: next == A || next == a next != A && next != a n % m == 0 && flag n % m || !flag n Suppose x is |
| ftp://ftp.cs.ust.hk/pub/beat/lec8.ps, 19960809
COMP 104 Page 1 Chapter 8 n offers: get and put to read individual characters; end of file test eof, end of line eoln, the newline sign
, alarm sign a . (see ex1.cc) n offers: ifstream infile; ofstream outfile, infile.open(), outfile.open(), infile.fail(), outfile.fail(), |
| ftp://ftp.cs.ust.hk/pub/beat/courseInfo.ps, 19960809
HKUST Computer Science Comp104: Computer Fundamentals & Programming Fall Semester, 1996 Course Information Instructor Dr. B. Wuthrich email: beat@cs.ust.hk office: 3518 Instructor Lecture notes and labs also available via http://www.cs.ust.hk/faculty/beat/bio.html Objective This course is designed to |
| ftp://ftp.cs.ust.hk/pub/beat/lec15.ps, 19960809
COMP 104 Page 1 Chapter 15, recursion n A procedure or function is said to be recursive if it calls itself. function rec_fun() rec_fun(); n Any recursive program can be rewritten into non-recursive form. Recursion is expensive, hence avoid it when possible. n Why having recursion: the problem or data |
| ftp://ftp.cs.ust.hk/pub/beat/lab3.ps, 19960809
HKUST Computer Science Comp104: Computer Fundamentals & Programming Fall Semester, 1996 Lab of week 4 (your TA will demonstrate you a model solution at the end of the lab session) Write a program to simulate a electronic calculator. Your program should execute as follows. Step 1: Display a prompt and |
| ftp://ftp.cs.ust.hk/pub/beat/lab7.ps, 19960809
HKUST Computer Science Comp104: Computer Fundamentals & Programming Fall Semester, 1996 Lab of week 11 (your TA will demonstrate you a model solution at the end of the lab section) Write a function that accepts an 8-by-8 array of characters that represents a maze. Each position can contain either an X |
| ftp://ftp.cs.ust.hk/pub/beat/lec4.ps, 19960809
COMP 104 Page 1 Chapter 4 n logical operators: <, <=, >, >=, ==, != n logical connectives: &&, ||, ! n Note that zero means FALSE and nonzero means TRUE (salary < min_salary) || (number_dependents > 5); (temperature > 90.0) && (humidity > 90.0); !(x == y); !((salary < min_salary) || (number_dependents > |
| ftp://ftp.cs.ust.hk/pub/beat/lab8.ps, 19960809
HKUST Computer Science Comp104: Computer Fundamentals & Programming Fall Semester, 1996 Lab of week 12 (your TA will demonstrate you a model solution at the end of the lab section) Implement your own linked list to realize a interactive bookkeeper. The bookkeeper starts from scratch and continously |
| ftp://ftp.cs.ust.hk/pub/beat/lab5.ps, 19960809
HKUST Computer Science Comp104: Computer Fundamentals & Programming Fall Semester, 1996 Lab of week 8 (your TA will demonstrate you a model solution at the end of the lab section) Another approach to sorting an array is to create an index array, where the index is an array whose element values represent |
| ftp://ftp.cs.ust.hk/pub/beat/lec2.ps, 19960809
COMP 104 Page 1 Chapter 2 n variables are of type float, int, char, short int, long int, double, long double n constants: const n I/O: cin and cout n #include n reserved words such as return and special symbols such as ; n identifiers n assignment statements, expressions & operators COMP |
| ftp://ftp.cs.ust.hk/pub/beat/lec16.ps, 19960809
COMP 104 Page 1 Chapter 16, dynamic data structured n Dynamic data structures grow and shrink while running the program. n Dynamic data structures are manipulated via pointers, and operators new and delete. int x = 1, y = 2, z; int *ip; // *ip is int, so ip is a pointer to int ip = &x; // ip points |
| ftp://ftp.cs.ust.hk/pub/beat/lec3.ps, 19960809
COMP 104 Page 1 Chapter 3 n functions are subprograms used for stepwise refinement n functions must be defined outside other functions, hence prototypes needed. // File: drawFig.cc; #include void main () { // declarations of function prototypes void draw_circle (); void draw_triangle (); |
| ftp://ftp.cs.ust.hk/pub/beat/lec9b.ps, 19960809
COMP 104 Page 1 Chapter 9, string and structures n char name; cin >> name; // user types Beat n One-dimensional array: n char name = Beat W ; n cout << name << endl; n provides functions such as strcpy(name, B. Wuth ); strcmp(s1,s2); 1 2 3 4 5 6 7 8 9 B e a t 0 COMP 104 Page 2 |
| ftp://ftp.cs.ust.hk/pub/beat/lec11.ps, 19960809
COMP 104 Page 1 Chapter 11, classes or abstract data types n class counter { public: void increment(); private: int value;}; n member functions, and data members or attributes n void counter::increment (){...}; n counter gold_medals; n gold_medals.increment(); n #ifndef COUNTER_H; #define COUNTER_H; |
| ftp://ftp.cs.ust.hk/pub/beat/lec13.ps, 19960809
COMP 104 Page 1 Chapter 13 n offers functions such as char *strcpy(char *, const char *); // (target, source) char *strcat(char *, const char *); int strlen(const char *); #include int strixstr (const char ctrg , const char csrc ) int i, j, k; for (i=0; ctrg != 0 ; i++) |
| ftp://ftp.cs.ust.hk/pub/beat/lec9a.ps, 19960809
COMP 104 Page 1 Chapter 9, arrays, searching and sorting n float x; n An array type is a structured data type representing a regular structure of components of the same type. n One-dimensional array: n x = 8.8; x = x; cout << x; n enum logical |
| ftp://ftp.cs.ust.hk/pub/beat/lec14.ps, 19960809
COMP 104 Page 1 Chapter 14, program design (many ways lead to Rom) First way: void main() triangle tri; tri.read_triangle(); tri.print_triangle(); tri.print_area(); COMP 104 Page 2 class triangle public: read_triangle() for (int i=0; i < 3; i++) cout << Enter vertex x y > ; cin >> x >> y; |
| ftp://ftp.cs.ust.hk/pub/beat/lec12.ps, 19960809
COMP 104 Page 1 Chapter 12, inheritance n A side-remark on dynamic arrays: collection = new float; // float collection delete collection; // dispose complete array n A derived class is derived from a base class ( class professor: public clerk |
| ftp://ftp.cs.ust.hk/pub/beat/lab1.ps, 19960809
HKUST Computer Science Comp104: Computer Fundamentals & Programming Fall Semester, 1996 Lab of week 2 (your TA will demonstrate you a model solution at the end of the lab session) The Pythagorean theorem states that the sum of the squares of the sides of a right triangle is equal to the square of the |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.pr96.ps.gz, 19960823
On-line Handwritten Alphanumeric Character Recognition Using Dominant Points in Strokes Xiaolin Li and Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon HONG KONG Internet: fxiaolin,dyyeungg@cs.ust.hk Fax: +852-2358-1477 August 23, 1996 |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/uai96/lec3.ps, 19960826
2. Probabilistic reasoning (b). Inference in Bayesian network Query: P (Alarm=Y jJohnCall=Y; MaryCall=N ) In general P (QjE=E0): ffl Q is a list of query variables. E.g. Q=fAlarmg ffl E is a list of evidence variables, and E0 is the corresponding list observed values. E.g. fJohnCall=Y, MaryCall=Ng |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/uai96/lec1.ps, 19960826
COMP 538, COMP 300O Reasoning and Decision under Uncertainty Fall Semester 1996-96 Dr. Nevin Lianwen Zhang (Rm 3509, lzhang@cs.ust.hk, Tel: 2358-7015, Fax: 2358-1477) 1. Computer programs that aid reasoning and decision making under uncertainty. ffl Tools for Decision analysis (Investment, bank loans, |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/uai96/lec2.ps, 19960826
2. Probabilistic reasoning (a). Bayesian newtorks ffl A problem domain is modeled by a list of variables x1, x2, : : : , xn, ffl Knowledge about the problem domain is represented by a joint probability P (x1; x2; : : : ; xn). Advantages: ffl Clear semantics, ffl In theory, can perform arbitrary |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/uai96/outline.ps, 19960826
COMP 538, COMP 300O: Reasoning and Decision under Uncertainty Fall Semester 1996-97 Dr. Nevin Lianwen Zhang (Rm 3509, lzhang@cs.ust.hk, Tel: 2358-7015, Fax: 2358-1477) Course description Methods of reasoning and decision making under uncertainty as applied to artificial intelligence. Probability theory |
| ftp://ftp.cs.ust.hk/pub/lzhang/aij96.ps.gz, 19960826
Irrelevance and Parameter Learning in Bayesian Networks Nevin Lianwen Zhang Department of Computer Science, University of Science & Technology, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/intro.ps, 19960830
COMP 251 Principles of Programming Languages 1996-1997 Fall Semester Lectures: Monday, Wednesday, Friday 12:00-12:50pm Instructor: Fangzhen Lin (flin@cs) Room 3552, Telephone 2358-6975 Office hours: Monday 4-5pm, Friday 3-5pm Tutorial: Wednesday 4:00-4:50pm TA: TBA Office Hours: TBA |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp560/evolbro.fm.ps, 19960902
Evolution of broadband technologies COMP 560 Jelena Misic 1 Overview of NISDN (ISDN) The first step towards ISDN was in integration of digital switching and digital transmission in Integrated Digital Networks (IDN). This evolution was dr iven by the need to have economic voice communications. The |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp560/Intro.fm.ps, 19960902
Introduction to broadband networking COMP 560 Jelena Misic 1 COMP 560 COMPUTER COMMUNICATION PROTOCOLS Dr. Jelena Misic Introduction to broadband networking COMP 560 Jelena Misic 2 INTRODUCTION Near future will face us with the following sophisticated communication services: video voice mail: voice - |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp560/INTRO.fm.ps, 19960902
Introduction to broadband networking COMP 560 Jelena Misic 1 COMP 560 COMPUTER COMMUNICATION PROTOCOLS Dr. Jelena Misic Introduction to broadband networking COMP 560 Jelena Misic 2 INTRODUCTION Near future will face us with the following sophisticated communication services: video voice mail: voice - |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp560/EVOLBRO.fm.ps, 19960902
Evolution of broadband technologies COMP 560 Jelena Misic 1 Overview of NISDN (ISDN) The first step towards ISDN was in integration of digital switching and digital transmission in Integrated Digital Networks (IDN). This evolution was driven by the need to have economic voice communications. The |
| ftp://ftp.cs.ust.hk/pub/comp211/Information/outline.ps, 19960903
COMP 211: Introduction to Software Engineering COURSE OUTLINE Fall Semester, 1996 OBJECTIVES This course provides an introduction to the concepts, techniques and technology of software engineering. A software engineering project will allow students to apply these concepts and techniques to a real-world |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/courseinfo.ps.gz, 19960903
Hong Kong University of Science and Technology COMP327/527: Pattern Recognition Fall 1996 Instructor Dit-Yan Yeung Rm 3541, 2358-6977, dyyeung@cs.ust.hk, http://www.cs.ust.hk/~dyyeung/ Teaching Assistant Hiu-Chung Law Rm 4203, 2358-8831, martin@cs.ust.hk Class Schedule Lecture: Tuesday & Thursday |
| ftp://ftp.cs.ust.hk/pub/comp211/Information/schedule.ps, 19960903
COMP 211: Introduction to Software Engineering SCHEDULE Fall Semester, 1996 DATE PROJECT QUIZZES Out Due 1. Sept. 2, 4 2. Sept. 9, 11 Task 1 - Sept. 9 3. Sept. 16, 18 4. Sept. 23, 25 5. Sept. 30, Oct. 2 Task 2 - Sept. 30 Task 1 - Sept. 30 Quiz 1 6. Oct. 7, 9 7. Oct. 14, 16 8. Oct. 23 Task 3 - Oct. 23 |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec1.ps, 19960903
COMP272: Theory of Computation Fall Semester 1996-97 Lecture 1: Motivation and Overview ffl Thue system: A finite set of unordered pairs of strings. fab, cdg, fcbd, bcg, fb, dabg, fda, abcg ffl Given a Thue system, two strings are equivalent if one can be obtained from the other by successively |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/syll.ps, 19960903
COMP 272 Theory of Computation 1996 Fall Semester Lecture 1: Dr. Mordecai Golin golin@cs.ust.hk, Rm 3547, 2358{6993 Lectures: T, Th 16:30 -17:50, LTD. Lecture 2: Dr. Nevin Zhang lzhang@cs.ust.hk, Rm 3509, 2358{7015 Lectures: T, Th 16:30 -17:50, Rm. 4505. TEXTBOOK : Elements of the Theory of Computation, |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec2.ps, 19960903
Lecture 2: Sets, Relations, and Functions (a Review) 1. Sets ffl A set is a collection of objects. ffl Let L = fa; b; c; dg be a set of four elements. We use a 2 L to denote that a is in L; and z 62 L to denote that z is not in L. ffl The empty set, denoted by ;, contains zero elements. All other sets |
| ftp://ftp.cs.ust.hk/pub/bli/252/class1.ps, 19960903
COMP 252 -- Fall 1996 (Dr. Bo Li) Class 1 (Introduction) 1 COMP 252 (SECTION 2) PRINCIPLES OF SYSTEMS SOFTWARE FALL 1996 COMP 252 -- Fall 1996 (Dr. Bo Li) Class 1 (Introduction) 2 Points To Be Noted Notes will be put into following directories: - /appl/Public/bli/252/ (for ftp server) - |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/f96/courseinfo.ps.gz, 19960903
Hong Kong University of Science and Technology COMP327/527: Pattern Recognition Fall 1996 Instructor Dit-Yan Yeung Rm 3541, 2358-6977, dyyeung@cs.ust.hk, http://www.cs.ust.hk/~dyyeung/ Teaching Assistant Hiu-Chung Law Rm 4203, 2358-8831, martin@cs.ust.hk Class Schedule Lecture: Tuesday & Thursday |
| ftp://ftp.cs.ust.hk/pub/beat/vincPap.ps.gz, 19960905
1 Probabilistic Data Mining from Fragmented Information Sources Vincent Cho and Dr. Beat W thrich {wscho, beat}@cs.ust.hk The Hong Kong University of Science and Technology Department of Computer Science Keywords: Data Mining and Knowledge Discovery |
| ftp://ftp.cs.ust.hk/pub/bli/252/class2.ps, 19960905
COMP 252 -- Fall 1996 (Dr. Bo Li) Class 2 (Introduction) 24 Parallel Systems Parallel Systems are composed of more than one CPU in a tightly coupled fashion: the CPUs share bus, the clock, sometime memory and peripheral devices Such system increases the throughput by being able to get more jobs done |
| ftp://ftp.cs.ust.hk/pub/comp211/Project/Task1.ps, 19960906
COMP 211 2/2 Department of Computer Science Appendix: A sample of capabilities and constraints of a library system. Capabilities Users: Check out/return a copy of a book Reserve a copy of a book currently on loan List user s current borrowings Retrieve a list of books by author, title, or subject area |
| ftp://ftp.cs.ust.hk/pub/comp211/Project/appendixF.ps, 19960906
Postgraduate Studies Department of Computer Science Revised 9/96 PhD Qualifying Examination Result (For Departmental file only) Student information Student name: ________________________________________ Student#: ________________________ (Please print; underline family name) Programme: MSc MPhil PhD |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec7.ps, 19960906
6: Proofs that languages are and are not reg- ular Example: = f0; 1; : : : ; 9g ffl L1 = |
| ftp://ftp.cs.ust.hk/pub/comp211/Project/RFP.ps, 19960906
COMP 211 4/4 Department of Computer Science offered in the coming semester and asked to submit three choices of courses for which they would like to be a TA (see Appendix I). Faculty are also asked to indicate their preferred choice of TAs (see Appendix J). If the preference of the faculty and the |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec3.ps, 19960906
Lecture 3: Languages and Regular Expressions Basic concepts ffl An Alphabet is a finite set of symbols. ffl A word (or string) is a finite sequence of symbols from the alphabet. Alphabet Words fa, b, : : : , zg man, abc, : : : f0, 1g 000, 010101, : : : f#, $, a, b, cg #cb$, $$$, : : : ffl The set of all |
| ftp://ftp.cs.ust.hk/pub/comp211/Project/appendixH.ps, 19960906
Postgraduate Studies Fall 1996-97 semester Department of Computer Science Revised 9/96 I meet with my advisor: weekly biweekly monthly other: _____________________ Semi-annual Progress Report for MPhil/PhD Programme (For Departmental file only) Part A: Student s report Email: __________________________ |
| ftp://ftp.cs.ust.hk/pub/comp211/Project/appendixA.ps, 19960906
Postgraduate Studies Department of Computer Science Revised 9/96 Request to Assign/Change Academic Advisor (For Departmental file only) New academic advisor acknowledgment This is to request that: Prof./Dr. ____________________________________________ and (Please print) Prof./Dr. |
| ftp://ftp.cs.ust.hk/pub/comp211/Project/appendixE.ps, 19960906
Postgraduate Studies Department of Computer Science Revised 9/96 Request to Take a PhD Qualifying Exam (For Departmental file only) Student information Student name: ________________________________________ Student#: ________________________ (Please print; underline family name) Programme: MSc MPhil PhD |
| ftp://ftp.cs.ust.hk/pub/kamal/comp531/Lect2.ps, 19960906
Database and Knowledge base Systems COMP531 (Fall 1996) Conceptual Modelling 1 Conceptual Modelling Database and Knowledge base Systems COMP531 (Fall 1996) Conceptual Modelling 2 Conceptual Modeling 1.Introduction 2.Record-oriented database modeling Representatives (i.e. the network, hierarchical and |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec5.ps, 19960906
Lecture 4.1: The fundamental theorem Let L . Then the following three statements are equivalent. 1. L is accepted by some NFA. 2. L is accepted by some DFA. 3. L is a regular language. Proof: Proof plan 3 => 1 => 2 => 3 3 => 1: ffl Given: L is a regular language. ffl Need to show: L is accepted by some |
| ftp://ftp.cs.ust.hk/pub/comp211/Project/appendixC.ps, 19960906
Postgraduate Studies Department of Computer Science Revised 9/96 Request for Area Exemption/Course Credit (For Departmental file only) Course information Exemption requested: AI CE DB ST TH Credit requested: Yes (3 check one only, if applicable) (3 check if applicable) Institution name: |
 | ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec6.ps, 19960906
5: Properties of regular languages Properties of languages accepted by NFA's or DFA's. Theorem 1 The set of regular languages are closed under 1. Concatenation, 2. Union, 3. Kleene star, 4. Complementation. 5. Intersection, and 6. Reversal. Proof: 1, 2, 3, and 6 were proved earlier. Item 4: ffl Give |
| ftp://ftp.cs.ust.hk/pub/kamal/comp531/A4Lect2.ps, 19960906
Database and Knowledge base Systems COMP531 (Fall 1996) Conceptual Modelling 26 Recent Trends to build fully-fledged DBMSs based on semantic models directly merge into the object database family continue to develop and evolve! Database and Knowledge base Systems COMP531 (Fall 1996) Conceptual Modelling |
| ftp://ftp.cs.ust.hk/pub/comp211/Project/appendixJ.ps, 19960906
Department of Computer Science Fall 1996 Instructor TA Preferences Fall 1996 >>> Please complete and return this form by Friday, August 23, 1996 <<< COURSE & INSTRUCTOR INFORMATION Course: Instructor: TA INFORMATION Special skills needed (e.g., background and/or programming languages): Request for |
| ftp://ftp.cs.ust.hk/pub/comp211/Project/appendixI.ps, 19960906
Department of Computer Science Fall 1996 Preferences for TA Duties Fall 1996 >>> This form must be completed and returned by all full-time PG students. <<< >>> Please complete and return this form by Friday, August 23, 1996 <<< Name: ______________________________________ |
| ftp://ftp.cs.ust.hk/pub/comp211/Project/appendixG.ps, 19960906
Postgraduate Studies Department of Computer Science Revised 9/96 PhD Thesis Proposal Examination Result (For Departmental file only) Student information Student name: ________________________________________ Student#: ________________________ (Please print; underline family name) Study mode: Full-time |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/uai96/lec5.ps, 19960907
5.Elimination ordering and complexity of VE The elimination process: ffl Let x be a node (vertex) in an undirected graph G. adj(x) | the set of neighbors of ffl Eliminating x from G means: 1. adding edges so that all nodes in adj(x) are pairwise adjacent, and 2. removing x and its incidenet edges. ffl |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/Lect1.ps, 19960907
Introduction to Software Engineering COMP211 (Fall 1996) Introduction 1 COMP 211 Introduction to Software Engineering Instructors Dr. Kamal Karlapalem, Room 3506, Tel.: 2358-6991, Email: kamal@cs Prof. Fred Lochovsky, Room 3527, Tel.: 2358-6996, Email: fred@cs Teaching Assistant Mr. James Purchase, Room |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/A4Lect1.ps, 19960907
Introduction to Software Engineering COMP211 (Fall 1996) Introduction 42 Combining Paradigms Paradigms are guidelines. Combine/modify them when needed. Requirements Analysis 4GT Spiral Model Prototyping Preliminary Requirements Gathering 4GT Maintenance Testing 4GT Coding Design Spiral Model: nth |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-31.ps.gz, 19960909
Planning in Stochastic Domains: Problem Characteristics and Approximation Nevin L. Zhang and Wenju Liu Technical Report HKUST-CS96-31 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect7.ps, 19960910
COMP 361 DATA COMMUNICATIONS 33 PHYSICAL LAYER INTERFACES COMP 361 DATA COMMUNICATIONS 34 Physical Layer Interfaces Most data processing devices cannot directly attach to the communications medium These devices, called data terminal equipment (DTE), for example, terminals, computers, use the data |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/set1.ps.gz, 19960910
Hong Kong University of Science and Technology COMP327/527: Pattern Recognition Fall 1996 Problem Set 1 (5%) Assigned: 10/9/96 Due: 24/9/96 Policy Issues 1. Your submission will be collected in class on the due date. Late submission will not be accepted. 2. Only five problems with highest marks will be |
| ftp://ftp.cs.ust.hk/pub/bli/252/class3.ps, 19960910
COMP 252 -- Fall 1996 (Dr. Bo Li) Class 3 (Introduction) 47 Main Memory Management Main memory is the repository of quickly accessible data shared by the CPU and the I/O devices. Also primary memory Main memory is the only device that the CPU is able to address directly For a program to be executed, it |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect7.ps, 19960910
COMP 361 DATA COMMUNICATIONS 33 PHYSICAL LAYER INTERFACES COMP 361 DATA COMMUNICATIONS 34 Physical Layer Interfaces Most data processing devices cannot directly attach to the communications medium These devices, called data terminal equipment (DTE), for example, terminals, computers, use the data |
| ftp://ftp.cs.ust.hk/pub/fred/proposal.ps, 19960911
ERG 1 (Revised 3/95) RGC Ref No. (to be completed by the UGC Secretariat) RESEARCH GRANTS COUNCIL Application for Allocation from the Earmarked Grant for Research 1996-97 PART I SUMMARY OF THE RESEARCH PROPOSAL 1. Project Title: Finding and Managing Information in Distributed, Digital Information |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/Lect2.ps, 19960911
Introduction to Software Engineering COMP211 (Fall 1996) Introduction 1 Case Study: A Telephone Switching System (Ghezzi p384) Problem: A big telecommunication company wishes to upgrade their existing telephone switching system to double its existing capacity while maintaining the same level of |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture2/1.overview1pp.ps, 19960911
COMP 211 1-1 SE Overview COMP 211 INTRODUCTION TO SOFTWARE ENGINEERING Instructors Dr. Kamal Karlapalem, Room 3506, Tel.: 2358-6991, Email: kamal@cs Prof. Fred Lochovsky, Room 3527, Tel.: 2358-6996, Email: fred@cs Teaching Assistant Mr. James Purchase, Room 4221a, Tel.: 2358-8840, Email: jamesp@cs Text |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/A4Lect2.ps, 19960911
Introduction to Software Engineering COMP211 (Fall 1996) Introduction 4 What actually happened Although many defects were found in integrated testing, they were all local to individual subsystems. Since no major design errors were discovered, the development cycle was fairly linear. The system was quite |
| ftp://ftp.cs.ust.hk/pub/dwood/xinxin/table.ps.gz, 19960911
Tabular Abstraction for Tabular Editing and Formatting Xinxin Wang Derick Woody |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.tnn97.ps.gz, 19960911
16 IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. XX, NO. Y, MONTH 1999 T.Y. Kwok and D.Y. Yeung, Use of bias term in projection pursuit learning improvesapproximationand convergenceproperties," 1996, To appear in IEEE Transactions on Neural Networks. W. Fang and R.C. Lacher, Network |
| ftp://ftp.cs.ust.hk/pub/dwood/xinxin/tr357.ps.gz, 19960911
An Abstract Model for Tables Xinxin Wang y Derick Wood z |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture2/1.overview2pp.ps, 19960911
COMP 211 1-1 SE Overview COMP 211 INTRODUCTION TO SOFTWARE ENGINEERING Instructors Dr. Kamal Karlapalem, Room 3506, Tel.: 2358-6991, Email: kamal@cs Prof. Fred Lochovsky, Room 3527, Tel.: 2358-6996, Email: fred@cs Teaching Assistant Mr. James Purchase, Room 4221a, Tel.: 2358-8840, Email: jamesp@cs Text |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/6.ps, 19960912
Structured Programming A program is structured if the flow of control through the program is evident from the syntactic structure of the program text. The flow of control through a program is evident if there is only a singleentry and a single-exit of the program. All the constructs that we have covered |
| ftp://ftp.cs.ust.hk/pub/bli/252/class5.ps, 19960912
COMP 252 -- Fall 1996 (Dr. Bo Li) Class 4 (Processes and Process Scheduling) 1 PROCESSES AND PROCESS SCHEDULING COMP 252 -- Fall 1996 (Dr. Bo Li) Class 4 (Processes and Process Scheduling) 2 Process Concepts A process is a program in execution A process is an active entity, with a program counter |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture3.ps, 19960912
Expressions Consider the formula for computing one of the roots of the quadratic equation: root = B + pB2 4 A C 2 A : ffl Coded in a typical assembly or machine language it would require at least 15 instructions, and probably far more. ffl Moreover, the programmer would have to provide storage for each |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture1.ps, 19960912
What's a PL for Stroustrup (1994): ffl A tool for instructing machines ffl A means for communicating between programmers ffl A vehicle for expressing high level designs ffl A notation for algorithms ffl A way of expressing relationships between concepts ffl A tool for experimentation ffl A means for |
| ftp://ftp.cs.ust.hk/pub/comp211/Examples/repository.example1pp.ps, 19960912
COMP 211 1/4 Department of Computer Science COMP 211: Introduction to Software Engineering Example Case Study: Technical Papers Repository Management Within the Department of Computer Science, the Database Group maintains a repository of technical papers. The repository consists of published and |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture5.ps, 19960912
Imperative Programming Action oriented. Primitive actions are machine-oriented: assignments, read, write, etc. A computation is a sequence of actions. Control structures specify how computation (sequences of action) is doen given the inputs. #include /* count characters in input */ main() int |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture4.ps, 19960912
Imperative programming ffl Imperative programming languages begin with Fortran, and include Algol, Pascal, and C. ffl The facilities provided by Pascal and C are well-developed and mature. ffl We shall concentrate on C for two reasons: { It's widely used both in academic and industry. { Its |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture2.ps, 19960912
Language Description A language has two parts: ffl Syntax: describes the sequence of symbols that make up valid programs. ffl Semantics: specifies what the programs mean. 1 What Are Reals Examples of reals: 0.1 23.6, .45 Non-examples: 23., 12.a, 2363 Informal rules: ffl A real has three parts: the |
| ftp://ftp.cs.ust.hk/pub/comp211/Examples/repository.example2pp.ps, 19960912
COMP 211 1/4 Department of Computer Science COMP 211: Introduction to Software Engineering Example Case Study: Technical Papers Repository Management Within the Department of Computer Science, the Database Group maintains a repository of technical papers. The repository consists of published and |
| ftp://ftp.cs.ust.hk/pub/bli/252/class4.ps, 19960912
COMP 252 -- Fall 1996 (Dr. Bo Li) Class 4 (Introduction) 65 Operating System Structure The approach to design large and complex systems such as OS Monolithic systems (simple systems) Layered systems Virtual machines Client Server systems COMP 252 -- Fall 1996 (Dr. Bo Li) Class 4 (Introduction) 66 Simple |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/Lect3.ps, 19960912
Introduction to Software Engineering COMP211 (Fall 1996) Introduction 5 Case Study: Budget Control System (Ghezzi, p389) Problem: Build a software system that suppor ts budget control for a small, high-tech software consulting and development company. Scenario: The main goal of budget control is |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/A4Lect3.ps, 19960912
Introduction to Software Engineering COMP211 (Fall 1996) Introduction 9 What actually happened It was decided to integrate BCS into the companywide information system. At that point, two independent systems existed: Administrative information system (AIS), running on a minicomputer, and budget control |
| ftp://ftp.cs.ust.hk/pub/dwood/xinxin/thesis.ps.gz, 19960912
Tabular Abstraction, Editing, and Formatting by Xinxin Wang A thesis presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of Doctor of Philosophy in Computer Science Waterloo, Ontario, Canada, 1996 c Xinxin Wang 1996 I hereby declare that I am the sole author of |
| ftp://ftp.cs.ust.hk/pub/beat/hwk1.ps, 19960912
HKUST 1 Computer Science HONG KONG UNIVERSITY OF SCIENCE & TECHNOLOGY COMP 104: Programming Fundamentals and Methods Fall Semester 1996 HOMEWORK ASSIGNMENT #1 Final program due on Oct. 11, 1996, in class (hand-in procedure: put floppy disc with source code put into an envelop carrying your name, your |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec4.ps, 19960912
Lecture 4: Finite Automata Deterministic finite automata (DFA): A language recognizer. 1. An input tape divided into squares: for string input. 2. A machine which can be in a finite number of states | finite control. 3. A movable reading head. Figure 2-1 1 Deterministic finite automata 4. |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/A4Lect4.ps, 19960915
Introduction to Software Engineering COMP211 (Fall 1996) Computer System Engineering 17 System Specification 1.System Overview objectives scope constraints 2.Functional and data description functional requirements data formats and requirements 3.System Architecture architecture context diagram ACD |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/Lect4.ps, 19960915
Introduction to Software Engineering COMP211 (Fall 1996) Computer System Engineering 1 Computer System Engineering Introduction to Software Engineering COMP211 (Fall 1996) Computer System Engineering 2 Introduction The elements of computer based-system are: Software, Hardware, People, Database, |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/7.ps, 19960916
Procedure Activations (Chapter 5 of Sethi) 1 ffl A procedures is a construct for giving a name to a piece of coding, its body. ffl When a procedure is called the body is executed. Each execution of the body is called an activation of the body. ffl Functional procedures { extend the built-in operators. |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture2/2.systems-engineering2pp.ps, 19960916
COMP 211 2-1 Computer System Engineering COMPUTER SYSTEMS ENGINEERING n desired system functions are: l uncovered l analyzed l allocated to individual system elements Hardware Database Documents Software People System Procedures INPUT OUTPUT COMP 211 2-2 Computer System Engineering SYSTEM |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture2/2.systems-engineering1pp.ps, 19960916
COMP 211 2-1 Computer System Engineering COMPUTER SYSTEMS ENGINEERING n desired system functions are: l uncovered l analyzed l allocated to individual system elements Hardware Database Documents Software People System Procedures INPUT OUTPUT COMP 211 2-2 Computer System Engineering SYSTEM |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/hw1.ps, 19960917
COMP 272 Theory of Computation Fall Semester 1996 Homework 1 As previously stated, the solutions to these problems can be submitted to the TAs but are not required to be. Problems 1-6 should be handed in at the tutorial on Friday, September 20 and problems 7-9 on Friday September 27. Late submissions |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/solution1.ps, 19960917
COMP 251 1996-97 Fall Semester Assignment #1 Date assigned: Friday, Sept 6, 1996 Due time: Before 12:00pm on Friday, Sept 13, 1996. Late paper will not be accepted Problem 1. (40%) Normally, it is easy to see how a given string can be generated by a given grammar, but harder to show that a given string |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp560/Performan.fm.ps, 19960917
Performance requirements for broadband networking COMP 560 Jelena Misic 1 Performance requirements for broadband networking The task is to define transfer mode of the single, universal broadband network, which is capable to fulfil all the requirements of expected and even unexpected services in the |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp560/PERFORMAN.fm.ps, 19960917
Performance requirements for broadband networking COMP 560 Jelena Misic 1 Performance requirements for broadband networking The task is to define transfer mode of the single, universal broadband network, which is capable to fulfil all the requirements of expected and even unexpected services in the |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/f96/set1.ps.gz, 19960918
Hong Kong University of Science and Technology COMP327/527: Pattern Recognition Fall 1996 Problem Set 1 (5%) Assigned: 10/9/96 Due: 24/9/96 Policy Issues 1. Your submission will be collected in class on the due date. Late submission will not be accepted. 2. Only five problems with highest marks will be |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/8.ps, 19960918
(COMP251 LECTURE 8) 1 Procedure Activations (Continued) Scope Rules for Names. Motivating examples: int x=1; main() { int x=2; { int x=3; printf("%n",x); test; } printf("%n",x); test() { printf("%n",x);} The scope rules of a language determine which declaration of a name x applies to an occurrence of x |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect11.ps, 19960919
COMP 361 MEDIUM ACCESS SUBLAYER 9 CSMA Protocols A compromise between the above two protocols is the p-persistent CSMA: 1.If the medium is idle, transmit with probability p, and delay one time unit (typically the maximum propogation delay) with probability (1-p) 2.If the medium is busy, continue to |
| ftp://ftp.cs.ust.hk/pub/bli/252/class6.ps, 19960919
COMP 252 -- Fall 1996 (Dr. Bo Li) Class 6 (Processes and Process Scheduling) 21 Process Scheduling Concepts While discussing batch systems, we realized that if programs are executed in a fixed sequence, the CPU may be idle when the program requires input/output The objective of multiprogramming as a |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect11.ps, 19960919
COMP 361 MEDIUM ACCESS SUBLAYER 9 CSMA Protocols A compromise between the above two pro- tocols is the p-persistent CSMA: 1.If the medium is idle, transmit with probability p, and delay one time unit (typically the maximum propogation delay) with probability (1-p) 2.If the medium is busy, continue to |
| ftp://ftp.cs.ust.hk/pub/comp211/Project/task1.ps, 19960920
20 September 1996 1 COMP211: Software Engineering Course Project Course Scheduling System Phase 1: The System Requirements Spring, 1996 The Computer Science Department has distributed a Request For Proposals (RFP) to local software houses (that means your group) to develop a course scheduling system |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp361/Physical.fm.ps, 19960920
COMP 361 DATA COMMUNICATIONS 1 DATA COMMUNICATIONS COMP 361 DATA COMMUNICATIONS 2 Data Transmission Data transmission from a sender to a receiver requires the use of a transmission medium: - Guided media: twisted pair, coaxial cable, fiber optic cable - Unguided media: microwave, satellite transmission, |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp361/Network.fm.ps, 19960920
COMP 361 NETWORK LAYER 1 NETWORK LAYER COMP 361 NETWORK LAYER 2 The Network Layer The data link layer was primarily responsible for reliable transfer of information across a physical link The network layer is responsible for providing transfer of data from the source to the destination The network layer |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/9.ps, 19960920
(COMP251 LECTURE 9) 1 Tail Recursion A call in the body of a procedure is recursive if executing this call may eventually lead to a call of this procedure: int fact(int x) void p() void q() { if (x == 0) return 1 { q;} { p;} else return x*fact(x-1); So a procedure is recursive iff there is a recursive |
| ftp://ftp.cs.ust.hk/pub/horner/04_moreutilities.ps, 19960920
I-3 More UNIX Utilities Redirection Using the > character after a command redirects output into a named file. Using the < character after a command redirects input from a named file I-2 More UNIX Utilities More utilities apropos Helpful way to find a command name echo Display command line input to |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp361/Mac.fm.ps, 19960920
COMP 361 MEDIUM ACCESS SUBLAYER 1 MEDIUM ACCESS SUBLAYER COMP 361 MEDIUM ACCESS SUBLAYER 2 Local and Metropolitan Area Networks Local area networks (LANs) and metropolitan area networks (MANs) are designed to interconnect computers within a small geographical area like a room, building, campus, or a |
| ftp://ftp.cs.ust.hk/pub/horner/06_shellbasics.ps, 19960920
COMP111 Lecture Notes Pattern matching You already know about * and The notation matches any single one of the enclosed characters. The notation matches any single character except the listed ones: Finally, many shells allow you to give a list of strings in curly brackets, comma |
| ftp://ftp.cs.ust.hk/pub/horner/05_filesystems.ps, 19960920
II-15 Odds and Ends Redirection You already know about input redirection (cat < file) and output redirection (cat > file). You can also append to a file using >> : % date > wholist % who >> wholist Simple file pattern matching The pattern * matches any number of any character: % ls /etc/pass* finds all |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp361/Dlink.fm.ps, 19960920
COMP 361 DATA LINK LAYER 1 DATA LINK LAYER COMP 361 DATA LINK LAYER 2 Why Data Link Layer The data link layer is responsible for efficient and reliable communication across a physical link The data link layer must provide: - Frame synchronization: cleary identify the beginning and end of each frame |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec2.ps, 19960922
HKUST 1 Computer Science comp 102 Lecture 2 Introduction to Computer Systems Information processing Computer organization Evolution of computers Hardware generations & categories HKUST 2 Computer Science comp 102 Lecture 2 Information Processing Simplified Work Model Computer Work Model Worker |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec5.ps, 19960922
HKUST 1 Computer Science comp 102 Lecture 5 Topics Introduction to C++ A sample program Another Example Input and Output HKUST 2 Computer Science comp 102 Lecture 5 Introduction to C++ C++ is the successor of C language. It was developed by Dennis Ritchie of AT & T Bell Laboratories. C and UNIX |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec4.ps, 19960922
HKUST 1 Computer Science comp 102 Lecture 4 Topics Fundamentals of programming Algorithm design Software life cycle Introduction to C++ A sample program An in-class quiz HKUST 2 Computer Science comp 102 Lecture 4 The Right Approach In computer-based problem solving, what is the most difficult part |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec6.ps, 19960922
HKUST 1 Computer Science comp 102 Lecture 6 Topics Variable Identifier Rules Reserved Words Comments Assignment Statement Testing and Debugging HKUST 2 Computer Science comp 102 Lecture 6 Variables Once a person has understood the way variables are used in the programming, he has understood the |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec3.ps, 19960922
HKUST 1 Computer Science comp 102 Lecture 3 Topics Future computing trends Multi-level structured computer organization Types of software Steps involved in computer programming Program documentation Compiling and editing HKUST 2 Computer Science comp 102 Lecture 3 Future Computing Trends Computing power |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/10.ps, 19960923
(COMP251 LECTURE 10) 1 Data Types A PL has two major components: data types and operations. Data structures in imperative PLs embody many of the unique features of such languages: ffl The emphasis in imperative languages is on data structures with assignable components; that is, components that can hold |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/uai96/assgn2.ps, 19960923
COMP 538, 300O: Homework Assignment 2 The purpose of this exercise for you to experience the process of constructing a Bayesian network and learn how to use some of the softwares. You are asked to build a Bayesian network for a bank that will allow the bank to determine whether or not to grant a person |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/solution1.ps, 19960923
COMP272 Tutorial 2 date: 9/20/96 notes prepared by YAN, Li Q6 Let P = fa; bg. Write regular expressions represent- ing the following sets: (a) All strings in P with exactly one or two a-s (but not a-s. or more than two a-s). b ab |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/uai96/netica/manual.ps, 19960923
Netica TM API Programmer's Library Reference Manual Version 1.00 - 2 - Netica API Programmer's Library Reference Manual Version 1.00 September 20, 1995 Copyright 1995 by Norsys Software Corp. This document may be copied and stored freely, provided it is duplicated in its entirety, without modification, |
| ftp://ftp.cs.ust.hk/pub/bli/252/class7.ps, 19960924
COMP 252 -- Fall 1996 (Dr. Bo Li) Class 7 (Processes and Process Scheduling) 40 SJF - Predicting Next CPU Burst We can use the past history of a process s CPU burst to predict the next CPU burst We predict the next CPU burst as an exponential average of the measured lengths of previous CPU bursts as |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec7.ps, 19960925
HKUST 1 Computer Science comp 102 Lecture 7 Topics Standard Input Standard Output Data Types Expression and Operators HKUST 2 Computer Science comp 102 Lecture 7 Standard Input cin the standard input stream Input operator ">>" - Extracting data from input stream - Skip white spaces - Extract only |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/Lect5.ps, 19960925
Introduction to Software Engineering COMP211 (Fall 1996) Requirements & Structured System Analysis 1 Requirements Analysis Overview Structured System Analysis Introduction to Software Engineering COMP211 (Fall 1996) Requirements & Structured System Analysis 2 Overview The scope of the software |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/A4Lect5.ps, 19960925
Introduction to Software Engineering COMP211 (Fall 1996) Requirements & Structured System Analysis 30 Summary DFDs DFD is a picture of a system it shows - partitioning - interfaces - data flows it does not show - procedures - control flow - trivial error paths (top levels) - system startup and system |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec8.ps, 19960925
HKUST 1 Computer Science comp 102 Lecture 8 Topics Expression and Operators Precedence Mixed-Type Assignment Program Branching Logical Expression Logical Operators HKUST 2 Computer Science comp 102 Lecture 8 Expressions Operator precedence: * / % are completed before operators with the same precedence |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/11.ps, 19960925
(COMP251 LECTURE 11) 1 Structures A structure, also called a record, is a collection of one or more variables, possibly of different types, grouped together under a single name for convenient handling. A structure type with k components (fields) has the following form: struct { T1 ; T2 |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/12.ps, 19960927
(COMP251 LECTURE 12) 1 Types and Error Checking How do compilers detect type errors Are the following statements in C legal int x; char c; x = 2.3; x = 2 + 2.3; x = c + 2.3; x = c; c = x; The rules of type in a langauge will answer questions like these. (COMP251 LECTURE 12) 2 Variable Bindings Rules |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/hw/hw1.ps, 19960929
COMP 102 (Fall 96) 1 HONG KONG UNIVERSITY OF SCIENCE & TECHNOLOGY COMP 102: Computer Fundamentals & Programming (Section 1) Fall Semester, 1996 HOMEWORK ASSIGNMENT #1: Payroll Program Due on October 11th, 1996 before 5:00pm Problem Description: A company has 3 types of employees: E (Executive), O |
| ftp://ftp.cs.ust.hk/pub/video/papers/SPIE96.ps.gz, 19960930
An Experimental Video Database Management System Based on Advanced Object-Oriented Techniques Liusheng Huang John Chung-Mong Lee Qing Li Wei Xiong Department of Computer Science Hong Kong University of Science and Technology, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/13.ps, 19960930
(COMP251 LECTURE 13) 1 Object-Oriented Programming "Object-oriented programming holds the promise of making complex systems easier to structure and manage. This promise can be realized by starting afresh from the problem to be solved and thinking at the application level, in terms of objects and |
| ftp://ftp.cs.ust.hk/pub/video/papers/Paper_beijing.ps.gz, 19960930
VIMS: Towards an Adaptive and Versatile Video Manipulation Server John Chung-Mong Lee Qing Li Wei Xiong Department of Computer Science Hong Kong University of Science and Technology, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/comp211/Project/Task2.ps, 19960930
COMP 211 1/1 Department of Computer Science COMP 211: Introduction to Software Engineering Task 2: Requirements Specification Assigned: September 30, 1996 Value: 10% of course mark Due: October 23, 1996 The Computer Science Department is pleased to inform you that your software house (that means your |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/sol2.ps, 19960930
COMP 251 1996-97 Fall Semester Assignment #2 Date assigned: Friday, Sept 13, 1996 Due time: 12:00pm on Friday, Sept 20, 1996 (Bring it to the class, and hand it in just before the class) Late paper will not be accepted Problem 1. (60%) Write a C program that eliminates extra spaces in the input. For |
| ftp://ftp.cs.ust.hk/pub/video/papers/ACCV95.ps.gz, 19960930
Video Segment Indexing Through Classification and Interactive View-based Query John Chung-Mong Leey, Wei Xiongy, Ding-Gang Shenzand Ruihua May yDepartment of Computer Science The Hong Kong University of Science & Technology, Hong Kong zInstitute of Optic-Fibre Technology Shanghai Jiaotong University, |
| ftp://ftp.cs.ust.hk/pub/video/papers/Paper_mta.ps.gz, 19960930
Multimedia Tools and Applications, 9, 1{25 (1992) c 1992 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. VIMS: A Video Information Management System JOHN CHUNG-MONG LEE, QING LI AND WEI XIONG fcmlee,qing,csxweig@cs.ust.hk Department of Computer Science, Hong Kong University of |
| ftp://ftp.cs.ust.hk/pub/video/papers/SPIE95.ps.gz, 19960930
Net comparison: a fast and effective method for classifying image sequences Wei Xiong John Chung-Mong Lee Man-Ching Ip Department of Computer Science Hong Kong University of Science and Technology, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/solution1-2.ps, 19960930
q2 q3 s q1 7. 1 0 1 0 1 0 > 1 0 0 0 1 1 0 1 1 0 1 0 8a. a a b b b b a a 8b. a a a b b a a a b b > b a b a b b a a a b b b q1 q2 q7q6q5q4q3 s q5q4q3q2q1 q10q9q8q7q6 s a a 8c. a b b a a b |
| ftp://ftp.cs.ust.hk/pub/video/papers/Paper_mva.ps.gz, 19960930
Automatic Video Data Structuring through Shot Partitioning and Key Frame Computing Wei XIONG, John Chung-Mong LEE, Rui-Hua MA |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/hw2.ps, 19960930
COMP 272 Theory of Computation Fall Semester 1996 Homework 2 Due 4 October, 1996 As previously stated, the solutions to these problems can be submitted to the TAs but are not required to be. 1. Draw NFAs that accept the following languages (a) (ab |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/tut1.ps, 19960930
+0/0 -0/0 +1/0 -1/0 +2/0 -2/0 +3/0 -3/0 ... +0/1 -0/1 +1/1 -1/1 +2/1 -2/1 +3/1 -3/1 ... +0/2 -0/2 +1/2 -1/2 +2/2 -2/2 +3/2 -3/2 ... +0/3 -0/3 +1/3 -1/3 +2/3 -2/3 +3/3 -3/3 ... Question 2: Show that if A is uncountable and B is countable then f: A fi B is not one-to-one. Proof: Assume A is uncountable |
| ftp://ftp.cs.ust.hk/pub/comp211/Examples/TPRM-dataflows2pp.ps, 19961002
COMP 211 Requirements Analysis TPRM DATA FLOWS New-addition = eywords} New-paper-data = R-categories} + |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/A4DFD.ps, 19961002
Introduction to Database Systems COMP231 (Spring 1995) Requirements & Structured System Analysis 36 PROCESS 4: Maintain repository b Repository Users D1 Paper pile D2 Repository Papers File folder Maintain repository 4 c Paper Sources D4 Entries on loan Papers File folder Overdue papers Paper review |
| ftp://ftp.cs.ust.hk/pub/comp211/Examples/TPRM-level1-processes1pp.ps, 19961002
COMP 211 Requirements Analysis PROCESS 1: Add papers Repository Users D1 Paper pile D2 Repository Papers Add papers 1 D3 Index card holder Paper Sources Papers File folder New additions Index card COMP 211 Requirements Analysis PROCESS 2: Query repository Repository Users D2 Repository Query repository |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/14.ps, 19961002
(COMP251 LECTURE 14) 1 C++ Reference book: Ellis and Stroustrup, The Annotated C++ Reference Manual, 1990. A copy of this book is in the library course reserve section. (COMP251 LECTURE 14) 2 A Brief History of C++ ffl Stroustrup extends C with Simula like classes while working at AT&T Bell Labs in the |
| ftp://ftp.cs.ust.hk/pub/comp211/Examples/TPRM-dataflows1pp.ps, 19961002
COMP 211 Requirements Analysis TPRM DATA FLOWS New-addition = eywords} New-paper-data = R-categories} + |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/DFD.ps, 19961002
Introduction to Database Systems COMP231 (Spring 1995) Requirements & Structured System Analysis 33 PROCESS 1: Add papers b Repository Users D1 Paper pile D2 Repository Papers Add papers 1 D3 Index card holder c Paper Sources Papers File folder New additions Index card Introduction to Database Systems |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/Example.ps, 19961002
COMP 211 1/4 Department of Computer Science COMP 211: Introduction to Software Engineering Example Case Study: Technical Papers Repository Management Within the Department of Computer Science, the Database Group maintains a repository of technical papers. The repository consists of published and |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-34.ps.gz, 19961002
Page 21 technique. The results also show that more globally optimizing techniques which consider a larger number of messages during sequencing and assignment decisions, perform consistently better than others which do not take an aggregate view of the scheduling problem. As a general trend, we observed |
| ftp://ftp.cs.ust.hk/pub/comp211/Examples/TPRM-level1-processes2pp.ps, 19961002
COMP 211 Requirements Analysis PROCESS 1: Add papers Repository Users D1 Paper pile D2 Repository Papers Add papers 1 D3 Index card holder Paper Sources Papers File folder New additions Index card COMP 211 Requirements Analysis PROCESS 2: Query repository Repository Users D2 Repository Query repository |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec10.ps, 19961002
HKUST 1 Computer Science comp 102 Lecture 9 Topics Quiz HKUST 2 Computer Science comp 102 Lecture 9 1. Which of the following, if any, are legal identifiers for a C++ program If not why a) 12 b) 3X c) data d) %change e) prog.cpp Ans: Only C 2. Which of the following are likely to be poor choices for an |
| ftp://ftp.cs.ust.hk/pub/comp211/Examples/repository-example1pp.ps, 19961002
COMP 211 1/4 Department of Computer Science COMP 211: Introduction to Software Engineering Example Case Study: Technical Papers Repository Management Within the Department of Computer Science, the Database Group maintains a repository of technical papers. The repository consists of published and |
| ftp://ftp.cs.ust.hk/pub/comp211/Examples/repository-example2pp.ps, 19961002
COMP 211 1/4 Department of Computer Science COMP 211: Introduction to Software Engineering Example Case Study: Technical Papers Repository Management Within the Department of Computer Science, the Database Group maintains a repository of technical papers. The repository consists of published and |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec9.ps, 19961002
HKUST 1 Computer Science comp 102 Lecture 9 Topics While Loop Increment and Decrement Operators Do-While Loop HKUST 2 Computer Science comp 102 Lecture 9 WHILE Loop Repeat a set of instructions as long as a specified condition is true. #include int main() int count_down; cout << How many |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp560/transfermodes.fm.ps, 19961003
Transfer modes for broadband networking COMP 560 Jelena Misic 1 Transfer modes for broadband networking This section covers Multirate circuit switching, fast circuit switching, frame relay, Switched multimegabit data service, SMDS Fast packet switching - Asynchronous transfer mode Transfer modes for |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp560/broadbandLAN.fm.ps, 19961003
Broadband (highspeed) LANs and MANs COMP 560 Jelena Misic 1 Definition of a MAN A MAN is a network capable of providing high speed (more than 1 Mbit/s), switched end-to-end connectivity across distances typically ranging between 5 and 50km. MAN should allow the simultaneous transport of data, voice and |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/uai96/lec7.ps, 19961003
7. Causal independence ffl Let e be a variable in a BN and let c1, c2, : : : , cm be its parents. The size of the conditional probability table (CPT) of e is exponential in m. ffl There is a need to exploit structures in CPT's to ease knowl- edge acquisition and inference. ffl Causal independence | one |
| ftp://ftp.cs.ust.hk/pub/bli/252/class9.ps, 19961003
COMP 252 -- Fall 1993 (Dr. Bo Li) Class 9 (Process Coordination) 1 PROCESS COORDINATION COMP 252 -- Fall 1993 (Dr. Bo Li) Class 9 (Process Coordination) 2 Cooperating Processes A process is considered independent if it cannot affect or be affected by other processes in the system Otherwise the process |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp560/BROADBANDLAN.fm.ps, 19961003
Broadband (highspeed) LANs and MANs COMP 560 Jelena Misic 1 Definition of a MAN A MAN is a network capable of providing high speed (more than 1 Mbit/s), switched end-to-end connectivity across distances typically ranging between 5 and 50km. MAN should allow the simultaneous transport of data, voice and |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec6-1.ps, 19961003
6: A Second Pumping Theorem The pumping theorem we saw previously was: Theorem 1 Let L be an infinite regular language. Then there exist strings x, y, and z such that y <> e; and xynz2L for all n >= : We can also prove a stronger pumping theorem (Ex. 2.6.4): Theorem 2 Let M = (K; ; ffi; s; F ) be a DFA. |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp560/TRANSFERMODES.fm.ps, 19961003
Transfer modes for broadband networking COMP 560 Jelena Misic 1 Transfer modes for broadband networking This section covers Multirate circuit switching, fast circuit switching, frame relay, Switched multimegabit data service, SMDS Fast packet switching - Asynchronous transfer mode Transfer modes for |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/15.ps, 19961005
(COMP251 LECTURE 15) 1 Overview In this lecture, we shall continue our discussion of this pointer. We'll then discuss static class members, which are like global variables. We'll then talking about scope rules about classes. We'll finish this lecture with nested and local classes. In case you don't |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/Ex6.ps, 19961006
Introduction to Database Systems COMP231 (Spring 1995) Introduction 22 Paper-status = Library# + Date-borrowed Usage-query = (Library#) Usage-report = Library# + {Author-name} + Title + Usage-count User-query = (Library#) + ({Author-name}) + (Title) Query-response = Library# + {Author-name} + Title + |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/Lect6.ps, 19961007
Introduction to Software Engineering COMP211 (Fall 1996) Introduction 1 Data Dictionary Introduction to Software Engineering COMP211 (Fall 1996) Introduction 2 Introduction A data dictionary (DD) is a set of definitions of data and processes declared in the DFDs It is a repository of meta data (data |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/16.ps, 19961007
(COMP251 LECTURE 16) 1 Review and Overview We have been talking about class declarations in C++, and some of the special features of C++ classes such as this pointer. We have also talked about the scope rules for C++ classes. In general, C++ uses the lexical scope rules. However, some of the scope rules |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/A4Lect6.ps, 19961007
Introduction to Software Engineering COMP211 (Fall 1996) Introduction 1 Data Dictionary Introduction to Software Engineering COMP211 (Fall 1996) Introduction 2 Introduction A data dictionary (DD) is a set of definitions of data and processes declared in the DFDs It is a repository of meta data (data |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/asg1.ps.gz, 19961008
Hong Kong University of Science and Technology COMP327: Pattern Recognition Fall 1996 Computer Assignment 1 (10%) Assigned: 8/10/96 Due: 24/10/96 Policy Issues 1. Your submission will be collected in class on the due date. 2. Late submission will only be accepted if it is submitted directly to the |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/A4Lect7.ps, 19961008
Introduction to Software Engineering COMP211 (Fall 1996) Introduction 21 Representing Process Logic Problem 1: Many ways to say the same thing Identify the actions and the conditions and use the common sentence structure to cast the sentence into the IF-THEN-ELSE-SO model Problem 2: Imprecise ranges Up |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/f96/asg1.ps.gz, 19961008
Hong Kong University of Science and Technology COMP327: Pattern Recognition Fall 1996 Computer Assignment 1 (10%) Assigned: 8/10/96 Due: 24/10/96 Policy Issues 1. Your submission will be collected in class on the due date. 2. Late submission will only be accepted if it is submitted directly to the |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec9.ps, 19961008
9: Pushdown Automata ffl Language recognizer for CFLs. ffl Example: L = fwcwR : w 2 fa; bg g ffl CFG: S ! aSa S ! bSb S ! c. ffl A recognizer for this language { Input: a string w. { Output: YES if w 2 L, NO otherwise. 1. C-Flag = FALSE. 2. Scan w from left to right. For each symbol oe scanned, { If1 oe |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/Lect7.ps, 19961008
Introduction to Software Engineering COMP211 (Fall 1996) Introduction 21 Representing Process Logic Problem 1: Many ways to say the same thing Identify the actions and the conditions and use the common sentence structure to cast the sentence into the IF-THEN-ELSE-SO model Problem 2: Imprecise ranges Up |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/sol3.ps, 19961008
COMP 251 1996-97 Fall Semester Assignment #3 Date assigned: Friday, Sept 20, 1996 Due time: 12:00pm on Friday, Sept 27, 1996 Solution prepared by flai@cs.ust.hk Problem 1. (20%) What are the differences between C procedures and macro definitions (#define statements) What are their advantages and |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec11.ps, 19961008
HKUST 1 Computer Science comp 102 Lecture 11 Topics More about logical expressions Logic variables in C++ Multi-way If-statement The switch statement HKUST 2 Computer Science comp 102 Lecture 11 Truth table for && and || Operand1 Operand2 Operand1 && Operand2 1 (True) 1 (True) 1 (True) 1 (True) 0 |
| ftp://ftp.cs.ust.hk/pub/horner/07_shellprog_part1.ps, 19961008
1 The UNIX Shells Main kinds of shells (but you wouldn t believe some of the strange things that are out there on the net ) Bourne shell and kin sh Bourne shell; original UNIX shell written in C la pseudo Algol (!) ksh Korn shell; job history, functions, arithmetic bash GNU Bourne again shell with |
| ftp://ftp.cs.ust.hk/pub/bli/252/class10.ps, 19961008
COMP 252 -- Fall 1993 (Dr. Bo Li) Class 10 (Process Coordination) 20 Two Process Solutions Solution 3: - Combines the approaches of solutions 1 and 2 1. repeat 4. while (flag1=true do noop; 5. critical section; 6. flag0 := false; 7. remainder 8. until false; 1. repeat 4. while (flag0= true do noop; 5. |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec8.ps, 19961008
8: Context-Free Languages Context-free grammars ffl A language generator that is more powerful than regular expressions. ffl Example: = fa; bg L = fstrings that begin with a and end with b and that contain a string of a's or a string of b's in betweeng ffl Regular expression: a(a |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec10.ps, 19961008
Properties of CFLs Theorem 1 CFLs are closed under union, concatenation, and Kleene Star. Proof ffl G1 = (V1; 1; R1; S1), G2 = (V2; 2; R2; S2). ffl Let G = (V1 |
| ftp://ftp.cs.ust.hk/pub/horner/07_shellprog_part2.ps, 19961008
1 Command substitution Running a pipeline surrounded by backquotes causes the shell to: Run the pipeline Substitute the output of the pipeline for everything inside the quotes The following uses the expr command to reset the value of a shell variable: $ i=1 $ expr $i + 1 2 $ echo $i 1 $ i= expr $1 + 1 $ |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp560/Homework2.fm.ps, 19961009
COMP 560, Homework 2, due date 22. October 1) Introduction: From a networking perspective, where engineering the network delay is a hard problem, solving the problem of delay variation (jitter) is even more frustrating. Here is the example of timing requirements for networks which are imposed by audio |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp560/Homework1.fm.ps, 19961009
COMP 560, Homework 1, due date 3. October 1) User equipped with the ISDN basic user-network interface, needs to access the public packet switched network. Suppose that packet switched node through which the user enters the packet switched network has only X.25 physical interface (e.g. EIA 232 or X.21). |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/f96/set2.ps.gz, 19961009
Hong Kong University of Science and Technology COMP327/527: Pattern Recognition Fall 1996 Problem Set 2 (5%) Assigned: 24/9/96 Due: 8/10/96 Policy Issues 1. Your submission will be collected in class on the due date. Late submission will not be accepted. 2. Only five problems with highest marks will be |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/uai96/lec8.ps, 19961009
8. Approximate inference Approximation is a necessity in large networks. Many approaches have been proposed. ffl Pruning of insignificant probabilities. ffl Simulation. ffl Search. ffl Abstraction. ffl Pruning of weak dependencies. ffl : : : etc. Basic issue: Tradeoff between accuracy and complexity. |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/set2.ps.gz, 19961009
Hong Kong University of Science and Technology COMP327/527: Pattern Recognition Fall 1996 Problem Set 2 (5%) Assigned: 24/9/96 Due: 8/10/96 Policy Issues 1. Your submission will be collected in class on the due date. Late submission will not be accepted. 2. Only five problems with highest marks will be |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/uai96/lec9.ps, 19961009
9. Learning Where do Bayesian networks come from ffl Both structures and parameters from experts. ffl Structures from experts and parameters from data (parameter learning). ffl Both structures and parameters from data (structure learning). Learning is also necessary for system self-improvement. We shall |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/17.ps, 19961009
(COMP251 LECTURE 17) 1 Overview We shall continue talking about special member functions: constructors and destructors. Closely related are issues regarding class initialization. So we'll talk about that as well. We'll get on with C++ class inheritances beginning next week. (COMP251 LECTURE 17) 2 Class |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/solution2.ps, 19961010
R(1,3,2) = a U ee*a = a R(2,3,2) = / U (a U b)e*a = aa U ba R(3,3,2) = e U (a U b)e*a = e U aa U ba R(3,2,2) = / U (a U b)e*b = ab U bb R(3,1,2) = (a U b) U (a U b)e*e = a U b R(1,1,3) = e U b(e U ab U bb)*(a U b) = e U b(ab U bb)*(a U b) R(1,3,3) = a U b(e U ab U bb)*(aa U ba) = a U b(ab U bb)*(aa U |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/proj.ps.gz, 19961010
Hong Kong University of Science and Technology COMP527: Pattern Recognition Fall 1996 Computer Project (20%) Assigned: 15/10/96 Due: 28/11/96 Policy Issues 1. Your submission will be collected in class on the due date. 2. Late submission will only be accepted if it is submitted directly to the |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/f96/proj.ps.gz, 19961010
Hong Kong University of Science and Technology COMP527: Pattern Recognition Fall 1996 Computer Project (20%) Assigned: 15/10/96 Due: 28/11/96 Policy Issues 1. Your submission will be collected in class on the due date. 2. Late submission will only be accepted if it is submitted directly to the |
| ftp://ftp.cs.ust.hk/pub/bli/252/class12.ps, 19961011
COMP 252 -- Fall 1993 (Dr. Bo Li) Class 12 (Process Coordination) 65 Interprocess Communication We have addressed the synchronization problems between processes so far The larger problem is one of communication between processes Two schemes of interprocess communication are popular: - Shared memory in |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/solution3.ps, 19961011
COMP272 Tutorial on Homework3 date: 10/11/96 notes prepared by YAN, Li Q1 (a) P ref(L) Let L = L(M);M = f ; K; ffi; s; Fg then P ref(L) = L(M ); M = f ; K; ffi; s; F g where q2F iff there exists a path in DFA from q to some state in F . (b) Suf(L) Suf(L) = (P ref(LR))R (d) L=L0, where L0 is accepted by |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/hw3.ps, 19961011
COMP 272 Theory of Computation Fall Semester 1996 Homework 3 { Due 11 October, 1996 As previously stated, the solutions to these problems can be submitted to the TAs but are not required to be. 1. Problems 2.4.5 (a), (b), (d), (g) in Lewis and Papadimitirou 2. For each of the following languages say |
| ftp://ftp.cs.ust.hk/pub/bli/252/class11.ps, 19961011
COMP 252 -- Fall 1993 (Dr. Bo Li) Class 12 (Process Coordination) 46 The Dining-Philosophers Problem Five philosophers sit around a common circular table and spend their time thinking and eating There is a chopstick between every two philosophers When a philosopher thinks, s/he does not interact with |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec12.ps, 19961012
HKUST 1 Computer Science comp 102 Lecture 12 Topics More about logical expressions The switch statement The for loop HKUST 2 Computer Science comp 102 Lecture 12 Example #include int main( ) double fuel_gauge_reading; cout << Enter fuel gauge reading: ; cin >> fuel_gauge_reading; cout << |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/A4Lect8.ps, 19961013
Introduction to Software Engineering COMP211 (Fall 1996) Introduction 29 Decision Trees Decision trees have the same purpose as decision tables Usually it is easier to depict conditions and decision points using decision trees Decision trees are very readable (to a lay person) and usually self |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/Lect8.ps, 19961013
Introduction to Software Engineering COMP211 (Fall 1996) Introduction 29 Decision Trees Decision trees have the same pur pose as decision tables Usually it is easier to depict conditions and decision points using decision trees Decision trees are very readable (to a lay person) and usually self |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec13.ps, 19961013
HKUST 1 Computer Science comp 102 Lecture 13 Topics More about for-loop The break-statement Nested loops Loop debugging techniques HKUST 2 Computer Science comp 102 Lecture 13 Selection of LOOP constructs: For Loop: Calculation that is repeated a fixed number of times using a value that is changed by |
| ftp://ftp.cs.ust.hk/pub/beat/hwk2.ps, 19961014
HKUST 1 Computer Science HONG KONG UNIVERSITY OF SCIENCE & TECHNOLOGY COMP 104: Programming Fundamentals and Methods Fall Semester 1996 HOMEWORK ASSIGNMENT #2 Final program due on Nov. 8, 1996 in class (hand-in procedure: put floppy disc with source code print out in an envelop carrying your name, your |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/18.ps, 19961014
(COMP251 LECTURE 18) 1 Overview In this lecture, we shall put what we have learned so far about C++ classes into action to design a list class. (COMP251 LECTURE 18) 2 The List Class Conceptual modeling: a list: item item item item NULL The value in an item can be of any type: integer, float, character, |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec14.ps, 19961016
HKUST 1 Computer Science comp 102 Lecture 14 Topics Some more nested loops Loop debugging techniques Top-down design techniques Functions HKUST 2 Computer Science comp 102 Lecture 14 Example Write a loop that will read in a list of even numbers (such as 2 -4 8 6) and compute the total of the numbers on |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/20.ps, 19961016
(COMP251 LECTURE 20) 1 Overview Topics covered in this class: memory management for derived classes; standard conversion; derived class object initialization; virtual functions (COMP251 LECTURE 20) 2 Memory Management An object of a class is typically represented by a contiguous region of memory. For |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/19.ps, 19961016
(COMP251 LECTURE 19) 1 Overview We're now ready to study the key relation between two classes in OOP: inheritance. A mechanism of inheritance has to address the following issues: ffl How are data members and member functions inherited ffl How are access controls inherited ffl Do we allow multiple |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture2/3.requirements-analysis1pp.ps, 19961017
COMP 211 3-1 Requirements Analysis REQUIREMENTS ANALYSIS OVERVIEW l refine the statement of scope for software developed during computer systems engineering l build a prototype of the software if requirements are unclear l iterate with the user l build a (data flow) model for the software l develop |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture2/3.requirements-analysis2pp.ps, 19961017
COMP 211 3-1 Requirements Analysis REQUIREMENTS ANALYSIS OVERVIEW l refine the statement of scope for software developed during computer systems engineering l build a prototype of the software if requirements are unclear l iterate with the user l build a (data flow) model for the software l develop |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-36.ps.gz, 19961018
Incorporating Verification of Liveness Properties in Compositional Reachability Analysis Shing-Chi Cheung , Dimitra Giannakopoulou y , and Jeff Kramer y Technical Report HKUST-CS96-36 October 1996 HKUST Department of Computer Science University of Science & Technology Clear Water Bay, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/21.ps, 19961018
(COMP251 LECTURE 21) 1 Overview Topics covered in this class: vertual functions, multiple inheritances, and virtual base classes. (COMP251 LECTURE 21) 2 Virtual Functions (Continued) A virtual function is a special member function invoked through a public base class reference or pointer; it is bound |
| ftp://ftp.cs.ust.hk/pub/gan/rocling96.ps.Z, 19961021
A Preliminary Study of Disambiguating VO- and VN-Constructions Using Selection Preferences Kok-Wee Gan Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong E-mail: gankw@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/A4Lect9.ps, 19961022
Introduction to Software Engineering COMP211 (Fall 1996) Introduction 42 Defining Data Stores Defined in terms of the data flows contained in it plus relationships among data in a data store. Need to describe logical properties of data stores 1.Entity types ( data structure) - generic description of a |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/DT.ps, 19961022
Introduction to Software Engineering COMP211 (Fall 1996) Introduction 56 Decision Trees (Example) The subsidy to the cub scout pack is based on the number of scouts, rank and length of membership. The subsidy for each scout is $25 for first year members, $35 for second year members and $50 for scouts |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/Lect9.ps, 19961022
Introduction to Software Engineering COMP211 (Fall 1996) Introduction 42 Defining Data Stores Defined in terms of the data flows contained in it plus relationships among data in a data store. Need to describe logical properties of data stores 1.Entity types ( data structure) - generic description of a |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/A4DT.ps, 19961022
Introduction to Software Engineering COMP211 (Fall 1996) Introduction 56 Decision Trees (Example) The subsidy to the cub scout pack is based on the number of scouts, rank and length of membership. The subsidy for each scout is $25 for first year members, $35 for second year members and $50 for scouts |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/scheme.ps, 19961023
Revised4 Report on the Algorithmic Language Scheme WILLIAM CLINGER AND JONATHAN REES (Editors) H. ABELSON R. K. DYBVIG C. T. HAYNES G. J. ROZAS N. I. ADAMS IV D. P. FRIEDMAN E. KOHLBECKER G. L. STEELE JR. D. H. BARTLEY R. HALSTEAD D. OXLEY G. J. SUSSMAN G. BROOKS C. HANSON K. M. PITMAN M. WAND Dedicated |
| ftp://ftp.cs.ust.hk/pub/bli/252/class14.ps, 19961023
COMP 252 -- Fall 1996 (Dr. Bo Li) Class 14 (Deadlock) 1 DEADLOCK COMP 252 -- Fall 1996 (Dr. Bo Li) Class 14 (Deadlock) 2 What is a Deadlock A process is said to be in a state of deadlock if it is waiting for an event that will never occur A system in which one or more processes are deadlocked, is said |
| ftp://ftp.cs.ust.hk/pub/bli/252/class15.ps, 19961023
COMP 252 -- Fall 1996 (Dr. Bo Li) Class 14 (Deadlock) 19 The Banker s Algorithm The algorithm is so named because of its resemblance to the way a bank handles loan requests A process entering the system must declare the maximum number of instances of each resource type that it may need When a process |
| ftp://ftp.cs.ust.hk/pub/comp211/Quizzes/quiz1.F96.solution2pp.ps, 19961024
COMP 332 1/6 Department of Computer Science COMP 211: Introduction to Software Engineering Quiz 1 October 4, 1996 Value: 15% of course mark Time: 50 minutes Total marks: 100 1. Circle the best answer in each question. Each correct answer is worth 2.5 points. Each incorrect answer will result in a |
| ftp://ftp.cs.ust.hk/pub/dlee/slides-final.ps.gz, 19961024
c Dik L. Lee Resource Discovery and Integration on the World Wide Web Dik L. Lee Department of Computer Science Hong Kong University of Science and Technology July, 1996 c Dik L. Lee Outline ffl Overview of Information Retrieval Techniques ffl Information Retrieval on the World Wide Web ffl WWW Index |
| ftp://ftp.cs.ust.hk/pub/comp211/Quizzes/quiz1.F96.solution1pp.ps, 19961024
COMP 332 1/6 Department of Computer Science COMP 211: Introduction to Software Engineering Quiz 1 October 4, 1996 Value: 15% of course mark Time: 50 minutes Total marks: 100 1. Circle the best answer in each question. Each correct answer is worth 2.5 points. Each incorrect answer will result in a |
| ftp://ftp.cs.ust.hk/pub/dyyeung/conf/tanc97/cfp1.ps, 19961025
Preliminary Call for Papers TANC-97 Hong Kong International Workshop on Theoretical Aspects of Neural Computation: A Multidisciplinary Perspective May 26-28, 1997 Hong Kong University of Science and Technology Over the past decade or so, neural computation has emerged as a research area with active |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec16.ps, 19961025
15. Uncomputability ffl If a language or a problem is not Turing-decidable, it is said to be unsolvable. ffl If Church's thesis is correct then there exist no algorithms to solve such a problem. ffl In this lecture, we will see a few unsolvable problems. 1 15. Uncomputability Theorem 1 The language K1 = |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/solution4.ps, 19961025
Question 1 (a) S -> aSa | bSb | c (b) S -> aSa | bSb | e (c) S -> aSa | bSb | a | b Question 2 (a) S -> aSb | A A -> aA | e (c) S -> ABB | BAB | BBA A -> a | aS | Sa B -> b | bS | Sb (d) S -> Xb X -> aXa | bXb | aXb | bXa | a (f) S -> aASb A -> a | e Question 3 e b > b ab ba,e a S f B A |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec11.ps, 19961025
11. Turing Machines Formal model of computers, consisting of ffl An infinite tape (with a left end), ffl A finite control which can be in a finite number of states, and ffl A read/write head. Figure 4-1 here 1 11. Turing Machines Operations of a Turing Machine: ffl Input string inscribed at left end of |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec15.ps, 19961025
15. Universal Turing Machines ffl Turing machines are fixed at time of design to solve a par- ticular problem. ffl Computers are general purpose" programmable machines. ffl How to make Turing machines programmable Idea: Unviversal Turing machines, U . ffl Input: { Description of a TM M = (K; ; ffi; s). |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec12.ps, 19961025
12. Turing Machines/Combinations of ffl We claimed that Turing machines are a formal model of computers. They are capable of performing any computations that can be carried out by the existing computers or computers in the future. ffl This lecture justifies this claim by showing how complex machines can |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec14.ps, 19961025
14. Turing Machines and Grammars ffl In a context-free grammar G = (V; ; R; S), R is a subset of (V ) V : The left hand side of every rule is one nonterminal. ffl A grammar ( or a rewriting system or an unre- stricted grammar) is a quadruple G = (V; ; R; S) where R is a subset of (V (V )V ) V : The left |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec13.ps, 19961025
13. Turing Machines/Extensions of Ways to extend Turing machines: 1. Allow two-way infinite tape. Figure 4-18 here 2. Allow multiple tapes. Figure 4-23 here 1 3. Allow multiple heads. 4. Allow two-dimensional tape. 5. Combination of some or all of the above. Theorem 1 The operation of a machine allowing |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture2/4.software-design2pp.ps, 19961025
COMP 211 4-1 Software Design SOFTWARE DESIGN OVERVIEW Computer systems engineering Software requirements analysis Software design Design Code Test Information model Data design Procedural design Architectural design Program modules Integrated and validated software Other requirements Behavioral |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture2/4.software-design1pp.ps, 19961025
COMP 211 4-1 Software Design SOFTWARE DESIGN OVERVIEW Computer systems engineering Software requirements analysis Software design Design Code Test Information model Data design Procedural design Architectural design Program modules Integrated and validated software Other requirements Behavioral |
| ftp://ftp.cs.ust.hk/pub/beat/kj_mphil_thesis.ps.gz, 19961026
age(paul, 35) male(paul) father(paul, amy) father(A, B) :- parent(A, B), male(A). parent(A, B) :- father(A, B). parent(A, B) :- mother(A, B). into |
| ftp://ftp.cs.ust.hk/pub/comp211/Project/Task3.ps, 19961028
COMP 211 1/1 Department of Computer Science COMP 211: Introduction to Software Engineering Task 3: Design Specification Assigned: October 28, 1996 Value: 10% of course mark Due: November 18, 1996 In this phase of the project, the Computer Science Department requests that you produce a design |
| ftp://ftp.cs.ust.hk/pub/wongkk/design.ps.Z, 19961029
The Design of an Object-Role Database Management System Raymond K. Wong H. Lewis Chau Frederick H. Lochovsky Department of Computer Science Hong Kong University of Science & Technology Clear Water Bay, Hong Kong fwongkk,lewis,fredg@cs.ust.hk Number: 165 |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/hw/hw2.ps, 19961029
COMP 102 (Fall 96) 1 HONG KONG UNIVERSITY OF SCIENCE & TECHNOLOGY COMP 102: Computer Fundamentals & Programming (Section 1) Fall Semester, 1996 HOMEWORK ASSIGNMENT #2: RASTER GRAPHICS Due on November 7th, 1996 before 5:00pm Problem Description: Assume a two-dimensional space of and . |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec16.ps, 19961029
HKUST 1 Computer Science comp 102 Lecture 16 Topics Functions Placement of Functions Procedural Abstraction Local Variables Global Variables Global Constants Scope Rules HKUST 2 Computer Science comp 102 Lecture 16 Placement of Functions Each function call (inside the function main() or inside some |
| ftp://ftp.cs.ust.hk/pub/bli/252/class17.ps, 19961029
COMP 252 -- Fall 1996 (Dr. Bo Li) Class 16 (Memory Management) 27 Paging Physical memory is divided into a number of equal sized frames Logical memory is divided into a number of equal sized pages Processes generate logical addresses which are mapped to physical addresses Paging permits the logical |
| ftp://ftp.cs.ust.hk/pub/bli/252/class16.ps, 19961029
COMP 252 -- Fall 1996 (Dr. Bo Li) Class 16 (Memory Management) 1 MEMORY MANAGEMENT COMP 252 -- Fall 1996 (Dr. Bo Li) Class 16 (Memory Management) 2 Why Memory Management Through CPU scheduling and multiprogramming, we are able to improve the CPU utilization and the response time To achieve this, we have |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/A4Lect10.ps, 19961030
Introduction to Software Engineering COMP211 (Fall 1996) Requirements & Structured System Analysis 1 Software Design Fundamentals Introduction to Software Engineering COMP211 (Fall 1996) Requirements & Structured System Analysis 2 Software Design Overview] Computer systems engineering Software |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/24.ps, 19961030
(COMP251 LECTURE 24) 1 Overview General introductions to Scheme programs, expressions, and definitions. Basic data types in Scheme. In all the slides about Scheme, S & R refers to the book: G. Springer and D.P. Friedman. Scheme and the Art of Programming. MIT Press. 1991. R4RS refers to the following |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp560/ATMarchitecture.fm.ps, 19961030
ATM ARCHITECTURE COMP 560 Jelena Misic 1 Basic principles of ATM This section covers: 1.ATM cell format 2.Principles of information transfer, Routing, Quality of Service, Usage parameter control, Flow control. 3.BISDN protocol architecture: ATM adaptation layer AAL (AAL 1, AAL 2, AAL 3/4 and AAL 5) ATM |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/Lect10.ps, 19961030
Introduction to Software Engineering COMP211 (Fall 1996) Requirements & Structured System Analysis 1 Software Design Fundamentals Introduction to Software Engineering COMP211 (Fall 1996) Requirements & Structured System Analysis 2 Software Design Overview] Computer systems engineering Software |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp560/Homework3.fm.ps, 19961030
COMP 560, Homework 3, due date 14. November 1) A 1000-byte MAC frame is to be transmitted accross a DQDB SMDS network. Using the transmission overheads for SIP3 and SIP2 layers derive the number of queued arbitrated slots that are required to carry out the transfer of the frame and hence the total |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp560/ATMARCHITECTURE.fm.ps, 19961030
ATM ARCHITECTURE COMP 560 Jelena Misic 1 Basic principles of ATM This section covers: 1.ATM cell format 2.Principles of information transfer, Routing, Quality of Service, Usage parameter control, Flow control. 3.BISDN protocol architecture: ATM adaptation layer AAL (AAL 1, AAL 2, AAL 3/4 and AAL 5) ATM |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/topic07.ps.gz, 19961031
COMP300M: Introduction to Pattern Recognition Topic 7: Feature Extraction Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Summer 1996 COMP300M Feature Extraction Karhunen-Lo eve (K-L) Transform ffl One domain-independent method commonly used |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp300/s96/topic07.ps.gz, 19961031
COMP300M: Introduction to Pattern Recognition Topic 7: Feature Extraction Dit-Yan Yeung Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk Summer 1996 COMP300M Feature Extraction Karhunen-Lo eve (K-L) Transform ffl One domain-independent method commonly used |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp560/ATMswitching.fm.ps, 19961031
ATM switch architectures COMP 560 Jelena Misic 1 Switch architectures General architecture of an ATM switch consists of: Input controller (IC) Output controller (OC) Control processor and Switch fabric ATM switch architectures:flgeneral |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp560/ATMenvironments.fm.ps, 19961031
ATM environments COMP 560 Jelena Misic 1 ATM environments This section covers: ATM LANs Call processing in ATM LANs: connection oriented calls connectionless calls LAN emulation Classical IP over ATM ATM in wide area networks ATM environments COMP 560 Jelena Misic 2 ATM LANs Communication requirements |
| ftp://ftp.cs.ust.hk/pub/bli/252/project2.ps, 19961031
Department of Computer Science The Hong Kong University of Science and Technology COMP 252 Fall 1996 Project 2 1 COMP 252 - Principles of Systems Software Project 2 Due: November 21, 1996. In this part of the assignment, you will implement the MEMORY module of a simplified operating system, and will |
| ftp://ftp.cs.ust.hk/pub/comp211/Examples/tutorial.Nov11pp.ps, 19961101
COMP 211 1 Department of Computer Science COMP 211: Introduction to Software Engineering Tutorial Exercises Nov 1, 1996 1. Consider the following data dictionary definition for a data structure: TAX-RETURN= FORM-1020+ {W-2-FORM}+ SCHEDULE-B+ SCHEDULE-C+ {SUPPORTING-SCHEDULES}+ (PERSONAL-CHECK) (a) Is at |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture25.ps, 19961101
(COMP251 LECTURE 25) 1 Overview Literal expressions. Constructing lists using cons. Taking lists apart by using car and cdr. Conditional expressions. Lambda expressions. Recursive procedures. (COMP251 LECTURE 25) 2 Read-Eval-Print Loop Before we go any further, it is necessary to look at how Scheme |
| ftp://ftp.cs.ust.hk/pub/comp211/Examples/tutorial.Nov12pp.ps, 19961101
COMP 211 1 Department of Computer Science COMP 211: Introduction to Software Engineering Tutorial Exercises Nov 1, 1996 1. Consider the following data dictionary definition for a data structure: TAX-RETURN= FORM-1020+ {W-2-FORM}+ SCHEDULE-B+ SCHEDULE-C+ {SUPPORTING-SCHEDULES}+ (PERSONAL-CHECK) (a) Is at |
| ftp://ftp.cs.ust.hk/pub/horner/08_regexps.ps, 19961101
1 Regular Expressions A regular expression is a pattern description using a meta language, that is, a language that you use to describe particular patterns of interest. The basic elements regular expressions are: . Matches any single character * Matches zero or more occurrences of the preceding |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec15.ps, 19961102
COMP102 (Fall 96) Lecture 15 1 of 13 Functions o facilitate top-down design - decomposition - information hiding - easily understandable - easily modifiable o reusability Function COMP102 (Fall 96) Lecture 15 2 of 13 Functions (Cont d) // compute the square of an input number #include |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/uai96/lec10.ps, 19961104
10. Decision Theory Two kinds: ffl Normative decision theory How people should decide. (Rational agent) ffl Descriptive decision theory How people actually decide. 1 10. Normative Decision Theory ffl S | a set of possible outcomes, some of which are preferred over others. ffl A decision d can influence |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/nldr.ps.gz, 19961104
Non Linear Dimensionality Reduction David DeMers & Garrison Cottrelly Dept. of Computer Science & Engr., 0114 Institute for Neural Computation University of California, San Diego 9500 Gilman Dr. La Jolla, CA, 92093-0114 |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/f96/set3.ps.gz, 19961104
Hong Kong University of Science and Technology COMP327/527: Pattern Recognition Fall 1996 Problem Set 3 (5%) Assigned: 24/10/96 Due: 7/11/96 Policy Issues 1. Your submission will be collected in class on the due date. Late submission will not be accepted. 2. Only five problems with highest marks will be |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/set3.ps.gz, 19961104
Hong Kong University of Science and Technology COMP327/527: Pattern Recognition Fall 1996 Problem Set 3 (5%) Assigned: 24/10/96 Due: 7/11/96 Policy Issues 1. Your submission will be collected in class on the due date. Late submission will not be accepted. 2. Only five problems with highest marks will be |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/uai96/lec11.ps, 19961104
11. Decision Analysis Applying normative decision theory. ffl How to represent a decision problem. ffl How to compute optimal decisions. Two major frameworks: ffl Decision trees1 ffl Influence diagrams, decision networks. 1Different from decision trees used in the learning community. 1 11. Decision |
| ftp://ftp.cs.ust.hk/pub/beat/hwk3.ps, 19961104
HKUST 1 Computer Science HONG KONG UNIVERSITY OF SCIENCE & TECHNOLOGY COMP 104: Computer Fundamentals & Programming Fall Semester 1996 HOMEWORK ASSIGNMENT #3 Final program due on Nov. 29, 1996 in class PROBLEM DESCRIPTION Hong Kong is a major financial centre. The major asset classes traded in financial |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/f96/nldr.ps.gz, 19961104
Non Linear Dimensionality Reduction David DeMers & Garrison Cottrelly Dept. of Computer Science & Engr., 0114 Institute for Neural Computation University of California, San Diego 9500 Gilman Dr. La Jolla, CA, 92093-0114 |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/asg2.ps.gz, 19961105
Hong Kong University of Science and Technology COMP327: Pattern Recognition Fall 1996 Computer Assignment 2 (10%) Assigned: 7/11/96 Due: 21/11/96 Policy Issues 1. Your submission will be collected in class on the due date. 2. Late submission will only be accepted if it is submitted directly to the |
| ftp://ftp.cs.ust.hk/pub/bli/252/class18b.ps, 19961105
COMP 252 -- Fall 1996 (Dr. Bo Li) Class 18 (Virtual Memory) 1 VIRTUAL MEMORY COMP 252 -- Fall 1996 (Dr. Bo Li) Class 18 (Virtual Memory) 2 What is Virtual Memory So far we assumed that for a process to run, it must be completely resident in memory Virtual memory is a technique that allows the execution |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/f96/asg2.ps.gz, 19961105
Hong Kong University of Science and Technology COMP327: Pattern Recognition Fall 1996 Computer Assignment 2 (10%) Assigned: 7/11/96 Due: 21/11/96 Policy Issues 1. Your submission will be collected in class on the due date. 2. Late submission will only be accepted if it is submitted directly to the |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/uai96/lec13.ps, 19961105
12. Removable arcs ffl In principle, ID's can be evaluated by using SDDN-EVALUATE. ffl Because of the no-forgetting constraints, some decision nodes d in an ID can have a large number of parents and consequently the corresponding evaluation functionals e(ssd; d) might be too large to handle. ffl |
| ftp://ftp.cs.ust.hk/pub/bli/252/class18a.ps, 19961105
COMP 252 -- Fall 1996 (Dr. Bo Li) Class 18 (Memory Management) 38 User s View of Memory The user views memory as a collection of variable-sized segments with no necessary ordering among the segments The user s view of the (logical) memory is mapped onto physical memory Paging separates the users view of |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/uai96/lec12.ps, 19961105
12. Evaluating Influence Diagrams History ffl Howard and Matheson (1984) transform IDs into decision trees, which are evaluated by using the average-out and folding-back algorithm. ffl Shachter (1986) has shown that IDs can be evaluated by applying series of arc reversal and node removal operations on |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture26.ps, 19961105
(COMP251 LECTURE 26) 1 Overview Flat recursion. Deep recursion. Lambda expressions with any number of arguments. Binding constructs. Locally defined procedures. (COMP251 LECTURE 26) 2 Recursive Procedures (More Examples) Append. Given two lists ls1 and ls2, (append ls1 ls2) returns a new list consisting |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/A4Lect11.ps, 19961106
Introduction to Software Engineering COMP211 (Fall 1996) Requirements & Structured System Analysis 1 Software Design Fundamentals Introduction to Software Engineering COMP211 (Fall 1996) Requirements & Structured System Analysis 2 Software Design Overview] Computer systems engineering Software |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec17.ps, 19961106
HKUST 1 Computer Science comp 102 Lecture 17 Topics Void Functions Function Call-by-Reference HKUST 2 Computer Science comp 102 Lecture 17 Void Functions In C++ a function might return a value or no value at all. A function that returns no value is called a void-function. Such a function does something |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture27.ps, 19961106
(COMP251 LECTURE 27) 1 Overview Binding constructs. Locally defined procedures. Procedures as values. Currying. (COMP251 LECTURE 27) 2 Binding Constructs Sec.4.2.2 of R4RS and Ch.5 of S&F Scheme has three binding constructs: let, let*, and letrec. The syntax for all three of them is identical: (let |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/uai96/assgn4.ps, 19961106
COMP 538, 300O: Homework Assignment 4 Due: November 27, 1996 Strong junction tree propagation (Jensen et al 1994) is a popular algorithm for evaluating influence diagrams. Due to time constraints, we will not be able to cover it in class. In this assignment, you are asked to learn the algorithm by your |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect30.ps, 19961106
COMP 361 NETWORK LAYER 1 NETWORK LAYER COMP 361 NETWORK LAYER 2 The Network Layer The data link layer was primarily responsible for reliable transfer of information across a physical link The network layer is responsible for providing transfer of data from the source to the destination The network layer |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect29.ps, 19961106
COMP 361 DATA LINK LAYER 41 HDLC - Stations Three types of stations are supported: 1.Primary station: has the responsibility for controlling the operation of the link. Frames issued by primary are called commands. 2.Secondary station: operates under the control of the primary station. Frames issued by |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect30.ps, 19961106
COMP 361 NETWORK LAYER 1 NETWORK LAYER COMP 361 NETWORK LAYER 2 The Network Layer The data link layer was primarily responsible for reliable transfer of information across a physical link The network layer is responsible for providing transfer of data from the source to the destination The network layer |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/Lect11.ps, 19961106
Introduction to Software Engineering COMP211 (Fall 1996) Requirements & Structured System Analysis 1 Software Design Fundamentals Introduction to Software Engineering COMP211 (Fall 1996) Requirements & Structured System Analysis 2 Software Design Overview] Computer systems engineering Software |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect29.ps, 19961106
COMP 361 DATA LINK LAYER 41 HDLC - Stations Three types of stations are supported: 1.Primary station: has the responsibility for controlling the operation of the link. Frames issued by primary are called commands. 2.Secondary station: operates under the control of the primary station. Frames issued by |
| ftp://ftp.cs.ust.hk/pub/bli/252/class20.ps, 19961107
COMP 252 -- Fall 1996 (Dr. Bo Li) Class 19 (Virtual Memory) 36 Memory Management in UNIX Early versions of Unix were implemented on machines with small real storage address spaces The total memory resources available did not justify the implementation of complex memory management strategies The early |
| ftp://ftp.cs.ust.hk/pub/bli/252/class19.ps, 19961107
COMP 252 -- Fall 1996 (Dr. Bo Li) Class 19 (Virtual Memory) 14 Page Replacement Algorithms Page Fault Rate: fraction of the total memory references that cause a page fault (requiring a page to be brought in) Reference String: A sequence of memory addresses produced by a process Evaluating page |
| ftp://ftp.cs.ust.hk/pub/dyyeung/cpol/paper.ps, 19961108
A Heuristic Search Approach to Chinese Glyph Generation Using Hierarchical Character Composition Pak-Keung Lai , Dit-Yan Yeung, Man-Chi Pong y Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon Hong Kong fpklai,dyyeung,mcpongg@cs.ust.hk November 8, |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture28.ps, 19961108
(COMP251 LECTURE 28) 1 Overview Currying (Continued). Abstraction of flat recursion. (COMP251 LECTURE 28) 2 Currying (Continued) The map function: (define map (lambda f ls) (if (null ls) '() (cons (f (car ls)) (map f (cdr ls))))) can be similarly curried: (define c-map (lambda (f) (letrec ((helper |
| ftp://ftp.cs.ust.hk/pub/comp211/Project/Task4.ps, 19961108
COMP 211 1/1 Department of Computer Science COMP 211: Introduction to Software Engineering Task 4: User Interface and System Prototyping Assigned: November 11, 1996 Value: 10% of course mark Due: December 7, 1996 In this phase of the project, the Computer Science Department requests that you prototype |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec19.ps, 19961111
Lecture 19: NP-Complete Problems The bounded tiling problem ffl A tile is a square with markings on the four edges. ffl Two tiles can be next to each other if their marking on the touching edges are the same. ffl There is an infinite supply of copies of each tile. ffl First row given. Can we extend the |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/sol4.ps, 19961111
COMP 251 1996-97 Fall Semester Assignment #4 Solution Problem 1. Below is the suggested solution of the file pool:c. I made a little change in the print function so that it prints in the order of the start array. #include int length_start=0; readin(char *pool, char **start) int i=0, j=0; char |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec18.ps, 19961111
HKUST 1 Computer Science comp 102 Lecture 18 Topics Introduction to Arrays HKUST 2 Computer Science comp 102 Lecture 18 Array Types A sequence or list of variables of the same type An array type is a structured data type representing a regular structure of components of the same type. Syntax |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/sol7.ps, 19961111
COMP 251 1996-97 Fall Semester Assignment #7 solution Problem 1. (60%) Adapted from Exercise 7.11 in Sethi, page 297. Put the main program in file ree1.cc", and the class definitions in ree1.h" The expression tree shown below has three kinds of nodes: (1) leaves with an integer value, (2) unary |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/A4Lect12.ps, 19961111
Introduction to Software Engineering COMP211 (Fall 1996) User Interface Design 1 User Interface Design Introduction to Software Engineering COMP211 (Fall 1996) User Interface Design 2 User Interface Design Requirements analysis specifies where user interface will be UI design specifies what interfaces |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/Lect12.ps, 19961111
Introduction to Software Engineering COMP211 (Fall 1996) User Interface Design 1 User Interface Design Introduction to Software Engineering COMP211 (Fall 1996) User Interface Design 2 User Interface Design Requirements analysis specifies where user interface will be UI design specifies what interfaces |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec18.ps, 19961111
Lecture 18: NP-Completeness ffl Are there problems solvable in principle for which no efficient algorithms exist ffl Assuming N <> NP. ffl Suppose there is a language L in NP that has the following property: L 2 P implies L0 2 P for any L0 2 NP. ffl Said to be NP-Complete, L must not be in P . ffl In |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/lec17.ps, 19961111
Lecture 17: Computational Complexity Introduction Q1:What problems are solvable (in principle) by computers and what problems are not Q2: What problems are solvable (in practice) by computers and what problems are not Solvability in principle does not necessarily mean solvability in practice. 1 Lecture |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/sol6.ps, 19961111
COMP 251 1996-97 Fall Semester Assignment #6 Solution Since the program listing is so long and it is hard to just list parts of the code. Therefore, I put the code in the directory louis=comp251=hw6. For PG student, please access the directory with your UG account. The code is taken from the submission |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect31.ps, 19961112
COMP 361 NETWORK LAYER 9 Flooding Each arriving packet is retransmitted on every outgoing link except for the link that it arrived from It creates many duplicate packets. When a packet has been routed for more than a predefined number of hops (e.g., the shortest path, the network diameter), the packet |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect33.ps, 19961112
COMP 361 NETWORK LAYER 25 Internetworking Requirements Any internetworking facility must provide: 1.Link between networks. At minimum, a physical and link control connection 2.Routing and delivery of data between processes on different networks 3.An accounting service that keeps track of network and |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/sol5.ps, 19961112
COMP 251 1996-97 Fall Semester Assignment #5 Suggested Solutions Problem 1. 15% Explain the differences between the concept of abstract specifications and that of information hiding. Why do you think the truly abstract specifications are hard to achieve Answer Abstract specifications specify the |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect31.ps, 19961112
COMP 361 NETWORK LAYER 9 Flooding Each arriving packet is retransmitted on every outgoing link except for the link that it arrived from It creates many duplicate packets. When a packet has been routed for more than a predefined number of hops (e.g., the shortest path, the network diameter), the packet |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec19.ps, 19961112
HKUST 1 Computer Science comp 102 Lecture 19 Topics Arrays as arguments Searching Linear Search HKUST 2 Computer Science comp 102 Lecture 19 Arrays as Arguments Pass individual elements (indexed variable) of an array to a function Example: int main() int A = |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect33.ps, 19961112
COMP 361 NETWORK LAYER 25 Internetworking Requirements Any internetworking facility must provide: 1.Link between networks. At minimum, a physical and link control connection 2.Routing and delivery of data between processes on different networks 3.An accounting service that keeps track of network and |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect32.ps, 19961112
COMP 361 NETWORK LAYER 17 Congestion When packets arrive at a rate faster than the node can process them or faster than the packets can be cleared from output buffers, then eventually packets will arr ive for which no memory is available If this situation happens: - Discard any incoming packet for which |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect32.ps, 19961112
COMP 361 NETWORK LAYER 17 Congestion When packets arrive at a rate faster than the node can process them or faster than the packets can be cleared from output buffers, then eventually packets will arrive for which no memory is available If this situation happens: - Discard any incoming packet for which |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture2/5.UI-design1pp.ps, 19961113
COMP 211 5-1 User Interface Design USER INTERFACE DESIGN n requirements analysis specifies where user interface will be n UI design specifies what interfaces will look like from the users point of view n parallel development l analysis phase UI definition l design phase UI design l |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture2/5.UI-design2pp.ps, 19961113
COMP 211 5-1 User Interface Design USER INTERFACE DESIGN n requirements analysis specifies where user interface will be n UI design specifies what interfaces will look like from the users point of view n parallel development l analysis phase UI definition l design phase UI design l |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture30.ps, 19961113
(COMP251 LECTURE 30) 1 Overview OOP in Scheme: boxes; stacks; evaluating postfix expressions using a stack. (COMP251 LECTURE 30) 2 OOP in Scheme One implementation of the ideas of OOP in Scheme is to represent classes by higher-order functions (functions that take other functions as arguments). Example |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture29.ps, 19961113
(COMP251 LECTURE 29) 1 Overview Pointer representation of pairs. Mutators. Garbage collection. Case Expression. Apply. OOP in Scheme. (COMP251 LECTURE 29) 2 Pointer Representation of Pairs Sec.11.3 of S&F A pair (first . rest) is normally implemented as a pointer to a cell with two fields: 3 4 5 3 4 car |
| ftp://ftp.cs.ust.hk/pub/bli/252/class21.ps, 19961114
COMP 252 -- Fall 1996 (Dr. Bo Li) Class 21( Secondary Storage Management) 1 SECONDARY STORAGE MANAGEMENT COMP 252 -- Fall 1996 (Dr. Bo Li) Class 21( Secondary Storage Management) 2 Why Secondary Storage Programs executed by the system should ideally be resident permanently in main memory Main memory is |
| ftp://ftp.cs.ust.hk/pub/horner/09_awk.ps, 19961114
1 AWK Awk is a pattern scanning and processing language written at Bell Labs as part of UNIX in the 70 s by Al Aho, Peter Weinburger and Brian Kernighan It is most useful for producing reports and filtering text. It takes many of its constructs from C, and has historical roots in SNOBOL Awk is an |
| ftp://ftp.cs.ust.hk/pub/beat/hwk3Hints.ps, 19961115
COMP 104 Page 12 #include // solution to hwk3 class equity public: struct date date day; float value; eq_node *next; }; char name; eq_node *first; class |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/solution6.ps, 19961115
COMP272 Tutorial on Homework3 date: 15/11/96 notes prepared by YAN, Li P212: 4.1.3 (q0; aaabbbaa) `M (q2; aaabbbaa) `M (q1; ababbbaa) `M (q2; ababbbaa) `M (q1; abbbbbaa) `M (q2; abbbbbaa) `M (q3; abbabbaa) `M (q4; abbabbaa) `M (q4; abbabbaa) `M (q4; abbabbaa) `M (q2; abbabbaa) `M (q1; abbabbab) `M (q2; |
| ftp://ftp.cs.ust.hk/pub/comp211/Quizzes/quiz2.F96.solution1pp.ps, 19961115
COMP 211 1/5 Department of Computer Science COMP 211: Introduction to Software Engineering Quiz 2 November 8, 1996 Value: 15% of course mark Time: 50 minutes Total marks: 100 1. Circle the best answer in each question. Each correct answer is worth 2.5 points. Each incorrect answer will result in a |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/sol8.ps, 19961115
COMP 251 1996-97 Fall Semester Assignment #8 Date assigned: Monday, Nov 4, 1996 Due time: 12:00pm on Monday, Nov 11, 1996 Marking Scheme: Correctness 80%, Style 10%, Documentation 10% prepared by flin@cs.ust.hk, flai@cs.ust.hk Style and comments concerns the readability of your program. If we deduct |
| ftp://ftp.cs.ust.hk/pub/comp211/Quizzes/quiz2.F96.solution2pp.ps, 19961115
COMP 211 1/5 Department of Computer Science COMP 211: Introduction to Software Engineering Quiz 2 November 8, 1996 Value: 15% of course mark Time: 50 minutes Total marks: 100 1. Circle the best answer in each question. Each correct answer is worth 2.5 points. Each incorrect answer will result in a |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture31.ps, 19961118
(COMP251 LECTURE 31) 1 Overview This is the last lecture on Scheme. It's about writing Scheme interpreter in Scheme. The main reference material for this lecture is Sec. 13.6 and 13.7 in Sethi. (COMP251 LECTURE 31) 2 Association Lists An association list, or simply a-list, is a list of pairs. Examples: |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/gray-prolog.ps, 19961119
Using Quintus Prolog|The Basics Notes by James W. Gray, III Last modified: October 22, 1995 This document gives some very basic information on using Quintus Prolog, release 3, at HKUST. 1. Getting Access (Instructions for Faculty): There are a limited number of licenses for Quintus Prolog. Currently, we |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/f96/set4.ps.gz, 19961119
Hong Kong University of Science and Technology COMP327/527: Pattern Recognition Fall 1996 Problem Set 4 (5%) Assigned: 21/11/96 Due: 5/12/96 Policy Issues 1. Your submission will be collected in class on the due date. Late submission will not be accepted. 2. Only five problems with highest marks will be |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/set4.ps.gz, 19961119
Hong Kong University of Science and Technology COMP327/527: Pattern Recognition Fall 1996 Problem Set 4 (5%) Assigned: 21/11/96 Due: 5/12/96 Policy Issues 1. Your submission will be collected in class on the due date. Late submission will not be accepted. 2. Only five problems with highest marks will be |
| ftp://ftp.cs.ust.hk/pub/wongkk/mmm96.ps.Z, 19961119
THE ROLES AND VIEWS OF MULTIMEDIA OBJECTS R.K. WONG, H.L. CHAU, F.H. LOCHOVSKY Department of Computer Science, University of Science and Technology, Clear Water Bay, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/bli/252/Class22b.ps, 19961119
COMP 252 -- Fall 94 (Dr. Bo Li) Class 22b (File Systems) 1 FILE SYSTEMS COMP 252 -- Fall 94 (Dr. Bo Li) Class 22b (File Systems) 2 What is a File A file is a collection of related information defined by its creator Files may be free-form, such as text files, or may be formatted rigidly Files can be of |
| ftp://ftp.cs.ust.hk/pub/wongkk/tools96.ps.Z, 19961119
DOOR: A Dynamic Object-Oriented Data Model with Roles Raymond K. Wong H. Lewis Chau Frederick H. Lochovsky Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/wongkk/multimedia.ps.Z, 19961119
THE ROLES AND VIEWS OF MULTIMEDIA OBJECTS R.K. WONG, H.L. CHAU, F.H. LOCHOVSKY Department of Computer Science, University of Science and Technology, Clear Water Bay, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/bli/252/Class22a.ps, 19961119
COMP 252 -- Fall 1996 (Dr. Bo Li) Class 22a (Secondary Storage Management) 23 Disk Formatting Physical formatting involves breaking the disk into sectors on each track that the head can address Each sector has the sector number and space for an error correcting code (ECC) The ECC is updated every time |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/kdd-95.ps.gz, 19961120
6 Bayesian Classification (AutoClass): Theory and Results Peter Cheeseman RIACS John Stutz NASA |
| ftp://ftp.cs.ust.hk/pub/bli/252/Project3.ps, 19961120
Department of Computer Science The Hong Kong University of Science and Technology COMP 252 Fall 1996 Project 3 1 COMP 252 - Principles of Systems Software Project 3 Date: November 20, 1996 Due: December 7, 1996 In this assignment, you are to implement the module DEVICES of OSP. In module DEVICES you |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp327+527/f96/kdd-95.ps.gz, 19961120
6 Bayesian Classification (AutoClass): Theory and Results Peter Cheeseman RIACS John Stutz NASA |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture32.ps, 19961120
(COMP251 LECTURE 32) 1 Plan 1. Introduction to LP. 2. Prolog basics. 3. Control in Prolog. 4. Programming techniques in Prolog. (COMP251 LECTURE 32) 2 Main References ffl Sethi, Chapter 11, pages 425-473. ffl W.F. Clocksin and C.S. Mellish. Programming in Prolog. Library open reserve. ffl James W. Gray, |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/hw/hw3.ps, 19961121
COMP 102 (Fall 96) 1 HONG KONG UNIVERSITY OF SCIENCE & TECHNOLOGY COMP 102: Computer Fundamentals & Programming (Section 1) Fall Semester, 1996 HOMEWORK ASSIGNMENT #3: PATH FINDER Due on November 29th, 1996 before 5:00pm Problem Description: A graph is defined as a set of nodes and edges. A node is an |
| ftp://ftp.cs.ust.hk/pub/bli/252/class23.ps, 19961121
COMP 252 -- Fall 94 (Dr. Bo Li) Class 23 (File Systems) 23 Consistency Semantics This is an important criterion for systems that support sharing of files It specifies the rules and regulations under which multiple users access a shared file It specifies when the modifications of data in a file by one |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect37.ps, 19961122
COMP 361 TRANSPORT LAYER 1 TRANSPORT LAYER COMP 361 TRANSPORT LAYER 2 Transport Layer The transport layer should provide reliable end-to-end transfer of data independent of the underlying communication system It should provide end-to-end error and flow control Transport Entity Transport Entity Interface |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect37.ps, 19961122
COMP 361 TRANSPORT LAYER 1 TRANSPORT LAYER COMP 361 TRANSPORT LAYER 2 Transport Layer The transport layer should provide reliable end-to-end transfer of data independent of the underlying communication system It should provide end-to-end error and flow control Transpor t Entity Transpor t Entity |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture33.ps, 19961122
(COMP251 LECTURE 33) 1 Prolog Syntax Illustrated flight(X,Z) :- direct_flight(X,Y), flight(Y,Z). direct_flight(hongkong, tokyo). clauses (facts) clauses (rules) atoms relations, predicates, functors variables clauses are ended with period "." All but clauses and separators are terms! (COMP251 LECTURE |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec21.ps, 19961124
HKUST 1 Computer Science comp 102 Lecture 21 Topics Example of 2-dimensional Arrays Operations on Strings Strings as Parameters HKUST 2 Computer Science comp 102 Lecture 21 Example // A grade entering program #include int main () const students = 100; int midterm = 0; int final = 1; double |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture34.ps, 19961125
(COMP251 LECTURE 34) 1 Overview This lecture talks about how to process lists in Prolog. It shows you how to write some non-trivial Prolog programs before we go into details of how Prolog interpreter works, and how to control it. (COMP251 LECTURE 34) 2 List Structures ffl In Prolog lists are provided as |
| ftp://ftp.cs.ust.hk/pub/william/cheung.cvpr97.ps.gz, 19961126
Robust Deformable Matching for Character Extraction Kwok-Wai Cheung Dit-Yan Yeung Roland T. Chin Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Hong Kong fwilliam, dyyeung, rolandg@cs.ust.hk Keywords: Document Image Analysis, Off-line Handwriting |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/uai96/lec14.ps, 19961126
Partially Observable Markov Decision Processes and Planning in Stochastic Domains Nevin Lianwen Zhang HKUST AI&Stats Meeting July 7, 1996 References: 1. M. L. Littman, TR CS-96-09, Brown U. 2. A. R. Cassandra, L. P. Kaelbling, J. A. Kurien, TR CS- 96-17, Brown U. 1 Outline ffl POMDPs ffl Belief states |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp560/vod.fm.ps, 19961126
Multimedia applications over ATM COMP 560 Jelena Misic 1 Video-on-Demand This section covers: Introduction VOD Network Architecture Advantages in Using ATM (and alternative schemes reviewed) Access Networ k Ser vice Gateway/Service Operations Center Introduction Television - a widespread communication |
| ftp://ftp.cs.ust.hk/pub/bli/252/class24a.ps, 19961126
COMP 252 -- Fall 96 (Dr. Bo Li) Class 24a (File Systems) 51 Indexed Allocation To allow for large files, we can use Linked scheme: Multilevel index: COMP 252 -- Fall 96 (Dr. Bo Li) Class 24a (File Systems) 52 Indexed Allocation Combined Scheme: Figure 11.7 Page 395 -- The UNIX Inode COMP 252 -- Fall 96 |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec22.ps, 19961127
HKUST 1 Computer Science comp 102 Lecture 22 Topics Sorting an array HKUST 2 Computer Science comp 102 Lecture 22 Sorting It is one of the most widely used programming tasks. Given a list of values, the objective is to sort from lowest to highest or from highest to lowest. The values of the list could |
| ftp://ftp.cs.ust.hk/pub/conferences/TANC97/cfp1.ps, 19961127
Preliminary Call for Papers TANC-97 Hong Kong International Workshop on Theoretical Aspects of Neural Computation: A Multidisciplinary Perspective May 26-28, 1997 Hong Kong University of Science and Technology Over the past decade or so, neural computation has emerged as a research area with active |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture35.ps, 19961127
(COMP251 LECTURE 35) 1 Overview How does Prolog interpreter work Unification and substitutions (this lecture). Prolog search trees (next lecture). (COMP251 LECTURE 35) 2 Substitutions and Unification ffl Unification is central to Prolog: How do we match a query with a given fact How do we match a query |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec20.ps, 19961127
HKUST 1 Computer Science comp 102 Lecture 20 Topics Strings 2-dimensional Arrays HKUST 2 Computer Science comp 102 Lecture 20 Strings A string variable is an array of characters. We have seen many values of string before enclosed between double quotes. "Hello" "This output is
" A string variable is |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/solution5.ps, 19961128
3.5.2 a) Let L = {ap: p is a prime}. Theorem a): L is not CF. Proof: Suppose L is CFL. Then there exist grammar G = (V, S, R, S). Let K be the con- stant in the CFL Pumping Lemma. Set w = aq where q is a prime > K. Then the Pumping Lemma says there exist uvxyz with w = uvxyz, |vy| > 0 and for all n>0, |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect39.ps, 19961128
COMP 361 SESSION/PRESENTATION LAYER 1 SESSION LAYER COMP 361 SESSION/PRESENTATION LAYER 2 Why Session Layer The lower layers (physical, data link, network, and transport) of the OSI model are concerned with providing reliable and efficient end-to-end communications The upper layers are mainly concerned |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect39.ps, 19961128
COMP 361 SESSION/PRESENTATION LAYER 1 SESSION LAYER COMP 361 SESSION/PRESENTATION LAYER 2 Why Session Layer The lower layers (physical, data link, network, and transport) of the OSI model are concerned with providing reliable and efficient end-to-end communications The upper layers are mainly concerned |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect41.ps, 19961128
COMP 361 HIGH SPEED NETWORKING 1 HIGH SPEED NETWORKING COMP 361 HIGH SPEED NETWORKING 2 High Speed Networks Traditionally computer networks were mainly designed to carry data The rapid developments in computer technology has made it feasible to implement powerful computers supporting compute intensive |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect41.ps, 19961128
COMP 361 HIGH SPEED NETWORKING 1 HIGH SPEED NETWORKING COMP 361 HIGH SPEED NETWORKING 2 High Speed Networks Traditionally computer networks were mainly designed to carry data The rapid developments in computer technology has made it feasible to implement powerful computers supporting compute intensive |
| ftp://ftp.cs.ust.hk/pub/bli/252/class25.ps, 19961128
COMP 252 -- Fall 1996 (Dr. Bo Li) Class 25 (Protection and Security) 1 PROTECTION AND SECURITY COMP 252 -- Fall 1996 (Dr. Bo Li) Class 25 (Protection and Security) 2 Why Protection Protection refers to a mechanism for controlling access of programs, processes or users to the resources defined by a |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/A4Lect40.ps, 19961128
COMP 361 APPLICATION LAYER 1 APPLICATION LAYER COMP 361 APPLICATION LAYER 2 Application Layer The application layer provides access to the networking environment for the users and also provides distributed information services These services are frequently used by the users, and do not need to be |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/Lect40.ps, 19961128
COMP 361 APPLICATION LAYER 1 APPLICATION LAYER COMP 361 APPLICATION LAYER 2 Application Layer The application layer provides access to the networking environment for the users and also provides distributed information services These services are frequently used by the users, and do not need to be |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture36.ps, 19961129
(COMP251 LECTURE 36) 1 Overview How does Prolog interpreter work Unification and substitutions (last lecture). Prolog search trees (this lecture). (COMP251 LECTURE 36) 2 Prolog Search Trees A Prolog search tree is conditioned on the following two inputs: 1. A Prolog program, which is a sequence of |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/exam2-sol.ps, 19961129
COMP 251 1996-97 Fall Semester Exam #2 Friday, Nov 15, 1996 Suggested Solutions Important. ffl Please take a look at the problems now, and ask for clarifications if you don't understand them. After the first 30 minutes, no clarifications will be given. ffl Spend your times wisely, and try to solve every |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/sol11.ps, 19961130
COMP 251 1996-97 Fall Semester Assignment #11 Date assigned: Monday, Dec 2, 1996 Suggested solution will be out on Monday, Dec 9, 1996 Given that this is the last week of class, this assignment will be optional. However, doing it will help you prepare for the final exam on questions relating to Prolog. |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec23.ps, 19961201
HKUST 1 Computer Science comp 102 Lecture 23 Topics Input and output Open and closing files Read and writing with files HKUST 2 Computer Science comp 102 Lecture 23 Streams A stream is a flow of characters (or other kind of data). If the flow is out of your program, the stream is called an output |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture37.ps, 19961202
(COMP251 LECTURE 37) 1 Prolog Search Trees (Review) ffl To appreciate Prolog search trees (procedural interpretation of Prolog programs), it helps to understand first the logical meaning of Prolog programs and queries. ffl A Prolog program is like a logical theory, and a query is like a goal to prove |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture2/6.quality-assurance2pp.ps, 19961202
COMP 211 6-1 Software Quality QUALITY ASSURANCE Quality assurance consists of those procedures, techniques, and tools applied by professionals to ensure that a product meets or exceeds pre-specified standards during a product s development cycle. E.H. Bersoff, 1984. n principles of Quality |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture2/6.quality-assurance1pp.ps, 19961202
COMP 211 6-1 Software Quality QUALITY ASSURANCE Quality assurance consists of those procedures, techniques, and tools applied by professionals to ensure that a product meets or exceeds pre-specified standards during a product s development cycle. E.H. Bersoff, 1984. n principles of Quality |
| ftp://ftp.cs.ust.hk/pub/bli/252/class26.ps, 19961203
COMP 252 -- Fall 1996 (Dr. Bo Li) class 26 (Distributed System) 1 DISTRIBUTED SYSTEMS COMP 252 -- Fall 1996 (Dr. Bo Li) class 26 (Distributed System) 2 What are Distributed Systems A distributed system is a collection of loosely coupled processors interconnected by a communication network The processors |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp560/traffic.fm.ps, 19961203
Traffic and congestion control in ATM networks COMP 560 Jelena Misic 1 Traffic and congestion control in ATM networks This section covers: Introduction Basic ATM traffic control functions Traffic parameter specification Traffic contract specification Granularity of traffic contract parameters Bound on |
| ftp://ftp.cs.ust.hk/pub/ahmad/comp102/lectures/lec24.ps, 19961204
HKUST 1 Computer Science comp 102 Lecture 24 Topics Character input and output End-of-file function Predefined character functions HKUST 2 Computer Science comp 102 Lecture 24 Character I/O All data is input and output as character data. When your program outputs the number 10, it is actually character |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture38.ps, 19961204
(COMP251 LECTURE 38) 1 Cuts (Motivation) ffl We need to limit the size of search spaces to do any useful computation without running out of memory. ffl This can be done to a certain degree using clause and goal ordering. ffl However, often the problem is with backtracking which a lot of time is |
| ftp://ftp.cs.ust.hk/pub/comp211/Quizzes/final-exam.outline.ps, 19961204
COMP 211 Final Exam COMP 211 Final Exam, Fall 1996 3 hours; 110 points possible (out of 100) 1. Multiple choice 2. Agree, disagree, justify 3. Data flow diagram 4. Process logic 5. Data description 6. Structure chart 7. Testing 8. Project-related |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/A4Lect13.ps, 19961204
Introduction to Software Engineering COMP211 (Fall 1996) User Interface Design 1 Quality Assurance And Testing Introduction to Software Engineering COMP211 (Fall 1996) User Interface Design 2 Quality Assurance Quality assurance consists of those procedures, techniques, and tools applied by professionals |
| ftp://ftp.cs.ust.hk/pub/comp211/Lecture1/Lect13.ps, 19961204
Introduction to Software Engineering COMP211 (Fall 1996) User Interface Design 1 Quality Assurance And Testing Introduction to Software Engineering COMP211 (Fall 1996) User Interface Design 2 Quality Assurance Quality assurance consists of those procedures, techniques, and tools applied by professionals |
| ftp://ftp.cs.ust.hk/pub/muppala/comp361/sol-midterm.ps, 19961204
Department of Computer Science The Hong Kong University of Science and Technology COMP 361 (Fall 1996) Midterm Examination 1 COMP 361 Computer Communication Networks Fall Semester 1996 Midterm Examination Date: October 23, 1996 Time: 09:00 - 09:50 Instructions: 1. This examination paper consists of 7 |
| ftp://ftp.cs.ust.hk/pub/comp211/Project/Demo.schedule.ps, 19961205
COMP 211 1/2 Department of Computer Science COMP 211: Introduction to Software Engineering Task 4: Prototype Demo Schedule Friday, December 6, 1996 Prof. Fred Lochovsky Dr. Kamal Karlapalem Group# Date Time Platform Programming Lang 1 39 6/12 10:00am Unix CGI 2 23 6/12 10:15am Unix Java 3 15 6/12 |
| ftp://ftp.cs.ust.hk/pub/flin/comp251/lecture39.ps, 19961206
(COMP251 LECTURE 39) 1 Overview A Prolog program is a sequence of clauses. In many ways, it is a knowledge base consisting of facts and rules. In this lecture, we finish Prolog with an example which shows how to manipulate this knowledge base. (COMP251 LECTURE 39) 2 Assert and Retract These are special |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/solution7.ps, 19961206
COMP272 Homework7 date: 6/12/96 notes prepared by YAN, Li P359: 7.1.1.(a) If L is regular, LR is also regular. Let M be a DFA that accepts wR2LR. Construct TM that decides w2L from M as follows: ffl While M is ready to start to scan its input wR from left to right, TM moves one step to the left, then |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-37.ps.gz, 19961211
Probabilistic Inference in Influence Diagrams Nevin L. Zhang Technical Report HKUST-CS96-37 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/wongkk/slide1.ps.Z, 19961213
THE ROLES AND VIEWS OF MULTIMEDIA OBJECTS Raymond K. Wong H. Lewis Chau Frederick H. Lochovsky Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong Outline of the Presentation ffl Problems to be addressed. ffl Introduction to roles and views. ffl |
| ftp://ftp.cs.ust.hk/pub/wongkk/slide2.ps.Z, 19961213
The DOOR Group at HKUST 1 Object Evolution with Roles Raymond K. Wong Hong Kong University of Science & Technology http://www.cs.ust.hk/~wongkk ftp: ftp.cs.ust.hk:/pub/wongkk email: wongkk@cs.ust.hk The DOOR Group at HKUST 2 Outline of the Presentation l Problems l Solution: Roles l The design of DOOR, |
| ftp://ftp.cs.ust.hk/pub/wongkk/ics-camera.ps, 19961216
DOOR = `Object with Roles' + `Schema Evolution' Raymond K. Wong H. Lewis Chau Frederick H. Lochovsky Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong Email: fwongkk,lewis,fredg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/wongkk/ics96.ps.Z, 19961216
DOOR = `Object with Roles' + `Schema Evolution' Raymond K. Wong H. Lewis Chau Frederick H. Lochovsky Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong Email: fwongkk,lewis,fredg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/comp211/Quizzes/final.F96.solution2pp.ps, 19961217
COMP 211 1/10 Department of Computer Science COMP 211: Introduction to Software Engineering Final Exam December 14, 1996 Time: 3 hours 1. Circle the best answer in each question. Each correct answer is worth 1 point. Each incorrect answer will result in a deduction of .5 point. (A) A programmer who |
| ftp://ftp.cs.ust.hk/pub/conferences/TANC97/cfp.ps, 19961217
Call for Papers TANC-97 Hong Kong International Workshop on Theoretical Aspects of Neural Computation: A Multidisciplinary Perspective May 26-28, 1997 Hong Kong University of Science and Technology Over the past decade or so, neural computation has emerged as a research area with active involvement by |
| ftp://ftp.cs.ust.hk/pub/comp211/Quizzes/final.F96.solution1pp.ps, 19961217
COMP 211 1/10 Department of Computer Science COMP 211: Introduction to Software Engineering Final Exam December 14, 1996 Time: 3 hours 1. Circle the best answer in each question. Each correct answer is worth 1 point. Each incorrect answer will result in a deduction of .5 point. (A) A programmer who |
| ftp://ftp.cs.ust.hk/pub/wongkk/slide3.ps, 19961217
DOOR = `Objects with Roles' + `Schema Evolution' Raymond K. Wong H. Lewis Chau Frederick H. Lochovsky Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong Outline of the Presentation ffl Problems to be addressed. ffl Introduction to roles. ffl Schema |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-38.ps.gz, 19961218
1 A 3-Dimensional Perspective on Integrated Management of Rules and Objects1 Dickson K.W. Chiu Qing Li Technical Report HKUST-CS96-38 Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong E-mail: {kwchiu, qing}@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/wongkk/icde97.ps.Z, 19970106
A Data Model and Semantics of Objects with Dynamic Roles Raymond K. Wong1 H. Lewis Chau1 Frederick H. Lochovsky Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Hong Kong fwongkk,lewis,fredg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/yeung.cpol96.ps.gz, 19970107
COMPUTER PROCESSING OF ORIENTAL LANGUAGES VOL.10, NO.3. 1996 307 A Heuristic Search Approach to Chinese Glyph Generation Using Hierarchical Character Composition PAK KEUNG LAI*, DIT YAN YEUNG, and MAN CHI PONG** Department of Computer Science Hong Kong University of Science and Technology Clear Water |
| ftp://ftp.cs.ust.hk/pub/william/cheung.iwfhr96.ps.gz, 19970110
Recognition of Handwritten Digits Using Deformable Models Kwok-Wai CHEUNG, Dit-Yan YEUNG, Roland T. CHIN The Hong Kong University of Science and Technology Clear Water Bay, Hong Kong E-mail: fwilliam,dyyeung,rolandg@cs.ust.hk Deformable models are used to recognize handwritten characters which have a |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-31v2.ps.gz, 19970110
Planning in Stochastic Domains: Problem Characteristics and Approximations (Version II) Nevin L. Zhang and Wenju Liu Technical Report HKUST-CS96-31 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/scc/apsec.ps.gz, 19970116
Call for Papers Joint 1997 Asia Pacific Software Engineering Conference and International Computer Science Conference December 2-5, 1997 Hong Kong WHAT ARE APSEC AND ICSC The Asia Pacific Software Engineering Conference (APSEC) is a major annual international software engineering conference in the Asia |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-15.ps.gz, 19970116
A Delay Scheduling Strategy for Dynamic Load Balancing Schedulers Chi-Chung Hui & Samuel T. Chanson Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/ahmad/papers/parcom.ps, 19970116
-1- Express versus PVM: A Performance Comparison Ishfaq Ahmad1 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong Email: iahmad@cs.ust.hk, Phone: (852) 2358-6980, FAX: (852) 2358-1477 |
| ftp://ftp.cs.ust.hk/pub/ahmad/papers/astar-icpp97.ps, 19970120
- 1 - Parallel Algorithms for Optimal Scheduling of Arbitrary Task Graphs to Multiprocessors Yu-Kwong Kwok1, Ishfaq Ahmad, Muhammad Kafil, and Imtiaz Ahmad* Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong *Department of Electrical and |
| ftp://ftp.cs.ust.hk/pub/johnl/schedule.ps.gz, 19970124
Bandwidth Scheduling of Prerecorded VBR Video Sources for ATM Networks John Lauderdale, Danny H. K. Tsang feelauder,eetsangg@ee.ust.hk Department of Electrical and Electronic Engineering Hong Kong University of Science and Technology Clearwater Bay Road, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/johnl/visual96.ps.gz, 19970124
1 An Improved Algorithm for Lossless Smoothing of MPEG Video with Delay Constraints John Lauderdale, Danny H.K. Tsang, George Baciu Hong Kong University of Science and Technology, Clear Water Bay Rd. Kowloon, Hong Kong E-mails: eelauder@ee.ust.hk eetsang@ee.ust.hk gbaciu@cs.ust.hk Supported by Hongkong |
| ftp://ftp.cs.ust.hk/pub/johnl/server_icc.ps.Z, 19970124
A New Technique for Transmission of Pre-Encoded MPEG VBR Video Using CBR Service John Lauderdale and Danny H. K. Tsang eelauder@ee.ust.hk eetsang@ee.ust.hk Department of Electrical and Electronic Engineering The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/johnl/server.ps.gz, 19970124
A New Technique for Transmission of Pre-Encoded MPEG VBR Video Using CBR Service John Lauderdale and Danny H. K. Tsang eelauder@ee.ust.hk eetsang@ee.ust.hk Department of Electrical and Electronic Engineering The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/johnl/thesis.ps.gz, 19970124
Variable Bit Rate Video Transmission over ATM Networks A thesis submitted to The Hong Kong University of Science and Technology in partial fulfillment of the requirements for the Degree of Master of Philosophy in Electrical and Electronic Engineering by JOHN LAUDERDALE Department of Electrical and |
| ftp://ftp.cs.ust.hk/pub/johnl/main.ps.Z, 19970124
Variable Bit Rate Video Transmission over ATM Networks A thesis submitted to The Hong Kong University of Science and Technology in partial fulfillment of the requirements for the Degree of Master of Philosophy in Electrical and Electronic Engineering by JOHN LAUDERDALE Department of Electrical and |
| ftp://ftp.cs.ust.hk/pub/johnl/laud96b.ps.gz, 19970124
A New Technique for Transmission of Pre-Encoded MPEG VBR Video Using CBR Service John Lauderdale and Danny H. K. Tsang eelauder@ee.ust.hk eetsang@ee.ust.hk Department of Electrical and Electronic Engineering The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/johnl/thesis_present.ps.gz, 19970124
The Hong Kong University of Science & Technology P.1 Department of Electrical & Electronic Engineering VBR video transmission over ATM networks John Lauderdale, MPhil. Thesis Presentation Department of Electrical & Electronic Engineering The Hong Kong University of Science & Technology, Clear Water Bay, |
| ftp://ftp.cs.ust.hk/pub/johnl/smooth.ps.gz, 19970124
An Improved Algorithm for Lossless Smoothing of MPEG Video with Delay Constraints John Lauderdale, Danny H. K. Tsang feelauder,eetsangg@ee.ust.hk Department of Electrical and Electronic Engineering George Baciu gbaciu@cs.ust.hk Department of Computer Science Hong Kong University of Science and |
| ftp://ftp.cs.ust.hk/pub/johnl/schedule_summary.ps.gz, 19970124
Bandwidth Scheduling of Prerecorded VBR Video Sources for ATM Networks John Lauderdale, Danny H. K. Tsang feelauder,eetsangg@ee.ust.hk Department of Electrical and Electronic Engineering Hong Kong University of Science and Technology Clearwater Bay Road, Kowloon, Hong Kong Extended Abstract 1 |
| ftp://ftp.cs.ust.hk/pub/muppala/comp351/lect2.ps, 19970124
COMP 351/651A INTRODUCTION 9 Performance Evaluation Techniques Measurement Model-based Simulation Trace-driven Discrete-event Analytical Modeling State spaceNon state Markov chains Stochastic Petri nets Product form queueing networks Reliability block diagrams Fault trees basedspace based COMP 351/651A |
| ftp://ftp.cs.ust.hk/pub/muppala/comp351/lect1.ps, 19970124
COMP 351/651A INTRODUCTION 1 COMP 351/651A PERFORMANCE EVALUATION OF COMPUTER SYSTEMS Jogesh K. Muppala muppala@cs.ust.hk COMP 351/651A INTRODUCTION 2 INTRODUCTION I keep six honest serving men. They taught me all I knew. Their names are What and Why and When and How and Where and Who. - Rudyard Kipling |
| ftp://ftp.cs.ust.hk/pub/johnl/ieice.ps.gz, 19970124
IEICE TRANS. COMMUNICATIONS, VOL. E00{A, NO. 1 JANUARY 1996 1 PAPER Special Issue on Multimedia on Demand Using the Minimum Reservation Rate for Transmission of Pre-Encoded MPEG VBR Video Using CBR Service John LAUDERDALEy and Danny H.K. TSANGy, Nonmembers SUMMARY This paper presents the system issues |
| ftp://ftp.cs.ust.hk/pub/muppala/comp351/A4lect2.ps, 19970124
COMP 351/651A INTRODUCTION 9 Performance Evaluation Techniques Measurement Model-based Simulation Trace-driven Discrete-event Analytical Modeling State spaceNon state Markov chains Stochastic Petri nets Product form queueing networks Reliability block diagrams Fault trees basedspace based COMP 351/651A |
| ftp://ftp.cs.ust.hk/pub/johnl/mrr.ps.gz, 19970124
The Minimum Reservation Rate Problem for the Transmission of MPEG VBR Video John Lauderdale, Danny H.K. Tsang feelauder,eetsangg@ee.ust.hk Department of Electrical and Electronic Engineering Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong Rev. 2 February 21 1996 |
| ftp://ftp.cs.ust.hk/pub/johnl/itel_final.ps.gz, 19970124
Internet Telephony: Technology, Trends, and Opportunities John Lauderdale Cyberspace Center, Computer Science Dept. The Hong Kong University of Science and Technology Clearwater Bay, Kowloon, HONG KONG Phone: (852) 2358 8765 Fax: 2358 8777 email: JohnL@cs.ust.hk Final Revision, 19 August 1996. Appears |
| ftp://ftp.cs.ust.hk/pub/muppala/comp351/A4lect1.ps, 19970124
COMP 351/651A INTRODUCTION 1 COMP 351/651A PERFORMANCE EVALUATION OF COMPUTER SYSTEMS Jogesh K. Muppala muppala@cs.ust.hk COMP 351/651A INTRODUCTION 2 INTRODUCTION I keep six honest serving men. They taught me all I knew. Their names are What and Why and When and How and Where and Who. - Rudyard Kipling |
| ftp://ftp.cs.ust.hk/pub/johnl/ATM_workshop_present.ps.gz, 19970124
The Hong Kong University of Science & Technology P.1 Department of Electrical & Electronic Engineering Bandwidth Scheduling of Pre-encoded VBR video sources for ATM Networks John Lauderdale, Danny H.K. Tsang {eelauder,eetsang}@ee.ust.hk Department of Electrical & Electronic Engineering The Hong Kong |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s97/topic-a1.ps.gz, 19970125
COMP221: Fundamentals of Artificial Intelligence Topic A1: Introduction Dit-Yan Yeung & Nevin L. Zhang Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk, lzhang@cs.ust.hk Spring 1997 COMP221 Introduction Artificial Intelligence ffl The term Artificial |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp252/INTRO.fm.ps, 19970126
COMP 252 (Spring 1997) Introduction 1 COMP 252 PRINCIPLES OF SYSTEMS SOFTWARE FALL 1995 COMP 252 (Spring 1997) Introduction 2 Course Outline 1.Introduction 1.1.Definitions 1.2.History of Operating Systems 1.3.Computer System Structures 1.4.Operating System Structures 2.Process Management 2.1.Processes |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp252/Intro.fm.ps, 19970126
COMP 252 (Spring 1997) Introduction 1 COMP 252 PRINCIPLES OF SYSTEMS SOFTWARE FALL 1995 COMP 252 (Spring 1997) Introduction 2 Course Outline 1.Introduction 1.1.Definitions 1.2.History of Operating Systems 1.3.Computer System Structures 1.4.Operating System Structures 2.Process Management 2.1.Processes |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s97/topic-b2.ps.gz, 19970127
COMP221: Fundamentals of Artificial Intelligence Topic B2: Game Playing Dit-Yan Yeung & Nevin L. Zhang Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk, lzhang@cs.ust.hk Spring 1997 COMP221 Game Playing Games as Search Problems ffl Mainly two-player games |
| ftp://ftp.cs.ust.hk/pub/beat/Trans537/t3.fm.ps.gz, 19970127
COMP337/537 HKUST Spring 97 1 BW 5. Learning Prop Rules and Decision Trees Outlook Temp(F) Humidity(%) Windy Class sunny 75 70 true play sunny 80 90 true don t play sunny 85 85 false dont play sunny 72 95 false don t play sunny 69 70 false play overcast 72 90 true play overcast 83 78 false play overcast |
| ftp://ftp.cs.ust.hk/pub/beat/Trans537/info-97.fm.ps, 19970127
HKUST Computer Science Comp 337/537 Knowledge Discovery in Databases Spring Semester, 1997 Course Information Instructor Dr. Beat Wuthrich, room 3518, email: beat@cs.ust.hk, tf: 2358 7013 Objective This course is designed to introduce both undergraduate and postgraduate students into the field and |
| ftp://ftp.cs.ust.hk/pub/beat/Trans537/t5a.fm.ps.gz, 19970127
COMP337/537 HKUST Spring 97 1 BW 3. Uncertainty 3.1 Foundations of Probability Theory An algebraic structure (A, and, or), where A is a set of elements and and and or are binar y infix operations, is a lattice if the following holds. - both operations are idempotent, - commutative, - associative, and - |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s97/courseinfo.ps.gz, 19970127
Hong Kong University of Science and Technology COMP300M: Introduction to Pattern Recognition Summer 1996 Instructor Dit-Yan Yeung, Rm 3541, 2358-6977, dyyeung@cs.ust.hk, http://www.cs.ust.hk/~dyyeung/ Office hours: Tuesday 10:00am{12:00noon (or by appointment) Class Schedule Lecture: Tuesday & Wednesday |
| ftp://ftp.cs.ust.hk/pub/muppala/comp351/tut1.ps, 19970127
Chapter 2 Basic Probability 2.1 What is Probability Let S be the sample space, the set of all possible outcomes of an experiment. Let E be the event that includes all the outcomes of interest (E S). We define P (E) as the probability measure such that, <= P (E) <= 1 P (S) = 1 P (;) = 2.2 Probability |
| ftp://ftp.cs.ust.hk/pub/flin/comp535/intro.ps, 19970127
COMP 535/300P Knowledge Representation and Reasoning 1996-1997 Spring Semester Lectures: Tuesday and Thursday 10:30-11:50am Instructor: Fangzhen Lin (flin@cs) Room 3552, telephone 2358-6975 Office hours: Thursday 2-4pm or by appointment TA: Kam Fai Chan (kchan@cs) Room 4204, telephone |
| ftp://ftp.cs.ust.hk/pub/beat/Trans537/t2.fm.ps.gz, 19970127
COMP337/537 HKUST Spring 97 1 BW 2. Rule Languages 2.1 Propositional Rules and Decision Trees has_cancer = true <-- smoker = true, bad_habits = true bad_habits = true <-- vegetarian = false, bad_habits = true <-- drinks_alc = true Person has_cancer smoker vegetarian drinks_alc a no yes yes no b yes yes |
| ftp://ftp.cs.ust.hk/pub/beat/Trans537/t5b.fm.ps.gz, 19970127
COMP337/537 HKUST Spring 97 1 BW 3.3 Probabilistic Datalog Rules are not always completely accurate. has_cancer(x) <-- person(x),smoker(x) has_cancer(x) <-- person(x), not does_sport(x) has_cancer(x) <-- person(x), ancestor(y,x), has_cancer(y) Two sources of uncer tainty: factual uncer tainty rule |
| ftp://ftp.cs.ust.hk/pub/beat/Trans537/t1.fm.ps.gz, 19970127
COMP337/537 HKUST Spring 97 1 BW Knowledge Discovery in Databases Beat W thrich email: beat@cs.ust.hk tf: 2358 7013 fax: 2358 1477 room 3518 1.2 Basic Notions 1.3 Motivation 2.1 Propositional Rules and Decision Trees COMP337/537 HKUST Spring 97 2 BW 1.2 Basic Notions What is knowledge discovery and why |
| ftp://ftp.cs.ust.hk/pub/beat/Trans537/t6.fm.ps.gz, 19970127
COMP337/537 HKUST Spring97 1 B.W. 7. Learning Probabilistic Knowledge Generate comp(X) <-- int(X), pro(X) comp(X) <-- int(X), sol(X), app(X) comp(X) <-- int(X),pro(X),inn(X),rep(X) from training examples EX = |
| ftp://ftp.cs.ust.hk/pub/beat/Trans537/t4.fm.ps.gz, 19970127
COMP337/537 HKUST Spring 97 1 BW 6. Learning Datalog Rules Inductive Logic Programming, or learn SQL views (not using aggregation functions). parent female male sibling a1 a2 a2 a1 a2 a3 a1 a3 a4 a3 a3 a2 a4 a2 ... ... ... a4 a3 How can we discover the family relationships mother, father, brother, |
| ftp://ftp.cs.ust.hk/pub/flin/comp535/lect1.ps, 19970128
(COMP535 LECT 1) 1 Artificial Intelligence (AI) What is AI (COMP535 LECT 1) 2 AI and Knowledge Representation (KR) Much of AI involves building systems that are knowledge-based: ffl language understanding, planning, diagnosis, "expert systems", ... Some, to a certain extent ffl game-playing, vision,... |
| ftp://ftp.cs.ust.hk/pub/muppala/comp351/lect3.ps, 19970130
COMP 351/651A MEASUREMENT TECHNIQUES AND TOOLS 1 MEASUREMENT TECHNIQUES AND TOOLS COMP 351/651A MEASUREMENT TECHNIQUES AND TOOLS 2 Questions in Measurement Measurement involves monitoring the system while it is being subjected to a particular workload 1. What are the different types of workloads 2. |
| ftp://ftp.cs.ust.hk/pub/muppala/comp351/A4lect3.ps, 19970130
COMP 351/651A MEASUREMENT TECHNIQUES AND TOOLS 1 MEASUREMENT TECHNIQUES AND TOOLS COMP 351/651A MEASUREMENT TECHNIQUES AND TOOLS 2 Questions in Measurement Measurement involves monitoring the system while it is being subjected to a particular workload 1. What are the different types of workloads 2. |
| ftp://ftp.cs.ust.hk/pub/flin/comp535/lect2.ps, 19970130
(COMP535 LECT 2) 1 Overview Propositional logic: language, semantics, entailment. 3 queens problem. (COMP535 LECT 2) 2 Language The language (syntax) of a logic describes how to form sentences. This is like the syntax of a programming language. E.g. the syntax of C says that ++x is a legal expression, |
| ftp://ftp.cs.ust.hk/pub/lzhang/jair96.ps.Z, 19970131
Journal of Artificial Intelligence Research 5 (1996) 301-328 Submitted 4/96; published 12/96 Exploiting Causal Independence in Bayesian Network Inference Nevin Lianwen Zhang LZHANG@CS.UST.HK Department of Computer Science, University of Science & Technology, Hong Kong David Poole POOLE@CS.UBC.CA |
| ftp://ftp.cs.ust.hk/pub/bli/comp361/Physical.ps, 19970202
COMP 361 (SPRING 1997) DATA COMMUNICATIONS 1 PHYSICAL LAYER Data communications Transmission media Data encoding Physical layer interface Multiplexing/Switching techniques COMP 361 (SPRING 1997) DATA COMMUNICATIONS 2 Data Transmission Data transmission from a sender to a receiver requires the use of a |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp252/Process-sched.fm.ps, 19970204
COMP 252 (Spring 1997)) Processes and Process Scheduling 1 PROCESSES AND PROCESS SCHEDULING COMP 252 (Spring 1997)) Processes and Process Scheduling 2 Process Concepts A process is a program in execution A process is an active entity, with a program counter specifying the next instruction to execute A |
| ftp://ftp.cs.ust.hk/pub/muppala/comp351/A4lect5.ps, 19970204
COMP 351/651A MEASUREMENT TECHNIQUES AND TOOLS 17 Monitor Comparison Criterion Hardware Monitor Software Monitor Domain Difficult to monitor OS events Difficult to monitor hardware events Input rate ~105 per second possible Limited by the processor MIPS and overhead Time resolution 10 ns possible 10-16 |
| ftp://ftp.cs.ust.hk/pub/muppala/comp351/lect5.ps, 19970204
COMP 351/651A MEASUREMENT TECHNIQUES AND TOOLS 17 Monitor Comparison Criterion Hardware Monitor Software Monitor Domain Difficult to monitor OS events Difficult to monitor hardware events Input rate ~105 per second possible Limited by the processor MIPS and overhead Time resolution 10 ns possible 10-16 |
| ftp://ftp.cs.ust.hk/pub/muppala/comp351/A4lect4.ps, 19970204
COMP 351/651A MEASUREMENT TECHNIQUES AND TOOLS 9 Workload Selection The four major considerations in selecting the workload are the services exercised by the workload, the level of detail, representativeness, and timeliness Services exercised: The requests at the service-interface level of the SUT |
| ftp://ftp.cs.ust.hk/pub/bli/comp361/Introduction.ps, 19970204
COMP 361 (SPRING 1997) INTRODUCTION 1 INTRODUCTION Elements of computer networks Layered Approach The OSI Reference Model Layers in TCP/IP Architecture COMP 361 (SPRING 1997) INTRODUCTION 2 Goals of Networking Information and data exchange: - Remote login - Access to remote databases - Multimedia |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s97/topic-b1.ps.gz, 19970204
COMP221: Fundamentals of Artificial Intelligence Topic B1: Problem Solving as Search Dit-Yan Yeung & Nevin L. Zhang Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk, lzhang@cs.ust.hk Spring 1997 COMP221 Problem Solving as Search Problem-Solving Agents ffl |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp252/PROCESS-sched.fm.ps, 19970204
COMP 252 (Spring 1997)) Processes and Process Scheduling 1 PROCESSES AND PROCESS SCHEDULING COMP 252 (Spring 1997)) Processes and Process Scheduling 2 Process Concepts A process is a program in execution A process is an active entity, with a program counter specifying the next instruction to execute A |
| ftp://ftp.cs.ust.hk/pub/muppala/comp351/lect4.ps, 19970204
COMP 351/651A MEASUREMENT TECHNIQUES AND TOOLS 9 Workload Selection The four major considerations in selecting the workload are the services exercised by the workload, the level of detail, representativeness, and timeliness Services exercised: The requests at the service-interface level of the SUT |
| ftp://ftp.cs.ust.hk/pub/flin/comp535/lect3.ps, 19970204
(COMP535 LECT 3) 1 Overview Propositional logic II: circuit design, 2 and 3 queens problems, inference procedures, clausal representation of sentences, resolution and proof by refutation. (COMP535 LECT 3) 2 An Aside: Switching Circuits A B C D AND AND NOT OR AND Figure 1: Circuit for ((A ^ B)) ^ D _ ((A |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp252/forkexample1.ps, 19970211
UNIX fork() and other System Calls fork() is the only way to create a new process in UNIX. It creates an exact duplicate of the original process, including all the file descriptors, registers and everthing else. All the variables (in the two processes) have identical values at the same time of the |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp252/forkexample2.ps, 19970211
File Table and UNIX fork() Process table entry is a table stored in the ker- nel for every process in UNIX. It hold informa- tion on all the file descriptors the process cur- rently holds and pointers to the file tables of all these descriptors. File tables, in turn, hold information on the opened |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp252/Process-coord.fm.ps, 19970218
COMP 252 (Spring 1997) Process Coordination 1 PROCESS COORDINATION COMP 252 (Spring 1997) Process Coordination 2 Cooperating Processes A process is considered independent if it cannot affect or be affected by other procesess in the system Otherwise the process is considered a cooperating process Why do |
| ftp://ftp.cs.ust.hk/pub/flin/comp535/lect6.ps, 19970218
(COMP535 LECT 6) 1 Knowledge Engineering KB is first and foremost about knowlegde: ffl meaning and entailment. ffl find individuals and properties, then encode facts sufficient for entailments. Before implementing, need to understand clearly: ffl what is to be computed ffl why and where inference is |
| ftp://ftp.cs.ust.hk/pub/techreport/97/tr97-1.ps.gz, 19970218
1 Checking and Correcting Safety Properties using Compositional Reachability Analysis Shing Chi Cheung Jeff Kramer Department of Computer Science Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong Department of Computing Imperial College of Science, Technology and Medicine, |
| ftp://ftp.cs.ust.hk/pub/flin/comp535/lect7.ps, 19970220
(COMP535 LECT 7) 1 An Incomplete Reasoning System Inference rules: see handout. Plus the following one for equality: t = s; Derivation: given a set of premises , a sequence of formula ff1; :::; ffn is a proof of ff iff: ffl ffn = ff. ffl for each 1 <= i <= n, either ffi 2 or there |
| ftp://ftp.cs.ust.hk/pub/flin/comp535/lect8.ps, 19970225
(COMP535 LECT 8) 1 Answer Predicate: Motivating Example KB: P lus(zero; x; x); P lus(x; y; z) oe P lus(succ(x); y; succ(z)) Q: 9uP lus(2; 3; u) where for readability, we use for zero, 2 for succ(succ(zero)), etc. |
| ftp://ftp.cs.ust.hk/pub/flin/comp535/lect9.ps, 19970227
(COMP535 LECT 9) 1 Horn Clauses Recall that a clause is a set of literals. A Horn clause is one with at most one positive literal. Examples: , . Non-examples: . Generally, a Horn clause with exactly one positive literal has the form: |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/sol2.ps, 19970228
1000110S 1 10 100 1000 10001 100011 1 1 1 1 1 1,0 1 1 Problem 1. Problem 2(a) even a's even b's even a's odd b's odd a's even b's odd a's odd b's b b a a b b a a Problem 2(b) S a aa aaa b bb b bb a aa aab a a a a a b b a,b b a b b b b a b b a a a,b |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/97221/dc1.ps, 19970303
COMP221: Fundamentals of Artificial Intelligence Topic C1: Knowledge Representation and Reasoning/Detailed notes Dit-Yan Yeung & Nevin L. Zhang Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk, lzhang@cs.ust.hk Spring 1997 COMP221 Knowledge Representation |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp252/Threads.fm.ps, 19970305
COMP 252 (Spring 1997) Threads 1 THREADS JUSTIFICATION AND MOTIVATION Problems with the classical process model: - many applications require several more or less independent tasks running concurrently, yet sharing a common address space and other resources. For instance, a database server may listen for |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/sol3.ps, 19970306
2.4.5 a) Let L = L(M), M= {S, K, d, s, F}. Let M be a DFA such that, M = {S, K, d, s, F } where q F iff there exists a path in M from q to some state in F. Given w, w Pref(L) iff w is a prefix of some string s L. Thus w Pref(L) iff w is a prefix of s and s has a path leading from the initial state in M |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/97221/dc2.ps, 19970306
COMP221: Fundamentals of Artificial Intelligence Topic C2: Inference in FOL (I) Dit-Yan Yeung & Nevin L. Zhang Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk, lzhang@cs.ust.hk Spring 1997 COMP221 Inference in FOL (I) Inference in FOL We shall study this |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp252/Deadlock.fm.ps, 19970309
COMP 252 (Spring 1997)) Deadlock 1 DEADLOCK COMP 252 (Spring 1997)) Deadlock 2 What is a Deadlock A process is said to be in a state of deadlock if it is waiting for an event that will never occur A system in which one or more processes are deadlocked, is said to be in deadlock In a multiprogramming |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/97221/dc3.ps, 19970311
COMP221: Fundamentals of Artificial Intelligence Topic C2: Inference in FOL (II) Dit-Yan Yeung & Nevin L. Zhang Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk, lzhang@cs.ust.hk Spring 1997 COMP221 Inference in FOL (II) Inference in KBs with variables The |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/97221/pset2.ps, 19970313
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1997 Problem Set 2: Knowledge representation and reasoning Due: 5pm, 24 March 1997, to the instructors There are five questions in this problem set. Each question is worth 1 final grade point. |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp252/Memory.fm.ps, 19970318
COMP 252 (Spring 1997) Memory Management 1 MEMORY MANAGEMENT COMP 252 (Spring 1997) Memory Management 2 Why Memory Management Through CPU scheduling and multiprogramming, we are able to improve the CPU utilization and the response time To achieve this, we have several active processes simultaneously |
| ftp://ftp.cs.ust.hk/pub/flin/papers/ordergelfond.ps.Z, 19970323
An Ordering on Subgoals for Planning Fangzhen Lin Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong fl@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/flin/comp535/midterm.ps, 19970403
COMP 300P/535 1996-97 Spring Semester Midterm Examination March 18, 1997 Suggested solutions for some of the problems Problem 1 (20%). Given the three predicates: P (x) (x is a person), T (x) (x is an instance of time), and F (x; y) (you can fool x at time y), represent the following English statements |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp252/Virtual.fm.ps, 19970406
COMP 252 (Spring 1997) Virtual Memory 1 VIRTUAL MEMORY COMP 252 (Spring 1997) Virtual Memory 2 What is Virtual Memory So far we assumed that for a process to run, it must be completely resident in memory Virtual memory is a technique that allows the execution of processes that are not completely |
| ftp://ftp.cs.ust.hk/pub/beat/Trans537/t8.ps.gz, 19970409
COMP337/537 HKUST Spring 97 1 BW Regression Analysis regression analysis deals with numbers only it is a widely used technique Problem 1: when a softdrink company increases its advertisments, it expects that this outlay will increase sales. Determine this relationship. Problem 2: in a study of |
| ftp://ftp.cs.ust.hk/pub/beat/Trans537/t9.ps.gz, 19970409
COMP337/537 HKUST Spring 97 1 BW Regression Analysis of Time Data Cross-sectional data are gathered on many individuals at the same point in time. Time-series data are gathered on a single individual (person, firm, etc) over a fixed sequence of time periods such as days, weeks, months, etc. firm1, 1989, |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp252/Secondary.fm.ps, 19970415
COMP 252 (Spring 1997) Secondar y Storage Management 1 SECONDARY STORAGE MANAGEMENT COMP 252 (Spring 1997) Secondary Storage Management 2 Why Secondary Storage Programs executed by the system should ideally be resident permanently in main memory Main memory is too small to accommodate all needed |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s97/pset3.ps.gz, 19970415
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1997 Problem Set 3: Probabilistic Reasoning Due: 29 April 1997 There are five questions in this problem set. Each is worth one final grade point. You will be graded on the four questions that you |
| ftp://ftp.cs.ust.hk/pub/bli/comp361/Network2.ps, 19970415
COMP 361 (SPRING 1997) NETWORK LAYER 33 Routing With Bridges Bridges have to use routing, which can be either fixed or adaptive An adaptive bridge connects two or more LANs, forwarding frames from one to another. It uses source addresses to learn which machines lie on which LAN segment, and it combines |
| ftp://ftp.cs.ust.hk/pub/bli/comp361/Transport.ps, 19970417
COMP 361 (SPRING 1997) TRANSPORT LAYER 1 TRANSPORT LAYER Transport services - reliable sequencing network service - reliable nonsequencing network service - unreliable network service TCP UDP COMP 361 (SPRING 1997) TRANSPORT LAYER 2 Transport Layer The transport layer should provide reliable end-to-end |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s97/e1.ps.gz, 19970419
COMP221: Fundamentals of Artificial Intelligence Topic E1: Machine Learning Dit-Yan Yeung & Nevin L. Zhang Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk, lzhang@cs.ust.hk Spring 1997 COMP221 Machine Learning Learning Agents ffl Agents that can learn from |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s97/topic-e1.ps.gz, 19970419
COMP221: Fundamentals of Artificial Intelligence Topic E1: Machine Learning Dit-Yan Yeung & Nevin L. Zhang Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk, lzhang@cs.ust.hk Spring 1997 COMP221 Machine Learning Learning Agents ffl Agents that can learn from |
| ftp://ftp.cs.ust.hk/pub/gbaciu/vtri/paper/paper.ps, 19970420
1 The Virtual Trackball-Ruler Interface George Baciu Computer Science Department The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong E-mail: gbaciu@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/97221/d3.ps, 19970421
COMP221: Fundamentals of Artificial Intelligence Topic D3: Decision Networks Dit-Yan Yeung & Nevin L. Zhang Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk, lzhang@cs.ust.hk Spring 1997 COMP221 Decision Networks Decision Networks Decision networks: the |
| ftp://ftp.cs.ust.hk/pub/flin/comp535/lect19.ps, 19970422
(COMP535 LECT 19) 1 Abductive reasoning So far: have concentrated on reasoning that is primarily deductive: ffl given KB, is ff entailed ffl given KB, for what x is ff(x) entailed Now consider a new type of question: Given KB, and an ff that I do not believe ffl what would be sufficient to make me |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp252/Filesystems.fm.ps, 19970422
COMP 252 (Spring 1997) File Systems 1 FILE SYSTEMS COMP 252 (Spring 1997) File Systems 2 What is a File A file is a collection of related information defined by its creator Files may be free-form, such as text files, or may be formatted rigidly Files can be of several types and have a defined structure |
| ftp://ftp.cs.ust.hk/pub/bli/comp361/hw4.ps, 19970422
COMP361 (Spring 1997) Homework #4 1 Due Date May 7, 1997 (Wednesday) 1. The current routing table of node 1 in the following network is shown in the figure below. The network uses a distributed adaptive routing algorithm similar to the ARPANET routing algorithm. Node 1 periodically receives the delay |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/sol6.ps, 19970422
b) Let L = {ann: n >= 0}. Theorem b): L is not CF. Proof: Suppose L is CFL. Then there exist grammar G = (V, S, R, S). Let K be the con- stant in the CFL Pumping Lemma. Set w = aq, where |w| > K and q = n2 for some n >= 0. Then the Pumping Lemma says there exist uvxyz with w = uvxyz, |vy| > 0 and for |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s97/e3.ps.gz, 19970423
COMP221: Fundamentals of Artificial Intelligence Topic E3: Perceptrons Dit-Yan Yeung & Nevin L. Zhang Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk, lzhang@cs.ust.hk Spring 1997 COMP221 Perceptrons Biological Neurons AxonCell body or |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s97/topic-e2.ps.gz, 19970423
COMP221: Fundamentals of Artificial Intelligence Topic E2: Decision Trees Dit-Yan Yeung & Nevin L. Zhang Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk, lzhang@cs.ust.hk Spring 1997 COMP221 Decision Trees Decision Trees as Performance Elements ffl Simple |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s97/topic-e3.ps.gz, 19970423
COMP221: Fundamentals of Artificial Intelligence Topic E3: Perceptrons Dit-Yan Yeung & Nevin L. Zhang Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk, lzhang@cs.ust.hk Spring 1997 COMP221 Perceptrons Biological Neurons AxonCell body or |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s97/e2.ps.gz, 19970423
COMP221: Fundamentals of Artificial Intelligence Topic E2: Decision Trees Dit-Yan Yeung & Nevin L. Zhang Department of Computer Science Hong Kong University of Science and Technology dyyeung@cs.ust.hk, lzhang@cs.ust.hk Spring 1997 COMP221 Decision Trees Decision Trees as Performance Elements ffl Simple |
| ftp://ftp.cs.ust.hk/pub/flin/comp535/lect20.ps, 19970424
(COMP535 LECT 20) 1 Reasoning About Actions A B C B C A Consider the blocks world: Initially block A is on B, B is on C, and C is on the table. A robot can perform: pick up a block, putdown a block she's holding either on the table or on top of another block. Can the robot achieve the goal of having B |
| ftp://ftp.cs.ust.hk/pub/bli/comp361/Session.ps, 19970425
COMP 361 (SPRING 1997) HIGH LEVEL LAYERS 1 SESSION LAYER Relative THIN layer Introduction Session (connection) management Structuring data transfer Synchronization and recovery COMP 361 (SPRING 1997) HIGH LEVEL LAYERS 2 Why Session Layer The lower layers (physical, data link, network, and transport) of |
| ftp://ftp.cs.ust.hk/pub/flin/papers/ijcai97.ps.Z, 19970425
Applications of the Situation Calculus To Formalizing Control and Strategic Information: The Prolog Cut Operator Fangzhen Lin (flin@cs.ust.hk) Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/bli/comp361/Presentation.ps, 19970428
COMP 361 (SPRING 1997) HIGH LEVEL LAYERS 9 PRESENTATION LAYER Issues in presentation layer ASN.1 Data compression technique COMP 361 (SPRING 1997) HIGH LEVEL LAYERS 10 Why Presentation Layer A fundamental question: - suppose we could copy (completely reliably) from one computer s memory to another |
| ftp://ftp.cs.ust.hk/pub/flin/comp535/lect21.ps, 19970429
(COMP535 LECT 21) 1 Indirect Effects For stack(x; y): Poss(stack(x; y); s) oe H(handEmpty; do(stack(x; y); s)); Poss(stack(x; y); s) oe :H(holding(x); do(stack(x; y); s)); Poss(stack(x; y); s) oe :H(clear(y); do(stack(x; y); s)); Poss(stack(x; y); s) oe H(clear(x); do(stack(x; y); s)): For pickup(x; y): |
| ftp://ftp.cs.ust.hk/pub/dyyeung/course/comp221/s97/pset4.ps.gz, 19970430
Hong Kong University of Science and Technology COMP221: Fundamentals of Artificial Intelligence Spring 1997 Problem Set 4: Machine Learning Due: 10 May 1997, 12noon, to the instructors There are three questions in this problem set. Each is worth one final grade point. You will be graded on the two |
| ftp://ftp.cs.ust.hk/pub/dyyeung/paper/workshop.ps.gz, 19970501
Robust Deformable Matching for Character Extraction Kwok-Wai Cheung Dit-Yan Yeung Roland T. Chin Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Hong Kong fwilliam, dyyeung, rolandg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/william/workshop.ps.gz, 19970501
Robust Deformable Matching for Character Extraction Kwok-Wai Cheung Dit-Yan Yeung Roland T. Chin Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Hong Kong fwilliam, dyyeung, rolandg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/flin/comp535/lect22.ps, 19970501
(COMP535 LECT 22) 1 Successor State Axioms - Example Consider the fluent clear: ffl Positive effect axioms: Poss(stack(x; y); s) oe H(clear(x); do(stack(x; y); s)); Poss(pickup(x; y); s) oe H(clear(y); do(pickup(x; y); s)); Poss(putdown(x); s) oe H(clear(x); do(putdown(x); s)): Rewrite it into a single |
| ftp://ftp.cs.ust.hk/pub/lzhang/uai97liu.ps.gz, 19970503
Region-Based Approximations for Planning in Stochastic Domains Nevin L. Zhang and Wenju Liu Department of Computer Science Hong Kong University of Science and Technology flzhang, wliug@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/flin/comp535/lect23.ps, 19970506
(COMP535 LECT 23) 1 Temporal Explanations One-step temporal explanation: given an observation OE(do(A; S0)) about the situation resulting from doing A in S0, find a formula about S0 to explain this observation. ffl There are many approaches to this problem, none of them are entirely satisfactory. ffl |
| ftp://ftp.cs.ust.hk/pub/bli/comp361/Highspeed.ps, 19970507
COMP 361 (SPRING 1997) HIGH SPEED NETWORKING 1 HIGH SPEED NETWORKING What happens when we go faster! Implications Integrated services ATM basics - cell format - cell switching (VPI/VCI) COMP 361 (SPRING 1997) HIGH SPEED NETWORKING 2 Is Gbps really fast It is not multi-terabit (Tbps --> 1012 bps) |
| ftp://ftp.cs.ust.hk/pub/scc/tosem95.ps.gz, 19970508
1 Checking and Correcting Safety Properties using Compositional Reachability Analysis1 Shing Chi Cheung Jeff Kramer Department of Computer Science Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong Department of Computing Imperial College of Science, Technology and Medicine, |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp252/Distributed.fm.ps, 19970509
COMP 252 (Spring 1997) Distributed Systems 1 DISTRIBUTED SYSTEMS COMP 252 (Spring 1997) Distributed Systems 2 What are Distributed Systems A distributed system is a collection of loosely coupled processors interconnected by a communication network The processors do not share memory or a clock. Each |
| ftp://ftp.cs.ust.hk/pub/jmisic/final97training.fm.ps, 19970509
Dept. of Computer Science The Hong Kong University of Science and Technology Fall 1995 COMP 252 Final Exam 1 COMP 252 - TRAINING PROBLEMS. 1. What are the advantages of using a linked allocation of disk blocks, versus a contiguous allocation, for a large file What are the disadvantages 2. Consider a |
| ftp://ftp.cs.ust.hk/pub/jmisic/comp252/final97training.fm.ps, 19970509
Dept. of Computer Science The Hong Kong University of Science and Technology Fall 1995 COMP 252 Final Exam 1 COMP 252 - TRAINING PROBLEMS. 1. What are the advantages of using a linked allocation of disk blocks, versus a contiguous allocation, for a large file What are the disadvantages 2. Consider a |
| ftp://ftp.cs.ust.hk/pub/techreport/97/tr97-3.ps.gz, 19970512
The Role Players and Owners in DOOR Raymond K. Wongy, H. Lewis Chau , and Frederick H. Lochovsky Technical Report HKUST-CS97-03 May 1997 Department of Computer Science The Hong Kong University of Science & Technology Clear Water Bay, Kowloon, Hong Kong y School of MPCE Computing Macquarie University |
| ftp://ftp.cs.ust.hk/pub/ipe/FAQ.ps, 19970518
Ipe Frequently Asked Questions Otfried Schwarzkopf Ipe is a drawing editor for creating figures for inclusion into LaTeX documents. This document tries to answer some common questions by Ipe users. I add an entry to this file whenever I answer a question, so the collection of questions is rather |
| ftp://ftp.cs.ust.hk/pub/ipe/iums.ps, 19970518
Ipe User Macros Otfried Schwarzkopf Here is a little library of Ipe extensions or Ipe user macros that have been written by myself or other Ipe users, and that you are welcome to share. These Ipe user macros or Iums are distributed as sources, and all use a commonMaster Makefile. Most of them|certainly |
| ftp://ftp.cs.ust.hk/pub/beat/ijisafm.ps.gz, 19970520
Discovering Probabilistic Decision Rules Beat W uthrich The Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong e-mail: beat@cs.ust.hk phone: (852) 2358 7013 fax: (852) 2358 1477 1 |
| ftp://ftp.cs.ust.hk/pub/lzhang/uai97zhang.ps.gz, 19970523
Fast Value Iteration for Goal-Directed Markov Decision Processes Nevin L. Zhang and Weihong Zhang Department of Computer Science Hong Kong University of Science & Technology flzhang, wzhangg@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/conferences/TANC97/final-pgm.ps, 19970523
TANC-97 - 1 - Hong Kong TANC-97 Hong Kong International Workshop on Theoretical Aspects of Neural Computation: A Multidisciplinary Perspective May 26-28, 1997 Hong Kong University of Science and Technology TANC-97 Secretariat Department of Physics Hong Kong University of Science and Technology Clear |
| ftp://ftp.cs.ust.hk/pub/lzhang/uai97yan.ps.gz, 19970523
Independence of Causal Influence and Clique Tree Propagation Nevin Lianwen Zhang and Li Yan Department of Computer Science, Hong Kong University of Science & Technology flzhang, yanlig@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/csricky/A4/casch-icpp97.ps.gz, 19970527
|
| ftp://ftp.cs.ust.hk/pub/csricky/dalloc-compsac97-camera.ps.gz, 19970527
|
| ftp://ftp.cs.ust.hk/pub/csricky/A4/dalloc-compsac97.ps.gz, 19970527
|
| ftp://ftp.cs.ust.hk/pub/csricky/casch-icpp97-camera.ps.gz, 19970527
|
| ftp://ftp.cs.ust.hk/pub/csricky/casch-europar97-camera.ps.gz, 19970527
A Graphical Tool for Automatic Parallelization and Scheduling of Programs on Multiprocessors Yu-Kwong Kwok1, Ishfaq Ahmad1, Min-You Wu2 and Wei Shu2 1Department of Computer Science, The Hong Kong University of Science and Technology, Hong Kong 2Department of Computer Science, State University of New |
| ftp://ftp.cs.ust.hk/pub/csricky/A4/casch-europar97.ps.gz, 19970527
A Graphical Tool for Automatic Parallelization and Scheduling of Programs on Multiprocessors Yu-Kwong Kwok1, Ishfaq Ahmad1, Min-You Wu2 and Wei Shu2 1Department of Computer Science, The Hong Kong University of Science and Technology, Hong Kong 2Department of Computer Science, State University of New |
| ftp://ftp.cs.ust.hk/pub/bli/comp361/final_sol.ps, 19970527
May 21 (Wednesday) 1 COMP 361 Spring 1997 Final Exam Solution 1. Truth and False Questions : Answer: 1) A reliable transport service can be provided over a T unreliable network service 2) The session layer can group the data together to be T transmitted over the same session (connection) 3) |
| ftp://ftp.cs.ust.hk/pub/techreport/94/tem.ps, 19970528
Knowledge Discovery in Databases Beat W uthrich The Hong Kong University of Science and Technology Clear Water Bay Kowloon, Hong Kong e-mail: beat@cs.ust.hk phone: (852) 358 7013 fax: (852) 358 1477 May 11, 1994 |
| ftp://ftp.cs.ust.hk/pub/csricky/CPFD-hpc97-camera.ps.gz, 19970604
A Comparison of Task-Duplication-Based Algorithms for Scheduling Parallel Programs to Message-Passing Systems Ishfaq Ahmad and Yu-Kwong Kwok Department of Computer Science The Hong Kong University of Science and Technology, Hong Kong Email: {iahmad, csricky}@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/csricky/A4/cpfd-hpc97.ps.gz, 19970604
A Comparison of Task-Duplication-Based Algorithms for Scheduling Parallel Programs to Message-Passing Systems Ishfaq Ahmad and Yu-Kwong Kwok Department of Computer Science The Hong Kong University of Science and Technology, Hong Kong Email: {iahmad, csricky}@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lec8.ps, 19970606
COMP 104 Page 1 Topic 8 : streams n offers: get and put to read individual characters; end of file test eof; end of line eoln; the newline sign
; alarm sign a . n offers: ifstream infile; ofstream outfile, infile.open(), outfile.open(), infile.fail(), outfile.fail(), |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lab8.ps, 19970606
HKUST Computer Science Comp104: Computer Fundamentals & Programming Fall Semester, 1996 Lab of week 12 (your TA will demonstrate you a model solution at the end of the lab section) Write a function called merge_list that takes two call-by-reference arguments that are pointer variables that point to the |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lab7.ps, 19970606
HKUST Computer Science Comp104: Computer Fundamentals & Programming Fall Semester, 1997 Lab of week 11 (your TA will demonstrate you a model solution at the end of the lab section) Write a recursive function that has argument that is an array of characters and two arguments that are bounds on array |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lec5.ps, 19970606
COMP 104 Page 1 Topic 5 : loops and scope of variables count_star = 0; while (count_star < n) { cout << * ; count_star++; for (count_star = 0; count_star < n; count_star++) cout << * ; count_star = 1; do{ cout << * ; count_star++; } while (count_star < n); COMP 104 Page 2 while statement #include |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lab5.ps, 19970606
HKUST Computer Science Comp104: Computer Fundamentals & Programming Fall Semester, 1996 Lab of week 8 (your TA will demonstrate you a model solution at the end of the lab section) Another approach to sorting an array is to create an index array, where the index is an array whose element values represent |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lab4.ps, 19970606
HKUST Computer Science Comp104: Computer Fundamentals & Programming Fall Semester, 1997 Lab of week 5 (your TA will demonstrate you a model solution at the end of the lab section) Write a program to read in a string of characters that represent a Roman numeral and then convert it to Arabic form (an |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lab6.ps, 19970606
HKUST Computer Science Comp104: Computer Fundamentals & Programming Fall Semester, 1997 Lab of week 9 (your TA will demonstrate you a model solution at the end of the lab section) Define a class or a type called counterType. An object of this type is used to count things, so it records a count that is a |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lec6.ps, 19970606
COMP 104 Page 1 Topic 6 : Parameters #include void main () { void enter(int&, int&); void swap (int&, int&); void print(int, int); int n1, n2; enter(n1, n2); swap(n1,n2); print(n1,n2); void enter(int& x, int& y) { cout << endl << Enter two numbers> ; cin >> x >> y; } void swap (int& i, int& |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lec7.ps, 19970606
COMP 104 Page 1 Topic 7 : miscellaneous n From we get INT_MAX, INT_MIN, LONG_MAX, SHRT_MAX, n From we get tolower(c), isdigit(c), isspace(c), isupper(c), ... n Complements: next == A || next == a next != A && next != a n % m == 0 && flag n % m || !flag n Suppose x is float, i is |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lec3.ps, 19970606
COMP 104 Page 1 Topic 3 : functions n functions are subprograms used for stepwise refinement n functions must be defined outside other functions, hence prototypes needed. // File: drawFig.cc; #include void main () { // declarations of function prototypes void draw_circle (); void |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lec4.ps, 19970606
COMP 104 Page 1 Topic 4 : logical expressions, if and switch n logical operators: <, <=, >, >=, ==, != n logical connectives: &&, ||, ! n Note that zero means FALSE and nonzero means TRUE (salary < min_salary) || (number_dependents > 5); (temperature > 90.0) && (humidity > 90.0); !(x == y); !((salary < |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lec15.ps, 19970606
COMP 104 Page 1 Topic 15 : friend functions and inheritance int global_counter = 0; class account public: friend int equal(account, account); account(); double get_amount(); private: double amount; int number; account::account() { amount=0; number = global_counter; global_counter++; } double |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lec12.ps, 19970606
COMP 104 Page 1 Topic 12 :recursion n A procedure or function is said to be recursive if it calls itself. function rec_fun() rec_fun(); function rec_fun(int n) if (n = 0) return ...; else rec_fun(n-1); COMP 104 Page 2 void write_vertical(int x) if (x < 10) cout << x << endl; else write_vertical(x/10); |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lab3.ps, 19970606
HKUST Computer Science Comp104: Computer Fundamentals & Programming Fall Semester, 1997 Lab of week 4 (your TA will demonstrate you a model solution at the end of the lab session) Write a program to gauge the rate of inflation for the past year. The program asks for the price of an item (such as a |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lec2.ps, 19970606
COMP 104 Page 1 Topic 2 : basics n variables are of type float, int, char, short int, long int, double, long double n constants: const n I/O: cin and cout n #include n reserved words such as return and special symbols such as ; n identifiers n assignment statements, expressions & operators |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lec14.ps, 19970606
COMP 104 Page 1 Topic 14 : dynamic data structure n Dynamic data structures grow and shrink while running the program. n Dynamic data structures are manipulated via pointers, and operators new and delete. n p = new float; a new variable of type float is created to which p now points. With new created |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lab2.ps, 19970606
HKUST Computer Science Comp104: Computer Fundamentals & Programming Fall Semester, 1997 Lab of week 3 (your TA will demonstrate you a model solution at the end of the lab section) Write a program that will calculate and print out bills for the Hong Kong water company. The water rates vary depending on |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lec9.ps, 19970606
COMP 104 Page 1 Topic 9 : arrays, searching and sorting n float x; n An array type is a structured data type representing a regular structure of components of the same type. n One-dimensional array: n x = 8.8; x = x; cout << x; n enum logical |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lab1.ps, 19970606
HKUST Computer Science Comp104: Computer Fundamentals & Programming Fall Semester, 1997 Lab of week 2 (your TA will demonstrate you a model solution at the end of the lab session) Write a program that reads in the length and width of a rectangular yard and the length and width of a rectangular house |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lec17.ps, 19970606
COMP 104 Page 1 Chapter 17 : more on OO program design First way: void main() |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lec16.ps, 19970606
COMP 104 Page 1 Topic 16 : templates n templates can be used to parameterize (there may be more than one parameter) classes, and functions. n classes: template class c_name ..}; |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lec13.ps, 19970606
COMP 104 Page 1 Topic 13 : pointers int x = 1, y = 2, z; int *ip; // *ip is int, so ip is a pointer to int ip = &x; // ip points to x // & gives the location where x is stored // *ip is now the same as x y = *ip; // y is now 1 *ip = 0; // x is now 0 ip = &z; // ip now points to z COMP 104 Page |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lec11.ps, 19970607
COMP 104 Page 1 Topic 11 : classes, abstract data types class bankAccount { public: double get_balance(); void set_balance(double); private: double balance; double bankAccount::get_balance() { return balance; } void bankAccount::set_balance(double x) { balance = x; } void main () { bankAccount |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lec10.ps, 19970607
COMP 104 Page 1 Topic 10 : strings and structures n char name; cin >> name; // user types Beat n One-dimensional array: n char name = Beat W ; n cout << name << endl; n provides functions such as strcpy(name, B. Wuth ); strcmp(s1,s2); 1 2 3 4 5 6 7 8 9 B e a t 0 COMP 104 Page 2 |
| ftp://ftp.cs.ust.hk/pub/flin/papers/cut.ps.Z, 19970617
Applications of the Situation Calculus To Formalizing Control and Strategic Information: The Prolog Cut Operator Fangzhen Lin (flin@cs.ust.hk) Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/flin/papers/cutl.ps.Z, 19970617
Applications of the Situation Calculus To Formalizing Control and Strategic Information: The Prolog Cut Operator Fangzhen Lin (flin@cs.ust.hk) Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/flin/papers/ijcai97l.ps.Z, 19970617
Applications of the Situation Calculus To Formalizing Control and Strategic Information: The Prolog Cut Operator Fangzhen Lin (flin@cs.ust.hk) Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/flin/papers/ordergelfondl.ps.Z, 19970617
An Ordering on Subgoals for Planning Fangzhen Lin Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong fl@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/csricky/pgs-pdcs97-camera.ps.gz, 19970624
|
| ftp://ftp.cs.ust.hk/pub/csricky/A4/pgs-pdcs97.ps.gz, 19970624
|
| ftp://ftp.cs.ust.hk/pub/kamal/mate.ps, 19970703
Algorithms for Materialized View Design in Data Warehousing Environment Jian Yang School of Computer Science University College, UNSW Australian Defence Force Academy Canberra ACT 2600, Australia. jian@csadfa.cs.adfa.oz.au Kamalakar Karlapalem Dept of Computer Science Univ. of Science & Technology Clear |
| ftp://ftp.cs.ust.hk/pub/techreport/97/tr97-4.ps.gz, 19970705
Motion Compensated Color Image Classification and Parameter Estimation in a Markovian Framework Zoltan Kato , Ting-Chuen Pong , and John Chung-Mong Lee Technical Report HKUST-CS97-04 May 1997 Department of Computer Science The Hong Kong University of Science & Technology Clear Water Bay, Kowloon, Hong |
| ftp://ftp.cs.ust.hk/pub/techreport/96/tr96-16.ps.gz, 19970713
Video Annotation by Motion Interpretation using Optical Flow Streamsy G. Sudhir and John C.M. Lee Technical Report HKUST-CS96-16 July 13, 1997 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong yThis research was supported by Sino |
| ftp://ftp.cs.ust.hk/pub/techreport/97/tr97-5.ps.gz, 19970721
A neural model of contour integration in the primary visual cortex y Zhaoping Li Technical Report HKUST-CS97-5 July 21, 1997 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong yI thank Jochen Braun for introducing me to the topic and |
| ftp://ftp.cs.ust.hk/pub/techreport/97/tr97-11.ps.gz, 19970725
Primary Cortical Dynamics for Visual Grouping y Zhaoping Li Technical Report HKUST-CS97-11 July 26, 1997 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong yI thanks Peter Dayan for many conversations and discussions. This work was |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/info.ps, 19970730
HKUST Computer Science Comp104: Computer Fundamentals & Programming Fall Semester, 1997 Course Information Instructor Dr. B. Wuthrich Dr. D.Y. Yeung email: beat@cs.ust.hk email: dyyeung@cs.ust.hk office: 3518 office: 3541 Instructor Lecture notes and labs also available via |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/lec1.ps, 19970804
COMP 104 Page 1 Topic 1: Overview of Computers and Programming n Computer organization n Data representation & coding schemes n Programming languages n Programming COMP 104 Page 2 MULTILEVEL STRUCTURED ORGANIZATION OF A COMPUTER SYSTEM Human level Programming language level Assembly language level |
| ftp://ftp.cs.ust.hk/pub/techreport/97/tr97-2.ps.gz, 19970807
Automatic Classification of Tennis Video for High-level Content-based Retrievalz G. Sudhir , John C. M. Lee , and Anil K. Jainy Technical Report HKUST-CS97-2 August 7, 1997 Department of Computer Science The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong yDepartment |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/roadmap.ps, 19970829
A Road Map Through Nachos Thomas Narten Department of Computer Sciences Levine Science Research Center Duke University Box 90129 Durham, N.C. 27708-0129 narten@cs.duke.edu January 4, 1995 |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/A4lect1.ps, 19970830
COMP 252 INTRODUCTION 1 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. COMP 252 PRINCIPLES OF SYSTEMS SOFTWARE FALL 1997 COMP 252 INTRODUCTION 2 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. Course Outline 1. Introduction 1.1.Basic Concepts 1.2.History of Operating Systems |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/lect1.ps, 19970830
COMP 252 INTRODUCTION 1 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. COMP 252 PRINCIPLES OF SYSTEMS SOFTWARE FALL 1997 COMP 252 INTRODUCTION 2 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. Course Outline 1. Introduction 1.1.Basic Concepts 1.2.History of Operating Systems |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/lect2.ps, 19970901
COMP 252 INTRODUCTION 25 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. COMPUTER SYSTEM STRUCTURES (Hardware Support for Operating System) COMP 252 INTRODUCTION 26 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. Computer System Structure The I/O devices and CPU can execute |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/lect3.ps, 19970901
COMP 252 INTRODUCTION 41 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. Operating System Services The OS provides the following services to programs and the users of the programs: - Program execution - I/O operations - File-system manipulation - Communications - Error detection The following |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/A4lect2.ps, 19970901
COMP 252 INTRODUCTION 25 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. COMPUTER SYSTEM STRUCTURES (Hardware Support for Operating System) COMP 252 INTRODUCTION 26 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. Computer System Structure The I/O devices and CPU can execute |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/A4lect3.ps, 19970901
COMP 252 INTRODUCTION 41 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. Operating System Services The OS provides the following services to programs and the users of the programs: - Program execution - I/O operations - File-system manipulation - Communications - Error detection The following |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/A4lect4.ps, 19970902
COMP 252 PROCESSES AND THREADS 1 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. PROCESSES AND THREADS COMP 252 PROCESSES AND THREADS 2 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. Process Concepts A process is a program in execution A process is an operating system abstraction |
| ftp://ftp.cs.ust.hk/pub/beat/dood97.ps.gz, 19970902
A DATA MINING ALGORITHM OPTIMAL FOR SINGLE RULES K. Jim, J. Lai, B. W thrich The Hong Kong University of Science and Technology Clear Water Bay Kowloon, Hong Kong |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/lect4.ps, 19970902
COMP 252 PROCESSES AND THREADS 1 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. PROCESSES AND THREADS COMP 252 PROCESSES AND THREADS 2 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. Process Concepts A process is a program in execution A process is an operating system abstraction |
| ftp://ftp.cs.ust.hk/pub/csricky/A4/pfast-pact97.ps.gz, 19970903
|
| ftp://ftp.cs.ust.hk/pub/csricky/PFAST-pact97-camera.fm5.ps.gz, 19970903
|
| ftp://ftp.cs.ust.hk/pub/bli/comp361/Lecture1.ps, 19970903
COMP 561/300S (Fall 1997) Introduction 1 Bo Li COMP 561/300S: High- Speed Networking Bo Li Department of Computer Science HKUST Note: http://www.cs.ust.hk/faculty/bli/comp561.html COMP 561/300S (Fall 1997) Introduction 2 Bo Li Topics History of Communication Networks Networking Principles Future |
| ftp://ftp.cs.ust.hk/pub/bli/comp561/Lecture1.ps, 19970903
COMP 561/300S (Fall 1997) Introduction 1 Bo Li COMP 561/300S: High- Speed Networking Bo Li Department of Computer Science HKUST Note: http://www.cs.ust.hk/faculty/bli/comp561.html COMP 561/300S (Fall 1997) Introduction 2 Bo Li Topics History of Communication Networks Networking Principles Future |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/lect5.ps, 19970903
COMP 252 PROCESSES AND THREADS 17 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. Threads Traditionally the address space and the execution stream were tightly coupled so that each address space can have only one execution stream associated with it Why not decouple the two The resulting |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/A4lect5.ps, 19970903
COMP 252 PROCESSES AND THREADS 17 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. Threads Traditionally the address space and the execution stream were tightly coupled so that each address space can have only one execution stream associated with it Why not decouple the two The resulting |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/lect6.ps, 19970905
COMP 252 THREAD AND PROCESS COORDINATION 1 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. THREAD AND PROCESS COORDINATION COMP 252 THREAD AND PROCESS COORDINATION 2 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. Independent and Cooperating Threads A thread is considered independent |
| ftp://ftp.cs.ust.hk/pub/bli/comp561/Lecture2.ps, 19970905
COMP 561/300S (Fall 1997) Introduction 25 Bo Li Future Networks INTERNET cheap, low bit rate, delay-insensitive service real-time, high speed, delay-sensitive one backbone link upgrade (155 or 622 Mbps) QoS guaranteed network layer protocol (IPv6) +Advantages: Large installed base Backward compatibility |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/A4lect6.ps, 19970905
COMP 252 THREAD AND PROCESS COORDINATION 1 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. THREAD AND PROCESS COORDINATION COMP 252 THREAD AND PROCESS COORDINATION 2 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. Independent and Cooperating Threads A thread is considered independent |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/overview.ps, 19970908
Nachos: Not Another Completely Heuristic Operating System Tom Anderson Computer Science 162 January 24, 1993 Project Overview I hear and I forget, I see and I remember, I do and I understand." | Chinese proverb The project for this course is to build an operating system from scratch. We believe that |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/c++.ps, 19970908
A Quick Introduction to C++ Tom Anderson based on an earlier version written by Wayne Christopher August 30, 1995 If programming in Pascal is like being put in a straightjacket, then programming in C is like playing with knives, and programming in C++ is like juggling chainsaws." Anonymous. 1 |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/lect7.ps, 19970909
COMP 252 THREAD AND PROCESS COORDINATION 13 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. The Critical Section A set of asynchronous concurrent processes/threads may access shared data in an arbitrarily interleaved manner This arbitrary interleaving of executions may result in inconsistent |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/A4lect7.ps, 19970909
COMP 252 THREAD AND PROCESS COORDINATION 13 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. The Critical Section A set of asynchronous concurrent pro- cesses/threads may access shared data in an arbitrarily interleaved manner This arbitrary interleaving of executions may result in inconsistent |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/lect8.ps, 19970910
COMP 252 THREAD AND PROCESS COORDINATION 25 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. The Swap Instruction The swap instruction swaps the contents of two words atomically: procedure swap (var a,b: boolean); var temp: boolean; begin temp:= a; a:= b; b:= temp; end; The swap instruction is |
| ftp://ftp.cs.ust.hk/pub/bli/comp561/Intro.ps, 19970910
COMP 561/300S (Fall 1997) Introduction 1 Bo Li COMP 561/300S: High- Speed Networking Bo Li Department of Computer Science HKUST Note: http://www.cs.ust.hk/faculty/bli/comp561.html COMP 561/300S (Fall 1997) Introduction 2 Bo Li Topics History of Communication Networks Networking Principles Future |
| ftp://ftp.cs.ust.hk/pub/bli/comp561/Lecture3.ps, 19970910
COMP 561/300S (Fall 1997) Introduction 44 Bo Li Networking Mechanisms Objectives: Share resources Improve performance (e.g., high prior ity (small delay), low priority (high delay); High throughput, etc. TV = shared link Ether net Token Ring Coax modem Central office Bridge COMP 561/300S (Fall 1997) |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/A4lect8.ps, 19970910
COMP 252 THREAD AND PROCESS COORDINATION 25 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. The Swap Instruction The swap instruction swaps the contents of two words atomically: procedure swap (var a,b: boolean); var temp: boolean; begin temp:= a; a:= b; b:= temp; end; The swap instruction is |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C88.ps, 19970912
Design of Protocols in Timed CSP for Highly Reliable and Available Client{Server System Noriki OGURA Nihon Unisys, Ltd. Tokyo Bay Development Center 1-10-9 Shinonome, Koto, Tokyo 135, JAPAN. Noriki.Ogura@unisys.co.jp Keizo SAISHO, Akira FUKUDA Graduate School of Information Science, Nara Institute of |
| ftp://ftp.cs.ust.hk/pub/apsec/concise_paper/C1.ps, 19970912
1 Software Metrics and Application Domain Complexity Wei Li and Harry Delugach Computer Science Department The University of Alabama in Huntsville Huntsville, AL 35899 {wli, delugach}@cs.uah.edu |
| ftp://ftp.cs.ust.hk/pub/apsec/concise_paper/C7.ps, 19970912
Integration Of Application Systems By Modelling Information Shared Among Applications Parames Ghosh George Feuerlicht ALLTEL International Resource Management, Inc. School Of Computing Sciences Level 4, 223-239, Liverpool Road, Ashfield University of Technology, Sydney NSW 2131; Australia P.O. Box 123, |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C67.ps, 19970912
Multi-Plan Attribute Grammars WUU YANG Department of Computer and Information Science National Chiao-Tung University Hsin-Chu, Taiwan, R.O.C. wuuyang@cis.nctu.edu.tw |
| ftp://ftp.cs.ust.hk/pub/apsec/concise_paper/T52.ps, 19970912
Component-Based Software Development A New Paradigm in Software Engineering Wolfgang Pree University of Constance Universit tsstr. 10 D-78457 Constance, Germany +49-7531-88-44-33 pree@acm.org |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C49.ps, 19970912
Client Location Tracking with K-Step Prediction and Cache Policy in Ubiquitous Information Service Network Jang, Hung-Chin (jang@cs.nccu.edu.tw), Lien, Yao-Nan (lien@cs.nccu.edu.tw) Dept. of Computer Science, National Cheng-Chi University, Taipei, Taiwan, R.O.C. Huang, Jyh-Shyan (frank@cs.nccu.edu.tw) |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T70.ps, 19970912
The Development of an Object-Oriented, Discrete-Event Simulation Language Using Java. Dr. Peter Martin Department of Computing University of the West of England UK (e-mail peter.martin@csm.uwe.ac.uk) |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C78.ps, 19970912
An Architecture and a Framework for IP Applications Masami Noro, Kunio Goto Department of Information Systems & Quautiative Sciences Nanzan University 18 Yamazato-cho Shouwa-ku Nagoya Aichi 466 Japan masami@iq.nanzan-u.ac.jp, goto@iq.nanzan-u.ac.jp |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C102.ps, 19970912
Detecting Common Mode Failures in N-Version Software Using Weakest Precondition Analysis Gwang Sik Yoon, Sung Deok Cha, and Yong Rae Kwon Department of Computer Science Korea Advanced Institute of Science and Technology 373-1, Kusong-dong, Yusong-gu, Taejon 305-701, Korea fgsyoon,cha,yrkwong@ |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T68.ps, 19970912
TPAL : A Timed-Probabilistic Model for Concurrent Processes Antonio Bueno Valent n Valero Fernando Cuartero Departamento de Inform atica Escuela Polit ecnica de Albacete Univ. de Castilla-La Mancha Campus Univ. s/n. 02071. Albacete, Spain. fabueno, valentin, fernandog@info-ab.uclm.es |
| ftp://ftp.cs.ust.hk/pub/apsec/concise_paper/C14.ps, 19970912
LOODS: a new learning-based object-oriented system development environment Qi Deyu (Dept. of Computer, South China University of Technology, Guangzhou, 510641, P.R. CHINA email: csqideyu@scut.edu.cn) |
| ftp://ftp.cs.ust.hk/pub/apsec/concise_paper/T71.ps, 19970912
Not Whether Java but How Java Chris Wallace & Peter Martin Department of Computing University of the West of England UK (e-mails chris.wallace & peter.martin@csm.uwe.ac.uk) |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C82.ps, 19970912
A Methodology for Object-Oriented Constraint Programming Hon Wai Chun Department of Electronic Engineering, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong email: eehwchun@cityu.edu.hk |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T33.ps, 19970912
Scenario Reuse: A Technique for Complementing Scenario-Based Requirements Engineering Approaches W. Lam Department of Computer Science, The University of Hertfordshire Hatfield, Herts AL10 9AB, UK. Tel: +44 01707 284337, Fax: +44 01707 284303 E-mail: W.Lam@herts.ac.uk |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T40.ps, 19970912
MetaBuilder: a Generic CASE Tool Builder Maokai Gong, Louise Scott, and Ray Offen CSIRO-Macquarie University Joint Research Center for Advanced Systems Engineering Macquarie University, Sydney, NSW 2109, Australia e-mail: gmk@mpce.mq.edu.au |
| ftp://ftp.cs.ust.hk/pub/apsec/concise_paper/C28.ps, 19970912
A Visual Programming Environment for Z Specifications Stephen W C Lam, Keith C C Chan, Hareton K N Leung and Lawrence M L Chung Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong. Email: cswclam / cskcchan / cshleung@comp.polyu.edu.hk Tel: (852) 2766 7265 Fax: |
| ftp://ftp.cs.ust.hk/pub/apsec/tutorial_summary/TS2.ps, 19970912
Design Patterns Essentials, Experience, Java Case Study Wolfgang Pree University of Constance Universit tsstr. 10 D-78457 Constance, Germany +49-7531-88-44-33 pree@acm.org Hermann Sikora RACON Software, Inc. Goethestr. 80 A-4020 Linz, Austria +43-70-6929-213 lrzgsik@grz-linz.raiffeisen.at |
| ftp://ftp.cs.ust.hk/pub/apsec/concise_paper/T57.ps, 19970912
Exploiting the Advantages of Object Oriented Programming in the Implementation of a Database Design Environment Nigel Stanger and Richard Pascoe Department of Information Science, University of Otago, Dunedin, New Zealand |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C22.ps, 19970912
Criticality Prediction Models using SDL Metrics Set Euy-Seok Hong and Chi-Su Wu Department of Computer Science Seoul National University Shinlim-Dong, Kwanak-Gu, Seoul, Korea, 151-742 e-mail: hes@drum.snu.ac.kr, wuchisu@selab.snu.ac.kr |
| ftp://ftp.cs.ust.hk/pub/apsec/concise_paper/T54.ps, 19970912
An Overview of Legacy Information System Migration Jesus Bisbal, Deirdre Lawless, Ray Richardson1, D O Sullivan2, Bing Wu, Jane Grimson, Vincent Wade Broadcom ireann Research, Computer Science Department, Dublin, Ireland. Trinity College, Dublin, Ireland. Email: 1 : rr@broadcom.ie Email: |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C21.ps, 19970912
'22' 6HUYHU &HQWUDO 5HSRVLWRU &RPPXQLFDWLRQ 6HUYHU '22' &OLHQW 5HSRVLWRU 6HUYHU 7UDQVDFWLRQ 0DQDJHU &RPPXQLFDWLRQ &OLHQW 6KDUHG 6FUDWFKSDG /RFDO 5HSRVLWRU 2EMHFW 0RGHOOHU 'QDPLF 0RGHOOHU )XQFWLRQDO 0RGHOOHU '22' &OLHQW &RPPXQLFDWLRQ &OLHQW 6KDUHG 6FUDWFKSDG /RFDO 5HSRVLWRU 2EMHFW 0RGHOOHU 'QDPLF |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T90.ps, 19970912
A Theory of Interactions and Scenes for User Centered Systems Specification and Verification Alberto Faro Daniela Giordano Istituto di Informatica e Telecomunicazioni Education Department, Graduate Program in Facolt di Ingegneria, Universit di Catania Educational Technology, Concordia University viale |
| ftp://ftp.cs.ust.hk/pub/apsec/concise_paper/T98.ps, 19970912
A Z Specification of Use Cases: A Preliminary Report Greg Butler Peter Grogono Department of Computer Science Concordia University Montr eal, Qu ebec, H3G 1M8 Canada Email: fgregb,grogonog@cs.concordia.ca Ferhat Khendek Dept of Electrical and Computer Engineering Concordia University Montr eal, Qu ebec, |
| ftp://ftp.cs.ust.hk/pub/apsec/concise_paper/C9.ps, 19970912
Software Requirements Definition for Specification Database Atsushi OHNISHI Department of Computer Science, Ritsumeikan University Shiga 525-77, JAPAN |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T66.ps, 19970912
Cognitive De ciencies in Software Library Design Steven Atkinson Software Veri cation Research Centre School of Information Technology The University of Queensland, Australia S.Atkinson@it.uq.edu.au |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T81.ps, 19970912
Possum: An Animator for the SUM Specification Language Daniel Hazel Paul Strooper Owen Traynor Software Verification Research Centre, School of Information Technology The University of Queensland, Brisbane, Qld. 4072, Australia email: odin, pstroop, owen@it.uq.edu.au |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C72.ps, 19970912
On the Criteria of Allocating Test Cases under Uncertainty T. Y. Chen and Y. T. Yu Department of Computer Science University of Melbourne Parkville 3052, Australia E-mail: ftyc,ytyg@cs.mu.oz.au |
| ftp://ftp.cs.ust.hk/pub/bli/comp561/Lecture4.ps, 19970912
COMP 561/300S (Fall 1997) Fast Circuit Switching 1 Bo Li Topics SONET Narrow-band ISDN Intelligent Networks COMP 561/300S (Fall 1997) Fast Circuit Switching 2 Bo Li SONET (Synchronous Optical NETwork) SONET, as an ITU standard, is being deployed in the telephone network by various telephone companies, |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C19.ps, 19970912
A Reverse Engineering Method and Experiences for Industrial COBOL System Ikuyo Nagaoka Institute of Advanced Business Systems, Hitachi, Ltd. 2-2 Kagahara, Tsuzuki, Yokohama, Kanagawa 224, Japan ikuyo@iabs.hitachi.co.jp Daisuke Ikeo, Toshinori Nagashima Information Technology Center, Kawasaki Steel |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T46.ps, 19970912
Finite Symbolic Reachability Graphs for High-Level Petri Nets Nabil Hameurlain, Christophe Sibertin-Blanc CERISS, IRIT Universit Toulouse 1, Place Anatole France, 31042 Toulouse France E-mail: {nabil, sibertin}@{univ-tlse1, irit}.fr |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C65.ps, 19970912
A Test-case Generation Method for Concurrent Programs Including Task-types Tetsuro Katayama Graduate School of Information Science, Nara Institute of Science and Technology. 8916-5 Takayama Ikoma, Nara 630-01, Japan. kat@is.aist-nara.ac.jp Zengo Furukawa Educational Center for Information Processing, |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C100.ps, 19970912
Compacting Regression-Suites On-The-Fly Erez Buchnik1, Applied Materials Dr. Shmuel Ur, IBM Haifa Research Lab Email: erez@amil.co.il Email: sur@vnet.ibm.com 1 This work was done by the first author, under the supervision of the second author, as part of the requirements for a degree in the Technion, |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C64.ps, 19970912
Measuring Class Coupling and Cohesion: A Formal Metamodel Approach Simon Moser CSSE/COTAR Swinburne University of Technology 1 John St., Hawthorn Vic 3122 Australia moser@acm.org Vojislav B. Mi si c The Hong Kong University of Science and Technology Clear Water Bay, Kowloon Hong Kong vmisic@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T96.ps, 19970912
Integrating Safety Analysis and Requirements Engineering Gerald Kotonya, Ian Sommerville, Computing Department, Computing Department, Lancaster University, Lancaster University, Lancaster LA1 4YR, UK Lancaster LA1 4YR, UK gerald@comp.lancs.ac.uk is@comp.lancs.ac.uk |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C110.ps, 19970912
A Formal Operational Semantics for SOFL Chris Ho-Stuart School of Computing Science Queensland University of Technology GPO Box 2434, Brisbane 4001, Australia hostuart@fit.qut.edu.au Shaoying Liu Faculty of Information Science Hiroshima City University Asaminami-ku, Hiroshima, 731-31, Japan |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T43.ps, 19970912
HKBCN - A Hybrid Intelligent System for Knowledge Revising Xinyu Wu and John G. Hughes School of Information and Software Engineering University of Ulster at Jordanstown Co. Antrim BT37 0QB, N. Ireland Telephone: +44 (0)1232 368157, Fax: +44 (0)1232 366803 Email: w.xinyu, jg.hughes@ulst.ac.uk |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T58.ps, 19970912
Translating Object-Z Specifications to Object-Oriented Test Oracles Jason McDonald, Leesa Murray and Paul Strooper Software Verification Research Centre School of Information Technology The University of Queensland, St Lucia, Qld, 4072, Australia email: jasonm, leesam, pstroop@it.uq.edu.au |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T91.ps, 19970912
About the Suitability of Petri Nets for Describing, Validating and Evaluating SA-RT Speci cations Adel Benzina, Mario Paludetto and Jer ome Delatour LAAS-CNRS. 7, Av du Colonel Roche, F-31077 Toulouse Cedex 4. France. Tel:(33) 561 33 62 60. Fax: (33) 561 33 69 36. fbenzina,mario,delatourg@laas.fr |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C101.ps, 19970912
$Q $SSURDFK WR 6RIWZDUH 3URFHVV 0DQDJHPHQW %DVHG RQ )RUPDO 3URFHVV 0RGHOLQJ DQG $QDOVLVfl 6DQJ
|
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T97.ps, 19970912
Specifying the UQ editor user-interface with Object-Z Andrew Hussey and David Carrington Software Verification Research Centre School of Information Technology The University of Queensland Brisbane, Qld, 4072, Australia email: fahussey,davecg@it.uq.edu.au |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C103.ps, 19970912
Software Development as a Work ow Process Daniel K.C. Chan INRIA - Rocquencourt Domaine de Voluceau, B.P. 105 78153 Le Chesnay Cedex, France Daniel.Chan@inria.fr Karl R.P.H. Leung Department of Computing Hong Kong Polytechnic University Hunghom, Hong Kong cskleung@comp.polyu.edu.hk |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C3.ps, 19970912
Conditional Evaluation in Simple Multi-Visit Attribute-Grammar Evaluators WUU YANG Department of Computer and Information Science National Chiao-Tung University Hsin-Chu, Taiwan, R.O.C. wuuyang@cis.nctu.edu.tw |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T38.ps, 19970912
A Formal Model of Concurrency for Distributed Object-Oriented Systems Manuel Barrio and Pablo de la Fuente Department of Computer Science University of Valladolid 47011 Valladolid, Spain fmbarrio,pablog@infor.uva.es. |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C18.ps, 19970912
A Tool-Suite for Reachability Analysis of Concurrent Object-Oriented Programs Sridhar Iyer S. Ramesh Department of Computer Science and Engineering Indian Institute of Technology, Bombay, INDIA. e-mail: fsri,rameshg@cse.iitb.ernet.in |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C69.ps, 19970912
Towards Constructing a Class Evolution Model Takako NAKATANI Tetsuo TAMAI !! Graduate School of Arts and Sciences University of Tokyo 3-8-1, Komaba, Meguro-ku, Tokyo 153, Japan tina@graco.c.u-tokyo.ac.jp, tamai@graco.c.u-tokyo.ac.jp Atsushi TOMOEDA Harumi MATSUDA SI Business Department, SRA Co., Ltd. |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C60.ps, 19970912
A Distributed Constraint-Based Search Architecture For Bus Timetabling and Duty Assignment Hon Wai Chun Department of Electronic Engineering, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong email: eehwchun@cityu.edu.hk |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C83.ps, 19970912
Software Engineering Research: A Methodological Analysis Franck XIA Business Information Systems University of Macao email: fbafx@umacap1.umac.mo |
| ftp://ftp.cs.ust.hk/pub/apsec/concise_paper/T87.ps, 19970912
Software Assisted Handover of Mobile Clients in Heterogeneous Wireless Computing Environments Edmond Sung and Arkady Zaslavsky Department of Computer Technology, Monash University 900 Dandenong Road, Caulfield East 3145, Vic, Australia Email: {ymsung, azaslavs}@broncho.ct.monash.edu.au Nowadays, |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T92.ps, 19970912
Modular Reasoning in Object-Z Alena Griffiths Software Verification Research Centre School of Information Technology University of Queensland, Australia. 4072 alena@it.uq.edu.au |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T37.ps, 19970912
Quality and Reuse in Industrial Software Engineering Greg Butler Department of Computer Science Concordia University Montreal, PQ H3G 1M8 Canada gregb@cs.concordia.ca |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T36.ps, 19970912
Reducing Uncertainties in Data Mining Yuhe Li and Haihong Dai Department of Computer Science The Queen s University of Belfast Belfast BT7 1NN N. Ireland, UK Telephone: 44-1232-274624 / 274620 Fax: 44-1232-683890 E-Mail: {y.h.li, h.dai}@qub.ac.uk |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T35.ps, 19970912
Using Extended Event Traces to Describe Communication in Software Architectures1 Manfred Broy, Christoph Hofmann, Ingolf Kr ger, Monika Schmidt Institut f r Informatik Technische Universit t M nchen D-80290 M nchen, Germany {broy, hofmannc, kruegeri, schmidtm}@informatik.tu-muenchen.de |
| ftp://ftp.cs.ust.hk/pub/apsec/concise_paper/C24.ps, 19970912
Conceptual Issues of an Object-Centered Process Model Makoto Matsushitay matusita@ics.es.osaka-u.ac.jp Makoto Oshitay oshita@ics.es.osaka-u.ac.jp Hajimu Iidaz iida@itc.aist-nara.ac.jp Katsuro Inouey inoue@ics.es.osaka-u.ac.jp yOsaka University Dept. of Information and Computer Sciences Faculty of |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T42.ps, 19970912
Discovery of Cases for Case-Based Reasoning in Engineering Haihong Dai Department of Computer Science Queen's University of Belfast BELFAST BT7 1NN N. Ireland, UK Telephone: +44 (0)1232 274620 Fax: +44 (0)1232 683890 Email: h.dai@qub.ac.uk |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T55.ps, 19970912
Legacy Systems Migration - A Method and its Tool-kit Framework Bing Wu, Deirdre Lawless, Jesus Bisbal, D O Sullivan1, Ray Richardson2 Jane Grimson, Vincent Wade Broadcom ireann Research, Computer Science Department, Dublin, Ireland. Trinity College, Dublin, Ireland. Email: 1 : dosullivan@ broadcom.ie; |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T85.ps, 19970912
Mapping Ada Source Code into an Abstract Program Space Paul A. Bailes, Paul Burnim, Murray Chapman Centre for Software Maintenance, School of Information Technology The University of Queensland QLD 4072, AUSTRALIA E-Mail: paul@it.uq.edu.au |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T107.ps, 19970912
A Design Framework for System Re-engineering X. Liu, Z. Chen, H. Yang and H. Zedan Software Technology Research Laboratory De Montfort University, England William C. Chu Department of Information Engineering Feng Chia University Taiwan |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T53.ps, 19970912
Petri Nets Based Proofs of ADA 95 solution for Preference Control K.Barkaoui, C.Kaiser and J.F. Pradat-Peyre Conservatoire National des Arts et M etiers Laboratoire CEDRIC barkaoui@cnam.fr, kaiser@cnam.fr, peyre@cnam.fr |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T44.ps, 19970912
Design by Contract for Python Reinhold Pl sch Ch. Doppler Laboratory for Software Engineering Johannes Kepler University of Linz Altenbergerstr. 69, A-4040 Linz, Austria ploesch@swe.uni-linz.ac.at |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C76.ps, 19970912
Denotational Semantics for JSD W. Lok Yeung Department of Computer Studies Lingnan College, Hong Kong Email: wlyeung@ln.edu.hk |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/project1.ps, 19970913
COMP 252 Principles of Systems Software, Fall 1997 Nachos Project #1: Build a thread system Due: Oct. 06, 1997 6:00 pm. In this project, we give you part of a working thread system; your job is to complete it, and then to use it to solve two synchronization problems. The first step is to read and |
| ftp://ftp.cs.ust.hk/pub/apsec/tutorial_summary/TS3.ps, 19970915
OPEN-MeNtOR: A Third Generation OO Methodology Advanced Tasks and Techniques Paul A. Swatman Centre for Information Systems Research School of Information Technology Swinburne University of Technology PO Box 218, Hawthorn Australia 3122 |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T63.ps, 19970915
Slicing Object-Oriented Programs Jiun-Liang Chen* Feng-Jian Wang* Yung-Lin Chen+ *Department of Computer Science and Information Engineering National Chiao Tung University, Hsinchu, Taiwan +Software Engineering Laboratory Institute for Information Industry, Taipei, Taiwan |
| ftp://ftp.cs.ust.hk/pub/apsec/invited_paper/IP2.ps, 19970915
Keynote Address Observations Regarding Internet and Intranet Technology Bruce Shriver Genesis 2, Inc. and The University of Tromso, Tromso, Norway The distributed computing landscape is changing dramatically around us -- from plug-ins to applets, from fat clients to thin clients, from uniprocessor |
| ftp://ftp.cs.ust.hk/pub/apsec/invited_paper/IP1.ps, 19970915
Keynote Address Who will build the digital systems Prof. Les Belady Head of North American R&D Operations, Mitsubishi Electric Corporation Over the last few decades Asia, particularly Japan, developed tremendous engineering capabilities in many industries, including that in Information Technology. More |
| ftp://ftp.cs.ust.hk/pub/apsec/invited_paper/IP3.ps, 19970915
Keynote Address Software Industry in Mainland China --- Opportunities and Problems Prof. Zhou, Xiling Beijing Information Technology institute Mainland China is not only the world's largest potential software market, but is also becoming a multi-billion dollar real market by the year of 2000. In the |
| ftp://ftp.cs.ust.hk/pub/apsec/tutorial_summary/TS4.ps, 19970915
Design and Implementation of Coordination and Workflow Management Technology Frank von Martial DeTeMobil GmbH, Bonn, author postal address: Gartenstrasse 80, D-53721 Siegburg, Germany |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/A4lect9.ps, 19970915
COMP 252 THREAD AND PROCESS COORDINATION 37 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. The Dining-Philosophers Problem Five philosophers sit around a common circular table and spend their time thinking and eating There is a chopstick between every two philosophers When a philosopher |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/lect9.ps, 19970915
COMP 252 THREAD AND PROCESS COORDINATION 37 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. The Dining-Philosophers Problem Five philosophers sit around a common circular table and spend their time thinking and eating There is a chopstick between every two philosophers When a philosopher |
| ftp://ftp.cs.ust.hk/pub/apsec/concise_paper/C80.ps, 19970915
An Approach To software Testability Measurement Jin-Cherng Lin, Szu-Wen Lin & Louis Huang Dept. of Computer Science and Engineering Tatung Institue of Technology Taipei 10451, Taiwan, R.O.C jclin@cse.ttit.edu.tw Tel: (02)592-5252 ext 3295 |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/sol11.ps, 19970916
COMP272 Theory of Computation Fall Semester 1997 Homework 1 Solution Teacher Assistant : Lee Siu Shan, Stephen Session : 1A, 1B email : sslee@cs.ust.hk homepage : http://www.cs.ust.hk/ sslee Office hours : 14:00 - 16:00 (Wed) Q1 (a) true (b) false (c) true (d) true (e) true (f) true (g) false (h) true |
| ftp://ftp.cs.ust.hk/pub/beat/Comp104/hwk1.ps, 19970918
HKUST 1 Computer Science HONG KONG UNIVERSITY OF SCIENCE & TECHNOLOGY COMP 104: Programming Fundamentals and Methods Fall Semester 1997 HOMEWORK ASSIGNMENT #1 Final program due on Oct 7, 1997 in class (hand-in procedure: put floppy disc with source code print out in an envelop carrying your name, your |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/tut2.ps, 19970918
COMP 272 Theory of Computation Fall Semester 1997 Teacher Assistant : Lee Siu Shan, Stephen session : 1A, 1B email : sslee@cs.ust.hk homepage : http://www.cs.ust.hk/ sslee Office hours : 14:00 - 16:00 (Wed) Tutorial 1 Halting problem is insolvable There does not exist a checker program that can take any |
| ftp://ftp.cs.ust.hk/pub/techreport/97/tr97-13.ps.gz, 19970918
1 Department of Computer Science Hong Kong University of Science and Technology Clearwater Bay, Hong Kong http://www.cs.ust.hk/faculty/dimitris/bio.html 2 Dept. of Electrical and Computer Engineering National Technical University of Athens Zographou, Athens, Greece dinos@dbnet.ntua.gr 3 Action AID INRIA |
| ftp://ftp.cs.ust.hk/pub/bli/comp561/Lecture5.ps, 19970919
COMP 561/300S (Fall 1997) Fast Circuit Switching 18 Bo Li ISDN (Integrated Services Digital Network) Narrowband ISDN provides digital services to users. The channels can be circuit switched or packet switched. Support of voice and non-voice applications using a limited set of standardized facilities. |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/lect12.ps, 19970919
COMP 252 CPU SCHEDULING 1 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. CPU SCHEDULING COMP 252 CPU SCHEDULING 2 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. CPU Scheduling Concepts While discussing batch systems, we realized that if programs are executed in a fixed sequence, |
| ftp://ftp.cs.ust.hk/pub/muppala/comp252/A4lect12.ps, 19970919
COMP 252 CPU SCHEDULING 1 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. CPU SCHEDULING COMP 252 CPU SCHEDULING 2 Copyright 1997 by Jogesh K. Muppala, All Rights Reserved. CPU Scheduling Concepts While discussing batch systems, we realized that if programs are executed in a fixed sequence, |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/T99.ps, 19970923
Genericity in Method Construction Veronique Plihon GECT Universit de Toulon et du Var BP 132 83957 La Garde Cedex, France plihon@univ-tln.fr Colette Rolland CRI Universit Paris I Sorbonne 17 rue de la Sorbonne 75005 Paris, France rolland@masi.ibp.fr |
| ftp://ftp.cs.ust.hk/pub/beat/vldb.ps.gz, 19970923
Cumulative Updates S. M. Sripada European Computer-Industry Research Centre Arabellastrasse 17 81925 Munich, Germany sripada@ecrc.de B. W uthrich The Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong beat@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/beat/dood95Ws.ps.gz, 19970923
A Temporal and Probabilistic, Deductive and Object-Oriented Query Language B. W uthrich W.C. Tong K. Sankaran Hong Kong University of Science & Technology Clear Water Bay, Kowloon, Hong Kong beat@cs.ust.hk tongjo@oocl.com pskvi@cs.ust.hk |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C104.ps, 19970923
Object-Oriented Web Application Architectures and Development Strategies Eun Sook Cho, Soo Dong Kim, Sung Yul Rhew Department of Computer Science Soong Sil University, Seoul, Korea escho@sel.soongsil.ac.kr, {sdkim,syrhew}@computing.soongsil.ac.kr Sang Duck Lee, Chang Kap Kim Systems Engineering Research |
| ftp://ftp.cs.ust.hk/pub/lzhang/teach/272/quiz1.ps, 19970923
COMP 272 Theory of Computation March 7, 1997, Quiz One Name: E-mail: Student No: Tutorial: ffl Answer ALL questions. You are only required to write down the answers; you do not need to justify them. In questions 4 and 5 you only need to draw the state diagram of the DFA; you do not need to prove it is |
| ftp://ftp.cs.ust.hk/pub/apsec/regular_paper/C13.ps, 19970923
JB-OODBT: An Object-Oriented Database Toolkit for JB/CASE Xu Xuebiao Gu Ning and Shi Baile Department of Computer Science Fudan University 220,Handan Rd,Shanghai,P.R.China,200433 E-mail: fxbxu,ngu,bshig@fudan.edu.cn |
| ftp://ftp.cs.ust.hk/pub/beat/jiis.ps.gz, 19970923
On the Learning of Rule Uncertainties and their Integration into Probabilistic Knowledge Bases Beat W uthrich ECRC, Arabellastr. 17 D-8000 Munich 81, Germany e-mail: beat@ecrc.de |
| ftp://ftp.cs.ust.hk/pub/bli/comp561/Circuit.ps, 19970924
COMP 561/300S (Fall 1997) Fast Circuit Switching 1 Bo Li Topics SONET Narrow-band ISDN Intelligent Networks Performance of Circuit-Switched Net- works COMP 561/300S (Fall 1997) Fast Circuit Switching 2 Bo Li SONET (Synchronous Optical NETwork) SONET, as an ITU standard, is being deployed in the |
| ftp://ftp.cs.ust.hk/pub/bli/comp561/Lecture6.ps, 19970924
COMP 561/300S (Fall 1997) Fast Circuit Switching 30 Bo Li Performance of Circuit- Switched Network Circuit-switched network consists of switches interconnected by links, whose bandwidth or capacity is divided into fixed-rate circuits Call admission determines whether to admit or reject a incoming call |
| | |
