Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 31081 - 31110 of 31907

Full-Text Articles in Entire DC Network

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

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 Oct 1994

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 …


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

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

Department of Computer Science Technical Reports

No abstract provided.


Representing Nodes And Arcs In 3d Networks, Glenn Franck, Colin Ware Oct 1994

Representing Nodes And Arcs In 3d Networks, Glenn Franck, Colin Ware

Center for Coastal and Ocean Mapping

This paper introduces six graphical principles for 30 network displays. These are justified with examples from GraphVisualizer3D, a system developed by the authors to investigate the problems of 30 visualization of information networks. GraphVisualizer3D enables the exploration of sulface color, surface texture, object shape, arc shape and labeling conventions.


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

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 Sep 1994

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 Empirical Study On End Users' Update Performance For Different Abstraction Levels, Hock Chuan Chan, Kwok Kee Wei, Keng Siau Sep 1994

An Empirical Study On End Users' Update Performance For Different Abstraction Levels, Hock Chuan Chan, Kwok Kee Wei, Keng Siau

Research Collection School Of Computing and Information Systems

Recent laboratory experiments have shown a strong tendency that database users can perform better at the conceptual level than at the logical level. The experiments measured users’ performance for the tasks of database design and database retrieval. Besides database design and retrieval, the third major database task is update. User performance for updates has not been measured. With the widespread availability of databases, updates will be done frequently by end-users. This task is gaining in importance as a measure of the usability of a database system. An experiment was conducted to measure the effect of different abstraction levels on user …


Objects To The Rescue! Or Httpd: The Next Generation Operating System, Andrew P. Black, Jonathan Walpole Sep 1994

Objects To The Rescue! Or Httpd: The Next Generation Operating System, Andrew P. Black, Jonathan Walpole

Computer Science Faculty Publications and Presentations

This position paper suggests that object-oriented operating systems may provide the means to meet the ever-growing demands of applications. As an example of a successful OOOS, we cite the http daemon. To support the contention that httpd is in fact an operating system, we observe that it implements uniform naming, persistent objects and an invocation meta-protocol, specifies and implements some useful objects, and provides a framework for extensibility.We also believe that the modularity that is characteristic of OO systems should provide a performance benefit rather than a penalty. Our ongoing work in the Synthetix project at OGI is exploring the …


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

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

Department of Computer Science Technical Reports

No abstract provided.


Dynamic File-Access Characteristics Of A Production Parallel Scientific Workload, David Kotz, Nils Nieuwejaar Aug 1994

Dynamic File-Access Characteristics Of A Production Parallel Scientific Workload, David Kotz, Nils Nieuwejaar

Computer Science Technical Reports

Multiprocessors have permitted astounding increases in computational performance, but many cannot meet the intense I/O requirements of some scientific applications. An important component of any solution to this I/O bottleneck is a parallel file system that can provide high-bandwidth access to tremendous amounts of data in parallel to hundreds or thousands of processors. Most successful systems are based on a solid understanding of the characteristics of the expected workload, but until now there have been no comprehensive workload characterizations of multiprocessor file systems. We began the CHARISMA project in an attempt to fill that gap. We instrumented the common node …


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

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

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 Aug 1994

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 Aug 1994

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 …


Metrics To Evaluate Academic Departments, John R. Rice Jul 1994

Metrics To Evaluate Academic Departments, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Automated Manpower Rostering: Techniques And Experience, C. M. Khoong, Hoong Chuin Lau, L. W. Chew Jul 1994

Automated Manpower Rostering: Techniques And Experience, C. M. Khoong, Hoong Chuin Lau, L. W. Chew

Research Collection School Of Computing and Information Systems

We present ROMAN, a comprehensive, generic manpower rostering toolkit that successfully handles a wide spectrum of work policies found in service organizations. We review the use of various techniques and methodologies in the toolkit that contribute to its robustness and efficiency, and relate experience gained in addressing manpower rostering problems in industry.


Analysis Of Myoelectrical Signals For Building A Dextrous Hand, Christopher T. Creel, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka Jun 1994

Analysis Of Myoelectrical Signals For Building A Dextrous Hand, Christopher T. Creel, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka

Electrical Engineering and Computer Science - Technical Reports

We analyze techniques for myoelectrical signals classification for the purpose of designing a multifunctional prosthetic device for human amputees. The main advantage of our system over existing models is that it is more robust, easier to work with, more general, and efficient enough to run in real time. We achieve this with the help of "Supervised Growing Cell Structures." an artificial neural network model designed by Fritzke [10]. The current paper focuses on the flexion of the index, middle and ring fingers, as these are the most difficult movements to tackle.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 6, June 1994, College Of Engineering And Computer Science, Wright State University Jun 1994

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 6, June 1994, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


A Recursive Least Squares Training Algorithm For Multilayer Recurrent Neural Networks, Q. Xu, K. Krishnamurthy, Bruce M. Mcmillin, Wen Feng Lu Jun 1994

A Recursive Least Squares Training Algorithm For Multilayer Recurrent Neural Networks, Q. Xu, K. Krishnamurthy, Bruce M. Mcmillin, Wen Feng Lu

Mechanical and Aerospace Engineering Faculty Research & Creative Works

Recurrent neural networks have the potential to perform significantly better than the commonly used feedforward neural networks due to their dynamical nature. However, they have received less attention because training algorithms/architectures have not been well developed. In this study, a recursive least squares algorithm to train recurrent neural networks with an arbitrary number of hidden layers is developed. The training algorithm is developed as an extension of the standard recursive estimation problem. Simulated results obtained for identification of the dynamics of a nonlinear dynamical system show promising results.


A Conceptual Model For Multimedia Database Systems, Shunge Li, Xiangning Liu, Bharat Bhargava Jun 1994

A Conceptual Model For Multimedia Database Systems, Shunge Li, Xiangning Liu, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.


Eppod: A Problem Solving Environment For Parallel Electronic Prototyping Of Physical Object Design, Poting Wu, Elias N. Houstis, John R. Rice Jun 1994

Eppod: A Problem Solving Environment For Parallel Electronic Prototyping Of Physical Object Design, Poting Wu, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Production And Decay Of D1 (2420)0 And D2* (2460)0, Avery, P.; Et Al., M. Thulasidas Jun 1994

Production And Decay Of D1 (2420)0 And D2* (2460)0, Avery, P.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 5, May 1994, College Of Engineering And Computer Science, Wright State University May 1994

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 5, May 1994, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A twelve page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


The Roles Of Models, Software Tools, And Applications In High Performance Computing, Leah H. Jamieson, Susanne E. Hambrusch, Ashfaq A. Khokhar, Edward J. Delp May 1994

The Roles Of Models, Software Tools, And Applications In High Performance Computing, Leah H. Jamieson, Susanne E. Hambrusch, Ashfaq A. Khokhar, Edward J. Delp

Department of Computer Science Technical Reports

No abstract provided.


Load Balancing The Heat Equation In A Heterogeneous Environment With Pvm, N. Nemer-Preece, L. Mullin May 1994

Load Balancing The Heat Equation In A Heterogeneous Environment With Pvm, N. Nemer-Preece, L. Mullin

Computer Science Technical Reports

Parallel processing is maturing with the ability to program heterogeneous environments and the help of networking systems such as PVM. Heterogeneous multiprocessing has been revolutionized due to tools such as PVM which allows the user to develop code independent of the machine arthitecture. This thesis develops a load balancing algorithm to handle the time march problem, heat conduction. It is based on the speeds of the machines in the current environment.

The heat equation algorithm is enhanced by the Psi Calculus of a Mathematics of Arrays. \l' Calculus allows the indexing of the heat matrix in terms of starts, stops …


Polylog Depth Circuits For Integer Factoring And Discrete Logarithms, Jonathan P. Sorenson Apr 1994

Polylog Depth Circuits For Integer Factoring And Discrete Logarithms, Jonathan P. Sorenson

Scholarship and Professional Work - LAS

AbstractIn this paper, we develop parallel algorithms for integer factoring and for computing discrete logarithms. In particular, we give polylog depth probabilistic boolean circuits of subexponential size for both of these problems, thereby solving an open problem of Adleman and Kompella.

Existing sequential algorithms for integer factoring and discrete logarithms use a prime base which is the set of all primes up to a bound B. We use a much smaller value for B for our parallel algorithms than is typical for sequential algorithms. In particular, for inputs of length n, by setting B = nlogdn with d a positive …


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 4, April 1994, College Of Engineering And Computer Science, Wright State University Apr 1994

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 4, April 1994, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


Supporting Complex Data Types In A Relational Distributed Database System, Bharat Bhargava, Yin-He Jiang Apr 1994

Supporting Complex Data Types In A Relational Distributed Database System, Bharat Bhargava, Yin-He Jiang

Department of Computer Science Technical Reports

No abstract provided.


A Multi-Chip Module Implementation Of A Neural Network, Tony R. Martinez, George L. Rudolph, Linton G. Salmon, Matthew G. Stout Mar 1994

A Multi-Chip Module Implementation Of A Neural Network, Tony R. Martinez, George L. Rudolph, Linton G. Salmon, Matthew G. Stout

Faculty Publications

The requirement for dense interconnect in artificial neural network systems has led researchers to seek high-density interconnect technologies. This paper reports an implementation using multi-chip modules (MCMs) as the interconnect medium. The specific system described is a self-organizing, parallel, and dynamic learning model which requires a dense interconnect technology for effective implementation; this requirement is fulfilled by exploiting MCM technology. The ideas presented in this paper regarding an MCM implementation of artificial neural networks are versatile and can be adapted to apply to other neural network and connectionist models.


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 3, March 1994, College Of Engineering And Computer Science, Wright State University Mar 1994

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 3, March 1994, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A twelve page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


Dyadic Wavelet Features For Isolated Word Speaker Dependent Speech Recognition, Stephen Ainge Mar 1994

Dyadic Wavelet Features For Isolated Word Speaker Dependent Speech Recognition, Stephen Ainge

Theses and Dissertations

This research examines the use of dyadic wavelet features for the recognition of speaker dependent isolated word speech. The features were generated using three different wavelet filters-Daubechies 4 coefficient (Db4), Daubechies 20 coefficient (Db20) and a 31 coefficient cubic spline and three different window lengths-15ms, 8ms and 4ms. The accuracy of the standard and over-sampled dyadic wavelet methods were compared. The over-sampled dyadic wavelet method using the Db4 scaling function, with a maximum accuracy of 65.5, was found to be the most accurate of the wavelet methods tested. The accuracy of this over-sampled dyadic Db4 wavelet method was compared to …