Computer Engineering Commons^™

Ontology-Enriched Semantic Space For Video Search, Xiao-Yong Wei, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Multimedia-based ontology construction and reasoning have recently been recognized as two important issues in video search, particularly for bridging semantic gap. The lack of coincidence between low-level features and user expectation makes concept-based ontology reasoning an attractive midlevel framework for interpreting high-level semantics. In this paper, we propose a novel model, namely ontology-enriched semantic space (OSS), to provide a computable platform for modeling and reasoning concepts in a linear space. OSS enlightens the possibility of answering conceptual questions such as a high coverage of semantic space with minimal set of concepts, and the set of concepts to be developed for …

Insults In Your Inbox, M. Thulasidas

Research Collection School Of Computing and Information Systems

Email is a boon at work, but aggressive staff may use it to inflict humiliation. Most of its impact has been positive. An email from the big boss to all@yourcompany, for instance, is a fair substitute for a general communication meet- ing. In smaller teams, email often saves meetings and increases productivity.

A Light-Weight Event-Driven Protocol For Sensor Clustering In Wireless Camera Networks, Henry Medeiros, Johnny Park, Avinash Kak

Electrical and Computer Engineering Faculty Research and Publications

We propose a light-weight event-driven protocol for wireless camera networks to allow for formation and propagation of clusters of cameras for the purpose of collaborative processing during object tracking. Cluster formation is triggered by the detection of objects with specific features. Our protocol allows for simultaneous formation and propagation of multiple clusters. Cameras being directional devices, more than one cluster may track a single object since groups of cameras outside each others communication range may see the same object. Entry into a cluster and cluster membership maintenance require a sensor node to confirm the presence of features of the object …

Route Recovery Schemes For Link And Node Failure And Link Congestion, Ibrahim Takouna

Theses

Link/Node failure occurs frequently causing service disruption in computer networks. Hardware techniques have been developed to protect the network from Link/Node failure. These techniques work in physical layer, therefore their convergence time is very small. On the other hand, many schemes have been proposed to mitigate the failure influence on the network. These schemes work in upper layers such as the network layer. However, hardware solutions faster than other schemes, but they are expensive. Link/Node failure causes all flows which were using the failed link/node are temporarily interrupted till a new path reestablished.

Three recovery algorithms have been proposed that …

M Solutions Good, M-1 Solutions Better, Luc Longpre, William Gasarch, G. W. Walster, Vladik Kreinovich

Departmental Technical Reports (CS)

One of the main objectives of theoretical research in computational complexity and feasibility is to explain experimentally observed difference in complexity.

Empirical evidence shows that the more solutions a system of equations has, the more difficult it is to solve it. Similarly, the more global maxima a continuous function has, the more difficult it is to locate them. Until now, these empirical facts have been only partially formalized: namely, it has been shown that problems with two or more solutions are more difficult to solve than problems with exactly one solution. In this paper, we extend this result and show …

Using Patterns And Composite Propositions To Automate The Generation Of Complex Ltl, Salamah Salamah, Ann Q. Gates, Vladik Kreinovich, Steve Roach

Departmental Technical Reports (CS)

Property classifications and patterns, i.e., high-level abstractions that describe common behavior, have been used to assist practitioners in specifying properties. The Specification Pattern System (SPS) provides descriptions of a collection of patterns. Each pattern is associated with a scope that defines the extent of program execution over which a property pattern is considered. Based on a selected pattern, SPS provides a specification for each type of scope in multiple formal languages including Linear Temporal Logic (LTL). The (Prospec) tool extends SPS by introducing the notion of Composite Propositions (CP), which are classifications for defining sequential and concurrent behavior to represent …

Static Space-Times Naturally Lead To Quasi-Pseudometrics, Hans-Peter A. Kuenzi, Vladik Kreinovich

Departmental Technical Reports (CS)

The standard 4-dimensional Minkowski space-time of special relativity is based on the 3-dimensional Euclidean metric. In 1967, H.~Busemann showed that similar static space-time models can be based on an arbitrary metric space. In this paper, we search for the broadest possible generalization of a metric under which a construction of a static space-time leads to a physically reasonable space-time model. It turns out that this broadest possible generalization is related to the known notion of a quasi-pseudometric.

Towards A More Physically Adequate Definition Of Randomness: A Topological Approach, Vladik Kreinovich

Departmental Technical Reports (CS)

Kolmogorov-Martin-Lof definition describes a random sequence as a sequence which satisfies all the laws of probability. This notion formalizes the intuitive physical idea that if an event has a probability 0, then this event cannot occur. Physicists, however, also believe that if an event has a very small probability, then it cannot occur. In our previous papers, we proposed a modification of the Kolmogorov-Martin-Lof definition which formalizes this idea as well. It turns out that our original definition is too general: e.g., it includes some clearly non-physical situations when the set of all random elements is a one-point set. In …

Towards Efficient Prediction Of Decisions Under Interval Uncertainty, Van Nam Huynh, Vladik Kreinovich, Yoshiteru Nakamori, Hung T. Nguyen

Departmental Technical Reports (CS)

In many practical situations, users select between n alternatives a1, ..., an, and the only information that we have about the utilities vi of these alternatives are bounds vi- <= vi <= v-+. In such situations, it is reasonable to assume that the values vi are independent and uniformly distributed on the corresponding intervals [vi-,vi+]. Under this assumption, we would like to estimate, for each i, the probability pi that the alternative ai will be selected. In this paper, we provide efficient algorithms for computing these probabilities.

Exploration Of Dynamic Memory, Delvin Curvin Defoe

All Computer Science and Engineering Research

Since the advent of the Java programming language and the development of real-time garbage collection, Java has become an option for implementing real-time applications. The memory management choices provided by real-time garbage collection allow for real-time eJava developers to spend more of their time implementing real-time solutions. Unfortunately, the real-time community is not convinced that real-time garbage collection works in managing memory for Java applications deployed in a real-time context. Consequently, the Real-Time for Java Expert Group formulated the Real-Time Specification for Java (RTSJ) standards to make Java a real-time programming language. In lieu of garbage collection, the RTSJ proposed …

Localization With Limited Sensing, Jason M. O'Kane, Steven M. Lavalle

Faculty Publications

Localization is a fundamental problem for many kinds of mobile robots. Sensor systems of varying ability have been proposed and successfully used to solve the problem. This paper probes the lower limits of this range by describing three extremely simple robot models and addresses the active localization problem for each. The robot, whose configuration is composed of its position and orientation, moves in a fully-known, simply connected polygonal environment. We pose the localization task as a planning problem in the robot's information space, which encapsulates the uncertainty in the robot's configuration. We consider robots equipped with: 1) angular and linear …

Cost-Time Sensitive Decision Tree With Missing Values, Shichao Zhang, Xiaofeng Zhu, Jilian Zhang, Chengqi Zhang

Research Collection School Of Computing and Information Systems

Cost-sensitive decision tree learning is very important and popular in machine learning and data mining community. There are many literatures focusing on misclassification cost and test cost at present. In real world application, however, the issue of time-sensitive should be considered in cost-sensitive learning. In this paper, we regard the cost of time-sensitive in cost-sensitive learning as waiting cost (referred to WC), a novelty splitting criterion is proposed for constructing cost-time sensitive (denoted as CTS) decision tree for maximal decrease the intangible cost. And then, a hybrid test strategy that combines the sequential test with the batch test strategies is …

Channel Management In Heterogeneous Cellular Networks, Mohammad Hadi Arbabi

Computer Science Theses & Dissertations

Motivated by the need to increase system capacity in the face of tight FCC regulations, modem cellular systems are under constant pressure to increase the sharing of the frequency spectrum among the users of the network.

Key to increasing system capacity is an efficient channel management strategy that provides higher capacity for the system while, at the same time, providing the users with Quality of Service guarantees. Not surprisingly, dynamic channel management has become a high profile topic in wireless communications. Consider a highly populated urban area, where mobile traffic loads are increased due to highway backups or sporting events. …

Sheep Updates 2007 - Part 4, Dean Thomas, Dominique Blache, Dean Revell, Hayley Norman, Phil Vercoe, Zoey Durmic, Serina Digby, Di Mayberry, Megan Chadwick, Martin Sillence, David Masters, R. Silberstein, F. Byrne, P. G. H. Nichols, J. Young, L. Aitkins, M. G. Wilmot, A. J. Rintoul, T. Lambert, D. R. Mcclements, P. Raper, P. Ward, C. Walton, T. York, David Pethick, David Hopkins, Malcolm Mcphee, D. B. Savage, J. V. Nolan, I. R. Godwin, A. Aoetpah, T. Nguyen, N. Baillie, C. Lawler, Ken Geenty, John Smith, Darryl Smith, Tim Dyall, Grant Uphill, John Young, Michael Paton, John Dorrian

Sheep Updates

This session covers eight papers from different authors:

GRAZING

1. The impact of high dietary salt and its implications for the management of livestock grazing saline land, Dean Thomas, Dominique Blache, Dean Revell, Hayley Norman, Phil Vercoe, Zoey Durmic, Serina Digby, Di Mayberry, Megan Chadwick, Martin Sillence and David Masters, CRC for Plant-based Management of Dryland Salinity, Faculty of Natural & Agricultural Sciences, The University of Western Australia, WA.

2. Sustainable Grazing on Saline Lands - outcomes from the WA1 research project, H.C. Norman^1,2, D.G. Masters^1,2, R. Silberstein^1,2, F. Byrne^2,3, P.G.H. Nichols …

Sheep Updates 2007 - Part 2, Ian Mcfarland, Catherine Stockman, Anne Barnes, David Pethick, Jenny Davis, Brett Thompson, Ron Leng, Sally Pieruzzini, Elizabeth Jackson, Mohammed Quaddus, Nazrul Islam, John Stanton, Melanie Dowling

Sheep Updates

This session covers six papers from different authors:

CONCURRENT SESSIONS

FINISHING LAMB AND BEEF

1. Precision Feedlot Lamb, Ian McFarland, Department of Agriculture and Food, Western Australia

2. Feeding sheep under high heat load did not decrease intake of feedlot rations, Catherine Stockman, Department of Agriculture and Food, Western Australia & Murdoch University, Anne Barnes, Murdoch University David Pethick, Murdoch University

3. Taking the stress out of fifishing lambs and cattle - EasyFeed solutions, Jenny Davis, Brett Thomson, Milne AgriGroup, Welshpool WA, Ron Leng, Emeritus Professor, University of New England, Armidale, NSW

WOOL

4. DAFWA …

Extended Abstract Rotopod: A Novel Approach To Efficient Legged Locomotion, Damian M. Lyons

Faculty Publications

A number of attempts have been made to integrate the efficiency of wheeled locomotion with the terrain versatility of legged locomotion, e.g., Univ.Michigan’s Rhex platform and Case Western’s Whegs. Those platforms cast legs as rotating spokes placed traditionally at the corners of a rectangular platform. In this paper, we present an alternate approach, with three legs radiating down from a central hub. The energy to move the platform is generated by a rotating reaction mass mounted at the hub and, at rest, rotating parallel to the ground plane.

Our approach is to construct a platform whose natural, uncontrolled motion is …

The Gravity Data Ontology: Laying The Foundation For Workflow-Driven Ontologies, Ann Q. Gates, G. Randy Keller, Flor Salcedo, Paulo Pinheiro Da Silva, Leonardo Salayandia

Departmental Technical Reports (CS)

A workflow-driven ontology is an ontology that encodes discipline-specific knowledge in the form of concepts and relationships and that facilitates the composition of services to create products and derive data. Early work on the development of such an ontology resulted in the construction of a gravity data ontology and the categorization of concepts: "Data," "Method," and "Product." "Data" is further categorized as "Raw Data" and "Derived Data," e.g., reduced data. The relationships that are defined capture inputs to and outputs from methods, e.g., derived data and products are output from methods, as well as other associations that are related to …

Traffic Assignment For Risk Averse Drivers In A Stochastic Network, Ruey L. Cheu, Vladik Kreinovich, Srinivasa R. Manduva

Departmental Technical Reports (CS)

Most traffic assignment tasks in practice are performed by using deterministic network (DN) models, which assume that the link travel time is uniquely determined by a link performance function. In reality, link travel time, at a given link volume, is a random variable. Such stochastic network (SN) models are not widely used because the traffic assignment algorithms are much more computationally complex and difficult to understand by practitioners. In this paper, we derive an equivalent link disutility (ELD) function, for the case of risk averse drivers in a SN, without assuming any distribution of link travel time. We further derive …

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.

Cs 141: Computer Programming I, Eric Maston

Computer Science & Engineering Syllabi

This course provides a general introduction to the fundamentals of computer programming. Examples from and applications to a broad range of problems are given. No prior knowledge of programming is assumed. The concepts covered will be applied to the Java programming language.

Cs 241: Introduction To Computer Science Ii, Haiyun Bian

Computer Science & Engineering Syllabi

This course is the second in the three course sequence "Introduction to Computer Science" offered by the Computer Science department, WSU. Concepts introduced in CS 240 are developed in greater detail and depth with the Java programming language. Topics include object oriented programming, basic sorting algorithms, recursion, graphics, development of user interfaces and exception handling. Student must register for one lecture section and one lab section.

Cs 765: Foundations Of Neurocomputation, Mateen M. Rizki

Computer Science & Engineering Syllabi

This course is designed to help you develop a solid understanding of neural network algorithms and architectures. At the end of this course you should be able to read and critically evaluate most neural network papers published in major journals, (e.g. IEEE Transaction on Neural Networks, Neural Networks, and Neural Computation). In addition, you should be able to implement a broad range of network architectures and learning algorithms for a variety of applications.

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 Science 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-07: 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.

Cs 205-01, 02: Introduction To Computers And Office Productivity Software, Terri Bauer

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.

Cs 205-01: Introduction To Computers And Office Productivity Software, Kim Gros

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, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 404/604-01: Wireless Sensor Networks, Bin Wang

Computer Science & Engineering Syllabi

No abstract provided.

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

Computer Science & Engineering Syllabi

This course is concerned with the techniques of designing and constructing large programs. 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.