As data grows in size,search engines face new challenges in extracting more relevant content for users’searches.As a result,a number of retrieval and ranking algorithms have been employed to ensure that the results a...As data grows in size,search engines face new challenges in extracting more relevant content for users’searches.As a result,a number of retrieval and ranking algorithms have been employed to ensure that the results are relevant to the user’s requirements.Unfortunately,most existing indexes and ranking algo-rithms crawl documents and web pages based on a limited set of criteria designed to meet user expectations,making it impossible to deliver exceptionally accurate results.As a result,this study investigates and analyses how search engines work,as well as the elements that contribute to higher ranks.This paper addresses the issue of bias by proposing a new ranking algorithm based on the PageRank(PR)algorithm,which is one of the most widely used page ranking algorithms We pro-pose weighted PageRank(WPR)algorithms to test the relationship between these various measures.The Weighted Page Rank(WPR)model was used in three dis-tinct trials to compare the rankings of documents and pages based on one or more user preferences criteria.Thefindings of utilizing the Weighted Page Rank model showed that using multiple criteria to rankfinal pages is better than using only one,and that some criteria had a greater impact on ranking results than others.展开更多
In recent years, Japan, and especially rural areas have faced the growing problems of debt-ridden local railway lines along with the population decline and aging population. Therefore, it is best to consider the disco...In recent years, Japan, and especially rural areas have faced the growing problems of debt-ridden local railway lines along with the population decline and aging population. Therefore, it is best to consider the discontinuation of local railway lines and introduce replacement buses to secure the transportation methods of the local people especially in rural areas. Based on the above background, targeting local railway lines that may be discontinued in the near future, appropriate bus stops when provided with potential bus stops were selected, the present study proposed a method that introduces routes for railway replacement buses adopting ant colony optimization (ACO). The improved ACO was designed and developed based on the requirements set concerning the route length, number of turns, road width, accessibility of railway lines and zones without bus stops as well as the constraint conditions concerning the route length, number of turns and zones without bus stops. Original road network data were generated and processed adopting a geographic information systems (GIS), and these are used to search for the optimal route for railway replacement buses adopting the improved ACO concerning the 8 zones on the target railway line (JR Kakogawa line). By comparing the improved ACO with Dijkstra’s algorithm, its relevance was verified and areas needing further improvements were revealed.展开更多
This paper describes the theory, implementation, and experimental evaluation of an Aggregation Cache Replacement （ ACR ） algorithm. By considering application background, carefully choosing weight values, using a sp...This paper describes the theory, implementation, and experimental evaluation of an Aggregation Cache Replacement （ ACR ） algorithm. By considering application background, carefully choosing weight values, using a special formula to calculate the similarity, and clustering ontologies by similarity for getting more embedded deep relations, ACR combines the ontology similarity with the value of object and decides which object is to be replaced. We demonstrate the usefulness of ACR through experiments. （a） It is found that the aggregation tree is created wholly differently according to the application cases. Therefore, clustering can direct the content adaptation more accurately according to the user perception and can satisfy the user with different preferences. （b） After comparing this new method with widely-used algorithm Last-Recently-Used （LRU） and First-in-First-out （FIFO） method, it is found that ACR outperforms the later two in accuracy and usability. （c） It has a better semantic explanation and makes adaptation more personalized and more precise.展开更多
To gain a competitive edge within the international and compet让ive setting of coal markets, coal producers must find new ways of reducing costs. Increasing bench drilling efficiency and performance in open-cast coal ...To gain a competitive edge within the international and compet让ive setting of coal markets, coal producers must find new ways of reducing costs. Increasing bench drilling efficiency and performance in open-cast coal mines has the potential to generate savings. Specifically, monitoring, analyzing, and optimizing the drilling operation can reduce drilling costs. For example, determining the optimal drill bit replacement time will help to achieve the desirable penetration rate. This paper presents a life data analysis of drill bits to fit a statistical distribution using failure records. These results are then used to formulate a cost minimization problem to estimate the drill bit replacement time using the evolutionary algorithm. The effect of cost on the uncertainty associated with replacement time is assessed through Monte-Carlo simulation. The relationship between the total expected replacement cost and replacement time is also presented. A case study shows that the proposed approach can be used to assist with designing a drill bit replacement schedule and minimize costs in open-cast coal mines.展开更多
Modern shared-memory multi-core processors typically have shared Level 2(L2)or Level 3(L3)caches.Cache bottlenecks and replacement strategies are the main problems of such architectures,where multiple cores try to acc...Modern shared-memory multi-core processors typically have shared Level 2(L2)or Level 3(L3)caches.Cache bottlenecks and replacement strategies are the main problems of such architectures,where multiple cores try to access the shared cache simultaneously.The main problem in improving memory performance is the shared cache architecture and cache replacement.This paper documents the implementation of a Dual-Port Content Addressable Memory(DPCAM)and a modified Near-Far Access Replacement Algorithm(NFRA),which was previously proposed as a shared L2 cache layer in a multi-core processor.Standard Performance Evaluation Corporation(SPEC)Central Processing Unit(CPU)2006 benchmark workloads are used to evaluate the benefit of the shared L2 cache layer.Results show improved performance of the multicore processor’s DPCAM and NFRA algorithms,corresponding to a higher number of concurrent accesses to shared memory.The new architecture significantly increases system throughput and records performance improvements of up to 8.7%on various types of SPEC 2006 benchmarks.The miss rate is also improved by about 13%,with some exceptions in the sphinx3 and bzip2 benchmarks.These results could open a new window for solving the long-standing problems with shared cache in multi-core processors.展开更多
针对尾矿坝在线监测重建设、轻利用的现状,基于尾矿坝位移在线监测时间序列,通过多步逆向云变换算法(Multi-step Backward Cloud Transformation Algorithm Based on Sampling with Replacement,MBCT-SR)改进云模型,根据“3E_(n)原则”...针对尾矿坝在线监测重建设、轻利用的现状,基于尾矿坝位移在线监测时间序列,通过多步逆向云变换算法(Multi-step Backward Cloud Transformation Algorithm Based on Sampling with Replacement,MBCT-SR)改进云模型,根据“3E_(n)原则”和内外包络曲线确定在线监测位移的正常运行值,从而建立尾矿坝位移分级预警阈值模型,并利用某尾矿坝全球导航卫星(Global Navigation Satellite System,GNSS)技术表面位移在线监测数据进行实例验证。结果表明:该尾矿坝水平方向位移的黄、橙、红预警阈值分别为8.41 mm/d、12.94 mm/d、19.41 mm/d,呈现出坝体中间预警阈值最大、并由中间向两侧减小的空间变化规律;尾矿坝垂直方向位移的黄、橙、红预警阈值分别为16.56 mm/d、25.48 mm/d、38.22 mm/d,且随着子坝的堆积,预警阈值逐渐增大。展开更多
文摘As data grows in size,search engines face new challenges in extracting more relevant content for users’searches.As a result,a number of retrieval and ranking algorithms have been employed to ensure that the results are relevant to the user’s requirements.Unfortunately,most existing indexes and ranking algo-rithms crawl documents and web pages based on a limited set of criteria designed to meet user expectations,making it impossible to deliver exceptionally accurate results.As a result,this study investigates and analyses how search engines work,as well as the elements that contribute to higher ranks.This paper addresses the issue of bias by proposing a new ranking algorithm based on the PageRank(PR)algorithm,which is one of the most widely used page ranking algorithms We pro-pose weighted PageRank(WPR)algorithms to test the relationship between these various measures.The Weighted Page Rank(WPR)model was used in three dis-tinct trials to compare the rankings of documents and pages based on one or more user preferences criteria.Thefindings of utilizing the Weighted Page Rank model showed that using multiple criteria to rankfinal pages is better than using only one,and that some criteria had a greater impact on ranking results than others.
文摘In recent years, Japan, and especially rural areas have faced the growing problems of debt-ridden local railway lines along with the population decline and aging population. Therefore, it is best to consider the discontinuation of local railway lines and introduce replacement buses to secure the transportation methods of the local people especially in rural areas. Based on the above background, targeting local railway lines that may be discontinued in the near future, appropriate bus stops when provided with potential bus stops were selected, the present study proposed a method that introduces routes for railway replacement buses adopting ant colony optimization (ACO). The improved ACO was designed and developed based on the requirements set concerning the route length, number of turns, road width, accessibility of railway lines and zones without bus stops as well as the constraint conditions concerning the route length, number of turns and zones without bus stops. Original road network data were generated and processed adopting a geographic information systems (GIS), and these are used to search for the optimal route for railway replacement buses adopting the improved ACO concerning the 8 zones on the target railway line (JR Kakogawa line). By comparing the improved ACO with Dijkstra’s algorithm, its relevance was verified and areas needing further improvements were revealed.
基金Supported by the National Natural Science Foun-dation of China (60472050)
文摘This paper describes the theory, implementation, and experimental evaluation of an Aggregation Cache Replacement （ ACR ） algorithm. By considering application background, carefully choosing weight values, using a special formula to calculate the similarity, and clustering ontologies by similarity for getting more embedded deep relations, ACR combines the ontology similarity with the value of object and decides which object is to be replaced. We demonstrate the usefulness of ACR through experiments. （a） It is found that the aggregation tree is created wholly differently according to the application cases. Therefore, clustering can direct the content adaptation more accurately according to the user perception and can satisfy the user with different preferences. （b） After comparing this new method with widely-used algorithm Last-Recently-Used （LRU） and First-in-First-out （FIFO） method, it is found that ACR outperforms the later two in accuracy and usability. （c） It has a better semantic explanation and makes adaptation more personalized and more precise.
文摘To gain a competitive edge within the international and compet让ive setting of coal markets, coal producers must find new ways of reducing costs. Increasing bench drilling efficiency and performance in open-cast coal mines has the potential to generate savings. Specifically, monitoring, analyzing, and optimizing the drilling operation can reduce drilling costs. For example, determining the optimal drill bit replacement time will help to achieve the desirable penetration rate. This paper presents a life data analysis of drill bits to fit a statistical distribution using failure records. These results are then used to formulate a cost minimization problem to estimate the drill bit replacement time using the evolutionary algorithm. The effect of cost on the uncertainty associated with replacement time is assessed through Monte-Carlo simulation. The relationship between the total expected replacement cost and replacement time is also presented. A case study shows that the proposed approach can be used to assist with designing a drill bit replacement schedule and minimize costs in open-cast coal mines.
文摘Modern shared-memory multi-core processors typically have shared Level 2(L2)or Level 3(L3)caches.Cache bottlenecks and replacement strategies are the main problems of such architectures,where multiple cores try to access the shared cache simultaneously.The main problem in improving memory performance is the shared cache architecture and cache replacement.This paper documents the implementation of a Dual-Port Content Addressable Memory(DPCAM)and a modified Near-Far Access Replacement Algorithm(NFRA),which was previously proposed as a shared L2 cache layer in a multi-core processor.Standard Performance Evaluation Corporation(SPEC)Central Processing Unit(CPU)2006 benchmark workloads are used to evaluate the benefit of the shared L2 cache layer.Results show improved performance of the multicore processor’s DPCAM and NFRA algorithms,corresponding to a higher number of concurrent accesses to shared memory.The new architecture significantly increases system throughput and records performance improvements of up to 8.7%on various types of SPEC 2006 benchmarks.The miss rate is also improved by about 13%,with some exceptions in the sphinx3 and bzip2 benchmarks.These results could open a new window for solving the long-standing problems with shared cache in multi-core processors.
