Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (14)
- Mathematics (6)
- Other Computer Sciences (4)
- Theory and Algorithms (3)
- Computer Engineering (2)
-
- Databases and Information Systems (2)
- Engineering (2)
- OS and Networks (2)
- Data Storage Systems (1)
- Digital Communications and Networking (1)
- Education (1)
- Numerical Analysis and Scientific Computing (1)
- Other Computer Engineering (1)
- Science and Mathematics Education (1)
- Software Engineering (1)
- Systems Architecture (1)
- Institution
- Publication
- Publication Type
Articles 1 - 20 of 20
Full-Text Articles in Physical Sciences and Mathematics
Learner-Centered Assignments In Computer Literacy, Martha E. Myers, Meg C. Murray, Mario Guimaraes, Debra B. Geist
Learner-Centered Assignments In Computer Literacy, Martha E. Myers, Meg C. Murray, Mario Guimaraes, Debra B. Geist
Faculty and Research Publications
Literacy is a concept that is understood to be the identifier of an educated populace. In today's world, literacy includes computer literacy, as well as language and quantitative literacy. This paper describes exercises developed to improve first year students' computer literacy through more learner-centered engagement. Exercises are designed to support learner-centered goals of independent and responsible learners, appropriate breadth and depth of content, teacher as facilitator, and assessment woven into learning. Exercise topics include purchase of a personal computer, basic logic via spreadsheets, an annotated bibliography built with electronic resources, and an integrated assignment customized by and for each student.
A Direct Algorithm For The K-Nearest-Neighbor Classifier Via Local Warping Of The Distance Metric, Tohkoon Neo
A Direct Algorithm For The K-Nearest-Neighbor Classifier Via Local Warping Of The Distance Metric, Tohkoon Neo
Theses and Dissertations
The k-nearest neighbor (k-NN) pattern classifier is a simple yet effective learner. However, it has a few drawbacks, one of which is the large model size. There are a number of algorithms that are able to condense the model size of the k-NN classifier at the expense of accuracy. Boosting is therefore desirable for increasing the accuracy of these condensed models. Unfortunately, there does not exist a boosting algorithm that works well with k-NN directly. We present a direct boosting algorithm for the k-NN classifier that creates an ensemble of models with locally modified distance weighting. An empirical study conducted …
Back-Up Server For Computer Science Department, Victoria Gaylord
Back-Up Server For Computer Science Department, Victoria Gaylord
Mahurin Honors College Capstone Experience/Thesis Projects
Because Western Kentucky University does not maintain a back-up system for its departments, the Computer Science Department has implemented its own. Using Bacula software on a Unix server, files from faculty desktop computers and servers are backed up to a tape drive on a daily basis. The server is protected from outside threats with a carefully configured firewall script. This paper explains how both the firewall and the back-up software were implemented and how successful that implementation has been.
A Classroom Outsourcing Experience For Software Engineering Learning, William L. Honig, Tejasvini Prasad
A Classroom Outsourcing Experience For Software Engineering Learning, William L. Honig, Tejasvini Prasad
Computer Science: Faculty Publications and Other Works
Outsourcing of software development is a key part of globalization, oft misunderstood by computer science students, and possibly a cause of declining enrollments in the field. The authors developed and implemented an outsourcing experience for students in an advanced software engineering course. Student teams at two universities developed game playing programs and outsourced key parts of their systems to the other university. Results show students improved their understanding of outsourcing, developed better appreciation for the importance of software engineering techniques, and created ad hoc communication protocols between teams. The paper concludes with recommendations for expanding the approach used to other …
Some Necessary Conditions Of Boolean Functions To Resist Algebraic Attacks., Deepak Dalai Dr.
Some Necessary Conditions Of Boolean Functions To Resist Algebraic Attacks., Deepak Dalai Dr.
Doctoral Theses
No abstract provided.
Construction Of (Hierarchical) Identity-Based Encryption Protocols Using Bilinear Pairing., Sanjit Chatterjee Dr.
Construction Of (Hierarchical) Identity-Based Encryption Protocols Using Bilinear Pairing., Sanjit Chatterjee Dr.
Doctoral Theses
Science, it is argued [65], advances through paradigm shifts. Concepts emerge that open-up new vistas of research, fundamentally changing the way we are used to looking at things. Between these paradigm shifts remain the periods of consolidation. Periods when human mind explores the newly found territory, shedding light on hitherto unknown dimensions. If radical changes are the hallmarks of paradigm shifts, the period within witnesses small but continuous developments, occasionally marked by its own milestones. It is in these periods that human faculty tries to grasp the full significance of the new concepts, consolidates its gains and thereby pushes the …
Critical Thinking Traits Of Top-Tier Experts And Implications For Computer Science Education, Dean Bushey
Critical Thinking Traits Of Top-Tier Experts And Implications For Computer Science Education, Dean Bushey
All Dissertations
A documented shortage of technical leadership and top-tier performers in
computer science jeopardizes the technological edge, security, and economic well-being of the nation. The 2005 President's Information and Technology Advisory Committee (PITAC) Report on competitiveness in computational sciences highlights the major impact of science, technology, and innovation in keeping America competitive in the global marketplace. It stresses the fact that the supply of science, technology, and engineering experts is at the core
of America's technological edge, national competitiveness and security. However, recent data shows that both undergraduate and postgraduate production of computer scientists is falling.
Past research on expert performance …
Obstacle Avoidance And Path Traversal Using Interactive Machine Learning, Jonathan M. Turner
Obstacle Avoidance And Path Traversal Using Interactive Machine Learning, Jonathan M. Turner
Theses and Dissertations
Recently there has been a growing interest in using robots in activities that are dangerous or cost prohibitive for humans to do. Such activities include military uses and space exploration. While robotic hardware is often capable of being used in these types of situations, the ability of human operators to control robots in an effective manner is often limited. This deficiency is often related to the control interface of the robot and the level of autonomy that control system affords the human operator. This thesis describes a robot control system, called the safe/unsafe system, which gives a human operator the …
Residual-Based Measurement Of Peer And Link Lifetimes In Gnutella Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov
Residual-Based Measurement Of Peer And Link Lifetimes In Gnutella Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov
Computer Science Faculty Publications
Existing methods of measuring lifetimes in P2P systems usually rely on the so-called create-based method (CBM), which divides a given observation window into two halves and samples users "created" in the first half every Delta time units until they die or the observation period ends. Despite its frequent use, this approach has no rigorous accuracy or overhead analysis in the literature. To shed more light on its performance, we flrst derive a model for CBM and show that small window size or large Delta may lead to highly inaccurate lifetime distributions. We then show that create-based sampling exhibits an inherent …
On Node Isolation Under Churn In Unstructured P2p Networks With Heavy-Tailed Lifetimes, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
On Node Isolation Under Churn In Unstructured P2p Networks With Heavy-Tailed Lifetimes, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
Computer Science Faculty Publications
Previous analytical studies [12], [18] of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this paper, we overcome these limitations by introducing a general node-isolation model for heavy-tailed user lifetimes and arbitrary neighbor-selection algorithms. Using this model, we analyze two age-biased neighbor-selection strategies and show that they significantly improve the residual lifetimes of chosen users, which dramatically reduces the probability of user isolation and graph partitioning compared to uniform selection of neighbors. In fact, the second strategy based on random walks on age-weighted graphs demonstrates that for lifetimes with infinite variance, the system …
A Study On Time/Memory Trade-Off Cryptanalysis., Sourav Mukhopadhyay Dr.
A Study On Time/Memory Trade-Off Cryptanalysis., Sourav Mukhopadhyay Dr.
Doctoral Theses
At the beginning of 2003, I was searching for a suitable area to do my PhD. My respected guide Prof. Palash Sarkar assigned me to do a survey work on block cipher cryptanalysis. I found myself very interested in this area. I am very lucky that I joined into a golden group – Cryptology Research Group of India formed by our beloved teacher Prof. Bimal Roy and had the opportunity to work with Prof. Palash Sarkar, Dr. Subhomoy Maitra, Prof. Rana Barua and many others. I have been inspired by many persons during my PhD work.I would like to begin …
On-The-Fly Dynamic Dead Variable Analysis, Joel P. Self
On-The-Fly Dynamic Dead Variable Analysis, Joel P. Self
Theses and Dissertations
State explosion in model checking continues to be the primary obstacle to widespread use of software model checking. The large input ranges of variables used in software is the main cause of state explosion. As software grows in size and complexity the problem only becomes worse. As such, model checking research into data abstraction as a way of mitigating state explosion has become more and more important. Data abstractions aim to reduce the effect of large input ranges. This work focuses on a static program analysis technique called dead variable analysis. The goal of dead variable analysis is to discover …
On Edge Detection And Object Recognition In Color Images., Sarif Kumar Naik Dr.
On Edge Detection And Object Recognition In Color Images., Sarif Kumar Naik Dr.
Doctoral Theses
No abstract provided.
Concatenative Text-To-Speech Synthesis: A Study On Standard Colloquial Bengali., Soumen Chowdhury Dr.
Concatenative Text-To-Speech Synthesis: A Study On Standard Colloquial Bengali., Soumen Chowdhury Dr.
Doctoral Theses
The primary communication process between human beings is Speech. Speech synthesis is the automatic and artificial generation of the speech signal by a machine. A TTS (Text-To-Speech) synthesis system is one which can generate speech signal from a string of text in a given language. The development in the speech synthesis systems in various languages has been going on for several decades. With the unprecedented expansion of IT (Information Technology) invading the life of the common man it is highly desirable that at least the information dissemination be made via the speech mode which is the most natural mode of …
Some Geometrical Aspects Of The Cone Linear Complementarity Problem., Madhur Malik Dr.
Some Geometrical Aspects Of The Cone Linear Complementarity Problem., Madhur Malik Dr.
Doctoral Theses
Cone Linear Complementarity ProblemLet V be a finite dimensional real inner product space and K be a closed convex cone in V. Given a linear transformation L : V → V and a vector q ∈ V the cone linear complementarity problem or linear complementarity problem over K, denoted as LCP(K, L, q), is to find a vector x ∈ K such thatL(x) + q ∈ K+ and hx, L(x) + qi = 0,where h., .i denotes an inner product on V and K is the dual cone of K defined as:K∗ := {y ∈ V : hx, yi ≥ …
System For Collision Detection Between Deformable Models Built On Axis Aligned Bounding Boxes And Gpu Based Culling, David Owen Tuft
System For Collision Detection Between Deformable Models Built On Axis Aligned Bounding Boxes And Gpu Based Culling, David Owen Tuft
Theses and Dissertations
Collision detection between deforming models is a difficult problem for collision detection systems to handle. This problem is even more difficult when deformations are unconstrained, objects are in close proximity to one another, and when the entity count is high. We propose a method to perform collision detection between multiple deforming objects with unconstrained deformations that will give good results in close proximities. Currently no systems exist that achieve good performance on both unconstrained triangle level deformations and deformations that preserve edge connectivity. We propose a new system built as a combination of Graphics Processing Unit (GPU) based culling and …
Implicit Affinity Networks, Matthew Scott Smith
Implicit Affinity Networks, Matthew Scott Smith
Theses and Dissertations
Although they clearly exist, affinities among individuals are not all easily identified. Yet, they offer unique opportunities to discover new social networks, strengthen ties among individuals, and provide recommendations. We propose the idea of Implicit Affinity Networks (IANs) to build, visualize, and track affinities among groups of individuals. IANs are simple, interactive graphical representations that users may navigate to uncover interesting patterns. This thesis describes a system supporting the construction of IANs and evaluates it in the context of family history and online communities.
Proe: Pseudo Random Optimized Encryption, Louis J. Ricci
Proe: Pseudo Random Optimized Encryption, Louis J. Ricci
Honors Projects
Examines the development and testing of the PROE encryption algorithm, including design decisions ensuring security and speed. Demonstrates implementation in the x86-64 assembler.
A Model-Driven Approach To Job/Task Composition In Cluster Computing, Yogesh Kanitkar, Konstantin Läufer, Neeraj Mehta, George K. Thiruvathukal
A Model-Driven Approach To Job/Task Composition In Cluster Computing, Yogesh Kanitkar, Konstantin Läufer, Neeraj Mehta, George K. Thiruvathukal
Computer Science: Faculty Publications and Other Works
In the general area of high-performance computing, object-oriented methods have gone largely unnoticed. In contrast, the Computational Neighborhood (CN), a framework for parallel and distributed computing with a focus on cluster computing, was designed from ground up to be object-oriented. This paper describes how we have successfully used UML in the following model-driven, generative approach to job/task composition in CN. We model CN jobs using activity diagrams in any modeling tool with support for XMI, an XML-based external representation of UML models. We then export the activity diagrams and use our XSLT-based tool to transform the resulting XMI representation to …
Applying The Levels Of Conceptual Interoperability Model In Support Of Integratability, Interoperability, And Composability For System-Of-Systems Engineering, Andreas Tolk, Saikou Y. Diallo, Charles D. Turnitsa
Applying The Levels Of Conceptual Interoperability Model In Support Of Integratability, Interoperability, And Composability For System-Of-Systems Engineering, Andreas Tolk, Saikou Y. Diallo, Charles D. Turnitsa
Computational Modeling & Simulation Engineering Faculty Publications
The Levels of Conceptual Interoperability Model (LCIM) was developed to cope with the different layers of interoperation of modeling & simulation applications. It introduced technical, syntactic, semantic, pragmatic, dynamic, and conceptual layers of interoperation and showed how they are related to the ideas of integratability, interoperability, and composability. The model was successfully applied in various domains of systems, cybernetics, and informatics.