检索结果-内蒙古大学图书馆

An Offline Framework for Handling Automatic Passenger Counting Raw Data

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2014年第6期15卷 2443-2456页

作者： Barabino, Benedetto Di Francesco, Massimo Mozzoni, Sara Technomobil Ltd I-09122 Cagliari Italy Univ Cagliari Dept Civil Engn Environm & Architecture I-09124 Cagliari Italy Univ Cagliari Dept Math & Comp Sci I-09123 Cagliari Italy

Knowledge of ridership data on bus routes is pivotal for the quality and efficient operational planning of public transport companies. Automatic passenger counting (APC) can represent a powerful resource for supporting this activity, because it can provide a databank of accurate counts. However, relevant challenges, such as the matching of data to the bus stop, data validation, tackling anomalies, and building intelligible performance reports, must be faced in order to make APC data a mainstream source of information. This paper proposes an offline framework for addressing these challenges. In order to illustrate a possible application of the framework, its use for setting bus frequencies is investigated. The results are represented by easy-to-read control dashboards composed of tables and graphs. The methodology is experimentally tested with data records provided by the bus operator CTM in Cagliari, Italy. Finally, we discuss the implications on service rearrangement.

关键词： Automatic passenger counting (APC) raw data matching algorithms transit operations

来源：评论

学校读者我要写书评

暂无评论

Efficient methods using slanted support windows for slanted surfaces

引用

IET COMPUTER VISION 2016年第5期10卷 384-391页

作者： Li, Xuesong Liu, Jianguo Chen, Guang Fu, Heng Wuhan Univ Technol Hubei Key Lab Adv Technol Automot Components Wuhan 430070 Peoples R China Wuhan Univ Technol Hubei Collaborat Innovat Ctr Automot Components T Wuhan 430070 Peoples R China

The frontal-parallel assumption is made by many matching algorithms, but this assumption fails for slanted surfaces. This study proposes a matching algorithm intended to improve the matching results for slanted surfaces. First, a mathematical model is constructed to prove that slanted surfaces in the environment have corresponding slanted disparity surfaces in the disparity space image, and the model is to help find the proper plane parameters of slanted support windows, then improved cost aggregation and post-processing methods are proposed. The algorithm is tested using the Middlebury and Karlsruhe Institute of Technology and Toyota Technical Institute at Chicago (KITTI) benchmarks. The results demonstrate that the algorithm exhibits good performance and is efficient for slanted surfaces.

关键词： image matching optical windows slanted surfaces slanted support windows frontal-parallel assumption matching algorithms mathematical model slanted disparity surfaces disparity space image plane parameters cost aggregation post-processing methods Middlebury Karlsruhe Institute of Technology Toyota Technical Institute Chicago KITTI benchmarks

来源：评论

学校读者我要写书评

暂无评论

Retrieval for decision support resources by structured models

引用

DECISION SUPPORT SYSTEMS 2007年第4期43卷 1117-1132页

作者： Guentzer, Ulrich Mueller, Rudolf Mueller, Stefan Schimkat, Ralf-Dieter Univ Tubingen Wilhelm Schikard Inst Comp Sci D-72076 Tubingen Germany Maastricht Univ Dept Quantitat Econ NL-6200 MD Maastricht Netherlands Res & Dev All One Systemhaus AG D-88436 Oberessendorf Germany SAF AG Hightech Ctr 2 CH-8274 Tagerwilen Switzerland

The number of available DSS within organizational Intranets will soon require efficient retrieval functionality. While Web retrieval technology performs excellent on documents, computational services need approaches that capture the semantics of resources. We present a retrieval approach that uses a variant of Structured Modeling to represent resources. It allows the use of similarity of models for retrieval. Exact similarity computation is shown to be NP-hard, and efficient heuristics for similarity computation and filter algorithms are introduced. We report an evaluation in a classroom experiment and give computational results on a benchmark library. (C) 2005 Elsevier B.V. All rights reserved.

关键词： decision support systems information retrieval matching algorithms

来源：评论

学校读者我要写书评

暂无评论

Spatio-Temporal Non-Intrusive Direct V2V Charge Sharing Coordination

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2019年第10期68卷 9385-9398页

作者： Bulut, Eyuphan Kisacikoglu, Mithat C. Akkaya, Kemal Virginia Commonwealth Univ Dept Comp Sci Richmond VA 23284 USA Univ Alabama Dept Elect & Comp Engn Tuscaloosa AL 35487 USA Florida Int Univ Miami FL 33174 USA

Direct vehicle-to-vehicle (V2V) charge sharing system has the potential to provide more flexibility to electric vehicle (EV) charging without depending on the charging station infrastructure or building designated parking lots. It can also provide an opportunity to shift peak time utility load to off-peak times. However, the assignment between the EVs that demand energy and the EVs with surplus energy or existing charging stations is a challenging problem as it has to be performed in real time considering their spatio-temporal distribution, availability, and grid load. In this paper, we study this assignment problem specifically in a supplier non-intrusive scenario (without changing their mobility) and aim to understand the potential benefits of a direct V2V charge sharing system. To this end, we present two new algorithms to match the demander EVs to suppliers for charging. In the first one, the maximum system benefit is targeted under multiple system objectives with different priorities and considering the grid load. In the second one, individual EV priorities are taken into account and a stable matching process depending on predefined user preferences is provided. We conduct extensive simulations using real user commuting patterns and existing charging station locations in three different cities together with a newly developed probabilistic EV charging behavior model and EV mobility. Simulation results show that direct V2V charge sharing can reduce the energy consumption of EVs by by 20%-35% by providing a closer charging facility compared to the charging station only case, offload grid charging power in peak times by 35%-55%, and help sustain up to 2.2x EV charging requests without building new charging infrastructure, while causing a marginal increase (i.e., 3%-9%) in the energy cycling of supplier EVs. The results also show that the proposed matching algorithms offer 80%-90% more energy consumption reduction compared to the intrusive V2V charging at designated

关键词： Plug-in electric vehicle vehicle-to-vehicle charging sharing economy matching algorithms

来源：评论

学校读者我要写书评

暂无评论

Wavelet based Raman spectra comparison

引用

CHEMOMETRICS AND INTELLIGENT LABORATORY SYSTEMS 2011年第1期107卷 65-68页

作者： Cooper, Gordon Kubik, Maria Kubik, Kurt Art Gallery Western Australia Perth Cultural Ctr Perth WA 6000 Australia Univ Witwatersrand Sch Geosci ZA-2050 Wits South Africa Univ Queensland Sch IT & Elect Engn Brisbane Qld 4072 Australia

In this paper a novel blind peak detector for Raman spectra based on the continuous wavelet transform is proposed. The peak detector is shown to correctly identify peaks of different widths and intensities, and is well suited for subsequent peak-to-peak matching for the process of identifying unknown Raman spectra with the help of a library of reference spectra. No background reduction or initial noise filtering is necessary. The described methods were verified by successfully identifying 73 paint pigments by a spectral search through a Raman library for 638 pigments. In all except 7 cases, the Schmincke-Kremer pairings from the truth reference were found to be amongst the two top pairings with the largest matching cost function. These 7 cases were again inspected by the paintings conservator and doubts were raised regarding the truthfulness of the initial pairing. The proposed methods are equally applicable to other spectral methods. Crown Copyright (C) 2011 Published by Elsevier B.V. All rights reserved.

关键词： Raman spectra matching algorithms Wavelet comparison Pigment identification Art conservation

来源：评论

学校读者我要写书评

暂无评论

Approaches to winner determination in combinatorial auctions

引用

DECISION SUPPORT SYSTEMS 2000年第1-2期28卷 165-176页

作者： Sandholm, T Washington Univ Dept Comp Sci St Louis MO 63130 USA

Combinatorial auctions, i.e., auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auctions in multi-item auctions where the agents' valuations of the items are not additive. However, determining the winners so as to maximize revenue is NP-complete. First, existing approaches for tackling this problem are reviewed: exhaustive enumeration, dynamic programming, approximation algorithms, and restricting the allowable combinations. Then, we overview our new search algorithm for optimal anytime winner determination. By capitalizing on the fact that the space of bids is necessarily sparsely populated in practice, it enlarges the envelope of input sizes for which combinatorial auctions are computationally feasible. Finally, we discuss eMediator, our electronic commerce server that implements several techniques for automatically facilitating commerce, including an auction house with generalized combinatorial auctions. To our knowledge, our implementation is the first Internet auction to support combinatorial auctions, bidding via graphically drawn price-quantity graphs, and by mobile agents. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： combinatorial auction winner determination matching algorithms multi-agent system electronic commerce server

来源：评论

学校读者我要写书评

暂无评论

Semi-matchings for bipartite graphs and load balancing

引用

JOURNAL OF algorithms-COGNITION INFORMATICS AND LOGIC 2006年第1期59卷 53-78页

作者： Harvey, NJA Ladner, RE Lovász, L Tarnir, T MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA

We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semi-matching problem;it is a relaxation of the known bipartite matching problem. We present a way to evaluate the quality of a given semi-matching and show that, under this measure, an optimal semi-matching balances the load on the right-hand vertices with respect to any L-p-norm. In particular, when modeling a job assignment system, an optimal semi-matching achieves the minimal makespan and the minimal flow time for the system. The problem of finding optimal semi-matchings is a special case of certain scheduling problems for which known solutions exist. However, these known solutions are based on general network optimization algorithms, and are not the most efficient way to solve the optimal semi-matching problem. To compute optimal semi-matchings efficiently, we present and analyze two new algorithms. The first algorithm generalizes the Hungarian method for computing maximum bipartite matchings, while the second, more efficient algorithm is based on a new notion of cost-reducing paths. Our experimental results demonstrate that the second algorithm is vastly superior to using known network optimization algorithms to solve the optimal semi-matching problem. Furthermore, this same algorithm can also be used to find maximum bipartite matchings and is shown to be roughly as efficient as the best known algorithms for this goal. (C) 2005 Elsevier Inc. All rights reserved.

关键词： bipartite graphs load balancing matching algorithms optimal algorithms semi-matching

来源：评论

学校读者我要写书评

暂无评论

Efficient Lazy Evaluation of Rule-Based Programs

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2010年第11期22卷 1521-1534页

作者： Van Weert, Peter Katholieke Univ Leuven Dept Comp Sci DTAI Res Grp B-3001 Louvain Belgium

Thirty years after Forgy's seminal dissertation, Rete remains the de facto standard matching algorithm. Despite promising research results, alternative algorithms such as TREAT and LEAPS have had little impact on modern production rule engines. Constraint Handling Rules (CHR) is a high-level, declarative programming language, similar to production rules. In recent years, CHR has increasingly been used in a wide range of general purpose applications. State-of-the-art CHR systems use LEAPS-like lazy matching, and implement a large body of novel program analyses and optimization techniques to further improve performance. While obviously related, CHR and production rules research have mostly evolved independently from each other. With this paper, we aim to foster cross fertilization of implementation techniques. We provide a lucid, comprehensive overview of CHR's rule evaluation methodology, and survey recent contributions to the field of lazy matching. Our empirical evaluation confirms that Rete-based engines would surely benefit from incorporating similar techniques and optimizations.

关键词： Optimizing compilation lazy evaluation matching algorithms production rules constraint handling rules

来源：评论

学校读者我要写书评

暂无评论

Inter-Plane Inter-Satellite Connectivity in Dense LEO Constellations

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2021年第6期20卷 3430-3443页

作者： Leyva-Mayorga, Israel Soret, Beatriz Popovski, Petar Aalborg Univ Dept Elect Syst DK-9220 Aalborg Denmark

With numerous ongoing deployments owned by private companies and startups, dense satellite constellations deployed in low Earth orbit (LEO) will play a major role in the near future of wireless communications. In addition, the 3rd Generation Partnership Project (3GPP) has ongoing efforts to integrate satellites into 5G and beyond-5G networks. Nevertheless, numerous challenges must be overcome to fully exploit the connectivity capabilities of satellite constellations. These challenges are mainly a consequence of the low capabilities of individual small satellites, along with their high orbital speeds and small coverage due to the low altitude of deployment. In particular, inter-plane inter-satellite links (ISLs), which connect satellites from different orbital planes, are greatly dynamic and may be considerably affected by the Doppler shift. In this paper, we present a framework and the corresponding algorithms for the dynamic establishment of the inter-plane ISLs in LEO constellations. Our results show that the proposed algorithms increase the sum of rates in the constellation 1) by up to 115% with respect to the state-of-the-art benchmark schemes in an interference-free environment and 2) by up to 71% when compared to random resource allocation in a worst-case scenario for interference.

关键词： Satellites Orbits Low earth orbit satellites Earth Satellite constellations Planetary orbits Wireless communication Low Earth orbit (LEO) satellites matching algorithms satellite constellations space communications

来源：评论

学校读者我要写书评

暂无评论

Optimizing fuzzy makespan and tardiness for unrelated parallel machine scheduling with archived metaheuristics

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2011年第5-8期57卷 763-776页

作者： Chyu, Chiuh-Cheng Chang, Wei-Shung Yuan Ze Univ Dept Ind Engn & Management Jongli 320 Taiwan

This research presents two simulated annealing (SA) and a greedy randomized adaptive search procedure (GRASP) to solve unrelated parallel machine scheduling problems (UPMSPs) with two fuzzy optimization objectives-makespan and average tardiness. Few studies have employed fuzzy approach to solve multi-objective UPMSPs. In the research, several schemes are incorporated into the algorithm, including (1) matching-based decoding;(2) acceptance rule based on Pareto dominance, objective fitness, or Pareto reference point distance;(3) random or fixed weighted direction search. The matching-based decoding scheme has two phases: first max-min matching and then Hungarian method. Experiments were conducted to evaluate the algorithms' performance for moderate to large problem size instances. The results indicate that matching-based decoding scheme significantly improves solution quality, but will require more computation time. GRASP with path relinking performs slightly worse than objective fitness-based multi-objective simulated annealing algorithms (MOSA), but better than Pareto dominance-based MOSA in terms of several Pareto performance measures.

关键词： Multi-objective simulated annealing GRASP Unrelated parallel machine scheduling matching algorithms Fuzzy sets

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：