Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Artificial Intelligence and Robotics (184)
- Social and Behavioral Sciences (110)
- Software Engineering (100)
- Programming Languages and Compilers (92)
- Databases and Information Systems (70)
-
- Arts and Humanities (68)
- Other Computer Sciences (61)
- Information Security (55)
- Theory and Algorithms (51)
- Graphics and Human Computer Interfaces (48)
- Engineering (46)
- Data Science (40)
- Linguistics (40)
- Life Sciences (39)
- Medicine and Health Sciences (37)
- Philosophy (36)
- Cognitive Science (29)
- Systems Architecture (29)
- Computer Engineering (28)
- Numerical Analysis and Scientific Computing (28)
- Mathematics (26)
- OS and Networks (26)
- Philosophy of Mind (26)
- Education (23)
- Physics (18)
- Sociology (18)
- Statistics and Probability (18)
- Communication (17)
- Keyword
-
- Intro to Data Science (33)
- Computer Science (29)
- Cybersecurity (27)
- Refactoring (25)
- Computer science (23)
-
- Deep learning (23)
- Software engineering (23)
- Machine learning (22)
- Artificial intelligence (20)
- Core-Modulation Architecture (17)
- Java (17)
- Machine Learning (17)
- CMA (15)
- Cognitive architecture (15)
- Layered cognition (15)
- Python (14)
- Cloud computing (13)
- Deep Learning (13)
- Java 8 (12)
- Artificial Intelligence (11)
- Lib_pub (11)
- Software evolution (11)
- AI (10)
- Automated refactoring (9)
- Cryptography (9)
- Empirical studies (9)
- Imperative programs (9)
- Programming (9)
- Programming languages (9)
- Streams (9)
- Publication Year
- Publication
- Publication Type
- File Type
Articles 751 - 780 of 956
Full-Text Articles in Computer Sciences
Tr-2011007: Randomized And Derandomized Matrix Computations, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng
Tr-2011007: Randomized And Derandomized Matrix Computations, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng
Computer Science Technical Reports
No abstract provided.
Tr-2011004: Acceleration Of Newton's Polynomial Factorization: Army Of Constraints, Convolution, Sylvester Matrices, And Partial Fraction Decomposition, Victor Y. Pan
Computer Science Technical Reports
No abstract provided.
Tr-2011005: First-Order Logic Of Proofs, Sergei N. Artemov, Tatiana Yavorskaya (Sidon)
Tr-2011005: First-Order Logic Of Proofs, Sergei N. Artemov, Tatiana Yavorskaya (Sidon)
Computer Science Technical Reports
No abstract provided.
Tr-2011011: Randomized And Derandomized Matrix Computations Ii, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng
Tr-2011011: Randomized And Derandomized Matrix Computations Ii, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng
Computer Science Technical Reports
No abstract provided.
Tr-2011010: Possible World Semantics For First Order Lp, Melvin Fitting
Tr-2011010: Possible World Semantics For First Order Lp, Melvin Fitting
Computer Science Technical Reports
No abstract provided.
Tr-2011002: Symbolic Lifting For Structured Linear Systems Of Equations: Numerical Initialization, Nearly Optimal Boolean Cost, Variations, And Extensions, Victor Y. Pan
Computer Science Technical Reports
No abstract provided.
Tr-2011003: Partial Fraction Decomposition, Sylvester Matrices, Convolution And Newton's Iteration, Victor Y. Pan
Tr-2011003: Partial Fraction Decomposition, Sylvester Matrices, Convolution And Newton's Iteration, Victor Y. Pan
Computer Science Technical Reports
No abstract provided.
Tr-2011008: The Ontology Of Justifications In The Logical Setting, Sergei N. Artemov
Tr-2011008: The Ontology Of Justifications In The Logical Setting, Sergei N. Artemov
Computer Science Technical Reports
No abstract provided.
Tr-2011009: Solving Linear Systems Of Equations With Randomized Augmentation And Aggregation, Victor Y. Pan, Guoliang Qian
Tr-2011009: Solving Linear Systems Of Equations With Randomized Augmentation And Aggregation, Victor Y. Pan, Guoliang Qian
Computer Science Technical Reports
No abstract provided.
Moving Towards Adaptive Search In Digital Libraries, Udo Kruschwitz, M-Dyaa Albakour, Jinzhong Niu, Johannes Leveling, Nikolaos Nanas, Yunhyong Kim, Dawei Song, Maria Fasli, Anne De Roeck
Moving Towards Adaptive Search In Digital Libraries, Udo Kruschwitz, M-Dyaa Albakour, Jinzhong Niu, Johannes Leveling, Nikolaos Nanas, Yunhyong Kim, Dawei Song, Maria Fasli, Anne De Roeck
Publications and Research
Information retrieval has become very popular over the last decade with the advent of the Web. Nevertheless, searching on the Web is very different to searching on smaller, often more structured collections such as digital libraries, local Web sites and intranets. One way of helping the searcher locating the right information for a specific information need is by providing well-structured domain knowledge to assist query modification and navigation. There are two challenges: acquiring the domain knowledge and adapting it automatically to the specific interests of the user community. We will outline how a domain model can be automatically acquired using …
Introduction To Gis Using Open Source Software, 1st Ed, Frank Donnelly
Introduction To Gis Using Open Source Software, 1st Ed, Frank Donnelly
Open Educational Resources
This tutorial was created to accompany the GIS Practicum, a day-long workshop offered by the Newman Library at Baruch College CUNY that introduces participants to geographic information systems (GIS) using the open source software QGIS. The practicum introduces GIS as a concept for envisioning information and as a tool for conducting geographic analyses and creating maps. Participants learn how to navigate a GIS interface, how to prepare layers and conduct a basic geographic analysis, and how to create thematic maps. This tutorial was written using QGIS version 1.5 "Tethys", a cross-platform (Windows, Mac, Linux) desktop GIS software package.
Complexity Of Minimum Corridor Guarding Problems, Ning Xu
Complexity Of Minimum Corridor Guarding Problems, Ning Xu
Dissertations and Theses
"In this paper, the complexity of minimum corridor guarding problems is discussed. These problem can be described as: given a connected orthogo-nal arrangement of vertical and horizontal line segments and a guard with unlimited visibility along a line segment, find a tree or a closed tour with minimum total length along edges of the arrangement, such that if the guard runs on the tree or on the closed tour, all line segments are visited by the guard. These problems are proved to be NP-complete. Keywords: computational complexity, computational geometry, corridor guarding, NP-complete"
Parallel Computing With Improved Techniques For Monte Carlo Simulation In Var, Ping Hung Wu
Parallel Computing With Improved Techniques For Monte Carlo Simulation In Var, Ping Hung Wu
Dissertations and Theses
"Value at Risk ( VaR ) is a widely used tool for the assessment of one’s investments. VaR is used to evaluate the risk of loss on a financial portfolio. This metric can be computed in several ways. In the historical approach, past trends of the appropriate combination of stocks is used to estimate current portfolio fluctuations. The variance – covariance method, meanwhile, seeks to discover relationships in price fluctuations for one’s stocks. Finally, Monte Carlo simulation capitalizes upon the stochastic nature of stock prices to predict future value. This latter approach, however, relies heavily on the multiplication of vectors …
The Mycobacterium Tuberculosis Drugome And Its Polypharmacological Implications, Sarah L. Kinnings, Li Xie, Kingston H. Fung, Richard M. Jackson, Lei Xie, Phillip E. Bourne
The Mycobacterium Tuberculosis Drugome And Its Polypharmacological Implications, Sarah L. Kinnings, Li Xie, Kingston H. Fung, Richard M. Jackson, Lei Xie, Phillip E. Bourne
Publications and Research
We report a computational approach that integrates structural bioinformatics, molecular modelling and systems biology to construct a drug-target network on a structural proteome-wide scale. The approach has been applied to the genome of Mycobacterium tuberculosis (M.tb), the causative agent of one of today’s most widely spread infectious diseases. The resulting drug-target interaction network for all structurally characterized approved drugs bound to putative M.tb receptors, we refer to as the ‘TB-drugome’. The TB-drugome reveals that approximately one-third of the drugs examined have the potential to be repositioned to treat tuberculosis and that many currently unexploited M.tb receptors may be chemically druggable …
Drug Off-Target Effects Predicted Using Structural Analysis In The Context Of A Metabolic Network Model, Roger L. Chang, Lei Xie, Philip E. Bourne, Bernhard O. Palsson
Drug Off-Target Effects Predicted Using Structural Analysis In The Context Of A Metabolic Network Model, Roger L. Chang, Lei Xie, Philip E. Bourne, Bernhard O. Palsson
Publications and Research
Recent advances in structural bioinformatics have enabled the prediction of protein-drug off-targets based on their ligand binding sites. Concurrent developments in systems biology allow for prediction of the functional effects of system perturbations using large-scale network models. Integration of these two capabilities provides a framework for evaluating metabolic drug response phenotypes in silico. This combined approach was applied to investigate the hypertensive side effect of the cholesteryl ester transfer protein inhibitor torcetrapib in the context of human renal function. A metabolic kidney model was generated in which to simulate drug treatment. Causal drug off-targets were predicted that have previously been …
Enumeration Refactoring: A Tool For Automatically Converting Java Constants To Enumerated Types, Raffi Khatchadourian, Benjamin Muskalla
Enumeration Refactoring: A Tool For Automatically Converting Java Constants To Enumerated Types, Raffi Khatchadourian, Benjamin Muskalla
Publications and Research
Java 5 introduces several new features that significantly improve older Java technology. We consider the new enum construct, which provides language support for enumerated types. Before Java 5, programmers needed to employ various patterns to compensate for the absence of enumerated types in Java. Unfortunately, these compensation patterns lack several highly desirable properties of the enum construct, notably type-safety. We demonstrate an automated refactoring tool called Convert Constants to Enum for transforming legacy Java code to use the new enumeration construct. An interprocedural type inferencing algorithm that tracks the flow of enumerated values drives the approach, and the tool is …
Smap-Ws: A Parallel Web Service For Structural Proteome-Wide Ligand-Binding Site Comparison, Jingyuan Ren, Lei Xie, Wilfred W. Li, Philip E. Bourne
Smap-Ws: A Parallel Web Service For Structural Proteome-Wide Ligand-Binding Site Comparison, Jingyuan Ren, Lei Xie, Wilfred W. Li, Philip E. Bourne
Publications and Research
The proteome-wide characterization and analysis of protein ligand-binding sites and their interactions with ligands can provide pivotal information in understanding the structure, function and evolution of proteins and for designing safe and efficient therapeutics. The SMAP web service (SMAP-WS) meets this need through parallel computations designed for 3D ligand-binding site comparison and similarity searching on a structural proteome scale. SMAP-WS implements a shape descriptor (the Geometric Potential) that characterizes both local and global topological properties of the protein structure and which can be used to predict the likely ligand-binding pocket [Xie,L. and Bourne,P.E. (2007) A robust and efficient algorithm for …
Tredd—A Database For Tandem Repeats Over The Edit Distance, Dina Sokol, Firat Atagun
Tredd—A Database For Tandem Repeats Over The Edit Distance, Dina Sokol, Firat Atagun
Publications and Research
A ‘tandem repeat’ in DNA is a sequence of two or more contiguous, approximate copies of a pattern of nucleotides. Tandem repeats are common in the genomes of both eukaryotic and prokaryotic organisms. They are significant markers for human identity testing, disease diagnosis, sequence homology and population studies. In this article, we describe a new database, TRedD, which contains the tandem repeats found in the human genome. The database is publicly available online, and the software for locating the repeats is also freely available. The definition of tandem repeats used by TRedD is a new and innovative definition based upon …
Tr-2010012: Randomized Preconditioning Of Linear Systems Of Equations, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng
Tr-2010012: Randomized Preconditioning Of Linear Systems Of Equations, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng
Computer Science Technical Reports
No abstract provided.
Tr-2010013: Matrix Computations And Polynomial Root-Finding With Preprocessing, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng, Zhao Chen
Tr-2010013: Matrix Computations And Polynomial Root-Finding With Preprocessing, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng, Zhao Chen
Computer Science Technical Reports
No abstract provided.
Tr-2010014: A Complexity Question In Justification Logic, Antonis Achilleos
Tr-2010014: A Complexity Question In Justification Logic, Antonis Achilleos
Computer Science Technical Reports
No abstract provided.
Tr-2010015: New Progress In Real And Complex Polynomial Root-Finding, Victor Y. Pan, Ai-Long Zheng
Tr-2010015: New Progress In Real And Complex Polynomial Root-Finding, Victor Y. Pan, Ai-Long Zheng
Computer Science Technical Reports
No abstract provided.
Tr-2010009: Solving Linear Systems With Randomized Augmentation Ii, Victor Y. Pan, Guoliang Qian
Tr-2010009: Solving Linear Systems With Randomized Augmentation Ii, Victor Y. Pan, Guoliang Qian
Computer Science Technical Reports
No abstract provided.
Tr-2010002: Reasoning About Games, Melvin Fitting
Tr-2010002: Reasoning About Games, Melvin Fitting
Computer Science Technical Reports
No abstract provided.
Tr-2010003: The Impossibility Of Definitive Solutions For Some Games, Sergei Artemov
Tr-2010003: The Impossibility Of Definitive Solutions For Some Games, Sergei Artemov
Computer Science Technical Reports
No abstract provided.
Tr-2010005: Securing Bgp Through Existing Infrastructure And Contractual Chains (Ccbgp), Yuri Cantor, Nancy Griffeth, Bilal Khan, Ping Ji
Tr-2010005: Securing Bgp Through Existing Infrastructure And Contractual Chains (Ccbgp), Yuri Cantor, Nancy Griffeth, Bilal Khan, Ping Ji
Computer Science Technical Reports
No abstract provided.
Tr-2010007: Robust Knowledge Of Rationality, Sergei Artemov
Tr-2010007: Robust Knowledge Of Rationality, Sergei Artemov
Computer Science Technical Reports
No abstract provided.
Tr-2010008: Knowability From A Logical Point Of View, Sergei Artemov, Tudor Protopopescu
Tr-2010008: Knowability From A Logical Point Of View, Sergei Artemov, Tudor Protopopescu
Computer Science Technical Reports
No abstract provided.
Tr-2010010: Robust Knowledge And Rationality, Sergei Artemov
Tr-2010010: Robust Knowledge And Rationality, Sergei Artemov
Computer Science Technical Reports
No abstract provided.
Tr-2010011: Randomized Preprocessing Versus Pivoting Ii, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng
Tr-2010011: Randomized Preprocessing Versus Pivoting Ii, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng
Computer Science Technical Reports
No abstract provided.