bluuebunny/crossref_metadata_2025_split huggingface dataset:
Child and Adolescent Mental Health Interface Work with Primary Services: A Survey of NHS Provider Trusts
Authors: Bradley Sally , Kramer Tami , Garralda M. Elena , Bower Peter , Macdonald Wendy , Sibbald Bonnie , Harrington Richard 
Published: October 2003

Background: We document the extent, nature and predictors of interface work between secondary Child and Adolescent Mental Health (CAMHS) and primary services, through structured questionnaires sent to all Trusts with CAMHS in England (returned by 124/150 or 83%).Results: Two‐thirds of CAMHS reported training and education to primary care services, about one‐third a structured consultation service, one‐fifth reported undertaking outpatient clinics in primary care settings and joint casework. One‐third had developed primary mental health worker posts. Multiple regression analysis identified firstly specialist clinics within CAMHS, and secondly CAMHS size, as the strongest predictors of interface work across agencies. Interface work thus grows with more developed, larger CAMHS.
A Triage Clinic in a Child and Adolescent Mental Health Service
Authors: Parkin Andrew , Frake Clay , Davison Ingrid 
Published: October 2003

Aims: To determine whether non‐urgent referrals can be adequately assessed in a triage clinic, to determine the service outcome of these referrals, and whether triage was acceptable to families, referrers and CAMHS clinicians.Method: Families, CAMHS clinicians and GPs were surveyed to ascertain the acceptability of triage. Non‐attendance and outcome of triage were recorded.Results: Ninety‐two cases were included and the DNA rate fell by one‐third.Conclusions: Overall, clinicians and families reported high rates of satisfaction with triage (93.7% and 95.2%) and multidisciplinary working improved.
Product Technology Transfer in the Upstream Supply Chain
Authors: Tatikonda Mohan V. , Stock Gregory N. 
Published: October 2003

This article addresses the transfer of new product technologies from outside the firm for integration into a new product system as part of a product development effort. Product technology transfer is a key activity in the complex process of new product development and is the fundamental link in the technology supply chain. Product technology transfer too often is dealt with in an ad‐hoc fashion. Purposeful management of the product technology transfer process leads to more effective transfers in terms of timeliness, cost, functional performance, and competence building. Better management of product technology transfer gives firms access to a greater variety of new technology options, improves a firm's ability to offer significantly differentiated products, deepens the firm's competitive competencies, and positively influences sustained product development success. The central objective of this article is to gain insight into product technology transfer so that companies can manage this process more successfully and so that researchers can investigate this critical activity further.This article describes the technology supply chain as a unique form of a supply chain that poses a set of managerial challenges and requirements distinguishing it from the more traditional component supply chain. Because a single product technology transfer project is the fundamental piece in the technology supply chain, understanding this piece well is key to leveraging the extended technology supply chain and to improving overall product development performance. This article integrates literatures on new product development, supply chain management, and technology management and builds on organizational theory to present a conceptual model of determinants of product technology transfer success. The core proposition is that product technology transfer effectiveness is greatest when companies carefully match (or “fit”) the type of technology to be transferred (the “technology uncertainty”) with the type of relationship between the technology supplier and recipient (the “interorganizational interaction”).A quite detailed framework characterizing technology uncertainty along the dimensions of technology novelty, complexity, and tacitness is presented to help in assessing the challenges associated with transferring a particular product technology. This article also considers detailed elements characterizing the interorganizational interactions between the technology source and recipient firms. This helps firms consider the appropriate means to facilitate the interfirm process of technology transfer. Overall, this article provides practical insight into characterizing technologies and into improving the product technology transfer process. This article also provides a strong theoretical foundation to aid future research on product technology transfer in the technology supply chain.
A Product and Process Model of the Technology‐Sourcing Decision
Authors: Swan K. Scott , Allred Brent B. 
Published: October 2003

The technology‐sourcing decision traditionally has examined the choice either to innovate internally or to acquire technology from outside sources. The increasing complexity of this decision requires a move beyond the simple “make‐versus‐buy” dichotomy. We seek to test factors that influence the technology decision of subsidiaries for product and process technology across the continuum of options from internal development to outsourcing. We also explore concordance between the research streams of new product development and technology sourcing.Regression models are used to analyze data from 187 subsidiaries that suggest product and process technology development decisions sometimes are associated with similar factors and at other times they diverge. In particular, we find that external product and process technology acquisition decisions are associated negatively with differentiation goals and associated positively with product dynamism. While external product acquisition is associated negatively with a low cost goal and positively with increasing distance between primary marketing and R&D operations, external process technology acquisition is associated positively with high competitive intensity.Implications include the following: (1) While external product technology acquisition may provide quicker or even less expensive initial solutions, external reliance makes it difficult to maintain a long‐term positional advantage; (2) When greater distances separate key functional activities, external partners may provide solutions that are more responsive to local consumer needs, and the potential for improved communication may allow for quicker adaptation and increased flexibility; (3) In highly dynamic product situations, internal development, while providing greater control, can be expensive and can result in technologies that are not accepted by the marketplace; and (4) As competitive intensity increases, strategic imperatives may reduce the focus on product design and development and may require increasing concentration on manufacturing costs and efficiencies.
What Can “Nine‐Eleven” Tell Us about Closed‐end Fund Discounts and Investor Sentiment?
Authors: Burch Timothy R. , Emery Douglas R. , Fuerst Michael E. 
Published: October 2003

AbstractWe use the horrific events of September 11, 2001 (“nine‐eleven”) as a natural test of the hypothesis that closed‐end mutual fund discounts from fund net asset values reflect small investor sentiment. Because nine‐eleven was a sudden, unforeseen, and significantly negative and exogenous shock to the world, the capital markets, and investor sentiment, our test avoids many of the problems of extant studies. Discounts worsened dramatically following the event, and then recovered alongside the broader market. This finding is consistent with the hypothesis that discounts reflect the sentiment of small investors, who took their cues from the broader market's overall movement.
Pricing U.S. Dollar Index Futures Options: An Empirical Investigation
Authors: Bhargava Vivek , Clark John M. 
Published: October 2003

AbstractThis paper develops a pricing model and empirically tests the pricing efficiency of options on the U.S. Dollar Index (USDX) futures contract. Empirical tests of the model indicate that the market consistently overprices these options relative to the derived model. This overpricing is more pronounced for out‐of‐the‐money options than for in‐the‐money options and more pronounced for put options than for call options. To validate the above results, delta neutral portfolios are created for one‐ and two‐day holding periods and consistently generate positive arbitrage profits, indicating that on average the market overprices the options on the USDX futures contracts.
Market Segmentation and Information Asymmetry in Chinese Stock Markets: A VAR Analysis
Authors: Yang Jian 
Published: October 2003

AbstractThis study examines the market segmentation and information asymmetry patterns in Chinese stock markets. The recursive cointegration analysis confirms that each of six markets is not linked with other markets in the long run. Further, the result from data‐determined forecast error variance decomposition clearly shows that foreign investors in the Shanghai B‐share market are better informed than Chinese domestic investors in two A‐share markets and foreign investors in Shenzhen and Hong Kong markets over time. The finding challenges a widespread assumption of less informed foreign investors in the literature, but suggests that foreign investors could be more informed in emerging markets.
Return Linkages between Dual Listings under Arbitrage Restrictions: A Study of Indian Stocks and Their London Global Depositary Receipts
Authors: Kadapakkam Palani‐Rajan , Misra Lalatendu 
Published: October 2003

AbstractWe examine the linkages between returns on Indian global depositary receipts (GDRs) in London and their underlying stocks in India. GDR returns are sensitive to returns observed earlier in India. This sensitivity is more pronounced for more liquid GDRs. Although arbitrage is not feasible for GDRs that sell at a premium, these GDRs are, nevertheless, sensitive to Indian returns. The sensitivity is greater for GDRs selling at a discount, where costly arbitrage is feasible. GDR returns have a significant but small effect on subsequent returns of the underlying stocks, with more liquid GDRs having a slightly greater impact.
Autoduality of the Compactified Jacobian
Authors: Esteves Eduardo , Gagné Mathieu , Kleiman Steven 
Published: October 2003

The following autoduality theorem is proved for an integral projective curve C in any characteristic. Given an invertible sheaf L of degree 1, form the corresponding Abel map AL:C→, which maps C into its compactified Jacobian, and form its pullback map , which carries the connected component of 0 in the Picard scheme back to the Jacobian. If C has, at worst, points of multiplicity 2, then is an isomorphism, and forming it commutes with specializing C.Much of the work in the paper is valid, more generally, for a family of curves with, at worst, points of embedding dimension 2. In this case, the determinant of cohomology is used to construct a right inverse to . Then a scheme‐theoretic version of the theorem of the cube is proved, generalizing Mumford's, and it is used to prove that is independent of the choice of L. Finally, the autoduality theorem is proved. The presentation scheme is used to achieve an induction on the difference between the arithmetic and geometric genera; here, special properties of points of multiplicity 2 are used.
Index-Shuffle Graphs
Authors: Baumslag Marc , Obrenić Bojana 
Published: October 2003

Index-shuffle graphs are introduced as candidate interconnection networks for parallel computers. The comparative advantages of index-shuffle graphs over the standard bounded-degree "approximations" of the hypercube, namely butterfly-like and shuffle-like graphs, are demonstrated in the theoretical framework of graph embedding and network emulations. An N-node index-shuffle graph emulates: • an N-node shuffle-exchange graph with no slowdown, which the currently best emulations of shuffle-like graphs by hypercubes and butterflies incur a slowdown of Ω( log N). • its like-sized butterfly graph with a slowdown O( log log log N), while the currently best emulations of butterfly-like graphs by shuffle-like graphs incur a slowdown of Ω( log log N). • an N-node hypercube that executes an on-line leveled algorithm with a slowdown O( log log N), while the slowdown of currently best such emulations of the hypercube by its bounded-degree shuffle-like and butterfly-like derivatives remains Ω( log N). Our emulation is based on an embedding of an N-node hypercube into an N-node index-shuffle graph with dilation O( log log N), while the currently best embeddings of the hypercube into its bounded-degree shuffle-like and butterfly-like derivatives incur a dilation of Ω( log N).
The Construction of Large Scale Reconfigurable Parallel Computing Systems (The Architecture of the SC320)
Authors: Monien Burkhard , Diekmann Ralf , Lüling Reinhard 
Published: October 2003

Reconfigurable communication networks for massively parallel multiprocessor systems offer the possibility to realize a number of application demands like special communication patterns or real-time requirements. This paper presents the design principle of a reconfigurable network which is able to realize any graph of maximal degree four. The architecture is based on a special multistage Clos network, constructed out of a number of static routing switches of equal size. Upper bounds on the cut size of 4-regular graphs, if split into a number of clusters, allow minimizing the number of switches and connections while still offering the desired reconfiguration capabilities as well as large scalability and flexible multi-user access. Efficient algorithms configuring the architecture are based on an old result by Petersen27 about the decomposition of regular graphs. The concept presented here is the basis for the Parsytec SC series of reconfigurable MPP-systems. The currently largest realization with 320 processors is presented in greater detail.
Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications
Authors: Manacher Glenn K. , Mankus Terrance A. 
Published: October 2003

A maximum clique is sought in a set of n proper circular arcs (PCAS). By means of several passes, each O(n) in time and space, a PCAS is transformed initially into a set of circle chords and finally into a set of intervals. This interval model inherits a special property from the PCAS which ensures the discovery of a maximum overlap clique in time O(n). The one-to-one arc/interval correspondence guarantees the identification of the maximum clique in the PCAS in O(n) time and space. The present paper gives new, simpler proofs for the lemmas first outlined by us in Ref. [9], extending the methods outlined in that paper so that the time bound is improved from O(n log n) to O(n). The method depends only on certain interconnections between constructions related to the computation of longest increasing subsequences. Independently, Hell, Huang and Bhattacharya5 recently discovered a completely different approach that also achieves the same complexity, and can moreover be applied to the weighted case and to the coloring problem on proper circular arcs. The previous best result, due to Apostolico and Hambrusch2 applies to general circular arc models and has time complexity O(n2 log log n) and space complexity O(n). As applications of the method, we show that maximum weight clique of a set of weighted proper circular arcs can be found in time O(n2) and space O(n). The previous best result was O(n2 log log n) for dense general circular arc graphs.13 We also show that, for n chords with randomly placed endpoints (1) the average cardinality of a maximum clique is cn1/2 ± o(n1/2), where 21/2< c < e21/2, and (2) a maximum clique may be found in average time O(n3/2) and space θ(n). The previous best average time complexity, derived from Ref. [1], was O(n3/2 log n).
A Data Structure on Interval Graphs and Its Applications
Authors: Pal Madhumangal , Bhattacharjee G. P. 
Published: October 2003

In this papar, a new data structure, interval tree (IT), is introduced for an interval graph. Some important properties of IT are studies from the algorithmic point of view. It has many advantages compared to the data structures which are commonly used to solve the problems on interval graphs. Using the properties of IT, the following problems are solved on interval graphs: (i) shortest distances between any two vertices, and (ii) the diameter of the graph.
Chaos in Conditionally Reset Linear Systems
Authors: Aissi Cherif , Fadul Faisal 
Published: October 2003

This paper presents a novel and simple design of conditionally reset linear systems which exhibit chaotic behevior. The proposed systems are constructed from building blocks e.g. reset integrator, nonlinear controller, summer and gain amplifiers) which can be either designed or found in the off-shelf electronics library. Throughout the paper, computer simulation results are used to show the stretching and folding mechanism for chaos generation in these systems.
Optimal Shortest Path and Minimum-Link Path Queries between Two Convex Polygons inside a Simple Polygonal Obstacle
Authors: Chiang Yi-Jen , Tamassia Roberto 
Published: October 2003

We present efficient algorithms for shortest-path and minimum-link-path queries between two convex polygons inside a simple polygon P, which acts as an obstacle to be avoided. Let n be the number of vertices of P, and h the total number of vertices of the query polygons. We show that shortest-path queries can be performed optimally in time O( log h + log n) (plus O(k) time for reporting the k edges of the path) using a data structure with O(n) space and preprocessing time, and that minimum-link-path queries can be performed in optimal time O( log h + log n) (plus O(k) to report the k links), with O(n3) space and preprocessing time. We also extend our results to the dynamic case, and give a unified data structure that supports both queries for convex polygons in the same region of a connected planar subdivision [Formula: see text]. The update operations consist of insertions and deletions of edges and vertices. Let n be the current number of vertices in [Formula: see text]. The data structure uses O(n) space, supports updates in O( log 2 n) time, and performs shortest-path and minimum-link-path queries in times O( log h+ log 2n) (plus O(k) to report the k edges of the path) and O( log h + k log 2 n), respectively. Performing shortest-path queries is a variation of the well-studied separation problem, which has not been efficiently solved before in the presence of obstacles. Also, it was not previously known how to perform minimum-link-path queries in a dynamic environment, even for two-point queries.
Software Quality Classification Modeling Using the SPRINT Decision Tree Algorithm
Authors: Khoshgoftaar Taghi M. , Seliya Naeem 
Published: October 2003

Predicting the quality of system modules prior to software testing and operations can benefit the software development team. Such a timely reliability estimation can be used to direct cost-effective quality improvement efforts to the high-risk modules. Tree-based software quality classification models based on software metrics are used to predict whether a software module is fault-prone or not fault-prone. They are white box quality estimation models with good accuracy, and are simple and easy to interpret. An in-depth study of calibrating classification trees for software quality estimation using the SPRINT decision tree algorithm is presented. Many classification algorithms have memory limitations including the requirement that datasets be memory resident. SPRINT removes all of these limitations and provides a fast and scalable analysis. It is an extension of a commonly used decision tree algorithm, CART, and provides a unique tree pruning technique based on the Minimum Description Length (MDL) principle. Combining the MDL pruning technique and the modified classification algorithm, SPRINT yields classification trees with useful accuracy. The case study used consists of software metrics collected from a very large telecommunications system. It is observed that classification trees built by SPRINT are more balanced and demonstrate better stability than those built by CART.
The Wheeler–Dewitt Equation for the Superstring World Sheet
Authors: Pollock M. D. 
Published: October 2003

The Wheeler–DeWitt equation for the wave function ψ is obtained from the two-dimensional world-sheet action for the bosonic string and the superstring, including higher-derivative terms, as the Schrödinger equation i ∂ ψ/ ∂τ = V(τ)ψ. The potential is given by the rate at which the world-sheet area is swept out, V(τ) = dA(τ)/dτ, and is positive semi-definite, allowing the existence of a ground state, corresponding to the absence of the string, with a non-vanishing probability density ψ ψ*. Integration of this equation yields the solution [Formula: see text], where [Formula: see text] is the action, minus the higher-derivative terms [Formula: see text] (and terms involving ∊ab in the case of the superstring), which, however, are constrained to vanish semi-classically, being constructed from the square of the equation of motion for the bosonic coordinates XA derived from [Formula: see text] alone. This path-integral expression for ψ is consistent with the operator replacements for the canonical momenta used in its derivation, and forms the basis of the approach due to Polyakov of summing over random surfaces. Comparison is made with the Schrödinger equations derived previously from the reduced, four-dimensional effective action for the heterotic superstring, and for the Schwarzschild black hole (by Tomimatsu), where the potential is also positive semi-definite, being (twice) the total mass of the Universe and the mass of the black hole, respectively, showing the unity of the method.
On the Fatigue-Life Distributions of Engineering Materials
Authors: Khaleel M. A. , Saunders S. C. 
Published: October 2003

The applicability of the fatigue-life distribution of Birnbaum–Saunders for modeling the components of partially prestressed concrete girder bridges is argued by the agreement of the calculated distribution with a large data set comprised of many small censored samples, each put into standardized form, of the fatigue-lives of bridge components. Also, the Weibull and lognormal distributions are compared by the appropriateness of the assumptions in their derivation to the cumulative damage to bridge components. The maximum likelihood estimates of the parameters of the fatigue lives of the prestressing steel, mild steel, and concrete are found from randomly censored samples, for several censored data-sets under various stress regimes. The parameters are postulated to be log-linear functions of the maximum stress and stress regimes. Weighted least-square regression is applied to determine the unknown coefficients. To compensate for differences in the precision of the estimates obtained under each stress regime the variances are calculated by the bootstrap statistical method. This procedure gives an estimated distribution of the fatigue life with its parameters functions of the stress regime which is applicable under virtually any realistic condition.
Bayesian Reliability Analysis of High-Reliability Systems of Binomial and Poisson Subsystems
Authors: Martz Harry F. , Baggerly Keith A. 
Published: October 2003

A Bayesian procedure for estimating the reliability of a complex system of independent series and parallel subsystems is presented. This method accepts either binomial or Poisson test data (perhaps both or neither) as inputs, as well as prior information, at any and all levels in the system (such as the component, subsystem and system levels). Natural conjugate beta and gamma priors are considered. A numerical example concerning the unreliability of the low-pressure coolant injection system of a certain U.S. commercial nuclear-powered boiling water reactor is used to illustrate the procedure. A Mathematica® notebook is available for implementing the method.