Kaori Yoshida

Kaori Yoshida

Auto-generated profile, based on publicly available information

Kaori Yoshida

Graduate School of Governance Studies, Meiji University, Tokyo, Japan

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2018 in International Journal of Affective Engineering
Verified
Journal Article
Open access
PDF file
BBBrahim Benaissa
Brahim Benaissa
MKMario Köppen
Mario Köppen
KYKaori Yoshida
Kaori Yoshida
The problems facing elderly who are living independently, are considered to be one of the most important motivations of the activity recognition research. The advances in sensing technologies allow collecting several types of data and communicate it wirelessly. However, most existing activity recognition systems requires pre-calculated pattern recognition models. This paper lays the theoretical foundations of a real-time methodology for activity and emotional recognition based on body and environment sensors simultaneously, then tackles one aspect of the method which is the path estimation using chest-mounted IMU sensor, for which a zero velocity update criteria is proposed. Finally path estimation results for sitting down, laying down, falling down and standing up are discussed.

1 November 2010
Verified
Conference Paper
Closed access
MKMario Koppen
Mario Koppen
RVRodrigo Verschae
Rodrigo Verschae
KYKaori Yoshida
Kaori Yoshida
MTMasato Tsuru
Masato Tsuru
In this contribution, we will reveal some problems related to the transition of the maxmin fairness concept from the continuous to the discrete domain. By means of the wireless channel allocation problem, a heuristic approach to fairness allocation will be presented, based on searching for allocations with high similarity of the corresponding throughputs and high total throughput at the same time. Thus, the proposed approach overcomes stated problems with discrete fairness by capturing the characterisitics of fairness as comparison criterion among solutions. A meta-heuristic algorithm is proposed to handle this problem, and results are presented for problem scales, where a complete analysis is still possible. The approach is demonstrated to sufficiently follow up the maxmin fairness states with regard to performance, while definitely excluding any artifacts arising from the transition of maxmin fair allocations to the discrete domain.

20 January 2003
Verified
Conference Paper
Closed access
KYK. Yoshida
K. Yoshida
TKT. Kato
T. Kato
TYT. Yanaru
T. Yanaru

1 December 2011
Verified
Conference Paper
Closed access
MKMario Koppen
Mario Koppen
KYKaori Yoshida
Kaori Yoshida
KOKei Ohnishi
Kei Ohnishi
We are studying the NFL Theorems with regard to relational optimization. In relational optimization, we represent the optimization problem by a formal relation, and the solution by the set of maximal (or non-dominated) elements of this relation. This appears to be a natural extension of standard optimization, and covers other notions of optimality as well. It will be shown that in this case, the NFL Theorems do not hold and that there are pairs of algorithms and a performance measure, where one always outperforms the other with regard to this performance measure if averaged over all possible relations. More specifically, the outperforming algorithm is an algorithm, where elements are checked one by one if they are dominated by any other element, while the outperformed algorithm is an algorithm, where elements are checked one by one if they dominate any other element. The proof is accompanied by a complete analysis of a special case, where also other performance measures are shown to be better when using the former algorithm.

12 December 2007
Verified
Book Chapter
Closed access
PDF file
MKMario Köppen
Mario Köppen
KYKaori Yoshida
Kaori Yoshida

5 June 2025 in Sexuality & Culture
Verified
Journal Article
Open access
PDF file
LMLim Mengzhen
Lim Mengzhen
TBTimothy Borsje
Timothy Borsje
DPDana Pangburn
Dana Pangburn
KYKaori Yoshida
Kaori Yoshida
EBElizaveta Berezina
Elizaveta Berezina
JBJaime Benjamin
Jaime Benjamin
The current trends in mating show a concerning shift, with young people increasingly choosing singlehood over long-term commitment or starting families, which could lead to demographic challenges. However, addressing these problems requires understanding how people define relationships. This study explores the social representations of short-term and long-term romantic relationships to inform social policy. A survey of 112 participants (44.6% male, mean age 23.27) was conducted. As this is a qualitative research study, this sample size is sufficient to provide an exploration of the topic. The findings revealed that: (i) “love” is central to both relationship types, (ii) “sex” is more important in short-term relationships, (iii) short-term relationships emphasize “fun” and “passion,” while long-term ones prioritize “trust,” “marriage,” and “stability,” and (iv) “marriage” is universally valued, but “family” is less significant. Based on these findings, six social policies are proposed to improve relationship education, support diverse dynamics, and address gender disparities and economic stability within long-term relationships.