Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (7226)
- China Simulation Federation (3382)
- TÜBİTAK (3020)
- Selected Works (2644)
- Wright State University (2602)
-
- Purdue University (2057)
- Old Dominion University (1456)
- Missouri University of Science and Technology (1360)
- Edith Cowan University (1172)
- Air Force Institute of Technology (1108)
- University of Texas at El Paso (1094)
- Dartmouth College (1017)
- San Jose State University (995)
- University of Nebraska - Lincoln (979)
- Embry-Riddle Aeronautical University (853)
- City University of New York (CUNY) (818)
- Technological University Dublin (792)
- Washington University in St. Louis (785)
- Brigham Young University (759)
- California Polytechnic State University, San Luis Obispo (731)
- Kennesaw State University (713)
- University for Business and Technology in Kosovo (626)
- University of Texas at Arlington (614)
- Nova Southeastern University (535)
- Portland State University (529)
- Western University (524)
- SelectedWorks (522)
- New Jersey Institute of Technology (511)
- Syracuse University (501)
- University of Nebraska at Omaha (484)
- Keyword
-
- Machine learning (1332)
- Deep learning (799)
- Artificial intelligence (653)
- Machine Learning (650)
- Computer Science (638)
-
- Security (620)
- Computer science (435)
- Cybersecurity (410)
- Privacy (408)
- Simulation (377)
- Classification (367)
- Technical Reports (358)
- UTEP Computer Science Department (356)
- Data mining (349)
- Deep Learning (346)
- Algorithms (336)
- Optimization (333)
- Neural networks (307)
- Artificial Intelligence (299)
- Computer vision (291)
- College for Professional Studies (253)
- Education (253)
- Software engineering (253)
- Clustering (251)
- Cloud computing (244)
- Department of Computer Science and Engineering (243)
- Applied sciences (236)
- School of Computer & Information Science (236)
- Visualization (236)
- Social media (230)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (6878)
- Journal of System Simulation (3382)
- Turkish Journal of Electrical Engineering and Computer Sciences (3020)
- Theses and Dissertations (2498)
- Department of Computer Science Technical Reports (1721)
-
- Computer Science & Engineering Syllabi (1312)
- Departmental Technical Reports (CS) (881)
- Master's Projects (845)
- Electronic Theses and Dissertations (735)
- Computer Science Faculty Publications (724)
- All Computer Science and Engineering Research (683)
- Computer Science Technical Reports (673)
- Computer Science Faculty Research & Creative Works (595)
- Faculty Publications (585)
- Kno.e.sis Publications (543)
- Journal of Digital Forensics, Security and Law (536)
- Computer Science Faculty Publications and Presentations (507)
- Dissertations (500)
- CCE Theses and Dissertations (488)
- All Works (478)
- Walden Dissertations and Doctoral Studies (467)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (463)
- Masters Theses (402)
- Computer Science and Engineering Theses (356)
- Theses (334)
- Electronic Thesis and Dissertation Repository (333)
- Computer Science and Software Engineering (332)
- USF Tampa Graduate Theses and Dissertations (320)
- Computer Science: Faculty Publications (316)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (315)
- Publication Type
Articles 56731 - 56760 of 57951
Full-Text Articles in Physical Sciences and Mathematics
The Utilization Of Competitive Intelligence In Strategic Planning, Sallyann Carr
The Utilization Of Competitive Intelligence In Strategic Planning, Sallyann Carr
CCE Theses and Dissertations
No abstract provided.
On K - Y - Insensitive Donimation, Teresa Haynes Rice
On K - Y - Insensitive Donimation, Teresa Haynes Rice
Retrospective Theses and Dissertations
A connected graph G is defined to be k-1-insensitive if the domination number 1(G) is unchanged when an arbitrary set of k edges is removed. The problem has been solved fork= 1. This Ph.D. dissertation focuses on finding extremal k-1-insensitive graphs on p nodes, fork~ 2. A graph is extremal if it has the minimum number of edges. Two subproblems are considered. The first, which has been solved completely, specifies that the same set of nodes dominates each graph obtained from G by removing k edges. The second requires only that the graph G be connected. This is a much …
Digital Neural Networks, Tony R. Martinez
Digital Neural Networks, Tony R. Martinez
Faculty Publications
Demands for applications requiring massive parallelism in symbolic environments have given rebirth to research in models labeled as neural networks. These models are made up of many simple nodes which are highly interconnected such that computation takes place as data flows amongst the nodes of the network. To present, most models have proposed nodes based on simple analog functions, where inputs are multiplied by weights and summed, the total then optionally being transformed by an arbitrary function at the node. Learning in these systems is accomplished by adjusting the weights on the input lines. This paper discusses the use of …
Integrated Online Media Management Systems For Media Centers: A Model For Selection And Effective Use, Nancy R. Keating
Integrated Online Media Management Systems For Media Centers: A Model For Selection And Effective Use, Nancy R. Keating
CCE Theses and Dissertations
The researcher proposed to advice in the selection of an Integrated Online Library System (IOLS) for use in the 103 school media centers in the Palm Beach County Schools, Florida. This was accomplished by evaluating the two finalists of those vendors who answered the district's Request for Proposal (RFP). Of the five vendors who responded to the RFP. CLSI and SIRSI were selected as the systems most likely to meet the needs of the media centers of the school district.
An overview and definition of IOLS was first discussed. This overview then related itself to the needs of the school …
Fractals With Arbitrary Segment Lengths, Daniel Michael Doerer
Fractals With Arbitrary Segment Lengths, Daniel Michael Doerer
Masters Theses
"Work in the area of fractal geometry has generally focused on a specific facet of the discipline at the expense of other interesting features. This approach often generates more questions than answers for the general audience due to the lack of unification across all views. It appears that a common thread to relate all aspects of fractal characteristics is missing. This paper addresses this question and presents some new and fascinating results. For example, in-depth mathematical analysis often defers to the intriguing and attractive graphical displays produced by mapping the complex plane to the pixel field on a CRT. Both …
The Role Of Term Symmetry In E-Unification And E-Completion, Blayne E. Mayfield
The Role Of Term Symmetry In E-Unification And E-Completion, Blayne E. Mayfield
Doctoral Dissertations
“A major portion of the work and time involved in completing an incomplete set of reductions using an E-completion procedure such as the one described by Knuth and Bendix [KB70] or its extension to associative-commutative equational theories as described by Peterson and Stickel [PS81] is spent calculating critical pairs and subsequently testing them for coherence. A pruning technique which removes from consideration those critical pairs that represent redundant or superfluous information, either before, during, or after their calculation, can therefore make a marked difference in the run time and efficiency of an E-completion procedure to which it is applied.
The …
Symbolic Automation And Numerical Synthesis For Robot Kinematics, Jen Sriwattanathamma
Symbolic Automation And Numerical Synthesis For Robot Kinematics, Jen Sriwattanathamma
Doctoral Dissertations
"This research analyzes three topics in robot arm kinematics. First, the direct kinematics which determines the Cartesian position and orientation of the end effector for the specified values of joint parameters is analyzed. Second, the differential motions concerning the differential relationships between the command variables in position and orientation of the end effector and the joint-controlled variables are studied. Finally, the inverse kinematics which determines the joint variables for a specified Cartesian position and orientation of the end effector is considered.
This dissertation presents a methodology for incorporating the artificial intelligence types of knowledge into automating solutions for the direct …
An Integrated Programming Environment For Pseudo-Code Development, Ipe-Pc, Nurcan Coskun
An Integrated Programming Environment For Pseudo-Code Development, Ipe-Pc, Nurcan Coskun
Doctoral Dissertations
"An Integrated Programming Environment, IPE-PC, that supports pseudo-code development has been designed and implemented. This environment is based on a Pascal-like language which is designed according to the requirements of a language-based environment. The nucleus of IPE-PC is a language-based editor which represents programs as graphs internally. The same representation is used in every mode of the environment (i.e., editing, compilation, execution, debugging and translation). The system provides facilities to take advantage of both top-down and bottom-up programming. Stepwise refinement has been supported by providing comment structures that can be transformed into procedures. Bottom-up programming is supported because it is …
Ua35/11 Student Honors Research Bulletin, Wku Honors Program
Ua35/11 Student Honors Research Bulletin, Wku Honors Program
WKU Archives Records
The WKU Student Honors Research Bulletin is dedicated to scholarly involvement and student research. These papers are representative of work done by students from throughout the university.
- Bachert, Sara. Rational Portrayal of the Irrationational in The Pit and the Pendulum
- Bell, Suzanne. Early Secret Involvement of the United States Military in Cambodia
- Brock, Beth. The Informal Caregiving System: The Frail Elderlys' Avenue of Choice
- Daniel, Janice. Child Sexual Abuse
- Johnson, Linda. International Telecommunications Trade with Japan
- Jones, LaMont. Ernie Pyle: Journalist Without Peer
- Kesserling, Marcia. Attitudes Toward the Need for Computer Literacy
- Lewis, Gloria. John Donne's Attitude Toward Love
- Majdi, …
No Antitwins In Minimal Imperfect Graphs, Stephan Olariu
No Antitwins In Minimal Imperfect Graphs, Stephan Olariu
Computer Science Faculty Publications
It is customary to call vertices x and y twins if every vertex distinct from x and y is adjacent either to both of them or to neither of them. By analogy, we shall call vertices x and yantitwins if every vertex distinct from x and y is adjacent to precisely one of them. Lovász proved that no minimal imperfect graph has twins. The purpose of this note is to prove the analogous statement for antitwins.
Semantic Specification Using Tree Manipulation Languages, Randall Paul Meyer
Semantic Specification Using Tree Manipulation Languages, Randall Paul Meyer
Dissertations, Theses, and Masters Projects
Software tools are used to generate compilers automatically from formal descriptions of languages. Methods for specifying the syntax of languages are well-established and well-understood; however, methods for formal semantic specification are not. The method most commonly used for semantic specification is an attribute grammar.;This thesis examines an alternative method of semantic specification. TreeSem is defined as a Tree Manipulation Language applicable to semantic specification. A TreeSem program is easier to read and to write than a corresponding attribute grammar specification.;Algorithms for translation of a TreeSem program into an equivalent attribute grammar specification, and for translation of an attribute grammar specification …
The Sharing Of Rights And Information In A Capability-Based Protection System, Matt Bishop
The Sharing Of Rights And Information In A Capability-Based Protection System, Matt Bishop
Computer Science Technical Reports
The paper examines the question of sharing of rights and information in the Take-Grant Protection Model by concentrating on the similarities between the two; in order to do this, we state and prove new theorems for each that specifically show the similarities. The proof for one of the original theorems is also provided. These statements of necessary and sufficient conditions are contrasted to illustrate the proposition that transferring rights and transferring information are fundamentally the same, as one would expect in a capability-based system. We then discuss directions for future research in light of these results.
Intensity Blending Of Computer Image Generation-Based Displays, Elizabeth Scheppler Reidelberger
Intensity Blending Of Computer Image Generation-Based Displays, Elizabeth Scheppler Reidelberger
Masters Theses
"State-of-the-art combat simulators require a 360 degree field of view, allowing the pilot and radar intercept officer to have the same visibility in the simulator that they would experience in the aircraft. The sky/earth display must be computer - generated and displayed with a minimum of two channels to provide the most realistic display possible. The two channels of display come together in the dome, forming an equator, that must be as indiscernible to the aircrew as possible. To accomplish this, an algorithm has been developed for controlling the video output which makes the two separate channel displays appear as …
Deduction Of A Functional Dependency From A Set Of Functional Dependencies, James M. Richardson
Deduction Of A Functional Dependency From A Set Of Functional Dependencies, James M. Richardson
Masters Theses
"This paper describes an algorithm called the Deduction Tracing Algorithm (DTA) which utilizes basic properties of functional dependencies from database systems and a modification of a tree search algorithm from artificial intelligence. The algorithm takes a set of functional dependencies, F, along with a specific functional dependency L→R as input and produces a list of functional dependencies from F that can be used to deduce L→R. The resulting algorithm is easily automated to provide relational database users with a tool for organizing their queries"--Abstract, page iii.
Micro Database Management System Language, Karen Yingling Tam
Micro Database Management System Language, Karen Yingling Tam
Masters Theses
"There are two approaches to solve computational problems in a microcomputer environment:
- Non-database approach: uses a high level programming language with non-database files as input and/or output files.
- Database approach: uses the programming language embedded in the micro Data Base Management System(DBMS), with the database defined by the integrated database definition language as input and/or output files.
Adopting the appropriate approach in any single application may save cost and time. This paper compares the two different approaches while solving the same Control Section (CSECT) Interaction Hierarchy problem and suggests which to use when"--Abstract, page ii.
Computer Control Of A Pbx Washout Plant, Scott Cameron Sharp
Computer Control Of A Pbx Washout Plant, Scott Cameron Sharp
Masters Theses
"A fully automated, computer controlled plant has been designed specifically for safe removal of plastic bonded explosives (PBX) from obsolete military munitions. This PBX washout plant consists of a two stage delivery system and robotically operated high pressure waterjet lance. The assigned task was to develop control packages for each component.
The first stage of the delivery system is a battery operated overhead trolley. Its control package consist of a dedicated computer, DC motor and custom positioning subprograms. The dedicated computer communicates through an infrared link to the operator's computer. This link was developed due to requirements of a hazardous …
Composite Graph Coloring Algorithms And Applications, Stephen Hong Seng Yek
Composite Graph Coloring Algorithms And Applications, Stephen Hong Seng Yek
Masters Theses
"A vertex-composite graph is a graph that can have unequal chromaticities on its vertices. Vertex-composite graph coloring or composite graph coloring involves coloring each vertex of a composite graph with consecutive colors according to the vertex's chromaticity with no two vertices adjacent to one another having the same color(s).
New heuristic algorithms including the use of the saturation degree method have been developed in this research. All eleven heuristic algorithms including Clementson and Elphick algorithms were then tested using random composite graphs with five different chromaticity distributions. The best algorithm which uses the least average colors from the experiment is …
Self-Alignments In Words And Their Applications, Alberto Apostolico, Wojciech Szpankowski
Self-Alignments In Words And Their Applications, Alberto Apostolico, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
Architecture And Operation Invocation In The Clouds Kernel, Eugene H. Spafford
Architecture And Operation Invocation In The Clouds Kernel, Eugene H. Spafford
Department of Computer Science Technical Reports
No abstract provided.
Towards Implementing Robust Geometric Computations, Christoph M. Hoffmann, John E. Hopcroft, Michael S. Karasick
Towards Implementing Robust Geometric Computations, Christoph M. Hoffmann, John E. Hopcroft, Michael S. Karasick
Department of Computer Science Technical Reports
No abstract provided.
A Robust Distributed Termination Detection Algorithm, Niraj K. Sharma, Bharat Bhargava
A Robust Distributed Termination Detection Algorithm, Niraj K. Sharma, Bharat Bhargava
Department of Computer Science Technical Reports
No abstract provided.
Some Efficient Computational Algorithms Related To Phase Models, Vernon J. Rego
Some Efficient Computational Algorithms Related To Phase Models, Vernon J. Rego
Department of Computer Science Technical Reports
No abstract provided.
A System For Experimentation In Replicated Copy Control, Bharat Bhargava, Paul Noll, Andrew Royappa, Donna Sabo
A System For Experimentation In Replicated Copy Control, Bharat Bhargava, Paul Noll, Andrew Royappa, Donna Sabo
Department of Computer Science Technical Reports
No abstract provided.
Multilist And Inverted File System Performance Measurements, Ashok Chandramouli, George Winston Zobrist
Multilist And Inverted File System Performance Measurements, Ashok Chandramouli, George Winston Zobrist
Computer Science Technical Reports
This study evaluates the multilist and inverted file systems. It describes the structure of the two file system and then proceeds to investigate the performance. The performance is based on quantitative estimates of space requirements for file system, time to retrieve records, time to insert a record, time to delete a record, time to update a record and time to exhaustively read and reorganize the file system. The study then investigates specific situations in which one file system seems to perform better than the other.
Performance Parameter Measurements Of Generic Files, Sankarraman Subramanian, George Winston Zobrist
Performance Parameter Measurements Of Generic Files, Sankarraman Subramanian, George Winston Zobrist
Computer Science Technical Reports
This study discusses the performance parameter measurements of generic files, the pile file, the sequential file, the indexed-sequential file, the indexed file and the direct file. The file performance measurements are compiled in a software package. The study then describes the use of such software package as a simulation tool in a file design environment.
Heuristic Coloring Algorithm For The Composite Graph Coloring Problem, Johnnie C. Roberts, Billy E. Gillett
Heuristic Coloring Algorithm For The Composite Graph Coloring Problem, Johnnie C. Roberts, Billy E. Gillett
Computer Science Technical Reports
A composite graph is a finite undirected graph in which a positive integer known as a chromaticity is associated with each vertex of the graph. The composite graph coloring problem (CGCP) is the problem of finding the chromatic number of a composite graph, i.e., the minimum number of colors (positive integers) required to assign a sequence of consecutive colors to each vertex of the graph in a manner such that adjacent vertices are not assigned sequences with colors in common and the sequence assigned to a vertex has the number of colors indicated by the chromaticity of the vertex. The …
Parallel Symmetry-Breaking In Sparse Graphs, Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon
Parallel Symmetry-Breaking In Sparse Graphs, Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon
Department of Computer Science Technical Reports
No abstract provided.
A Microprocessor-Based Multivariable Interactive Control System, Sayed Mehdi Khayam-Nekouei
A Microprocessor-Based Multivariable Interactive Control System, Sayed Mehdi Khayam-Nekouei
Electronic Theses & Dissertations
This study outlines the various types of control systems and reviews the necessary mathematical techniques to solve the problem of multivariable interactive control. The characteristics as well as the state representation for control processes involving either p or v type canonical structures are discussed. Next, the characteristics of multivariable interactive discrete control systems are discussed in detail. The advantages of flexibility and speed of microprocessors are used as powerful tools to implement a microprocessor-based system can be employed to control discrete processes. To demonstrate a practical application of a microprocessor-based system in a multivariable interactive discrete process, the algorithm and …
A Graphic Implementation Of Blocks World As An Example Of Artificial Intelligence, Shigenori Ochiai
A Graphic Implementation Of Blocks World As An Example Of Artificial Intelligence, Shigenori Ochiai
Masters Theses
The objective of this study is to implement blocks world as a classic example of artificial intelligence both visually and realistically.
The visual representation is implemented by using a graphic system in a microcomputer. Real world constraints are implemented as rules concerning centers of gravity.
These goals are significant in realizing principles of artificial intelligence. Visual data help a human being to quickly understand the state of a system. Also, bringing a situation closer to the real world is a step toward to the final goal of artificial intelligence.
Shape Recognition By Curvature Changing Points And Fourier Transform, Jianzhong Li
Shape Recognition By Curvature Changing Points And Fourier Transform, Jianzhong Li
Masters Theses
Computer vision is a relatively new and fast-growing field. Shape representation and recognition is a very important but difficult branch in this field.
One method of using curvature changing points and Fourier transform to recognize the shape is described in this thesis. Also an important feature in computer vision, multiscaling, is achieved by this method.