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

Physical Sciences and Mathematics Commons

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

Articles 1 - 21 of 21

Full-Text Articles in Physical Sciences and Mathematics

Covert Shells, John Christian Smith Nov 2000

Covert Shells, John Christian Smith

John Christian Smith

The potential for covert communications exist anywhere that legitimate communication channels are in use. In order to maintain control of the channel once exploited, the insertion of a backdoor Trojan horse server, to be used with a client that provides shell access, is often a necessary prerequisite to establishing and using a covert channel long term.

We discuss covert channel communications methods ranging from embedded channels to disguised protocols. What follows is a review of available covert shell tools. The underground, historical evolution of covert shells is reviewed, focusing on selected, available tools, which range from simple encapsulation methods to …


Clustering Irregular Shapes Using High-Order Neurons, H. Lipson, Hava Siegelmann Sep 2000

Clustering Irregular Shapes Using High-Order Neurons, H. Lipson, Hava Siegelmann

Hava Siegelmann

This article introduces a method for clustering irregularly shaped data arrangements using high-order neurons. Complex analytical shapes are modeled by replacing the classic synaptic weight of the neuron by high-order tensors in homogeneous coordinates. In the first- and second-order cases, this neuron corresponds to a classic neuron and to an ellipsoidalmetric neuron. We show how high-order shapes can be formulated to follow the maximum-correlation activation principle and permit simple local Hebbian learning. We also demonstrate decomposition of spatial arrangements of data clusters, including very close and partially overlapping clusters, which are difficult to distinguish using classic neurons. Superior results are …


A Support Vector Method For Clustering, Asa Ben-Hur, David Horn, Hava Siegelmann, Vladimir Vapnik Aug 2000

A Support Vector Method For Clustering, Asa Ben-Hur, David Horn, Hava Siegelmann, Vladimir Vapnik

Hava Siegelmann

We present a novel method for clustering using the support vector machine approach. Data points are mapped to a high dimensional feature space, where support vectors are used to define a sphere enclosing them. The boundary of the sphere forms in data space a set of closed contours containing the data. Data points enclosed by each contour are defined as a cluster. As the width parameter of the Gaussian kernel is decreased, these contours fit the data more tightly and splitting of contours occurs. The algorithm works by separating clusters according to valleys in the underlying probability distribution, and thus …


Oral History Interview With Peter C. Patton, Philip L. Frana Aug 2000

Oral History Interview With Peter C. Patton, Philip L. Frana

Philip L Frana

In this oral history Peter Patton, Chief Technology Officer at Lawson Software in St. Paul, MN, and former Director of Academic Computing at the University of Minnesota, talks about his education at Harvard, his involvement in the development of PLATO courses in the humanities, and his perspectives on the software industry and patenting. Patton also shares his experience with IBM 650, CDC 6600, and Cray installations on several university campuses, his role in Project Safeguard, and his design of the Hennepin Justice ...


Learning From One Example Through Shared Densities On Transform, Erik Learned-Miller, N Matsakis, Paul Viola Jun 2000

Learning From One Example Through Shared Densities On Transform, Erik Learned-Miller, N Matsakis, Paul Viola

Erik G Learned-Miller

We define a process called congealing in which elements of a dataset (images) are brought into correspondence with each other jointly, producing a data-defined model. It is based upon minimizing the summed component-wise (pixel-wise) entropies over a continuous set of transforms on the data. One of the biproducts of this minimization is a set of transform, one associated with each original training sample. We then demonstrate a procedure for effectively bringing test data into correspondence with the data-defined model produced in the congealing process. Subsequently; we develop a probability density over the set of transforms that arose from the congealing …


Neptune: Un Logiciel Pour Les Écoulements De Rivière, Alexandre Martin, Marcelo Reggio, Jean-Yves Trépanier Jun 2000

Neptune: Un Logiciel Pour Les Écoulements De Rivière, Alexandre Martin, Marcelo Reggio, Jean-Yves Trépanier

Alexandre Martin

Une méthodologie de conception et d'analyse est développée pour la simulation des écoulements clans les rivières. La discrétisation des équations de base (Saint-Venant) est établie en fonction du schéma de Roe, développé à l'origine pour des écoulements compressibles non-visqueux. Le domaine est discrétisé en espace avec des triangles ou quadrilatères, clans un contexte de volume-finis, ce qui permet de représenter des géométries complexes. L'imposition des conditions frontières et initiales sont aussi décrites. Toutes les étapes préliminaires à la résolution du problème, ainsi que la visualisation de la solution sont gérées par la famille de logiciels PLANÈTES.


The Complexity Of Decentralized Control Of Markov Decision Processes, Daniel S. Bernstein, Shlolo Zilberstein, Neil Immerman May 2000

The Complexity Of Decentralized Control Of Markov Decision Processes, Daniel S. Bernstein, Shlolo Zilberstein, Neil Immerman

Neil Immerman

Planning for distributed agents with partial state information is considered from a decisiontheoretic perspective. We describe generalizations of both the MDP and POMDP models that allow for decentralized control. For even a small number of agents, the finite-horizon problems corresponding to both of our models are complete for nondeterministic exponential time. These complexity results illustrate a fundamental difference between centralized and decentralized control of Markov processes. In contrast to the MDP and POMDP problems, the problems we consider provably do not admit polynomialtime algorithms and most likely require doubly exponential time to solve in the worst case. We have thus …


Effect Of Carbopol And Polyvinylpyrrolidone On The Mechanical, Rheological, And Release Properties Of Bioadhesive Polyethylene Glycol Gels, Philadelphia University May 2000

Effect Of Carbopol And Polyvinylpyrrolidone On The Mechanical, Rheological, And Release Properties Of Bioadhesive Polyethylene Glycol Gels, Philadelphia University

Philadelphia University, Jordan

No abstract provided.


Fuzzy Neural Network Models For Classification, Arun D. Kulkarni, Charles D. Cavanaugh Apr 2000

Fuzzy Neural Network Models For Classification, Arun D. Kulkarni, Charles D. Cavanaugh

Arun Kulkarni

In this paper, we combine neural networks with fuzzy logic techniques. We propose a fuzzy-neural network model for pattern recognition. The model consists of three layers. The first layer is an input layer. The second layer maps input features to the corresponding fuzzy membership values, and the third layer implements the inference engine. The learning process consists of two phases. During the first phase weights between the last two layers are updated using the gradient descent procedure, and during the second phase membership functions are updated or tuned. As an illustration the model is used to classify samples from a …


Perl For Librarians (Workshop On The Practical Extraction And Reporting Language), Patrick Yott, Christopher Hoebeke Feb 2000

Perl For Librarians (Workshop On The Practical Extraction And Reporting Language), Patrick Yott, Christopher Hoebeke

Christopher H Hoebeke

No abstract provided.


Techniques For Effectively Exploiting A Zero Overhead Loop Buffer, Gang-Ryung Uh, Yuhong Wang, David Whalley, Sanjay Jinturkar, Chris Burns, Vincent Cao Feb 2000

Techniques For Effectively Exploiting A Zero Overhead Loop Buffer, Gang-Ryung Uh, Yuhong Wang, David Whalley, Sanjay Jinturkar, Chris Burns, Vincent Cao

Gang-Ryung Uh

A Zero Overhead Loop Buffer (ZOLB) is an architectural feature that is commonly found in DSP processors. This buffer can be viewed as a compiler managed cache that contains a sequence of instructions that will be executed a specified number of times. Unlike loop unrolling, a loop buffer can be used to minimize loop overhead without the penalty of increasing code size. In addition, a ZOLB requires relatively little space and power, which are both important considerations for most DSP applications. This paper describes strategies for generating code to effectively use a ZOLB. The authors have found that many common …


Reflexive Autopoietic Dissipative Special Systems Theory, Kent D. Palmer Jan 2000

Reflexive Autopoietic Dissipative Special Systems Theory, Kent D. Palmer

Kent D. Palmer

A newly discovered approach to extending General Systems Theory as defined by George Klir through a set of Special Systems is described. General Systems Theory is distinguished from the theory of Meta-systems. Then, a hinge of three special systems is identified between systems and meta-systems. These special systems are defined by algebraic analogies. Anomalous physical phenomena are specified that exemplify the structures defined by the algebraic analogies. The extraordinary efficacious properties of these special systems are explained. These include ultra-efficiency and ultra-effectiveness. These three special systems are called dissipative, autopoietic, and reflexive. They are anomalous within general systems theory and …


Ann As A Tool For Medical Prognosis, Sameem Abdul Kareem Jan 2000

Ann As A Tool For Medical Prognosis, Sameem Abdul Kareem

Sameem Abdul Kareem

The analysis of cancer survival is used to determine the efficiency of treatment programmes and protocols; it is also used to determine the type of treatment. At the individual level a prediction of cancer survival can help patients make informed decisions with regards to their quality of life and future finances. Currently available prediction methods apply to groups of people, and may not be adequate to predict treatment outcome for individual patients. This paper presents a conceptual model of a cancer knowledge base incorporating a computer-based predictor for survival. It proposes the use of an artificial neural network (ANN) as …


Unified Matrix Processor Design For Fct-Iv And Fst-Iv Hartley Based Transforms, Philadelphia University Jan 2000

Unified Matrix Processor Design For Fct-Iv And Fst-Iv Hartley Based Transforms, Philadelphia University

Philadelphia University, Jordan

No abstract provided.


Interactive Real Analysis. / Glossary, Bert Wachsmuth Dec 1999

Interactive Real Analysis. / Glossary, Bert Wachsmuth

Bert Wachsmuth

No abstract provided.


Logic-Based Methods For Optimization: Combining Optimization And Constraint Satisfaction, John Hooker Dec 1999

Logic-Based Methods For Optimization: Combining Optimization And Constraint Satisfaction, John Hooker

John Hooker

No abstract provided.


Collaborative Activity Between Parietal And Dorso-Lateral Prefrontal Cortex In Dynamic Spatial Working Memory Revealed By Fmri, Vaibhav A. Diwadkar, Patricia A. Carpenter, Marcel Adam Just Dec 1999

Collaborative Activity Between Parietal And Dorso-Lateral Prefrontal Cortex In Dynamic Spatial Working Memory Revealed By Fmri, Vaibhav A. Diwadkar, Patricia A. Carpenter, Marcel Adam Just

Marcel Adam Just

No abstract provided.


Automatic Segmentation And Indexing In A Database Of Bird Images, Madirakshi Das, R. Manmatha Dec 1999

Automatic Segmentation And Indexing In A Database Of Bird Images, Madirakshi Das, R. Manmatha

R. Manmatha

The aim of this work is to index images in domain specific databases using colors computed from the object of interest only, instead of the whole image. The main problem in this task is the segmentation of the region of interest from the background. Viewing segmentation as a figure/ground segregation problem leads to a new approach - eliminating the background leaves the figure or object of interest. To find possible object colors, we first find background colors and eliminate them. We then use an edge image at an appropriate scale to eliminate those parts of the image which are not …


The Neural Basis Of Strategy And Skill In Sentence-Picture Verification, Erik D. Reichle, Patricia A. A. Carpenter, Marcel Adam Just Dec 1999

The Neural Basis Of Strategy And Skill In Sentence-Picture Verification, Erik D. Reichle, Patricia A. A. Carpenter, Marcel Adam Just

Marcel Adam Just

No abstract provided.


Working Memory And Executive Function: Evidence From Neuroimaging, Patricia A. Carpenter, Marcel Adam Just, Erik D. Reichle Dec 1999

Working Memory And Executive Function: Evidence From Neuroimaging, Patricia A. Carpenter, Marcel Adam Just, Erik D. Reichle

Marcel Adam Just

No abstract provided.


Reflexive Autopoietic Systems Theory, Kent D. Palmer Dec 1999

Reflexive Autopoietic Systems Theory, Kent D. Palmer

Kent D. Palmer

Exploring the Meta-systems of Emergent Worlds