Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Adaptive search (1)
- Aspect-oriented programming (1)
- Auction mechanism design (1)
- Cartography (1)
- Cat game (1)
-
- Census data (1)
- Competing markets (1)
- Computational Complexity (1)
- Computational Geomery (1)
- Concurrency (1)
- Corridor Guarding (1)
- Cuda (1)
- Digital library (1)
- GIS (1)
- Geographic information systems (1)
- Geoprocessing (1)
- Grey-box (1)
- Jcat (1)
- Mapping (1)
- Market-selection strategy (1)
- Open source software (1)
- Parallel Computing (1)
- Trading strategy (1)
- VaR (1)
- Publication
- Publication Type
Articles 1 - 16 of 16
Full-Text Articles in Physical Sciences and Mathematics
The Niddk Central Repository At 8 Years—Ambition, Revision, Use And Impact, Charles F. Turner, Huaqin Pan, Gregg W. Silk, Mary-Anne Ardini, Vesselina Bakalov, Stephanie Bryant, Susanna Cantor, Kung-Yen Chang, Michael Delatte, Paul Eggers, Laxminarayana Ganapathi, Sujatha Lakshmikanthan, Joshua Levy, Sheping Li, Joseph Pratt, Norma Pugh, Ying Qin, Rebekah Rasooly, Helen Ray, Jean E. Richardson, Amanda Flynn Riley, Susan M. Rogers, Charlotte Scheper, Sylvia Tan, Stacie White, Philip C. Cooley
The Niddk Central Repository At 8 Years—Ambition, Revision, Use And Impact, Charles F. Turner, Huaqin Pan, Gregg W. Silk, Mary-Anne Ardini, Vesselina Bakalov, Stephanie Bryant, Susanna Cantor, Kung-Yen Chang, Michael Delatte, Paul Eggers, Laxminarayana Ganapathi, Sujatha Lakshmikanthan, Joshua Levy, Sheping Li, Joseph Pratt, Norma Pugh, Ying Qin, Rebekah Rasooly, Helen Ray, Jean E. Richardson, Amanda Flynn Riley, Susan M. Rogers, Charlotte Scheper, Sylvia Tan, Stacie White, Philip C. Cooley
Publications and Research
The National Institute of Diabetes and Digestive and Kidney Diseases (NIDDK) Central Repository makes data and biospecimens from NIDDK-funded research available to the broader scientific community. It thereby facilitates: the testing of new hypotheses without new data or biospecimen collection; pooling data across several studies to increase statistical power; and informative genetic analyses using the Repository’s well-curated phenotypic data. This article describes the initial database plan for the Repository and its revision using a simpler model. Among the lessons learned were the trade-offs between the complexity of a database design and the costs in time and money of implementation; the …
Formalizing Reusable Aspect-Oriented Concurrency Control, Neelam Soundarajan, Derek Bronish, Raffi T. Khatchadourian
Formalizing Reusable Aspect-Oriented Concurrency Control, Neelam Soundarajan, Derek Bronish, Raffi T. Khatchadourian
Publications and Research
Java and its library provide powerful concurrency control mechanisms. However, their use can lead to similar synchronization code scattered across multiple classes, synchronization and functional code being tangled together, and similar code being duplicated in many applications. Aspect-oriented (AO) programming makes it possible to address these problems. However, the specific behavior of systems built using AO techniques can be challenging to comprehend. We propose a specification approach to precisely express such systems' critical concurrency and synchronization properties. We illustrate the method with a simple example.
Automated Auction Mechanism Design With Competing Markets, Jinzhong Niu
Automated Auction Mechanism Design With Competing Markets, Jinzhong Niu
Publications and Research
Resource allocation is a major issue in multiple areas of computer science. Despite the wide range of resource types across these areas, for example real commodities in e-commerce and computing resources in distributed computing, auctions are commonly used in solving the optimization problems involved in these areas, since well designed auctions achieve desirable economic outcomes.
Auctions are markets with strict regulations governing the information available to traders in the market and the possible actions they can take. Auction mechanism design aims to manipulate the rules of an auction in order to achieve specific goals. Economists traditionally use mathematical methods, mainly …
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 …
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-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-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.
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-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.
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.
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-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-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-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.
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 …