Digital Commons Network^™

Problem Solving In Human Beings And Computers (Formerly: Heuristic Problem Solving), Zygmunt Pizlo, Anupam Joshi, Scott M. Graham

Department of Computer Science Technical Reports

No abstract provided.

R-By-C Crozzle: An Np-Hard Problem, Michelle Gower, Ralph Wilkerson

Computer Science Technical Reports

In an Auslralian magazine, a monetary prize is awarded to the person with the best answer to a word puzzle called a Crozzle. Each valid placement of given words into a 10x 15 grid is given a score, and the best answer is the placement with the largest score. Various search techniques have been utilized lo solve this problem. No one has shown whether there is a polynomial-time algorithm to find the best Crozzle. This paper proves that the Crozzle is in NP. It also creates a similar word puzzle, called R-by-C Crozzle, by lifting the constraint on the grid …

Cognitive Engineering For Intelligent Man-Machine Systems, Erika Rogers

Computer Science and Software Engineering

This paper discusses a methodology for cognitive engineering which provides a framework for the cognitive studies→intelligent system development→cognitive studies cycle. The methodology has been developed to address the problem of providing knowledge-based cooperative assistance in visual reasoning tasks, and is discussed in terms of its impact on three different application domains: diagnostic radiology, geographical information systems, and tele-assisted robot supervision.

Does Pedagogy Make A Difference?: An Experimental Study Of Unethical Behavior In Information Systems, Deepak Khazanchi

Information Systems and Quantitative Analysis Faculty Publications

Jn the past few years ethics education has received increasing attention from the business and academic communities. Many have instituted pedagogical programs for increasing awareness of ethical issues, ethical norms and codes of conduct in different professions. It appears that both researchers and practitioners are in agreement about the need for providing adequate ethics education to managers (13, 20, 9). This has become especially important in the context of the information systems (IS) discipline. Proliferation of information and communication technologies has raised many questions on what constitutes ethical managerial behavior. Researchers have reported that the existence of a computer-based information …

Improved Algorithms For Bipartite Network Flow, Ravindra K. Ahuja, James B. B. Orlin, Clifford Stein, Robert E. Tarjan

Dartmouth Scholarship

In this paper, network flow algorithms for bipartite networks are studied. A network G = (V,E) is called bipartite if its vertex set V can be partitioned into two subsets V_1 and V_2 such that all edges have one endpoint in V_1 and the other in $V_2 $. Let $n = |V|, n_1 = |V_1 | , n_2 = |V_2 |, m = |E| and assume without loss of generality that n_1 \leqslant n_2. A bipartite network is called unbalanced if n_1 \ll n_2 $ and balanced otherwise. (This notion is necessarily imprecise.) It is shown that several maximum flow …

On Editability Of Feature-Based Design, Xiangping Chen, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

Asymptotically Optimal Heuristics For Bottleneck And Capacity Optimization Problems, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Bit-Sequences: A Cache Invalidation Algorithm In Mobile Environments, Jin Jing, Omran Bukhres, Ahmed K. Elmagarmid, Rafael Alonso

Department of Computer Science Technical Reports

No abstract provided.

Geometric Contraints For Cagd, Christoph M. Hoffmann, Jörg Peters

Department of Computer Science Technical Reports

No abstract provided.

Distributed Lock Management For Mobile Transactions, Jin Jing, Omran Bukhres, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

A Pattern Matching Model For Misuse Intrusion Detection, Sandeep Kumar, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Viewing A Graph In A Virtual Reality Display Is Three Times As Good As A 2d Diagram, Colin Ware, Glenn Franck

Center for Coastal and Ocean Mapping

An experiment is reported which tests whether network information is more effectively displayed in a three dimensional space than in a two dimensional space. The experimental task is to trace a path in a network and the experiment is carried out in 2D, in a 3D stereo view, in a 2D view with head coupled perspective, and in a 3D stereo view with head coupled perspective; this last condition creates a localized virtual reality display. The results show that the motion parallax obtained from the head coupling of perspective is more important than stereopsis in revealing structural information. Overall the …

Biofeedback Gait Training Auditory Vs. Visual Techniques, Timothy D. Hiemenz

Electrical & Computer Engineering Theses & Dissertations

Training lower extremity amputees to walk normally is quite a difficult task. Amputees must wear a prosthesis so they can walk at all. This allows them some mobility, but their walking pattern may be unnatural. If their gait is temporally asymmetric, they need to exert more energy to move about. This research was initiated to help lower extremity amputees to walk more efficiently using biofeedback gait training. Two types of feedback were developed and tested to determine which method gave the most understandable feedback, validating its use in a clinical setting.

A normal gait cycle uses the lower limbs to …

Spiders: A New User Interface For Rotation And Visualization Of N-Dimensional Point Sets, William A. Barrett, Kirk L. Duffin

Faculty Publications

We present a new method for creating n-dimensional rotation matrices from manipulating the projections of n-dimensional data coordinate axes onto a viewing plane. A user interface for n-dimensional rotation is implemented. The interface is shown to have no rotational hysteresis.

Fluted Formulas And The Limits Of Decidability, William C. Purdy

Electrical Engineering and Computer Science - Technical Reports

In the predicate calculus, variables provide a flexible indexing service that selects the actual arguments to a predicate letter from among possible arguments that precede the predicate letter (in the parse of the formula). In the process of selection, the possible arguments can be permuted, repeated (used more than once), and skipped. If this service is withheld, so that arguments must be the immediately preceding ones, taken in the order in which they occur, the formula is said to be fluted. Quine showed that if a fluted formula contains only homogeneous conjunction (conjoins only subformulas of equal arity), then the …

A Domain-Specific Parallel Programming System I: Design And Application To Ecological Modelling, Elaine Wenderholm, Micah Beck

Electrical Engineering and Computer Science - Technical Reports

The goal of the εm project is to make parallel programming easily accessible to a broad community of scientists. Previous approaches such as the use of general parallel programming languages and parallelizing compilers for sequential languages have fallen short in this respect. The approach is to design a special purpose programming language which is oriented towards a specific area of application. The result is a specialized and effective scientific tool. εm is a high-level programming system which puts parallelism into the hands of scientists who are not sophisticated programmers. By restricting and simplifying the programming interface, εm eases both the …

An Analytic Approach For The Asymptotic Distribution Of The Height Of An Incomplete Digital Tree, Hosam Mahmoud, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Interpolation Regions For Convex Low Degree Polynomial Curve Segments, Jörg Peters

Department of Computer Science Technical Reports

No abstract provided.

Constraint-Based Parametric Conics For Cad, Ioannis Fudos, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

Science Pad: An Intelligent Electronic Notepad For Ubiquitous Scientific Computing, Anupam Joshi, Sanjiva Weerawarana, Tzvetan T. Drashansky, Elias N. Houstis

Department of Computer Science Technical Reports

No abstract provided.

Processing Pde Interface Conditions Ii, Tzvetan Drashansky, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Path-Planning For A Mobile Robot Sweeper, Chandrajit Bajaj, Fausto Bernardini, Steve Cutchin, Kokichi Sugihara

Department of Computer Science Technical Reports

No abstract provided.

How To Program In Ccsp, Beth Arrowsmith

Computer Science Technical Reports

No abstract provided.

Stability Criteria For Queueing Networks With A Monotonicity Property, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Problem Solving Environments For Partial Differential Equation Based Applications (Ph.D. Thesis), Sanjiva Weerawarana

Department of Computer Science Technical Reports

No abstract provided.

Modeling With Collaborating Pde Solvers - Theory And Practice, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Performance Of Combined Diversity Reception And Convolutional Coding For Qdpsk Land Mobile Radio, Huafei Zhou, Robert H. Deng, T. T. Tjhung

Research Collection School Of Computing and Information Systems

Diversity reception and error correction coding are powerful techniques to combat multipath fading encountered in mobile radio communications. In order to improve the transmission performance of the ?/4-shift QDPSK signal in mobile radio channels, the authors propose a new scheme of combined coding and diversity reception, i.e., combination of diversity reception employing code combining (CC) and convolutional coding employing error-and erasure correction Viterbi decoding. They also consider another combination scheme, i.e., combination of diversity reception employing postdetection maximal ratio combining (MRC) and convolutional coding employing hard decision Viterbi decoding. They theoretically analyze the performance of the schemes taking into account …

Optimum Symbol-By-Symbol Detection Of Uncoded Digital Data Over The Gaussian Channel With Unknown Carrier Phase, Pooi Yuen Kam, Seng Siew Ng, Tock Soon Ng

Research Collection School Of Computing and Information Systems

A theory of optimum receiver design for symbol-by-symbol detection of an uncoded digital data sequence received over the Gaussian channel with unknown carrier phase is presented. Linear suppressed-carrier modulation is assumed. The work here aims at laying a conceptual foundation for optimum symbol-by-symbol detection, and rectifies existing approaches to the problem. The optimum receiver structure is obtained explicitly for an arbitrary carrier phase model, but its computational requirements are too heavy in general for any practical implementation. In one important special case, namely, the case in which the carrier phase can be treated as a constant over some K+1 symbol …

Teaching The Practice Of Formal Methods In Distributed Computing Systems - A Module, Beth Arrowsmith, Bruce Mcmillin

Computer Science Technical Reports

No abstract provided.

A Detailed Simulation Model Of The Hp 97560 Disk Drive, David Kotz, Song Bac Toh, Sriram Radhakrishnan

Computer Science Technical Reports

We implemented a detailed model of the HP 97560 disk drive, to replicate a model devised by Ruemmler and Wilkes (both of Hewlett-Packard, HP). Our model simulates one or more disk drives attached to one or more SCSI buses. The design is broken into three components: a test driver, the disk model itself, and the discrete-event simulation support. Thus, the disk model can be easily extracted and used in other simulation environments. We validated our model using traces obtained from HP, using the same "demerit" measure as Ruemmler and Wilkes. We obtained a demerit percentage of 3.9%, indicating that our …