Computer Engineering Commons^™

Performance And Analysis Of Transfer Control Protocol Over Voice Over Wireless Local Area Network, Rajendra Patil

Morehead State Theses and Dissertations

A thesis presented to the faculty of the College of Science and Technology at Morehead State University in partial fulfillment of the requirements for the Degree Master of Science by Rajendra Patil in August of 2008.

Service Oriented Transitive Closure Solution, Jonathan Baran

Computer Science and Computer Engineering Undergraduate Honors Theses

The goal of this project is a service based solution that utilizes parallel and distributed processing algorithms to solve the transitive closure problem for a large dataset. A dataset may be view conceptually as a table in a database, with a physical structure representing a file containing a sequence of records and fields. Two records are said to be transitively related if and only if they are directly related due to sharing of one or more specific fields, or a sequence may be made from one record to the other under the condition that all intermediate entries are related the …

Hypothesis Testing With Interval Data: Case Of Regulatory Constraints, Sa-Aat Niwitpong, Hung T. Nguyen, Ingo Neumann, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, there exist regulatory thresholds: e.g., a concentration of certain chemicals in the car exhaust cannot exceed a certain level, etc. If we know the exact value of the corresponding quantity, then we can immediately tell whether, e.g., a car design resulting in this value is acceptable (below the threshold) or not acceptable (above the threshold). In practice, however, the value of the desired quantity comes from measurements or from expert estimates; in both cases, the resulting estimates are not 100% accurate. It is therefore necessary to make an accept/reject decision based on this estimate, i.e., based …

Computing Degrees Of Subsethood And Similarity For Interval-Valued Fuzzy Sets: Fast Algorithms, Hung T. Nguyen, Vladik Kreinovich

Departmental Technical Reports (CS)

We propose fast algorithms for computing degrees of subsethood and similarity for interval-valued fuzzy sets.

Choquet Integrals And Owa Criteria As A Natural (And Optimal) Next Step After Linear Aggregation: A New General Justification, Francois Modave, Martine Ceberio, Vladik Kreinovich

Departmental Technical Reports (CS)

In multi-criteria decision making, it is necessary to aggregate (combine) utility values corresponding to several criteria (parameters). The simplest way to combine these values is to use linear aggregation. In many practical situations, however, linear aggregation does not fully adequately describe the actual decision making process, so non-linear aggregation is needed.

From the purely mathematical viewpoint, the next natural step after linear functions is the use of quadratic functions. However, in decision making, a different type of non-linearities are usually more adequate than quadratic ones: non-linearities like OWA or Choquet integral that use min and max in addition to linear …

Extracting Trust Network Information From Scientific Web Portals, Alejandro Castaneda, Paulo Pinheiro Da Silva

Departmental Technical Reports (CS)

An increased exchange of (scientific) information across organizations and disciplines is one of the long-term goals of the semantic web. In any such exchange of information, it is not difficult to identify one or more (scientific) communities responsible for the measurement, gathering and processing of scientific information. More challenging, however, is to understand the trust relations between members of these communities, whether the members are organizations or people. With a better understanding of trust relations, one may be able to compute trust recommendations for scientific information exchange, increasing in this way the acceptance of information by scientists. In this paper, …

Intermediate Degrees Are Needed For The World To Be Cognizable: Towards A New Justification For Fuzzy Logic Ideas, Hung T. Nguyen, Vladik Kreinovich, J. Esteban Gamez, Francois Modave, Olga Kosheleva

Departmental Technical Reports (CS)

Most traditional examples of fuzziness come from the analysis of commonsense reasoning. When we reason, we use words from natural language like "young", "well". In many practical situations, these words do not have a precise true-or-false meaning, they are fuzzy. One may therefore be left with an impression that fuzziness is a subjective characteristic, it is caused by the specific way our brains work.

However, the fact that that we are the result of billions of years of successful adjusting-to-the-environment evolution makes us conclude that everything about us humans is not accidental. In particular, the way we reason is not …

Computing The K-Hop Neighborhoods In Wireless Networks Locally, Iyad A. Kanj, Andreas Wiese, Fenghui Zhang

Technical Reports

A k-local distributed algorithm (k is a natural number) is a distributed algorithm in which the computation at every point/device in the distributed system modeled as a graph depends solely on the initial states of the points that are at most k hops away from the point. A distributed algorithm is local if it is k-local for some fixed natural number k. Local distributed algorithms are very important, especially for applications in ad-hoc sensor and wireless networks, since such algorithms are naturally scalable, robust, and fault tolerant. Clearly, an essential component of any k-local distributed algorithm is computing the k-hop …

On The Pseudo-Achromatic Number Problem, Jianer Chen, Iyad A. Kanj, Jie Meng, Gei Xia, Fenghui Zhang

Technical Reports

We study the parameterized complexity of the pseudo-achromatic number problem: Given an undirected graph and a parameter k, determine if the graph can be partitioned into k groups such that every two groups are connected by at least one edge. This problem has been extensively studied in graph theory and combinatorial optimization. We show that the problem has a kernel of at most (k-2)(k+1) vertices that is constructable in time O(m\sqrt{n}), where n and m are the number of vertices and edges, respectively, in the graph, and k is the parameter. This directly implies that the problem is fixed-parameter tractable. …

Preliminary Results With A Targeted Online Java Course, Amber Settle, Will Marrero, Chad Settle

Technical Reports

While the College of Computing and Digital Media has offered online courses for 7 years, courses targeted specifically at online students remain in the minority. In this report, we investigate both student learning and student satisfaction with a targeted online introductory Java course developed by the first co-author. Initial results show that this targeted course has equivalent outcomes with respect to student learning and strongly improved student satisfaction.

Architecture For Intelligent Power Systems Management, Optimization, And Storage., J. Chris Foreman

Electronic Theses and Dissertations

The management of power and the optimization of systems generating and using power are critical technologies. A new architecture is developed to advance the current state of the art by providing an intelligent and autonomous solution for power systems management. The architecture is two-layered and implements a decentralized approach by defining software objects, similar to software agents, which provide for local optimization of power devices such as power generating, storage, and load devices. These software device objects also provide an interface to a higher level of optimization. This higher level of optimization implements the second layer in a centralized approach …

Supporting Collaboration In Mobile Environments, Rohan Sen

All Computer Science and Engineering Research

Continued rapid improvements in the hardware capabilities of mobile computing devices is driving a parallel need for a paradigm shift in software design for such devices with the aim of ushering in new classes of software applications for devices of the future. One such class of software application is collaborative applications that seem to reduce the burden and overhead of collaborations on human users by providing automated computational support for the more mundane and mechanical aspects of a cooperative effort. This dissertation addresses the research and software engineering questions associated with building a workflow-based collaboration system that can operate across …

Distributed Object Tracking Using A Cluster-Based Kalman Filter In Wireless Camera Networks, Henry Medeiros, Johnny Park, Avinash Kak

Electrical and Computer Engineering Faculty Research and Publications

Local data aggregation is an effective means to save sensor node energy and prolong the lifespan of wireless sensor networks. However, when a sensor network is used to track moving objects, the task of local data aggregation in the network presents a new set of challenges, such as the necessity to estimate, usually in real time, the constantly changing state of the target based on information acquired by the nodes at different time instants. To address these issues, we propose a distributed object tracking system which employs a cluster-based Kalman filter in a network of wireless cameras. When a target …

Independent Study On Infinite Graph Theory, Martin Zimmermann

Technical Reports

In this paper we will prove some results about infinite graphs. We show that for every linear order there is a graph with a distinguished vertex such that the edges adjacent to that vertex have the given order in any plane drawing. The other results are concerned with connectivity. We prove a generalization of a characterization of 2-­connected graphs and prove that k-­connectedness does not imply the existence of finite k­connected subgraphs for k > 2.

Toward Formalizing Non-Monotonic Reasoning In Physics: The Use Of Kolmogorov Complexity, Vladik Kreinovich

Departmental Technical Reports (CS)

When a physicist writes down equations, or formulates a theory in any other terms, he usually means not only that these equations are true for the real world, but also that the model corresponding to the real world is "typical" among all the solutions of these equations. This type of argument is used when physicists conclude that some property is true by showing that it is true for "almost all" cases. There are formalisms that partially capture this type of reasoning, e.g., techniques based on the Kolmogorov-Martin-Lof definition of a random sequence. The existing formalisms, however, have difficulty formalizing, e.g., …

Matlab Report, Nancy Hale

Cornerstone 3 Reports : Interdisciplinary Informatics

The objective of this effort is to create a multidisciplinary approach to problem solving using technology. Through Thinkfinity, the Seidenberg School of Computer Science and Information Systems is collaborating with the science and quantitative faculty to create lessons that can be used by high school and first -year college students to work interactively with data to solve problems. MatLab is the tool of choice. It gives the user the ability to create visual models of large data sets and is used in the science and finance areas.

The key features of MatLab:

• Interactive tools for iterative exploration, design, and …

Testing The Value Of A Time-Based Language Model For Speech Recognition, Nisha Kiran, Nigel Ward

Departmental Technical Reports (CS)

Speech recognition relies on the language model in order to decode an utterance, and in general a better language model improves the performance of a speech recognizer. We have recently found that a time-based language model can improve on a standard trigram language model in terms of perplexity. This technical report presents the evaluation of this new language model in the context of speech recognition. First, a basic speech recognizer was built using the HTK tool. Then the recognizer was run using the standard language model and using the time-based one. On a testset of 39,147 words from the Switchboard …

Cs 242: Computer Programming Iii, Guozhu Dong

Computer Science & Engineering Syllabi

No abstract provided.

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will introduce fundamental concepts and paradigms underlying the design of modern programming languages. For concreteness, we study the details of an object-oriented language (e.g. Java), and a functional language (e.g., Scheme). The overall goal is to enable comparison and evaluation of existing languages. The programming assignments will be coded in Java 5 and in Scheme.

Cs 415: Social Implications Of Computing, Leo Finkelstein

Computer Science & Engineering Syllabi

CS 415 is a communication skills course using as its subject matter current salient issues associated with the social implications of computing. In addition to the course text, you will need to use certain reading materials in the library and elsewhere, and you will be responsible for using concepts and theories provided in class lectures and discussions.

Cs 240: Computer Programming I, Travis E. Doom

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.

Cs 205-02: Introduction To Computers And Office Productivity Software, John P. Herzog

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.

Ceg 720-01: Computer Architecture I, Soon M. Chung

Computer Science & Engineering Syllabi

Review of sequential computer architecture and study of parallel computers. Topics include memory hierarchy, reduced instruction set computer; pipeline processing, multiprocessing, various parallel computers, interconnection networks, and fault-tolerant computing. 3 hours lecture and 2 hours lab.

Ceg 233-01: Linux And Windows, Bin Wang

Computer Science & Engineering Syllabi

Introduction to Linux and Windows systems. GUI and Windowing Systems. Files and Directories. Ownership and Sharing. Programs and Processes. System calls, Libraries. Loading. Dynamic linking. Command Line Shells. Scripting languages. Regular expressions. Clients and Servers. Web browser clients and HTTPS. System Administration. 4 credit hours. 3 hours labs, 2 hours labs. Prerequisites: None.

Ceg 460/660-01: Computer Engineering, Eric Maston

Computer Science & Engineering Syllabi

This course is concerned with the techniques of designing and constructing large program. Some of the required basic concepts necessarily have to be developed using small programs as examples. To this extent, we also study programming-in-the-small. The overall objectives are to present an overview of issues in the development of software, to discuss terminology, to illustrate via example case studies, and to give sufficiently detailed advice on how to develop quality software. Hands-on experience is emphasized through the use of homework and a class project.

Ceg 720-01: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 433/633-01: Operating Systems, Yong Pei

Computer Science & Engineering Syllabi

This course provides an introduction to operating system design. Topics to be covered include: Operating system structures, Operating system interfaces, Process management and scheduling, Inter-process communication, File systems and Memory management and Device access.

Ceg 360/560-01: Digital System Design, Travis E. Doom

Computer Science & Engineering Syllabi

Design of digital systems. Topics include flip-flops, registers, counters, programmable logic devices, memory devices, register-level design, and microcomputer system organization. Students must show competency in the design of digital systems. 3 hours lecture, 2 hours lab. Prerequisite: CEG 260.

Cs 241: Computer Programming Ii, Eric Maston

Computer Science & Engineering Syllabi

This is the second course in the Introduction to Computer Programming series. A continuation of CS240. The emphasis is on data abstraction and software development. Prerequisite: CS240.

Immersive Active Learning For Virtual Laboratory Experiments, Swetha Punnandla

Electrical & Computer Engineering Theses & Dissertations

A Laboratory Immersive Interactive Virtual Environment (LIIVE) for scientific experiments is developed using MAY A and Virtools. The LIIVE is used as a pre-lab practice module to familiarize the students with the equipment, procedure and parameters involved in a laboratory experiment. The system has been assessed for its effectiveness as a learning tool by administering a project and a quiz to each participant and conducting a structured observation during the actual laboratory experiment on the real equipment. The learning effect achieved by the LIIVE is compared to the learning effects obtained by the less immersive 2D virtual environment and the …