We have proposed a checklist-based usability inspection technique (WDP - Web Design Perspectives-Based Usability Evaluation) specific for Web applications' usability evaluation and we are following an experimentat...
详细信息
The Broadband Wireless Access (BWA) technology has been proposed to support different traffic classes with distinct quality of service (QoS) requirements in broadband metropolitan area networks. Therefore, as part of ...
详细信息
BPMN 2.0 is a widely used notation to model business process that has associated tools and techniques to facilitate process management, execution and monitoring. As a result using BPMN to model Software Development Pr...
详细信息
Broadband Wireless Access (BWA) systems offer a solution for broadband access and high data rate transmission of multimedia services with distinct Quality-of-Service (QoS) requirements through a wireless medium. IEEE ...
详细信息
computer simulations are an important tool for studying the mechanics of biological evolution. In particular, agent-based approaches provide an opportunity to collect high-quality records of ancestry relationships. Su...
详细信息
ISBN:
(数字)9798331508371
ISBN:
(纸本)9798331508388
computer simulations are an important tool for studying the mechanics of biological evolution. In particular, agent-based approaches provide an opportunity to collect high-quality records of ancestry relationships. Such phylogenies can provide insight into evolutionary dynamics within these simulations. Previous work generally tracks lineages directly, yielding an exact phylogenetic record of evolutionary history. However, challenges exist in scaling direct ancestrytracking approaches to highly-distributed, many-processor evolution in silico. An alternative approach is to estimate phylogenetic history via noncoding annotations on digital genomes, akin to how bioinformaticians build phylogenies by assessing genetic similarities between organisms. Recent work has extended this “hereditary stratigraphy” approach to support powerful hardware accelerator platforms, such as the Cerebras Wafer-Scale Engine. Although these second-generation “surface”-based hereditary stratigraphy algorithms have demonstrated order-ofmagnitude speedups over first-generation “column”-based algorithms, it remains unknown how they impact the accuracy of reconstructed phylogenies. To address this question, we assessed reconstruction accuracy under alternative configurations across a matrix of evolutionary conditions varying in selection pressure, spatial structure, and ecological dynamics. Encouragingly, we find that the second-generation approaches provide higher reconstruction quality across most surveyed conditions.
computer simulations are an important tool for studying the mechanics of biological evolution. In particular, agent-based approaches provide an opportunity to collect high-quality records of ancestry relationships. Su...
详细信息
In this paper, we assess the performance of DSMIO cachecoherence algorithm implemented in a parallel object-based database management system (ODBMS). The distinguishing feature of DSMIO is its use of the lazy release ...
详细信息
This paper presents a literature survey of action research (AR) studies published in nine major Software engineering (SE) journals and three conference proceedings in the period 1993 to June 2009. A strict selection b...
详细信息
Games appeal to all kinds of people and are used for a wide range of purposes, from pure entertainment to educational research. Software engineering is an area of computing that has much content to explore, distribute...
详细信息
Tradeoffs between time complexities and solution optimalities are important when selecting algorithms for an NP-hard problem in different applications. Also, the distinction between theoretical upper bound and actual ...
详细信息
Tradeoffs between time complexities and solution optimalities are important when selecting algorithms for an NP-hard problem in different applications. Also, the distinction between theoretical upper bound and actual solution optimality for realistic instances of an NP-hard problem is a factor in selecting algorithms in practice. We consider the problem of partitioning a sequence of n distinct numbers into minimum number of monotone (increasing or decreasing) subsequences. This problem is NP-hard and the number of monotone subsequences can reach [√2n+1/1-1/2]in the worst case. We introduce a new algorithm, the modified version of the Yehuda-Fogel algorithm, that computes a solution of no more than [√2n+1/1-1/2]monotone subsequences in O(n^1.5) time. Then we perform a comparative experimental study on three algorithms, a known approximation algorithm of approximation ratio 1.71 and time complexity O(n^3), a known greedy algorithm of time complexity O(n^1.5 log n), and our new modified Yehuda-Fogel algorithm. Our results show that the solutions computed by the greedy algorithm and the modified Yehuda-Fogel algorithm are close to that computed by the approximation algorithm even though the theoretical worst-case error bounds of these two algorithms are not proved to be within a constant time of the optimal solution. Our study indicates that for practical use the greedy algorithm and the modified Yehuda-Fogel algorithm can be good choices if the running time is a major concern.
暂无评论