Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons™

Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 11071 - 11100 of 13562

Full-Text Articles in Computer Engineering

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

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

Computer Science & Engineering Syllabi

No abstract provided.


Cs 499/699: Special Topics In Information Security, Meilin Liu Oct 2009

Cs 499/699: Special Topics In Information Security, Meilin Liu

Computer Science & Engineering Syllabi

This course gives a comprehensive study of security vulnerabilities in information systems and the basic techniques for developing secure applications and practicing safe computing. Topics include: Conventional encryption; Data Encryption Standard; Advanced Encryption Standard; Hashing functions and data integrity; Basic Number Theory; Public-key encryption (RSA); Digital signature; Security standards and applications; Access Control; Management and analysis of security. After taking this course, students will have the knowledge of several well-known security standards and their applications; and the students should be able to increase system security and develop secure applications.


Cs/Bio 471/671: Algorithms For Bioinformatics, Michael L. Raymer Oct 2009

Cs/Bio 471/671: Algorithms For Bioinformatics, Michael L. Raymer

Computer Science & Engineering Syllabi

Theory-oriented approach to the application of contemporary algorithms to bioinformatics. Graph theory, complexity theory, dynamic programming and optimization techniques are introduced in the context of application toward solving specific computational problems in molecular genetics. 4 credit hours.


Cs 214: Visual Basic Programming, Vanessa Starkey Oct 2009

Cs 214: Visual Basic Programming, Vanessa Starkey

Computer Science & Engineering Syllabi

This course will cover the fundamentals of object-oriented computer
programming including design, structure, debugging, and testing. Visual Basic 2008 will be used for
developing programs.


Ceg 460/660-01: Introduction To Software Computer Engineering, Thomas C. Hartrum Oct 2009

Ceg 460/660-01: Introduction To Software Computer Engineering, Thomas C. Hartrum

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 software, 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 476/676-01: Computer Graphics I, Thomas Wischgoll Oct 2009

Ceg 476/676-01: Computer Graphics I, Thomas Wischgoll

Computer Science & Engineering Syllabi

By the end of this quarter, you will have learnt techniques for constructing 2-D and 3-D objects as well as manipulating and rendering the objects using OpenGL.


Ceg 724-01: Computer Vision I, Arthur A. Goshtasby Oct 2009

Ceg 724-01: Computer Vision I, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

This course covers basic a]algorithms for low-level and mid-level vision. The algorithms deal with reducing image noise and segment images into objects or their parts. Other a]algorithms covered in the course analyze and quantify texture, register images, and recover 3-D shapes from 2-D images.


Ceg 453/653: Embedded Systems, Jack Jean Oct 2009

Ceg 453/653: Embedded Systems, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.


Cs 405/605-02: Introduction To Database Management Systems, Keke Chen Oct 2009

Cs 405/605-02: Introduction To Database Management Systems, Keke Chen

Computer Science & Engineering Syllabi

This course will cover the following topics: (1) Logical and physical aspects of database management systems (2) Data models including entity-relationship (ER) and relational models (3) Physical implementation (data organization and indexing) methods. (4) Query languages including SQL, relational algebra, and relational calculus. Students will gain experience in creating and manipulating a database, and gain knowledge on professional and ethical responsibility and on the importance of privacy/security of data.


Cs 240: Computer Programming I, Sarah Gothard Oct 2009

Cs 240: Computer Programming I, Sarah Gothard

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced.
Emphasis is on structured programming and stepwise refinement.


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

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.


Ceg 402/602-01: Introduction To Computer Communication, Jianing Ma Oct 2009

Ceg 402/602-01: Introduction To Computer Communication, Jianing Ma

Computer Science & Engineering Syllabi

This course provides an introduction to basic concepts of communication
networks, different types of networks, protocols over different layers, and network
applications through lectures, labs, homework, and reading on relevant materials. You will
•Understand networking principles, protocols, and technologies.
•Understand some design and performance issues involved in providing a
network service.
•Acquire background for supporting e-commerce, e-government, and e-education.
•Gain hands-on experience with programming techniques for network
protocols.
•Obtain background for original research in computer networks.


Ceg 433/633-01: Operating Systems, Thomas Wischgoll Oct 2009

Ceg 433/633-01: Operating Systems, Thomas Wischgoll

Computer Science & Engineering Syllabi

By the end of this quarter, you should be able to apply the learned concepts to the following:
•Develop, test and debug programs in Unix.
•Improve the performance of programs by tuning virtual memory usage, and file io.
•Design and construct device drivers for Unix.
•Design and build newer file systems for any OS.

During the course we will discuss topics from the following areas:
•Operating system structures
•Operating system interfaces
•Process management and scheduling
•Interprocess communication
•File systems
•Memory management


Cs 415: Social Implications Of Computing, Leo Finkelstein Oct 2009

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 466/666: Introduction To Formal Languages, Guozhu Dong Oct 2009

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.


Semantics-Preserving Bag-Of-Words Models For Efficient Image Annotation, Lei Wu, Steven C. H. Hoi, Nenghai Yu Oct 2009

Semantics-Preserving Bag-Of-Words Models For Efficient Image Annotation, Lei Wu, Steven C. H. Hoi, Nenghai Yu

Research Collection School Of Computing and Information Systems

The Bag-of-Words (BoW) model is a promising image representation for annotation. One critical limitation of existing BoW models is the semantic loss during the codebook generation process, in which BoW simply clusters visual words in Euclidian space. However, distance between two visual words in Euclidean space does not necessarily reflect the semantic distance between the two concepts, due to the semantic gap between low-level features and high-level semantics. In this paper, we propose a novel scheme for learning a codebook such that semantically related features will be mapped to the same visual word. In particular, we consider the distance between …


Towards Google Challenge: Combining Contextual And Social Information For Web Video Categorization, Xiao Wu, Wan-Lei Zhao, Chong-Wah Ngo Oct 2009

Towards Google Challenge: Combining Contextual And Social Information For Web Video Categorization, Xiao Wu, Wan-Lei Zhao, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Web video categorization is a fundamental task for web video search. In this paper, we explore the Google challenge from a new perspective by combing contextual and social information under the scenario of social web. The semantic meaning of text (title and tags), video relevance from related videos, and user interest induced from user videos, are integrated to robustly determine the video category. Experiments on YouTube videos demonstrate the effectiveness of the proposed solution. The performance reaches 60% improvement compared to the traditional text based classifiers.


Distribution-Based Concept Selection For Concept-Based Video Retrieval, Juan Cao, Hongfang Jing, Chong-Wah Ngo, Yongdong Zhang Oct 2009

Distribution-Based Concept Selection For Concept-Based Video Retrieval, Juan Cao, Hongfang Jing, Chong-Wah Ngo, Yongdong Zhang

Research Collection School Of Computing and Information Systems

Query-to-concept mapping plays one of the keys to concept-based video retrieval. Conventional approaches try to find concepts that are likely to co-occur in the relevant shots from the lexical or statistical aspects. However, the high probability of co-occurrence alone cannot ensure its effectiveness to distinguish the relevant shots from the irrelevant ones. In this paper, we propose distribution-based concept selection (DBCS) for query-to-concept mapping by analyzing concept score distributions of within and between relevant and irrelevant sets. In view of the imbalance between relevant and irrelevant examples, two variants of DBCS are proposed respectively by considering the two-sided and onesided …


Scalable Detection Of Partial Near-Duplicate Videos By Visual-Temporal Consistency, Hung-Khoon Tan, Chong-Wah Ngo, Richang Hong, Tat-Seng Chua Oct 2009

Scalable Detection Of Partial Near-Duplicate Videos By Visual-Temporal Consistency, Hung-Khoon Tan, Chong-Wah Ngo, Richang Hong, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Following the exponential growth of social media, there now exist huge repositories of videos online. Among the huge volumes of videos, there exist large numbers of near-duplicate videos. Most existing techniques either focus on the fast retrieval of full copies or near-duplicates, or consider localization in a heuristic manner. This paper considers the scalable detection and localization of partial near-duplicate videos by jointly considering visual similarity and temporal consistency. Temporal constraints are embedded into a network structure as directed edges. Through the structure, partial alignment is novelly converted into a network flow problem where highly efficient solutions exist. To precisely …


Analyzing The Video Popularity Characteristics Of Large-Scale User Generated Content Systems, Meeyoung Cha, Haewoon Kwak, Pablo Rodriguez, Yong-Yeol Ahn, Sue Moon Oct 2009

Analyzing The Video Popularity Characteristics Of Large-Scale User Generated Content Systems, Meeyoung Cha, Haewoon Kwak, Pablo Rodriguez, Yong-Yeol Ahn, Sue Moon

Research Collection School Of Computing and Information Systems

User generated content (UGC), now with millions of video producers and consumers, is re-shaping the way people watch video and TV. In particular, UGC sites are creating new viewing patterns and social interactions, empowering users to be more creative, and generating new business opportunities. Compared to traditional video-on-demand (VoD) systems, UGC services allow users to request videos from a potentially unlimited selection in an asynchronous fashion. To better understand the impact of UGC services, we have analyzed the world's largest UGC VoD system, YouTube, and a popular similar system in Korea, Daum Videos. In this paper, we first empirically show …


Analysis Of Tradeoffs Between Buffer And Qos Requirements In Wireless Networks, Raphael Rom, Hwee-Pink Tan Oct 2009

Analysis Of Tradeoffs Between Buffer And Qos Requirements In Wireless Networks, Raphael Rom, Hwee-Pink Tan

Research Collection School Of Computing and Information Systems

In this paper, we consider the scheduling problem where data packets from K input-flows need to be delivered to K corresponding wireless receivers over a heterogeneous wireless channel. Our objective is to design a wireless scheduler that achieves good throughput and fairness performance while minimizing the buffer requirement at each wireless receiver. This is a challenging problem due to the unique characteristics of the wireless channel. We propose a novel idea of exploiting both the long-term and short-term error behavior of the wireless channel in the scheduler design. In addition to typical first-order Quality of Service (QoS) metrics such as …


Fault-Tolerance And Recovery In Wireless Sensor Networks, Kevin M. Somervill Oct 2009

Fault-Tolerance And Recovery In Wireless Sensor Networks, Kevin M. Somervill

Electrical & Computer Engineering Theses & Dissertations

The topic of Wireless Sensor Networks (WSNs) has gained considerable attention in the research community due to the variety of applications and interesting challenges in developing and deploying such networks. The typical WSN is significantly energy constrained and often deployed in harsh or even hostile environments, resulting in sensor nodes that are prone to failure. Failing nodes alter the topology of the network resulting in segmented routing paths and lost messages, ultimately reducing network efficiency. These issues spur the desire to develop energy-efficient, Fault-Tolerant (FT) algorithms that enable the network to persist in spite of the failed nodes. This work …


Mining Globally Distributed Frequent Subgraphs In A Single Labeled Graph, Xing Jiang, Hui Xiong, Chen Wang, Ah-Hwee Tan Oct 2009

Mining Globally Distributed Frequent Subgraphs In A Single Labeled Graph, Xing Jiang, Hui Xiong, Chen Wang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Recent years have observed increasing efforts on graph mining and many algorithms have been developed for this purpose. However, most of the existing algorithms are designed for discovering frequent subgraphs in a set of labeled graphs only. Also, the few algorithms that find frequent subgraphs in a single labeled graph typically identify subgraphs appearing regionally in the input graph. In contrast, for real-world applications, it is commonly required that the identified frequent subgraphs in a single labeled graph should also be globally distributed. This paper thus fills this crucial void by proposing a new measure, termed G-Measure, to find globally …


Motion Analysis Of Fluid Flow In A Spinning Disk Reactor, Valentina N. Korzhova Sep 2009

Motion Analysis Of Fluid Flow In A Spinning Disk Reactor, Valentina N. Korzhova

USF Tampa Graduate Theses and Dissertations

The flow of a liquid film over a rapidly rotating horizontal disk has numerous industrial applications including pharmaceuticals, chemical engineering, bioengineering, etc. The analysis and control of complex fluid flows over a rapidly rotating horizontal disk is an important issue in the experimental fluid mechanics. The spinning disk reactor exploits the benefits of centrifugal force, which produces thin highly sheared films due to radial acceleration. The hydrodynamics of the film results in excellent fluid mixing and high heat or mass transfer rates.

This work focuses on developing a novel approach for fluid flow tracking and analysis. Specifically, the developed algorithm …


Temporal Data Classification Using Linear Classifiers, Peter Revesz, Thomas Triplet Sep 2009

Temporal Data Classification Using Linear Classifiers, Peter Revesz, Thomas Triplet

School of Computing: Conference and Workshop Papers

Data classification is usually based on measurements recorded at the same time. This paper considers temporal data classification where the input is a temporal database that describes measurements over a period of time in history while the predicted class is expected to occur in the future. We describe a new temporal classification method that improves the accuracy of standard classification methods. The benefits of the method are tested on weather forecasting using the meteorological database from the Texas Commission on Environmental Quality.


Self-Authentication Of Audio Signals By Chirp Coding, Jonathan Blackledge, Eugene Coyle Sep 2009

Self-Authentication Of Audio Signals By Chirp Coding, Jonathan Blackledge, Eugene Coyle

Conference papers

This paper discusses a new approach to ‘watermarking’ digital signals using linear frequency modulated or ‘chirp’ coding. The principles underlying this approach are based on the use of a matched filter to provide a reconstruction of a chirped code that is uniquely robust in the case of signals with very low signal-to-noise ratios. Chirp coding for authenticating data is generic in the sense that it can be used for a range of data types and applications (the authentication of speech and audio signals, for example). The theoretical and computational aspects of the matched filter and the properties of a chirp …


Exploiting Set-Level Non-Uniformity Of Capacity Demand To Enhance Cmp Cooperative Caching, Dongyuan Zhan, Hong Jiang, Sharad C. Seth Sep 2009

Exploiting Set-Level Non-Uniformity Of Capacity Demand To Enhance Cmp Cooperative Caching, Dongyuan Zhan, Hong Jiang, Sharad C. Seth

School of Computing: Technical Reports

As the Memory Wall remains a bottleneck for Chip Multiprocessors (CMP), the effective management of CMP last level caches becomes of paramount importance in minimizing expensive off-chip memory accesses. For the CMPs with private last level caches, Cooperative Caching (CC) has been proposed to enable capacity sharing among private caches by spilling an evicted block from one cache to another. But this eviction-driven CC does not necessarily promote cache performance since it implicitly favors the applications full of block evictions regardless of their real capacity demand. The recent Dynamic Spill-Receive (DSR) paradigm improves cooperative caching by prioritizing applications with higher …


Admission Control For Differentiated Services In Future Generation Cdma Networks, Hwee-Pink Tan, Rudesindo Núñez-Queija, Adriana F. Gabor, Onno J. Boxma Sep 2009

Admission Control For Differentiated Services In Future Generation Cdma Networks, Hwee-Pink Tan, Rudesindo Núñez-Queija, Adriana F. Gabor, Onno J. Boxma

Research Collection School Of Computing and Information Systems

Future Generation CDMA wireless systems, e.g., 3G, can simultaneously accommodate flow transmissions of users with widely heterogeneous applications. As radio resources are limited, we propose an admission control rule that protects users with stringent transmission bit-rate requirements (“streaming traffic”) while offering sufficient capacity over longer time intervals to delay-tolerant users (“elastic traffic”). While our strategy may not satisfy classical notions of fairness, we aim to reduce congestion and increase overall throughput of elastic users. Using time-scale decomposition, we develop approximations to evaluate the performance of our differentiated admission control strategy to support integrated services with transmission bit-rate requirements in a …


Wireless Networks: Spert: A Stateless Protocol For Energy-Sensitive Real-Time Routing For Wireless Sensor Network, Sohail Jabbar, Abid Ali Minhas, Raja Adeel Akhtar Aug 2009

Wireless Networks: Spert: A Stateless Protocol For Energy-Sensitive Real-Time Routing For Wireless Sensor Network, Sohail Jabbar, Abid Ali Minhas, Raja Adeel Akhtar

International Conference on Information and Communication Technologies

Putting constraints on performance of a system in the temporal domain, some times turns right into wrong and update into outdate. These are the scenarios where apposite value of time inveterate in the reality. But such timing precision not only requires tightly scheduled performance constraints but also requires optimal design and operation of all system components. Any malfunctioning at any relevant aspect may causes a serious disaster and even loss of human lives. Managing and interacting with such real-time system becomes much intricate when the resources are limited as in wireless sensor nodes. A wireless sensor node is typically comprises …


Wireless Networks: Automated Frequency Distribution, Management & Assignment (Afdma) In Ieee 802.16, Khurram Shehzad, A. Ali, F. Rasool, R. M. Hashmi, A. Zubair, R. L. Ali Aug 2009

Wireless Networks: Automated Frequency Distribution, Management & Assignment (Afdma) In Ieee 802.16, Khurram Shehzad, A. Ali, F. Rasool, R. M. Hashmi, A. Zubair, R. L. Ali

International Conference on Information and Communication Technologies

Frequency is amongst the most exclusive and most costly resources in wireless communication networks, especially, while considering the demands of broadband wireless access (BWA). In BWA, the management of frequency distribution and its effective utilization is of utmost importance. This research explores possible ways to ensure the most effective allocation of bandwidth resources and their best possible utilization on need basis. The model for static frequency allocation has been optimized and the dynamic frequency management has been calculated while dividing the users in different user classes on the basis of their needs and requirements. The effect of ping-pong handovers has …