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

Other Computer Sciences Commons

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

1,765 Full-Text Articles 2,503 Authors 1,349,650 Downloads 165 Institutions

All Articles in Other Computer Sciences

Faceted Search

1,765 full-text articles. Page 79 of 79.

Development Of A 3d Game Engine, Nicholas Alexander Woodfield 2010 University of Connecticut - Storrs

Development Of A 3d Game Engine, Nicholas Alexander Woodfield

Honors Scholar Theses

This paper presents the development history and specification of a 3D game engine titled "Spark Engine". The term "engine" is used to describe a complex graphics software suite that streamlines application development and provides efficient rendering functionality. A game engine specifically provides tools to simplify game development. Spark Engine is fully shader driven and is built on top of Microsoft's XNA Framework. It is a reusable and flexible platform that can be used to build any type of graphics application ranging from gaming to simulation. The engine was released as open source software under the New BSD License with an …


Capacity-Driven Pricing Mechanism In Special Service Industries, Lijian Chen, Suraj M. Alexander 2010 University of Dayton

Capacity-Driven Pricing Mechanism In Special Service Industries, Lijian Chen, Suraj M. Alexander

MIS/OM/DS Faculty Publications

We propose a capacity driven pricing mechanism for several service industries in which the customer behavior, the price demand relationship, and the competition are significantly distinct from other industries. According our observation, we found that the price demand relationship in these industries cannot be modeled by fitted curves; the customers would neither plan in advance nor purchase the service strategically; and the competition would be largely local. We analyze both risk neutral and risk aversion pricing models and conclude the proposed capacity driven model would be the optimal solution under mild assumptions. The resulting pricing mechanism has been implemented at …


Personalization By Website Transformation: Theory And Practice, Saverio Perugini 2010 University of Dayton

Personalization By Website Transformation: Theory And Practice, Saverio Perugini

Computer Science Faculty Publications

We present an analysis of a progressive series of out-of-turn transformations on a hierarchical website to personalize a user’s interaction with the site. We formalize the transformation in graph-theoretic terms and describe a toolkit we built that enumerates all of the traversals enabled by every possible complete series of these transformations in any site and computes a variety of metrics while simulating each traversal therein to qualify the relationship between a site’s structure and the cumulative effect of support for the transformation in a site. We employed this toolkit in two websites. The results indicate that the transformation enables users …


An Exploration Of Optimization Algorithms And Heuristics For The Creation Of Encoding And Decoding Schedules In Erasure Coding, Catherine D. Schuman 2010 University of Tennessee - Knoxville

An Exploration Of Optimization Algorithms And Heuristics For The Creation Of Encoding And Decoding Schedules In Erasure Coding, Catherine D. Schuman

Chancellor’s Honors Program Projects

No abstract provided.


Enterprise Users And Web Search Behavior, April Ann Lewis 2010 The University of Tennessee, Knoxville

Enterprise Users And Web Search Behavior, April Ann Lewis

Masters Theses

This thesis describes analysis of user web query behavior associated with Oak Ridge National Laboratory’s (ORNL) Enterprise Search System (Hereafter, ORNL Intranet). The ORNL Intranet provides users a means to search all kinds of data stores for relevant business and research information using a single query. The Global Intranet Trends for 2010 Report suggests the biggest current obstacle for corporate intranets is “findability and Siloed content”. Intranets differ from internets in the way they create, control, and share content which can make it often difficult and sometimes impossible for users to find information. Stenmark (2006) first noted studies of corporate …


Extending The Page Segmentation Algorithms Of The Ocropus Documentation Layout Analysis System, Amy Alison Winder 2010 Boise State University

Extending The Page Segmentation Algorithms Of The Ocropus Documentation Layout Analysis System, Amy Alison Winder

Boise State University Theses and Dissertations

With the advent of more powerful personal computers, inexpensive memory, and digital cameras, curators around the world are working towards preserving historical documents on computers. Since many of the organizations for which they work have limited funds, there is world-wide interest in a low-cost solution to obtaining these digital records in a computer-readable form. An open source layout analysis system called OCRopus is being developed for such a purpose. In its original state, though, it could not process documents that contained information other than text. Segmenting the page into regions of text and non-text areas is the first step of …


Head In Space : A Head-Tracking Based Binaural Spatialization System, Luca A. Ludovico, Davide Andrea Mauro PhD, Dario Pizzamiglio 2010 Marshall University

Head In Space : A Head-Tracking Based Binaural Spatialization System, Luca A. Ludovico, Davide Andrea Mauro Phd, Dario Pizzamiglio

Computer Sciences and Electrical Engineering Faculty Research

This paper discusses a system capable of detecting the position of the listener through a head-tracking system and rendering a 3D audio environment by binaural spatialization. Head tracking is performed through face recognition algorithms which use a standard webcam, and the result is presented over headphones, like in other typical binaural applications. With this system users can choose an audio file to play, provide a virtual position for the source in an euclidean space, and then listen to the sound as if it is coming from that position. If they move their head, the signal provided by the system changes …


Performance Of Scattering Matrix Decomposition And Color Spaces For Synthetic Aperture Radar Imagery, Manuel E. Arriagada 2010 Air Force Institute of Technology

Performance Of Scattering Matrix Decomposition And Color Spaces For Synthetic Aperture Radar Imagery, Manuel E. Arriagada

Theses and Dissertations

Polarimetrc Synthetic Aperture Radar (SAR) has been shown to be a powerful tool in remote sensing because uses up to four simultaneous measurements giving additional degrees of freedom for processing. Typically, polarization decomposition techniques are applied to the polarization-dependent data to form colorful imagery that is easy for operators systems to interpret. Yet, the presumption is that the SAR system operates with maximum bandwidth which requires extensive processing for near- or real-time application. In this research, color space selection is investigated when processing sparse polarimetric SAR data as in the case of the publicly available \Gotcha Volumetric SAR Data Set, …


Moving Targets: Geographically Routed Human Movement Networks, Adam J. Aviv, Micah Sherr, Matt Blaze, Jonathan M. Smith 2010 University of Pennsylvania

Moving Targets: Geographically Routed Human Movement Networks, Adam J. Aviv, Micah Sherr, Matt Blaze, Jonathan M. Smith

Technical Reports (CIS)

We introduce a new communication paradigm, Human-to-human Mobile Ad hoc Networking (HuManet), that exploits smartphone capabilities and human behavior to create decentralized networks for smartphone-to-smartphone message delivery. HuManets support stealth command-and-control messaging for mobile BotNets, covert channels in the presence of an observer who monitors all cellular communication, and distributed protocols for querying the state or content of targeted mobile devices.

In this paper, we introduce techniques for constructing HumaNets and describe protocols for efficiently routing and addressing messages. In contrast to flooding or broadcast schemes that saturate the network and aggressively consume phone resources (e.g., batteries), our protocols exploit …


Software Internationalization: A Framework Validated Against Industry Requirements For Computer Science And Software Engineering Programs, John Huân Vũ 2010 California Polytechnic State University, San Luis Obispo

Software Internationalization: A Framework Validated Against Industry Requirements For Computer Science And Software Engineering Programs, John Huân Vũ

Master's Theses

View John Huân Vũ's thesis presentation at http://youtu.be/y3bzNmkTr-c.

In 2001, the ACM and IEEE Computing Curriculum stated that it was necessary to address "the need to develop implementation models that are international in scope and could be practiced in universities around the world." With increasing connectivity through the internet, the move towards a global economy and growing use of technology places software internationalization as a more important concern for developers. However, there has been a "clear shortage in terms of numbers of trained persons applying for entry-level positions" in this area. Eric Brechner, Director of Microsoft Development Training, suggested …


Overseer: A Mobile Context-Aware Collaboration And Task Management System For Disaster Response, Faisal B. Luqman, Martin L. Griss 2010 Carnegie Mellon University

Overseer: A Mobile Context-Aware Collaboration And Task Management System For Disaster Response, Faisal B. Luqman, Martin L. Griss

Martin L Griss

Efficient collaboration and task management is challenging in distributed, dynamically-formed organizations such as ad hoc disaster response teams. Ineffective collaboration may result in poor performance and possible loss of life. In this paper, we present an open multi-agent system, called Overseer, that leverages context information in a mobile setting to facilitate collaboration and task allocation for disaster response. We describe our system architecture, deployment, evaluation metrics, challenges and proposed solutions. We also show how mobile context can be used to create dynamic rolebased assignments to support collaboration and effective task management


Ssrn As An Initial Revolution In Academic Knowledge Aggregation And Dissemination, David Bray, Sascha Vitzthum, Benn Konsynski 2010 National Defense University

Ssrn As An Initial Revolution In Academic Knowledge Aggregation And Dissemination, David Bray, Sascha Vitzthum, Benn Konsynski

Sascha Vitzthum

Within this paper we consider our results of using the Social Science Research Network (SSRN) over a period of 18 months to distribute our working papers to the research community. Our experiences have been quite positive, with SSRN serving as a platform both to inform our colleagues about our research as well as inform us about related research (through email and telephoned conversations of colleagues who discovered our paper on SSRN). We then discuss potential future directions for SSRN to consider, and how SSRN might well represent an initial revolution in 21st century academic knowledge aggregation and dissemination. Our paper …


Effective Heuristic Methods For Finding Non-Optimal Solutions Of Interest In Constrained Optimization Models, Steven. O. Kimbrough, Ann Kuo, Hoong. C. Lau 2010 University of Pennsylvania

Effective Heuristic Methods For Finding Non-Optimal Solutions Of Interest In Constrained Optimization Models, Steven. O. Kimbrough, Ann Kuo, Hoong. C. Lau

Operations, Information and Decisions Papers

This paper introduces the SoI problem, that of finding non-optimal solutions of interest for constrained optimization models. SoI problems subsume finding FoIs (feasible solutions of interest), and IoIs (infeasible solutions of interest). In all cases, the interest addressed is post-solution analysis in one form or another. Post-solution analysis of a constrained optimization model occurs after the model has been solved and a good or optimal solution for it has been found. At this point, sensitivity analysis and other questions of import for decision making (discussed in the paper) come into play and for this purpose the SoIs can be of …


Supporting Multiple Paths To Objects In Information Hierarchies: Faceted Classification, Faceted Search, And Symbolic Links, Saverio Perugini 2010 University of Dayton

Supporting Multiple Paths To Objects In Information Hierarchies: Faceted Classification, Faceted Search, And Symbolic Links, Saverio Perugini

Computer Science Faculty Publications

We present three fundamental, interrelated approaches to support multiple access paths to each terminal object in information hierarchies: faceted classification, faceted search, and web directories with embedded symbolic links. This survey aims to demonstrate how each approach supports users who seek information from multiple perspectives. We achieve this by exploring each approach, the relationships between these approaches, including tradeoffs, and how they can be used in concert, while focusing on a core set of hypermedia elements common to all. This approach provides a foundation from which to study, understand, and synthesize applications which employ these techniques. This survey does not …


High School Microsoft Powerpoint, Ladane Du Boulay 2010 Pace University

High School Microsoft Powerpoint, Ladane Du Boulay

Technology

The purpose of this lesson is for students to deepend and demonstrate their understanding of Powerpoint. The students will create a sample multimedia-rich presentation. They will be using their prior knowledge related to their social studies (i.e. Abraham Lincoln) and Science (i.e. Charles Darwin) classes.


On Coalgebras Over Algebras, Adriana Balan, Alexander Kurz 2010 University Politehnica of Bucharest

On Coalgebras Over Algebras, Adriana Balan, Alexander Kurz

Engineering Faculty Articles and Research

We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor as the completion of its initial algebra to the Eilenberg-Moore category of algebras for a Set-monad M for functors arising as liftings. As an application we introduce the notion of commuting pair of endofunctors with respect to the monad M and show that under reasonable assumptions, the final coalgebra of one of the endofunctors involved can be obtained as the free algebra generated by the initial algebra of the other endofunctor.


Families Of Symmetries As Efficient Models Of Resource Binding, Vincenzo Ciancia, Alexander Kurz, Ugo Montanari 2010 Institute for Logic, Language and Computation - Amsterdam

Families Of Symmetries As Efficient Models Of Resource Binding, Vincenzo Ciancia, Alexander Kurz, Ugo Montanari

Engineering Faculty Articles and Research

Calculi that feature resource-allocating constructs (e.g. the pi-calculus or the fusion calculus) require special kinds of models. The best-known ones are presheaves and nominal sets. But named sets have the advantage of being finite in a wide range of cases where the other two are infinite. The three models are equivalent. Finiteness of named sets is strictly related to the notion of finite support in nominal sets and the corresponding presheaves. We show that named sets are generalisd by the categorical model of families, that is, free coproduct completions, indexed by symmetries, and explain how locality of interfaces gives good …


On Universal Algebra Over Nominal Sets, Alexander Kurz, Daniela Petrişan 2010 Chapman University

On Universal Algebra Over Nominal Sets, Alexander Kurz, Daniela Petrişan

Engineering Faculty Articles and Research

We investigate universal algebra over the category Nom of nominal sets. Using the fact that Nom is a full re ective subcategory of a monadic category, we obtain an HSP-like theorem for algebras over nominal sets. We isolate a `uniform' fragment of our equational logic, which corresponds to the nominal logics present in the literature. We give semantically invariant translations of theories for nominal algebra and NEL into `uniform' theories and systematically prove HSP theorems for models of these theories.


Bitopological Duality For Distributive Lattices And Heyting Algebras, Guram Bezhanishvili, Nick Bezhanishvili, David Gabelaia, Alexander Kurz 2010 New Mexico State University

Bitopological Duality For Distributive Lattices And Heyting Algebras, Guram Bezhanishvili, Nick Bezhanishvili, David Gabelaia, Alexander Kurz

Engineering Faculty Articles and Research

We introduce pairwise Stone spaces as a natural bitopological generalization of Stone spaces—the duals of Boolean algebras—and show that they are exactly the bitopological duals of bounded distributive lattices. The category PStone of pairwise Stone spaces is isomorphic to the category Spec of spectral spaces and to the category Pries of Priestley spaces. In fact, the isomorphism of Spec and Pries is most naturally seen through PStone by first establishing that Pries is isomorphic to PStone, and then showing that PStone is isomorphic to Spec. We provide the bitopological and spectral descriptions of many algebraic concepts important for the study …


Algebraic Theories Over Nominal Sets, Alexander Kurz, Daniela Petrişan, Jiří Velebil 2010 Chapman University

Algebraic Theories Over Nominal Sets, Alexander Kurz, Daniela Petrişan, Jiří Velebil

Engineering Faculty Articles and Research

We investigate the foundations of a theory of algebraic data types with variable binding inside classical universal algebra. In the first part, a category-theoretic study of monads over the nominal sets of Gabbay and Pitts leads us to introduce new notions of finitary based monads and uniform monads. In a second part we spell out these notions in the language of universal algebra, show how to recover the logics of Gabbay-Mathijssen and Clouston-Pitts, and apply classical results from universal algebra.


Digital Commons powered by bepress