Computer Sciences Commons^™

Selection Of Concept Detectors For Video Search By Ontology-Enriched Semantic Spaces, Xiao-Yong Wei, Chong-Wah Ngo, Yu-Gang Jiang

Research Collection School Of Computing and Information Systems

This paper describes the construction and utilization of two novel semantic spaces, namely Ontology-enriched Semantic Space (OSS) and Ontology-enriched Orthogonal Semantic Space (OS2), to facilitate the selection of concept detectors for video search. These two semantic spaces are enriched with ontology knowledge, while emphasizing consistent and uniform comparison of ontological relatedness among concepts for query-to-concept mapping. OS2, in addition to being a linear space like OSS, also guarantees orthogonality of the semantic space. Compared with other ontology reasoning measures, both spaces are capable of providing platforms that offer a global view of concept inter-relatedness, by allowing evaluation of concept similarity …

Structuring Low-Quality Videotaped Lectures For Cross-Reference Browsing By Video Text Analysis, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong

Research Collection School Of Computing and Information Systems

This paper presents an unified approach in analyzing and Structuring the content of videotaped lectures for distance learning applications. By Structuring lecture videos, we can Support topic indexing and semantic querying of multimedia documents captured in the traditional classrooms. Our goal in this paper is to automatically construct the cross references of lecture videos and textual documents so as to facilitate the synchronized browsing and presentation of multimedia information. The major issues involved in our approach are topical event detection, video text analysis and the matching of slide shots and external documents. In topical event detection, a novel transition detector …

Determining The Number Of Bp Neural Network Hidden Layer Units, Huayu Shen, Zhaoxia Wang, Chengyao Gao, Juan Qin, Fubin Yao, Wei Xu

Research Collection School Of Computing and Information Systems

This paper proposed an improved method to contrapose the problem which is difficult to determine the number of BP neural network hidden layer units. it is proved that the method is efficeient in reducing the frequency of the test through experients, and improves the efficiency of determining the best number of hidden units, which is more valuable in the applications.

Using English Information In Non-English Web Search, Wei Gao, Wei Gao, Ming Zhou

Research Collection School Of Computing and Information Systems

The leading web search engines have spent a decade building highly specialized ranking functions for English web pages. One of the reasons these ranking functions are effective is that they are designed around features such as PageRank, automatic query and domain taxonomies, and click-through information, etc. Unfortunately, many of these features are absent or altered in other languages. In this work, we show how to exploit these English features for a subset of Chinese queries which we call linguistically non-local (LNL). LNL Chinese queries have a minimally ambiguous English translation which also functions as a good English query. We first …

Specifying And Verifying Event-Based Fairness Enhanced Systems, Jun Sun, Yang Liu, Jin Song Dong, Hai H. Wang

Research Collection School Of Computing and Information Systems

Liveness/Fairness plays an important role in software specification, verification and development. Existing event-based compositional models are safety-centric. In this paper, we describe a framework for systematically specifying and verifying event-based systems under fairness assumptions. We introduce different event annotations to associate fairness constraints with individual events. Fairness annotated events can be used to embed liveness/fairness assumptions in event-based models flexibly and naturally. We show that state-of-the-art verification algorithms can be extended to verify models under fairness assumptions, with little computational overhead. We further improve the algorithm by other model checking techniques like partial order reduction. A toolset named Pat has …

Link Layer Multicast Using Smart Antennas: No Client Left Behind, Souvik Sen, Jie Xiong, Rahul Ghosh, Romit Roy Choudhury

Research Collection School Of Computing and Information Systems

Wireless link layer multicast is an important service primitive for emerging applications, such as live video, streaming audio, and other content telecasts. The broadcast nature of the wireless channel is amenable to multicast because a single packet transmission may be received by all clients in the multicast group. However, in view of diverse channel conditions at different clients, the rate of such a transmission is bottlenecked by the rate of the weakest client. Multicast throughput degrades severely. Attempts to increase the data rate result in lower reliability and higher unfairness. This paper utilizes smart beamforming antennas to improve multicast performance …

An Exploration Of Tablet-Based Presentation Systems And Learning Styles, Ngan T. Phan

Master's Theses

Learning in the classroom can occur as a combination of students' personal effort to study class material, the instructor's attempt to present class material, and the interaction that takes place between instructor and students. In a more traditional setting, instructors can lecture by writing notes on a chalkboard or a whiteboard. If instructors want to display prepared lecture slides, they can use the overhead projector and write additional notes on top of these overhead transparencies. With many technological advances, various researchers are advocating towards integration between technology and learning. With the advent of tablet PCs, researchers recognize the potential usefulness …

Biomarker Identification For Prostate Cancer Using An Efficient Feature Selection Algorithm, Vamsi Krishnam Raju Mantena

Electrical & Computer Engineering Theses & Dissertations

In recent years, there has been an increased interest in using protein mass spectrometry to identify biomarkers that discriminate diseased from healthy individuals. A biomarker is a characteristic that is objectively measured and evaluated as an indicator of normal biological processes, pathological processes, or pharmacological responses to a therapeutic intervention. Identifying biomarkers will be an important step towards disease characterization and patient management. One challenge of biomarker identification is how to handle the high dimensional mass spectral data. In this thesis, we applied an efficient feature selection algorithm to mass spectrometry data obtained from prostate tissue samples to identify prostate …

Modeling Geographic Population Dispersion Utilizing Geospatial Information System Environment Agents In An Agent Based Model, Karl D. Liebert

Computational Modeling & Simulation Engineering Theses & Dissertations

New capabilities in agent based model (ABM) environments are opening the door to the creation of ABM that may incorporate high-quality, real world environment data in the form of Geospatial Information System (GIS) files . In the past, GJS environments were only possible through extensive software development efforts focused on specific model applications.

This thesis explores the value and issues of using GIS data to provide an ABM environment. It examines the ability of ABM development environments (DE) to support GIS environment data. The selected ABM DE is then used to model population behavior in an environment defined by authoritative …

Blac: Revoking Repeatedly Misbehaving Anonymous Users Without Relying On Ttps, Patrick P. Tsang, Man Ho Au, Apu Kapadia, Sean W. Smith

Computer Science Technical Reports

Several credential systems have been proposed in which users can authenticate to service providers anonymously. Since anonymity can give users the license to misbehave, some variants allow the selective deanonymization (or linking) of misbehaving users upon a complaint to a trusted third party (TTP). The ability of the TTP to revoke a user's privacy at any time, however, is too strong a punishment for misbehavior. To limit the scope of deanonymization, systems have been proposed in which users are deanonymized if they authenticate ``too many times,'' such as ``double spending'' with electronic cash. While useful in some applications, it is …

Ceg 460/660: Introduction To Software Computer Engineering, Jeffrey Mcdonald

Computer Science & Engineering Syllabi

This course is concerned with the techniques of designing and constructing large programs. Some of the required basic concepts necessarily have to be developed using small programs as examples. To this extent we also study programming-in-the-small. The overall objectives are to present an overview of issues in the development of sot1ware, to discuss terminology, to illustrate via example case studies, and to give sufficiently detailed advice on how to develop quality software. Hands-on experience is emphasized through the use of homework and a class project.

Ceg 453/653: Embedded Systems, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Adapting Ranking Functions To User Preference, Keke Chen, Ya Zhang, Zhaohui Zheng, Hongyuan Zha, Gordon Sun

Kno.e.sis Publications

Learning to rank has become a popular method for web search ranking. Traditionally, expert-judged examples are the major training resource for machine learned web ranking, which is expensive to get for training a satisfactory ranking function. The demands for generating specific web search ranking functions tailored for different domains, such as ranking functions for different regions, have aggravated this problem. Recently, a few methods have been proposed to extract training examples from user clickthrough log. Due to the low cost of getting user preference data, it is attractive to combine these examples in training ranking functions. However, because of the …

Description Logic Reasoning With Decision Diagrams: Compiling Shiq To Disjunctive Datalog, Sebastian Rudolph

Kno.e.sis Publications

We propose a novel method for reasoning in the description logic SHIQ. After a satisfiability preserving transformation from SHIQ to the description logic ALCIb, the obtained ALCIb Tbox T is converted into an ordered binary decision diagram (OBDD) which represents a canonical model for T. This OBDD is turned into a disjunctive datalog program that can be used for Abox reasoning. The algorithm is worst-case optimal w.r.t. data complexity, and admits easy extensions with DL-safe rules and ground conjunctive queries.

Joint Adaptive Distributed Rate And Power Control For Wireless Networks, James W. Fonda, Jagannathan Sarangapani, Steve Eugene Watkins

Electrical and Computer Engineering Faculty Research & Creative Works

A novel adaptive distributed rate and power control (ADRPC) protocol is introduced for wireless networks. The proposed controller contrasts from others by providing nonlinear compensation to the problem of transmission power and bit-rate adaptation. The protocol provides control of both signal-to-interference ratio (SIR) and quality-of-service (QoS) support to bit-rate adaptation. Bit-rate adaptation is performed by local estimation of congestion levels, rendering little packet overhead, using Lyapunov based adaptive control methods. Performance of the proposed control scheme is shown through analytical proof and simulation examples.

Novel Dynamic Representation And Control Of Power Networks Embedded With Facts Devices, Shahab Mehraeen, Jagannathan Sarangapani, Mariesa Crow

Electrical and Computer Engineering Faculty Research & Creative Works

FACTS devices have been shown to be powerful in damping power system oscillations caused by faults; however, in the multi machine control using FACTS, the control problem involves solving differential-algebraic equations of a power network which renders the available control schemes ineffective due to heuristic design and lack of know how to incorporate FACTS into the network. A method to generate nonlinear dynamic representation of a power system consisting of differential equations alone with universal power flow controller (UPFC) is introduced since differential equations are typically preferred for controller development. Subsequently, backstepping methodology is utilized to reduce the generator oscillations …

Ceg 770: Computer Engineering Mathematics, Yong Pei

Computer Science & Engineering Syllabi

Computer Engineering and Science students need proficiency in relevant applied mathematics to be able to discover and model difficult real-world computer engineering and science problems. The relationship of these problems to mathematical theory will be discussed. This course provides an introduction to linear and nonlinear programming, probability and stochastic process, and queueing theory. In addition to mathematical theory, appropriate applications will be presented.

Cs 705: Introduction To Data Mining, Guozhu Dong

Computer Science & Engineering Syllabi

Data mining is concerned with the extraction of novel and useful knowledge from large amounts of data. This course introduces and studies the fundamental concepts, issues, tasks and techniques of data mining. Topics include data preparation and feature selection, association rules, classification, clustering, evaluation and validation, scalability, spatial and sequence mining, privacy, and data mining applications. 3 hours lecture, 2 hours lab.

Cs 766: Evolutionary Computation, Mateen M. Rizki

Computer Science & Engineering Syllabi

This course explores evolutionary computation from a historical, theoretical, and application viewpoint. An overview of the most common evolutionary search techniques are presented including genetic algorithms, evolutionary programming, evolutionary strategies, and genetic programming. The fundamental issues driving the choice of problem representation and specific genetic operators are discussed. Various applications of evolutionary computation to problems in control, optimization, and pattern recognition are examined.

Cs 141: Computer Programming - I, Michael Ondrasek

Computer Science & Engineering Syllabi

This course provides a general introduction to the fundamentals of computer programming. Examples from and applications to a broad range of problems are given. No prior knowledge of programming is assumed. The concepts covered will be applied to the Java programming language. Students must register for both lecture and one laboratory section. 4 credit hours. Prerequisite: MTH 127 (College Algebra) or equivalent.

Ceg 320/520: Computer Organization And Assembly Language Programming, Travis E. Doom

Computer Science & Engineering Syllabi

Terminology and understanding of functional organizations and sequential operation of a digital computer. Program structure, and machine and assembly language topics including addressing, stacks, argument pasing, arithmetic operations, traps, and input/output. Macros, modularization, linkers, and debuggers are used.

Cs 466/666: Introduction To Formal Languages, Guozhu Dong

Computer Science & Engineering Syllabi

CS 466/666 is an introduction to formal language and automata theory. In this course we will examine methods for defining syntax of languages and recognizing patterns: the syntax of languages can be defined using grammars and patterns accepted by finite state machines. Along with presenting the fundamentals of these two topics, the course will develop and investigate the relationships between language definition and pattern recognition. The text will be the third edition of Languages and Machines: An Introduction to the Theory of Computer Science, by Thomas Sudkamp.

Cs 409/609: Principles Of Artificial Intelligence, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.

Cs 240: Introduction To Computer Science I, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

Cs 415: Social Implications Of Computing, Leo Finkelstein

Computer Science & Engineering Syllabi

CS 415 is a communication skills course using as its subject matter current salient issues associated with the social implications of computing. In addition to the course text, you will need to use certain reading materials in the library and elsewhere, and you will be responsible for using concepts and theories provided in class lectures and discussions.

Cs 241: Introduction To Computer Science Ii, Ronald F. Taylor

Computer Science & Engineering Syllabi

A continuation of CS 240. Emphasis is on solving more complex problems using object oriented programming. Prerequisite: CS 240. 4 credit hours.

Cs 400/600: Data Structures And Software Design, Keke Chen

Computer Science & Engineering Syllabi

This course will cover the implementation of classical data structures and control structures, an introduction to the fundamentals of algorithm design and analysis, and the basic problem solving techniques.

Ceg/Ee 260: Digital Computer Hardware Switching Circuits, John C. Gallagher

Computer Science & Engineering Syllabi

Digital Computer Hardware. Topics include switching algebra and switching
functions, logic design of combinational and sequential circuits using TTL,
combinational logic design with MSI and LSI, busing, storage elements, and
instrumentation.

Cs 205-08: Introduction To Computers And Office Productivity Software, Kim Gros

Computer Science & Engineering Syllabi

Focus on learning MS Office software applications including word processing (intermediate), spreadsheets, database and presentation graphics using a case study approach where critical thinking and problem solving skills are required. Computer concepts are integrated throughout the course to provide an understanding of the basics of computing, the latest technological advances and how they are used in industry. Ethics and issues encountered in business are discussed to challenge students on societal impact of technology.

Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp

Computer Science & Engineering Syllabi

This course is an introduction to one of the fundamental topics in the theory of computer science: computability theory. Computability theory is concerned with determining whether there is an algorithmic solution to a problem. The study of computability uses the Turing machine as the basic computational model. A Turing machine is a random access, read-write, finite state automaton. Although the Turing machine provides a simple computational framework, the Church-Turing thesis asserts that any problem that can be solved in any algorithmic manner can be solved by a Turing machine.