The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] SEM(686hit)

101-120hit(686hit)

  • A Semantic Management Method of Simulation Models in GNSS Distributed Simulation Environment

    Guo-chao FAN  Chun-sheng HU  Xue-en ZHENG  Cheng-dong XU  

     
    PAPER-Data Engineering, Web Information Systems

      Pubricized:
    2018/10/09
      Vol:
    E102-D No:1
      Page(s):
    85-92

    In GNSS (Global Navigation Satellite System) Distributed Simulation Environment (GDSE), the simulation task could be designed with the sharing models on the Internet. However, too much information and relation of model need to be managed in GDSE. Especially if there is a large quantity of sharing models, the model retrieval would be an extremely complex project. For meeting management demand of GDSE and improving the model retrieval efficiency, the characteristics of service simulation model are analysed firstly. A semantic management method of simulation model is proposed, and a model management architecture is designed. Compared with traditional retrieval way, it takes less retrieval time and has a higher accuracy result. The simulation results show that retrieval in the semantic management module has a good ability on understanding user needs, and helps user obtain appropriate model rapidly. It improves the efficiency of simulation tasks design.

  • Leveraging Unannotated Texts for Scientific Relation Extraction

    Qin DAI  Naoya INOUE  Paul REISERT  Kentaro INUI  

     
    PAPER-Natural Language Processing

      Pubricized:
    2018/09/14
      Vol:
    E101-D No:12
      Page(s):
    3209-3217

    A tremendous amount of knowledge is present in the ever-growing scientific literature. In order to efficiently grasp such knowledge, various computational tasks are proposed that train machines to read and analyze scientific documents. One of these tasks, Scientific Relation Extraction, aims at automatically capturing scientific semantic relationships among entities in scientific documents. Conventionally, only a limited number of commonly used knowledge bases, such as Wikipedia, are used as a source of background knowledge for relation extraction. In this work, we hypothesize that unannotated scientific papers could also be utilized as a source of external background information for relation extraction. Based on our hypothesis, we propose a model that is capable of extracting background information from unannotated scientific papers. Our experiments on the RANIS corpus [1] prove the effectiveness of the proposed model on relation extraction from scientific articles.

  • Two Constructions of Semi-Bent Functions with Perfect Three-Level Additive Autocorrelation

    Deng TANG  Shaojing FU  Yang YANG  

     
    LETTER-Cryptography and Information Security

      Vol:
    E101-A No:12
      Page(s):
    2402-2404

    Semi-bent functions have very high nonlinearity and hence they have many applications in symmetric-key cryptography, binary sequence design for communications, and combinatorics. In this paper, we focus on studying the additive autocorrelation of semi-bent functions. We provide a lower bound on the maximum additive autocorrelation absolute value of semi-bent functions with three-level additive autocorrelation. Semi-bent functions with three-level additive autocorrelation achieving this bound with equality are said to have perfect three-level additive autocorrelation. We present two classes of balanced semi-bent functions with optimal algebraic degree and perfect three-level additive autocorrelation.

  • Transistor Characteristics of Single Crystalline C8-BTBT Grown in Coated Liquid Crystal Solution on Photo-Alignment Films

    Risa TAKEDA  Yosei SHIBATA  Takahiro ISHINABE  Hideo FUJIKAKE  

     
    BRIEF PAPER

      Vol:
    E101-C No:11
      Page(s):
    884-887

    We examined single crystal growth of benzothienobenzothiophene-based organic semiconductors by solution coating method using liquid crystal and investigated its electrical characteristics. As the results, we revealed that the averaged mobility in the saturation region reached 2.08 cm2/Vs along crystalline b-axis, and 1.08 cm2/Vs along crystalline a-axis.

  • Simultaneous Wireless Information and Power Transfer Solutions for Energy-Harvesting Fairness in Cognitive Multicast Systems

    Pham-Viet TUAN  Insoo KOO  

     
    LETTER-Mobile Information Network and Personal Communications

      Vol:
    E101-A No:11
      Page(s):
    1988-1992

    In this letter, we consider the harvested-energy fairness problem in cognitive multicast systems with simultaneous wireless information and power transfer. In the cognitive multicast system, a cognitive transmitter with multi-antenna sends the same information to cognitive users in the presence of licensed users, and cognitive users can decode information and harvest energy with a power-splitting structure. The harvested-energy fairness problem is formulated and solved by using two proposed algorithms, which are based on semidefinite relaxation with majorization-minimization method, and sequential parametric convex approximation with feasible point pursuit technique, respectively. Finally, the performances of the proposed solutions and baseline schemes are verified by simulation results.

  • A New Semi-Blind Method for Spatial Equalization in MIMO Systems

    Liu YANG  Hang ZHANG  Yang CAI  Qiao SU  

     
    LETTER-Digital Signal Processing

      Vol:
    E101-A No:10
      Page(s):
    1693-1697

    In this letter, a new semi-blind approach incorporating the bounded nature of communication sources with the distance between the equalizer outputs and the training sequence is proposed. By utilizing the sparsity property of l1-norm cost function, the proposed algorithm can outperform the semi-blind method based on higher-order statistics (HOS) criterion especially for transmitting sources with non-constant modulus. Experimental results demonstrate that the proposed method shows superior performance over the HOS based semi-blind method and the classical training-based method for QPSK and 16QAM sources equalization. While for 64QAM signal inputs, the proposed algorithm exhibits its superiority in low signal-to-noise-ratio (SNR) conditions compared with the training-based method.

  • Dynamic Ensemble Selection Based on Rough Set Reduction and Cluster Matching

    Ying-Chun CHEN  Ou LI  Yu SUN  

     
    PAPER-Fundamental Theories for Communications

      Pubricized:
    2018/04/11
      Vol:
    E101-B No:10
      Page(s):
    2196-2202

    Ensemble learning is widely used in the field of sensor network monitoring and target identification. To improve the generalization ability and classification precision of ensemble learning, we first propose an approximate attribute reduction algorithm based on rough sets in this paper. The reduction algorithm uses mutual information to measure attribute importance and introduces a correction coefficient and an approximation parameter. Based on a random sampling strategy, we use the approximate attribute reduction algorithm to implement the multi-modal sample space perturbation. To further reduce the ensemble size and realize a dynamic subset of base classifiers that best matches the test sample, we define a similarity parameter between the test samples and training sample sets that takes the similarity and number of the training samples into consideration. We then propose a k-means clustering-based dynamic ensemble selection algorithm. Simulations show that the multi-modal perturbation method effectively selects important attributes and reduces the influence of noise on the classification results. The classification precision and runtime of experiments demonstrate the effectiveness of the proposed dynamic ensemble selection algorithm.

  • Advanced Ensemble Adversarial Example on Unknown Deep Neural Network Classifiers

    Hyun KWON  Yongchul KIM  Ki-Woong PARK  Hyunsoo YOON  Daeseon CHOI  

     
    PAPER-Artificial Intelligence, Data Mining

      Pubricized:
    2018/07/06
      Vol:
    E101-D No:10
      Page(s):
    2485-2500

    Deep neural networks (DNNs) are widely used in many applications such as image, voice, and pattern recognition. However, it has recently been shown that a DNN can be vulnerable to a small distortion in images that humans cannot distinguish. This type of attack is known as an adversarial example and is a significant threat to deep learning systems. The unknown-target-oriented generalized adversarial example that can deceive most DNN classifiers is even more threatening. We propose a generalized adversarial example attack method that can effectively attack unknown classifiers by using a hierarchical ensemble method. Our proposed scheme creates advanced ensemble adversarial examples to achieve reasonable attack success rates for unknown classifiers. Our experiment results show that the proposed method can achieve attack success rates for an unknown classifier of up to 9.25% and 18.94% higher on MNIST data and 4.1% and 13% higher on CIFAR10 data compared with the previous ensemble method and the conventional baseline method, respectively.

  • Hardware Architecture for High-Speed Object Detection Using Decision Tree Ensemble

    Koichi MITSUNARI  Jaehoon YU  Takao ONOYE  Masanori HASHIMOTO  

     
    PAPER

      Vol:
    E101-A No:9
      Page(s):
    1298-1307

    Visual object detection on embedded systems involves a multi-objective optimization problem in the presence of trade-offs between power consumption, processing performance, and detection accuracy. For a new Pareto solution with high processing performance and low power consumption, this paper proposes a hardware architecture for decision tree ensemble using multiple channels of features. For efficient detection, the proposed architecture utilizes the dimensionality of feature channels in addition to parallelism in image space and adopts task scheduling to attain random memory access without conflict. Evaluation results show that an FPGA implementation of the proposed architecture with an aggregated channel features pedestrian detector can process 229 million samples per second at 100MHz operation frequency while it requires a relatively small amount of resources. Consequently, the proposed architecture achieves 350fps processing performance for 1080P Full HD images and outperforms conventional object detection hardware architectures developed for embedded systems.

  • Review Rating Prediction on Location-Based Social Networks Using Text, Social Links, and Geolocations

    Yuehua WANG  Zhinong ZHONG  Anran YANG  Ning JING  

     
    PAPER-Artificial Intelligence, Data Mining

      Pubricized:
    2018/06/01
      Vol:
    E101-D No:9
      Page(s):
    2298-2306

    Review rating prediction is an important problem in machine learning and data mining areas and has attracted much attention in recent years. Most existing methods for review rating prediction on Location-Based Social Networks only capture the semantics of texts, but ignore user information (social links, geolocations, etc.), which makes them less personalized and brings down the prediction accuracy. For example, a user's visit to a venue may be influenced by their friends' suggestions or the travel distance to the venue. To address this problem, we develop a review rating prediction framework named TSG by utilizing users' review Text, Social links and the Geolocation information with machine learning techniques. Experimental results demonstrate the effectiveness of the framework.

  • Autonomous, Decentralized and Privacy-Enabled Data Preparation for Evidence-Based Medicine with Brain Aneurysm as a Phenotype

    Khalid Mahmood MALIK  Hisham KANAAN  Vian SABEEH  Ghaus MALIK  

     
    PAPER

      Pubricized:
    2018/02/22
      Vol:
    E101-B No:8
      Page(s):
    1787-1797

    To enable the vision of precision medicine, evidence-based medicine is the key element. Understanding the natural history of complex diseases like brain aneurysm and particularly investigating the evidences of its rupture risk factors relies on the existence of semantic-enabled data preparation technology to conduct clinical trials, survival analysis and outcome prediction. For personalized medicine in the field of neurological diseases, it is very important that multiple health organizations coordinate and cooperate to conduct evidence based observational studies. Without the means of automating the process of privacy and semantic-enabled data preparation to conduct observational studies at intra-organizational level would require months to manually prepare the data. Therefore, this paper proposes a semantic and privacy enabled, multi-party data preparation architecture and a four-tiered semantic similarity algorithm. Evaluation shows that proposed algorithm achieves a precision of 79%, high recall at 83% and F-measure of 81%.

  • Efficient Transceiver Design for Large-Scale SWIPT System with Time-Switching and Power-Splitting Receivers

    Pham-Viet TUAN  Insoo KOO  

     
    PAPER-Terrestrial Wireless Communication/Broadcasting Technologies

      Pubricized:
    2018/01/12
      Vol:
    E101-B No:7
      Page(s):
    1744-1751

    The combination of large-scale antenna arrays and simultaneous wireless information and power transfer (SWIPT), which can provide enormous increase of throughput and energy efficiency is a promising key in next generation wireless system (5G). This paper investigates efficient transceiver design to minimize transmit power, subject to users' required data rates and energy harvesting, in large-scale SWIPT system where the base station utilizes a very large number of antennas for transmitting both data and energy to multiple users equipped with time-switching (TS) or power-splitting (PS) receive structures. We first propose the well-known semidefinite relaxation (SDR) and Gaussian randomization techniques to solve the minimum transmit power problems. However, for these large-scale SWIPT problems, the proposed scheme, which is based on conventional SDR method, is not suitable due to its excessive computation costs, and a consensus alternating direction method of multipliers (ADMM) cannot be directly applied to the case that TS or PS ratios are involved in the optimization problem. Therefore, in the second solution, our first step is to optimize the variables of TS or PS ratios, and to achieve simplified problems. After then, we propose fast algorithms for solving these problems, where the outer loop of sequential parametric convex approximation (SPCA) is combined with the inner loop of ADMM. Numerical simulations show the fast convergence and superiority of the proposed solutions.

  • Towards an Improvement of Bug Report Summarization Using Two-Layer Semantic Information

    Cheng-Zen YANG  Cheng-Min AO  Yu-Han CHUNG  

     
    PAPER

      Pubricized:
    2018/04/20
      Vol:
    E101-D No:7
      Page(s):
    1743-1750

    Bug report summarization has been explored in past research to help developers comprehend important information for bug resolution process. As text mining technology advances, many summarization approaches have been proposed to provide substantial summaries on bug reports. In this paper, we propose an enhanced summarization approach called TSM by first extending a semantic model used in AUSUM with the anthropogenic and procedural information in bug reports and then integrating the extended semantic model with the shallow textual information used in BRC. We have conducted experiments with a dataset of realistic software projects. Compared with the baseline approaches BRC and AUSUM, TSM demonstrates the enhanced performance in achieving relative improvements of 34.3% and 7.4% in the F1 measure, respectively. The experimental results show that TSM can effectively improve the performance.

  • Growth Mechanism of Polar-Plane-Free Faceted InGaN Quantum Wells Open Access

    Yoshinobu MATSUDA  Mitsuru FUNATO  Yoichi KAWAKAMI  

     
    INVITED PAPER

      Vol:
    E101-C No:7
      Page(s):
    532-536

    The growth mechanisms of three-dimensionally (3D) faceted InGaN quantum wells (QWs) on (=1=12=2) GaN substrates are discussed. The structure is composed of (=1=12=2), {=110=1}, and {=1100} planes, and the cross sectional shape is similar to that of 3D QWs on (0001). However, the 3D QWs on (=1=12=2) and (0001) show quite different inter-facet variation of In compositions. To clarify this observation, the local thicknesses of constituent InN and GaN on the 3D GaN are fitted with a formula derived from the diffusion equation. It is suggested that the difference in the In incorporation efficiency of each crystallographic plane strongly affects the surface In adatom migration.

  • Chirp Control of Semiconductor Laser by Using Hybrid Modulation Open Access

    Mitsunari KANNO  Shigeru MIEDA  Nobuhide YOKOTA  Wataru KOBAYASHI  Hiroshi YASAKA  

     
    INVITED PAPER

      Vol:
    E101-C No:7
      Page(s):
    561-565

    Frequency chirp of a semiconductor laser is controlled by using hybrid modulation, which simultaneously modulates intra-cavity loss and injection current to the laser. The positive adiabatic chirp of injection-current modulation is compensated with the negative adiabatic chirp created by intra-cavity-loss modulation, which enhances the chromatic-dispersion tolerance of the laser. A proof-of-concept transmission experiment confirmed that the hybrid modulation laser has a larger dispersion tolerance than conventional directly modulated lasers due to the negative frequency chirp originating from intra-cavity-loss modulation.

  • Complex-Valued Fully Convolutional Networks for MIMO Radar Signal Segmentation

    Motoko TACHIBANA  Kohei YAMAMOTO  Kurato MAENO  

     
    LETTER-Pattern Recognition

      Pubricized:
    2018/02/20
      Vol:
    E101-D No:5
      Page(s):
    1445-1448

    Radar is expected in advanced driver-assistance systems for environmentally robust measurements. In this paper, we propose a novel radar signal segmentation method by using a complex-valued fully convolutional network (CvFCN) that comprises complex-valued layers, real-valued layers, and a bidirectional conversion layer between them. We also propose an efficient automatic annotation system for dataset generation. We apply the CvFCN to two-dimensional (2D) complex-valued radar signal maps (r-maps) that comprise angle and distance axes. An r-maps is a 2D complex-valued matrix that is generated from raw radar signals by 2D Fourier transformation. We annotate the r-maps automatically using LiDAR measurements. In our experiment, we semantically segment r-map signals into pedestrian and background regions, achieving accuracy of 99.7% for the background and 96.2% for pedestrians.

  • Robust MIMO Radar Waveform Design to Improve the Worst-Case Detection Performance of STAP

    Hongyan WANG  Quan CHENG  Bingnan PEI  

     
    PAPER-Fundamental Theories for Communications

      Pubricized:
    2017/11/20
      Vol:
    E101-B No:5
      Page(s):
    1175-1182

    The issue of robust multi-input multi-output (MIMO) radar waveform design is investigated in the presence of imperfect clutter prior knowledge to improve the worst-case detection performance of space-time adaptive processing (STAP). Robust design is needed because waveform design is often sensitive to uncertainties in the initial parameter estimates. Following the min-max approach, a robust waveform covariance matrix (WCM) design is formulated in this work with the criterion of maximization of the worst-case output signal-interference-noise-ratio (SINR) under the constraint of the initial parameter estimation errors to ease this sensitivity systematically and thus improve the robustness of the detection performance to the uncertainties in the initial parameter estimates. To tackle the resultant complicated and nonlinear robust waveform optimization issue, a new diagonal loading (DL) based iterative approach is developed, in which the inner and outer optimization problems can be relaxed to convex problems by using DL method, and hence both of them can be solved very effectively. As compared to the non-robust method and uncorrelated waveforms, numerical simulations show that the proposed method can improve the robustness of the detection performance of STAP.

  • Semantically Readable Distributed Representation Learning and Its Expandability Using a Word Semantic Vector Dictionary

    Ikuo KESHI  Yu SUZUKI  Koichiro YOSHINO  Satoshi NAKAMURA  

     
    PAPER

      Pubricized:
    2018/01/18
      Vol:
    E101-D No:4
      Page(s):
    1066-1078

    The problem with distributed representations generated by neural networks is that the meaning of the features is difficult to understand. We propose a new method that gives a specific meaning to each node of a hidden layer by introducing a manually created word semantic vector dictionary into the initial weights and by using paragraph vector models. We conducted experiments to test the hypotheses using a single domain benchmark for Japanese Twitter sentiment analysis and then evaluated the expandability of the method using a diverse and large-scale benchmark. Moreover, we tested the domain-independence of the method using a Wikipedia corpus. Our experimental results demonstrated that the learned vector is better than the performance of the existing paragraph vector in the evaluation of the Twitter sentiment analysis task using the single domain benchmark. Also, we determined the readability of document embeddings, which means distributed representations of documents, in a user test. The definition of readability in this paper is that people can understand the meaning of large weighted features of distributed representations. A total of 52.4% of the top five weighted hidden nodes were related to tweets where one of the paragraph vector models learned the document embeddings. For the expandability evaluation of the method, we improved the dictionary based on the results of the hypothesis test and examined the relationship of the readability of learned word vectors and the task accuracy of Twitter sentiment analysis using the diverse and large-scale benchmark. We also conducted a word similarity task using the Wikipedia corpus to test the domain-independence of the method. We found the expandability results of the method are better than or comparable to the performance of the paragraph vector. Also, the objective and subjective evaluation support each hidden node maintaining a specific meaning. Thus, the proposed method succeeded in improving readability.

  • A Survey of Thai Knowledge Extraction for the Semantic Web Research and Tools Open Access

    Ponrudee NETISOPAKUL  Gerhard WOHLGENANNT  

     
    SURVEY PAPER

      Pubricized:
    2018/01/18
      Vol:
    E101-D No:4
      Page(s):
    986-1002

    As the manual creation of domain models and also of linked data is very costly, the extraction of knowledge from structured and unstructured data has been one of the central research areas in the Semantic Web field in the last two decades. Here, we look specifically at the extraction of formalized knowledge from natural language text, which is the most abundant source of human knowledge available. There are many tools on hand for information and knowledge extraction for English natural language, for written Thai language the situation is different. The goal of this work is to assess the state-of-the-art of research on formal knowledge extraction specifically from Thai language text, and then give suggestions and practical research ideas on how to improve the state-of-the-art. To address the goal, first we distinguish nine knowledge extraction for the Semantic Web tasks defined in literature on knowledge extraction from English text, for example taxonomy extraction, relation extraction, or named entity recognition. For each of the nine tasks, we analyze the publications and tools available for Thai text in the form of a comprehensive literature survey. Additionally to our assessment, we measure the self-assessment by the Thai research community with the help of a questionnaire-based survey on each of the tasks. Furthermore, the structure and size of the Thai community is analyzed using complex literature database queries. Combining all the collected information we finally identify research gaps in knowledge extraction from Thai language. An extensive list of practical research ideas is presented, focusing on concrete suggestions for every knowledge extraction task - which can be implemented and evaluated with reasonable effort. Besides the task-specific hints for improvements of the state-of-the-art, we also include general recommendations on how to raise the efficiency of the respective research community.

  • Collaborative Ontology Development Approach for Multidisciplinary Knowledge: A Scenario-Based Knowledge Construction System in Life Cycle Assessment

    Akkharawoot TAKHOM  Sasiporn USANAVASIN  Thepchai SUPNITHI  Mitsuru IKEDA  

     
    PAPER-Knowledge Representation

      Pubricized:
    2018/01/19
      Vol:
    E101-D No:4
      Page(s):
    892-900

    Creating an ontology from multidisciplinary knowledge is a challenge because it needs a number of various domain experts to collaborate in knowledge construction and verify the semantic meanings of the cross-domain concepts. Confusions and misinterpretations of concepts during knowledge creation are usually caused by having different perspectives and different business goals from different domain experts. In this paper, we propose a community-driven ontology-based application management (CD-OAM) framework that provides a collaborative environment with supporting features to enable collaborative knowledge creation. It can also reduce confusions and misinterpretations among domain stakeholders during knowledge construction process. We selected one of the multidisciplinary domains, which is Life Cycle Assessment (LCA) for our scenario-based knowledge construction. Constructing the LCA knowledge requires many concepts from various fields including environment protection, economic development, social development, etc. The output of this collaborative knowledge construction is called MLCA (multidisciplinary LCA) ontology. Based on our scenario-based experiment, it shows that CD-OAM framework can support the collaborative activities for MLCA knowledge construction and also reduce confusions and misinterpretations of cross-domain concepts that usually presents in general approach.

101-120hit(686hit)