Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Wright State University (154)
- University of Nebraska - Lincoln (19)
- Washington University in St. Louis (19)
- Singapore Management University (13)
- Portland State University (7)
-
- Old Dominion University (4)
- Western Kentucky University (4)
- Chapman University (3)
- University of Nevada, Las Vegas (2)
- University of New Haven (2)
- Air Force Institute of Technology (1)
- Purdue University (1)
- Syracuse University (1)
- Technological University Dublin (1)
- University of New Mexico (1)
- University of Pennsylvania Carey Law School (1)
- Western University (1)
- Keyword
-
- Western Kentucky University (4)
- Electronic data processing -- Distributed processing (3)
- Functional programming (Computer science) (3)
- Parallel processing (Electronic computers) (3)
- Synchronization (3)
-
- Classification (2)
- Data structures (Computer science) (2)
- Grid computing (2)
- Ontology (2)
- Optimization (2)
- Privacy (2)
- Security (2)
- Software metrics (2)
- Stability (2)
- Video browsing (2)
- Addresses (1)
- Algebraic codes (1)
- Architecture (1)
- BDI architecture (1)
- Bandwidth (1)
- Blogs (1)
- CAT detect (1)
- CMAT (1)
- CPS; smart parking; modeling; dynamic pricing scheme; simulation (1)
- CSMA (1)
- Capacity planning (1)
- Clinical Decision Support System (1)
- Cloud Computing (1)
- Cloud Forensic Capability (1)
- Cloud Forensics (1)
- Publication
-
- Computer Science & Engineering Syllabi (154)
- All Computer Science and Engineering Research (19)
- Department of Computer Science and Engineering: Dissertations, Theses, and Student Research (14)
- Research Collection School Of Computing and Information Systems (13)
- Computer Science Faculty Publications and Presentations (7)
-
- Computer Science Faculty Publications (4)
- Engineering Faculty Articles and Research (3)
- CSE Conference and Workshop Papers (2)
- Electrical & Computer Engineering and Computer Science Faculty Publications (2)
- AFIT Documents (1)
- All Faculty Scholarship (1)
- Branch Mathematics and Statistics Faculty and Staff Publications (1)
- CSE Technical Reports (1)
- Computational Modeling & Simulation Engineering Faculty Publications (1)
- Conference papers (1)
- Department of Computer Electronics and Engineering: Dissertations, Theses, and Student Research (1)
- Department of Industrial and Management Systems Engineering: Dissertations, Theses, and Student Research (1)
- Electrical & Computer Engineering Faculty Publications (1)
- Electrical Engineering and Computer Science - All Scholarship (1)
- Electrical and Computer Engineering Publications (1)
- Management, Entrepreneurship and Technology Faculty Publications (1)
- Public Policy and Leadership Faculty Presentations (1)
- Purdue Polytechnic Masters Theses (1)
- VMASC Publications (1)
- WKU Archives Records (1)
Articles 1 - 30 of 234
Full-Text Articles in Computer Engineering
A Study Of Correlations Between The Definition And Application Of The Gene Ontology, Yuji Mo
A Study Of Correlations Between The Definition And Application Of The Gene Ontology, Yuji Mo
Department of Computer Electronics and Engineering: Dissertations, Theses, and Student Research
When using the Gene Ontology (GO), nucleotide and amino acid sequences are annotated by terms in a structured and controlled vocabulary organized into relational graphs. The usage of the vocabulary (GO terms) in the annotation of these sequences may diverge from the relations defined in the ontology. We measure the consistency of the use of GO terms by comparing GO's defined structure to the terms' application. To do this, we first use synthetic data with different characteristics to understand how these characteristics influence the correlation values determined by various similarity measures. Using these results as a baseline, we found that …
Cross Media Hyperlinking For Search Topic Browsing, Song Tan, Chong-Wah Ngo, Hung-Khoon Tan, Lei Pang
Cross Media Hyperlinking For Search Topic Browsing, Song Tan, Chong-Wah Ngo, Hung-Khoon Tan, Lei Pang
Research Collection School Of Computing and Information Systems
With the rapid growth of social media, there are plenty of information sources freely available online for use. Nevertheless, how to synchronize and leverage these diverse forms of information for multimedia applications remains a problem yet to be seriously studied. This paper investigates the synchronization of multiple media content in the physical form of hyperlinking them. The ultimate goal is to develop browsing systems that author search results with rich media information mined from various knowledge sources. The authoring enables the vivid visualization and exploration of different information landscapes inherent in search results. Several key techniques are studied in this …
Stability And Classification Performance Of Feature Selection Techniques, Huanjing Wang, Taghi Khoshgoftaar, Qianhui Liang
Stability And Classification Performance Of Feature Selection Techniques, Huanjing Wang, Taghi Khoshgoftaar, Qianhui Liang
Computer Science Faculty Publications
Feature selection techniques can be evaluated based on either model performance or the stability (robustness) of the technique. The ideal situation is to choose a feature selec- tion technique that is robust to change, while also ensuring that models built with the selected features perform well. One domain where feature selection is especially important is software defect prediction, where large numbers of met- rics collected from previous software projects are used to help engineers focus their efforts on the most faulty mod- ules. This study presents a comprehensive empirical ex- amination of seven filter-based feature ranking techniques (rankers) applied to …
Location Cheating: A Security Challenge To Location-Based Social Network Services, Mai Ren
Location Cheating: A Security Challenge To Location-Based Social Network Services, Mai Ren
Department of Computer Science and Engineering: Dissertations, Theses, and Student Research
Location-based mobile social network services such as Foursquare and Gowalla have grown exponentially over the past several years. These location-based services utilize the geographical position to enrich user experiences in a variety of contexts, including location-based searching and location-based mobile advertising. To attract more users, the location-based mobile social network services provide real-world rewards to the user, when a user checks in at a certain venue or location. This gives incentives for users to cheat on their locations.
In this thesis, we investigate the threat of location cheating attacks, find the root cause of the vulnerability, and outline the possible …
Relational Neighborhood Inverse Consistency For Constraint Satisfaction: A Structure-Based Approach For Adjusting Consistency & Managing Propagation, Robert J. Woodward
Relational Neighborhood Inverse Consistency For Constraint Satisfaction: A Structure-Based Approach For Adjusting Consistency & Managing Propagation, Robert J. Woodward
Department of Computer Science and Engineering: Dissertations, Theses, and Student Research
Freuder and Elfe [1996] introduced Neighborhood Inverse Consistency (NIC) as a local consistency property defined on the values in the variables' domains of a Constraint Satisfaction Problem (CSP). Debruyne and Bessiere [2011] showed that enforcing NIC on binary CSPs is ineffective on sparse graph and too costly on dense graphs. In this thesis, we propose Relational Neighborhood Inverse Consistency (RNIC), an extension of NIC defined as a local consistency property on the tuples of the relations of a CSP. We characterize RNIC for both binary and non-binary CSPs, and propose an algorithm for enforcing it whose complexity is bounded by …
Tracking Web Video Topics: Discovery, Visualization, And Monitoring, Juan Cao, Chong-Wah Ngo, Yong-Dong Zhang, Jin-Tao Li
Tracking Web Video Topics: Discovery, Visualization, And Monitoring, Juan Cao, Chong-Wah Ngo, Yong-Dong Zhang, Jin-Tao Li
Research Collection School Of Computing and Information Systems
Despite the massive growth of web-shared videos in Internet, efficient organization and monitoring of videos remains a practical challenge. While nowadays broadcasting channels are keen to monitor online events, identifying topics of interest from huge volume of user uploaded videos and giving recommendation to emerging topics are by no means easy. Specifically, such process involves discovering of new topic, visualization of the topic content, and incremental monitoring of topic evolution. This paper studies the problem from three aspects. First, given a large set of videos collected over months, an efficient algorithm based on salient trajectory extraction on a topic evolution …
Galaxy Browser: Exploratory Search Of Web Videos, Lei Pang, Song Tan, Hung-Khoon Tan, Chong-Wah Ngo
Galaxy Browser: Exploratory Search Of Web Videos, Lei Pang, Song Tan, Hung-Khoon Tan, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Most search engines return a ranked list of items in response to a query. The list however tells very little about the relationship among items. For videos especially, users often read to spend significant amount of time to navigate the search result. Exploratory search presents a new paradigm for browsing where the browser takes up the role of information exploring and presents a well-organized browsing structure for users to navigate. The proposed interface Galaxy Browser adopts the recent advances in near-duplicate detection and then synchronizes the detected near-duplicate information with comprehensive background knowledge derived from online external resources. The result …
On The Pooling Of Positive Examples With Ontology For Visual Concept Learning, Shiai Zhu, Chong-Wah Ngo, Yu-Gang Jiang
On The Pooling Of Positive Examples With Ontology For Visual Concept Learning, Shiai Zhu, Chong-Wah Ngo, Yu-Gang Jiang
Research Collection School Of Computing and Information Systems
A common obstacle in effective learning of visual concept classifiers is the scarcity of positive training examples due to expensive labeling cost. This paper explores the sampling of weakly tagged web images for concept learning without human assistance. In particular, ontology knowledge is incorporated for semantic pooling of positive examples from ontologically neighboring concepts. This effectively widens the coverage of the positive samples with visually more diversified content, which is important for learning a good concept classifier. We experiment with two learning strategies: aggregate and incremental. The former strategy re-trains a new classifier by combining existing and newly collected examples, …
Efficient Traffic Crash And Snow Complaint Gis System, Anthony B. Ngo
Efficient Traffic Crash And Snow Complaint Gis System, Anthony B. Ngo
Department of Computer Science and Engineering: Dissertations, Theses, and Student Research
We describe the design and implementation of a traffic crash and snow complaint GIS system developed for the Lincoln Public Works department. We also describe a novel geocoding algorithm that was used to move data from the older Criminal Justice Information System, which is a relational database, to the new GIS system. In addition, we describe the implementation of several indexing algorithms that enable the system to efficiently answer rectangular range queries and queries about the relative locations of moving objects. Finally, in many applications (on-line analysis or mobile GIS), we need to execute spatial query efficiently (fast and small), …
Measuring Stability Of Threshold-Based Feature Selection Techniques, Huanjing Wang, Taghi Khoshgoftaar
Measuring Stability Of Threshold-Based Feature Selection Techniques, Huanjing Wang, Taghi Khoshgoftaar
Computer Science Faculty Publications
Feature selection has been applied in many domains, such as text mining and software engineering. Ideally a feature selection technique should produce consistent out- puts regardless of minor variations in the input data. Re- searchers have recently begun to examine the stability (robustness) of feature selection techniques. The stability of a feature selection method is defined as the degree of agreement between its outputs to randomly-selected subsets of the same input data. This study evaluated the stability of 11 threshold-based feature ranking techniques (rankers) when applied to 16 real-world software measurement datasets of different sizes. Experimental results demonstrate that AUC …
Cs 240: Computer Programming - I, Michael Ondrasek
Cs 240: Computer Programming - I, Michael Ondrasek
Computer Science & Engineering Syllabi
Basic concepts of programming and programming languages are introduced. Emphasis is on problem solving and object oriented programming. This course provides a general introduction to the fundamentals of computer science and 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
Cs 240: Distance Learning Computer Programming - I, Michael Ondrasek
Cs 240: Distance Learning Computer Programming - I, Michael Ondrasek
Computer Science & Engineering Syllabi
Basic concepts of programming and programming languages are introduced. Emphasis is on problem solving and object oriented programming. This course provides a general introduction to the fundamentals of computer science and 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 a lecture and laboratory section. 4 credit hours.
Cs 241: Computer Programming Ii, Jay Dejongh
Cs 241: Computer Programming Ii, Jay Dejongh
Computer Science & Engineering Syllabi
A continuation of CS 240. The emphasis is on data abstraction and software engineering. Prerequisite: CS240.
Cs 209: Computer Programming For Business Ii, Dennis Kellermeier
Cs 209: Computer Programming For Business Ii, Dennis Kellermeier
Computer Science & Engineering Syllabi
CS 209 is the second of a two quarter sequence in programming for business students. It is required for Management Information Science majors. The courses are designed to help students achieve a high degree of facility in intermediate level programming.
Cs 214: Visual Basic Programming, Eric Saunders
Cs 214: Visual Basic Programming, Eric Saunders
Computer Science & Engineering Syllabi
This course will cover the fundamentals of object-oriented computer programming; with an emphasis on design, structure, debugging, and testing. Visual Basic 2010 will be used for developing programs.
Cs 206-01: Computer Software Productivity Tools, John P. Herzog
Cs 206-01: Computer Software Productivity Tools, John P. Herzog
Computer Science & Engineering Syllabi
Focus on learning MS Office software applications including advanced topics in 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 advanced 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 242: Computer Programming Iii, Mateen M. Rizki
Cs 242: Computer Programming Iii, Mateen M. Rizki
Computer Science & Engineering Syllabi
No abstract provided.
Cs 340: Programming Language Workshop In Python, Krishnaprasad Thirunarayan
Cs 340: Programming Language Workshop In Python, Krishnaprasad Thirunarayan
Computer Science & Engineering Syllabi
This course is designed as a self-study in Python. You are expected to learn the language and solve a set of programming problems assigned to you from Budd's text using Python available from http://www.python.org. There are no exams. We officially meet only once in the quarter. However, I will be available in the posted office hours for clarifications and discussions about the programming problems.
Cs 400/600: Data Structures And Software Design, Meilin Liu
Cs 400/600: Data Structures And Software Design, Meilin Liu
Computer Science & Engineering Syllabi
This is a fundamental course for students majoring in Computer Science. Students will learn: basic algorithm analysis techniques; asymptotic complexity; big-0 and big-Omega notations; efficient algorithms for discrete structures including lists, trees, stacks, and graphs; fundamental computing algorithms including sorting, searching, and hashing techniques.
Cs 400/600: Date Structures And Algorithms, Keke Chen
Cs 400/600: Date Structures And Algorithms, Keke Chen
Computer Science & Engineering Syllabi
This course will cover the introduction to the fundamentals of algorithm design and analysis, the implementation of classical data structures and control structures, and the basic problem solving techniques.
Cs 415: Social Implications Of Computing, Leo Finkelstein
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
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 in strings/sentences: the syntax of languages can be defined using grammars and the patterns can be 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 mechanisms and pattern recognition devices. The text will be the third edition of Languages and Machines: An Introduction to the Theory o/Computer Science, by Thomas Sudkamp.
Cs 475/675-01: Web Information Systems, Amit P. Sheth
Cs 475/675-01: Web Information Systems, Amit P. Sheth
Computer Science & Engineering Syllabi
No abstract provided.
Cs 499/699: Cloud Computing, Keke Chen
Cs 499/699: Cloud Computing, Keke Chen
Computer Science & Engineering Syllabi
This is an introductory course to cloud computing. In this course, we will explore a few aspects of cloud computing: distributed data crunching with MapReduce, cloud and datacenter filesystems, virtualization, cloud security&privacy, Amazon Web Services, and interactive web-based applications. Students are expected to finish several mini projects, read some papers, and take the final exam. Participation in the class discussion is strongly encouraged. Guest speakers might be invited for some particular topics. (3Hours Lecture + 1 Hour lab).
Cs 780: Compiler Design And Construction I, Krishnaprasad Thirunarayan
Cs 780: Compiler Design And Construction I, Krishnaprasad Thirunarayan
Computer Science & Engineering Syllabi
This course deals with the theory and practice of compiler design. Topics emphasized are scanning and parsing. If time permits, semantic analysis will also be covered.
Cs 740: Algorithms, Complexity And The Theory Of Computability, Michael L. Raymer
Cs 740: Algorithms, Complexity And The Theory Of Computability, Michael L. Raymer
Computer Science & Engineering Syllabi
No abstract provided.
Cs/Mth 410/610-01: Theoretical Foundations Of Computing, Sarah Gothard
Cs/Mth 410/610-01: Theoretical Foundations Of Computing, Sarah Gothard
Computer Science & Engineering Syllabi
Turing machines; partial-recursive functions; equivalence of computing paradigms; Church-Turing thesis; undecidability; intractability. Four hours lecture.
Cs/Bio 471/671: Algorithms For Bioinformatics, Michael L. Raymer
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/Mth 316/516: Survey Of Numerical Methods For Computational Science, Michael Linger
Cs/Mth 316/516: Survey Of Numerical Methods For Computational Science, Michael Linger
Computer Science & Engineering Syllabi
Introduction to numerical methods used in the sciences and engineering. Included will be methods for interpolation, data smoothing, integration, differentiation, and solution of systems of linear and nonlinear equations. Discussion of sources of error in numerical methods. Applications to science, engineering and applied mathematics are an integral part of the course. Special topics presented as schedule permits. Four hours lecture.
Cs 205-08: Introduction To Computers And Office Productivity Software, Terri Bauer
Cs 205-08: Introduction To Computers And Office Productivity Software, Terri Bauer
Computer Science & Engineering Syllabi
Focus on learning MS Office software applications including intermediate word processing, 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.