Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (5865)
- China Simulation Federation (3924)
- TÜBİTAK (2852)
- Missouri University of Science and Technology (1081)
- University of Nebraska - Lincoln (1079)
-
- Old Dominion University (940)
- Edith Cowan University (829)
- Embry-Riddle Aeronautical University (693)
- Zayed University (683)
- Wright State University (648)
- Purdue University (560)
- University of Texas at El Paso (523)
- Technological University Dublin (456)
- Kennesaw State University (438)
- San Jose State University (371)
- Walden University (368)
- Dartmouth College (317)
- Marquette University (275)
- New Jersey Institute of Technology (264)
- Karbala International Journal of Modern Science (263)
- City University of New York (CUNY) (257)
- University of Nebraska at Omaha (257)
- MMU Press (252)
- Brigham Young University (238)
- Neutrosophic Systems with Applications (237)
- Smith College (208)
- Chulalongkorn University (207)
- Syracuse University (203)
- California Polytechnic State University, San Luis Obispo (198)
- Portland State University (197)
- Keyword
-
- Machine learning (862)
- Artificial intelligence (612)
- Deep learning (595)
- Machine Learning (351)
- Security (323)
-
- Cybersecurity (280)
- Computer Science (270)
- Artificial Intelligence (244)
- Simulation (240)
- Classification (231)
- Privacy (231)
- Deep Learning (212)
- Optimization (205)
- Neural networks (186)
- Data mining (182)
- Natural language processing (174)
- Technical Reports (166)
- UTEP Computer Science Department (166)
- AI (163)
- Blockchain (161)
- Computer science (157)
- Reinforcement learning (156)
- Cloud computing (155)
- Algorithms (154)
- Feature extraction (145)
- Social media (143)
- Clustering (142)
- Genetic algorithm (140)
- Engineering (133)
- Computer vision (131)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (5609)
- Journal of System Simulation (3924)
- Turkish Journal of Electrical Engineering and Computer Sciences (2852)
- The R Journal (708)
- All Works (681)
-
- Computer Science Faculty Research & Creative Works (590)
- Computer Science Faculty Publications (532)
- Journal of Digital Forensics, Security and Law (481)
- Departmental Technical Reports (CS) (469)
- Department of Computer Science Technical Reports (456)
- Theses and Dissertations (422)
- Walden Dissertations and Doctoral Studies (365)
- Faculty Publications (341)
- Master's Projects (288)
- Karbala International Journal of Modern Science (263)
- Computer Science Technical Reports (254)
- Dissertations (253)
- Journal of Informatics and Web Engineering (252)
- Neutrosophic Systems with Applications (237)
- Kno.e.sis Publications (232)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (207)
- Research outputs 2022 to 2026 (202)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (201)
- Computer Science Faculty Publications and Presentations (194)
- Conference papers (190)
- Articles (188)
- Computer Science: Faculty Publications (170)
- Electrical and Computer Engineering Faculty Research & Creative Works (168)
- Journal of Cybersecurity Education, Research and Practice (152)
- Computer Science and Engineering Faculty Publications (149)
- Publication Type
Articles 31051 - 31080 of 31947
Full-Text Articles in Entire DC Network
To Learn Or Not To Learn ...., Anupam Joshi
To Learn Or Not To Learn ...., Anupam Joshi
Department of Computer Science Technical Reports
No abstract provided.
Michel Parameters And Τ Neutrino Helicity From Decay Correlations In Z → Τ+Τ-, D. Buskulic, Manoj Thulasidas
Michel Parameters And Τ Neutrino Helicity From Decay Correlations In Z → Τ+Τ-, D. Buskulic, Manoj Thulasidas
Research Collection School Of Computing and Information Systems
No abstract provided.
Study Of The Subjet Structure Of Quark And Gluon Jets, D. Buskulic, D., M. Thulasidas
Study Of The Subjet Structure Of Quark And Gluon Jets, D. Buskulic, D., M. Thulasidas
Research Collection School Of Computing and Information Systems
Measurements of the subjet structure of quark and gluon jets in hadronic Z decays are presented. The analysis is based on one million hadronic events recorded by the Aleph detector. Roughly symmetric three-jet events are selected with a coarse jet-resolution cut-off, y1. Gluon jets are identified with a purity of 94.6% in those events where evidence of long-lived heavy-flavour hadrons in the other two jets is found. The jets are then analyzed using a smaller cut-off y0 (< y1) so that subjets are resolved. The properties of the jets (subjet multiplicities (Nq), (Ng) and rates Rng(q) for n = 1, 2, 3, 4) are determined and are found to be in good agreement with the expectations of perturbative QCD as long as the subjet resolution parameter y0 is sufficiently large to keep non-perturbative effects small. In particular, the ratio , which to leading order in QCD is given by the ratio of colour factors , is measured to be 1.96 ± 0.15 for y0 = 2 · 10−3, but falls to 1.29 ± 0.03 for y0 = 1.6 · 10−5.
Exploring The Use Of I/O Nodes For Computation In A Mimd Multiprocessor, David Kotz, Ting Cai
Exploring The Use Of I/O Nodes For Computation In A Mimd Multiprocessor, David Kotz, Ting Cai
Computer Science Technical Reports
As parallel systems move into the production scientific computing world, the emphasis will be on cost-effective solutions that provide high throughput for a mix of applications. Cost-effective solutions demand that a system make effective use of all of its resources. Many MIMD multiprocessors today, however, distinguish between ``compute'' and ``I/O'' nodes, the latter having attached disks and being dedicated to running the file-system server. This static division of responsibilities simplifies system management but does not necessarily lead to the best performance in workloads that need a different balance of computation and I/O. Of course, computational processes sharing a node with …
1.3, Yolanda Jones
Adapting Distributed Database Systems For High Availability, Xiangning Liu, Evaggelia Pitoura, Bharat Bhargava
Adapting Distributed Database Systems For High Availability, Xiangning Liu, Evaggelia Pitoura, Bharat Bhargava
Department of Computer Science Technical Reports
No abstract provided.
Concurrent And Fail-Safe Replicated Simulations On Heterogeneous Networks: An Introduction To Eclipse, Felipe Knop, Edward Mascarenhas, Vernon J. Rego, V. S. Sunderam
Concurrent And Fail-Safe Replicated Simulations On Heterogeneous Networks: An Introduction To Eclipse, Felipe Knop, Edward Mascarenhas, Vernon J. Rego, V. S. Sunderam
Department of Computer Science Technical Reports
No abstract provided.
Consistent And Recoverable Agent-Based Access To Heterogeneous Mobile Databases, Evaggelia Pitoura, Bharat Bhargava
Consistent And Recoverable Agent-Based Access To Heterogeneous Mobile Databases, Evaggelia Pitoura, Bharat Bhargava
Department of Computer Science Technical Reports
No abstract provided.
A Study Of D*+ Π- Production In Semileptonic B Decay, D. Buskulic, M. Thulasidas
A Study Of D*+ Π- Production In Semileptonic B Decay, D. Buskulic, M. Thulasidas
Research Collection School Of Computing and Information Systems
In a sample of 1.5 million hadronic decays of the Z collected by the ALEPH detector, a search is carried out for the decays B→ D10(2420)l−νX and B→ D2∗0(2460)l−νX. The product branching ratio for D10 production is measured to be Br(b →B) × Br(B→ D10l−νX) × Br(D10→ D∗+π−) = (2.04 ± 0.58stat± 0.34syst) × 10−3, and a 95% confidence level limit of Br(b →B) × Br(B→ D2∗0l−νX) × Br(D2∗0→ D∗+π−) ≤ 0.81 × 10−3 is obtained for D2∗0 production.A topological search sensitive to the processes above, but also to wide resonances that decay to D∗+π− and to non-resonant D∗+π− production …
A Type I Hybrid Arq System With Adaptive Code Rates, Robert H. Deng, Michael L. Lin
A Type I Hybrid Arq System With Adaptive Code Rates, Robert H. Deng, Michael L. Lin
Research Collection School Of Computing and Information Systems
Type I hybrid ARQ systems use an error-control code of fixed rate for error-correction in each transmitted packet. In such systems, the code rate must be carefully chosen to match the channel bit error rate (BER) in order to maximize system throughput. Whenever there is a mismatch between code rate and channel BER, the throughput suffers. In this paper, we proposed a type I hybrid ARQ system which automatically adjusts its code rates to match channel BERs. The proposed system is very simple to implement and yet performs significantly better than type I hybrid ARQ systems of fixed code rate
Disk-Directed I/O For An Out-Of-Core Computation, David Kotz
Disk-Directed I/O For An Out-Of-Core Computation, David Kotz
Computer Science Technical Reports
New file systems are critical to obtain good I/O performance on large multiprocessors. Several researchers have suggested the use of collective file-system operations, in which all processes in an application cooperate in each I/O request. Others have suggested that the traditional low-level interface (read, write, seek) be augmented with various higher-level requests (e.g., read matrix), allowing the programmer to express a complex transfer in a single (perhaps collective) request. Collective, high-level requests permit techniques like two-phase I/O and disk-directed I/O to significantly improve performance over traditional file systems and interfaces. Neither of these techniques have been tested on anything other …
Disk-Directed I/O For Mimd Multiprocessors, David Kotz
Disk-Directed I/O For Mimd Multiprocessors, David Kotz
Dartmouth Scholarship
Many scientific applications that run on today's multiprocessors are bottlenecked by their file I/O needs. Even if the multiprocessor is configured with sufficient I/O hardware, the file-system software often fails to provide the available bandwidth to the application. Although libraries and improved file-system interfaces can make a significant improvement, we believe that fundamental changes are needed in the file-server software. We propose a new technique, \em disk-directed I/O, that flips the usual relationship between server and client to allow the disks (actually, disk servers) to determine the flow of data for maximum performance. Our simulations show that tremendous performance gains …
1.2, Yolanda Jones
Parallel Algorithm Derivation And Program Transformation In A Preprocessing Compiler For Scientific Languages: The Psi Project And Hpf, L. R. Mullin, Thom Mcmahon
Parallel Algorithm Derivation And Program Transformation In A Preprocessing Compiler For Scientific Languages: The Psi Project And Hpf, L. R. Mullin, Thom Mcmahon
Computer Science Technical Reports
Scientific Programming and subsequent compilation is significantly complicated when programs are expected to perform on one or many processors for any size or dimensional problem. Scientific languages, although sophisticated and powerful, have been slow to evolve from their Von Neumann scalar by scalar operations to monolithic data parallel functions, e.g. Fortran 90/95. The structure of an array and corresponding architectural topology to which the arrays are mapped, may provide ways to increase portability and scalability of designs. This paper presents how the Psi(w) Calculus in conjunction with a useful algebra that provides convolutions, permutations, and scalar operations, is being used …
Run-Time Support For Parallelization Of Data-Parallel Applications On Adaptive And Nonuniform Computational Environments, Maher Kaddoura, Sanjay Ranka
Run-Time Support For Parallelization Of Data-Parallel Applications On Adaptive And Nonuniform Computational Environments, Maher Kaddoura, Sanjay Ranka
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
In this paper we discuss the runtime support required for the parallelization of unstructured data parallel applications on nonuniform and adaptive environments. The approach presented is reasonably general and is applicable to a wide variety of regular as well as irregular applications. We present performance results for the solution of an unstructured mesh on a cluster of heterogeneous workstations.
Supporting Irregular Distributions Using Data-Parallel Languages, Ravi Ponnusamy, Yuan-Shin Hwang, Raja Das, Alok Choudhary, Geoffrey Fox
Supporting Irregular Distributions Using Data-Parallel Languages, Ravi Ponnusamy, Yuan-Shin Hwang, Raja Das, Alok Choudhary, Geoffrey Fox
Northeast Parallel Architecture Center
Languages such as Fortran D provide irregular distribution schemes that can efficiently support irregular problems. Irregular distributions can also be emulated in HPF. Compilers can incorporate runtime procedures to automatically support these distributions.
Note On Algol And Conservatively Extending Functional Programming, Peter W. O'Hearn
Note On Algol And Conservatively Extending Functional Programming, Peter W. O'Hearn
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
A simple Idealized Algol is considered, based on Reynolds's "essence of Algol." It is shown that observational equivalence in this language conservatively extends observational equivalence in its assignment-free functional sublanguage.
Mapping Unstructured Computational Graphs For Adaptive And Nonuniform Computational Environments, Maher Kaddoura, Chao Wei Ou, Sanjay Ranka
Mapping Unstructured Computational Graphs For Adaptive And Nonuniform Computational Environments, Maher Kaddoura, Chao Wei Ou, Sanjay Ranka
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
In this paper we study the problem of mapping a large class of irregular and loosely synchronous data-parallel applications in a nonuniform and adaptive computational environment. The computational structure of these applications can be described in terms of a computational graph, where nodes of the graph represent computational tasks and edges describe the communication between tasks. Parallelization of these applications on nonuniform computational environments requires partitioning the graph among the processors in such fashion that the computation load on each node is proportional to its computational power, while communication is minimized. We discuss the applicability of current methods for graph …
The Expressiveness Of Locally Stratified Programs, Howard A. Blair, Wiktor Marek, John S. Schlipf
The Expressiveness Of Locally Stratified Programs, Howard A. Blair, Wiktor Marek, John S. Schlipf
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
This paper completes an investigation of the logical expressibility of finite, locally stratified, general logic programs. We show that every hyperarithmetic set can be defined by a suitably chosen locally stratified logic program (as a set of values of a predicate over its perfect model). This is an optimal result, since the perfect model of a locally stratified program is itself an implicitly definable hyperarithmetic set (under a recursive coding of the Herbrand base); hence to obtain all hyperarithmetic sets requires something new, in this case selecting one predicate from the model. We find that the expressive power of programs …
Irregular Personalized Communication On Distributed Memory Machines, Sanjay Ranka, Jhy-Chun Wang
Irregular Personalized Communication On Distributed Memory Machines, Sanjay Ranka, Jhy-Chun Wang
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
In this paper we present several algorithms for performing all-to-many personalized communication on distributed memory parallel machines. We assume that each processor sends a different message (of potentially different size) to a subset of all the processors involved in the collective communication. The algorithms are based on decomposing the communication matrix into a set of partial permutations. We study the effectiveness of our algorithms both from the view of static scheduling and from runtime scheduling.
Scis Networking - January 1995, Nova Southeastern University - Shepard Broad College Of Law
Scis Networking - January 1995, Nova Southeastern University - Shepard Broad College Of Law
CCIS Networking / SCIS Networking magazines
No abstract provided.
Mathematical And Theological Beliefs: A Cognitive Science Perspective, Ron Benbow
Mathematical And Theological Beliefs: A Cognitive Science Perspective, Ron Benbow
ACMS Journal 2004
In recent years, research studies have shown that control decisions and processes, beliefs about the nature of mathematics, attitudes, and other affective variables have enormous impact on the mathematical performance of students. This paper gives an overview of the research on mathematical beliefs and reviews some work done in Christian education relating to theological beliefs. It then compares the two.
Communication-Efficient And Memory-Bounded External Redistribution, Jang Sun Lee, Sanjay Ranka, Ravi V. Shankar
Communication-Efficient And Memory-Bounded External Redistribution, Jang Sun Lee, Sanjay Ranka, Ravi V. Shankar
College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects
This paper presents communication-efficient algorithms for the external data redistribution problem. Deterministic lower bounds and upper bounds are presented for the number of I/O operations, communication time and the memory requirements of external redistribution. Our algorithms differ from most other algorithms presented for out-of-core applications in that it is optimal (within a small constant factor) not only in the number of I/O operations, but also in the time taken for communication. A coarse-grained MIMD architecture with I/O subsystems attached to each processor is assumed, but the results are expected to be applicable over a wider variety of architectures.
Biometric Imaging: Three Dimensional Imaging Of The Human Hand Using Coded Structured Lighting, T. A. Vuori, C. L. Smith
Biometric Imaging: Three Dimensional Imaging Of The Human Hand Using Coded Structured Lighting, T. A. Vuori, C. L. Smith
Research outputs pre 2011
In this report the results of applying a three dimensional range imaging system, based on coded structured light, are presented. This includes a description of a new improved spatial coding scheme. This new scheme increases the number of reference points available and provides a basis for more accurate calculation of their location. A detailed description of the image processing methods used to extract structural information and to identify structural objects from the camera image are given. In addition the method used to calculate the locations of reference points with 'subpixel' accuracy is described. Finally, the results of experiments with synthesised …
Idea Analysis For The Development Of Clinical Trial Strategies, Roberta S. Horowitz
Idea Analysis For The Development Of Clinical Trial Strategies, Roberta S. Horowitz
CCAC Theses and Dissertations
Idea Analysis was investigated to determine its ability to organize scientific information and explain the results of specialists' deliberations in designing new clinical trials. Ideas have long been recognized as the engine of creativity. By focusing on the capture of ideas from the scientific literature, idea analysis procedures enable the arrangement of the information into forms consistent with those developed by subject specialists. The most obvious example is the concept structure. Ideas containing a common frequently occurring term/phrase can be depicted as a primary node in the concept network. Related terms will appear as elements associated with that node. Ideas …
An Optimal Path Cover Algorithm For Cographs, R. Lin, S. Olariu
An Optimal Path Cover Algorithm For Cographs, R. Lin, S. Olariu
Computer Science Faculty Publications
The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. In this paper, we present an optimal algorithm for determining a minimum path cover for a cograph G. In case G has a Hamiltonian path (cycle) our algorithm exhibits the path (cycle) as well.
Object Interactions As First Class Objects: From Design To Implementation, Mahesh Dodani, Benjamin Kok Siew Gan, Lizette Velazquez
Object Interactions As First Class Objects: From Design To Implementation, Mahesh Dodani, Benjamin Kok Siew Gan, Lizette Velazquez
Research Collection School Of Computing and Information Systems
Collaborations between objects make up the dynamic behavior of OO software. These collaborations among objects require careful design and implementation. Treating the interactions as responsibilities that are integrated in the participating objects, results in tight coupling between objects. Tight coupling increases complexity and reduces reusability. Object interactions need to be first class objects from design to implementation. Our research provides a unified approach to model and implement these interactions as first class objects. During analysis and design, they are modeled using DynaSpecs. During implementation, they are coded with a new language construct called Compositions. DynaSpecs and Compositions provide a consistent …
Critical Success Factors For Organizational Case Success, Chad Strauss
Critical Success Factors For Organizational Case Success, Chad Strauss
Presidential Scholars Theses (1990 – 2006)
Practitioners and researchers have suggested that Computer Aided Software Engineering (CASE) technology can significantly improve the productivity of systems analysts and the quality of systems development. Before CASE can succeed, however, specific components must exist. This paper explores CASE and the components necessary for its widespread acceptance and use within information systems departments. Specifically, this paper will examine the systems development life cycle (SDLC), the possible benefits of CASE, the current state of CASE, critical success factors for CASE, and finally CASE use.
Using Taguchi''S Method Of Experimental Design To Control Errors In Layered Perceptrons, William E. Bond, Gerald E. Peterson, Daniel C. St. Clair, Stephen R. Aylward
Using Taguchi''S Method Of Experimental Design To Control Errors In Layered Perceptrons, William E. Bond, Gerald E. Peterson, Daniel C. St. Clair, Stephen R. Aylward
Computer Science Faculty Research & Creative Works
A significant problem in the design and construction of an artificial neural network for function approximation is limiting the magnitude and the variance of errors when the network is used in the field. Network errors can occur when the training data does not faithfully represent the required function due to noise or low sampling rates, when the network's flexibility does not match the variability of the data, or when the input data to the resultant network is noisy. This paper reports on several experiments whose purpose was to rank the relative significance of these error sources and thereby find neural …
Using Fuzzy Set Theory: Exploring How Generalties Can Pinpoint Where To Look For The Answers, Cosmin Radu, Ralph W. Wilkerson
Using Fuzzy Set Theory: Exploring How Generalties Can Pinpoint Where To Look For The Answers, Cosmin Radu, Ralph W. Wilkerson
Computer Science Faculty Research & Creative Works
No abstract provided.