This is the second part of joint research in which we show that every 2-connected graph G has the F4 property. That is, given distinct xi ∈ V (G), 1 ≤ i ≤ 4, there is an x1x2-hamiltonian path in G2 containing diffe...
详细信息
A new lower bound on the tenacity ?of a graph G in terms of its connectivity and genus is obtained. The lower bound and interrelationship involving tenacity and other well-known graphical parameters are considered, an...
详细信息
A new lower bound on the tenacity ?of a graph G in terms of its connectivity and genus is obtained. The lower bound and interrelationship involving tenacity and other well-known graphical parameters are considered, and another formulation introduced from further bounds are derived.
The high cost and lack of accuracy in haplotypes sampling has caused it's reconstruction problem enters the field of computer science as a laboratory genetic science case. Deducing haplotypes from SNP fragments wh...
详细信息
The high cost and lack of accuracy in haplotypes sampling has caused it's reconstruction problem enters the field of computer science as a laboratory genetic science case. Deducing haplotypes from SNP fragments which may have deficient and incorrect information, decreases laboratory costs. In this regard, various models have been presented as a NPHard problem such as MEC and MEC/GI. The MEC model used in this paper is basically a clustering problem and there are some solutions in this area. Here we have tried to decrease the data complexity, using fuzzy method of weighted averaging then the K-Means clustering method has been applied. As a result, the proficiency of the model has been proven by applying it in two real datasets.
The problem of influence maximization is to find initial users in social networks so that they eventually influence the largest number of people. This problem is used in wide areas such as epidemiology, economics for ...
详细信息
The problem of influence maximization is to find initial users in social networks so that they eventually influence the largest number of people. This problem is used in wide areas such as epidemiology, economics for ...
详细信息
The problem of influence maximization is to find initial users in social networks so that they eventually influence the largest number of people. This problem is used in wide areas such as epidemiology, economics for detecting the spread of an infection disease, marketing a new product as quickly as possible, respectively. We propose three heuristic algorithms for influential nodes selection after detecting communities in social networks. They are faster than an original greedy algorithm and close to its influence spreads. We evaluate influential nodes selection algorithms on a large academic collaboration network. We experimentally demonstrate that our proposed algorithms outperform the greedy algorithm and traditional heuristic.
Since SOA adoption will revolutionize an enterprise and its information systems, it is important for both the IT technicians and the business executives to be careful on the whole process of adoption and post-adoption...
详细信息
Since SOA adoption will revolutionize an enterprise and its information systems, it is important for both the IT technicians and the business executives to be careful on the whole process of adoption and post-adoption...
详细信息
Since SOA adoption will revolutionize an enterprise and its information systems, it is important for both the IT technicians and the business executives to be careful on the whole process of adoption and post-adoption steps. This paper has investigated how to migrate to SOA. To achieve this goal a roadmap is presented by combining existing roadmaps which has already proposed by the others. This roadmap has eight steps in three levels: management, organizational and components. The steps include strategy, operational planning, organization, design, governance, implementation, monitoring and establishment. It is shown that our roadmap has more advantages in comparison with the existing ones.
We describe our approach for the automatic composition of monophone melodies on a user given chord sequence. For this purpose we use Markov-chains and other methods to build some initial individuals. These are then op...
详细信息
We describe our approach for the automatic composition of monophone melodies on a user given chord sequence. For this purpose we use Markov-chains and other methods to build some initial individuals. These are then optimised with evolutionary algorithms using automatically learned classifiers next to interactive evaluation as fitness functions.
We describe our approach for the automatic composition of monophone melodies on a user given chord sequence. For this purpose we use evolutionary algorithms for the music generation with automatically learned classifi...
详细信息
ISBN:
(纸本)9608457564
We describe our approach for the automatic composition of monophone melodies on a user given chord sequence. For this purpose we use evolutionary algorithms for the music generation with automatically learned classifiers next to interactive evaluation as fitness functions.
暂无评论