The paper presents a method of analyzing dependability aspects of service oriented information systems. The system analysis is based on functionaldependability model suitable for system simulation. The model is descri...
详细信息
ISBN:
(纸本)9789898111906
The paper presents a method of analyzing dependability aspects of service oriented information systems. The system analysis is based on functionaldependability model suitable for system simulation. The model is described by XML Domain Modelling Language (XDML). The model is automatically transform into an input model for computer simulation. For event-driven simulation modified SSFNet simulator is used. Based on simulation results some dependability metrics are calculated: availability and response time of a business service. The paper presents service oriented information system model, method of its analysis with support of created tool that was tested on a exemplary system.
A generalized architecture of an efficient digital signal processor using the residue number system (RNS) is proposed. It is based on using our new residue multipliers-accumulators (MACs) as the main building blocks. ...
详细信息
ISBN:
(纸本)9780863419317
A generalized architecture of an efficient digital signal processor using the residue number system (RNS) is proposed. It is based on using our new residue multipliers-accumulators (MACs) as the main building blocks. This architecture offers potentially higher throughput thanks to the possibility of implementing very low-level pipelining. The maximal applicable clock frequency could be determined by the delay of only a few stages of full-adders.
The design of multiplier-accumulators (MACs) that could be used to build digital filters using the residue number system (RNS) is considered. The generalized architectures of residue MACs modulo A built using carry-sa...
详细信息
ISBN:
(纸本)9780863419317
The design of multiplier-accumulators (MACs) that could be used to build digital filters using the residue number system (RNS) is considered. The generalized architectures of residue MACs modulo A built using carry-save adders (CSAs) are proposed. Unlike some earlier designs, the MACs are not limited to the moduli A of the form (2±1) and 2, which hence provides a designer with more choices of moduli A that could be used to form an RNS with the required dynamic range.
Background: This paper describes an analysisthat was conducted on newly collected repository with 92 versions of 38 proprietary, open-source and academic projects. A preliminary study perfomed before showed the need f...
详细信息
ISBN:
(纸本)9781450304047
Background: This paper describes an analysisthat was conducted on newly collected repository with 92 versions of 38 proprietary, open-source and academic projects. A preliminary study perfomed before showed the need for a further in-depth analysis in order to identify project clusters. Aims: The goal of this research is to perform clustering on software projects in order to identify groups of software projects with similar characteristic from the defect prediction point of view. One defect prediction model should work well for all projects that belong to such group. The existence of those groups was investigated with statistical tests and by comparing the mean value of prediction efficiency. Method: Hierarchical and k-means clustering, as well as Kohonen's neural network was used to find groups of similar projects. The obtained clusters were investigated with the discriminant analysis. For each of the identified group a statistical analysis has been conducted in order to distinguish whether this group really exists. Two defect prediction models were created for each of the identified groups. The first one was based on the projects that belong to a given group, and the second one - on all the projects. Then, both models were applied to all versions of projects from the investigated group. If the predictions from the model based on projects that belong to the identified group are significantly better than the all-projects model (the mean values were compared and statistical tests were used), we conclude that the group really exists. Results: Six different clusters were identified and the existence of two of them was statistically proven: 1) cluster proprietary B - T=19, p=0.035, r=0.40;2) cluster proprietary/open - t(17)=3.18, p=0.05, r=0.59. The obtained effect sizes (r) represent large effects according to Cohen's benchmark, which is a substantial finding. Conclusions: The two identified clusters were described and compared with results obtained by other researchers
As Reconfigurable Computing systems become more popular, concerns arise about their security and integrity. Runtime access to the configuration memory of Dynamic Partially Reconfigurable FPGA devices offers new design...
详细信息
This short paper presents a preliminary analysis of the impact of model parameter uncertainty on the accuracy of solution algorithms for the scheduling problems with the learning effect. We consider the maximum comple...
详细信息
ISBN:
(纸本)9789898565105
This short paper presents a preliminary analysis of the impact of model parameter uncertainty on the accuracy of solution algorithms for the scheduling problems with the learning effect. We consider the maximum completion time minimization flowshop problem with job processing times described by the power functions dependent on the number of processed jobs. To solve the considered scheduling problem we propose heuristic (NEH based) and metaheuristic (simulated annealing) algorithms. The numerical experiments show that NEH and simulated annealing are robust for this problem with respect to model parameter uncertainty.
The problems of scheduling of tasks described with dynamic models appear in the real-world situations, where management of the processes described with differential equations is needed. Possible applications contains ...
详细信息
ISBN:
(纸本)9783902661555
The problems of scheduling of tasks described with dynamic models appear in the real-world situations, where management of the processes described with differential equations is needed. Possible applications contains e.g: refuelling of the fleet of the boats in the given critical time, scheduling of tasks in the multiple computer systems and the forging process in the steel plants. The solution for such problems consists of two parts: continuous one (the allocation of the continuously divisible resource) and the discrete one (sequence of task subsets). The research has been done mostly for the former part so far, where the latter one was neglected. In the paper we recollect properties of the discrete part of the solution space and we prove some new properties. These new properties can be used to construct more efficient algorithms for the scheduling problems with the dynamic models of tasks.
Abstract This paper is concerned with the adjoint Jacobian motion planning algorithm for the Chaplygin sleigh. We introduce general idea about the algorithm and prove completeness of this algorithm for the Chaplygin s...
详细信息
Abstract This paper is concerned with the adjoint Jacobian motion planning algorithm for the Chaplygin sleigh. We introduce general idea about the algorithm and prove completeness of this algorithm for the Chaplygin sleigh. Finally we present the simulation result illustrating performance of this algorithm.
The paper deals with a representation of the antibody-antigen chromosomes. The proposed new binary decoding allows us to prove the dependence between subsequent generations of chromosomes, using quick and simple opera...
详细信息
暂无评论