Computer Sciences Commons^™

Ceg 479/679-01: Computer Animation, Thomas Wischgoll

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 416-01: Matrix Computations, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is a survey of numerical methods in linear algebra for application to problems in engineering and the sciences. Emphasis is on using modern software tools on high performance computing systems. This course covers the mathematics of linear equations, eigenvalue problems, singular value decomposition, and least squares. Material covered will be relevant to applications areas such as structural analysis, heat transfer, neural networks, mechanical vibrations, and image processing in biomedical engineering. A familiarity with MATLAB is useful, and the ability to program in languages such as CIC++ or Fortran is very important. A basic knowledge of matrix algebra is …

Cs 240: Computer Programming I, Vanessa Starkey

Computer Science & Engineering Syllabi

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

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

Computer Science & Engineering Syllabi

No abstract provided.

Cs 772: Advanced Natural Language Processing Concepts, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.

Cs 207: Advanced Office Productivity Ii, Amanda Hood

Computer Science & Engineering Syllabi

This course covers post-advanced microcomputer applications including Microsoft Office Word 2007, Excel 2007, Access 2007, and PowerPoint 2007. Topics include: creating an online form, working with macros and Visual Basic for Applications (VBA), working with a master document, and index and a table of contents, linking an Excel, creating a PivotTable List, advanced Access report and form techniques, and creating a multipage form, administering a database system, creating a self-running presentation containing shapes, templates, and clips.

A Pda Intervention To Sustain Smoking Cessation In Clients With Socioeconomic Vulnerability, Lynne Buchanan, Deepak Khazanchi

Information Systems and Quantitative Analysis Faculty Publications

This article describes a pilot study to explore use of a personal digital assistant (PDA) to sustain smoking cessation after discharge in clients with socioeconomic vulnerability. The major aim is to describe technology acceptance (perceived ease of use, usefulness, and attitude), portability, technical difficulty, satisfaction, and use time. The sample includes 31 medical surgical clients with average age of 47.35 (±13.3), average household income of $13,629 (±8,204), average number in the household of 2.67 (±2.22), and average education of 11th grade. The results demonstrate mean use time of 9.28 (±3.23) hr, or about 1 hr over 8 weeks. Technology acceptance …

Importance Sampling For Dispersion-Managed Solitons, Elaine T. Spiller, Gino Biondini

Mathematics, Statistics and Computer Science Faculty Research and Publications

The dispersion-managed nonlinear Schrödinger (DMNLS) equation governs the long-term dynamics of systems which are subject to large and rapid dispersion variations. We present a method to study large, noise-induced amplitude and phase perturbations of dispersion-managed solitons. The method is based on the use of importance sampling to bias Monte Carlo simulations toward regions of state space where rare events of interest—large phase or amplitude variations—are most likely to occur. Implementing the method thus involves solving two separate problems: finding the most likely noise realizations that produce a small change in the soliton parameters, and finding the most likely way that …

How To Improve Project Management For Agile Federation Development, Priyanka Kotikalpudi

Engineering Management & Systems Engineering Theses & Dissertations

Developing a simulation federation out of a variety of heterogeneous simulation solutions is a complex task requiring very effective project management support in order to accomplish the common objectives and goals of this M&S federation. This thesis study conducts a detailed survey of available literature to identify the project management methods that can be extended to be applied to manage the development of simulation systems. The literature review led to the following two main results: (a) in general, there is insufficient literature dealing with M&S challenges for project management, (b) in particular, the two challenges of often changing requirements leading …

Factors Affecting College Students’ Knowledge And Opinions Of Genetically Modified Foods, Chad Laux, Gretchen A. Mosher, Steven A. Freeman

Faculty Publications

The use of biotechnology in food and agricultural applications has increased greatly during the past decade and is considered by many to be a controversial topic. Drawing upon a previous national study, a new survey was conducted of U.S. and international college students at a large, land-grant, Research University to determine factors that may affect opinions about genetically modified (GM) food products. Factors examined included nationality, discipline area of study, perceptions of safety, and awareness and levels of acceptance regarding GM food. Results indicated students born outside the United States had more negative opinions about genetically modified foods than did …

An Automated Grader For Short Answer Responses, Sami Saqer

Mathematics, Statistics, and Computer Science Honors Projects

Computers routinely grade multiple-choice questions by simply matching them to an answer key. Can they effectively score essay exams? This report examines an automated technique for grading short answer responses, using a grading system I have constructed. This system assigns a grade to an student answer based on its similarity to a model answer provided by an instructor. Similarity is measured using 1) the semantic similarity between isolated words, and 2) the similarity between the order of those words. The performance of the system was evaluated by scoring actual exam questions and comparing the computer-assigned grades to those given by …

Optimal Matching Between Spatial Datasets Under Capacity Constraints, Hou U Leong, Kyriakos Mouratidis, Man Lung Yiu, Nikos Mamoulis

Research Collection School Of Computing and Information Systems

Consider a set of customers (e.g., WiFi receivers) and a set of service providers (e.g., wireless access points), where each provider has a capacity and the quality of service offered to its customers is anti-proportional to their distance. The capacity constrained assignment (CCA) is a matching between the two sets such that (i) each customer is assigned to at most one provider, (ii) every provider serves no more customers than its capacity, (iii) the maximum possible number of customers are served, and (iv) the sum of Euclidean distances within the assigned provider-customer pairs is minimized. Although max-flow algorithms are applicable …

What Is Twitter, A Social Network Or A News Media?, Haewoon Kwak, Changhyun Lee, Hosung: Moon Park

Research Collection School Of Computing and Information Systems

Twitter, a microblogging service less than three years old, commands more than 41 million users as of July 2009 and is growing fast. Twitter users tweet about any topic within the 140-character limit and follow others to receive their tweets. The goal of this paper is to study the topological characteristics of Twitter and its power as a new medium of information sharing.We have crawled the entire Twitter site and obtained 41.7 million user profiles, 1.47 billion social relations, 4,262 trending topics, and 106 million tweets. In its follower-following topology analysis we have found a non-power-law follower distribution, a short …

Mashup Environments In Software Engineering, Lars Grammel, Christoph Treude, Margaret-Anne Storey

Research Collection School Of Computing and Information Systems

Too often, software engineering (SE) tool research is focused on creating small, stand-alone tools that address rarely understood developer needs. We believe that research should instead provide developers with flexible environments and interoperable tools, and then study how developers appropriate and tailor these tools in practice. Although there has been some prior work on this, we feel that flexible tool environments for SE have not yet been fully explored. In particular, we propose adopting the Web 2.0 idea of mashups and mashup environments to support SE practitioners in analytic activities involving multiple information sources.

Volume 03, Cheryl Peck, Charles Hoever, Longwood Theater Department, Brittany Anderson, J. Ervin Sheldon, Richard Hayden, Yuri Calustro, Candice Fleming, Rebecca Franklin, Ashley Yocum, Danielle M. Jagoda, Cristina M. Valdivieso, Jameka Jones, Amy Ellis, Ashley Maser, Erikk Shupp, Jamie Yurasits, Joshua Davis, Alexander Leonhart, Kenny Wolfe, Sally Meadows, J. Haley, Amy Jackson, Morgan Howard, Adrienne Heinbaugh, Melissa Dorton, Ciarra Stalker

Incite: The Journal of Undergraduate Scholarship

Introduction from Dean Dr. Charles Ross

Little Shop of Horrors by Longwood Theater Department

Who Has the Hottest Hotsauce in Farmville: A Quantitative Comparison of Sauces from Local Restaurants by Cheryl Peck and Charles Hoever

Precipitation Effects on the Growth of White Oaks and Virginia Pines on the Mt. Vernon Plantation by Brittany Anderson

Design and Synthesis of Novel Ion Binding Molecules for Self-Assembly and Sensing Applications by J. Ervin Sheldon

A Statistical Analysis of Algorithms for Playing SameGame by Richard Hayden

Intersecting Cylinders at Arbitrary Angles by Yuri Calustro

Putting a Foot in the Revolving Door: Strategies for Reducing …

A Verification System For Interval-Based Specification Languages, Chunqing Chen, Jin Song Dong, Jun Sun, Andrew P. Martin

Research Collection School Of Computing and Information Systems

Interval-based specification languages have been used to formally model and rigorously reason about real-time computing systems. This usually involves logical reasoning and mathematical computation with respect to continuous or discrete time. When these systems are complex, analyzing their models by hand becomes error-prone and difficult. In this article, we develop a verification system to facilitate the formal analysis of interval-based specification languages with machine-assisted proof support. The verification system is developed using a generic theorem prover, Prototype Verification System (PVS). Our system elaborately encodes a highly expressive set-based notation, Timed Interval Calculus (TIC), and can rigorously carry out the verification …

Generating Synonyms Based On Query Log Data, Stelios Paparizos, Tao Cheng, Hady W. Lauw

Research Collection School Of Computing and Information Systems

An approach is described for generating synonyms to supplement at least one information item, such as, in one case, a set of related items. The approach can involve an expansion phase, a clean-up phase, and a reduction phase. In the expansion phase, the approach identifies, for each related item, a set of initial synonym candidates. In the clean-up phase, the approach removes noise from the set of initial synonym candidates (if such noise exists), to provide a set of filtered synonym candidate items. In the reduction phase, the approach ranks and applies a threshold (or thresholds) to the set of …

Adaptive Ensemble Classification In P2p Networks, Hock Hee Ang, Vivekanand Gopalkrishnan, Steven C. H. Hoi, Wee Keong Ng

Research Collection School Of Computing and Information Systems

Classification in P2P networks has become an important research problem in data mining due to the popularity of P2P computing environments. This is still an open difficult research problem due to a variety of challenges, such as non-i.i.d. data distribution, skewed or disjoint class distribution, scalability, peer dynamism and asynchronism. In this paper, we present a novel P2P Adaptive Classification Ensemble (PACE) framework to perform classification in P2P networks. Unlike regular ensemble classification approaches, our new framework adapts to the test data distribution and dynamically adjusts the voting scheme by combining a subset of classifiers/peers according to the test data …

Shifting Inference Control To User Side: Architecture And Protocol, Yanjiang Yang, Yingjiu Li, Robert H. Deng, Feng Bao

Research Collection School Of Computing and Information Systems

Inference has been a longstanding issue in database security, and inference control, aiming to curb inference, provides an extra line of defense to the confidentiality of databases by complementing access control. However, in traditional inference control architecture, database server is a crucial bottleneck, as it enforces highly computation-intensive auditing for all users who query the protected database. As a result, most auditing methods, though rigorously studied, are not practical for protecting large-scale real-world database systems. In this paper, we shift this paradigm by proposing a new inference control architecture, entrusting inference control to each user's platform that is equipped with …

Cold War Origins Of The International Federation For Information Processing, Ksenia Tatarchenko

Research Collection College of Integrative Studies

The International Federation for Information Processing (IFIP) was born as a nongovernmental federation with the main goal of bringing together computer professionals from countries in the East and West. This article examines the Cold War context of the IFIP's origins and the mechanisms its founders used to reconcile computing and politics and to construct computing as an international discipline.

Practical Id-Based Encryption For Wireless Sensor Network, Cheng-Kang Chu, Joseph K. Liu, Jianying Zhou, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

In this paper, we propose a new practical identity-based encryption scheme which is suitable for wireless sensor network (WSN). We call it Receiver-Bounded Online/Offline Identity-based Encryption (RB-OOIBE). It splits the encryption process into two parts -- the offline and the online part. In the offline part, all heavy computations are done without the knowledge of the receiver's identity and the plaintext message. In the online stage, only light computations such as modular operation and symmetric key encryption are required, together with the receiver's identity and the plaintext message. Moreover, since each offline ciphertext can be re-used for the same receiver, …

Policy-Driven Distributed And Collaborative Demand Response In Multi-Domain Commercial Buildings, Archan Misra, Henning Schulzrinne

Research Collection School Of Computing and Information Systems

Enabling a sophisticated Demand Response (DR) framework, whereby individual consumers adapt their electricity consumption in response to price variations, is a major objective of the emerging Smart Grid. We first point out why the current model, of EMS-based centralized control of a static repository of high load appliances, is inappropriate for supporting DR in future commercial buildings and campuses, where the consuming appliances are controlled by multiple users. To enable DR in such multi-domain environments, we envision a more collaborative and autonomous model, where a large set of heterogeneous smart electrical devices autonomously self-organize and negotiate their collective DR. Enabling …

Playing With Recognizers: A Call For An Extensible Editor, Richard C. Davis

Research Collection School Of Computing and Information Systems

The sketch recognition interface community has not produced a -killer‖ application, because access to sketch recognition technology has been too restricted. If recognition technologies were more freely available for experimentation, powerful new applications would evolve. This paper proposes a rough architecture for an extensible graphical editor that facilitates collaboration between recognition technology developers, user interface designers, and early adopters of sketch recognition interfaces. Only by serving all three communities will we reach the critical mass necessary for killer applications to emerge.

Finding Influentials Based On The Temporal Order Of Information Adoption In Twitter, Changhyun Lee, Haewoon Kwak, Hosung Park, Sue Moon

Research Collection School Of Computing and Information Systems

Twitter offers an explicit mechanism to facilitate information diffusion and has emerged as a new medium for communication. Many approaches to find influentials have been proposed, but they do not consider the temporal order of information adoption. In this work, we propose a novel method to find influentials by considering both the link structure and the temporal order of information adoption in Twitter. Our method finds distinct influentials who are not discovered by other methods.

Continuous Spatial Assignment Of Moving Users, Hou U Leong, Kyriakos Mouratidis, Nikos Mamoulis

Research Collection School Of Computing and Information Systems

Consider a set of servers and a set of users, where each server has a coverage region (i.e., an area of service) and a capacity (i.e., a maximum number of users it can serve). Our task is to assign every user to one server subject to the coverage and capacity constraints. To offer the highest quality of service, we wish to minimize the average distance between users and their assigned server. This is an instance of a well-studied problem in operations research, termed optimal assignment. Even though there exist several solutions for the static case (where user locations are fixed), …

Efficient Skyline Maintenance For Streaming Data With Partially-Ordered Domains, Yuan Fang, Chee-Yong Chan

Research Collection School Of Computing and Information Systems

We address the problem of skyline query processing for a count-based window of continuous streaming data that involves both totally- and partially-ordered attribute domains. In this problem, a fixed-size buffer of the N most recent tuples is dynamically maintained and the key challenge is how to efficiently maintain the skyline of the sliding window of N tuples as new tuples arrive and old tuples expire. We identify the limitations of the state-of-the-art approach STARS, and propose two new approaches, STARS+ and SkyGrid, to address its drawbacks. STARS+ is an enhancement of STARS with three new optimization techniques, while SkyGrid is …

Data Mining Based Predictive Models For Overall Health Indices, Ridhima Rajkumar, Kyong Jin Shim, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

In this study, we infer health care indices of individuals using their pharmacy medical and prescription claims. Specifically, we focus on the widely used Charlson Index. We use data mining techniques to formulate the problem of classifying Charlson Index (CI) and build predictive models to predict individual health index score. First, we present comparative analyses of several classification algorithms. Second, our study shows that certain ensemble algorithms lead to higher prediction accuracy in comparison to base algorithms. Third, we introduce cost-sensitive learning to the classification algorithms and show that the inclusion of cost-sensitive learning leads to improved prediction accuracy. The …

Algorithms For Constrained K-Nearest Neighbor Queries Over Moving Object Trajectories, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li, Chun Chen

Research Collection School Of Computing and Information Systems

An important query for spatio-temporal databases is to find nearest trajectories of moving objects. Existing work on this topic focuses on the closest trajectories in the whole data space. In this paper, we introduce and solve constrained k-nearest neighbor (CkNN) queries and historical continuous CkNN (HCCkNN) queries on R-tree-like structures storing historical information about moving object trajectories. Given a trajectory set D, a query object (point or trajectory) q, a temporal extent T, and a constrained region CR, (i) a CkNN query over trajectories retrieves from D within T, the k (≥ 1) trajectories that lie closest to q and …

Mining Diversity On Networks, Lu Liu, Feida Zhu, Chen Chen, Xifeng Yan, Jiawei Han, Philip Yu, Shiqiang Yang

Research Collection School Of Computing and Information Systems

Despite the recent emergence of many large-scale networks in different application domains, an important measure that captures a participant’s diversity in the network has been largely neglected in previous studies. Namely, diversity characterizes how diverse a given node connects with its peers. In this paper, we give a comprehensive study of this concept. We first lay out two criteria that capture the semantic meaning of diversity, and then propose a compliant definition which is simple enough to embed the idea. An efficient top-k diversity ranking algorithm is developed for computation on dynamic networks. Experiments on both synthetic and real datasets …

Do You Trust To Get Trust? A Study Of Trust Reciprocity Behaviors And Reciprocal Trust Prediction, Viet-An Nguyen, Ee Peng Lim, Hwee Hoon Tan, Jing Jiang, Aixin Sun

Research Collection School Of Computing and Information Systems

Trust reciprocity, a special form of link reciprocity, exists in many networks of trust among users. In this paper, we seek to determine the extent to which reciprocity exists in a trust network and develop quantitative models for measuring reciprocity and reciprocity related behaviors. We identify several reciprocity behaviors and their respective measures. These behavior measures can be employed for predicting if a trustee will return trust to her trustor given that the latter initiates a trust link earlier. We develop for this reciprocal trust prediction task a number of ranking method and classification methods, and evaluated them on an …