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

Computer Sciences Commons™

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

2009

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 451 - 480 of 1345

Full-Text Articles in Computer Sciences

Cs 205: Introduction To Computers And Office Productivity Software, Karen Meyer Jul 2009

Cs 205: Introduction To Computers And Office Productivity Software, Karen Meyer

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.

Go to article

Ceg 220-01: Introduction To C Programming For Engineers - I, Ronald F. Taylor Jul 2009

Ceg 220-01: Introduction To C Programming For Engineers - I, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course provides a general introduction to computers as a problem-solving tool using the C programming language. Emphasis is on algorithms and techniques useful to engineers. Topics include data representation, debugging, and program verification. Some programming assignments may involve complex arithmetic and trigonometric and exponential functions. 4 credit hours. The course includes a scheduled laboratory section for which you must register.

Go to article

Ceg 720-01: Computer Architecture, Jack Jean Jul 2009

Ceg 720-01: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 433-01: Operating Systems, Sarah Gothard Jul 2009

Ceg 433-01: Operating Systems, Sarah Gothard

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 403/603-01: Personal Area Networks, Yong Pei Jul 2009

Ceg 403/603-01: Personal Area Networks, Yong Pei

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 730-01: Distributed Computing Principles, Prabhaker Mateti Jul 2009

Ceg 730-01: Distributed Computing Principles, Prabhaker Mateti

Computer Science & Engineering Syllabi

Communicating sequential processes, clients and servers, remote procedure calls, stub generation, weak and strong semaphores, split-binary-semaphores, and distributed termination. Example languages: SR, Linda.

Go to article

Cs 205-01: Introduction To Computers And Office Productivity Software 2007, M. K. Reynolds Jul 2009

Cs 205-01: Introduction To Computers And Office Productivity Software 2007, M. K. Reynolds

Computer Science & Engineering Syllabi

Focus on learning MS Office software applications including word processing (intermediate), spreadsheets, databases, 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.

Go to article

Cs 240: Introduction To Computer Science I, Vanessa Starkey Jul 2009

Cs 240: Introduction To Computer Science I, Vanessa Starkey

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.

Go to article

Holism And Human History, Martin Zwick Jul 2009

Holism And Human History, Martin Zwick

Complex Systems Faculty Publications and Presentations

This paper uses a systems-theoretic model to structure an account of human history. According to the model, a process, after its beginning and early development, often reaches a critical stage where it encounters some limitation. If the limitation is overcome, development does not face a comparable challenge until a second critical juncture is reached, where obstacles to further advance are more severe. At the first juncture, continued development requires some complexity-managing innovation; at the second, it needs some event of systemic integration in which the old organizing principle of the process is replaced by a new principle. Overcoming the first …

Go to article

Evolution Versus Revolution As A Strategy For Thin Client Acceptance: Case Study, Paul Doyle, Mark Deegan, Ciaran O'Driscoll Jul 2009

Evolution Versus Revolution As A Strategy For Thin Client Acceptance: Case Study, Paul Doyle, Mark Deegan, Ciaran O'Driscoll

Conference papers

Thin Clients have evolved from simple text based CRT dumb terminal devices in the 1960s, into a sophisticated architecture encompassing hardware, software, networks and protocols. However despite this recent evolution the Thin Client model has yet to re-emerge as a relevant design in an IT industry where Fat Clients (desktops and laptops) thrive. This paper describes two case studies performed within the Technological University Dublin School of Computing, focused on the issue of student acceptance of this technology. The first case study provides a dedicated single service Thin Client implementation, while the second case study adopts a process of coexistence …

Go to article

Finding Alternatives To The Hard Disk Drive For Virtual Memory, Bruce Albert Embry Jul 2009

Finding Alternatives To The Hard Disk Drive For Virtual Memory, Bruce Albert Embry

Theses and Dissertations

Current computer systems fill the demand of operating systems and applications for ever greater amounts of random access memory by paging the least recently used data to the hard disk drive. This paging process is called "virtual memory," to indicate that the hard disk drive is used to create the illusion that the computer has more random access memory than it actually has. Unfortunately, the fastest hard disk drives are over five orders of magnitude slower than the DRAM they are emulating. When the demand for memory increases to the point that processes are being continually saved to disk and …

Go to article

A Simulation Study Of Convergence Speed For Distributed Codeword Adaptation Algorithms In Cdma Wireless Systems, Sahana Maharjan Jul 2009

A Simulation Study Of Convergence Speed For Distributed Codeword Adaptation Algorithms In Cdma Wireless Systems, Sahana Maharjan

Electrical & Computer Engineering Theses & Dissertations

In this thesis we present a side-by-side comparison of interference avoidance (IA) algorithms for distributed codeword adaptation in Code Division Multiple Access (CDMA) systems. In CDMA systems, the interference is determined by the values of the cross-correlation of codewords assigned to users, and various algorithms can be used for codeword optimization. The IA algorithms for codeword adaptation considered are the eigen-algorithm, the Minimum Mean Square Error (MMSE) update, and the adaptive IA algorithm, for which we investigate convergence speed using the extensive simulations of several uplink CDMA system scenarios. The results of this thesis were presented at the Fourth IEEE …

Go to article

Freedom Of Choice As A Motivational Factor In Active Learning, Atanas Radenski Jul 2009

Freedom Of Choice As A Motivational Factor In Active Learning, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

Freedom to choose what, when, and how to contribute in a learning process can motivate students to actively engage and achieve more in their studies. However, freedom of choice complicates course management and may deter instructors from allowing such freedom. Our approach is to utilize existing functionality of course management systems such as Moodle to automatically facilitate and coordinate free student choices and provide much needed relief for instructors at the same time. Using Moodle we have developed novel digital study packs that blend freedom of choice with guidance and control. Our survey shows that assisted freedom of choice is …

Go to article

Spatial Cloaking Revisited: Distinguishing Information Leakage From Anonymity, Kar Way Tan, Yimin Lin, Kyriakos Mouratidis Jul 2009

Spatial Cloaking Revisited: Distinguishing Information Leakage From Anonymity, Kar Way Tan, Yimin Lin, Kyriakos Mouratidis

Research Collection School Of Computing and Information Systems

Location-based services (LBS) are receiving increasing popularity as they provide convenience to mobile users with on-demand information. The use of these services, however, poses privacy issues as the user locations and queries are exposed to untrusted LBSs. Spatial cloaking techniques provide privacy in the form of k-anonymity; i.e., they guarantee that the (location of the) querying user u is indistinguishable from at least k-1 others, where k is a parameter specified by u at query time. To achieve this, they form a group of k users, including u, and forward their minimum bounding rectangle (termed anonymzing spatial region, ASR) to …

Go to article

Verification Of Population Ring Protocols In Pat, Yang Liu, Jun Pang, Jun Sun, Jianhua Zhao Jul 2009

Verification Of Population Ring Protocols In Pat, Yang Liu, Jun Pang, Jun Sun, Jianhua Zhao

Research Collection School Of Computing and Information Systems

The population protocol model has emerged as an elegant paradigm for describing mobile ad hoc networks, consisting of a number of nodes that interact with each other to carry out a computation. One essential property of self-stabilizing population protocols is that all nodes must eventually converge to the correct output value, with respect to all possible initial configurations. It has been shown that fairness constraints play a crucial role in designing population protocols. The Process Analysis Toolkit (PAT) has been developed to perform verifications under different fairness constraints efficiently. In particular, it can handle global fairness, which is required for …

Go to article

Compositemap: A Novel Framework For Music Similarity Measure, Bingjun Zhang, Jialie Shen, Qiaoliang Xiang, Ye Wang Jul 2009

Compositemap: A Novel Framework For Music Similarity Measure, Bingjun Zhang, Jialie Shen, Qiaoliang Xiang, Ye Wang

Research Collection School Of Computing and Information Systems

With the continuing advances in data storage and communication technology, there has been an explosive growth of music information from different application domains. As an effective technique for organizing, browsing, and searching large data collections, music information retrieval is attracting more and more attention. How to measure and model the similarity between different music items is one of the most fundamental yet challenging research problems. In this paper, we introduce a novel framework based on a multimodal and adaptive similarity measure for various applications. Distinguished from previous approaches, our system can effectively combine music properties from different aspects into a …

Go to article

Unified Behavior Framework For Reactive Robot Control, Brian G. Woolley, Gilbert L. Peterson Jul 2009

Unified Behavior Framework For Reactive Robot Control, Brian G. Woolley, Gilbert L. Peterson

Faculty Publications

Behavior-based systems form the basis of autonomous control for many robots. In this article, we demonstrate that a single software framework can be used to represent many existing behavior based approaches. The unified behavior framework presented, incorporates the critical ideas and concepts of the existing reactive controllers. Additionally, the modular design of the behavior framework: (1) simplifies development and testing; (2) promotes the reuse of code; (3) supports designs that scale easily into large hierarchies while restricting code complexity; and (4) allows the behavior based system developer the freedom to use the behavior system they feel will function the best. …

Go to article

Failure Detectors For Wireless Sensor-Actuator Systems, Hamza A. Zia, Nigamanth Sridhar, Shivakumar Sastry Jul 2009

Failure Detectors For Wireless Sensor-Actuator Systems, Hamza A. Zia, Nigamanth Sridhar, Shivakumar Sastry

Electrical and Computer Engineering Faculty Publications

Wireless sensor-actuator systems (WSAS) offer exciting opportunities for emerging applications by facilitating fine-grained monitoring and control, and dense instrumentation. The large scale of such systems increases the need for such systems to tolerate and cope with failures, in a localized and decentralized manner. We present abstractions for detecting node failures and link failures caused by topology changes in a WSAS. These abstractions were designed and implemented as a set of reusable components in nesC under TinyOS. Results, which demonstrate the performance and viability of the abstractions, based on experiments on an 80 node testbed are presented. In the …

Go to article

Large-Scale Near-Duplicate Web Video Search: Challenge And Opportunity, Wan-Lei Zhao, Song Tan, Chong-Wah Ngo Jul 2009

Large-Scale Near-Duplicate Web Video Search: Challenge And Opportunity, Wan-Lei Zhao, Song Tan, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

The massive amount of near-duplicate and duplicate web videos has presented both challenge and opportunity to multimedia computing. On one hand, browsing videos on Internet becomes highly inefficient for the need to repeatedly fast-forward videos of similar content. On the other hand, the tremendous amount of somewhat duplicate content also makes some traditionally difficult vision tasks become simple and easy. For example, annotating pictures can be as simple as recycling the tags of Internet images retrieved from image search engines. Such tasks, of either to eliminate or to recycle near-duplicates, can usually be achieved by the nearest neighbor search of …

Go to article

Identifying Bug Signatures Using Discriminative Graph Mining, Hong Cheng, David Lo, Yang Zhou, Xiaoyin Wang, Xifeng Yan Jul 2009

Identifying Bug Signatures Using Discriminative Graph Mining, Hong Cheng, David Lo, Yang Zhou, Xiaoyin Wang, Xifeng Yan

Research Collection School Of Computing and Information Systems

Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Although such methods could be very accurate, it is usually very hard for developers to understand the context of the bug, given each bug location in isolation. In this study, we propose to model software executions with graphs at two levels of granularity: methods and basic blocks. An individual node represents a method or basic block and an edge represents a method call, method return or transition (at the method or basic …

Go to article

Conditional Proxy Broadcast Re-Encryption, Cheng-Kang Chu, Jian Weng, Sherman S. W. Chow, Jianying Zhou, Robert H. Deng Jul 2009

Conditional Proxy Broadcast Re-Encryption, Cheng-Kang Chu, Jian Weng, Sherman S. W. Chow, Jianying Zhou, Robert H. Deng

Research Collection School Of Computing and Information Systems

A proxy re-encryption (PRE) scheme supports the delegation of decryption rights via a proxy, who makes the ciphertexts decryptable by the delegatee. PRE is useful in various applications such as encrypted email forwarding. In this paper, we introduce a more generalized notion of conditional proxy broadcast re-encryption (CPBRE). A CPBRE scheme allows Alice to generate a re-encryption key for some condition specified during the encryption, such that the re-encryption power of the proxy is restricted to that condition only. This enables a more fine-grained delegation of decryption right. Moreover, Alice can delegate decryption rights to a set of users at …

Go to article

On The Effectiveness Of Software Diversity: A Systematic Study On Real-World Vulnerabilities, Jin Han, Debin Gao, Robert H. Deng Jul 2009

On The Effectiveness Of Software Diversity: A Systematic Study On Real-World Vulnerabilities, Jin Han, Debin Gao, Robert H. Deng

Research Collection School Of Computing and Information Systems

Many systems have been introduced to detect software intrusions by comparing the outputs and behavior of diverse replicas when they are processing the same, potentially malicious, input. When these replicas are constructed using off-the-shelf software products, it is assumed that they are diverse and not compromised simultaneously under the same attack. In this paper, we analyze vulnerabilities published in 2007 to evaluate the extent to which this assumption is valid. We focus on vulnerabilities in application software, and show that the majority of these software products --- including those providing the same service (and therefore multiple software substitutes can be …

Go to article

Towards Expressive Specification And Efficient Model Checking, Jin Song Dong, Jun Sun Jul 2009

Towards Expressive Specification And Efficient Model Checking, Jin Song Dong, Jun Sun

Research Collection School Of Computing and Information Systems

System modeling is important and highly non-trivial. The choice of specification language is an important factor in the success of the entire development. The language should cover several facets of the requirements and the model should precisely capture (up to abstraction of irrelevant details) an existing system or a system to be built. The language should have a semantic model suitable to study the behaviors of the system and to establish the validity of desired properties. A formal model can be the basis for a variety of system development activities, e.g., system simulation, visualization, verification or prototype synthesis.

Go to article

Exploring Inter-Concept Relationship With Context Space For Semantic Video Indexing, Xiao-Yong Wei, Yu-Gang Jiang, Chong-Wah Ngo Jul 2009

Exploring Inter-Concept Relationship With Context Space For Semantic Video Indexing, Xiao-Yong Wei, Yu-Gang Jiang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Semantic concept detectors are often individually and independently developed. Using peripherally related concepts for leveraging the power of joint detection, which is referred to as context-based concept fusion (CBCF), has been one of the focus studies in recent years. This paper proposes the construction of a context space and the exploration of the space for CBCF. Context space considers the global consistency of concept relationship, addresses the problem of missing annotation, and is extensible for cross-domain contextual fusion. The space is linear and can be built by modeling the inter-concept relationship through annotation provided by either manual labeling or machine …

Go to article

Bonus Plans Of Mice And Men, M. Thulasidas Jul 2009

Bonus Plans Of Mice And Men, M. Thulasidas

Research Collection School Of Computing and Information Systems

Our best-laid plans often go awry. We see it all the time at a personal level -- accidents (both good and bad), deaths (both of loved ones and rich uncles), births, and lotteries all conspire to reshuffle our priorities and render our plans null and void. In fact, there is nothing like a solid misfortune to get us to put things in perspective. This opportunity may be the proverbial silver lining we are constantly advised to see. What is true at a personal level holds true also at a larger scale. The industry-wide financial meltdown has imparted a philosophical clarity …

Go to article

The Wisdom Of The Few: A Collaborative Filtering Approach Based On Expert Opinions From The Web, Xavier Amatriain, Neal Lathia, Josep M. Pujol, Haewoon Kwak, Nuria. Oliver Jul 2009

The Wisdom Of The Few: A Collaborative Filtering Approach Based On Expert Opinions From The Web, Xavier Amatriain, Neal Lathia, Josep M. Pujol, Haewoon Kwak, Nuria. Oliver

Research Collection School Of Computing and Information Systems

Nearest-neighbor collaborative filtering provides a successful means of generating recommendations for web users. However, this approach suffers from several shortcomings, including data sparsity and noise, the cold-start problem, and scalability. In this work, we present a novel method for recommending items to users based on expert opinions. Our method is a variation of traditional collaborative filtering: rather than applying a nearest neighbor algorithm to the user-rating data, predictions are computed using a set of expert neighbors from an independent dataset, whose opinions are weighted according to their similarity to the user. This method promises to address some of the weaknesses …

Go to article

A Bayesian Approach Integrating Regional And Global Features For Image Semantic Learning, Luong-Dong Nguyen, Ghim-Eng Yap, Ying Liu, Ah-Hwee Tan, Liang-Tien Chia, Joo-Hwee Lim Jul 2009

A Bayesian Approach Integrating Regional And Global Features For Image Semantic Learning, Luong-Dong Nguyen, Ghim-Eng Yap, Ying Liu, Ah-Hwee Tan, Liang-Tien Chia, Joo-Hwee Lim

Research Collection School Of Computing and Information Systems

In content-based image retrieval, the “semantic gap” between visual image features and user semantics makes it hard to predict abstract image categories from low-level features. We present a hybrid system that integrates global features (Gfeatures) and region features (R-features) for predicting image semantics. As an intermediary between image features and categories, we introduce the notion of mid-level concepts, which enables us to predict an image’s category in three steps. First, a G-prediction system uses G-features to predict the probability of each category for an image. Simultaneously, a R-prediction system analyzes R-features to identify the probabilities of mid-level concepts in that …

Go to article

Poster Abstract: Beamcast: Harnessing Beamforming Capabilities For Link Layer Multicast, Souvik Sen, Rahul Ghosh, Jie Xiong, Romit Roy Choudhury Jul 2009

Poster Abstract: Beamcast: Harnessing Beamforming Capabilities For Link Layer Multicast, Souvik Sen, Rahul Ghosh, Jie Xiong, Romit Roy Choudhury

Research Collection School Of Computing and Information Systems

Wireless multicast is an important service primitive for emerging applications such as live video, streaming audio and content telecasts. Transmission rate in such a link layer multicast is bottlenecked by the rate of the weakest client, leading to channel under-utilization. Attempts to increase the data rate results in lower reliability (due to higher bit error rate) and higher unfairness. This poster utilizes smart beamforming antennas to improve multicast performance in wireless LANs. The main idea is to satisfy majority of the (strong) clients with a high-rate omnidirectional transmission, followed by high-rate directional transmission(s) to cover the weaker ones. By selecting …

Go to article

Introducing Computing Now, George K. Thiruvathukal Jul 2009

Introducing Computing Now, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

One of Computing Now's editorial board members talks about this IEEE Computer Society initiative and all that it has to offer members and nonmembers alike.

Go to article

Ktr: An Efficient Key Management Scheme For Secure Data Access Control In Wireless Broadcast Services Recovery, Qijun Gu, Peng Liu, Wang-Chien Lee, Chao-Hsien Chu Jul 2009

Ktr: An Efficient Key Management Scheme For Secure Data Access Control In Wireless Broadcast Services Recovery, Qijun Gu, Peng Liu, Wang-Chien Lee, Chao-Hsien Chu

Research Collection School Of Computing and Information Systems

Wireless broadcast is an effective approach for disseminating data to a number of users. To provide secure access to data in wireless broadcast services, symmetric-key-based encryption is used to ensure that only users who own the valid keys can decrypt the data. With regard to various subscriptions, an efficient key management for distributing and changing keys is in great demand for access control in broadcast services. In this paper, we propose an efficient key management scheme, namely, key tree reuse (KTR), to handle key distribution with regard to complex subscription options and user activities. KTR has the following advantages. First, …

Go to article

First Prev Next Last