Computer Sciences Commons^™

Managing The Cost Of Usable Data Centers, Sisomphone. Khantaphixay

Regis University Student Publications (comprehensive collection)

The main topic of this paper is to identify problems and present an overview of Data Center environments. To identify problems and present the overviews of business data environments and the cost of usable data center for small-midsize business organization based type of requirements on the design is one of the most important concepts of managing cost. To maximized data center efficiency administrators implement Blade Server, Virtualization, SOA, and other recent technologies. The project process will focus on most leased data centers with provided space rather than specific applications that trend the way of design, and eliminating the significant impact …

Home Owner Associations (Hoas) Should Use Centralization And Modern Knowledge Management Practices To Effectively Distribute Their Covenants, Conditions And Restrictions (Cc&Rs) And To Improve Relations With Residents, Robert A. Ochoa

Regis University Student Publications (comprehensive collection)

This thesis will introduce the history of knowledge management, knowledge management of today, and the benefits of knowledge management practices. As an example of the need for knowledge management practices, the many problems being experienced by Home Owner Association's (HOA's) will be discussed, and the many creative ways that knowledge management practices are used today will be shared. There are many organizations that could benefit from knowledge management practices, and there are many solutions that could be used. The characteristics of an organization in trouble and in need of knowledge management practices will begin to surface in the form of …

Detecting Curved Objects Against Cluttered Backgrounds, Jan Prokaj

Electronic Theses and Dissertations

Detecting curved objects against cluttered backgrounds is a hard problem in computer vision. We present new low-level and mid-level features to function in these environments. The low-level features are fast to compute, because they employ an integral image approach, which makes them especially useful in real-time applications. The mid-level features are built from low-level features, and are optimized for curved object detection. The usefulness of these features is tested by designing an object detection algorithm using these features. Object detection is accomplished by transforming the mid-level features into weak classifiers, which then produce a strong classifier using AdaBoost. The resulting …

An Empirical Validation Of Object-Oriented Design Metrics For Fault Prediction, Luiz Fernando Capretz, Jie Xu

Electrical and Computer Engineering Publications

Object-oriented design has become a dominant method in software industry and many design metrics of object-oriented programs have been proposed for quality prediction, but there is no well-accepted statement on how significant those metrics are. In this study, empirical analysis is carried out to validate object-oriented design metrics for defects estimation. Approach: The Chidamber and Kemerer metrics suite is adopted to estimate the number of defects in the programs, which are extracted from a public NASA data set. The techniques involved are statistical analysis and neuro-fuzzy approach. Results: The results indicate that SLOC, WMC, CBO and RFC are reliable metrics …

An Ontology For Autonomic License Management, Qian Zhao, Mark Perry

Computer Science Publications

The license agreement can be seen as the knowledge source for a license management system. As such, it may be referenced by the system each time a new process is initiated. To facilitate access, a machine readable representation of the license agreement is highly desirable, but at the same time we do not want to sacrifice too much readability of such agreements by human beings. Creating an ontology as a formal knowledge representation of licensing not only meets the representation requirements, but also offers improvements to knowledge reusability owing to the inherent sharing nature of such representations. Furthermore, the XML-based …

A Framework For Automatic Sla Creation, Halina Kaminski, Mark Perry

Computer Science Publications

Negotiation is fundamental to business. Increased automation of business to business or business to customer interaction is demanding efficient but flexible systems that can manage the negotiation process with minimal direct human intervention. Industries that provide online services rely on Service Level Agreements as the basis for their contractual relationship. Here we look at a means for generating these with a negotiating tool (SLA Negotiation Manager) that complies with e-negotiation rules and creates the agreements from existing business objectives.

Multiple Logs Analysis For Detecting Zero-Day Backdoor Trojans, Sinchai Caravut

ETD Archive

Trojan horses commonly known as "Trojans" are the computer threats that have been recently causing trouble on the internet because of their new propagation techniques. Social engineering has become a popular strategy to deceive people to run the attacker's malicious programs. Trojans use this technique to propagate themselves from a computer or a network to others, thus making them hard to prevent. The only way to keep computers and networks safe from them is by detecting them as soon as possible. Because of their quiet behavior, it's hard to detect by only IDS (Intrusion Detection System) log analysis therefore, multiple …

Ldne: A Program For Estimating Effective Population Size From Data On Linkage Disequilibrium, Robin Waples, Chi Do

United States Department of Commerce: Staff Publications

_LDNE is a program with a Visual Basic interface that implements a recently developed bias correction for estimates of effective population size (N_e) based on linkage disequilibrium data. The program reads genotypic data in standard formats and can accommodate an arbitrary number of samples, individuals, loci, and alleles, as well as two mating systems: random and lifetime monogamy. _LDNE calculates separate estimates using different criteria for excluding rare alleles, which facilitates evaluation of data for highly polymorphic markers such as microsatellites. The program also introduces a jackknife method for obtaining confidence intervals that appears to perform better …

Strategic Importance Of Higher Education And Research In Positioning Gujarat For Global Competitiveness, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

A Coherent Well-Founded Model For Hybrid Mknf Knowledge Bases, Matthias Knorr, Jose Julio Alferes, Pascal Hitzler

Computer Science and Engineering Faculty Publications

With the advent of the Semantic Web, the question becomes important how to best combine open-world based ontology languages, like OWL, with closed-world rules paradigms. One of the most mature proposals for this combination is known as Hybrid MKNF knowledge bases [11], which is based on an adaptation of the stable model semantics to knowledge bases consisting of ontology axioms and rules. In this paper, we propose a well-founded semantics for such knowledge bases which promises to provide better efficiency of reasoning, which is compatible both with the OWL-based semantics and the traditional well-founded semantics for logic programs, and which …

Approximate Owl-Reasoning With Screech, Tuvshintur Tserendorj, Sebastian Rudolph, Markus Krotzsch, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Applications of expressive ontology reasoning for the Semantic Web require scalable algorithms for deducing implicit knowledge from explicitly given knowledge bases. Besides the development of more effi- cient such algorithms, awareness is rising that approximate reasoning solutions will be helpful and needed for certain application domains. In this paper, we present a comprehensive overview of the Screech approach to approximate reasoning with OWL ontologies, which is based on the KAON2 algorithms, facilitating a compilation of OWL DL TBoxes into Datalog, which is tractable in terms of data complexity. We present three different instantiations of the Screech approach, and report on …

Investigating Adaptive, Confidence-Based Strategic Negotiations In Complex Multiagent Environments, Leen-Kiat Soh, Xin Li

School of Computing: Faculty Publications

We propose an adaptive 1-to-many negotiation strategy for multiagent coalition formation in complex environments that are dynamic, uncertain, and real-time. Our strategy deals with how to assign multiple issues to a set of concurrent negotiations based on an initiating agent’s confidence in its profiling of its peer agents. When an agent is confident, it uses a packaged approach—conducting multiple multi-issue negotiations—with its peers. Otherwise, it uses a pipelined approach—conducting multiple single-issue negotiations—with its peers. The initiating agent is also capable of using both approaches in a hybrid, dealing with a mixed group of responding peers. An agent’s confidence in its …

Efficient Selection Of Observation Points For Functional Tests, Jian Kang, Sharad C. Seth, Yi-Shing Chang, Vijay Gangaram

School of Computing: Faculty Publications

The fault coverage of existing functional tests can be enhanced by additional observation points. For a given set of functional tests, this paper proposes an efficient fault-dropping fault simulation method for selecting a subset of observation points at a small fraction of the cost of non-fault-dropping fault simulation. Experimental results on industrial circuits demonstrate the effectiveness of the method in achieving close to optimal results in the size of the selected subset with an order of magnitude less time, without losing achievable coverage. The technique is particularly applicable to industrial designs where fault-simulation times can be prohibitively expensive, even when …

A Survey On Spectrum Management In Cognitive Radio Networks, Ian F. Akyildiz, Won-Yeol Lee, Mehmet C. Vuran, Shantidev Mohanty

School of Computing: Faculty Publications

Cognitive radio networks will provide high bandwidth to mobile users via heterogeneous wireless architectures and dynamic spectrum access techniques. However, CR networks impose challenges due to the fluctuating nature of the available spectrum, as well as the diverse QoS requirements of various applications. Spectrum management functions can address these challenges for the realization of this new network paradigm. To provide a better understanding of CR networks, this article presents recent developments and open research issues in spectrum management in CR networks. More specifically, the discussion is focused on the development of CR networks that require no modification of existing networks. …

Techniques For Computing Fitness Of Use (Fou) For Time Series Datasets With Applications In The Geospatial Domain, Lei Fu, Leen-Kiat Soh, Ashok Samal

School of Computing: Faculty Publications

Time series data are widely used in many applications including critical decision support systems. The goodness of the dataset, called the Fitness of Use (FoU), used in the analysis has direct bearing on the quality of the information and knowledge generated and hence on the quality of the decisions based on them. Unlike traditional quality of data which is independent of the application in which it is used, FoU is a function of the application. As the use of geospatial time series datasets increase in many critical applications, it is important to develop formal methodologies to compute their FoU and …

Mitigating Dos Attacks Against Broadcast Authentication In Wireless Sensor Networks, Peng Ning, An Liu, Wenliang Du

Electrical Engineering and Computer Science - All Scholarship

Broadcast authentication is a critical security service in wireless sensor networks. There are two general approaches for broadcast authentication in wireless sensor networks: digital signatures and µTESLA-based techniques. However, both signature-based and µTESLA-based broadcast authentication are vulnerable to Denial of Services (DoS) attacks: An attacker can inject bogus broadcast packets to force sensor nodes to perform expensive signature verifications (in case of signature-based broadcast authentication) or packet forwarding (in case of µTESLA-based broadcast authentication), thus exhausting their limited battery power. This paper presents an efficient mechanism called message specific puzzle to mitigate such DoS attacks. In addition to signature-based or …

Variable Neighbor Selection In Live Peer-To-Peer Multimedia Streaming Networks, Jagannath Ghoshal, Miao Wang, Lisong Xu, Byrav Ramamurthy

School of Computing: Conference and Workshop Papers

Data-driven (or swarming based) streaming is one of the popular ways to distribute live multimedia streaming traffic over Peer-to-Peer (P2P) networks. The efficiency and user satisfaction highly depend on the constructed overlays. The common neighbor selection algorithms in existing overlay construction schemes usually randomly select a fixed number of neighbors which satisfy the selection requirements, such as end-to-end delay or a peer's sojourn time. However, this fixed random neighbor-selection algorithm (FRNS) neglects the peers' upload bandwidth heterogeneity and therefore, the upload bandwidth cannot be efficiently used. In this paper, we propose a variable random neighbor-selection (VRNS) scheme to alleviate the …

A Service-Differentiated Real-Time Communication Scheme For Wireless Sensor Networks, Yuyan Xue, Byrav Ramamurthy, Mehmet C. Vuran

School of Computing: Conference and Workshop Papers

Supporting end-to-end real-time communication is important for wireless sensor networks (WSNs) to accomplish the collaborative sensing tasks with specific timing constraints. However, without considering the unique constraints for WSNs, many existing real-time communication protocols prove to be infeasible for low-cost WSNs. In this paper, we propose a novel real-time communication scheme (RCS) to provide service-differentiated soft real-time guarantees for end-to-end communication in WSNs. We use hop-based geographic grouping to enable location awareness for sensor nodes with extremely low control overhead.We use dynamic forwarding with load-balanced receiver contention to provide a light-weight, yet efficient, routing technique, which can be easily adapted …

I-Minds: A Multiagent System For Intelligent Computer- Supported Collaborative Learning And Classroom Management, Leen-Kiat Soh, Nobel Khandaker, Hong Jiang

School of Computing: Faculty Publications

I-MINDS provides a computer-supported collaborative learning (CSCL) infrastructure and environment for learners in synchronous learning and classroom management applications for instructors, for large classroom or distance education situations. For supporting the instructor, I-MINDS includes a teacher agent. The teacher agent allows the instructor to interact with students, manage Q&A sessions, administer quizzes, post evaluations, form groups and monitor individual and group performances. For computer-supported collaborative learning, I-MINDS, which stands for Intelligent Multiagent Infrastructure for Distributed Systems in Education, provides a student agent for each student. Each student agent monitors and models its user and carries out group formation with other …

Help-Based Tutorials, David G. Novick, Oscar D. Andrade, Nathaniel Bean, Edith Elizalde

Departmental Papers (CS)

The consensus of the documentation literature is that users rarely use help, usually preferring to muddle through. To increase use of help, tutorials for novice users could be changed from guided presentations toward using the system’s actual help system. To determine whether this approach would increase users’ use of help when they encountered problems with an application, we developed an alternative, help-based tutorial introduction to Microsoft Publisher. We compared the behaviors of users introduced to Publisher with the help-based tutorial with the behaviors of users who learned from a traditional tutorial. A balanced study of 22 novice users of Publisher …

Increasing Localization Precision In Sensor Networks With Mobile Beacons - A Genetic Path Planning Approach, Awais Iqbal

Computer Science and Engineering Theses - Archive

This work describes a genetic algorithm based approach to approximate an optimal path for a mobile beacon node in a grid of stationary wireless sensors. As the beacon moves over the field of sensors it broadcasts its location. Sensors that are currently in the proximity of the beacon will receive this communication and can then use several of these messages to compute estimates on their locations. An optimal path is defined as a path that will result in the highest overall precision of location estimates among sensors given a maximum path length for the beacon. We assume that sensors are …

Automated Journeys, Arianna Bassoli, Johanna Brewer, Alex Taylor

Computer Science: Faculty Publications

Computing technology now pervades those moments of our day when we move through our cities. Mobile phones, music players, vending machines, contact-less payment systems and RFID-enabled turnstiles are de rigueur on our daily journeys. This workshop aims to examine these augmented journeys, to reflect on the public, semi-public and private technologies available to us in them, and to speculate on what innovations might be to come. Taking as our starting point cities such as Seoul, we aim to take seriously the developments in mobile technology as well as the advancements in autonomous machinery and how these mesh with our urban …

Use Of Characteristic Basis Function Method For Scattering From Terrain Profiles, Atacan Yağbasan, Celal Alp Tunç, Vakur B. Ertürk, Ayhan Altintas, Raj Mittra

Turkish Journal of Electrical Engineering and Computer Sciences

An integral equation (IE) based solution procedure is presented for the rigorous analysis of scattering from terrain profiles. The procedure uses characteristic basis function method (CBFM), which is hybridized with the forward-backward method (FBM), to reduce the storage requirements of the resultant Method of Moments (MoM) impedance matrix, as well as to accelerate the solution procedure. Numerical results in the form of induced current and scattered field are presented to assess the accuracy and efficiency of the solution procedure.

Scalable Concurrent Hash Tables Via Relativistic Programming, Josh Triplett

Computer Science Faculty Publications and Presentations

Existing approaches to concurrent programming often fail to account for synchronization costs on modern shared-memory multipro- cessor architectures. A new approach to concurrent programming, known as relativistic programming, can reduce or in some cases eliminate synchronization overhead on such architectures. This approach avoids the costs of inter-processor communication and memory access by permitting processors to operate from a relativistic view of memory provided by their own caches, rather than from an absolute reference frame of memory as seen by all processors. This research shows how relativistic programming techniques can provide the perceived advantages of optimistic synchronization without the useless parallelism …

Reconstructing Images As Piecewise Smooth Functions, Ralf Juengling

Computer Science Faculty Publications and Presentations

Leclerc’s approach to image reconstruction consists of finding the shortest description of the data (an image) as a model (reconstruction) plus noise [5]. The approach poses two design problems: 1. Define an appropriate description language for image models and noise, 2. Derive an objective function and conceive an optimization algorithm that finds good local minima. Leclerc proposed to model images as piecewise low order polynomials and to describe models in terms of region boundaries (discontinuity set) and polynomial coefficients.

In this report I describe Leclerc’s methodology, and, adopting his image model and description language, derive an objective function within this …

Traffic Analysis Of Udp-Based Flows In Ourmon, Jim Binkley, Divya Parekh

Computer Science Faculty Publications and Presentations

We present a custom UDP flow tuple with an IP address key and a set of simple related statistical attributes. Attributes are used to calculate a per host metric called the UDP work weight which roughly measures the amount of network noise caused by a host. The work weight is used to produce a near real-time sorted top N report for UDP host tuples. We also present a derived attribute based on an algorithm called the UDP guesstimator. The UDP guesstimator roughly classifies port report hosts into various traffic categories including security threats (DOS/scanning) or P2P hosts based on high …

Patterns Of Aspect-Oriented Design, Black P. Andrew, James Noble, David J. Pearce, Arno Scmidmeir

Computer Science Faculty Publications and Presentations

Aspect-oriented programming languages are becoming commonplace, and programmers are accumulating experience in building and maintaining aspect-oriented systems. This paper addresses how the use of these languages affects program design: how aspect-oriented languages change the design space, which designs should be emulated and which avoided, and the strengths and weaknesses of particular kinds of design. We identify five patterns of aspect-oriented design: Spectator, Regulator, Patch, Extension, and Heterarchical Design. For each pattern, we describe the problem it solves, show how aspect-oriented language features are used in the pattern, give characteristic examples of the pattern’s use, and assess its benefits and liabilities. …

Refactoring Tools: Fitness For Purpose, Emerson Murphy-Hill, Andrew P. Black

Computer Science Faculty Publications and Presentations

Refactoring tools can improve the speed and accuracy with which we create and maintain software -- but only if they are used. In practice, tools are not used as much as they could be: this seems to be because sometimes they do not align with the refactoring tactic preferred by the majority of programmers, a tactic we call floss refactoring. We propose five principles that characterize successful floss refactoring tools -- principles that can help programmers to choose the most appropriate refactoring tools and also help toolsmiths to design tools that fit the programmer's purpose.

Multi-View Approaches To Tracking, 3d Reconstruction And Object Class Detection, Saad Khan

Electronic Theses and Dissertations

Multi-camera systems are becoming ubiquitous and have found application in a variety of domains including surveillance, immersive visualization, sports entertainment and movie special effects amongst others. From a computer vision perspective, the challenging task is how to most efficiently fuse information from multiple views in the absence of detailed calibration information and a minimum of human intervention. This thesis presents a new approach to fuse foreground likelihood information from multiple views onto a reference view without explicit processing in 3D space, thereby circumventing the need for complete calibration. Our approach uses a homographic occupancy constraint (HOC), which states that if …

Improving Branch Prediction Accuracy Via Effective Source Information And Prediction Algorithms, Hongliang Gao

Electronic Theses and Dissertations

Modern superscalar processors rely on branch predictors to sustain a high instruction fetch throughput. Given the trend of deep pipelines and large instruction windows, a branch misprediction will incur a large performance penalty and result in a significant amount of energy wasted by the instructions along wrong paths. With their critical role in high performance processors, there has been extensive research on branch predictors to improve the prediction accuracy. Conceptually a dynamic branch prediction scheme includes three major components: a source, an information processor, and a predictor. Traditional works mainly focus on the algorithm for the predictor. In this dissertation, …