IEICE Transactions on Information and Systems
Online ISSN : 1745-1361
Print ISSN : 0916-8532
Current issue
Displaying 1-25 of 25 articles from this issue
Special Section on Empirical Software Engineering
  • Akinori IHARA
    2024 Volume E107.D Issue 3 Pages 244
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS
    Download PDF (169K)
  • Linhan LI, Qianying ZHANG, Zekun XU, Shijun ZHAO, Zhiping SHI, Yong GU ...
    Article type: PAPER
    2024 Volume E107.D Issue 3 Pages 245-256
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    The Linux kernel has been applied in various security-sensitive fields, so ensuring its security is crucial. Vulnerabilities in the Linux kernel are usually caused by undefined behaviors of the C programming language, the most threatening of which are memory safety vulnerabilities. Both the software-based and hardware approaches to memory safety have disadvantages of poor performance, false positives, and poor compatibility. This paper explores the feasibility of using the safe programming language Rust to reconstruct a Linux kernel component and open-source the component's code. We leverage the Rust FFI mechanism to design a safe foreign interface layer to enable the reconstructed component to invoke other Linux functionalities, and then use Rust to reconstruct the component, during which we leverage Rust's type-safety and ownership mechanisms to improve its security, and finally export the C interface of the component to enable the invocation by the Linux kernel. The performance and memory overhead of the reconstructed component, referred to as “rOOM”, were evaluated, revealing a performance overhead of 8.9% in kernel mode, 5% in user mode, 3% in real time, and a memory overhead of 0.06%. These results suggest that it is possible to develop key components of the Linux kernel using Rust in terms of functionality, performance, and memory overhead.

    Download PDF (2229K)
  • Juntong HONG, Eunjong CHOI, Osamu MIZUNO
    Article type: PAPER
    2024 Volume E107.D Issue 3 Pages 257-267
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    Code search is a task to retrieve the most relevant code given a natural language query. Several recent studies proposed deep learning based methods use multi-encoder model to parse code into multi-field to represent code. These methods enhance the performance of the model by distinguish between similar codes and utilizing a relation matrix to bridge the code and query. However, these models require more computational resources and parameters than single-encoder models. Furthermore, utilizing the relation matrix that solely relies on max-pooling disregards the delivery of word alignment information. To alleviate these problems, we propose a combined alignment model for code search. We concatenate the multi-code fields into one sequence to represent code and use one encoding model to encode code features. Moreover, we transform the relation matrix using trainable vectors to avoid information losses. Then, we combine intra-modal and cross-modal attention to assign the salient words while matching the corresponding code and query. Finally, we apply the attention weight to code/query embedding and compute the cosine similarity. To evaluate the performance of our model, we compare our model with six previous models on two popular datasets. The results show that our model achieves 0.614 and 0.687 Top@1 performance, outperforming the best comparison models by 12.2% and 9.3%, respectively.

    Download PDF (2243K)
  • Ikuto YAMAGATA, Masateru TSUNODA, Keitaro NAKASAI
    Article type: LETTER
    2024 Volume E107.D Issue 3 Pages 268-272
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    Software development companies must consider employees' job satisfaction and turnover intentions. To explain the related factors, this study focused on future perspective index (FPI). FPI was assumed to relate positively to satisfaction and negatively to turnover. In the analysis, we compared the FPI with existing factors that are considered to be related to job satisfaction. We discovered that the FPI was promising for enhancing explanatory power, particularly when analyzing satisfaction.

    Download PDF (361K)
  • Shin KOMEDA, Masateru TSUNODA, Keitaro NAKASAI, Hidetake UWANO
    Article type: LETTER
    2024 Volume E107.D Issue 3 Pages 273-276
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    A major approach to enhancing software quality is reviewing the source code to identify defects. To aid in identifying flaws, an approach in which a machine learning model predicts residual defects after implementing a code review is adopted. After the model has predicted the existence of residual defects, a second-round review is performed to identify such residual flaws. To enhance the prediction accuracy of the model, information known to developers but not recorded as data is utilized. Confidence in the review is evaluated by reviewers using a 10-point scale. The assessment result is used as an independent variable of the prediction model of residual defects. Experimental results indicate that confidence improves the prediction accuracy.

    Download PDF (311K)
Special Section on Foundations of Computer Science — Foundations of Computer Science and their New Trends —
  • Jinhee CHUN
    2024 Volume E107.D Issue 3 Pages 277
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS
    Download PDF (225K)
  • Hiroshi FUJIWARA, Keiji HIRAO, Hiroaki YAMAMOTO
    Article type: PAPER
    2024 Volume E107.D Issue 3 Pages 278-285
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    In Variant 4 of the one-way trading game [El-Yaniv, Fiat, Karp, and Turpin, 2001], a player has one dollar at the beginning and wants to convert it to yen only by one-way conversion. The exchange rate is guaranteed to fluctuate between m and M, and only the maximum fluctuation ratio φ = M/m is informed to the player in advance. The performance of an algorithm for this game is measured by the competitive ratio. El-Yaniv et al. derived the best possible competitive ratio over all algorithms for this game. However, it seems that the behavior of the best possible algorithm itself has not been explicitly described. In this paper we reveal the behavior of the best possible algorithm by solving a linear optimization problem. The behavior turns out to be quite different from that of the best possible algorithm for Variant 2 in which the player knows m and M in advance.

    Download PDF (779K)
  • Xuanke JIANG, Sherief HASHIMA, Kohei HATANO, Eiji TAKIMOTO
    Article type: PAPER
    2024 Volume E107.D Issue 3 Pages 286-293
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    In this paper, we investigate an online job scheduling problem with n jobs and k servers, where the accessibilities between the jobs and the servers are given as a bipartite graph. The scheduler is tasked with minimizing the regret, defined as the difference between the total flow time of the scheduler over T rounds and that of the best-fixed scheduling in hindsight. We propose an algorithm whose regret bounds are $O(n^2 \sqrt{T\ln (nk)})$ for general bipartite graphs, $O((n^2/k^{1/2}) \sqrt{T\ln (nk)})$ for the complete bipartite graphs, and $O((n^2/k) \sqrt{T \ln (nk)}$ for the disjoint star graphs, respectively. We also give a lower regret bound of $\Omega((n^2/k) \sqrt{T})$ for the disjoint star graphs, implying that our regret bounds are almost optimal.

    Download PDF (1191K)
  • Ryotaro MITSUBOSHI, Kohei HATANO, Eiji TAKIMOTO
    Article type: PAPER
    2024 Volume E107.D Issue 3 Pages 294-300
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    Following the formulation of Support Vector Regression (SVR), we consider a regression analogue of soft margin optimization over the feature space indexed by a hypothesis class H. More specifically, the problem is to find a linear model w ∈ ℝH that minimizes the sum of ρ-insensitive losses over all training data for as small ρ as posssible, where the ρ-insensitive loss for a single data (xi, yi) is defined as max{|yi - ∑h whh(xi)| - ρ, 0}. Intuitively, the parameter ρ and the ρ-insensitive loss are defined analogously to the target margin and the hinge loss in soft margin optimization, respectively. The difference of our formulation from SVR is two-fold: (1) we consider L1-norm regularization instead of L2-norm regularization, and (2) the feature space is implicitly defined by a hypothesis class instead of a kernel. We propose a boosting-type algorithm for solving the problem with a theoretically guaranteed convergence rate under a natural assumption on the weak learnability.

    Download PDF (862K)
  • So KOIDE, Yoshiaki TAKATA, Hiroyuki SEKI
    Article type: PAPER
    2024 Volume E107.D Issue 3 Pages 301-311
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    Synthesis problems on multiplayer non-zero-sum games (MG) with multiple environment players that behave rationally are the problems to find a good strategy of the system and have been extensively studied. This paper concerns the synthesis problems on stochastic MG (SMG), where a special controller other than players, called nature, which chooses a move in its turn randomly, may exist. Two types of synthesis problems on SMG exist: cooperative rational synthesis problem (CRSP) and non-cooperative rational synthesis problem (NCRSP). The rationality of environment players is modeled by Nash equilibria, and CRSP is the problem to decide whether there exists a Nash equilibrium that gives the system a payoff not less than a given threshold. Ummels et al. studied the complexity of CRSP for various classes of objectives and strategies of players. CRSP fits the situation where the system can make a suggestion of a strategy profile (a tuple of strategies of all players) to the environment players. However, in real applications, the system may rarely have an opportunity to make suggestions to the environment, and thus CRSP is optimistic. NCRSP is the problem to decide whether there exists a strategy σ0 of the system satisfying that for every strategy profile of the environment players that forms a 0-fixed Nash equilibrium (a Nash equilibrium where the system's strategy is fixed to σ0), the system obtains a payoff not less than a given threshold. In this paper, we investigate the complexity of NCRSP for positional (i.e. pure memoryless) strategies. We consider ω-regular objectives as the model of players' objectives, and show the complexity results of the problem for several subclasses of ω-regular objectives. In particular, the problem for terminal reachability (TR) objectives is shown to be Σp2-complete.

    Download PDF (1067K)
  • Ren MIMURA, Kengo MIYAMOTO, Akio FUJIYOSHI
    Article type: PAPER
    2024 Volume E107.D Issue 3 Pages 312-319
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    This paper proposes graph linear notations and an extension of them with regular expressions. Graph linear notations are a set of strings to represent labeled general graphs. They are extended with regular expressions to represent sets of graphs by specifying chosen parts for selections and repetitions of certain induced subgraphs. Methods for the conversion between graph linear notations and labeled general graphs are shown. The NP-completeness of the membership problem for graph regular expressions is proved.

    Download PDF (5668K)
  • Chuzo IWAMOTO, Tatsuya IDE
    Article type: LETTER
    2024 Volume E107.D Issue 3 Pages 320-324
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    Chained Block is one of Nikoli's pencil puzzles. We study the computational complexity of Chained Block puzzles. It is shown that deciding whether a given instance of the Chained Block puzzle has a solution is NP-complete.

    Download PDF (279K)
  • Tesshu HANAKA, Nicolás HONORATO DROGUETT, Kazuhiro KURITA, Hirotaka ON ...
    Article type: LETTER
    2024 Volume E107.D Issue 3 Pages 325-327
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    In this paper, we study BALL COLLECTING WITH LIMITED ENERGY, which is a problem of scheduling robots with limited energy confined to a line to catch moving balls that eventually cross the line. For this problem, we show the NP-completeness of the general case and some algorithmic results for some cases with a small number of robots.

    Download PDF (114K)
  • Tatsuya GIMA, Tesshu HANAKA, Kohei NORO, Hirotaka ONO, Yota OTACHI
    Article type: LETTER
    2024 Volume E107.D Issue 3 Pages 328-330
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    In this letter, we present a new lower bound for the treewidth of a graph in terms of the second smallest eigenvalue of its Laplacian matrix. Our bound slightly improves the lower bound given by Chandran and Subramanian [Inf. Process. Lett., 87 (2003)].

    Download PDF (122K)
Special Section on Human Communication V
  • Kazuaki KONDO
    2024 Volume E107.D Issue 3 Pages 331
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS
    Download PDF (247K)
  • Ryosuke SAEKI, Takeshi HAYASHI, Ibuki YAMAMOTO, Kinya FUJITA
    Article type: PAPER
    2024 Volume E107.D Issue 3 Pages 332-341
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    This study discusses the feasibility to estimate the concentration level of Japanese document workers using computer. Based on the previous findings that dual-task scenarios increase reaction time, we hypothesized that the Kana-Kanji conversion confirmation time (KKCCT) would increase due to the decrease in cognitive resources allocated to the document task, i.e. the level of concentration on the task at hand. To examine this hypothesis, we conducted a set of experiments in which sixteen participants copied Kana text by typing and concurrently converted it into Kanji under three conditions: Normal, Dual-task, and Mental-fatigue. The results suggested the feasibility that KKCCT increased when participants were less concentrated on the task due to subtask or mental fatigue. These findings imply the potential utility of using confirmation time as a measure of concentration level in Japanese document workers.

    Download PDF (2761K)
  • Shiyu TENG, Jiaqing LIU, Yue HUANG, Shurong CHAI, Tomoko TATEYAMA, Xin ...
    Article type: PAPER
    2024 Volume E107.D Issue 3 Pages 342-353
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    Depression is a prevalent mental disorder affecting a significant portion of the global population, leading to considerable disability and contributing to the overall burden of disease. Consequently, designing efficient and robust automated methods for depression detection has become imperative. Recently, deep learning methods, especially multimodal fusion methods, have been increasingly used in computer-aided depression detection. Importantly, individuals with depression and those without respond differently to various emotional stimuli, providing valuable information for detecting depression. Building on these observations, we propose an intra- and inter-emotional stimulus transformer-based fusion model to effectively extract depression-related features. The intra-emotional stimulus fusion framework aims to prioritize different modalities, capitalizing on their diversity and complementarity for depression detection. The inter-emotional stimulus model maps each emotional stimulus onto both invariant and specific subspaces using individual invariant and specific encoders. The emotional stimulus-invariant subspace facilitates efficient information sharing and integration across different emotional stimulus categories, while the emotional stimulus specific subspace seeks to enhance diversity and capture the distinct characteristics of individual emotional stimulus categories. Our proposed intra- and inter-emotional stimulus fusion model effectively integrates multimodal data under various emotional stimulus categories, providing a comprehensive representation that allows accurate task predictions in the context of depression detection. We evaluate the proposed model on the Chinese Soochow University students dataset, and the results outperform state-of-the-art models in terms of concordance correlation coefficient (CCC), root mean squared error (RMSE) and accuracy.

    Download PDF (6961K)
  • Rintaro CHUJO, Atsunobu SUZUKI, Ari HAUTASAARI
    Article type: PAPER
    2024 Volume E107.D Issue 3 Pages 354-362
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    Text-based communication, such as text chat, is commonly employed in various contexts, both professional and personal. However, it lacks the rich emotional cues present in verbal and visual forms of communication, such as facial expressions and tone of voice, making it more challenging to convey emotions and increasing the likelihood of misunderstandings. In this study, we focused on typefaces as emotional cues employed in text-based communication and investigated the influence of font design on impression formation and decision-making through two experiments. The results of the experiments revealed the relationship between Japanese typeface design and impression formation, and indicated that advice presented in a font evoking an impression of high confidence was more likely to be accepted than advice presented in a font evoking an impression of low confidence.

    Download PDF (1034K)
  • Tetsuo KOSAKA, Kazuya SAEKI, Yoshitaka AIZAWA, Masaharu KATO, Takashi ...
    Article type: PAPER
    2024 Volume E107.D Issue 3 Pages 363-373
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    Emotional speech recognition is generally considered more difficult than non-emotional speech recognition. The acoustic characteristics of emotional speech differ from those of non-emotional speech. Additionally, acoustic characteristics vary significantly depending on the type and intensity of emotions. Regarding linguistic features, emotional and colloquial expressions are also observed in their utterances. To solve these problems, we aim to improve recognition performance by adapting acoustic and language models to emotional speech. We used Japanese Twitter-based Emotional Speech (JTES) as an emotional speech corpus. This corpus consisted of tweets and had an emotional label assigned to each utterance. Corpus adaptation is possible using the utterances contained in this corpus. However, regarding the language model, the amount of adaptation data is insufficient. To solve this problem, we propose an adaptation of the language model by using online tweet data downloaded from the internet. The sentences used for adaptation were extracted from the tweet data based on certain rules. We extracted the data of 25.86 M words and used them for adaptation. In the recognition experiments, the baseline word error rate was 36.11%, whereas that with the acoustic and language model adaptation was 17.77%. The results demonstrated the effectiveness of the proposed method.

    Download PDF (1428K)
  • Akiyoshi SHINDO, Shogo FUKUSHIMA, Ari HAUTASAARI, Takeshi NAEMURA
    Article type: PAPER
    2024 Volume E107.D Issue 3 Pages 374-382
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    A user wearing a Head-Mounted Display (HMD) is likely to feel isolated when sharing virtual reality (VR) experiences with Non-HMD users in the same physical space due to not being able to see the real space outside the virtual world. This research proposes a method for an HMD user to recognize the Non-HMD users' gaze and attention via a projector attached to the HMD. In the proposed approach, the projected HMD user's view is filtered darker than default, and when Non-HMD users point controllers towards the projected view, the filter is removed from a circular area for both HMD and Non-HMD users indicating which region the Non-HMD users are viewing. We conducted two user studies showing that the Non-HMD users' gaze can be recognized with the proposed method, and investigated the preferred range for the alpha value and the size of the area for removing the filter for the HMD user.

    Download PDF (23892K)
Regular Section
  • Shin-ichi NAKANO
    Article type: PAPER
    Subject area: Fundamentals of Information Systems
    2024 Volume E107.D Issue 3 Pages 383-385
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    In this paper we study a recently proposed variant of the r-gathering problem. An r-gathering of customers C to facilities F is an assignment A of C to open facilities F'F such that r or more customers are assigned to each open facility. (Each facility needs enough number of customers to open.) Given an opening cost op(f) for each fF, and a connecting cost co(c,f) for each pair of cC and fF, the cost of an r-gathering A is max{maxcC{co(c, A(c))}, maxfF'{op(f)}}. The r-gathering problem consists of finding an r-gathering having the minimum cost. Assume that F is a set of locations for emergency shelters, op(f) is the time needed to prepare a shelter fF, and co(c,f) is the time needed for a person cC to reach assigned shelter f=A(c)∈F. Then an r-gathering corresponds to an evacuation plan such that each open shelter serves r or more people, and the r-gathering problem consists of finding an evacuation plan minimizing the evacuation time span. However in a solution above some person may be assigned to a farther open shelter although it has a closer open shelter. It may be difficult for the person to accept such an assignment for an emergency situation. Therefore, Armon considered the problem with one more additional constraint, that is, each customer should be assigned to a closest open facility, and gave a 9-approximation polynomial-time algorithm for the problem. We have designed a simple 3-approximation algorithm for the problem. The running time is O(r|C||F|).

    Download PDF (330K)
  • Shuhei TSUCHIDA, Satoru FUKAYAMA, Jun KATO, Hiromu YAKURA, Masataka GO ...
    Article type: PAPER
    Subject area: Human-computer Interaction
    2024 Volume E107.D Issue 3 Pages 386-399
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    Composing choreography is challenging because it involves numerous iterative refinements. According to our video analysis and interviews, choreographers typically need to imagine dancers' movements to revise drafts on paper since testing new movements and formations with actual dancers takes time. To address this difficulty, we present an interactive group-dance simulation interface, DanceUnisoner, that assists choreographers in composing a group dance in a simulated environment. With DanceUnisoner, choreographers can arrange excerpts from solo-dance videos of dancers throughout a three-dimensional space. They can adjust various parameters related to the dancers in real time, such as each dancer's position and size and each movement's timing. To evaluate the effectiveness of the system's parametric, visual, and interactive interface, we asked seven choreographers to use it and compose group dances. Our observations, interviews, and quantitative analysis revealed their successful usage in iterative refinements and visual checking of choreography, providing insights to facilitate further computational creativity support for choreographers.

    Download PDF (15239K)
  • Yang YU, Longlong LIU, Ye ZHU, Shixin CEN, Yang LI
    Article type: PAPER
    Subject area: Image Recognition, Computer Vision
    2024 Volume E107.D Issue 3 Pages 400-410
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    Pedestrian attribute recognition (PAR) aims to recognize a series of a person's semantic attributes, e.g., age, gender, which plays an important role in video surveillance. This paper proposes a multi-correlation graph convolutional network named MCGCN for PAR, which includes a semantic graph, visual graph, and synthesis graph. We construct a semantic graph by using attribute features with semantic constraints. A graph convolution is employed, based on prior knowledge of the dataset, to learn the semantic correlation. 2D features are projected onto visual graph nodes and each node corresponds to the feature region of each attribute group. Graph convolution is then utilized to learn regional correlation. The visual graph nodes are connected to the semantic graph nodes to form a synthesis graph. In the synthesis graph, regional and semantic correlation are embedded into each other through inter-graph edges, to guide each other's learning and to update the visual and semantic graph, thereby constructing semantic and regional correlation. On this basis, we use a better loss weighting strategy, the suit_polyloss, to address the imbalance of pedestrian attribute datasets. Experiments on three benchmark datasets show that the proposed approach achieves superior recognition performance compared to existing technologies, and achieves state-of-the-art performance.

    Download PDF (2146K)
  • Wang XU, Yongliang MA, Kehai CHEN, Ming ZHOU, Muyun YANG, Tiejun ZHAO
    Article type: PAPER
    Subject area: Natural Language Processing
    2024 Volume E107.D Issue 3 Pages 411-419
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    Non-autoregressive generation has attracted more and more attention due to its fast decoding speed. Latent alignment objectives, such as CTC, are designed to capture the monotonic alignments between the predicted and output tokens, which have been used for machine translation and sentence summarization. However, our preliminary experiments revealed that CTC performs poorly on document abstractive summarization, where a high compression ratio between the input and output is involved. To address this issue, we conduct a theoretical analysis and propose Hierarchical Latent Alignment (HLA). The basic idea is a two-step alignment process: we first align the sentences in the input and output, and subsequently derive token-level alignment using CTC based on aligned sentences. We evaluate the effectiveness of our proposed approach on two widely used datasets XSUM and CNNDM. The results indicate that our proposed method exhibits remarkable scalability even when dealing with high compression ratios.

    Download PDF (1537K)
  • Byeongtae PARK, Dong-Kyu CHAE
    Article type: LETTER
    Subject area: Artificial Intelligence, Data Mining
    2024 Volume E107.D Issue 3 Pages 420-423
    Published: March 01, 2024
    Released on J-STAGE: March 01, 2024
    JOURNAL FREE ACCESS

    Recently, multivariate time-series data has been generated in various environments, such as sensor networks and IoT, making anomaly detection in time-series data an essential research topic. Unsupervised learning anomaly detectors identify anomalies by training a model on normal data and producing high residuals for abnormal observations. However, a fundamental issue arises as anomalies do not consistently result in high residuals, necessitating a focus on the time-series patterns of residuals rather than individual residual sizes. In this paper, we present a novel framework comprising two serialized anomaly detectors: the first model calculates residuals as usual, while the second one evaluates the time-series pattern of the computed residuals to determine whether they are normal or abnormal. Experiments conducted on real-world time-series data demonstrate the effectiveness of our proposed framework.

    Download PDF (244K)
feedback
Top