期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Data mining and well logging interpretation: application to a conglomerate reservoir 被引量:8
1
作者 石宁 李洪奇 罗伟平 《Applied Geophysics》 SCIE CSCD 2015年第2期263-272,276,共11页
Data mining is the process of extracting implicit but potentially useful information from incomplete, noisy, and fuzzy data. Data mining offers excellent nonlinear modeling and self-organized learning, and it can play... Data mining is the process of extracting implicit but potentially useful information from incomplete, noisy, and fuzzy data. Data mining offers excellent nonlinear modeling and self-organized learning, and it can play a vital role in the interpretation of well logging data of complex reservoirs. We used data mining to identify the lithologies in a complex reservoir. The reservoir lithologies served as the classification task target and were identified using feature extraction, feature selection, and modeling of data streams. We used independent component analysis to extract information from well curves. We then used the branch-and- bound algorithm to look for the optimal feature subsets and eliminate redundant information. Finally, we used the C5.0 decision-tree algorithm to set up disaggregated models of the well logging curves. The modeling and actual logging data were in good agreement, showing the usefulness of data mining methods in complex reservoirs. 展开更多
关键词 Data mining well logging interpretation independent component analysis branch-and-bound algorithm C5.0 decision tree
下载PDF
n个零件在m台机器上加工有停歇时间的计划排序问题
2
作者 高雁群 蔡择林 《湖北师范学院学报(自然科学版)》 1991年第1期53-57,共5页
本文就n个零件在m台机器上加工且在每两台机器加工时段之间存在停歇时段,以总加工时间最小为目标的排序问题当零件加工同顺序时进行讨论,给出了m=3时的分支——定界算法,是文[1]方法的推广。
关键词 停歇时间 可行和加工时间 分支——定界算法
下载PDF
Optimal subcarrier allocation for cognitive radio with multi-user OFDM and distributed antenna 被引量:1
3
作者 葛文栋 纪红 +1 位作者 司鹏搏 李曦 《Journal of Southeast University(English Edition)》 EI CAS 2010年第4期513-517,共5页
The subcarrier allocation problem in cognitive radio(CR)networks with multi-user orthogonal frequency-division multiplexing(OFDM)and distributed antenna is analyzed and modeled for the flat fading channel and the ... The subcarrier allocation problem in cognitive radio(CR)networks with multi-user orthogonal frequency-division multiplexing(OFDM)and distributed antenna is analyzed and modeled for the flat fading channel and the frequency selective channel,where the constraint on the secondary user(SU)to protect the primary user(PU)is that the total throughput of each PU must be above the given threshold instead of the "interference temperature".According to the features of different types of channels,the optimal subcarrier allocation schemes are proposed to pursue efficiency(or maximal throughput),using the branch and bound algorithm and the 0-1 implicit enumeration algorithm.Furthermore,considering the tradeoff between efficiency and fairness,the optimal subcarrier allocation schemes with fairness are proposed in different fading channels,using the pegging algorithm.Extensive simulation results illustrate the significant performance improvement of the proposed subcarrier allocation schemes compared with the existing ones in different scenarios. 展开更多
关键词 cognitive radio subcarrier allocation multi-user OFDM distributed antenna branch and bound algorithm implicit enumeration algorithm pegging algorithm
下载PDF
Economical Aspects of the Vehicle Scheduling Optimization
4
作者 Michal Krempl 《Chinese Business Review》 2013年第3期217-222,共6页
The paper deals with the vehicle scheduling problem related to regional public transport. Linear programming methods are used to solve the problem. A mathematical model is created including the constraints and the obj... The paper deals with the vehicle scheduling problem related to regional public transport. Linear programming methods are used to solve the problem. A mathematical model is created including the constraints and the objective function minimizing costs and the number of vehicles. A minimum costs and a number of vehicles are forced at the same time by special economical input data analysis and an allocation of costs. Determining of the costs coefficients is done by three methods, which differs primarily by how much of the total costs they take into account. The decomposition of the set of lines into disjoint subsets can be used instead of the "direct" optimization. The decomposition has proven to be a suitable alternative in solving large optimization problems. The problem was applied to optimize vehicle scheduling in the region, which is situated in the north-east of the Czech Republic. There is used Xpress-IVE software, which solve the problem by simplex algorithm and branch and bound method. Research results show that there are large reserves in the organization of public transport. The implementation of the new vehicle scheduling would bring significant costs reductions in amount of at least 10% for the optimal solution and in amount of about 10% for the decomposition solution. The number of drivers could be decreased and the total time of the vehicles being outside the garage could be also reduced by at least 10%. 展开更多
关键词 public transport OPTIMIZATION vehicle scheduling linear mathematical modeling transport economy decomposition of input data
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部