name stringlengths 7 10 | title stringlengths 13 125 | abstract stringlengths 67 3.02k | fulltext stringclasses 1
value | keywords stringlengths 17 734 |
|---|---|---|---|---|
train_1093 | A fuzzy logic approach to accommodate thermal stress and improve the start-up | phase in combined cycle power plants Use of combined cycle power generation plant has increased dramatically over the last decade. A supervisory control approach based on a dynamic model is developed, which makes use of proportional-integral-derivative (PID), fuzzy logic and fuzzy PID schemes. The aim is to minimize th... | pid control;combined cycle power plants;start-up schedule;steam turbine plant start-up time minimization;fuzzy pid schemes;fuzzy logic approach;supervisory control;maximum thermal stress limits;dynamic model | |
train_1094 | Efficient allocation of knowledge in distributed business structures | Accelerated business processes demand new concepts and realizations of information systems and knowledge databases. This paper presents the concept of the collaborative information space (CIS), which supplies the necessary tools to transform individual knowledge into collective useful information. The creation of 'info... | multidimensionally hierarchical composition;knowledge databases;collaborative information space;distributed business structures;business process steps;information objects;web-based user interface;heterogeneous distributed data;information systems;accelerated business processes;interactive system;efficient knowledge all... | |
train_1095 | Development of a real-time monitoring system | This paper describes a pattern recognition (PR) technique, which uses learning vector quantization (LVQ). This method is adapted for practical application to solve problems in the area of condition monitoring and fault diagnosis where a number of fault signatures are involved. In these situations, the aim is health mon... | fault diagnosis;coolant system;pattern recognition technique;enforcement training;learning vector quantization;large sampling time;competitive learning model;fault database;health monitoring;pattern correlation;fault diagnostic capability;pattern vectors;fast learning model;condition monitoring;real-time failure cause ... | |
train_1096 | Evaluating alternative manufacturing control strategies using a benchmark | system This paper describes an investigation of the effects of dynamic job routing and job sequencing decisions on the performance of a distributed control system and its adaptability against disturbances. This experimental work was carried out to compare the performance of alternative control strategies in various man... | discrete-event simulation model;hybrid strategies;disturbance adaptability;production volumes;benchmark system;dynamic job routing;experimental test-bed;agent-based control system;benchmark manufacturing system;reactive agent mechanisms;job congestion;allocation strategies;contract net;alternative manufacturing control... | |
train_1097 | A study on an automatic seam tracking system by using an electromagnetic sensor | for sheet metal arc welding of butt joints Many sensors, such as the vision sensor and the laser displacement sensor, have been developed to automate the arc welding process. However, these sensors have some problems due to the effects of arc light, fumes and spatter. An electromagnetic sensor, which utilizes the gener... | automatic seam tracking system;seam tracking accuracy;weld line detection;root gap size;sheet metal arc welding;electromagnetic sensor;butt joints;eddy current generation | |
train_1098 | Instability phenomena in the gas-metal arc welding self-regulation process | Arc instability is a very important determinant of weld quality. The instability behaviour of the gas-metal arc welding (GMAW) process is characterized by strong oscillations in arc length and current. In the paper, a model of the GMAW process is developed using an exact arc voltage characteristic. This model is used t... | gas-metal arc welding;exact arc voltage characteristic;weld quality;instability phenomena;metal transfer mode;self-regulation process;gmaw process;arc instability | |
train_1099 | WebCAD: A computer aided design tool constrained with explicit 'design for | manufacturability' rules for computer numerical control milling A key element in the overall efficiency of a manufacturing enterprise is the compatibility between the features that have been created in a newly designed part, and the capabilities of the downstream manufacturing processes. With this in mind, a process-aw... | internet-based cad/cam;webcad;design for manufacturability rules;computer aided design tool;computer numerical control milling;design tools;three-axis cnc milling machine;process-aware cad system;cad/cam systems;manufacturability rules;manufacturing enterprise efficiency | |
train_11 | Does social capital determine innovation? To what extent? | This paper deals with two questions: Does social capital determine innovation in manufacturing firms? If it is the case, to what extent? To deal with these questions, we review the literature on innovation in order to see how social capital came to be added to the other forms of capital as an explanatory variable of in... | participation assets;two-stage decision-making process;research network assets;cognitive social capital;degree of radicalness;innovation;reciprocal trust;business network assets;structural social capital;information network assets;manufacturing firms;relational assets | |
train_110 | A switching synchronization scheme for a class of chaotic systems | In this Letter, we propose an observer-based synchronization scheme for a class of chaotic systems. This class of systems are given by piecewise-linear dynamics. By using some properties of such systems, we give a procedure to construct the gain of the observer. We prove various stability results and comment on the rob... | chaotic systems;robustness;switching synchronization scheme;state observers;piecewise-linear dynamics | |
train_1100 | Evaluation of existing and new feature recognition algorithms. 2. Experimental | results For pt.1 see ibid., p.839-851. This is the second of two papers investigating the performance of general-purpose feature detection techniques. The first paper describes the development of a methodology to synthesize possible general feature detection face sets. Six algorithms resulting from the synthesis have b... | concavity;national design repository;face sets;general-purpose feature detection techniques;feature recognition algorithms;convex hull | |
train_1101 | Evaluation of existing and new feature recognition algorithms. 1. Theory and | implementation This is the first of two papers evaluating the performance of general-purpose feature detection techniques for geometric models. In this paper, six different methods are described to identify sets of faces that bound depression and protrusion faces. Each algorithm has been implemented and tested on eight... | minimum concave;national design repository;cad/cam software;two-dimensional convex hull method;geometric models;sets of faces;geometric reasoning algorithms;visible inner-loop face sets;three-dimensional convex hull;curved faces;feature recognition algorithms;general-purpose feature detection techniques;single-face inn... | |
train_1102 | Design and implementation of a reusable and extensible HL7 encoding/decoding | framework The Health Level Seven (HL7), an international standard for electronic data exchange in all health care environments, enables disparate computer applications to exchange key sets of clinical and administrative information. Above all, it defines the standard HL7 message formats prescribed by the standard encod... | abstract message form;structural constraints;health level seven;corba;international standard;message definition repository;mom;clinical information;health care environments;logical relationships;standalone software components;electronic data exchange;message object model;java;extensible encoding/decoding framework;mdr;... | |
train_1103 | New age computing [autonomic computing] | Autonomic computing (AC), sometimes called self-managed computing, is the name chosen by IBM to describe the company's new initiative aimed at making computing more reliable and problem-free. It is a response to a growing realization that the problem today with computers is not that they need more speed or have too lit... | computing reliability;new age computing;adaptive algorithms;it industry initiatives;problem-free computing;ac implementation;autonomic computing;ac requirements;ac development;computer crash;self-managed computing;open standards;ac;self-healing computing;ibm initiative;computer memory;computer speed | |
train_1104 | A 3-stage pipelined architecture for multi-view images decoder | In this paper, we proposed the architecture of the decoder which implements the multi-view images decoding algorithm. The study of the hardware structure of the multi-view image processing has not been accomplished. The proposed multi-view images decoder operates in a three stage pipelined manner and extracts the depth... | three-stage pipelined architecture;depth extractor;operating frequency;30 mhz;hardware structure;viewpoint;node selector;pixel depth;max+plusii design tool;multi-view images decoder;affine transformer | |
train_1105 | Fuzzy business [Halden Reactor Project] | The Halden Reactor Project has developed two systems to investigate how signal validation and thermal performance monitoring techniques can be improved. PEANO is an online calibration monitoring system that makes use of artificial intelligence techniques. The system has been tested in cooperation with EPRI and Edan Eng... | feedwater flow;calibration;thermal performance monitoring;steam generators;pwr;bwr;steam turbine cycles;peano;artificial intelligence;tempo;halden reactor project;fuzzy logic | |
train_1106 | Virtual projects at Halden [Reactor Project] | The Halden man-machine systems (MMS) programme for 2002 is intended to address issues related to human factors, control room design, computer-based support system areas and system safety and reliability. The Halden MMS programme is intended to address extensive experimental work in the human factors, control room desig... | computer-based support system;virtual reality;man-machine systems programme;human factors;control room design;safety;halden reactor project;reliability | |
train_1107 | A knowledge-navigation system for dimensional metrology | Geometric dimensioning and tolerancing (GD&T) is a method to specify the dimensions and form of a part so that it will meet its design intent. GD&T is difficult to master for two main reasons. First, it is based on complex 3D geometric entities and relationships. Second, the geometry is associated with a large, diverse... | knowledge navigation;geometric dimensioning;web;dimensional metrology;visualization;manufacturing training;vrml;inspection;tolerancing;interoperability standards | |
train_1108 | The visible cement data set | With advances in x-ray microtomography, it is now possible to obtain three-dimensional representations of a material's microstructure with a voxel size of less than one micrometer. The Visible Cement Data Set represents a collection of 3-D data sets obtained using the European Synchrotron Radiation Facility in Grenoble... | x-ray microtomography;3d representations;plaster of paris;european synchrotron radiation facility;microstructural images;microstructure;cement hydration;two-dimensional images;building brick;voxel size;esrf;hydrating portland cement pastes | |
train_1109 | The existence condition of gamma -acyclic database schemes with MVDs | constraints It is very important to use database technology for a large-scale system such as ERP and MIS. A good database design may improve the performance of the system. Some research shows that a gamma -acyclic database scheme has many good properties, e.g., each connected join expression is monotonous, which helps ... | query performance;connected join expression;mvds constraints;gamma -acyclic database schemes;large-scale system;existence condition;sufficient and necessary condition;database technology | |
train_111 | Modification for synchronization of Rossler and Chen chaotic systems | Active control is an effective method for making two identical Rossler and Chen systems be synchronized. However, this method works only for a certain class of chaotic systems with known parameters both in drive systems and response systems. Modification based on Lyapunov stability theory is proposed in order to overco... | adaptive synchronization controller;active control;global asymptotic synchronization;lyapunov stability theory;response systems;chen chaotic systems;rossler chaotic systems;synchronization | |
train_1110 | A hybrid model for smoke simulation | A smoke simulation approach based on the integration of traditional particle systems and density functions is presented in this paper. By attaching a density function to each particle as its attribute, the diffusion of smoke can be described by the variation of particles' density functions, along with the effect on air... | look-up tables;rendering;smoke simulation;hybrid model;continuous density field;density functions | |
train_1111 | The contiguity in R/M | An r.e. degree c is contiguous if deg/sub wtt/(A)=deg/sub wtt/(B) for any r.e. sets A,B in c. In this paper, we generalize the notation of contiguity to the structure R/M, the upper semilattice of the r.e. degree set R modulo the cappable r.e. degree set M. An element [c] in R/M is contiguous if [deg/sub wtt/(A)]=[deg/... | upper semilattice;turing degree;recursion theory;contiguity;nonzero element;recursively enumerable set | |
train_1112 | Blending parametric patches with subdivision surfaces | In this paper the problem of blending parametric surfaces using subdivision patches is discussed. A new approach, named removing-boundary, is presented to generate piecewise-smooth subdivision surfaces through discarding the outmost quadrilaterals of the open meshes derived by each subdivision step. Then the approach i... | subdivision surfaces;piecewise-smooth subdivision surfaces;piecewise smooth subdivision surfaces;parametric bicubic b-spline surfaces;quadrilaterals;parametric surfaces blending;subdivision patches | |
train_1113 | Word spotting based on a posterior measure of keyword confidence | In this paper, an approach of keyword confidence estimation is developed that well combines acoustic layer scores and syllable-based statistical language model (LM) scores. An a posteriori (AP) confidence measure and its forward-backward calculating algorithm are deduced. A zero false alarm (ZFA) assumption is proposed... | confidence estimation;optimal path search;acoustic layer scores;speech recognition systems;syllable-based statistical language model scores;a posterior measure;syllable lattice hidden markov model;n-best syllable re-scoring;relative confidence measures;forward-backward calculating algorithm;zero false alarm assumption;... | |
train_1114 | A new algebraic modelling approach to distributed problem-solving in MAS | This paper is devoted to a new algebraic modelling approach to distributed problem-solving in multi-agent systems (MAS), which is featured by a unified framework for describing and treating social behaviors, social dynamics and social intelligence. A conceptual architecture of algebraic modelling is presented. The alge... | social behaviors;multi-agent systems;distributed task allocations;resource assignments;unified framework;social dynamics;social intelligence;algebraic modelling approach;distributed problem-solving | |
train_1115 | Four-point wavelets and their applications | Multiresolution analysis (MRA) and wavelets provide useful and efficient tools for representing functions at multiple levels of details. Wavelet representations have been used in a broad range of applications, including image compression, physical simulation and numerical analysis. In this paper, the authors construct ... | weight parameters;image compression;four-point wavelets;b-spline wavelets;linear time complexity;physical simulation;interpolatory four-point subdivision scheme;wavelet representations;numerical analysis;multiresolution analysis;scaling functions | |
train_1116 | An interlingua-based Chinese-English MT system | Chinese-English machine translation is a significant and challenging problem in information processing. The paper presents an interlingua-based Chinese-English natural language translation system (ICENT). It introduces the realization mechanism of Chinese language analysis, which contains syntactic parsing and semantic... | syntactic parsing;semantic analyzing;interlingua-based chinese-english machine translation system;information processing;natural language translation system | |
train_1117 | An attack-finding algorithm for security protocols | This paper proposes an automatic attack construction algorithm in order to find potential attacks on security protocols. It is based on a dynamic strand space model, which enhances the original strand space model by introducing active nodes on strands so as to characterize the dynamic procedure of protocol execution. W... | dolve-yao protocol;attack-finding algorithm;state space explosion;asynchronous composition;data subterms;dynamic strand space model;security protocols;strand-added on demand;strand space model;check subterms | |
train_1118 | Run-time data-flow analysis | Parallelizing compilers have made great progress in recent years. However, there still remains a gap between the current ability of parallelizing compilers and their final goals. In order to achieve the maximum parallelism, run-time techniques were used in parallelizing compilers during last few years. First, this pape... | dynamic parallelism;run-time data flow analysis;run-time dead code;parallelizing compilers;proteus test;backward data-flow information;run-time privatization method | |
train_1119 | A component-based software configuration management model and its supporting | system Software configuration management (SCM) is an important key technology in software development. Component-based software development (CBSD) is an emerging paradigm in software development. However, to apply CBSD effectively in real world practice, supporting SCM in CBSD needs to be further investigated. In this ... | integral logical constituents;software development;version control;component-based software configuration management model;software reuse | |
train_112 | Revisiting Hardy's paradox: Counterfactual statements, real measurements, | entanglement and weak values Hardy's (1992) paradox is revisited. Usually the paradox is dismissed on grounds of counterfactuality, i.e., because the paradoxical effects appear only when one considers results of experiments which do not actually take place. We suggest a new set of measurements in connection with Hardy'... | real measurements;gedanken-experiments;hardy paradox;entanglement;quantum mechanics;counterfactual statements;weak values;paradoxical effects | |
train_1120 | An effective feedback control mechanism for DiffServ architecture | As a scalable QoS (Quality of Service) architecture, Diffserv (Differentiated Service) mainly consists of two components: traffic conditioning at the edge of the Diffserv domain and simple packet forwarding inside the DiffServ domain. DiffServ has many advantages such as flexibility, scalability and simplicity. But whe... | diffserv;traffic conditioning;fairness;qos architecture;qos;tcp;af;feedback control;feedback mechanism;packet forwarding | |
train_1121 | Optimal bandwidth utilization of all-optical ring with a converter of degree 4 | In many models of all-optical routing, a set of communication paths in a network is given, and a wavelength is to be assigned to each path so that paths sharing an edge receive different wavelengths. The goal is to assign as few wavelengths as possible, in order to use the optical bandwidth efficiently. If a node of a ... | wavelength converter;all-optical network;all-optical ring;all-optical routing;wavelength translation;wavelength assignment;communication paths | |
train_1122 | Hybrid broadcast for the video-on-demand service | Multicast offers an efficient means of distributing video contents/programs to multiple clients by batching their requests and then having them share a server's video stream. Batching customers' requests is either client-initiated or server-initiated. Most advanced client-initiated video multicasts are implemented by p... | video-on-demand;hybrid broadcast scheme;conventional patching;quality-of-service;interactivity;scheduling;multicast;customer request rate | |
train_1123 | A transactional asynchronous replication scheme for mobile database systems | In mobile database systems, mobility of users has a significant impact on data replication. As a result, the various replica control protocols that exist today in traditional distributed and multidatabase environments are no longer suitable. To solve this problem, a new mobile database replication scheme, the Transacti... | mobile database replication;mobile computing;mobile database;conflict reconciliation;multidatabase;data replication;distributed database;transaction;transaction-level result-set propagation | |
train_1124 | Data extraction from the Web based on pre-defined schema | With the development of the Internet, the World Wide Web has become an invaluable information source for most organizations. However, most documents available from the Web are in HTML form which is originally designed for document formatting with little consideration of its contents. Effectively extracting data from su... | internet;schema;information source;html;distributed database;queries;wrapper generation;data integration;data extraction | |
train_1125 | Structure of weakly invertible semi-input-memory finite automata with delay 1 | Semi-input-memory finite automata, a kind of finite automata introduced by the first author of this paper for studying error propagation, are a generalization of input memory finite automata by appending an autonomous finite automaton component. In this paper, we give a characterization of the structure of weakly inver... | semi-input-memory;delay 1;weakly invertible;invertibility;feedforward inverse finite automata;semi-input-memory finite automata;state graph;finite automata | |
train_1126 | A note on an axiomatization of the core of market games | As shown by Peleg (1993), the core of market games is characterized by nonemptiness, individual rationality, superadditivity, the weak reduced game property, the converse reduced game property, and weak symmetry. It was not known whether weak symmetry was logically independent. With the help of a certain transitive 4-p... | market game core axiomatization;nonempty games;converse reduced game property;weak reduced game property;weak symmetry;individual rationality;redundant;superadditive games;transitive 4-person tu game | |
train_1127 | Repeated games with lack of information on one side: the dual differential | approach We introduce the dual differential game of a repeated game with lack of information on one side as the natural continuous time version of the dual game introduced by De Meyer (1996). A traditional way to study the value of differential games is through discrete time approximations. Here, we follow the opposite... | repeated games;discrete time;repeated game;viscosity solution;discrete time approximations;limit condition;limit value;dual differential game | |
train_1128 | The semi-algebraic theory of stochastic games | The asymptotic behavior of the min-max value of a finite-state zero-sum discounted stochastic game, as the discount rate approaches 0, has been studied in the past using the theory of real-closed fields. We use the theory of semi-algebraic sets and mappings to prove some asymptotic properties of the min-max value, whic... | min-max value;semi-algebraic set theory;finite-state zero-sum discounted stochastic game;n-stage game;asymptotic behavior;discount rate;two-player zero-sum finite-state stochastic games;uniform polynomial convergence rate | |
train_1129 | Computing stationary Nash equilibria of undiscounted single-controller | stochastic games Given a two-person, nonzero-sum stochastic game where the second player controls the transitions, we formulate a linear complementarity problem LCP(q, M) whose solution gives a Nash equilibrium pair of stationary strategies under the limiting average payoff criterion. The matrix M constructed is of the... | polymatrix stochastic games;stationary strategies;stationary nash equilibria;n-person stochastic games;undiscounted single-controller stochastic games;two-person nonzero-sum stochastic game;lemke algorithm;linear complementarity problem;copositive class matrix;limiting average payoff criterion | |
train_113 | Quantum limit on computational time and speed | We investigate if physical laws can impose limits on computational time and speed of a quantum computer built from elementary particles. We show that the product of the speed and the running time of a quantum computer is limited by the type of fundamental interactions present inside the system. This will help us to dec... | quantum computer;fundamental interactions;computational speed;quantum limit;computational time | |
train_1130 | Node-capacitated ring routing | We consider the node-capacitated routing problem in an undirected ring network along with its fractional relaxation, the node-capacitated multicommodity flow problem. For the feasibility problem, Farkas' lemma provides a characterization for general undirected graphs, asserting roughly that there exists such a flow if ... | double-cut condition;distance inequality;half-integral multicommodity flow;undirected graphs;node-capacitated multicommodity flow problem;violating double-cut;undirected ring network;integer-valued multicommodity flow;edge-cut criterion;fractional relaxation;node-capacitated routing problem;nonnegative node weights;fea... | |
train_1131 | A min-max theorem on feedback vertex sets | We establish a necessary and sufficient condition for the linear system {x : Hx >or= e, x >or= 0} associated with a bipartite tournament to be totally dual integral, where H is the cycle-vertex incidence matrix and e is the all-one vector. The consequence is a min-max relation on packing and covering cycles, together w... | combinatorial optimization problems;np-complete problem;min-max theorem;linear programming duality theory;feedback vertex sets;feedback vertex set problem;cycle-vertex incidence matrix;strongly polynomial time algorithms;all-one vector;totally dual integral system;linear system;cycle packing problem;graphs;bipartite to... | |
train_1132 | Semidefinite programming vs. LP relaxations for polynomial programming | We consider the global minimization of a multivariate polynomial on a semi-algebraic set Omega defined with polynomial inequalities. We then compare two hierarchies of relaxations, namely, LP relaxations based on products of the original constraints, in the spirit of the RLT procedure of Sherali and Adams (1990), and r... | real algebraic geometry;multivariate polynomial;polynomial inequalities;global minimization;semidefinite programming relaxations;rlt procedure;semi-algebraic set;reformulation linearization technique;polynomial programming;constraint products;lp relaxations | |
train_1133 | An analytic center cutting plane method for semidefinite feasibility problems | Semidefinite feasibility problems arise in many areas of operations research. The abstract form of these problems can be described as finding a point in a nonempty bounded convex body Gamma in the cone of symmetric positive semidefinite matrices. Assume that Gamma is defined by an oracle, which for any given m * m symm... | working set;approximate analytic center;operations research;analytic center cutting plane method;worst-case complexity;iteration;oracle;symmetric positive semidefinite matrices;nonempty bounded convex body;semidefinite feasibility problems;maximum ball radius | |
train_1134 | Relationship between strong monotonicity property, P/sub 2/-property, and the | GUS-property in semidefinite linear complementarity problems In a recent paper on semidefinite linear complementarity problems, Gowda and Song (2000) introduced and studied the P-property, P/sub 2/-property, GUS-property, and strong monotonicity property for linear transformation L: S/sup n/ to S/sup n/, where S/sup n/... | p/sub 2/-property;semidefinite linear complementarity problems;lyapunov transformations;strong monotonicity property;symmetric real matrices;linear transformation;gus-property | |
train_1135 | A combinatorial, graph-based solution method for a class of continuous-time | optimal control problems The paper addresses a class of continuous-time, optimal control problems whose solutions are typically characterized by both bang-bang and "singular" control regimes. Analytical study and numerical computation of such solutions are very difficult and far from complete when only techniques from ... | sequence-dependent manner;weighted graph nodes;shortest path algorithm;single-state problems;production planning problem;combinatorial search;combinatorial graph-based solution;numerical computation;singular control regimes;train operation problem;bang-bang control regimes;multiple control functions;continuous-time opt... | |
train_1136 | Q-learning for risk-sensitive control | We propose for risk-sensitive control of finite Markov chains a counterpart of the popular Q-learning algorithm for classical Markov decision processes. The algorithm is shown to converge with probability one to the desired solution. The proof technique is an adaptation of the o.d.e. approach for the analysis of stocha... | risk-sensitive control;stochastic approximation algorithms;classical markov decision processes;algorithm convergence;ordinary differential equations;dynamic programming;finite markov chains;proof technique;q-learning algorithm;reinforcement learning algorithms | |
train_1137 | On deciding stability of constrained homogeneous random walks and queueing | systems We investigate stability of scheduling policies in queueing systems. To this day no algorithmic characterization exists for checking stability of a given policy in a given queueing system. In this paper we introduce a certain generalized priority policy and prove that the stability of this policy is algorithmic... | scheduling policy stability;priority policy;generalized priority policy;undecidability results;queueing systems;homogeneous random walk stability;undecidable problem;first-in-first-out policy;constrained homogeneous random walks;fluid limit computation | |
train_1138 | Approximating martingales for variance reduction in Markov process simulation | "Knowledge of either analytical or numerical approximations should enable more efficient simulation estimators to be constructed." This principle seems intuitively plausible and certainly attractive, yet no completely satisfactory general methodology has been developed to exploit it. The authors present a new approach ... | variance reduction;performance measures;martingales;markov process simulation;approximating martingale-process method;complex stochastic processes;single-server queue;internal control variate | |
train_1139 | Development and evaluation of a case-based reasoning classifier for prediction | of breast biopsy outcome with BI-RADS/sup TM/ lexicon Approximately 70-85% of breast biopsies are performed on benign lesions. To reduce this high number of biopsies performed on benign lesions, a case-based reasoning (CBR) classifier was developed to predict biopsy results from BI-RADS/sup TM/ findings. We used 1433 (... | associated findings;calcification number;mass shape;bootstrap;hamming distance measure;mass density;calcification distribution;similarity thresholds;breast biopsy outcome;age;benign lesions;cbr similarity;calcification morphology;case-based reasoning classifier;influential features;euclidean distance measure;round robi... | |
train_114 | Cooperative three- and four-player quantum games | A cooperative multi-player quantum game played by 3 and 4 players has been studied. A quantum superposed operator is introduced in this work which solves the non-zero sum difficulty in previous treatments. The role of quantum entanglement of the initial state is discussed in detail | nonzero sum difficulty;quantum entanglement;quantum superposed operator;cooperative three-player quantum games;cooperative four-player quantum games;initial state | |
train_1140 | Computer aided classification of masses in ultrasonic mammography | Frequency compounding was recently investigated for computer aided classification of masses in ultrasonic B-mode images as benign or malignant. The classification was performed using the normalized parameters of the Nakagami distribution at a single region of interest at the site of the mass. A combination of normalize... | minimal clinical intervention;breast masses;computer aided classification;receiver operating characteristic;roc curve;frequency compounding;specificity;sensitivity;normalized parameters;ultrasonic b-mode images;ultrasonic mammography;weighted summation;normalized nakagami parameters;benign;single region of interest;nak... | |
train_1141 | Reproducibility of mammary gland structure during repeat setups in a supine | position Purpose: In breast conserving therapy, complete excision of the tumor with an acceptable cosmetic outcome depends on accurate localization in terms of both the position of the lesion and its extent. We hypothesize that preoperative contrast-enhanced magnetic resonance (MR) imaging of the patient in a supine po... | internal tissue shifts;mammary gland structure reproducibility;breast immobilization device;accurate tumor localization;localization methods;breast conserving therapy;repeat setups;reproducibility margins;contrast-enhanced magnetic resonance imaging;supine position | |
train_1142 | Fast and accurate leaf verification for dynamic multileaf collimation using an | electronic portal imaging device A prerequisite for accurate dose delivery of IMRT profiles produced with dynamic multileaf collimation (DMLC) is highly accurate leaf positioning. In our institution, leaf verification for DMLC was initially done with film and ionization chamber. To overcome the limitations of these met... | gray scale value profiles;electronic portal imaging device;intensity modulated radiation therapy profiles;two-dimensional method;ionization chamber;accurate leaf verification;leaf pair;ccd-camera based electronic portal imaging device;signal images;accurate dose delivery;leaf position errors;gantry angles;dynamic multi... | |
train_1143 | A three-source model for the calculation of head scatter factors | Accurate determination of the head scatter factor S/sub c/ is an important issue, especially for intensity modulated radiation therapy, where the segmented fields are often very irregular and much less than the collimator jaw settings. In this work, we report an S/sub c/ calculation algorithm for symmetric, asymmetric,... | target;intensity modulated radiation therapy;extra-focal photon sources;blocks;irregular open fields;segmented fields;head scatter factors;fields;source-to-chamber distance;collimator jaw settings;input data;primary collimator;calculation algorithm;asymmetric;source intensity distributions;lower collimator jaws;flatten... | |
train_1144 | Simultaneous iterative reconstruction of emission and attenuation images in | positron emission tomography from emission data only For quantitative image reconstruction in positron emission tomography attenuation correction is mandatory. In case that no data are available for the calculation of the attenuation correction factors one can try to determine them from the emission data alone. However... | thorax phantom;positron emission tomography attenuation correction;attenuation correction factors;crosstalk;activity distribution;statistical noise;iterative image reconstruction;one-dimensional newton-type algorithm;maximum likelihood estimator;image reconstruction;attenuation information;attenuation coefficients;smoo... | |
train_1145 | Mammogram synthesis using a 3D simulation. II. Evaluation of synthetic | mammogram texture We have evaluated a method for synthesizing mammograms by comparing the texture of clinical and synthetic mammograms. The synthesis algorithm is based upon simulations of breast tissue and the mammographic imaging process. Mammogram texture was synthesized by projections of simulated adipose tissue co... | cumulative distributions;x-ray image acquisition;computationally compressed phantom;synthetic images;retroareolar tissue regions;synthetic mammogram texture;adipose tissue compartments;breast tissue simulation;dense fibroglandular tissue regions;3d simulation;mammogram synthesis;fractal dimension;3d tissue distribution... | |
train_1146 | Mammogram synthesis using a 3D simulation. I. Breast tissue model and image | acquisition simulation A method is proposed for generating synthetic mammograms based upon simulations of breast tissue and the mammographic imaging process. A computer breast model has been designed with a realistic distribution of large and medium scale tissue structures. Parameters controlling the size and placement... | computer breast model;force values;rectangular slice approximation;linear young's moduli;composite beam model;tissue elasticity parameters;image acquisition simulation;breast lesions;monoenergetic parallel beam approximation;3d simulation;mammogram synthesis;breast tissue model;ducts;adipose compartments;mammographic c... | |
train_1147 | Angular disparity in ETACT scintimammography | Emission tuned aperture computed tomography (ETACT) has been previously shown to have the potential for the detection of small tumors (<1 cm) in scintimammography. However, the optimal approach to the application of ETACT in the clinic has yet to be determined. Therefore, we sought to determine the effect of the angula... | pinhole-to-tumor distances;computer simulation;image sets;hemispherical breast;angular disparity;spherical tumor;pinhole collimator;clinical choice;emission tuned aperture computed tomography scintimammography;ray tracing technique;pinhole-to-detector distances;tuned aperture computed tomography reconstruction method;i... | |
train_1148 | Benchmarking of the Dose Planning Method (DPM) Monte Carlo code using electron | beams from a racetrack microtron A comprehensive set of measurements and calculations has been conducted to investigate the accuracy of the Dose Planning Method (DPM) Monte Carlo code for dose calculations from 10 and 50 MeV scanned electron beams produced from a racetrack microtron. Central axis depth dose measurement... | two-dimensional beam profile;water phantom;50 mev;profile scans;racetrack microtron;10 mev;dose planning method monte carlo code;mcnp4b;ion chamber;source spatial distributions;scoring parameters;electron beam dose calculations;electron transport;in-air spatial distributions;scanned electron beams;benchmarking;central ... | |
train_1149 | Deterministic calculations of photon spectra for clinical accelerator targets | A method is proposed to compute photon energy spectra produced in clinical electron accelerator targets, based on the deterministic solution of the Boltzmann equation for coupled electron-photon transport in one-dimensional (1-D) slab geometry. It is shown that the deterministic method gives similar results as Monte Ca... | angular range of interest;coupled electron-photon transport;therapy applications;deterministic calculations;one-dimensional slab geometry;integrodifferential equation;3-d monte carlo methods;pencil beam source representations;linear accelerator;boltzmann equation;relative energy spectra;therapy planning;clinical electr... | |
train_115 | Non-optimal universal quantum deleting machine | We verify the non-existence of some standard universal quantum deleting machine. Then a non-optimal universal quantum deleting machine is constructed and we emphasize the difficulty for improving its fidelity. In a way, our results complement the universal quantum cloning machine established by Buzek and Hillery (1996)... | universal quantum cloning machine;nuqdm;fidelity;nonoptimal universal quantum deleting machine | |
train_1150 | Effect of multileaf collimator leaf width on physical dose distributions in the | treatment of CNS and head and neck neoplasms with intensity modulated radiation therapy The purpose of this work is to examine physical radiation dose differences between two multileaf collimator (MLC) leaf widths (5 and 10 mm) in the treatment of CNS and head and neck neoplasms with intensity modulated radiation thera... | physical dose distributions;conformal radiotherapy;optimization parameters;head and neck neoplasms;collimator rotation;acceptable tumor coverage;multileaf collimator leaf width;10 mm;intensity modulated radiation therapy;treatment planning;21.04 gy;cns neoplasms;5 mm;22.36 gy;cns tumors;beamlet size;parotid preservatio... | |
train_1151 | A method for geometrical verification of dynamic intensity modulated | radiotherapy using a scanning electronic portal imaging device In order to guarantee the safe delivery of dynamic intensity modulated radiotherapy (IMRT), verification of the leaf trajectories during the treatment is necessary. Our aim in this study is to develop a method for on-line verification of leaf trajectories u... | scanning read-out;liquid-filled ionization chambers;geometrical verification method;reference field edge;leaf trajectories;treatment planning;safe delivery;diaphragm positions;control system;dynamic multileaf collimator;dynamic intensity modulated radiotherapy;distorted field edges;motion distortion effects;dose distri... | |
train_1152 | Incorporating multi-leaf collimator leaf sequencing into iterative IMRT | optimization Intensity modulated radiation therapy (IMRT) treatment planning typically considers beam optimization and beam delivery as separate tasks. Following optimization, a multi-leaf collimator (MLC) or other beam delivery device is used to generate fluence patterns for patient treatment delivery. Due to limitati... | fluence patterns;empirical adjustment;objective function parameters;intensity modulated radiation therapy;newton method;beam delivery;treatment planning;deliverable dose distribution;iterative optimization;beam optimization;optimized intensity;gradient-based search algorithm;dose-volume objective values;tumor dose;mult... | |
train_1153 | Direct aperture optimization: A turnkey solution for step-and-shoot IMRT | IMRT treatment plans for step-and-shoot delivery have traditionally been produced through the optimization of intensity distributions (or maps) for each beam angle. The optimization step is followed by the application of a leaf-sequencing algorithm that translates each intensity map into a set of deliverable aperture s... | intensity distributions;leaf settings;monitor units;automated planning system;maps;beam segments;aperture intensities;optimization step;turnkey solution;leaf-sequencing algorithm;aperture optimization algorithm;direct aperture optimization;patient cases;aperture shapes;highly conformal step-and-shoot treatment plans;ml... | |
train_1154 | The effect of voxel size on the accuracy of dose-volume histograms of prostate | /sup 125/I seed implants Cumulative dose-volume histograms (DVH) are crucial in evaluating the quality of radioactive seed prostate implants. When calculating DVHs, the choice of voxel size is a compromise between computational speed (larger voxels) and accuracy (smaller voxels). We quantified the effect of voxel size ... | in-house computer program;cumulative dose-volume histograms;computational speed;/sup 125/i model;single-seed dose-volume histograms;hand-calculated dose-volume histograms;prostate /sup 125/i seed implants;voxel size;radioactive seed prostate implants;i;/sup 125/i prostate implant patients;variseed treatment planning so... | |
train_1155 | A leaf sequencing algorithm to enlarge treatment field length in IMRT | With MLC-based IMRT, the maximum usable field size is often smaller than the maximum field size for conventional treatments. This is due to the constraints of the overtravel distances of MLC leaves and/or jaws. Using a new leaf sequencing algorithm, the usable IMRT field length (perpendicular to the MLC motion) can be ... | intensity pattern;commercial treatment planning system;usable intensity modulated radiation therapy field length;multileaf collimators jaws;leaf-sequencing direction;overtravel distances;random patterns;jaw overtravel limits;leaf sequencing algorithm;upper jaw overtravel limit;step and shoot delivery method;intensity e... | |
train_1156 | Favorable noise uniformity properties of Fourier-based interpolation and | reconstruction approaches in single-slice helical computed tomography Volumes reconstructed by standard methods from single-slice helical computed tomography (CT) data have been shown to have noise levels that are highly nonuniform relative to those in conventional CT. These noise nonuniformities can affect low-contras... | maximum intensity projection images;low-contrast object detectability;fourier-based fan-to-parallel rebinning algorithm;fourier-based interpolation;reconstruction approaches;helical span geometry;single-slice helical computed tomography;noise uniformity properties;medical diagnostic imaging;more uniform noise ratios;ze... | |
train_1157 | Portal dose image prediction for dosimetric treatment verification in | radiotherapy. II. An algorithm for wedged beams A method is presented for calculation of a two-dimensional function, T/sub wedge/(x,y), describing the transmission of a wedged photon beam through a patient. This in an extension of the method that we have published for open (nonwedged) fields [Med. Phys. 25, 830-840 (19... | virtual wedges;slab phantom;portal dose image prediction;irradiation geometry;thorax phantom;electronic portal imaging devices;dosimetric treatment verification;high energy photon beams;fluoroscopic ccd camera;transmission dosimetry;6 mv;wedged photon beam;radiotherapy;in vivo dosimetry;open beams;low energy photon bea... | |
train_1158 | From powder to perfect parts | GKN Sinter Metals has increased productivity and quality by automating the powder metal lines that produce its transmission parts | gkn sinter metals;automating;robotic systems;gentle transfer units;powder metal lines;conveyors | |
train_1159 | Sigma -admissible families over linear orders | Admissible sets of the form HYP(M), where M is a recursively saturated system, are treated. We provide descriptions of subsets M, which are Sigma /sub */-sets in HYP(M), and of families of subsets M, which form Sigma -regular families in HYP(M), in terms of the concept of being fundamental couched in the article. Funda... | dense linear orderings;sigma -admissible families;linear orders;recursively saturated system;hyp(m);fundamental subsets | |
train_116 | Frontier between separability and quantum entanglement in a many spin system | We discuss the critical point x/sub c/ separating the quantum entangled and separable states in two series of N spins S in the simple mixed state characterized by the matrix operator rho = x| phi >< phi |+1-x/D/sup N/I/sub D/N, where x in [0, 1], D = 2S + 1, I/sub D/N is the D/sup N/ * D/sup N/ unity matrix and | phi >... | teleportation;critical point;entangled state;werner density matrices;many spin system;einstein-podolsky-rosen state;quantum entanglement;random spin;partial transposition method;quantum computing;cryptography;separable states;separability;charge conjugation;nonextensive entropy criterion;unity matrix;matrix operator | |
train_1160 | Monoids all polygons over which are omega -stable: proof of the Mustafin-Poizat | conjecture A monoid S is called an omega -stabilizer (superstabilizer, or stabilizer) if every S-polygon has an omega -stable (superstable, or stable) theory. It is proved that every omega -stabilizer is a regular monoid. This confirms the Mustafin-Poizat conjecture and allows us to end up the description of omega -sta... | mustafin-poizat conjecture;regular monoid;s-polygon;monoids all polygons;omega -stabilizer | |
train_1161 | Model theory for hereditarily finite superstructures | We study model-theoretic properties of hereditarily finite superstructures over models of not more than countable signatures. A question is answered in the negative inquiring whether theories of hereditarily finite superstructures which have a unique (up to isomorphism) hereditarily finite superstructure can be describ... | countable signatures;iterated families;countable hereditarily finite superstructure;finitely many complete subsets;definable union;model theory;model-theoretic properties | |
train_1162 | Recognition of finite simple groups S/sub 4/(q) by their element orders | It is proved that among simple groups S/sub 4/(q) in the class of finite-groups, only the groups S/sub 4/(3/sup n/), where n is an odd number greater than unity, are recognizable by a set of their element orders. It is also shown that simple groups U/sub 3/(9), /sup 3/D/sub 4/(2), G/sub 2/(4), S/sub 6/(3), F/sub 4/(2),... | divisibility relation;element orders;finite simple groups recognition | |
train_1163 | Evaluating the complexity of index sets for families of general recursive | functions in the arithmetic hierarchy The complexity of index sets of families of general recursive functions is evaluated in the Kleene-Mostowski arithmetic hierarchy | general recursive functions;kleene-mostowski arithmetic hierarchy;index sets complexity;arithmetic hierarchy | |
train_1164 | Friedberg numberings of families of n-computably enumerable sets | We establish a number of results on numberings, in particular, on Friedberg numberings, of families of d.c.e. sets. First, it is proved that there exists a Friedberg numbering of the family of all d.c.e. sets. We also show that this result, patterned on Friedberg's famous theorem for the family of all c.e. sets, holds ... | computability theory;infinite family;friedberg numberings;families of n-computably enumerable sets | |
train_1165 | Recognizing groups G/sub 2/(3/sup n/) by their element orders | It is proved that a finite group that is isomorphic to a simple non-Abelian group G = G/sub 2/(3/sup n/) is, up to isomorphism, recognized by a set omega (G) of its element orders, that is, H approximately= G if omega (H) = omega (G) for some finite group H | element orders;isomorphism;finite group | |
train_1166 | Embedding the outer automorphism group Out(F/sub n/) of a free group of rank n | in the group Out(F/sub m/) for m > n It is proved that for every n >or= 1, the group Out(F/sub n/) is embedded in the group Out(F/sub m/) with m = 1 + (n - 1)k/sup n/, where k is an arbitrary natural number coprime to n - 1 | free group;outer automorphism group embedding;arbitrary natural number coprime | |
train_1167 | A new approach to the d-MC problem | Many real-world systems are multi-state systems composed of multi-state components in which the reliability can be computed in terms of the lower bound points of level d, called d-Mincuts (d-MCs). Such systems (electric power, transportation, etc.) may be regarded as flow networks whose arcs have independent, discrete,... | multi-state systems;time bounds;max-flow/min-cut;flow networks;multi-state components;d-mc problem;reliability computation;failure analysis algorithm;d-mincuts | |
train_1168 | Computing failure probabilities. Applications to reliability analysis | The paper presents one method for calculating failure probabilities with applications to reliability analysis. The method is based on transforming the initial set of variables to a n-dimensional uniform random variable in the unit hypercube, together with the limit condition set and calculating the associated probabili... | multiple integrals calculation;gauss-legendre quadrature formulae;n-dimensional uniform random variable;recursive method;tail approximation;limit condition;reliability analysis applications;failure probabilities computation;unit hypercube | |
train_1169 | An efficient algorithm for sequential generation of failure states in a network | with multi-mode components In this work, a new algorithm for the sequential generation of failure states in a network with multi-mode components is proposed. The algorithm presented in the paper transforms the state enumeration problem into a K-shortest paths problem. Taking advantage of the inherent efficiency of an a... | multi-mode components reliability;sequential failure states generation algorithm;network failure states;cpu time;state enumeration problem;k-shortest paths problem | |
train_117 | Multiresolution Markov models for signal and image processing | Reviews a significant component of the rich field of statistical multiresolution (MR) modeling and processing. These MR methods have found application and permeated the literature of a widely scattered set of disciplines, and one of our principal objectives is to present a single, coherent picture of this framework. A ... | multigrid methods;1/f processes;multiresolution markov models;wavelets;statistical multiresolution modeling;pyramidally organized trees;self-similar processes | |
train_1170 | Upper bound analysis of oblique cutting with nose radius tools | A generalized upper bound model for calculating the chip flow angle in oblique cutting using flat-faced nose radius tools is described. The projection of the uncut chip area on the rake face is divided into a number of elements parallel to an assumed chip flow direction. The length of each of these elements is used to ... | friction area;uncut chip area;nose radius tools;chip velocity;chip flow angle;shear surface;upper bound analysis;oblique cutting;shear velocity | |
train_1171 | Manufacturing data analysis of machine tool errors within a contemporary small | manufacturing enterprise The main focus of the paper is directed at the determination of manufacturing errors within the contemporary smaller manufacturing enterprise sector. The manufacturing error diagnosis is achieved through the manufacturing data analysis of the results obtained from the inspection of the componen... | machine tool errors;milling type operations;fixturing errors;knowledge acquisition;feature-based approach;forward chaining expert system;conceptual structure;operating procedure;2 1/2d components;3-axis vertical machining centre;knowledge representation;manufacturing data analysis;co-ordinate measuring machine;inspecti... | |
train_1172 | Marble cutting with single point cutting tool and diamond segments | An investigation has been undertaken into the frame sawing with diamond blades. The kinematic behaviour of the frame sawing process is discussed. Under different cutting conditions, cutting and indenting-cutting tests are carried out by single point cutting tools and single diamond segments. The results indicate that t... | indenting-cutting tests;residual plastic deformation;cutting tests;diamond segments;fracture theory;kinematic behaviour;single point cutting tool;frame sawing;marble cutting;fracture chipping;removal processes;brittle material indentation | |
train_1173 | A comprehensive chatter prediction model for face turning operation including | tool wear effect Presents a three-dimensional mechanistic frequency domain chatter model for face turning processes, that can account for the effects of tool wear including process damping. New formulations are presented to model the variation in process damping forces along nonlinear tool geometries such as the nose r... | flank wear;tool wear effect;chatter prediction model;face turning operation;axial directions;process damping;three-dimensional mechanistic frequency domain chatter model;radial directions;stability boundaries | |
train_1174 | Optimization of cutting conditions for single pass turning operations using a | deterministic approach An optimization analysis, strategy and CAM software for the selection of economic cutting conditions in single pass turning operations are presented using a deterministic approach. The optimization is based on criteria typified by the maximum production rate and includes a host of practical const... | deterministic approach;economic cutting conditions;process planning;cam software;cutting conditions optimization;constrained economic trends;maximum production rate;mathematical analyses;single pass turning operations | |
train_1175 | Prediction of tool and chip temperature in continuous and interrupted machining | A numerical model based on the finite difference method is presented to predict tool and chip temperature fields in continuous machining and time varying milling processes. Continuous or steady state machining operations like orthogonal cutting are studied by modeling the heat transfer between the tool and chip at the ... | primary zone;heat transfer;finite difference method;tool temperature prediction;interrupted machining;thermal properties;tool-rake face contact zone;orthogonal cutting;continuous machining;temperature distribution;time varying milling processes;friction energy;shear energy;numerical model;chip temperature prediction;fi... | |
train_1176 | A summary of methods applied to tool condition monitoring in drilling | Presents a summary of the monitoring methods, signal analysis and diagnostic techniques for tool wear and failure monitoring in drilling that have been tested and reported in the literature. The paper covers only indirect monitoring methods such as force, vibration and current measurements. Signal analysis techniques c... | tool wear;force measurements;indirect monitoring methods;diagnostic techniques;failure monitoring;wavelet transform;current measurements;vibration measurements;automatic diagnostic tools;tool condition monitoring;fast fourier transform;drilling;signal analysis;monitoring methods;statistical parameters | |
train_1177 | Comparative statistical analysis of hole taper and circularity in laser | percussion drilling Investigates the relationships and parameter interactions between six controllable variables on the hole taper and circularity in laser percussion drilling. Experiments have been conducted on stainless steel workpieces and a comparison was made between stainless steel and mild steel. The central com... | pulse frequency;laser percussion drilling;analysis of variance;central composite design;anova;mild steel;equivalent entrance diameter;laser pulse width;ferets diameter;process performance;complete residual analysis;linear multiple regression technique;stepwise regression method;hole taper;least squares procedure;stainl... | |
train_1178 | Network-centric systems | The author describes a graduate-level course that addresses cutting-edge issues in network-centric systems while following a more traditional graduate seminar format | graduate level course;network-centric systems | |
train_1179 | Evolution complexity of the elementary cellular automaton rule 18 | Cellular automata are classes of mathematical systems characterized by discreteness (in space, time, and state values), determinism, and local interaction. Using symbolic dynamical theory, we coarse-grain the temporal evolution orbits of cellular automata. By means of formal languages and automata theory, we study the ... | elementary cellular automaton;formal languages;complexity;cellular automata;evolution complexity;symbolic dynamical theory | |
train_118 | Sensorless control of induction motor drives | Controlled induction motor drives without mechanical speed sensors at the motor shaft have the attractions of low cost and high reliability. To replace the sensor the information on the rotor speed is extracted from measured stator voltages and currents at the motor terminals. Vector-controlled drives require estimatin... | induction motor drives;model parameter variations;vector-controlled drives;closed-loop observers;stator voltages;space vector quantities;robustness;sensorless control;steady-state speed accuracy;signal flow graphs;stator currents;parasitic effects;open-loop estimators;spatial orientation;fundamental magnetic flux waves... | |
train_1180 | Decomposition of additive cellular automata | Finite additive cellular automata with fixed and periodic boundary conditions are considered as endomorphisms over pattern spaces. A characterization of the nilpotent and regular parts of these endomorphisms is given in terms of their minimal polynomials. Generalized eigenspace decomposition is determined and relevant ... | endomorphisms;cellular automata;finite cellular automaton;computational complexity;transition diagram | |
train_1181 | Dynamic neighborhood structures in parallel evolution strategies | Parallelizing is a straightforward approach to reduce the total computation time of evolutionary algorithms. Finding an appropriate communication network within spatially structured populations for improving convergence speed and convergence probability is a difficult task. A new method that uses a dynamic communicatio... | multimodal test function;parallelizing;convergence speed;convergence probability;parallel evolutionary algorithms;evolutionary algorithms | |
train_1182 | Optimization of the memory weighting function in stochastic functional | self-organized sorting performed by a team of autonomous mobile agents The activity of a team of autonomous mobile agents formed by identical "robot-like-ant" individuals capable of performing a random walk through an environment that are able to recognize and move different "objects" is modeled. The emergent desired b... | autonomous mobile agents;algorithm optimization;random walk;sorting;memory weighting function;clustering |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.