Institution
Future University Hakodate
Education•Hakodate, Japan•
About: Future University Hakodate is a education organization based out in Hakodate, Japan. It is known for research contribution in the topics: Network packet & Mobile ad hoc network. The organization has 485 authors who have published 1338 publications receiving 13204 citations. The organization is also known as: Mirai Daigaku (Future University) Hakodate Japan.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: It is demonstrated that for maximum research benefit, any performance competition must involve comparative studies under closely controlled, varying conditions, and the critical role of comparative studies in the context of one well-known and growing performance competition: the annual Robotic Soccer World Cup (RoboCup) Championship.
Abstract: Performance competitions (events that pit many different programs against each other on a standardized task) provide a way for a research community to promote research progress towards challenging goals. In this paper, we argue that for maximum research benefit, any such competition must involve comparative studies under closely controlled, varying conditions. We demonstrate the critical role of comparative studies in the context of one well-known and growing performance competition: the annual Robotic Soccer World Cup (RoboCup) Championship. Specifically, over the past three years, we have carried out annual large-scale comparative evaluations—distinct from the competition itself—of the multi-agent teams taking part in the largest RoboCup league. Our study, which involved 30 different teams of agents produced by dozens of different research groups, focused on robustness. We show that (i) multi-agent teams exhibit a clear performance-robustness tradeoff; (ii) teams tend to over-specialize, so that they cannot handle beneficial changes we make to their operating environment; and (iii) teams improve in performance more than in robustness from one year to the next, despite the emphasis by RoboCup organizers on robustness as a key challenge. These results demonstrate the potential of large-scale comparative studies for producing important results otherwise difficult to discover, and are significant both in the lessons they raise for designers of multi-agent teams, and in understanding the place of performance competitions within the multi-agent research infrastructure.
13 citations
••
TL;DR: A theoretical and experimental study of affirmative action policies in school choice problems focusing on the minority reserve mechanism and the majority quota mechanism found the set of stable matchings was found to be larger with DA-Quota than withDA-Reserve, which explains the matching instability observed with the latter.
13 citations
•
01 Sep 2007
TL;DR: Two algorithms are proposed to remove radio frequency interference (RFI) based on the cyclostationary properties of amplitude modulation RFI and the main advantages are the detection of 1) weak RFI, 2) without confusion with potential signal.
Abstract: The relatively high contrast between planetary and solar low-frequency radio emissions suggest that the low-frequency radio range may be well adapted to the direct detection of exoplanets. Detection is based on temporal and spectral power integration to remove statistical fluctuations of the sky background noise. However, strong limitations, in particular due to radio frequency interference (RFI), may impair such detection. Indeed, if not detected, a RFI may be interpreted as an exoplanet signal or may conceal it. After a short summary of the detection principle in radio astronomy, we describe the algorithms proposed to remove RFI. First method, designed for rather strong RFI, is based on power threshold detection. The second one is based on the cyclostationary properties of amplitude modulation RFI. The main advantages of the latter are the detection of 1) weak RFI, 2) without confusion with potential signal. The statistics of this RFI detector are derived as a function of the integration time and the interference to noise ratio.
13 citations
••
13 citations
••
01 Mar 2017TL;DR: This paper considers a multi-hop WANET with malicious eavesdroppers and cooperative jammers, and formulate the SOQR as an optimization problem, and proposes the SoQR algorithm which selects the secure path between a pair of source and destination nodes in a distributed manner to achieve the optimal QoS performance.
Abstract: This paper study the secure optimal QoS routing (SOQR) in wireless ad hoc networks (WANETs) based on the physical layer security techniques. Specifically, we consider a multi-hop WANET with malicious eavesdroppers and cooperative jammers, and formulate the SOQR as an optimization problem. To deal with this problem, we first derive the closed-form expressions of connection outage probability (COP) and secrecy outage probability (SOP) for any given end-to-end path, which serve as the performance metrics of communication QoS and transmission security, respectively. Then, we explore the minimum COP conditioned on that SOP is below a pre- specified threshold and obtain the corresponding achievable power allocation strategy. With the help of analysis of a given path, we further propose the SOQR algorithm which selects the secure path between a pair of source and destination nodes in a distributed manner to achieve the optimal QoS performance. Finally, numerical simulations are conducted to validate the efficiency of our theoretical results, as well as to illustrate the QoS-security tradeoffs.
13 citations
Authors
Showing all 490 results
Name | H-index | Papers | Citations |
---|---|---|---|
Elizabeth D. Mynatt | 53 | 226 | 12992 |
Sidney Fels | 38 | 384 | 6288 |
Kouichi Sakurai | 33 | 568 | 6154 |
Tsuyoshi Takagi | 33 | 372 | 5342 |
Toshiyuki Nakagaki | 32 | 103 | 5469 |
Misako Takayasu | 30 | 200 | 3596 |
Fagen Li | 29 | 186 | 2910 |
Kenichiro Tanaka | 29 | 147 | 3594 |
Masahiko Yoshimoto | 27 | 381 | 3809 |
Xiaohong Jiang | 26 | 322 | 3275 |
Howon Kim | 25 | 270 | 2788 |
Daisuke Sakamoto | 25 | 96 | 2103 |
Tetsuo Ono | 24 | 82 | 2470 |
Shin-ichi Minato | 22 | 149 | 2779 |
Yoshisuke Ueda | 22 | 79 | 2279 |