| 1. |
- Kristan, Matej, et al.
(författare)
-
The first visual object tracking segmentation VOTS2023 challenge results
- 2023
-
Ingår i: 2023 IEEE/CVF International conference on computer vision workshops (ICCVW). - : Institute of Electrical and Electronics Engineers Inc.. - 9798350307443 - 9798350307450 ; , s. 1788-1810
-
Konferensbidrag (refereegranskat)abstract
- The Visual Object Tracking Segmentation VOTS2023 challenge is the eleventh annual tracker benchmarking activity of the VOT initiative. This challenge is the first to merge short-term and long-term as well as single-target and multiple-target tracking with segmentation masks as the only target location specification. A new dataset was created; the ground truth has been withheld to prevent overfitting. New performance measures and evaluation protocols have been created along with a new toolkit and an evaluation server. Results of the presented 47 trackers indicate that modern tracking frameworks are well-suited to deal with convergence of short-term and long-term tracking and that multiple and single target tracking can be considered a single problem. A leaderboard, with participating trackers details, the source code, the datasets, and the evaluation kit are publicly available at the challenge website1
|
|
| 2. |
- Deng, Tao, et al.
(författare)
-
Cost-Optimal Caching for D2D Networks with Presence of User Mobility
- 2017
-
Ingår i: GLOBECOM 2017 - 2017 IEEE Global Communications Conference. - : IEEE. - 9781509050192
-
Konferensbidrag (refereegranskat)abstract
- Caching popular files at user equipments (UEs) provides an effective way to alleviate the burden of the back-haul networks. Generally, popularity based caching is not a system-wide optimal strategy, especially for mobility scenarios. Motivated by this observation, an optimal caching problem with respect to user mobility is investigated. To be specific, a cost-optimal caching problem (COCP) for device-to-device (D2D) networks is formulated, in which the impact of user mobility, cache size, and total number of encoded file segments are considered. Compared with the related studies, our investigation guarantees that the collected segments are non-overlapping, takes into account the cost of downloading from the network, and provides a rigorous complexity analysis. For problem solving, we first prove that the optimal caching placement of one user, giving other users' caching placements, can be derived in polynomial time. Then, based on this proof, a fast yet effective caching placement algorithm for all users is developed. Simulation results verify the effectiveness of this algorithm by comparing it to conventional caching algorithms.
|
|
| 3. |
- Huang, S. Y., et al.
(författare)
-
Observations of Whistler Waves in the Magnetic Reconnection Diffusion Region
- 2018
-
Ingår i: 2ND URSI ATLANTIC RADIO SCIENCE MEETING (AT-RASC). - : IEEE. - 9789082598735
-
Konferensbidrag (refereegranskat)abstract
- Whistler waves are believed to play an important role during magnetic reconnection. In this paper, we report the simultaneous occurrence of two types of the whistler waves in the magnetotail reconnection diffusion region. The first type is observed in the pileup region of downstream and propagates away along the field lines to downstream, and is possibly generated by the electron temperature anisotropy at the magnetic equator. The second type is found around the separatrix region and propagates towards the X-line, and is possibly aenerated by the electron beam-driven whistler instability or Cerenkov emission from electron phase-space holes. Our observations of two different types of whistler waves are well consistent with recent kinetic simulations, and suggest that the observed whistler waves are the consequences of magnetic reconnection.Moreover, we statistically investigate the whistler waves in the magnetotail reconnection region, and construct the global distribution and occurrence rate of the whistler waves based on the two-dimensional reconnection model. It is found that the occurrence rate of the whistler waves is large in the separatrix region (113,1B0j>0.4) and pileup region ([B,./Bol<0.2, 161>45'), but very small in the X-line region. The statistical results are well consistent with the case study.
|
|
| 4. |
- Yu, Zhanwei, et al.
(författare)
-
Multi-cell Caching : Fresh Information with Minimum Cost
- 2022
-
Ingår i: 2022 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC). - : Institute of Electrical and Electronics Engineers (IEEE). - 9781665442664 - 9781665442671 ; , s. 327-332
-
Konferensbidrag (refereegranskat)abstract
- In multi-access edge computing (MEC) systems, there are several local cache servers caching contents to satisfy the users' requests, instead of letting the users download via the remote cloud server. In this paper, a content scheduling problem (CSP) in MEC systems is considered. Taking into account jointly the freshness of the cached contents and the traffic data costs, we study how to schedule content updates along time in a multi-cell setting. Different from single-cell scenarios, a user may have multiple candidate cache servers, and thus all cells and their caching decisions must be jointly taken. We first prove that CSP is NP-hard, then we formulate CSP using integer linear programming. For problem solving, via a mathematical reformulation, we derive a column generation algorithm embedded into a rounding scheme. Our performance evaluation demonstrates that the solutions obtained are within 0.8% from global optimality.
|
|
