bluuebunny/crossref_metadata_2025_split huggingface dataset:
SpecRefiner: Assistance for stepwise refinement of software development in the upstream process
Authors: Kudo Ryuji , Nakasuka Shin‐ichi , Hori Koichi 
Published: April 2003

AbstractA system supporting the refining of an analytical model in the upstream processes of software development has been developed. Compared with the absence of such support, human oversights during system analyses are reduced. Although applications and implementation support tools for downstream processes of software development have been vigorously conducted in the past, since there are many stages in studying the applications of support tools for upstream processes, especially structured analyses and the like, expression of concept models has received almost no support for the analytical processes themselves. SpecRefiner has been constructed as a means of supporting stepwise refinement in structured analyses. SpecRefiner is the system which supports a requested analysis process by storing statements of what is to be performed, in specifications written in natural language and the DFDs (data flow diagrams) accompanying them in a case base, and by detecting similar specifications and DFDs in the stepwise refinement process when performing a newly requested analytical task. The method treats the software development process as consisting of three steps, namely, finding, revising, and refining, and supports each step. It finds a past analyzed case, revises this case, and refines it. In addition, it supports asynchronous collaborative design by retaining design rationale or a design history. Fischer [3, 4] and Nakakoji [10] state that the construction of an application for an area or domain is facilitated by a specialist who constructs a domain‐oriented design support environment by using this tool. In the study by Mizoguchi [9], ontology is organized in area‐independent levels, and design using building blocks corresponding to the ontology is made possible by means of interviews between the SE and the end user based on the ontology. In the investigation of Seta and colleagues [13], the user himself describes the task configuration. The proposed scheme lies between the domain‐oriented design environment of Fischer and the domain‐independent ontology approach of Mizoguchi. The proposed scheme can reduce the cognitive overload of the end user or SE in translating the domain‐oriented work and the implementation‐level work by seamlessly connecting the domain‐oriented knowledge and the domain‐independent ontology or symbolic‐level knowledge. As a result, the proposed scheme can use analytical time effectively by reducing human errors during analyses. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(6): 32–43, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10019
Estimation of rotation and slant angles of a textured plane using spectral moments
Authors: Tsuji Toshio , Yoshida Yasuo 
Published: April 2003

AbstractThis paper proposes a method for estimating rotation and slant angles with slant direction of a textured plane using spectral moments. When a textured plane rotates and slants, the 2D power spectrum also rotates and expands toward the slant direction. Thus, the spectral moments also change corresponding to the rotation and expansion. The rotation angle, slant angle, and slant direction of a textured plane can be derived from the comparison between the second‐order spectral moments of a standard image and those of a test image. We show the validity of the method in simulations using the synthesized images and in experiments using real images taken with a CCD camera. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(6): 21–31, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10314
A semantic analysis system based on HPSG with the mental‐image directed semantic theory built in
Authors: Ryu Koichi , Hironaka Daisuke , Amano Mikio , Yokota Masao 
Published: April 2003

AbstractThe authors have developed a syntactic and semantic HPSG analysis system based on Mental‐Image Directed Semantic Theory (MIDST). While conventional HPSG and JPSG parsers are based on situation semantics, MIDST provides a representation with deeper meaning for natural language by referring to the mental images evoked. Semantic analysis systems based on MIDST, however, have to date employed dependency grammar, requiring word meaning to be represented in two parts. HPSG describes such meanings uniformly, allowing for analysis systems with wide coverage. The proposed system has been developed using common analysis engine for both English and Japanese, requiring only the change of resources such as lexical entries and grammar rules. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(6): 12–20, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10321
Universal prediction and universal coding
Authors: Suzuki Joe 
Published: April 2003

AbstractAlthough prediction schemes called “universal” are now abundant, very little attention has been devoted to the definition of universal prediction. This paper addresses, for α‐nary (α ≥ 2) sequences, the criteria of successful universal prediction and the prediction schemes that achieve the goals. We propose the following criteria: for any probability measures in a given measure class, the error probability of prediction (in the problem of predicting a value for the next outcome) and the conditional probability of the next outcome given the past sequence (in the problem of predicting a probability distribution for the next outcome, i.e., the probability assignment problem) should converge to the optimal values in probability (weakly universal) and almost surely (strongly universal). We present a small review of various results on universal prediction, and give several results relating the developed criteria to each other and to various prediction submeasures. Furthermore, we explore the connection between universal prediction and universal coding. The proposed criteria are applied to any measure class as well as stationary ergodic measures. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(6): 1–11, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10357
Navigation of a mobile robot formulated in terms of discrete optimization problems
Authors: Igarashi Harukazu , Ioi Kiyoshi 
Published: April 2003

AbstractThe problem of navigation of an autonomous mobile robot has a great variety of solutions, depending on the premise conditions regarding the properties of the robot, the surrounding environment, and the user specifications. In support of a navigation scheme that can cope flexibly with this variety, this paper proposes a method that formulates the problem in terms of discrete optimization problems. In the proposed method, the problem of robot position/posture estimation from map and sensor data and the problem of deciding the action at each instant are formulated as separate discrete optimization problems. In the former, our approach is an approximation of the Markov localization algorithm. The proposed method is then applied to a navigation problem in a known environment with fixed obstacles, and the effectiveness and feasibility of the method are verified by simulation results. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(6): 59–68, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10439
Recurrent neural network with short‐term memory and fast structural learning method
Authors: Kikuchi Shinichi , Nakanishi Masakazu 
Published: April 2003

AbstractThe Elman network is used frequently in learning time series. However, it has several problems: (1) a comparatively long learning time, (2) learning is not necessarily successful, (3) lack of discussions on a generalization ability, and (4) the necessity of deciding unit numbers and the like by trial and error. In this study, a network providing short‐term memory for the Elman network in order to facilitate learning of time series is proposed. In addition, an algorithm considering both structural learning and fast learning, which have been regarded as having a trade‐off relationship in the past, is proposed as a learning algorithm. It has been verified by tests that the learning time, convergence rate, and generalization ability are improved by the proposed method. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(6): 69–79, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.1206
Learning fuzzy control rules by α‐constrained Simplex method
Authors: Takahama Tetsuyuki , Sakai Setsuko 
Published: April 2003

AbstractThe learning of fuzzy control rules can be defined as a constrained nonlinear optimization problem so that its objective function is indifferentiable. As an optimization method of this problem, “α‐constrained Powell method,” which optimizes a given initial rule, is proposed. However, the difficulty with the learning by the α‐constrained Powell method is that it is necessary to have initial rules of certain accuracy formulated by human experts, thus requiring a very large number of control experiments. In this study, we propose an α‐constrained Simplex method, in which the α‐level comparison is added to the Simplex method, which is a nonlinear optimization method. The α‐constrained Simplex method is an optimization method for constrained problems using the α‐level comparison that takes account of the constraint satisfaction instead of ordinary order relation used in the Simplex method, which is a direct search method based only on values of the objective function. In order to demonstrate the effectiveness of this method, we carried out computer simulation of the fuzzy control rules for a pole‐cart system. We have shown that this method makes it possible to achieve a fast learning of highly accurate rules from mechanically created rules based on a relatively small number of experiments, without relying on any existing rules. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(6): 80–90, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.1207
A neural network with multiple large‐scale subnetworks and its application to recognition of handwritten characters
Authors: Hagihara Yoshihiro , Kobatake Hidefumi 
Published: April 2003

AbstractWe propose a large‐scale network system and learning method that prevent increases in the amount of calculation, increases in the necessary memory capacity, and decreases of accuracy. It is shown that the system is effective for a task with a huge number of categories. The proposed system consists of multiple large‐scale neural networks (LSNNs) and each LSNN consists of multiple small‐scale neural networks (SSNNs). Each SSNN supports only part of the categories in recognition and learning, and each LSNN supports categories that overlap with other LSNNs. The combination of categories that each SSNN in each LSNN supports is different from that of the other LSNNs, because it is determined randomly. The output values of the LSNNs for each category are averaged and the maximum gives the final decision. Since the learning of the SSNNs and LSNNs is performed independently, realization of the proposed system is easy. The effectiveness of this system is shown in the recognition of handwritten characters using a multilayer perceptron and backpropagation. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(6): 91–99, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.1208
Image size conversion on DCT‐compressed data
Authors: Miyamoto Yoshihiro , Akaiwa Yoshihiko 
Published: April 2003

AbstractThe authors propose a method for converting the image size of DCT‐compressed coded data. This method converts the image size using the DCT coefficients as is, without decoding the compressed data (inverse DCT processing). Compared to conventional methods in which scaling is performed in the image space, image quality is equal or superior, and the calculation burden is reduced to one‐half to one‐third. In addition, the order of the DCT for the original compressed data is preserved, and the image can be decoded using common inverse DCT processing even after size conversion. This is a feature not found in conventional scaling methods using DCT coefficients. The authors' method is viable for resolution scalable coding in instances in which data compressed using JPEG or other fixed order DCTs must be compatible and be processed at high speeds. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(6): 100–109, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.1209
Maintaining electronic commerce systems: the legal issues
Authors: Taylor M. 
Published: April 2003

AbstractElectronic commerce over the Internet is growing at an increasing pace worldwide. Maintenance of electronic commerce systems is thus becoming an increasingly important IT activity. In this paper the legal issues concerned with the maintenance of electronic commerce systems are examined based on detailed case studies in two U.K.‐based organizations, a marketing organization and a retail organization. Even seemingly trivial maintenance activities of electronic commerce systems such as changing Web site text can have legal implications due to the variety of advertising, consumer protection, data protection and other legislation and regulation that potentially applies to electronic commerce activities. In addition, the potentially global nature of electronic commerce activities implies that maintenance activities of electronic commerce systems need to comply not only with the legislation and regulation within the country of the seller, but also potentially with the legislation and regulation within the country of the consumer as well. Copyright © 2003 John Wiley & Sons, Ltd.
The software maintenance project effort estimation model based on function points
Authors: Ahn Yunsik , Suh Jungseok , Kim Seungryeol , Kim Hyunsoo 
Published: April 2003

AbstractIn this study, software maintenance size is discussed and the software maintenance project effort estimation model (SMPEEM) is proposed. The SMPEEM uses function points to calculate the volume of the maintenance function. Ten value adjustment factors (VAF) are considered and grouped into three categories of maintenance characteristics, that is the engineer's skill (people domain), its technical characteristics (product domain) and the maintenance environment (process domain). Finally, we suggest an exponential function model which can show the relationships among the maintenance efforts, maintenance environment factors, and function points of the software maintenance project. Regression analysis of some small maintenance projects demonstrates the significance of the SMPEEM model. Copyright © 2003 John Wiley & Sons, Ltd.
Software visualization in software maintenance, reverse engineering, and re‐engineering: a research survey
Authors: Koschke Rainer 
Published: April 2003

AbstractSoftware visualization is concerned with the static visualization as well as the animation of software artifacts, such as source code, executable programs, and the data they manipulate, and their attributes, such as size, complexity, or dependencies. Software visualization techniques are widely used in the areas of software maintenance, reverse engineering, and re‐engineering, where typically large amounts of complex data need to be understood and a high degree of interaction between software engineers and automatic analyses is required. This paper reports the results of a survey on the perspectives of 82 researchers in software maintenance, reverse engineering, and re‐engineering on software visualization. It describes to which degree the researchers are involved in software visualization themselves, what is visualized and how, whether animation is frequently used, whether the researchers believe animation is useful at all, which automatic graph layouts are used if at all, whether the layout algorithms have deficiencies, and—last but not least—where the medium‐term and long‐term research in software visualization should be directed. The results of this survey help to ascertain the current role of software visualization in software engineering from the perspective of researchers in these domains and give hints on future research avenues. Copyright © 2003 John Wiley & Sons, Ltd.
Towards a computerized Arabic Braille environment
Authors: Al‐Salman AbdulMalik S. , Al‐Khalifa Hend S. 
Published: April 2003

AbstractPeople with visual disabilities face many difficulties and barriers when using computers and the Internet. Such people need the help of IT developers to create adaptive technologies that facilitate their interaction with the computers and Internet.This paper presents the design and implementation of an Arabic Braille environment (ABE). The paper also exposes to the reader the ABE's functionality and unique features. The ABE is designed to facilitate Arabic‐speaking visually impaired people interaction with computers, as well as helping sighted users to communicate with the visually impaired. Copyright © 2003 John Wiley & Sons, Ltd.
More comments on ‘A cohesion measure for object‐oriented classes’ by Heung‐Seok Chae, Yong‐Rae Kwon and Doo‐Hwan Bae (Softw. Pract. Exper. 2000; 30:1405–1431)
Authors: Xu Baowen , Zhou Yuming 
Published: April 2003

AbstractChae et al. believe that the improved CBMC measures class cohesion from the viewpoint of the usage criteria of instance variables and that it cannot allow meaningful interpretations about classes. This paper exemplifies that it characterizes the interaction patterns better than the original one does and that it could also be used as a guideline for quality evaluation so as to enable the restructuring of poorly designed classes. Copyright © 2003 John Wiley & Sons, Ltd.
Response to ‘More comments on: A cohesion measure for object‐oriented classes’
Authors: Chae Heung‐Seok , Kwon Yong‐Rae , Bae Doo‐Hwan 
Published: April 2003

AbstractThe authors insist that monotonicity is a necessary property of a good cohesion metric and the violation of the monotonicity property limits the application of CBMC. They also state that the augmented CBMC can also be used as a guideline for quality evaluation and restructuring of poorly designed classes. This paper raises the question about the necessity of monotonicity by analyzing the reason that causes CBMC to violate the monotonicity property. In addition, we give a detailed description of the restructuring procedure based on CBMC. Copyright © 2003 John Wiley & Sons, Ltd.
Filter objects for Java
Authors: Joshi Rushikesh K. , Mascarenhas Maureen , Murarka Yogesh 
Published: April 2003

AbstractFiltering is an emerging abstraction in object‐oriented systems. Filtering can be characterized by an ability to filter messages in transit and perform intermediate actions. Filters can be used for carrying out intermediate tasks such as encryption, load balancing, caching, security checks and add‐on computations. A few filtering approaches have been proposed earlier and some commercial implementations with specialized filtering capabilities are available. This paper discusses a model for transparent and dynamically pluggable first class filter objects for object‐oriented systems based on the Java programming language. The filter object model is based on an interclass filter relationship. The model is realized through extensions to the Java programming language. Filter objects can be injected into message paths during execution time and they are transparent to both clients and servers. The properties of filter objects enable them to be employed as a mechanism for evolution promoting reuse of existing code. A method of evolution through filter objects is discussed. A translator for Java filters (TJF) has been designed and implemented. TJF translates an extended Java program involving filter constructs into an equivalent Java code. The translation scheme is presented and the performance of the translated code is analyzed. A brief survey of existing approaches related to filtering in object‐oriented systems has also been presented. Copyright © 2003 John Wiley & Sons, Ltd.
Developing an object‐oriented framework for content‐based image retrieval
Authors: Cheung Kent K. T. , Ip Horace H. S. 
Published: April 2003

AbstractContent‐based image retrieval (CBIR) is a process of retrieving images from an image database by exploiting the content of the images (typically the querying of an image). CBIR avoids many problems associated with traditional ways of retrieving images by keywords. Thus, a growing interest in the area of CBIR has been established in recent years. In this paper, a novel object‐oriented framework (CBIRFrame) is built for CBIR applications development. We discuss the motivations for CBIRFrame before discussing its design in detail. Two applications of CBIRFrame are also briefly discussed to show the effectiveness of applying CBIRFrame to real applications. Finally, we outline the possible uses of the design of CBIRFrame for other types of domains, such as content‐based retrieval of video clips. Copyright © 2003 John Wiley & Sons, Ltd.
Mooshak: a Web‐based multi‐site programming contest system
Authors: Leal José Paulo , Silva Fernando 
Published: April 2003

AbstractThis paper presents a new Web‐based system, Mooshak, to handle programming contests. The system acts as a full contest manager as well as an automatic judge for programming contests. Mooshak innovates in a number of aspects: it has a scalable architecture that can be used from small single server contests to complex multi‐site contests with simultaneous public online contests and redundancy; it has a robust data management system favoring simple procedures for storing, replicating, backing up data and failure recovery using persistent objects; it has automatic judging capabilities to assist human judges in the evaluation of programs; it has built‐in safety measures to prevent users from interfering with the normal progress of contests. Mooshak is an open system implemented on the Linux operating system using the Apache HTTP server and the Tcl scripting language.This paper starts by describing the main features of the system and its architecture with reference to the automated judging, data management based on the replication of persistent objects over a network. Finally, we describe our experience using this system for managing two official programming contests. Copyright © 2003 John Wiley & Sons, Ltd.
Unidimensional life
Authors: Fivaz Roland 
Published: April 2003

AbstractFrom carbon‐based organic molecules to body plans and thought, most living beings are built on linear structures that can be adequately described by unidimensional variables. Among known physical phenomena, electrical polarization is identified as a possible mechanism that assembles ordinary atoms into linear structures. Morphodynamics then is the general theory that predicts the statistical properties of systems made of such structures. Within this theory, unidimensionality appears as the common foundation of many enigmatic features observed for evolution in life sciences, including symbolic representation at genetic or mental levels, even consciousness and boundless innovation. Copyright © 2002 John Wiley & Sons, Ltd.