bluuebunny/crossref_metadata_2025_split huggingface dataset:
Robust multiple‐fault detection filter
Authors: Chen Robert H. , Speyer Jason L. 
Published: October 2002

AbstractA new robust multiple‐fault detection and identification algorithm is determined. Different from other algorithms which explicitly force the geometric structure by using eigenstructure assignment or geometric theory, this algorithm is derived from solving an optimization problem. The output error is divided into several subspaces. For each subspace, the transmission from one fault, denoted the associated target fault, is maximized while the transmission from other faults, denoted the associated nuisance fault, is minimized. Therefore, each projected residual of the robust multiple‐fault detection filter is affected primarily by one fault and minimally by other faults. The transmission from process and sensor noises is also minimized so that the filter is robust with respect to these disturbances. It is shown that, in the limit where the weighting on each associated nuisance fault transmission goes to infinity, the filter recovers the geometric structure of the restricted diagonal detection filter of which the Beard–Jones detection filter and unknown input observer are special cases. Filter designs can be obtained for both time‐invariant and time‐varying systems. Copyright © 2002 John Wiley & Sons, Ltd.
Fault estimation—a standard problem approach
Authors: Stoustrup J. , H. Niemann H. 
Published: October 2002

AbstractThis paper presents a range of optimization based approaches to fault diagnosis. A variety of fault diagnosis problems are reformulated in the so‐called standard problem set‐up introduced in the literature on robust control. Once the standard problem formulations are given, the fault diagnosis problems can be solved by standard optimization techniques. The proposed methods include (1) fault diagnosis (fault estimation, (FE)) for systems with model uncertainties; FE for systems with parametric faults, and FE for a class of nonlinear systems. Copyright © 2002 John Wiley & Sons, Ltd.
Control of minimally constrained cobots
Authors: Hodgson Antony J. , Emrich Richard 
Published: October 2002

AbstractCobots are devices which use computer‐oriented passive constraints to guide an end‐effector driven by a human. This synergistic union of human skill and robotic precision is desired in fields such as surgical robotics (our application area of interest) where the surgeon would prefer not to hand over control of a procedure to an autonomous robot. Typical cobot designs intrinsically allow at most one degree of freedom of motion, but there are some tasks (such as using a bone saw to cut a plane in knee replacement surgery) where allowing two or more degrees of freedom is desireable. While it is possible to use selective constraint alignment to increase the apparent degrees of freedom of a cobot, this requires more actuators than are strictly necessary for the task, as well as a force sensor to detect the user's intent. We, therefore, introduce here the concept of minimally constrained cobots for multiple degree of freedom (DOF) tasks such as planar cutting, and outline a general framework for controlling such devices. We illustrate our control algorithms by using a planar cart example and discuss how they might be applied to potential designs for three‐dimensional parallel cobots intended for surgical applications. © 2002 Wiley Periodicals, Inc.
Design and evaluation of the asynchronous voice meeting system AVM
Authors: Nishimoto Takuya , Yuki Hidehiro , Kawahara Takehiko , Araki Masahiro , Niimi Yasuhisa 
Published: October 2002

AbstractA voice communication system for asynchronous meetings held in non‐real time will attract a broad range of users because it is convenient and easy to use with mobile devices. To realize such a system, however, it will be necessary to make possible the natural input of the progressive process of speech at the same time as facilitating the quotation of audio information and outlining of others' references.This study reports the design and evaluation of a new interface for effective asynchronous voice meetings, the AVM (Asynchronous Voice Meeting System), a client—server‐type meeting system that uses overlapping speech. Speeches were, in particular, displayed as text information on the client side for the effective visualization of comments made during these voice meetings. The proposed system AVM was compared with an electronic bulletin board system by discussing the same topic. Using the AVM, the total number of speech utterances decreased, and the total amount of letters dropped to 48% compared to the conventional electronic bulletin board system. Subjective evaluations also rated the AVM highly, indicating the usefulness of the proposed system. © 2002 Wiley Periodicals, Inc. Syst Comp Jpn, 33(11): 61–69, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.1164
Adaptive dose finding for phase I clinical trials of drugs used for chemotherapy of cancer
Authors: Potter Douglas M. 
Published: October 2002

AbstractPhase I clinical trials of cancer chemotherapy drugs are intended to determine the maximum tolerable dose (MTD). Thestandard method employed is a rule‐based dose‐escalation scheme in which escalation depends on the number of patients at a dose level that have dose‐limiting toxicity (DLT). The MTD is thus defined in terms of the rules and a series of dose levels selected for sampling. For some trials it is desirable to have a more precise definition of the MTD, and to determine the MTD more accurately than possible with the rule‐based schemes. Continuous reassessment methods (CRMs) define the MTD to be the dose at which a fixed fraction of patients experience DLT, and thus appear suited to these trials. It is shown, however, that these methods can have failure modes that in fact make them unattractive. An alternative data‐driven dose‐finding method is described that combines the robustness of the rule‐based methods and with features of CRMs. The method has two stages. In the first stage, doses are escalated by a factor of 1.5. In the second stage, which begins at the first instance of DLT, a two‐parameter logistic dose–response model estimates the MTD from the DLT experience of all patients. The model is initialized by setting the dose (d10) at which 10 per cent of patients would experience DLT to half the dose at which the first DLT was observed, and the dose (d90) at which 90 per cent would experience DLT to ten times d10. Weights are assigned such that the information at d10 and d90 is equivalent to that of one patient at each of the two doses. Cohorts of three patients are treated in both stages, and the dose for a new cohort in the second stage is the estimated MTD. The only prior information required to specify the design completely is the dose which will be given to the first cohort. Two stopping rules are investigated; among the requirements for these are that at least three (or four) DLTs be observed and at least nine patients be treated in the second stage. Simulations show that a coefficient of variation of approximately 0.4 on a target DLT probability of 0.3 is obtained over a wide variation in dose–response characteristics of the study drug. The performance of the new method is compared to that of rule‐based methods. Copyright © 2002 John Wiley & Sons, Ltd.
Early selection in a randomized phase II clinical trial
Authors: Steinberg Seth M. , Venzon David J. 
Published: October 2002

AbstractA randomized phase II clinical trial design can be employed when one wishes to be able to select one of several similar therapies or variants of a therapy for inclusion in a subsequent, definitive, phase III trial. It is not necessary in this type of trial to formally identify a superior arm using the usual parameters and stringent criteria employed for hypothesis testing. Simon, Wittes and Ellenberg have described methods and sample sizes for selecting the superior arm from among k possible arms. In this paper, we describe an approach based on statistical selection theory which allows one to potentially make a decision to end accrual to a randomized phase II trial at an interim point of the trial, and to select one of two arms as being worthy of further evaluation in a subsequent study. This method requires that an adequate gap in the number of responses between the two arms be observed at the interim point in order to limit the probability that the selected arm is actually inferior by more than an indifference amount. Published in 2002 by John Wiley & Sons, Ltd.
Alliance capability, stock market response, and long‐term alliance success: the role of the alliance function
Authors: Kale Prashant , Dyer Jeffrey H. , Singh Harbir 
Published: October 2002

AbstractThis paper addresses two key questions: (1) what factors influence firms' ability to build alliance capability and enjoy greater alliance success, where firm‐level alliance success is measured in two ways: (a) abnormal stock market gains following alliance announcements and (b) managerial assessments of long term alliance performance; and (2) are the two alternate ways of assessing alliance success correlated? We find that firms with greater alliance experience and, more importantly, those that create a dedicated alliance function (with the intent of strategically coordinating alliance activity and capturing/disseminating alliance‐related knowledge) realize greater success with alliances. More specifically, firms with a dedicated alliance function achieve greater abnormal stock market gains (average of 1.35%) and report that 63 percent of alliances are successful whereas firms without an alliance function achieve much lower stock market gains (average of 0.18%) and only a 50 percent long‐term success rate. We also find a positive correlation between stock market‐based measures of alliance success and alliance success measured through managerial assessments. In addition to providing insights into the development of alliance capability among firms, this paper is one of the first to provide empirical support for the efficient markets argument by demonstrating that the initial stock market response to a key event positively correlates to the long‐term performance and value of the event. Copyright © 2002 John Wiley & Sons, Ltd.
Do formal contracts and relational governance function as substitutes or complements?
Authors: Poppo Laura , Zenger Todd 
Published: October 2002

AbstractRelational exchange arrangements supported by trust are commonly viewed as substitutes for complex contracts in interorganizational exchanges. Many argue that formal contracts actually undermine trust and thereby encourage the opportunistic behavior they are designed to discourage. In this paper, we develop and test an alternative perspective: that formal contracts and relational governance function as complements. Using data from a sample of information service exchanges, we find empirical support for this proposition of complementarity. Managers appear to couple their increasingly customized contracts with high levels of relational governance (and vice versa). Moreover, this interdependence underlies their ability to generate improvements in exchange performance. Our results concerning the determinants of these governance choices show their distinct origins, which further augments their complementarity in practice. Copyright © 2002 John Wiley & Sons, Ltd.
Strategic alliances as social capital: a multidimensional view
Authors: Koka Balaji R. , Prescott John E. 
Published: October 2002

AbstractDefining social capital in terms of the information benefits available to a firm due to its strategic alliances we present a theory of social capital that conceptualizes it as a multidimensional construct. We draw from the literature to argue that social capital yields three distinctly different kinds of information benefits in the form of information volume, information diversity, and information richness. This extends current theoretical and empirical research by specifying and empirically demonstrating three interrelated yet distinct dimensions of social capital. Firms vary in their levels of social capital not just on their structural position in an alliance network but also in the dynamics that underlie alliance formation and maintenance. More importantly, the different dimensions of social capital theoretically provide differential benefits. We establish the construct validity of our proposed three‐dimensional conceptualization of social capital using longitudinal data on the population of strategic alliances formed during the period 1980–94 by firms in the global steel industry. In addition, we establish predictive validity by demonstrating that the information dimensions have differential effects on firm performance, using firm nationality as a contingency. Copyright © 2002 John Wiley & Sons, Ltd.
Predicting project delivery rates using the Naive–Bayes classifier
Authors: Stewart B. 
Published: October 2002

AbstractThe importance of accurate estimation of software development effort is well recognized in software engineering. In recent years, machine learning approaches have been studied as possible alternatives to more traditional software cost estimation methods. The objective of this paper is to investigate the utility of the machine learning algorithm known as the Naive–Bayes classifier for estimating software project effort. We present empirical experiments with the Benchmark 6 data set from the International Software Benchmarking Standards Group to estimate project delivery rates and compare the performance of the Naive–Bayes approach to two other machine learning methods—model trees and neural networks. A project delivery rate is defined as the number of effort hours per function point. The approach described is general and can be used to analyse not only software development data but also data on software maintenance and other types of software engineering. The paper demonstrates that the Naive–Bayes classifier has a potential to be used as an alternative machine learning tool for software development effort estimation. Copyright © 2002 John Wiley & Sons, Ltd.
Rapid simulator development for multicast protocol analysis
Authors: Simon Robert , Rabinovich Paul 
Published: October 2002

AbstractWhen evaluating new protocols and algorithms it is often desirable to be able to rapidly build a specialized simulator from scratch. The advantage of this approach is that software designers can avoid the often‐steep learning curve associated with using existing simulators, and that specialized simulators can have significant computational advantages over general‐purpose programs. The drawback is that simulators can be complex to develop and debug. This paper describes our experiences developing SESAME, a Java‐based simulator designed to analyze multicast protocol performance. By using an appropriate set of design patterns we were able to rapidly develop a reusable and easy‐to‐implement framework for multicast algorithm and protocol analysis. We developed several useful approaches for rapid simulation development, including a multicast visualization tool and techniques for simulating concurrent processing within a computer network that substantially simplified code development and maintenance. Owing to performance concerns, we also ran an extensive series of performance tests of different priority queue implementations. Our design approach and the lessons that we learned in developing SESAME can be applied to rapid simulation development in general. Further, our performance results suggest that by using commercial off‐the‐shelf Java development environments it is possible to obtain sufficient performance for many time‐sensitive applications such as discrete event simulation. Copyright © 2001 John Wiley & Sons, Ltd.
A taxonomy and survey of grid resource management systems for distributed computing
Authors: Krauter Klaus , Buyya Rajkumar , Maheswaran Muthucumaru 
Published: October 2002

AbstractThe resource management system is the central component of distributed network computing systems. There have been many projects focused on network computing that have designed and implemented resource management systems with a variety of architectures and services. In this paper, an abstract model and a comprehensive taxonomy for describing resource management architectures is developed. The taxonomy is used to identify approaches followed in the implementation of existing resource management systems for very large‐scale network computing systems known as Grids. The taxonomy and the survey results are used to identify architectural approaches and issues that have not been fully explored in the research. Copyright © 2001 John Wiley & Sons, Ltd.
Application and programming experience with the Ara mobile agent system
Authors: Peine Holger 
Published: October 2002

AbstractWe describe a mobile agent application for distributed searching of the global Usenet network, implemented on top of the Ara mobile agent system. After short overviews of Ara and the Usenet, the application is presented in detail, beginning with some critical thoughts on mobile agent applications in general. The function and performance of the search application is then described, demonstrating the advantage of using mobile agents over an equivalent stationary implementation of the same application under certain conditions, and also discussing the limits of such conditions. This is followed by descriptions of the language to express the search queries and of the search algorithms employed. The application presentation closes with a critical discussion. The paper then concludes with some observations about mobile agent programming in general. Copyright © 2002 John Wiley & Sons, Ltd.
A TACOMA retrospective
Authors: Johansen Dag , Lauvset Kåre J. , van Renesse Robbert , Schneider Fred B. , Sudmann Nils P. , Jacobsen Kjetil 
Published: October 2002

AbstractFor seven years, the TACOMA project has investigated the design and implementation of software support for mobile agents. A series of prototypes has been developed, with experiences in distributed applications driving the effort. This paper describes the evolution of these TACOMA prototypes, what primitives each supports, and how the primitives are used in building distributed applications. Copyright © 2002 John Wiley & Sons, Ltd.
Enterprise frameworks: issues and research directions
Authors: Mili Hafedh , Fayad Mohamed , Brugali Davide , Hamu David , Dori Dov 
Published: October 2002

AbstractEnterprise frameworks are a special class of application frameworks. They are distinguished from other application frameworks in terms of scale and focus. In terms of focus, application frameworks typically cover one particular aspect of an application, either a domain‐dependent aspect (e.g., billing in a web‐based customer‐to‐business ordering system), or a computational infrastructure aspect such as distribution, man‐machine interface, or persistence, etc. Generally, an application framework alone delivers no useful end‐user function. With infrastructure frameworks, we still have to plug in domain functionalities, while with domain frameworks, we need to set‐up the infrastructure. In contrast, enterprise frameworks embody a reference architecture for an entire application, covering both the infrastructure aspects of the application, and much of the domain‐specific functionality. Instantiating an enterprise framework is nothing short of application engineering, where the architecture and many of the components are reusable. While creativity and continual improvement may be the major ingredients for building a good application framework, anything related to enterprise frameworks, be it building, documenting, or instantiating them, is complex and requires careful design and planning. In this paper, we identify the issues involved in building, using, and maintaining enterprise frameworks, both from research and practical perspective. Copyright © 2002 John Wiley & Sons, Ltd.
Specifying a role‐based guide for learning to work with an enterprise framework
Authors: Hasselbring Wilhelm , van den Houdt Ralph 
Published: October 2002

AbstractLearning to work with enterprise frameworks requires considerable effort, because of the inherent complexity of all the knowledge that is needed. However, different roles in project teams need to learn different knowledge components according to the different tasks to be performed. A role‐based guide that has been developed for new developers in the California projects at the software house International Business Systems, Inc. (IBS) Consist is presented. The California projects develop financial applications based on the IBM SanFrancisco enterprise framework. The requirement for this guide originates in the need to guide (new) project members in learning the required skills for being able to work productively after focused training for the California projects.The starting point for this guide is the IBS development process. The individual tasks during the different phases in the process are specified by means of the Unified Modeling Language (UML) use case diagrams. An important property is that the guide is role‐based to allow new project members to focus on their roles in the project, while learning to work with the framework. For each role, a UML activity diagram guides one to find the right paths for learning the required skills (which we call knowledge components) for the particular project role. The knowledge components are related to the tasks in the development process and to the roles. For all roles, at least some basic knowledge of the UML is required. Therefore, it is reasonable to specify this learning guide by means of the UML. This paper illustrates the use of the UML for specifying such a guide in a specific setting, namely the California projects of IBS Consist. Copyright © 2002 John Wiley & Sons, Ltd.
Dose‐dependent effects of Δ9‐tetrahydrocannabinol on rates of local cerebral glucose utilization in rat
Authors: Freedland Cory S. , Whitlow Christopher T. , Miller Mack D. , Porrino Linda J. 
Published: October 2002

AbstractRecent reports have demonstrated that Δ9‐tetrahydrocannabinol (Δ9‐THC) stimulates locomotor activity at low doses (<2.5 mg/kg), while higher doses (>2.5 mg/kg) produce decreases in spontaneous activity. Using quantitative 2‐[14C]deoxyglucose (2‐DG) autoradiography, we systematically studied the effects of acute Δ9‐THC on rates of local cerebral glucose utilization. The first series of experiments was designed to determine if Δ9‐THC‐mediated changes in cerebral metabolism followed a clear dose–response relationship. Adult male Sprague‐Dawley rats were treated with either vehicle or Δ9‐THC (0.25–2.5 mg/kg) and the 2‐DG procedure was initiated 15 min following exposure. Administration of 2.5 mg/kg Δ9‐THC produced significant decreases in cerebral metabolism in most brain regions studied. In contrast, administration of 0.25 mg/kg Δ9‐THC produced no significant alterations in any brain region studied, while 1.0 mg/kg of Δ9‐THC produced a restricted pattern of metabolic decreases. Significant decreases in metabolism following 1.0 mg/kg were concentrated in structures subserving limbic and sensory functions. In a second series of experiments, the effects of pretreatment with the cannabinoid receptor antagonist SR141716A (1.0 mg/kg) on Δ9‐THC‐induced changes in functional activity were measured. Pretreatment with SR141716A attenuated the majority of functional changes produced by Δ9‐THC, suggesting that these effects are primarily mediated by central cannabinoid receptors. Moreover, these findings indicate that the effects of Δ9‐THC on cerebral metabolism are dose‐dependent and that there are regional differences in the metabolic response to acute cannabinoid exposure. Synapse 45:134–142, 2002. © 2002 Wiley‐Liss, Inc.