bluuebunny/crossref_metadata_2025 huggingface dataset:
Improving decision quality: Making the case for adopting next‐generation site characterization practices
Authors: Crumbling Deana M. , Griffith Jennifer , Powell Dan M.
Published: April 2003

Better site characterization is critical for cheaper, faster, and more effective cleanup. This fact is especially
true as cleanup decisions increasingly include site redevelopment and reuse considerations. However, established
attitudes about what constitutes “data quality” create many barriers to exciting new tools capable of
achieving better characterization, slowing their dissemination into the mainstream. Traditional approaches to
environmental “data quality” rest on simplifying assumptions that are rarely acknowledged by the
environmental community. Data quality assessments focus on the quality of the analysis, while seldom asking what
impact matrix heterogeneity has had on analytical results. Assessments of data quality typically assume that
chemical contaminants are distributed nearly homogeneously throughout environmental matrices and that
contaminant‐matrix interactions are well behaved during analysis. Yet, these assumptions seldom hold true for
real‐world matrices and contaminants at scales relevant to accurate risk assessment and efficient remedial
design. For the site cleanup industry to continue technical advancement, over‐simplified paradigms must give
way to next‐generation models that are built on current scientific understanding. If reuse programs such as
Brownfields are to thrive, the scientific defensibility of individual projects must be maintained at the same time
as characterization and cleanup costs are lowered. The U.S. Environmental Protection Agency (EPA) offers
the Triad Approach as an alternative paradigm to foster highly defensible, yet extremely cost‐effective reuse
decisions. © 2003 Wiley Periodicals, Inc.
Facilitating brownfields transactions using Triad and environmental insurance
Authors: Woll Bryn , Mack James , Ellerbusch Fred , Vetter James R.
Published: April 2003

A significant hindrance to reuse of brownfields properties is the risk associated with redevelopment,specifically the uncertainty associated with environmental cleanup. This article explores an approach tomanaging environmental risk through a combination of risk quantification, environmental insurance, and theTriad Approach to site sampling and data interpretation. The expected costs of environmental liabilities areestimated using the Marsh Peer ReviewSM risk quantification process that employs statistical techniques andhighly experienced technical staff. The outputs of the process indicate premiums and attachment points forinsurance products, but they also point to “critical uncertainties” that drive the insurancepremiums. Insurance premiums are often linked to site delineation deficiencies, such as the magnitude ofimpacted soil or the size of a groundwater plume. The Triad Approach is an integrated site characterizationprocess developed by the Environmental Protection Agency that combines systematic planning, dynamic or adaptivefield decision making and field analytical methods (FAMs). The real‐time data produced by FAMsallow for in‐field resolution of uncertainty about sample location, which in turn provides morerepresentative delineation of contaminant distribution. The trade‐off of using slightly less accuratebut substantially lower cost FAMs is an increase in sampling frequency or density, thereby reducing the risk ofincomplete detection or delineation while yielding a “data set” that is more powerful than fewerindividual data points analyzed through traditional methods. Employing the Triad Approach to analyze the“critical uncertainties” identified in the Peer Review Process can impact insurance premiums andallow for better terms of coverage. The combination of using the Triad Approach and environmental insuranceproducts can lead to more predictable and profitable Brownfield transactions. © 2003 Wiley Peridicals,Inc.
A study of treatment options to remediate explosives and perchlorate in soils and groundwater at Camp Edwards, Massachusetts
Authors: Weeks Katherine R. , Veenstra Scott C. , Hill David L. , Gregson Benjamin P.
Published: April 2003

The Army National Guard initiated an Innovative Technology Evaluation (ITE) Program in March 2000
to study potential remedial technologies for the cleanup of explosives‐contaminated soil and groundwater
at the Camp Edwards site on the Massachusetts Military Reservation. The soil technologies chosen for the ITE
program were: soil washing, chemical oxidation, chemical reduction, thermal desorption/destruction
(LTTD), bioslurry, composting, and solid phase bioremediation. The technologies were evaluated based
on their ability to treat both washed and untreated soil. A major factor considered was the ability to degrade
explosives, such as RDX, found in particulate form in the soils. The heterogeneous nature of explosives in soils
dictates that the preferred technology must be able to treat explosives in all forms, including the particulate
form. Groundwater remediation technologies considered include: in situ cometabolic reduction, two forms of in
situ chemical oxidation, Fenton‐like oxidation and potassium permanganate. This article presents the
results of each of the remedial technologies evaluated and discusses which technologies met the established ITE
performance goals. © 2003 Wiley Periodicals, Inc.
The use of zero‐valent iron injection to remediate groundwater: Results of a pilot test at the Marshall Space Flight Center
Authors: McElroy Bill , Keith Amy , Glasgow Jason , Dasappa Srini
Published: April 2003

In situ treatability studies are being conducted to evaluate various in situ technologies to manage
groundwater contamination at the NASA Marshall Space Flight Center in Huntsville, Alabama. The focus of these
studies is to evaluate remediation options for contaminated (mostly aerobic) groundwater occurring
within the basal portion of a clayey residuum called the rubble zone. The tension‐saturated media and
unsaturated media lying above the rubble zone are also being treated where they make up a significant component
of the contaminant mass. An in situ chemical reduction field pilot test was implemented (following
bench‐scale tests) during July and August 2000. The test involved the injection of zero‐valent
iron powder in slurry form, using the FeroxSM process patented by ARS Technologies, Inc. The pilot
test focused on trichloroethene (TCE)‐contaminated groundwater within the rubble zone. Maximum
pre‐injection concentrations of about 72,800 micrograms per liter (μg/l) were observed
and no secondary sources are believed to exist beneath the area. The potential presence of unexploded ordnance
forced an implementation strategy where source area injections were completed, as feasible, followed by
overlapping injections in a down gradient alignment to create a permeable reactive zone for groundwater
migration. Eight post‐injection rounds of groundwater performance monitoring were completed. The results
are encouraging, in terms of predicted responses and decreasing trends in contaminant levels. © 2003 Wiley
Periodicals, Inc.
Dynamic Analysis of Tendon Driven Robotic Mechanisms
Authors: Lee Jyh‐Jone , Lee Yueh‐Hua
Published: April 2003

In this paper, a systematic methodology for the dynamic analysis of tendon‐driven robotic mechanisms is presented. The approach utilizes the recursive Newton‐Euler equations to compute the kinematic and dynamic equations of all links that locate on the transmission line of a tendon‐driven robotic mechanism. The inertias of the intermediate links in the mechanism are taken into account. It is shown that the dynamic equations can be established in a recursive manner from the end‐effector links toward the proximal links and can be solved at the proximal end without the need of solving the simultaneous system equations. The joint reaction forces and the tension in each segment of tendon can be also obtained. The methodology can be applied to both endless and open‐ended tendon drives. © 2003 Wiley Periodicals, Inc.
Pose Optimization of Serial Manipulators Using Knowledge of Their Velocity‐Degenerate (Singular) Configurations
Authors: Nokleby Scott B. , Podhorodeski Ron P.
Published: April 2003

This work investigates the exploitation of velocity‐degenerate configurations to optimize the pose of either nonredundant or redundant serial manipulators to sustain desired wrenches. An algorithm is developed that determines a desirable start point for the optimization of a serial manipulator's pose. The start‐point algorithm (SPA) uses analytical expressions of the velocity‐degenerate (singular) configurations of a serial manipulator to determine a pose that would be best suitable to sustain a desired wrench. Results for an example redundant serial manipulator are presented. The example results show that by using the SPA with the optimization routine, the resulting poses obtained require less effort from the actuators when compared to the poses obtained without using the SPA. It is shown that when no constraint is imposed on the position of the end‐effector, the SPA excels at providing a better solution with less iterations than running the optimization without the SPA. © 2003 Wiley Periodicals, Inc.
Geometric Motion Control for a Kinematically Redundant Robotic Chain: Application to a Holonomic Mobile Manipulator
Authors: Altafini Claudio
Published: April 2003

For kinematically redundant robotic manipulators, the extra degrees of freedom available allows freedom in the generation of the trajectories of the end‐effector. In this paper, for this scope, we use techniques for motion control of rigid bodies on Riemannian manifolds (and Lie groups in particular) to design workspace control algorithms for the end‐effector of the robotic chain and then to pull them back to joint space, all respecting the different geometric structures of the two underlying model spaces. The trajectory planner makes use of geometric splines. Examples of the different kinds of curves that are obtained via the De Casteljau algorithm in correspondence of different metric structures in SE(3) are reported. The feedback module, instead, consists of a Lyapunov based PD controller defined from a suitable notion of error distance on the Lie group. The motivating application of our work is a holonomic mobile manipulator for which simulation results are described in detail. © 2003 Wiley Periodicals, Inc.
Dynamic Feedback Control of XYnR̄ Planar Robots withnRotational Passive Joints
Authors: Iannitti Stefano , De Luca Alessandro
Published: April 2003

We consider the problem of trajectory planning and control for an XYnR̄ Planar robot with the first two joints (rotational or prismatic) actuated andnrotational passive joints, moving both in the presence and the absence of gravity. Under the assumption that each passive link is attached at the center of percussion of the previous passive link, dynamics of the system can be expressed through the behavior ofnspecial points of the plane. These points are called link‐related acceleration points (LRAP) since their instantaneous acceleration is oriented as the axis of the related passive links. Moreover, LRAP dynamics present a backward recursive form which can be exploited to recursively design a dynamic feedback that completely linearizes the system equations. We use this approach to solve trajectory planning and tracking problems and report simulation results obtained for an RR2R̄ robot having the first two rotational joints actuated. © 2003 Wiley Periodicals, Inc.
TCRA: a time‐based channel reservation scheme for handover requests in LEO satellite systems
Authors: Boukhatem L. , Beylot A. L. , Gaïti D. , Pujolle G.
Published: April 2003

In this paper, we propose a time‐based channel reservation algorithm (TCRA) suitable for handover and call admission control procedures in future mobile satellite systems. These systems are characterized by a high rate of handover attempts which can degrade significantly their performance. Therefore, we propose TCRA, a scheme which guarantees a null handover failure probability by using a channel reservation strategy in the cells to be crossed by the user. The performance of TCRA has been compared to the guaranteed handover (GH) scheme. The TCRA reservation method has the advantage of a better channel utilization by locking the resources only for their expected time of use. A mathematical model has been developed for both schemes, and its results have been validated through simulations. Copyright © 2003 John Wiley & Sons, Ltd.
On ACK filtering on a slow reverse channel
Authors: Barakat Chadi , Altman Eitan
Published: April 2003

Acknowledgement (ACK) filtering has been proposed as a technique to alleviate the congestion at the input of a slow channel located on the reverse path of a TCP connection. Old ACKs waiting at the input of the slow channel are erased when new ACKs are to be queued. In the literature the case of one‐ACK per connection at a time has been studied. In this paper we show that this is too aggressive for short transfers where ACKs arrive in bursts due to the slow start phase, and where the TCP source needs to receive the maximum number of ACKs to increase fast its window. We study first static filtering where a certain ACK queue length is allowed. We show analytically how this length needs to be chosen. We present then some algorithms that adapt the filtering of ACKs as a function of the slow channel utilization rather than the ACK queue length. These algorithms provide a good compromise between reducing the ACK queueing delay and passing a large number of ACKs that guarantee a fast window increase. Copyright © 2003 John Wiley & Sons, Ltd.
Capacity provisioning and failure recovery for Low Earth Orbit satellite constellation
Authors: Sun Jun , Modiano Eytan
Published: April 2003

This paper considers the link capacity requirement for an LEO satellite constellation. We model the constellation as an N×N mesh‐torus topology under a uniform all‐to‐all traffic model. Both primary capacity and spare capacity for recovering from a link or node failure are examined. In both cases, we use a method of ‘cuts on a graph’ to obtain lower bounds on capacity requirements and subsequently find algorithms for routing and failure recovery that meet these bounds. Finally, we quantify the benefits of path‐based restoration over that of link‐based restoration; specifically, we find that the spare capacity requirement for a link‐based restoration scheme is nearly N times that for a path‐based scheme. Copyright © 2003 John Wiley & Sons, Ltd.
BPSK and QPSK non‐linear satellite communication system performance in the presence of cochannel interference
Authors: Stefanovic Mihajlo C. , Djordjevic Goran T.
Published: April 2003

Taking the uplink and downlink cochannel interference and noise into account, the analytical expressions are derived for determining the bit error probability in detecting a binary phase‐shift‐keying (BPSK) and a quaternary phase‐shift‐keying (QPSK) Gray coded signal, transmitted over a satellite system exhibiting amplitude modulation‐to‐amplitude modulation (AM/AM) conversion effects and amplitude modulation‐to‐phase modulation (AM/PM) conversion effects. On the basis on the derived theoretic formulae, using real‐life system parameters, numerical results are obtained and presented. We point out the explicit comparisons of satellite communication system performance obtained when a satellite transponder amplifier is modelled by a hard‐limiter and those obtained when both AM/AM and AM/PM non‐linearities of the satellite transponder amplifier are taken into consideration. Copyright © 2003 John Wiley & Sons, Ltd.
Development of an information retrieval system suitable for large‐scale scholarly databases
Authors: Oyama Keizo , Kageura Kyo , Kando Noriko , Kimura Masaru , Maruyama Katsumi , Yoshioka Masaharu , Takahashi Kazumichi
Published: April 2003

The demand for full‐fledged information retrieval services via the World Wide Web has grown as the Internet has evolved. However, existing information retrieval systems for the World Wide Web have various limitations in the search functions, and in structure and scale of databases. The information retrieval system described in this paper has been operating for a real information retrieval service, providing high‐level search functions via a command line and a Web interface for large‐scale scholarly databases in text form with complex structures. In this paper, the authors first describe an outline of and the design of the information retrieval functions, in particular the characteristic functions including set operations, thesaurus searches, hierarchical structure searches, and unified searches of multiple databases. Next, they describe the implementation technologies of the system focusing on the features of the search engine, the session control method, the handling of large‐scale databases, and the structure of servers and processes. Then, the authors evaluate the current system based on the real operation, and finally discuss the future issues and the related researches. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(6): 44–58, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10015
SpecRefiner: Assistance for stepwise refinement of software development in the upstream process
Authors: Kudo Ryuji , Nakasuka Shin‐ichi , Hori Koichi
Published: April 2003

A 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

This 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

The 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

Although 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

The 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

The 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

The 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

We 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

The 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

Electronic 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

In 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

Software 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

People 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

Chae 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

The 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

Filtering 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

Content‐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

This 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

From 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.
Diversity management in organizational change: towards a systemic framework
Authors: Cao Guangming , Clarke Steve , Lehaney Brian
Published: April 2003

Change is now a key concern of most business organizations, but the management of change (MOC) appears weak, with research suggesting that, at least in part, the methodologies used are responsible for this weakness. By outlining an alternative systemic MOC framework for action, and pointing to how this might be applied, this paper recommends an approach to MOC which seeks to address some of these current methodological shortcomings. A critical examination and classification of organizational change are conducted, leading to a categorization of approaches to change, and allowing critical assessment of the benefits and limitations of current approaches. Systems perspectives and their relevance to MOC are discussed, and by combining MOC and systems perspectives a systemic MOC framework is developed. This study suggests that MOC is characterized by diversity and interaction, for which systemic perspectives are more appropriate than the approaches currently applied. The systemic framework developed is thus seen to be a useful way of helping understand and manage organizational change more effectively. Copyright © 2003 John Wiley & Sons, Ltd.
EUV‐Lithographie für zukünftige IC‐Chips. EUV‐Lithography for Future IC‐Technology
Authors: Holtmannspötter Dirk , Bachmann Gerd
Published: April 2003

Der überwältigende Erfolg der Halbleiterindustrie basierte in der Vergangenheit auf der Realisierung immer kleinerer Strukturen auf IC‐Chips in immer kürzeren Zeiträumen. Damit konnte die Rechengeschwindigkeit der Prozessoren und das Speichervolumen der Speicherbauelemente stetig gesteigert werden. Diese Reduktion der minimalen Strukturgröße hat die optische Lithographie vor allem durch den Übergang auf kürzere Belichtungswellenlängen gemeistert. Die zur Zeit in der Entwicklungs‐ und Erprobungsphase befindlichen Lithographietechnologien, basierend auf 193 nm‐ oder auch 157 nm‐Laserquellen, werden jedoch Strukturgrößen um 50 nm nicht mehr erreichen. Ein grundsätzlicher Technologiewechsel zeichnet sich somit ab.

Die zur Zeit favorisierte Produktionsgrundlage für Strukturgrößen von 50 nm und darunter bildet die EUV Lithographie, basierend auf einer optischen Technologie mit 13,4 nm Belichtungswellenlänge. Diese erhebliche Reduzierung der Wellenlänge bedingt aber auch eine radikale Änderung der bisher benutzten Methodik.
Freeze Condensing Vacuum Systems Offer Advantages. Vakuum‐Tiefkühlkondensation bietet Vorteile
Authors: Lines J.R.
Published: April 2003

A freeze condenser ahead of a ejector system can improve performance of a process in a number of ways. The condenser will trap unwanted vapors so they don't entire an ejector system. That eliminates the need for alterate motive fluids, such as ethylene glycol or monochlorobenzene. The process is able to stay onstream longer because ejector plugging due to product buildup is avoided. Additionally, by removing the vapors in a freeze condenser the ejector system becomes less expensive and requires less utility consumption. Furthermore, the production of waste water and vent streams is less, so the environmental impact from a particular process is improved.

Freeze condensation technology is not well known and may be often overlooked. It should be considered when evaluating vacuum system design criteria. Successful freeze condenser installations are in bisphenol‐A, phenol, fatty alcohols, polyester resin, 1,3‐propanediol, 1,4‐butanediol and edible oil applications.

Be certain to specify the freeze condenser and ejector system as single unit. Proper freeze condenser performance comes from matching the ejector system to the condenser. An ejector should be designed to ensure it does not control freeze condenser operating pressure, the ejector system simply supports the condenser. The best vacuum is obtained when a freeze condenser is unrestrained by the ejector system. By specifying the freeze condenser and ejector system as a single unit, the likelihood of discontinunity between the two is eliminated.

Conversion factors for converting between U.S. engineering and S.I. units of measure
Prüfung von Vakuumpumpen zur Verwendung in explosionsgefährdeten Bereichen nach der Richtlinie 94/9/EG (ATEX 95).
Authors: Härtel Hartmut , Redecker Tammo
Published: April 2003

Im folgenden Beitrag werden Grundlagen der EG‐Baumusterprüfung an Vakuumpumpen beschrieben. Es werden die wesentlichen Bestandteile der Prüfung genannt und erläutert. Ausgehend von den bisherigen Erfahrungen bei der Prüfung von Vakuumpumpen werden dem Hersteller von explosionsgeschützten Vakuumpumpen Hinweise zur Vorbereitung der EG‐Baumusterprüfung und zur Gestaltung des Prüfmusters geben. Es werden Hinweise zur zweckmäßigen Gestaltung von Vakuumanlagen genannt.
Grenzflächen‐optimierte Mo/Si Multischichten als Reflektoren für den EUV Spektralbereich. Interface‐optimized Mo/Si multilayers as reflectors for the EUV spectral range
Authors: Braun Stefan , Foltyn Thomas , Mai Hermann , Moss Matthew , Leson Andreas
Published: April 2003

Für die EUV‐Lithographie, die als aussichtsreichstes Verfahren für die Herstellung von Halbleiterstrukturen unterhalb von 50 nm gilt, kommen reflektierende Multischichten als optische Elemente zum Einsatz. Diese müssen eine möglichst hohe Reflektivität aufweisen, da diese die Effizienz des Verfahrens und damit den Durchsatz einer zukünftigen Chip‐Fabrik maßgeblich bestimmt.

In dieser Arbeit werden Untersuchungen zur Grenzflächenbeschaffenheit von Mo/Si Multischichten, die mittels Magnetron Sputter Deposition hergestellt wurden, vorgestellt. Ausgehend vom zweikomponentigen Mo/Si‐System, bei dem vorrangig der Einfluss der Abscheidebedingungen auf die Grenzflächenrauhigkeit betrachtet wird, gelang es, durch den Einbau von dünnsten Barriereschichten auch die Grenzflächeninterdiffusion zu reduzieren.

Im reinen Mo/Si System ist vor allem ein niedriger Ar‐Sputtergasdruck wichtig, um glatte Grenzflächen zu erzeugen. Die Verringerung der Interdiffusion der Mo‐ und Si‐Atome kann durch den Einbau von C‐ und B4C‐Barriereschichten geeigneter Dicke erreicht werden.

Als Ergebnis der Untersuchungen wurden Mo/Si Multischichten mit momentan den weltweit höchsten EUV‐Reflektivitäten präpariert: REUV= 70.1 % (λ = 13.3 nm, α = 1.5°), REUV= 71.4 % (λ = 12.5 nm, α = 22.5°).