<?xml version="1.0" encoding="Windows-31J"?>
<ArticleSet xmlns="http://www.openarchives.org/OAI/2.0/">
  <Article>
    <Journal>
      <PublisherName>INDERSCIENCE ENTERPRISES</PublisherName>
      <JournalTitle>Acta Medica Okayama</JournalTitle>
      <Issn>2044-4893</Issn>
      <Volume>8</Volume>
      <Issue>1</Issue>
      <PubDate PubStatus="ppublish">
        <Year>2018</Year>
        <Month/>
      </PubDate>
    </Journal>
    <ArticleTitle>A holding access-point assignment algorithm for IEEE802.11 wireless local-area networks</ArticleTitle>
    <FirstPage LZero="delete">50</FirstPage>
    <LastPage>58</LastPage>
    <Language>EN</Language>
    <AuthorList>
      <Author>
        <FirstName EmptyYN="N">Shigeto</FirstName>
        <LastName>Tajima</LastName>
        <Affiliation/>
      </Author>
      <Author>
        <FirstName EmptyYN="N">Nobuo</FirstName>
        <LastName>Funabiki</LastName>
        <Affiliation/>
      </Author>
      <Author>
        <FirstName EmptyYN="N">Teruo</FirstName>
        <LastName>Higashino</LastName>
        <Affiliation/>
      </Author>
    </AuthorList>
    <PublicationType/>
    <ArticleIdList>
      <ArticleId IdType="doi"/>
    </ArticleIdList>
    <Abstract> Nowadays, various types of access-points (APs) and hosts such as dedicated APs, laptop personal computers (PCs), and mobile terminals have been used in IEEE802.11 wireless local-area networks (WLANs). As a result, the optimal assignment of holding APs with different types into the network field, depending on the host type distribution, has become another important task to design high-performance WLANs. In this paper, we first define this holding access-point assignment problem as a combinatorial optimisation problem and propose its two-phase heuristic algorithm. Then, since plural partially overlapping channels are available in IEEE802.11 WLANs, we present the channel assignment extension to the APs such that the communication time of the APs is minimised, and the model to estimate the communication time increase by interferences. The effectiveness of our proposal is verified through simulations in six instances using the WIMNET simulator.</Abstract>
    <CoiStatement>No potential conflict of interest relevant to this article was reported.</CoiStatement>
    <ObjectList>
      <Object Type="keyword">
        <Param Name="value">wireless local-area network</Param>
      </Object>
      <Object Type="keyword">
        <Param Name="value">WLAN</Param>
      </Object>
      <Object Type="keyword">
        <Param Name="value">holding access-point</Param>
      </Object>
      <Object Type="keyword">
        <Param Name="value">partially overlapping channel</Param>
      </Object>
      <Object Type="keyword">
        <Param Name="value">assignment algorithm</Param>
      </Object>
      <Object Type="keyword">
        <Param Name="value">combinatorial optimisation problem</Param>
      </Object>
    </ObjectList>
    <ReferenceList/>
  </Article>
  <Article>
    <Journal>
      <PublisherName>INDERSCIENCE ENTERPRISES</PublisherName>
      <JournalTitle>Acta Medica Okayama</JournalTitle>
      <Issn>2044-4893</Issn>
      <Volume>7</Volume>
      <Issue>3</Issue>
      <PubDate PubStatus="ppublish">
        <Year>2017</Year>
        <Month/>
      </PubDate>
    </Journal>
    <ArticleTitle>A design-aware test code approach for code writing problem in Java programming learning assistant system</ArticleTitle>
    <FirstPage LZero="delete">145</FirstPage>
    <LastPage>154</LastPage>
    <Language>EN</Language>
    <AuthorList>
      <Author>
        <FirstName EmptyYN="N"/>
        <LastName>Khin Khin Zaw</LastName>
        <Affiliation>Graduate School of Natural Science and Technology, Okayama University</Affiliation>
      </Author>
      <Author>
        <FirstName EmptyYN="N">Nobuo</FirstName>
        <LastName>Funabiki</LastName>
        <Affiliation>Graduate School of Natural Science and Technology, Okayama University</Affiliation>
      </Author>
    </AuthorList>
    <PublicationType/>
    <ArticleIdList>
      <ArticleId IdType="doi"/>
    </ArticleIdList>
    <Abstract> To advance Java programming educations, we have developed the web-based Java programming learning assistant system (JPLAS) that provides the code writing problem. This problem asks a student to write a source code for a given assignment, where the correctness is verified by running the test code on JUnit. In this paper, we propose a design-aware test code approach for the code writing problem. The design-aware test code tests any important method in the model source code that has the advisable design for the assignment. Thus, by writing a code that can pass it, a student is expected to implement the code with the proper classes/methods in the model code. In evaluations of the proposal, all the students could complete highly qualitative codes for five graph algorithms using the design-aware test codes, where the code quality metrics were measured by metrics plugin for Eclipse.</Abstract>
    <CoiStatement>No potential conflict of interest relevant to this article was reported.</CoiStatement>
    <ObjectList>
      <Object Type="keyword">
        <Param Name="value">Java programming learning assistant system</Param>
      </Object>
      <Object Type="keyword">
        <Param Name="value">JPLAS</Param>
      </Object>
      <Object Type="keyword">
        <Param Name="value">design-aware test code</Param>
      </Object>
      <Object Type="keyword">
        <Param Name="value">JUnit</Param>
      </Object>
      <Object Type="keyword">
        <Param Name="value">metric plugin</Param>
      </Object>
      <Object Type="keyword">
        <Param Name="value">breadth-first-search</Param>
      </Object>
      <Object Type="keyword">
        <Param Name="value">BFS</Param>
      </Object>
    </ObjectList>
    <ReferenceList/>
  </Article>
</ArticleSet>
