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

Keyword Search Result

[Keyword] engine(173hit)

1-20hit(173hit)

  • The Influence of Future Perspective on Job Satisfaction and Turnover Intention of Software Engineers

    Ikuto YAMAGATA  Masateru TSUNODA  Keitaro NAKASAI  

     
    LETTER

      Pubricized:
    2023/12/08
      Vol:
    E107-D No:3
      Page(s):
    268-272

    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.

  • Recent Progress in Optical Network Design and Control towards Human-Centered Smart Society Open Access

    Takashi MIYAMURA  Akira MISAWA  

     
    INVITED PAPER

      Pubricized:
    2023/09/19
      Vol:
    E107-B No:1
      Page(s):
    2-15

    In this paper, we investigate the evolution of an optical network architecture and discuss the future direction of research on optical network design and control. We review existing research on optical network design and control and present some open challenges. One of the important open challenges lies in multilayer resource optimization including IT and optical network resources. We propose an adaptive joint optimization method of IT resources and optical spectrum under time-varying traffic demand in optical networks while avoiding an increase in operation cost. We formulate the problem as mixed integer linear programming and then quantitatively evaluate the trade-off relationship between the optimality of reconfiguration and operation cost. We demonstrate that we can achieve sufficient network performance through the adaptive joint optimization while suppressing an increase in operation cost.

  • Fish School Behaviour Classification for Optimal Feeding Using Dense Optical Flow

    Kazuki FUKAE  Tetsuo IMAI  Kenichi ARAI  Toru KOBAYASHI  

     
    PAPER

      Pubricized:
    2023/06/20
      Vol:
    E106-D No:9
      Page(s):
    1472-1479

    With the growing global demand for seafood, sustainable aquaculture is attracting more attention than conventional natural fishing, which causes overfishing and damage to the marine environment. However, a major problem facing the aquaculture industry is the cost of feeding, which accounts for about 60% of a fishing expenditure. Excessive feeding increases costs, and the accumulation of residual feed on the seabed negatively impacts the quality of water environments (e.g., causing red tides). Therefore, the importance of raising fishes efficiently with less food by optimizing the timing and quantity of feeding becomes more evident. Thus, we developed a system to quantitate the amount of fish activity for the optimal feeding time and feed quantity based on the images taken. For quantitation, optical flow that is a method for tracking individual objects was used. However, it is difficult to track individual fish and quantitate their activity in the presence of many fishes. Therefore, all fish in the filmed screen were considered as a single school and the amount of change in an entire screen was used as the amount of the school activity. We divided specifically the entire image into fixed regions and quantitated by vectorizing the amount of change in each region using optical flow. A vector represents the moving distance and direction. We used the numerical data of a histogram as the indicator for the amount of fish activity by dividing them into classes and recording the number of occurrences in each class. We verified the effectiveness of the indicator by quantitating the eating and not eating movements during feeding. We evaluated the performance of the quantified indicators by the support vector classification, which is a form of machine learning. We confirmed that the two activities can be correctly classified.

  • Performance Aware Egress Path Discovery for Content Provider with SRv6 Egress Peer Engineering

    Yasunobu TOYOTA  Wataru MISHIMA  Koichiro KANAYA  Osamu NAKAMURA  

     
    PAPER

      Pubricized:
    2023/02/22
      Vol:
    E106-D No:5
      Page(s):
    927-939

    QoS of applications is essential for content providers, and it is required to improve the end-to-end communication quality from a content provider to users. Generally, a content provider's data center network is connected to multiple ASes and has multiple egress paths to reach the content user's network. However, on the Internet, the communication quality of network paths outside of the provider's administrative domain is a black box, so multiple egress paths cannot be quantitatively compared. In addition, it is impossible to determine a unique egress path within a network domain because the parameters that affect the QoS of the content are different for each network. We propose a “Performance Aware Egress Path Discovery” method to improve QoS for content providers. The proposed method uses two techniques: Egress Peer Engineering with Segment Routing over IPv6 and Passive End-to-End Measurement. The method is superior in that it allows various metrics depending on the type of content and can be used for measurements without affecting existing systems. To evaluate our method, we deployed the Performance Aware Egress Path Discovery System in an existing content provider network and conducted experiments to provide production services. Our findings from the experiment show that, in this network, 15.9% of users can expect a 30Mbps throughput improvement, and 13.7% of users can expect a 10ms RTT improvement.

  • Commit-Based Class-Level Defect Prediction for Python Projects

    Khine Yin MON  Masanari KONDO  Eunjong CHOI  Osamu MIZUNO  

     
    PAPER

      Pubricized:
    2022/11/14
      Vol:
    E106-D No:2
      Page(s):
    157-165

    Defect prediction approaches have been greatly contributing to software quality assurance activities such as code review or unit testing. Just-in-time defect prediction approaches are developed to predict whether a commit is a defect-inducing commit or not. Prior research has shown that commit-level prediction is not enough in terms of effort, and a defective commit may contain both defective and non-defective files. As the defect prediction community is promoting fine-grained granularity prediction approaches, we propose our novel class-level prediction, which is finer-grained than the file-level prediction, based on the files of the commits in this research. We designed our model for Python projects and tested it with ten open-source Python projects. We performed our experiment with two settings: setting with product metrics only and setting with product metrics plus commit information. Our investigation was conducted with three different classifiers and two validation strategies. We found that our model developed by random forest classifier performs the best, and commit information contributes significantly to the product metrics in 10-fold cross-validation. We also created a commit-based file-level prediction for the Python files which do not have the classes. The file-level model also showed a similar condition as the class-level model. However, the results showed a massive deviation in time-series validation for both levels and the challenge of predicting Python classes and files in a realistic scenario.

  • Analysis of Efficiency-Limiting Factors Resulting from Transistor Current Source on Class-F and Inverse Class-F Power Amplifiers Open Access

    Hiroshi YAMAMOTO  Ken KIKUCHI  Valeria VADALÀ  Gianni BOSI  Antonio RAFFO  Giorgio VANNINI  

     
    INVITED PAPER

      Pubricized:
    2022/03/25
      Vol:
    E105-C No:10
      Page(s):
    449-456

    This paper describes the efficiency-limiting factors resulting from transistor current source in the case of class-F and inverse class-F (F-1) operations under saturated region. We investigated the influence of knee voltage and gate-voltage clipping behaviors on drain efficiency as limiting factors for the current source. Numerical analysis using a simplified transistor model was carried out. As a result, we have demonstrated that the limiting factor for class-F-1 operation is the gate-diode conduction rather than knee voltage. On the other hand, class-F PA is restricted by the knee voltage effects. Furthermore, nonlinear measurements carried out on a GaN HEMT validate our analytical results.

  • Industry 4.0 Based Business Process Re-Engineering Framework for Manufacturing Industry Setup Incorporating Evolutionary Multi-Objective Optimization

    Anum TARIQ  Shoab AHMED KHAN  

     
    PAPER-Software Engineering

      Pubricized:
    2022/04/08
      Vol:
    E105-D No:7
      Page(s):
    1283-1295

    Manufacturers are coping with increasing pressures in quality, cost and efficiency as more and more industries are moving from traditional setup to industry 4.0 based digitally transformed setup due to its numerous playbacks. Within the manufacturing domain organizational structures and processes are complex, therefore adopting industry 4.0 and finding an optimized re-engineered business process is difficult without using a systematic methodology. Authors have developed Business Process Re-engineering (BPR) and Business Process Optimization (BPO) methods but no consolidated methodology have been seen in the literature that is based on industry 4.0 and incorporates both the BPR and BPO. We have presented a consolidated and systematic re-engineering and optimization framework for a manufacturing industry setup. The proposed framework performs Evolutionary Multi-Objective Combinatorial Optimization using Multi-Objective Genetic Algorithm (MOGA). An example process from an aircraft manufacturing factory has been optimized and re-engineered with available set of technologies from industry 4.0 based on the criteria of lower cost, reduced processing time and reduced error rate. At the end to validate the proposed framework Business Process Model and Notation (BPMN) is used for simulations and perform comparison between AS-IS and TO-BE processes as it is widely used standard for business process specification. The proposed framework will be used in converting an industry from traditional setup to industry 4.0 resulting in cost reduction, increased performance and quality.

  • Predicting A Growing Stage of Rice Plants Based on The Cropping Records over 25 Years — A Trial of Feature Engineering Incorporating Hidden Regional Characteristics —

    Hiroshi UEHARA  Yasuhiro IUCHI  Yusuke FUKAZAWA  Yoshihiro KANETA  

     
    PAPER

      Pubricized:
    2021/12/29
      Vol:
    E105-D No:5
      Page(s):
    955-963

    This study tries to predict date of ear emergence of rice plants, based on cropping records over 25 years. Predicting ear emergence of rice plants is known to be crucial for practicing good harvesting quality, and has long been dependent upon old farmers who acquire skills of intuitive prediction based on their long term experiences. Facing with aging farmers, data driven approach for the prediction have been pursued. Nevertheless, they are not necessarily sufficient in terms of practical use. One of the issue is to adopt weather forecast as the feature so that the predictive performance is varied by the accuracy of the forecast. The other issue is that the performance is varied by region and the regional characteristics have not been used as the features for the prediction. With this background, we propose a feature engineering to quantify hidden regional characteristics as the feature for the prediction. Further the feature is engineered based only on observational data without any forecast. Applying our proposal to the data on the cropping records resulted in sufficient predictive performance, ±2.69days of RMSE.

  • Balanced, Unbalances, and One-Sided Distributed Teams - An Empirical View on Global Software Engineering Education

    Daniel Moritz MARUTSCHKE  Victor V. KRYSSANOV  Patricia BROCKMANN  

     
    PAPER

      Pubricized:
    2021/09/30
      Vol:
    E105-D No:1
      Page(s):
    2-10

    Global software engineering education faces unique challenges to reflect as close as possible real-world distributed team development in various forms. The complex nature of planning, collaborating, and upholding partnerships present administrative difficulties on top of budgetary constrains. These lead to limited opportunities for students to gain international experiences and for researchers to propagate educational and practical insights. This paper presents an empirical view on three different course structures conducted by the same research and educational team over a four-year time span. The courses were managed in Japan and Germany, facing cultural challenges, time-zone differences, language barriers, heterogeneous and homogeneous team structures, amongst others. Three semesters were carried out before and one during the Covid-19 pandemic. Implications for a recent focus on online education for software engineering education and future directions are discussed. As administrational and institutional differences typically do not guarantee the same number of students on all sides, distributed teams can be 1. balanced, where the number of students on one side is less than double the other, 2. unbalanced, where the number of students on one side is significantly larger than double the other, or 3. one-sided, where one side lacks students altogether. An approach for each of these three course structures is presented and discussed. Empirical analyses and reoccurring patterns in global software engineering education are reported. In the most recent three global software engineering classes, students were surveyed at the beginning and the end of the semester. The questionnaires ask students to rank how impactful they perceive factors related to global software development such as cultural aspects, team structure, language, and interaction. Results of the shift in mean perception are compared and discussed for each of the three team structures.

  • Routing and Capacity Optimization Based on Estimated Latent OD Traffic Demand

    Takumi UCHIDA  Keisuke ISHIBASHI  Kensuke FUKUDA  

     
    PAPER

      Pubricized:
    2021/01/29
      Vol:
    E104-B No:7
      Page(s):
    781-790

    This paper introduces a method to estimate latent traffic from its origin to destination from the link packet loss rate and traffic volume. In addition, we propose a method for the joint optimization of routing and link provisioning based on the estimated latent traffic. Observed traffic could deviate from the original traffic demand and become latent when the traffic passes through congested links because of changes in user behavioral and/or applications as a result of degraded quality of experience (QoE). The latent traffic is actualized by improving congested link capacity. When link provisioning is based on observed traffic, actual traffic might cause new congestion at other links. Thus, network providers need to estimate the origin-destination (OD) original traffic demand for network planning. Although the estimation of original traffic has been well studied, the estimation was only applicable for links. In this paper, we propose a method to estimate latent OD traffic by combining and expanding techniques. The method consists of three steps. The first step is to estimate the actual OD traffic and loss rate from the actual traffic and packet loss rate of the links. The second step is to estimate the latent traffic demand. Finally, using this estimated demand, the link capacity and routing matrix are optimized. We evaluate our method by simulation and confirm that congestion could be avoided by capacity provisioning based on estimated latent traffic, while provisioning based on observed traffic retains the congestion. The combined method can avoid congestion with an increment of 23% compared with capacity provisioning only. We also evaluated our method's adaptability, i.e., the ability to estimate the required parameter for the estimations using fewer given values, but values obtained in the environment.

  • Optimization of Hybrid Energy System Configuration for Marine Diesel Engine Open Access

    Guangmiao ZENG  Rongjie WANG  Ran HAN  

     
    PAPER-Algorithms and Data Structures

      Pubricized:
    2020/11/11
      Vol:
    E104-A No:5
      Page(s):
    786-796

    Because solar energy is intermittent and a ship's power-system load fluctuates and changes abruptly, in this work, the solar radiation parameters were adjusted according to the latitude and longitude of the ship and the change of the sea environment. An objective function was constructed that accounted for the cost and service life simultaneously to optimize the configuration of the marine diesel engine hybrid energy system. Finally, the improved artificial bee colony algorithm was used to optimize and obtain the optimal system configuration. The feasibility of the method was verified by ship navigation tests. This method exhibited better configuration performance optimization than the traditional methods.

  • NetworkAPI: An In-Band Signalling Application-Aware Traffic Engineering Using SRv6 and IP Anycast

    Takuya MIYASAKA  Yuichiro HEI  Takeshi KITAHARA  

     
    PAPER

      Pubricized:
    2021/02/22
      Vol:
    E104-D No:5
      Page(s):
    617-627

    Application-aware Traffic Engineering (TE) plays a crucial role in ensuring quality of services (QoS) for recently emerging applications such as AR, VR, cloud gaming, and connected vehicles. While a deterministic application-aware TE is required for these mission-critical applications, a negotiation procedure between applications and network operators needs to undergo major simplification to fulfill the scalability of the application based on emerging microservices and container-based architecture. In this paper, we propose a NetworkAPI framework which allows an application to indicate a desired TE behavior inside IP packets by leveraging Segment Routing over IPv6 (SRv6). In the NetworkAPI framework, the TE behavior provided by the network operator is expressed as an SRv6 Segment Identifier (SID) in the form of a 128-bit IPv6 address. Because the IPv6 address of an SRv6 SID is distributed using IP anycast, the application can utilize the unchanged SRv6 SID regardless of the application's location, as if the application controls an API on the transport network. We implement a prototype of the NetworkAPI framework on a Linux kernel. On the prototype implementation, a basic packet forwarding performance is evaluated to demonstrate the feasibility of our framework.

  • To Get Lost is to Learn the Way: An Analysis of Multi-Step Social Engineering Attacks on the Web Open Access

    Takashi KOIDE  Daiki CHIBA  Mitsuaki AKIYAMA  Katsunari YOSHIOKA  Tsutomu MATSUMOTO  

     
    PAPER

      Vol:
    E104-A No:1
      Page(s):
    162-181

    Web-based social engineering (SE) attacks manipulate users to perform specific actions, such as downloading malware and exposing personal information. Aiming to effectively lure users, some SE attacks, which we call multi-step SE attacks, constitute a sequence of web pages starting from a landing page and require browser interactions at each web page. Also, different browser interactions executed on a web page often branch to multiple sequences to redirect users to different SE attacks. Although common systems analyze only landing pages or conduct browser interactions limited to a specific attack, little effort has been made to follow such sequences of web pages to collect multi-step SE attacks. We propose STRAYSHEEP, a system to automatically crawl a sequence of web pages and detect diverse multi-step SE attacks. We evaluate the effectiveness of STRAYSHEEP's three modules (landing-page-collection, web-crawling, and SE-detection) in terms of the rate of collected landing pages leading to SE attacks, efficiency of web crawling to reach more SE attacks, and accuracy in detecting the attacks. Our experimental results indicate that STRAYSHEEP can lead to 20% more SE attacks than Alexa top sites and search results of trend words, crawl five times more efficiently than a simple crawling module, and detect SE attacks with 95.5% accuracy. We demonstrate that STRAYSHEEP can collect various SE attacks, not limited to a specific attack. We also clarify attackers' techniques for tricking users and browser interactions, redirecting users to attacks.

  • A Collaborative Framework Supporting Ontology Development Based on Agile and Scrum Model

    Akkharawoot TAKHOM  Sasiporn USANAVASIN  Thepchai SUPNITHI  Prachya BOONKWAN  

     
    PAPER-Software Engineering

      Pubricized:
    2020/09/04
      Vol:
    E103-D No:12
      Page(s):
    2568-2577

    Ontology describes concepts and relations in a specific domain-knowledge that are important for knowledge representation and knowledge sharing. In the past few years, several tools have been introduced for ontology modeling and editing. To design and develop an ontology is one of the challenge tasks and its challenges are quite similar to software development as it requires many collaborative activities from many stakeholders (e.g. domain experts, knowledge engineers, application users, etc.) through the development cycle. Most of the existing tools do not provide collaborative feature to support stakeholders to collaborate work more effectively. In addition, there are lacking of standard process adoption for ontology development task. Thus, in this work, we incorporated ontology development process into Scrum process as used for process standard in software engineering. Based on Scrum, we can perform standard agile development of ontology that can reduce the development cycle as well as it can be responding to any changes better and faster. To support this idea, we proposed a Scrum Ontology Development Framework, which is an online collaborative framework for agile ontology design and development. Each ontology development process based on Scrum model will be supported by different services in our framework, aiming to promote collaborative activities among different roles of stakeholders. In addition to services such as ontology visualized modeling and editing, we also provide three more important features such as 1) concept/relation misunderstanding diagnosis, 2) cross-domain concept detection and 3) concept classification. All these features allow stakeholders to share their understanding and collaboratively discuss to improve quality of domain ontologies through a community consensus.

  • Empirical Evaluation of Mimic Software Project Data Sets for Software Effort Estimation

    Maohua GAN  Zeynep YÜCEL  Akito MONDEN  Kentaro SASAKI  

     
    PAPER-Software Engineering

      Pubricized:
    2020/07/03
      Vol:
    E103-D No:10
      Page(s):
    2094-2103

    To conduct empirical research on industry software development, it is necessary to obtain data of real software projects from industry. However, only few such industry data sets are publicly available; and unfortunately, most of them are very old. In addition, most of today's software companies cannot make their data open, because software development involves many stakeholders, and thus, its data confidentiality must be strongly preserved. To that end, this study proposes a method for artificially generating a “mimic” software project data set, whose characteristics (such as average, standard deviation and correlation coefficients) are very similar to a given confidential data set. Instead of using the original (confidential) data set, researchers are expected to use the mimic data set to produce similar results as the original data set. The proposed method uses the Box-Muller transform for generating normally distributed random numbers; and exponential transformation and number reordering for data mimicry. To evaluate the efficacy of the proposed method, effort estimation is considered as potential application domain for employing mimic data. Estimation models are built from 8 reference data sets and their concerning mimic data. Our experiments confirmed that models built from mimic data sets show similar effort estimation performance as the models built from original data sets, which indicate the capability of the proposed method in generating representative samples.

  • Composition Proposal Generation for Manga Creation Support

    Hironori ITO  Yasuhito ASANO  

     
    PAPER

      Pubricized:
    2019/12/27
      Vol:
    E103-D No:5
      Page(s):
    949-957

    In recent years, cognition and use of manga pervade, and people who use manga for various purposes such as entertainment, study, marketing are increasing more and more. However, when people who do not specialize in it create it for these purposes, they can write plots expressing what they want to convey but the technique of the composition which arranges elements in manga such as characters or balloons corresponding to the plot create obstacles to using its merits for comprehensibility based on high flexibility of its expression. Therefore, we consider that support of this composition technique is necessary for amateurs to use manga while taking advantage of its benefits. We propose a method of generating composition proposal to support manga creation by amateurs. For the method, we also define new manga metadata model which summarize and extend metadata models by earlier studies. It represents the compostion and the plot in manga. We apply a neural machine translation mechanism for learing the relation between the composition and the plot. It considers that the plot annotation is the source of the composition annotation that is the target, and learns from the annotation dataset based on the metadata model. We conducted experiments to evaluate how the composition proposal generated by our method helps amateur manga creation, and demonstrated that it is useful.

  • Signal Selection Methods for Debugging Gate-Level Sequential Circuits

    Yusuke KIMURA  Amir Masoud GHAREHBAGHI  Masahiro FUJITA  

     
    PAPER

      Vol:
    E102-A No:12
      Page(s):
    1770-1780

    This paper introduces methods to modify a buggy sequential gate-level circuit to conform to the specification. In order to preserve the optimization efforts, the modifications should be as small as possible. Assuming that the locations to be modified are given, our proposed method finds an appropriate set of fan-in signals for the patch function of those locations by iteratively calculating the state correspondence between the specification and the buggy circuit and applying a method for debugging combinational circuits. The experiments are conducted on ITC99 benchmark circuits, and it is shown that our proposed method can work when there are at most 30,000 corresponding reachable state pairs between two circuits. Moreover, a heuristic method using the information of data-path FFs is proposed, which can find a correct set of fan-ins for all the benchmark circuits within practical time.

  • Empirical Study on Improvements to Software Engineering Competences Using FLOSS

    Neunghoe KIM  Jongwook JEONG  Mansoo HWANG  

     
    LETTER

      Pubricized:
    2019/09/24
      Vol:
    E102-D No:12
      Page(s):
    2433-2434

    Free/libre open source software (FLOSS) are being rapidly employed in several companies and organizations, because it can be modified and used for free. Hence, the use of FLOSS could contribute to its originally intended benefits and to the competence of its users. In this study, we analyzed the effect of using FLOSS on related competences. We investigated the change in the competences through an empirical study before and after the use of FLOSS among project participants. Consequently, it was confirmed that the competences of the participants improved after utilizing FLOSS.

  • Relationship of Channel and Surface Orientation to Mechanical and Electrical Stresses on N-Type FinFETs

    Wen-Teng CHANG  Shih-Wei LIN  Min-Cheng CHEN  Wen-Kuan YEH  

     
    PAPER

      Vol:
    E102-C No:6
      Page(s):
    429-434

    The electric properties of a field-effect transistor not only depend on gate surface sidewall but also on channel orientation when applying channel stain engineering. The change of the gate surface and channel orientation through the rotated FinFETs provides the capability to compare the orientation dependence of performance and reliability. This study characterized the <100> and <110> channels of FinFETs on the same wafer under tensile and compressive stresses by cutting the wafer into rectangular silicon pieces and evaluated their piezoresistance coefficients. The piezoresistance coefficients of the <100> and <110> silicon under tensile and compressive stresses were first evaluated based on the current setup. Tensile stresses enhance the mobilities of both <100> and <110> channels, whereas compressive stresses degrade them. Electrical characterization revealed that the threshold voltage variation and drive current degradation of the {100} surface were significantly higher than those of {110} for positive bias temperature instability and hot carrier injection with equal gate and drain voltage (VG=VD). By contrast, insignificant difference is noted for the subthreshold slope degradation. These findings imply that a higher ratio of bulk defect trapping is generated by gate voltage on the <100> surface than that on the <110> surface.

  • Low Temperature Formation of Pd2Si with TiN Encapsulating Layer and Its Application to Dopant Segregation Process

    Rengie Mark D. MAILIG  Shun-ichiro OHMI  

     
    PAPER

      Vol:
    E102-C No:6
      Page(s):
    447-452

    We investigated the low temperature formation of Pd2Si on Si(100) with TiN encapsulating layer formed at 500°C/1 min. Furthermore, the dopant segregation process was performed with ion dose of 1x1015 cm-2 for B+. The uniform Pd2Si was successfully formed with low sheet resistance of 10.4 Ω/sq. Meanwhile, the PtSi formed on Si(100) showed rough surface morphology if the silicidation temperature was 500°C. The estimated Schottky barrier height to hole of 0.20 eV (qφBp) was realized for n-Si(100).

1-20hit(173hit)