Computer Sciences Commons^™

Robust Edge-Detection Algorithm For Runway Edge Detection, Swathi Tandra

Electrical & Computer Engineering Theses & Dissertations

Fog and other such weather conditions hamper the visibility of runway surfaces and any obstacles present on the runway, creating a situation where a pilot may not be able to safely land the aircraft. Assisting the pilot to land the aircraft safely in such conditions is an active area of research. A new method is being investigated that combines non-linear image enhancement with classification of runway edges to detect objects on the runway. The image is segmented into runway and non-runway regions, and objects that are found in the runway regions are deemed to constitute potential hazards. For runway edge …

Workshop Report — Crawdad Workshop 2007, Jihwang Yeo, David Kotz, Tristan Henderson

Dartmouth Scholarship

Wireless network researchers are hungry for data about how real users, applications, and devices use real networks under real network conditions. CRAWDAD, the Community Resource for Archiving Wireless Data at Dartmouth, is an NSF-funded project that is building a wireless network data archive for the research community. We host wireless data, and provide tools and documents to make it easy to collect and use wireless network data. We hope that this resource will help researchers to identify and evaluate real and interesting problems in mobile and pervasive computing. This report outlines the CRAWDAD project and summarizes the third CRAWDAD workshop, …

Description Logic Rules, Markus Krotzsch, Sebastian Rudolph, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We introduce description logic (DL) rules as a new rule-based formalism for knowledge representation in DLs. As a fragment of the Semantic Web Rule Language SWRL, DL rules allow for a tight integration with DL knowledge bases. In contrast to SWRL, however, the combination of DL rules with expressive description logics remains decidable, and we show that the DL SROIQ – the basis for the ongoing standardisation of OWL 2 – can completely internalise DL rules. On the other hand, DL rules capture many expressive features of SROIQ that are not available in simpler DLs yet. While reasoning in SROIQ …

Boosting With Incomplete Information, Gholamreza Haffari, Yang Wang, Shaojun Wang, Greg Mori, Feng Jiao

Kno.e.sis Publications

In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we present a boosting approach that integrates features with incomplete information and those with complete information to form a strong classifier. By introducing hidden variables to model missing information, we form loss functions that combine fully labeled data with partially labeled data to effectively learn normalized and unnormalized models. The primal problems of the proposed optimization problems with these loss functions are provided to show their close relationship and the motivations behind them. …

Cs 242: Computer Programming Iii, Guozhu Dong

Computer Science & Engineering Syllabi

No abstract provided.

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will introduce fundamental concepts and paradigms underlying the design of modern programming languages. For concreteness, we study the details of an object-oriented language (e.g. Java), and a functional language (e.g., Scheme). The overall goal is to enable comparison and evaluation of existing languages. The programming assignments will be coded in Java 5 and in Scheme.

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 240: Computer Programming I, Travis E. Doom

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on structured programming and stepwise refinement. Prerequisite: MTH 130 or MPL 5.

Cs 205-02: Introduction To Computers And Office Productivity Software, John P. Herzog

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 720-01: Computer Architecture I, Soon M. Chung

Computer Science & Engineering Syllabi

Review of sequential computer architecture and study of parallel computers. Topics include memory hierarchy, reduced instruction set computer; pipeline processing, multiprocessing, various parallel computers, interconnection networks, and fault-tolerant computing. 3 hours lecture and 2 hours lab.

Ceg 233-01: Linux And Windows, Bin Wang

Computer Science & Engineering Syllabi

Introduction to Linux and Windows systems. GUI and Windowing Systems. Files and Directories. Ownership and Sharing. Programs and Processes. System calls, Libraries. Loading. Dynamic linking. Command Line Shells. Scripting languages. Regular expressions. Clients and Servers. Web browser clients and HTTPS. System Administration. 4 credit hours. 3 hours labs, 2 hours labs. Prerequisites: None.

Ceg 460/660-01: Computer Engineering, Eric Maston

Computer Science & Engineering Syllabi

This course is concerned with the techniques of designing and constructing large program. 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 720-01: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 433/633-01: Operating Systems, Yong Pei

Computer Science & Engineering Syllabi

This course provides an introduction to operating system design. Topics to be covered include: Operating system structures, Operating system interfaces, Process management and scheduling, Inter-process communication, File systems and Memory management and Device access.

Ceg 360/560-01: Digital System Design, Travis E. Doom

Computer Science & Engineering Syllabi

Design of digital systems. Topics include flip-flops, registers, counters, programmable logic devices, memory devices, register-level design, and microcomputer system organization. Students must show competency in the design of digital systems. 3 hours lecture, 2 hours lab. Prerequisite: CEG 260.

Cs 241: Computer Programming Ii, Eric Maston

Computer Science & Engineering Syllabi

This is the second course in the Introduction to Computer Programming series. A continuation of CS240. The emphasis is on data abstraction and software development. Prerequisite: CS240.

Information Technology’S Influence On Productivity, Jason Smith

Student Work

Previous research has had mixed results correlating information technology investments to increases in productivity. This research surveyed the perceptions of information technology managers to determine the impact that information technology, decentralized decision making, and improved business processes have on productivity. It concluded that information technology’s influence on productivity is to magnify the effect of decentralized decision making and improved business processes.

Optimizing Product Line Designs: Efficient Methods And Comparisons, Alexandre Belloni, Robert Freund, Matthew Selove, Duncan Simester

Business Faculty Articles and Research

We take advantage of recent advances in optimization methods and computer hardware to identify globally optimal solutions of product line design problems that are too large for complete enumeration. We then use this guarantee of global optimality to benchmark the performance of more practical heuristic methods. We use two sources of data: (1) a conjoint study previously conducted for a real product line design problem, and (2) simulated problems of various sizes. For both data sources, several of the heuristic methods consistently find optimal or near-optimal solutions, including simulated annealing, divide-and-conquer, product-swapping, and genetic algorithms.

Unfolding Manhattan Towers, Mirela Damian, Robin Flatland, Joseph O'Rourke

Computer Science: Faculty Publications

We provide an algorithm for unfolding the surface of any orthogonal polyhedron that falls into a particular shape class we call Manhattan Towers, to a nonoverlapping planar orthogonal polygon. The algorithm cuts along edges of a 4×5×1 refinement of the vertex grid.

Congestion Mitigation In Wireless Sensor Networks Using Single-Hop Backpressure Algorithm, Vijay Shekar Mangilipalli Gangu Sham

Electrical & Computer Engineering Theses & Dissertations

Wireless sensor networks consist of a group of small components with limited resources allocated to sense the environment and transmit data to the user or interpreter. This concept is technically evolved from Sensors that are basically used to sense the environment around and collect data based on the sensing application incorporated in them. An extension to functionality of the sensors leads to the concept of sensor networks, where, in addition to gathering information at individual sensors, the data is processed and transmitted to a central station or Base station. This concept of transmitting the information from one node to the …

Extending The Network Life Time In Wsn Using Energy Efficient Algorithm, Venkata Sesha Sai Koundinya Goparaju

Electrical & Computer Engineering Theses & Dissertations

Wireless Sensor networks have many potential applications. These wireless sensor networks necessitate specific design requirements of which energy efficiency is vital. The sensor networks consist of sensor nodes that operate on battery power, and replacement of these batteries is very often a strenuous task, since networks are deployed in areas where the act of replacing the batteries proves impractical.

With the limited available energy of sensor nodes, most of the energy is drained during communication. An energy efficient routing algorithm can prolong the lifetime of the network by gradually depleting the nodes in the network. Many of the routing protocols …

Integer Ratio Logarithm Based Edge Detection For Runway Hazard Detection, Sri Satya Vardhan Gogineni

Electrical & Computer Engineering Theses & Dissertations

As air traffic is growing in leaps and bounds every day, flying safe has been a major concern in day to day life. Aviation safety is always dependent on the performance of the pilot and air traffic controllers. The very involvement of human discretion introduces judgment as a component of a safe takeoff and landing. A convenient and immediate alternative would be the use of technology to alleviate the problem. Several algorithms have been developed to solve this problem. However, most computer vision algorithms leave the task of interpreting the end data unaddressed. Juggling the myriad tasks during landing and …

Self-Tuning Query Mesh For Adaptive Multi-Route Query Processing, Rimma V. Nehme, Elke A. Rundersteiner, Elisa Bertino

Department of Computer Science Technical Reports

No abstract provided.

On Profiling Blogs With Representative Entries, Jinfeng Zhuang, Steven C. H. Hoi, Aixin Sun

Research Collection School Of Computing and Information Systems

With an explosive growth of blogs, information seeking in blogosphere becomes more and more challenging. One example task is to find the most relevant topical blogs against a given query or an existing blog. Such a task requires concise representation of blogs for effective and efficient searching and matching. In this paper, we investigate a new problem of profiling a blog by choosing a set of m most representative entries from the blog, where m is a predefined number that is application-dependent. With the set of selected representative entries, applications on blogs avoid handling hundreds or even thousands of entries …

Estimating Local Optimums In Em Algorithm Over Gaussian Mixture Model, Zhenjie Zhang, Bing Tian Dai, Anthony K.H. Tung

Research Collection School Of Computing and Information Systems

EM algorithm is a very popular iteration-based method to estimate the parameters of Gaussian Mixture Model from a large observation set. However, in most cases, EM algorithm is not guaranteed to converge to the global optimum. Instead, it stops at some local optimums, which can be much worse than the global optimum.

Tree-Based Partition Querying: A Methodology For Computing Medoids In Large Spatial Datasets, Kyriakos Mouratidis, Dimitris Papadias, Spiros Papadimitriou

Research Collection School Of Computing and Information Systems

Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous emerging fields, such as location based services and sensor networks. Since the k-medoid problem is NP hard, all existing work deals with approximate solutions on relatively small datasets. This paper aims at efficient methods for very large spatial databases, motivated by: (i) the high and ever increasing availability of spatial data, and (ii) the need for novel query types and improved services. The proposed solutions exploit the intrinsic grouping properties of a data partition index in order …

Event Dissemination Via Group-Aware Stream Filtering, Ming Li, David Kotz

Dartmouth Scholarship

We consider a distributed system that disseminates high-volume event streams to many simultaneous monitoring applications over a low-bandwidth network. For bandwidth efficiency, we propose a group-aware stream filtering approach, used together with multicasting, that exploits two overlooked, yet important, properties of monitoring applications: 1) many of them can tolerate some degree of “slack” in their data quality requirements, and 2) there may exist multiple subsets of the source data satisfying the quality needs of an application. We can thus choose the “best alternative” subset for each application to maximize the data overlap within the group to best benefit from multicasting. …

Mobile Interaction Design: Integrating Individual And Organizational Perspectives, Peter Tarasewich, Jun Gong, Fiona Fui-Hoon Nah, David Dewester

Research Collection School Of Computing and Information Systems

While mobile computing provides organizations with many information systems implementation alternatives, it is often difficult to predict the potential benefits, limitations, and problems with mobile applications. Given the inherent portability of mobile devices, many design and use issues can arise which do not exist with desktop systems. While many existing rules of thumb for design of stationary systems apply to mobile systems, many new ones emerge. Issues such as the security and privacy of information take on new dimensions, and potential conflicts can develop when a single mobile device serves both personal and business needs. This paper identifies potential issues …

H-Dpop: Using Hard Constraints For Search Space Pruning In Dcop, Akshat Kumar, Adrian Petcu, Boi Faltings

Research Collection School Of Computing and Information Systems

In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together in fewer messages, which produce much less networking overhead than search. Nevertheless, these messages are exponential in size. The basic DPOP always communicates all possible assignments, even when some of them may be inconsistent due to hard constraints. Many real problems contain hard constraints that significantly reduce the space of feasible assignments. This paper introduces H-DPOP, a hybrid algorithm that is based on DPOP, which uses Constraint Decision Diagrams (CDD) to rule out infeasible assignments, and thus compactly …

Semi-Supervised Ensemble Ranking, Steven C. H. Hoi, Rong Jin

Research Collection School Of Computing and Information Systems

Ranking plays a central role in many Web search and information retrieval applications. Ensemble ranking, sometimes called meta-search, aims to improve the retrieval performance by combining the outputs from multiple ranking algorithms. Many ensemble ranking approaches employ supervised learning techniques to learn appropriate weights for combining multiple rankers. The main shortcoming with these approaches is that the learned weights for ranking algorithms are query independent. This is suboptimal since a ranking algorithm could perform well for certain queries but poorly for others. In this paper, we propose a novel semi-supervised ensemble ranking (SSER) algorithm that learns query-dependent weights when combining …