oalib
匹配条件: “” ,找到相关结果约100条。
列表显示的所有文章,均可免费获取
第1页/共100条
每页显示
Learning from 25 years of the extensible N-Dimensional Data Format  [PDF]
Tim Jenness,David S. Berry,Malcolm J. Currie,Peter W. Draper,Frossie Economou,Norman Gray,Brian McIlwrath,Keith Shortridge,Mark B. Taylor,Patrick T. Wallace,Rodney F. Warren-Smith
Physics , 2014, DOI: 10.1016/j.ascom.2014.11.001
Abstract: The extensible N-Dimensional Data Format (NDF) was designed and developed in the late 1980s to provide a data model suitable for use in a variety of astronomy data processing applications supported by the UK Starlink Project. Starlink applications were used extensively, primarily in the UK astronomical community, and form the basis of a number of advanced data reduction pipelines today. This paper provides an overview of the historical drivers for the development of NDF and the lessons learned from using a defined hierarchical data model for many years in data reduction software, data pipelines and in data acquisition systems.
An Extensible Management Model and its Implementation for Web Application Servers
Web应用服务器的可扩展管理模型及其实现

DONG Wei-Chuan JIN Bei-Hong ZHANG Feng FAN Guo-Chuang LIN Shi-Biao,
董伟川
,金蓓弘,张锋,范国闯,林世彪

计算机科学 , 2004,
Abstract: Web application server is a distributed system that provides runtime services for transactional Web applications. It must be capable of managing many types of resources. Also it needs to integrate the former mature network management protocols and systems. So how to manage Web resources,applications and services becomes a difficulty of implementing a Web application. To solve the problems ,this paper presents a JMX (Java?Management Extensions) based extensible management model with the advantage of flexibility, openness and extensibility. Then the key technologies on how to implement the model, including the implementation of the extensible management kernel , the remote management of resource and the extensible management of service are described. We have implemented the model in WebFrame2- 0 application server which is a J2EE application server.
The Implications of Diverse Applications and Scalable Data Sets in Benchmarking Big Data Systems  [PDF]
Zhen Jia,Runlin Zhou,Chunge Zhu,Lei Wang,Wanling Gao,Yingjie Shi,Jianfeng Zhan,Lixin Zhang
Computer Science , 2013,
Abstract: Now we live in an era of big data, and big data applications are becoming more and more pervasive. How to benchmark data center computer systems running big data applications (in short big data systems) is a hot topic. In this paper, we focus on measuring the performance impacts of diverse applications and scalable volumes of data sets on big data systems. For four typical data analysis applications---an important class of big data applications, we find two major results through experiments: first, the data scale has a significant impact on the performance of big data systems, so we must provide scalable volumes of data sets in big data benchmarks. Second, for the four applications, even all of them use the simple algorithms, the performance trends are different with increasing data scales, and hence we must consider not only variety of data sets but also variety of applications in benchmarking big data systems.
An Extensible and Secure Framework for Distributed Applications
Aneesha Sharma,Shilpi Gupta
International Journal of Computer Science Issues , 2012,
Abstract: Availability, Scalability, Reliability, Security and resource sharing are the key issues for success of any application, that are well addressed by distributed applications. Distributed applications provide services to different computers located at various locations that are connected by some means of communication network. In distributed systems a particular site consists of various computing facilities and an interface to local users and to a communication network. This paper provides various issues that must be taken into consideration while developing distributed systems. The issues discussed in this paper offer a secure framework for developing any distributed application on the top. Of these issues there are certain most commonly occurring issues that a distributed system fall victim to.
rEMM: Extensible Markov Model for Data Stream Clustering in R  [PDF]
Michael Hahsler,Margaret H. Dunham
Journal of Statistical Software , 2010,
Abstract: Clustering streams of continuously arriving data has become an important application of data mining in recent years and efficient algorithms have been proposed by several researchers. However, clustering alone neglects the fact that data in a data stream is not only characterized by the proximity of data points which is used by clustering, but also by a temporal component. The extensible Markov model (EMM) adds the temporal component to data stream clustering by superimposing a dynamically adapting Markov chain. In this paper we introduce the implementation of the R extension package rEMM which implements EMM and we discuss some examples and applications.
Data Transfer Over the Internet for Real Time Applications
Cheng-Wei Dai,Shuang-Hua Yang,Roger Knott,
Roger
,Knott

国际自动化与计算杂志 , 2006,
Abstract: Efficient real time data exchange over the Internet plays a crucial role in the successful application of web-based systems. In this paper, a data transfer mechanism over the Internet is proposed for real time web based applications. The mechanism incorporates the extensible Markup Language (XML) and Hierarchical Data Format (HDF) to provide a flexible and efficient data format. Heterogeneous transfer data is classified into light and heavy data, which are stored using XML and HDF respectively; the HDF data format is then mapped to Java Document Object Model (JDOM) objects in XML in the Java environment. These JDOM data objects are sent across computer networks with the support of the Java Remote Method Invocation (RMI) data transfer infrastructure. Client's defined data priority levels are implemented in RMI, which guides a server to transfer data objects at different priorities. A remote monitoring system for an industrial reactor process simulator is used as a case study to illustrate the proposed data transfer mechanism.
Backtest of Trading Systems on Candle Charts  [PDF]
Stanislaus Maier-Paape,Andreas Platen
Quantitative Finance , 2014,
Abstract: In this paper we try to design the necessary calculation needed for backtesting trading systems when only candle chart data are available. We lay particular emphasis on situations which are not or not uniquely decidable and give possible strategies to handle such situations.
GRAPHITE: An Extensible Graph Traversal Framework for Relational Database Management Systems  [PDF]
Marcus Paradies,Wolfgang Lehner,Christof Bornhoevd
Computer Science , 2014,
Abstract: Graph traversals are a basic but fundamental ingredient for a variety of graph algorithms and graph-oriented queries. To achieve the best possible query performance, they need to be implemented at the core of a database management system that aims at storing, manipulating, and querying graph data. Increasingly, modern business applications demand native graph query and processing capabilities for enterprise-critical operations on data stored in relational database management systems. In this paper we propose an extensible graph traversal framework (GRAPHITE) as a central graph processing component on a common storage engine inside a relational database management system. We study the influence of the graph topology on the execution time of graph traversals and derive two traversal algorithm implementations specialized for different graph topologies and traversal queries. We conduct extensive experiments on GRAPHITE for a large variety of real-world graph data sets and input configurations. Our experiments show that the proposed traversal algorithms differ by up to two orders of magnitude for different input configurations and therefore demonstrate the need for a versatile framework to efficiently process graph traversals on a wide range of different graph topologies and types of queries. Finally, we highlight that the query performance of our traversal implementations is competitive with those of two native graph database management systems.
An Abrupt Change Detection Heuristic with Applications to Cyber Data Attacks on Power Systems  [PDF]
Borhan M. Sanandaji,Eilyan Bitar,Kameshwar Poolla,Tyrone L. Vincent
Mathematics , 2014,
Abstract: We present an analysis of a heuristic for abrupt change detection of systems with bounded state variations. The proposed analysis is based on the Singular Value Decomposition (SVD) of a history matrix built from system observations. We show that monitoring the largest singular value of the history matrix can be used as a heuristic for detecting abrupt changes in the system outputs. We provide sufficient detectability conditions for the proposed heuristic. As an application, we consider detecting malicious cyber data attacks on power systems and test our proposed heuristic on the IEEE 39-bus testbed.
Automated Trading Systems: Developed and Emerging Capital Markets  [PDF]
O. Hudak
Physics , 2005,
Abstract: Automated trading systems on developed and emerging capital markets are studied in this paper. The standard for developed market is automated trading system with 40-days simple moving average. We tested it for the index SIX Industrial for 1000 and 730 trading days of the slovak emerging capital market. The Buy and Hold trading system was 7.80 times more profitable than this etalon trading system for active trading. Taking of profitable standard trading system from a developed capital market does not lead to optimal results on the emerging capital markets. We then studied optimized standard trading system based on the simple moving average. The parameter of optimization was the number of weeks. An optimal system was that with 5 weeks. This trading system has some of its characteristics comparable with the etalon trading system on the NYSE Composite Index. The emerging market is more risky than the developed market. The profit on the emerging market is also higher. The range of optimized system parameter is quite robust. Observed was increase of number of trades in the range from the 21 weeks to the 25 weeks. This indicates creation of a new optimal middle range trading system. Results of testing for liquid shares are quantitatively similar.
第1页/共100条
每页显示


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.