bluuebunny/crossref_metadata_2025_split huggingface dataset:
The Living Tomorrow Project: how Philip Morris has used a Belgian tourist attraction to promote ventilation approaches to the control of second hand smoke
Authors: Pilkington P , Gilmore A B 
Published: November 2004

Study objective:To examine the involvement of Philip Morris in Living Tomorrow 2 and determine the rationale behind its involvement.Design:Research was conducted through a web based search of internal tobacco industry documents made publicly available through litigation.Main results:For approximately €1 000 000 Philip Morris (now Altria) became a co-initiator of Living Tomorrow 2, a tourist complex in Belgium that aims to demonstrate how we will be living in the future. In addition to promoting the company and its grocery products, Philip Morris is using the complex and its website to promote ventilation as a means of accommodating smokers and non-smokers in the indoor environment. Particular emphasis was placed on the bar and restaurant areas. Despite the rationale for its involvement, Philip Morris fails to acknowledge its role as a cigarette manufacturer. As a form of corporate sponsorship Philip Morris thought its involvement could evade any European tobacco advertising ban.Conclusions:Philip Morris is using a tourist attraction to promote its views on control of second hand smoke (SHS) and accommodation of smokers and non-smokers in the indoor environment. However, ventilation does not deal with the health effects of SHS. Policymakers must be cognisant of the devious tactics the industry employs to promote its own agenda, especially in relation to indoor air quality and smoking in public places. Tobacco control legislation should be continually modified and strengthened in response to the changing activities of the tobacco industry as it strives to evade existing legislation and deter the advent of new legislation.
“Asia is now the priority target for the world anti-tobacco movement”: attempts by the tobacco industry to undermine the Asian anti-smoking movement
Authors: Knight J , Chapman S 
Published: November 2004

Study objective:To identify and examine the strategies utilised by multinational tobacco companies to undermine and discredit key anti-tobacco activists and organisations in the Asian region.Method:A series of case studies drawing upon material gathered through systematic reviews of internal tobacco industry documents.Date sources:Tobacco industry documents made public as part of the settlement of the Minnesota Tobacco Trial and the Master Settlement Agreement.Results:The industry sought to identify, monitor, and isolate key individuals and organisations. The way industry went about fulfilling this mandate in the Asian region is discussed. Industry targetted individuals and agencies along with the region’s primary anti-smoking coalition.Conclusions:Attack by multinational tobacco companies is a virtual quid pro quo for any individual or agency seriously challenging industry practices and policies. Understanding their tactics allows anticipatory strategies to be developed to minimise the effectiveness of these attacks.
CONTRIBUTION OF ECC, ELC, AND TI TO CUSP ELECTRONS IN COLLISION BETWEEN He+ AND Ar TARGET
Authors: Hsu C.C. , Depaola B.D. , Chu T.C. , Chang Y.C. , Jaw K.L. 
Published: November 2004

The contributions of ECC, ELC and TI to cusp electrons are measured from 40 keV to 100 keV of projectile He + energies. While the contribution of the ELC is so small and decreases as the energy of projectile decreases, the contribution of TI increases slowly and becomes constant finally. The ratio of the contribution of TI to that of ECC remains approximately constant in the energy region. This fact implies that there is a linear correlation between the cusp electrons of processes TI and those of ECC.
LATTICE QUANTUM ELECTRODYNAMICS NEAR THE PHASE TRANSITION
Authors: LIPPERT THOMAS 
Published: November 2004

Numerical simulations of quantum electrodynamics near the phase transition suffer from an extreme slowing down on large lattices. The two leading terms of the decaying autocorrelation function can be attributed to the influence of first-order phase transition effects, called supercritical slowing down, and second-order phase transition effects, called critical slowing down, respectively. We show that we can bypass supercritical slowing down using a conventional local updating algorithm based on a phenomenological weight ratio fixing method. As for critical slowing down, we apply a new global multi-scale updating algorithm which removes critical slowing down completely. We compare the structure of the local vs. the global algorithm as well as their implementation on the Connection Machine CM-2, analyze their computational complexity and present actual performance measurements.
DETERMINATION OF MONOPOLE CURRENT CLUSTERS IN FOUR-DIMENSIONAL QUANTUM ELECTRODYNAMICS
Authors: BODE ACHIM , LIPPERT THOMAS , SCHILLING KLAUS , UEBERHOLZ PEER 
Published: November 2004

Magnetic monopole currents are believed to have a strong impact on the Monte Carlo dynamics of compact quantum electrodynamics near the phase transition. We have indications that updating algorithms have to form and to break up monopole current clusters in order to force the tunneling of the system between the coexisting phases, the confined phase and the Coulomb phase. This might be responsible for long lived metastabilities in the time series. We present parallel numerical algorithms which allow the fast identification of clusters of monopole loops, the determination of their topological properties as well as their visualization in the course of a Monte Carlo simulation. The algorithms are implemented on the Connection Machine CM-5. We compare the data parallel programming style with a message passing approach. Complexity and performance are discussed.
ON THE DESIGN OF DEADLOCK-FREE ADAPTIVE MULTICAST ROUTING ALGORITHMS
Authors: DUATO JOSÉ 
Published: November 2004

Multicast communication refers to the delivery of the same message from one source node to an arbitrary number of destination nodes. Two multicast wormhole routing methods have been presented in [13] for multicomputers with 2D-mesh and hypercube topologies. Also, a theory for the design of deadlock-free adaptive routing algorithms for wormhole networks has been proposed in [7, 8]. This theory supplies the sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels. This paper analyses the additional channel dependencies produced by multicast routing algorithms on wormhole networks. Then, the theory proposed in [7, 8] is extended by considering them. As an example, the multicast routing algorithms presented in [13] are extended, taking advantage of the alternative paths offered by the network.
N=3 AND N=4 SUPERCONFORMAL WZNW SIGMA MODELS IN SUPERSPACE I: GENERAL FORMALISM AND THE N=3 CASE
Authors: IVANOV E.A. , KRIVONOS S.O. , LEVIANT V.M. 
Published: November 2004

In the present and accompanying papers we develop a manifestly invariant superfield description of N=3 and N=4 2D superconformal WZNW sigma models with U(1)×O(3) and U(1)×U(1)×O(4) as the bosonic target manifolds. In the first paper we start by recalling the basic elements of 2D superconformal superfield calculus. As a new result, we generalize the latter to the newly discovered U(1) -extended O(4) N=4 superconformal algebra. In particular, the existence of a new class of N=4 primary superfields labelled by the eigenvalues of the U(1) generator is pointed out. Further, we construct the N=3 superspace formulation of the U(1)×O(3) model. The self-contained definition of the N=3 supercurrent via the basic primary superfields of this model is given, both in classical and quantum cases, and the relevant SOPEs are written down. It is shown that the model, being actually N=4 supersymmetric, admits one more supercurrent which extends the N=3 superconformal algebra to the N=4 one mentioned above. We define the minimal quantum N=3 superfield representations adequate for the two important cases of fermionization of the [Formula: see text] Kac-Moody current corresponding to the levels k=0 and k=2 of the bosonic part of one of its [Formula: see text] components.
A REAL-TIME CONTROL ARCHITECTURE FOR AN APPROXIMATE PROCESSING BLACKBOARD SYSTEM
Authors: DECKER KEITH , GARVEY ALAN , HUMPHREY MARTY , LESSER VICTOR 
Published: November 2004

Approximate processing is an approach to real-time AI problem solving in domains in which compromise is possible between the resources required to generate a solution and the quality of that solution. It is a satisficing approach in which the goal is to produce acceptable solutions within the available time and computational resource constraints. Previous work has shown how to integrate approximate processing knowledge sources within the blackboard architecture. However, in order to solve real-time problems with hard deadlines using a blackboard system, we need to have: (1) a predictable blackboard execution loop, (2) a representation of the set of current and future tasks and their estimated durations, and (3) a model of how to modify those tasks when their deadlines are projected to be missed, and how the modifications will affect the task durations and results. This paper describes four components for achieving this goal in an approximate processing blackboard system. A parameterized low-level control loop allows predictable knowledge source execution, multiple execution channels allow dynamic control over the computation involved in each task, a meta-controller allows a representation of the set of current and future tasks and their estimated durations and results, and a real-time blackboard scheduler monitors and modifies tasks during execution so that deadlines are met. An example is given that illustrates how these components work together to construct a satisficing solution to a time-constrained problem in the Distributed Vehicle Monitoring Testbed (DVMT).
ANA: AUTOMATIC NATURAL ACQUISITION
Authors: ENGUEHARD CHANTAL , TRIGANO PHILIPPE , MALVACHE PIERRE 
Published: November 2004

Any system for natural language processing must be based on a lexicon. Once a model has been defined, there is the problem of acquiring and inserting words. This task is tedious for a human operator; on the one hand he must not forget any of the words, and on the other the acquisition of a new concept requires the input of a number of parameters. In view of these difficulties, research work has been undertaken in order to integrate pre-existing “paper” dictionaries. Nevertheless, these are not faultless, and are often incomplete when processing a very specialized technical field. We have therefore searched to mitigate these problems by automating the enrichment of an already partially integrated lexicon. We work in a technical field on which we have gathered different sorts of texts: written texts, specialist interviews, technical reports, etc. These documents are stored in an object oriented database, and form part of a wider project, called REX (“Retour d’EXpérience” in French, or “Feedback of Experience” in English). Our system, called ANA, reads the documents, analyses them, and deduces new knowledge, allowing the enrichment of the lexicon. The group of words already integrated into the lexicon form the “Bootstrap” of the discovery process of new words: it collects the instances of the different concepts thought to be interesting, in order to gather the semantic information. A special module makes it possible to avoid an explosion of the size of the database. It is responsible for forgetting certain instances and maintaining the database in such a way that the order in which the texts are introduced bears no influence.
A HYBRID CONTINUOUS SPEECH RECOGNITION SYSTEM USING SEGMENTAL NEURAL NETS WITH HIDDEN MARKOV MODELS
Authors: ZAVALIAGKOS G. , AUSTIN S. , MAKHOUL J. , SCHWARTZ R. 
Published: November 2004

Up till recently, state-of-the-art, large vocabulary, continuous speech recognition (CSR) had employed hidden Markov modeling (HMM) to model speech sounds. In an attempt to improve over HMM we developed a hybrid system that integrates HMM technology with neural networks. We present the concept of a Segmental Neural Net (SNN) for phonetic modeling in CSR. By taking into account all the frames of a phonetic segment simultaneously, the SNN overcomes the well-known conditional-independence limitation of HMMs. We have developed a novel hybrid SNN/HMM system that combines the advantages of SNNs and HMMs using a multiple hypothesis (or N-best) paradigm. In this system, we generate likely phonetic segmentations from the HMM N-best list of word sequences, which are scored by the SNN. The HMM and SNN scores are then combined to optimize performance. In several speaker-independent, 1000-word CSR tests, the error rate for the hybrid system dropped 20% from that of a state-of-the-art HMM system alone.
AUTOMATION IN MAMMOGRAPHY: COMPUTER VISION AND HUMAN PERCEPTION
Authors: ASTLEY SUE , HUTT IAN , MILLER PETER , ROSE PETER , TAYLOR CHRIS , BOGGIS CAROLINE , ADAMSON STEPHEN , VALENTINE TIM , DAVIES JACK , ARMSTRONG JANETTE 
Published: November 2004

Mammographic screening programmes generate large numbers of highly variable, complex images, most of which are unequivocally normal. When present, abnormalities may be small or subtle. Two processes critical to the success of screening programmes are the perception of potential abnormalities and the subsequent analy-sis of each detected lesion to determine its clinical significance. The consequences of errors are costly, and in many screening centres, films are read by two radiologists in an attempt to reduce errors. The prime objective of our research is to improve the accuracy of the detection and analysis of breast lesions by providing radiologists with computer-aided digital image analysis tools. In this paper we focus on the detection and analysis of mammographic microcalcifications. We describe a philosophy of research aimed at generating useful computer-based aids for radiologists. Firstly, it is necessary to accurately identify specific tasks which are difficult for the human observer. Having correctly identified a problem, appropriate computer vision methods must be developed and their performance evaluated. It is then important to determine effective ways of using such methods to aid radiologists, and it is essential to prove that the effect on radiologists’ performance is entirely beneficial. We present results of experiments to determine factors affecting radiologists’ perception of microcalcifications, and to investigate the effects of attention-cueing on detection performance. Our results show that radiologists’ performance can be significantly improved with the use of prompts generated from automatically-detected microcalcification clusters. We describe a new method for the delineation of mammographic abnormalities based on the analysis of multiple high quality X-ray projections of excised lesions. Biopsy specimens are secured inside a rigid tetrahedron, the edges of which provide a reference frame to which the locations of features can be related. A three-dimensional representation of an abnormality can be formed and rotated to resemble its appearance in the original mammogram.
AN EXTENDED FORM OF SUB-BAND INTERPOLATION OF MULTI-DIMENSIONAL DISCRETE SIGNALS AND ITS APPLICATIONS
Authors: KIDA TAKURO 
Published: November 2004

In this paper, we establish an extended form of the optimum sub-band interpolation for a family of n-dimensional discrete signals. We assume that the Fourier spectrums of these discrete signals have weighted L2 norms smaller than a given positive number. It is assumed that the sample points of these discrete signals are identical with the whole vertices of an n-dimensional rectangular lattice in Rn. Among these sample points, certain subsets are used for the interpolation. Selecting appropriate subsets of the sample points, we can realize a wide variety of periodic arrangements of sample points for interpolation such as hexagonal and octagonal lattices or a set of sample points used in interlaces scanning of digital television. The proposed method minimizes the measure of error which is equal to the envelope of the approximation errors with respect to the discrete signals. In the following discussion, we assume initially that the corresponding approximation formula uses an infinite number of interpolation functions having limited supports and functional forms different from each other. However, it should be noted that the resultant optimum interpolation functions are expressed as the parallel shifts of the impulse responses of the finite number of n-dimensional FIR filters. Equivalent analog approximation formula corresponding to the proposed discrete approximation, is derived and interesting reciprocal relation in the approximation, is also discussed. A necessary and sufficient condition for the convergence of the corresponding analog approximation formula to the original band limited signal, is presented. An equivalent expression of the analog approximation formula in the frequency domain, is derived in relation to the convergence condition.
FROM THE CHUA CIRCUIT TO THE GENERALIZED CHUA MAP
Authors: BROWN RAY 
Published: November 2004

We analytically derive a one-dimensional map from an ODE which produces a double scroll very similar to the Chua double scroll. Our analysis leads us to suggest a generalization of the Chua circuit to an n-dimensional system of ODEs that we will call the generalized Chua equations. The third order system of ODEs in this class contains the Chua equations as a special case. Parallel to the generalized Chua equations we define the generalized Chua maps. An important feature of these equations and maps is that the source of their nonlinearity is a sigmoid function, and functions very similar in their properties to the sigmoid function. We show that this class of equations contains examples of maps that reproduce the Lorenz and Rössler dynamics. We suggest that a general theory of these equations and maps, and their relationship to one-dimensional maps, is possible. A benefit of our analysis shows that the dynamics of the maps of Rössler, Chua, and Lorenz maps can be traced to a common set of building blocks, and we conclude that the Chua map is the simplest of the three maps and therefore understanding the complexity in the Chua map provides a foundation for understanding chaos in a large class of n-dimensional equations that includes the maps of Rössler and Lorenz.
THEORY OF GENERALIZED INTERPOLATORY APPROXIMATION OF MULTI-DIMENSIONAL SIGNALS
Authors: KIDA TAKURO 
Published: November 2004

In this paper, we present a systematic theory of the optimum subband interpolation of a family of n-dimensional signals which are not necessarily band-limited. We assume that the Fourier spectrums of these signals have weighted L2 norms smaller than a given positive number. The proposed method minimizes the measure of error which is equal to the envelope of the approximation errors with respect to the signals. In the following discussion, we assume initially that the infinite number of interpolation functions with different functional forms are used in the corresponding approximation formula. However, the resultant optimum interpolation functions are expressed as the parallel shifts of the finite number of the n-dimensional functions. It should be noted that the optimum interpolation functions presented in this paper satisfy the generalized discrete orthogonality and, as a result, minimize the wide variety of measures of error at the same time. In the literature,6 a similar discussion is presented. However, it is assumed that the signal is band-limited and the interpolation functions are compulsorily time-limited. Hence, these interpolation functions cannot minimize other measures of error except the proposed one. Interesting reciprocal relation in the approximation, is also discussed. An equivalent expression of the approximation formula in the frequency domain is derived.
AN OBJECT-ORIENTED SOFTWARE REQUIREMENTS ANALYSIS METHOD
Authors: POO DANNY C. C. 
Published: November 2004

This paper discusses an object-oriented software requirements analysis method. The approach adopted here draws clear distinction between a system's basic structure (i.e. the object model) and its functionalities. The analysis model generated is a description of a problem domain; it consists of a set of primary and secondary objects that characterize the problem domain, and a set of pseudo objects that define the functional requirements of a system. There are two stages of analysis in the proposed method: Object Modelling and Functional Requirements Modelling. These two stages are built upon one another. The aim of the object modelling stage is to derive a model of the problem domain in terms of objects, their classification and inter-relationships with one another. The functional requirements modelling stage builds upon this initial object model to complete the requirement analysis specification. This paper uses a real-life library environment to illustrate how the method can be applied in the specification of an object-oriented software system.
RIGOROUS ENGINEERING PRACTICE AND FORMAL REASONING OF DEEP DOMAIN KNOWLEDGE—THE BASIS OF DEPENDABLE KNOWLEDGE BASED SYSTEMS FOR PROCESS PLANT CONTROL
Authors: BOLOGNA SANDRO , SIVERTSEN TERJE , VÄLISUO HEIKKI 
Published: November 2004

Knowledge based systems are often used to replace humans in solving problems for which only heuristic knowledge on the solution is available. However, there are also important application areas where nonheuristic knowledge is available e.g. in technical documents but where efficient use of the knowledge is impossible without the techniques provided by artificial intelligence. High dependability of these kinds of applications can be achieved if domain knowledge can be represented in a language providing both adequate representational constructs and the required level of formality. In addition, the language should be supported by powerful tools assisting in the verification process. Knowledge Based Systems, despite the different technology employed, are still nothing more than a computer program. Unfortunately, quite a few people building knowledge based systems seem to ignore the many good programming practices that have evolved over the years for producing traditional computer programs. What we need is a framework for the modelling of the KBSs development. In our work, it is claimed that these requirements can be met by utilizing and combining ideas from control engineering, software engineering and artificial intelligence.
CONJUGACY IN FREE INVERSE MONOIDS
Authors: CHOFFRUT CHRISTIAN 
Published: November 2004

We give the equation xz=zy in free inverse monoids the best possible solution by showing, with a technical restriction, that whenever x and y satisfy such an equation for some z, then there exists a finite chain of words, starting in x and ending in y, for which two consecutive words are of the form uv and vu. We also prove, given x and y, that testing whether or not there exists an element z such that the equation xz=zy holds, is linear in the lengths of some representatives of x and y. This naturally extends the corresponding result in free monoids. Résumé: nous donnons de l'équation xz=zy la meilleure solution possible en montrant que si deux mots x et y satisfont une telle équation pour un certain z, alors sous une hypothèse faible, il existe une chaine finie et non bornée de mots débutant en x et terminant en y, telle que deux mots consécutifs soient de la forme uv et vu. Nous prouvons aussi que décider si deux éléments x et y satisfont xz=zy pour un certain z, est linéaire en la longueur de représentants de x et y. Ceci étend de façon naturelle le résultat correspondant pour les monoides libres.