標(biāo)題: Titlebook: Computational Intelligence and Intelligent Systems; 6th International Sy Zhenhua Li,Xiang Li,Zhihua Cai Conference proceedings 2012 Springe [打印本頁] 作者: 重要 時間: 2025-3-21 17:46
書目名稱Computational Intelligence and Intelligent Systems影響因子(影響力)
書目名稱Computational Intelligence and Intelligent Systems影響因子(影響力)學(xué)科排名
書目名稱Computational Intelligence and Intelligent Systems網(wǎng)絡(luò)公開度
書目名稱Computational Intelligence and Intelligent Systems網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computational Intelligence and Intelligent Systems被引頻次
書目名稱Computational Intelligence and Intelligent Systems被引頻次學(xué)科排名
書目名稱Computational Intelligence and Intelligent Systems年度引用
書目名稱Computational Intelligence and Intelligent Systems年度引用學(xué)科排名
書目名稱Computational Intelligence and Intelligent Systems讀者反饋
書目名稱Computational Intelligence and Intelligent Systems讀者反饋學(xué)科排名
作者: 得罪人 時間: 2025-3-22 00:08 作者: 混合,攙雜 時間: 2025-3-22 03:01 作者: Brocas-Area 時間: 2025-3-22 07:21
New Proofs for Several Combinatorial Identitiesr of surprising inverse series relations. Combing Gould-Hsu inversions just mentioned with Vandermonde’s formula, four known terminating .??series identities are recovered. In addition, new proofs for two extensions of .-Chu-Vandermonde identity due to Fang[6] and two formulae on Stirling numbers of作者: 大火 時間: 2025-3-22 11:08 作者: 愛花花兒憤怒 時間: 2025-3-22 15:38
Research and Realization of N–Queens Problem Based on the Logic Language Prologming language Prolog, the author uses Prolog program to solve the 8-queen up to N-queen problem and improve running speed and simplify the algorithm complexity by the agency of features of Prolog logic language and through optimizing recursive algorithm.作者: 愛花花兒憤怒 時間: 2025-3-22 18:31
Enterprise Information Management Based on Cloud Platformlogy, the paper introduced the concept of cloud data management system, analysis the basic principles of BigTable, Hbase and Sector / Sphere which are the main Internet cloud data management system at present in depth. Then propose the idea that cloud computing can apply to the enterprise which woul作者: 拱形大橋 時間: 2025-3-23 00:31
uDisC: An Ultra-Lightweight and Distributed Scheme for Defending against Data Loss Attack in RFID Ne number of RFID tags may be large or the speed of tags may be fast, the reader may misreading some tags. Thus, the data consistence is damaged in central RFID database. Currently, many solutions are proposed for this problem. However, few of them paid much efforts in computation overhead and respons作者: Callus 時間: 2025-3-23 03:19 作者: UTTER 時間: 2025-3-23 07:49
Personalized Friend Recommendation in Social Network Based on Clustering Methodion to recommend potential friends for users. However, their algorithms are based on the amounts of common friends, which has some drawbacks in accuracy. We proposed a new recommendation method by combining the existed ’friend of friend’ algorithm and content-based recommendation. Through this metho作者: 主動脈 時間: 2025-3-23 12:44 作者: 衣服 時間: 2025-3-23 15:22
Applying Support Vector Machine to Time Series Prediction in Oracle future value of the time series. To build SVM model, firstly the trend in time series must be removed, and the target attribute should be normalized. secondly the size of the time window in which include all the lagged values should be determined, thirdly the machine learning method is used to cons作者: ectropion 時間: 2025-3-23 21:48 作者: 使隔離 時間: 2025-3-23 23:01
MapReduce-Based Bayesian Automatic Text Classifier Used in Digital Library as digital library. How to process data efficiently becomes a vital problem for the further development of digital library. Because Mapreduce model has strong capacity of processing mass data, Mapreduce-based Bayesian classifier can reduce the time that is caused by machine learning and therefore e作者: Unsaturated-Fat 時間: 2025-3-24 06:04 作者: Hyaluronic-Acid 時間: 2025-3-24 09:38
Preferences Predictions of Learning Objects Supported by Collaborative Recommendationsceive recommendations based on outcomes of tests they have already taken. In this paper we explore methods from formal concept analysis for predicting students’ preferences with respect to learning objects going to be suggested to them before they have taken relevant tests.作者: 織布機 時間: 2025-3-24 13:21 作者: cinder 時間: 2025-3-24 18:19 作者: 愚蠢人 時間: 2025-3-24 19:59
An Improved Bayesian Inference Method for Data-Intensive Computing作者: Recessive 時間: 2025-3-25 00:45 作者: 裂縫 時間: 2025-3-25 06:28 作者: 留戀 時間: 2025-3-25 11:03
https://doi.org/10.1007/978-3-658-11012-3solution. So we present an unsupervised clustering algorithm which combing with genetic algorithm and k-medoids clustering algorithm. All of these methods are efficiently to solve the defects of traditional k-medoids algorithm. And the algorithm can distinguish new attack from already existed attack作者: 巨頭 時間: 2025-3-25 12:40 作者: landfill 時間: 2025-3-25 18:38
Roberta Pearson,Anthony N. Smithuperior in the condition of time restraint comparing with the Genetic Algorithm, and validate the effectiveness of employing the Artificial Fish Swarm Algorithm in resolving dynamic weapon target assignment problem.作者: exhibit 時間: 2025-3-25 23:41 作者: 遠足 時間: 2025-3-26 00:54
,Die Erz?hlung in der Literaturwissenschaft,truct SVM prediction model according to the time series data. Comparing with the traditional time series prediction model, SVM prediction models can reveal non-linear, non-stationary and randomness of the time series, and have higher prediction accuracy.作者: Blanch 時間: 2025-3-26 06:13
Jan Shaw,Philippa Kelly,L. E. Semleronstruction of FP-tree and the discovery of frequent itemsets can be realized simultaneously. Compared with FP-growth, it is not necessary to mine frequent itemsets after the construction of the whole FP-tree in Dynamic-prune. Experimental results show Dynamic-prune is efficient and scalable.作者: 充氣女 時間: 2025-3-26 08:56 作者: 秘傳 時間: 2025-3-26 13:35
1865-0929 rnational Symposium on Intelligence Computation and Applications, ISICA 2012, held in Wuhan, China, in October 2012. The 72 revised full papers presented were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on artificial life, adaptive behavior作者: Intellectual 時間: 2025-3-26 17:10 作者: 無聊的人 時間: 2025-3-26 23:58 作者: Fluctuate 時間: 2025-3-27 02:07 作者: 放大 時間: 2025-3-27 06:22
https://doi.org/10.1007/978-3-658-29756-5cy. We proposed a new recommendation method by combining the existed ’friend of friend’ algorithm and content-based recommendation. Through this method we can get more meaningful and apt recommendation outcomes and calculate more quickly in the large amount of data.作者: 考古學(xué) 時間: 2025-3-27 11:08
The State of the Nation’s Narrativesto students. Considering the amount of resources required to support that process and the current restrictions on educational budgets there is an obvious need for further research in this area. In this paper we pay special attention on how to select the most suitable learning objects from a database.作者: 財主 時間: 2025-3-27 15:56
A Novel Heuristic Filter Based on Ant Colony Optimization for Non-linear Systems State Estimationthe state space dynamically in a similar scheme to the optimization algorithm, known as Continuous Ant Colony System. The performance of the new filter is evaluated for a nonlinear benchmark and the results are compared with those of Extended Kalman Filter and Particle Filter, showing improvements in terms of estimation accuracy.作者: 出處 時間: 2025-3-27 20:19
New Proofs for Several Combinatorial Identitiesntities are recovered. In addition, new proofs for two extensions of .-Chu-Vandermonde identity due to Fang[6] and two formulae on Stirling numbers of the second kind due to Chu and Wei[4] are also offered by means of combinatorial techniques.作者: 出價 時間: 2025-3-27 22:24
Construction of Standard College Tuition Model and Optimizationl model with the minimum difference between personal and social satisfaction and the greatest overall satisfaction, by using particle swarm algorithm to optimize the model, has given a reasonable charge tuition standard and national finance investment standard recommendations.作者: 盡管 時間: 2025-3-28 05:42
Personalized Friend Recommendation in Social Network Based on Clustering Methodcy. We proposed a new recommendation method by combining the existed ’friend of friend’ algorithm and content-based recommendation. Through this method we can get more meaningful and apt recommendation outcomes and calculate more quickly in the large amount of data.作者: 低位的人或事 時間: 2025-3-28 08:50
On Dependences among Objects and Attributesto students. Considering the amount of resources required to support that process and the current restrictions on educational budgets there is an obvious need for further research in this area. In this paper we pay special attention on how to select the most suitable learning objects from a database.作者: Wordlist 時間: 2025-3-28 12:21 作者: 出來 時間: 2025-3-28 17:51
H.F.M Peters,R. Bastiaanse,B.J.E. Mondelaersd robustness of the suggested method for face detection in the stationary scenes, and its strong adaptability to attitude, expression and age. Also, the results show that this method is definitely practical in real time. In a word, the accuracy is above 84 percent.作者: Trypsin 時間: 2025-3-28 21:20
M.T.J.A. Embrechts,M.C. Frankenare conducted to test the parallel classification programs. The results indicate that in most cases the performance is significantly improved, especially for multi-spectral remote sensing image classification, in which a highest speed-up of 3.92 is reached.作者: Protein 時間: 2025-3-28 23:00 作者: JIBE 時間: 2025-3-29 05:43 作者: 含水層 時間: 2025-3-29 09:46
Parallel Remote Sensing Image Processing: Taking Image Classification as an Exampleare conducted to test the parallel classification programs. The results indicate that in most cases the performance is significantly improved, especially for multi-spectral remote sensing image classification, in which a highest speed-up of 3.92 is reached.作者: 盡管 時間: 2025-3-29 13:52
Conference proceedings 2012han, China, in October 2012. The 72 revised full papers presented were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on artificial life, adaptive behavior, agents, and ant colony optimization; combinatorial and numerical optimization; communi作者: 滔滔不絕地說 時間: 2025-3-29 19:20 作者: 擔(dān)憂 時間: 2025-3-29 23:15
Storytelling mit der 3-Akt-Struktur for comprehensive information management of the enterprise are studied, the physical and technical frameworks, the function design and coding rule of the could platform analyzed, the design thinking and implementation of the cloud platform also given.作者: enchant 時間: 2025-3-30 01:01
https://doi.org/10.1007/978-3-658-29756-5 collision is detected, agent needs to make a deviation from its current desired velocity to conduct a collision-free motion. Experiment results from case study shows the proposed framework is able to simulate agent’s movement for dynamic environment.作者: Pamphlet 時間: 2025-3-30 04:54 作者: Confess 時間: 2025-3-30 11:46 作者: 廢止 時間: 2025-3-30 16:19 作者: 鋼盔 時間: 2025-3-30 20:35 作者: 一起 時間: 2025-3-30 23:50
Applying Support Vector Machine to Time Series Prediction in Oracletruct SVM prediction model according to the time series data. Comparing with the traditional time series prediction model, SVM prediction models can reveal non-linear, non-stationary and randomness of the time series, and have higher prediction accuracy.作者: incisive 時間: 2025-3-31 03:45
Dynamic FP-Tree Pruning for Concurrent Frequent Itemsets Miningonstruction of FP-tree and the discovery of frequent itemsets can be realized simultaneously. Compared with FP-growth, it is not necessary to mine frequent itemsets after the construction of the whole FP-tree in Dynamic-prune. Experimental results show Dynamic-prune is efficient and scalable.作者: Cardiac 時間: 2025-3-31 08:59
MapReduce-Based Bayesian Automatic Text Classifier Used in Digital Librarynhance the overall efficiency. The new method can classify documents into different groups according to its subject. In this way, it is helpful for management and storage of information. Thus Mapreduce-based Bayesian text classifier can be used in digital library successfully which will provide better service for people.作者: 玩忽職守 時間: 2025-3-31 11:14 作者: 環(huán)形 時間: 2025-3-31 13:21
Preferences Predictions of Learning Objects Supported by Collaborative Recommendationsceive recommendations based on outcomes of tests they have already taken. In this paper we explore methods from formal concept analysis for predicting students’ preferences with respect to learning objects going to be suggested to them before they have taken relevant tests.作者: 諂媚于人 時間: 2025-3-31 21:29 作者: 矛盾心理 時間: 2025-4-1 00:28 作者: Mirage 時間: 2025-4-1 03:27
Die 15 archetypischen Storytelling-Formate, estimation problem as a stochastic dynamic optimization problem and utilizes a colony of ants to find and track the best estimation. The ants search the state space dynamically in a similar scheme to the optimization algorithm, known as Continuous Ant Colony System. The performance of the new filte作者: 革新 時間: 2025-4-1 09:41
