{"name": "train_100", "title": "Separate accounts go mainstream [investment]", "abstract": "New entrants are shaking up the separate-account industry by supplying Web-based platforms that give advisers the tools to pick independent money managers", "fulltext": "", "keywords": "separate-account industry;web-based platforms;investment;financial advisors;independent money managers"}
{"name": "train_1000", "title": "Does classicism explain universality? Arguments against a pure classical", "abstract": "component of mind One of the hallmarks of human cognition is the capacity to generalize over arbitrary constituents. Marcus (Cognition 66, p.153; Cognitive Psychology 37, p. 243, 1998) argued that this capacity, called \"universal generalization\" (universality), is not supported by connectionist models. Instead, universality is best explained by classical symbol systems, with connectionism as its implementation. Here it is argued that universality is also a problem for classicism in that the syntax-sensitive rules that are supposed to provide causal explanations of mental processes are either too strict, precluding possible generalizations; or too lax, providing no information as to the appropriate alternative. Consequently, universality is not explained by a classical theory", "fulltext": "", "keywords": "human cognition;connectionist models;classicism;universal generalization;mental processes;universality;syntax-sensitive rules;classical component of mind;causal explanations;classical symbol systems"}
{"name": "train_1001", "title": "A conflict between language and atomistic information", "abstract": "Fred Dretske and Jerry Fodor are responsible for popularizing three well-known theses in contemporary philosophy of mind: the thesis of Information-Based Semantics (IBS), the thesis of Content Atomism (Atomism) and the thesis of the Language of Thought (LOT). LOT concerns the semantically relevant structure of representations involved in cognitive states such as beliefs and desires. It maintains that all such representations must have syntactic structures mirroring the structure of their contents. IBS is a thesis about the nature of the relations that connect cognitive representations and their parts to their contents (semantic relations). It holds that these relations supervene solely on relations of the kind that support information content, perhaps with some help from logical principles of combination. Atomism is a thesis about the nature of the content of simple symbols. It holds that each substantive simple symbol possesses its content independently of all other symbols in the representational system. I argue that Dretske's and Fodor's theories are false and that their falsehood results from a conflict IBS and Atomism, on the one hand, and LOT, on the other", "fulltext": "", "keywords": "desires;ibs;cognitive states;beliefs;information-based semantics;language of thought;lot;philosophy of mind;content atomism"}
{"name": "train_1002", "title": "Selective representing and world-making", "abstract": "We discuss the thesis of selective representing-the idea that the contents of the mental representations had by organisms are highly constrained by the biological niches within which the organisms evolved. While such a thesis has been defended by several authors elsewhere, our primary concern here is to take up the issue of the compatibility of selective representing and realism. We hope to show three things. First, that the notion of selective representing is fully consistent with the realist idea of a mind-independent world. Second, that not only are these two consistent, but that the latter (the realist conception of a mind-independent world) provides the most powerful perspective from which to motivate and understand the differing perceptual and cognitive profiles themselves. Third, that the (genuine and important) sense in which organism and environment may together constitute an integrated system of scientific interest poses no additional threat to the realist conception", "fulltext": "", "keywords": "organisms;mind-independent world;selective representing;realism;cognitive profiles;mental representations;world-making"}
{"name": "train_1003", "title": "Lob's theorem as a limitation on mechanism", "abstract": "We argue that Lob's Theorem implies a limitation on mechanism. Specifically, we argue, via an application of a generalized version of Lob's Theorem, that any particular device known by an observer to be mechanical cannot be used as an epistemic authority (of a particular type) by that observer: either the belief-set of such an authority is not mechanizable or, if it is, there is no identifiable formal system of which the observer can know (or truly believe) it to be the theorem-set. This gives, we believe, an important and hitherto unnoticed connection between mechanism and the use of authorities by human-like epistemic agents", "fulltext": "", "keywords": "theorem-set;human-like epistemic agents;lob theorem;belief-set;limitation on mechanism;formal system;epistemic authority"}
{"name": "train_1004", "title": "Games machines play", "abstract": "Individual rationality, or doing what is best for oneself, is a standard model used to explain and predict human behavior, and von Neumann-Morgenstern game theory is the classical mathematical formalization of this theory in multiple-agent settings. Individual rationality, however, is an inadequate model for the synthesis of artificial social systems where cooperation is essential, since it does not permit the accommodation of group interests other than as aggregations of individual interests. Satisficing game theory is based upon a well-defined notion of being good enough, and does accommodate group as well as individual interests through the use of conditional preference relationships, whereby a decision maker is able to adjust its preferences as a function of the preferences, and not just the options, of others. This new theory is offered as an alternative paradigm to construct artificial societies that are capable of complex behavior that goes beyond exclusive self interest", "fulltext": "", "keywords": "cooperation;game theory;conditional preference relationships;human behavior;multiple-agent;decision theory;group rationality;artificial social systems;individual rationality;self interest;artificial societies"}
{"name": "train_1005", "title": "The average-case identifiability and controllability of large scale systems", "abstract": "Needs for increased product quality, reduced pollution, and reduced energy and material consumption are driving enhanced process integration. This increases the number of manipulated and measured variables required by the control system to achieve its objectives. This paper addresses the question of whether processes tend to become increasingly more difficult to identify and control as the process dimension increases. Tools and results of multivariable statistics are used to show that, under a variety of assumed distributions on the elements, square processes of higher dimension tend to be more difficult to identify and control, whereas the expected controllability and identifiability of nonsquare processes depends on the relative numbers of measured and manipulated variables. These results suggest that the procedure of simplifying the control problem so that only a square process is considered is a poor practice for large scale systems", "fulltext": "", "keywords": "process control;chemical engineering;large scale systems;process identification;average-case controllability;high dimension square processes;multivariable statistics;manipulated variables;monte carlo simulations;measured variables;average-case identifiability;enhanced process integration;nonsquare processes"}
{"name": "train_1006", "title": "Robust model-order reduction of complex biological processes", "abstract": "This paper addresses robust model-order reduction of a high dimensional nonlinear partial differential equation (PDE) model of a complex biological process. Based on a nonlinear, distributed parameter model of the same process which was validated against experimental data of an existing, pilot-scale biological nutrient removal (BNR) activated sludge plant, we developed a state-space model with 154 state variables. A general algorithm for robustly reducing the nonlinear PDE model is presented and, based on an investigation of five state-of-the-art model-order reduction techniques, we are able to reduce the original model to a model with only 30 states without incurring pronounced modelling errors. The singular perturbation approximation balanced truncating technique is found to give the lowest modelling errors in low frequency ranges and hence is deemed most suitable for controller design and other real-time applications", "fulltext": "", "keywords": "state-space model;nonlinear distributed parameter model;modelling errors;complex biological processes;pilot-scale bnr activated sludge plant;biological nutrient removal activated sludge processes;hankel singular values;high dimensional nonlinear partial differential equation model;singular perturbation approximation balanced truncating technique;controller design;robust model-order reduction"}
{"name": "train_1007", "title": "Conditions for decentralized integral controllability", "abstract": "The term decentralized integral controllability (DIC) pertains to the existence of stable decentralized controllers with integral action that have closed-loop properties such as stable independent detuning. It is especially useful to select control structures systematically at the early stage of control system design because the only information needed for DIC is the steady-state process gain matrix. Here, a necessary and sufficient condition conjectured in the literature is proved. The real structured singular value which can exploit realness of the controller gain is used to describe computable conditions for DIC. The primary usage of DIC is to eliminate unworkable pairings. For this, two other simple necessary conditions are proposed. Examples are given to illustrate the effectiveness of the proposed conditions for DIC", "fulltext": "", "keywords": "systematic control structure selection;unworkable pairing elimination;stable independent detuning;real structured singular value;controller gain realness;necessary sufficient conditions;steady-state process gain matrix;closed-loop properties;integral action;stable decentralized controllers;control system design;schur complement;decentralized integral controllability"}
{"name": "train_1008", "title": "Quadratic programming algorithms for large-scale model predictive control", "abstract": "Quadratic programming (QP) methods are an important element in the application of model predictive control (MPC). As larger and more challenging MPC applications are considered, more attention needs to be focused on the construction and tailoring of efficient QP algorithms. In this study, we tailor and apply a new QP method, called QPSchur, to large MPC applications, such as cross directional control problems in paper machines. Written in C++, QPSchur is an object oriented implementation of a novel dual space, Schur complement algorithm. We compare this approach to three widely applied QP algorithms and show that QPSchur is significantly more efficient (up to two orders of magnitude) than the other algorithms. In addition, detailed simulations are considered that demonstrate the importance of the flexible, object oriented construction of QPSchur, along with additional features for constraint handling, warm starts and partial solution", "fulltext": "", "keywords": "cross directional control problems;quadratic programming algorithms;dual space schur complement algorithm;constraint handling;partial solution;flexible object oriented construction;warm starts;simulations;large-scale model predictive control;qpschur;object oriented implementation;paper machines"}
{"name": "train_1009", "title": "Robust output feedback model predictive control using off-line linear matrix", "abstract": "inequalities A fundamental question about model predictive control (MPC) is its robustness to model uncertainty. In this paper, we present a robust constrained output feedback MPC algorithm that can stabilize plants with both polytopic uncertainty and norm-bound uncertainty. The design procedure involves off-line design of a robust constrained state feedback MPC law and a state estimator using linear matrix inequalities (LMIs). Since we employ an off-line approach for the controller design which gives a sequence of explicit control laws, we are able to analyze the robust stabilizability of the combined control laws and estimator, and by adjusting the design parameters, guarantee robust stability of the closed-loop system in the presence of constraints. The algorithm is illustrated with two examples", "fulltext": "", "keywords": "model uncertainty robustness;explicit control law sequence;closed-loop system;robust constrained state feedback mpc law;robust constrained output feedback mpc algorithm;off-line linear matrix inequalities;robust output feedback model predictive control;asymptotically stable invariant ellipsoid;polytopic uncertainty;norm-bound uncertainty;controller design procedure;state estimator"}
{"name": "train_1010", "title": "Robust self-tuning PID controller for nonlinear systems", "abstract": "In this paper, we propose a robust self-tuning PID controller suitable for nonlinear systems. The control system employs a preload relay (P_Relay) in series with a PID controller. The P_Relay ensures a high gain to yield a robust performance. However, it also incurs a chattering phenomenon. In this paper, instead of viewing the chattering as an undesirable yet inevitable feature, we use it as a naturally occurring signal for tuning and re-tuning the PID controller as the operating regime digresses. No other explicit input signal is required. Once the PID controller is tuned for a particular operating point, the relay may be disabled and chattering ceases correspondingly. However, it is invoked when there is a change in setpoint to another operating regime. In this way, the approach is also applicable to time-varying systems as the PID tuning can be continuous, based on the latest set of chattering characteristics. Analysis is provided on the stability properties of the control scheme. Simulation results for the level control of fluid in a spherical tank using the scheme are also presented", "fulltext": "", "keywords": "robust performance;stability properties;relay disabling;controller re-tuning;robust self-tuning pid controller;simulation results;fluid level control;operating regime;time-varying systems;continuous tuning;controller tuning;chattering phenomenon;naturally occurring signal;nonlinear systems;spherical tank;preload relay"}
{"name": "train_1011", "title": "A self-organizing context-based approach to the tracking of multiple robot", "abstract": "trajectories We have combined competitive and Hebbian learning in a neural network designed to learn and recall complex spatiotemporal sequences. In such sequences, a particular item may occur more than once or the sequence may share states with another sequence. Processing of repeated/shared states is a hard problem that occurs very often in the domain of robotics. The proposed model consists of two groups of synaptic weights: competitive interlayer and Hebbian intralayer connections, which are responsible for encoding respectively the spatial and temporal features of the input sequence. Three additional mechanisms allow the network to deal with shared states: context units, neurons disabled from learning, and redundancy used to encode sequence states. The network operates by determining the current and the next state of the learned sequences. The model is simulated over various sets of robot trajectories in order to evaluate its storage and retrieval abilities; its sequence sampling effects; its robustness to noise and its tolerance to fault", "fulltext": "", "keywords": "hebbian intralayer connections;context units;self-organizing context-based approach;competitive learning;sequence sampling effects;shared states;unsupervised learning;sequence states;trajectories tracking;storage abilities;robot trajectories;fault tolerance;synaptic weights;retrieval abilities;complex spatiotemporal sequences;competitive interlayer connections;hebbian learning"}
{"name": "train_1012", "title": "Evolving receptive-field controllers for mobile robots", "abstract": "The use of evolutionary methods to generate controllers for real-world autonomous agents has attracted attention. Most of the pertinent research has employed genetic algorithms or variations thereof. Research has applied an alternative evolutionary method, evolution strategies, to the generation of simple Braitenberg vehicles. This application accelerates the development of such controllers by more than an order of magnitude (a few hours compared to more than two days). Motivated by this useful speedup, the paper investigates the evolution of more complex architectures, receptive-field controllers, that can employ nonlinear interactions and, therefore, can yield more complex behavior. It is interesting to note that the evolution strategy yields the same efficacy in terms of function evaluations, even though the second class of controllers requires up to 10 times more parameters than the simple Braitenberg architecture. In addition to the speedup, there is an important theoretical reason for preferring an evolution strategy over a genetic algorithm for this problem, namely the presence of epistasis", "fulltext": "", "keywords": "evolutionary methods;simple braitenberg vehicles;scalability;nonlinear interactions;complex behavior;evolution strategies;real-world autonomous agents;mobile robots;radial basis functions;receptive-field controllers"}
{"name": "train_1013", "title": "A scalable intelligent takeoff controller for a simulated running jointed leg", "abstract": "Running with jointed legs poses a difficult control problem in robotics. Neural controllers are attractive because they allow the robot to adapt to changing environmental conditions. However, scalability is an issue with many neural controllers. The paper describes the development of a scalable neurofuzzy controller for the takeoff phase of the running stride. Scalability is achieved by selecting a controller whose size does not grow with the dimensionality of the problem. Empirical results show that with proper design the takeoff controller scales from a leg with a single movable link to one with three movable links without a corresponding growth in size and without a loss of accuracy", "fulltext": "", "keywords": "neural controllers;scalability;simulated running jointed leg;intelligent robotic control;running stride;scalable neurofuzzy controller;changing environmental conditions;takeoff phase;scalable intelligent takeoff controller"}
{"name": "train_1014", "title": "Modelling of complete robot dynamics based on a multi-dimensional, RBF-like", "abstract": "neural architecture A neural network based identification approach of manipulator dynamics is presented. For a structured modelling, RBF-like static neural networks are used in order to represent and adapt all model parameters with their non-linear dependences on the joint positions. The neural architecture is hierarchically organised to reach optimal adjustment to structural a priori-knowledge about the identification problem. The model structure is substantially simplified by general system analysis independent of robot type. But also a lot of specific features of the utilised experimental robot are taken into account. A fixed, grid based neuron placement together with application of B-spline polynomial basis functions is utilised favourably for a very effective recursive implementation of the neural architecture. Thus, an online identification of a dynamic model is submitted for a complete 6 joint industrial robot", "fulltext": "", "keywords": "complete 6 joint industrial robot;online identification;fixed grid based neuron placement;online learning;multi-dimensional rbf-like neural architecture;recursive implementation;manipulator dynamics;general system analysis;neural architecture;complete robot dynamics;static neural networks;dynamic model;b-spline polynomial basis functions"}
{"name": "train_1015", "title": "Scalable techniques from nonparametric statistics for real time robot learning", "abstract": "Locally weighted learning (LWL) is a class of techniques from nonparametric statistics that provides useful representations and training algorithms for learning about complex phenomena during autonomous adaptive control of robotic systems. The paper introduces several LWL algorithms that have been tested successfully in real-time learning of complex robot tasks. We discuss two major classes of LWL, memory-based LWL and purely incremental LWL that does not need to remember any data explicitly. In contrast to the traditional belief that LWL methods cannot work well in high-dimensional spaces, we provide new algorithms that have been tested on up to 90 dimensional learning problems. The applicability of our LWL algorithms is demonstrated in various robot learning examples, including the learning of devil-sticking, pole-balancing by a humanoid robot arm, and inverse-dynamics learning for a seven and a 30 degree-of-freedom robot. In all these examples, the application of our statistical neural networks techniques allowed either faster or more accurate acquisition of motor control than classical control engineering", "fulltext": "", "keywords": "real time robot learning;purely incremental learning;autonomous adaptive control;scalable techniques;memory-based learning;inverse-dynamics learning;nonparametric regression;locally weighted learning;humanoid robot arm;pole-balancing;devil-sticking;nonparametric statistics;complex phenomena;statistical neural networks techniques;training algorithms"}
{"name": "train_1016", "title": "A scalable model of cerebellar adaptive timing and sequencing: the recurrent", "abstract": "slide and latch (RSL) model From the dawn of modern neural network theory, the mammalian cerebellum has been a favored object of mathematical modeling studies. Early studies focused on the fanout, convergence, thresholding, and learned weighting of perceptual-motor signals within the cerebellar cortex. This led to the still viable idea that the granule cell stage in the cerebellar cortex performs a sparse expansive recoding of the time-varying input vector. This recoding reveals and emphasizes combinations in a distributed representation that serves as a basis for the learned, state-dependent control actions engendered by cerebellar outputs to movement related centers. To make optimal use of available signals, the cerebellum must be able to sift the evolving state representation for the most reliable predictors of the need for control actions, and to use those predictors even if they appear only transiently and well in advance of the optimal time for initiating the control action. The paper proposes a modification to prior, population, models for cerebellar adaptive timing and sequencing. Since it replaces a population with a single element, the proposed RSL model is in one sense maximally efficient, and therefore optimal from the perspective of scalability", "fulltext": "", "keywords": "recurrent slide and latch model;recurrent network;sparse expansive recoding;mammalian cerebellum;cerebellar sequencing;time-varying input vector;cerebellar adaptive timing;scalable model;neural network theory;granule cell stage;distributed representation"}
{"name": "train_1017", "title": "Searching a scalable approach to cerebellar based control", "abstract": "Decades of research into the structure and function of the cerebellum have led to a clear understanding of many of its cells, as well as how learning might take place. Furthermore, there are many theories on what signals the cerebellum operates on, and how it works in concert with other parts of the nervous system. Nevertheless, the application of computational cerebellar models to the control of robot dynamics remains in its infant state. To date, few applications have been realized. The currently emerging family of light-weight robots poses a new challenge to robot control: due to their complex dynamics traditional methods, depending on a full analysis of the dynamics of the system, are no longer applicable since the joints influence each other dynamics during movement. Can artificial cerebellar models compete here?", "fulltext": "", "keywords": "nervous system;light-weight robots;cerebellar based control;robot control;computational cerebellar models;scalable approach"}
{"name": "train_1018", "title": "Fabrication of polymeric microlens of hemispherical shape using micromolding", "abstract": "Polymeric microlenses play an important role in reducing the size, weight, and cost of optical data storage and optical communication systems. We fabricate polymeric microlenses using the microcompression molding process. The design and fabrication procedures for mold insertion is simplified using silicon instead of metal. PMMA powder is used as the molding material. Governed by process parameters such as temperature and pressure histories, the micromolding process is controlled to minimize various defects that develop during the molding process. The radius of curvature and magnification ratio of fabricated microlens are measured as 150 mu m and over 3.0, respectively", "fulltext": "", "keywords": "microcompression molding process;weight;optical communication systems;size;fabrication procedures;optical data storage;molding material;design procedures;temperature;polymeric microlens fabrication;micromolding;mold insertion;cost;micromolding process;pressure;process parameters;300 micron;magnification ratio;polymeric microlenses;pmma powder;silicon;hemispherical shape microlens"}
{"name": "train_1019", "title": "Optical setup and analysis of disk-type photopolymer high-density holographic", "abstract": "storage A relatively simple scheme for disk-type photopolymer high-density holographic storage based on angular and spatial multiplexing is described. The effects of the optical setup on the recording capacity and density are studied. Calculations and analysis show that this scheme is more effective than a scheme based on the spatioangular multiplexing for disk-type photopolymer high-density holographic storage, which has a limited medium thickness. Also an optimal beam recording angle exists to achieve maximum recording capacity and density", "fulltext": "", "keywords": "optimal beam recording angle;spatial multiplexing;spatio-angular multiplexing;disk-type photopolymer high-density holographic storage;angular multiplexing;recording capacity;recording density;optical setup;limited medium thickness;maximum recording capacity;maximum density"}
{"name": "train_102", "title": "Harmless delays in Cohen-Grossberg neural networks", "abstract": "Without assuming monotonicity and differentiability of the activation functions and any symmetry of interconnections, we establish some sufficient conditions for the globally asymptotic stability of a unique equilibrium for the Cohen-Grossberg (1983) neural network with multiple delays. Lyapunov functionals and functions combined with the Razumikhin technique are employed. The criteria are all independent of the magnitudes of the delays, and thus the delays under these conditions are harmless", "fulltext": "", "keywords": "multiple delays;activation functions;monotonicity;differentiability;razumikhin technique;harmless delays;cohen-grossberg neural networks;lyapunov functionals;interconnections;globally asymptotic stability"}
{"name": "train_1020", "title": "Supersampling multiframe blind deconvolution resolution enhancement of adaptive", "abstract": "optics compensated imagery of low earth orbit satellites We describe a postprocessing methodology for reconstructing undersampled image sequences with randomly varying blur that can provide image enhancement beyond the sampling resolution of the sensor. This method is demonstrated on simulated imagery and on adaptive-optics-(AO)-compensated imagery taken by the Starfire Optical Range 3.5-m telescope that has been artificially undersampled. Also shown are the results of multiframe blind deconvolution of some of the highest quality optical imagery of low earth orbit satellites collected with a ground-based telescope to date. The algorithm used is a generalization of multiframe blind deconvolution techniques that include a representation of spatial sampling by the focal plane array elements based on a forward stochastic model. This generalization enables the random shifts and shape of the AO-compensated point spread function (PSF) to be used to partially eliminate the aliasing effects associated with sub-Nyquist sampling of the image by the focal plane array. The method could be used to reduce resolution loss that occurs when imaging in wide-field-of-view (FOV) modes", "fulltext": "", "keywords": "randomly varying blur;starfire optical range telescope;sub-nyquist sampling;wide-field-of-view modes;spatial sampling;random shifts;image enhancement;postprocessing methodology;multiframe blind deconvolution;sensor sampling resolution;simulated imagery;ground-based telescope;forward stochastic model;undersampled image sequence reconstruction;focal plane array elements;resolution loss;3.5 m;adaptive optics compensated imagery;aliasing effects;low earth orbit satellites;ao-compensated point spread function;supersampling multiframe blind deconvolution resolution enhancement"}
{"name": "train_1021", "title": "Error-probability analysis of MIL-STD-1773 optical fiber data buses", "abstract": "We have analyzed the error probabilities of MIL-STD-1773 optical fiber data buses with three modulation schemes, namely, original Manchester II bi-phase coding, PTMBC, and EMBC-BSF. Using these derived expressions of error probabilities, we can also compare the receiver sensitivities of such optical fiber data buses", "fulltext": "", "keywords": "receiver sensitivities;manchester bi-phase coding;optical fiber data buses;modulation schemes;error probabilities"}
{"name": "train_1022", "title": "Bad pixel identification by means of principal components analysis", "abstract": "Bad pixels are defined as those pixels showing a temporal evolution of the signal different from the rest of the pixels of a given array. Principal component analysis helps us to understand the definition of a statistical distance associated with each pixels, and using this distance it is possible to identify those pixels labeled as bad pixels. The spatiality of a pixel is also calculated. An assumption about the normality of the distribution of the distances of the pixels is revised. Although the influence on the robustness of the identification algorithm is negligible, the definition of a parameter related with this nonnormality helps to identify those principal components and eigenimages responsible for the departure from a multinormal distribution. The method for identifying the bad pixels is successfully applied to a set of frames obtained from a CCD visible and a focal plane array (FPA) IR camera", "fulltext": "", "keywords": "principal components analysis;robustness;bad pixel identification;multinormal distribution;ccd visible camera;temporal evolution;statistical distance;focal plane array;ir camera;identification algorithm;eigenimages"}
{"name": "train_1023", "title": "Simple nonlinear dual-window operator for edge detection", "abstract": "We propose a nonlinear edge detection technique based on a two-concentric-circular-window operator. We perform a preliminary selection of edge candidates using a standard gradient and use the dual-window operator to reveal edges as zero-crossing points of a simple difference function depending only on the minimum and maximum values in the two windows. Comparisons with other well-established techniques are reported in terms of visual appearance and computational efficiency. They show that detected edges are surely comparable with Canny's and Laplacian of Gaussian algorithms, with a noteworthy reduction in terms of computational load", "fulltext": "", "keywords": "canny's algorithms;difference function;edge detection;nonlinear dual-window operator;gaussian algorithms;two-concentric-circular-window operator;nonlinear processing;maximum values;standard gradient;computational load;minimum values;dual window operator;zero-crossing points;laplacian algorithms;nonlinear edge detection technique;detected edges;computational efficiency"}
{"name": "train_1024", "title": "Rational systems exhibit moderate risk aversion with respect to \"gambles\" on", "abstract": "variable-resolution compression In an embedded wavelet scheme for progressive transmission, a tree structure naturally defines the spatial relationship on the hierarchical pyramid. Transform coefficients over each tree correspond to a unique local spatial region of the original image, and they can be coded bit-plane by bit-plane through successive-approximation quantization. After receiving the approximate value of some coefficients, the decoder can obtain a reconstructed image. We show a rational system for progressive transmission that, in absence of a priori knowledge about regions of interest, chooses at any truncation time among alternative trees for further transmission in such a way as to avoid certain forms of behavioral inconsistency. We prove that some rational transmission systems might exhibit aversion to risk involving \"gambles\" on tree-dependent quality of encoding while others favor taking such risks. Based on an acceptable predictor for visual distinctness from digital imagery, we demonstrate that, without any outside knowledge, risk-prone systems as well as those with strong risk aversion appear in capable of attaining the quality of reconstructions that can be achieved with moderate risk-averse behavior", "fulltext": "", "keywords": "tree structure;hierarchical pyramid spatial relationship;progressive transmission;digital imagery;decision problem;progressive transmission utility functions;moderate risk aversion;behavioral inconsistency avoidance;gambles;visual distinctness;variable-resolution compression;image encoding;reconstructed image;transform coefficients;truncation time;rational system;embedded wavelet scheme;local spatial region;successive-approximation quantization;information theoretic measure;rate control optimization;acceptable predictor;embedded coding"}
{"name": "train_1025", "title": "Watermarking techniques for electronic delivery of remote sensing images", "abstract": "Earth observation missions have recently attracted a growing interest, mainly due to the large number of possible applications capable of exploiting remotely sensed data and images. Along with the increase of market potential, the need arises for the protection of the image products. Such a need is a very crucial one, because the Internet and other public/private networks have become preferred means of data exchange. A critical issue arising when dealing with digital image distribution is copyright protection. Such a problem has been largely addressed by resorting to watermarking technology. A question that obviously arises is whether the requirements imposed by remote sensing imagery are compatible with existing watermarking techniques. On the basis of these motivations, the contribution of this work is twofold: assessment of the requirements imposed by remote sensing applications on watermark-based copyright protection, and modification of two well-established digital watermarking techniques to meet such constraints. More specifically, the concept of near-lossless watermarking is introduced and two possible algorithms matching such a requirement are presented. Experimental results are shown to measure the impact of watermark introduction on a typical remote sensing application, i.e., unsupervised image classification", "fulltext": "", "keywords": "near-lossless watermarking;remote sensing images;electronic delivery;digital image distribution;digital watermarking;watermarking techniques;copyright protection;earth observation missions;unsupervised image classification"}
{"name": "train_1026", "title": "Use of SPOT images as a tool for coastal zone management and monitoring of", "abstract": "environmental impacts in the coastal zone Modern techniques such as remote sensing have been one of the main factors leading toward the achievement of serious plans regarding coastal management. A multitemporal analysis of land use in certain areas of the Colombian Caribbean Coast is described. It mainly focuses on environmental impacts caused by anthropogenic activities, such as deforestation of mangroves due to shrimp farming. Selection of sensitive areas, percentage of destroyed mangroves, possible endangered areas, etc., are some of the results of this analysis. Recommendations for a coastal management plan in the area have also resulted from this analysis. Some other consequences of the deforestation of mangroves in the coastal zone and the construction of shrimp ponds are also analyzed, such as the increase of erosion problems in these areas and water pollution, among others. The increase of erosion in these areas has also changed part of their morphology, which has been studied by the analysis of SPOT images in previous years. A serious concern exists about the future of these areas. For this reason new techniques like satellite images (SPOT) have been applied with good results, leading to more effective control and coastal management in the area. The use of SPOT images to study changes of the land use of the area is a useful technique to determine patterns of human activities and suggest solutions for severe problems in these areas", "fulltext": "", "keywords": "colombian caribbean coast;satellite images;remote sensing;erosion problems;shrimp ponds;endangered areas;shrimp farming;vector overlay;anthropogenic activities;sedimentation;water pollution;human activities;land use;coastal zone management;mangrove deforestation;supervised classification;spot images;environmental impact monitoring;multitemporal analysis;vectorization"}
{"name": "train_1027", "title": "Extracting straight road structure in urban environments using IKONOS satellite", "abstract": "imagery We discuss a fully automatic technique for extracting roads in urban environments. The method has its bases in a vegetation mask derived from multispectral IKONOS data and in texture derived from panchromatic IKONOS data. These two techniques together are used to distinguish road pixels. We then move from individual pixels to an object-based representation that allows reasoning on a higher level. Recognition of individual segments and intersections and the relationships among them are used to determine underlying road structure and to then logically hypothesize the existence of additional road network components. We show results on an image of San Diego, California. The object-based processing component may be adapted to utilize other basis techniques as well, and could be used to build a road network in any scene having a straight-line structured topology", "fulltext": "", "keywords": "object-based processing component;vegetation mask;san diego;panchromatic ikonos data;straight road structure;individual segment recognition;fully automatic technique;vectorized road network;high-resolution imagery;road network components;large-scale feature extraction;urban environments;ikonos satellite imagery;object-based representation;texture;higher level reasoning;straight-line structured topology;road pixels"}
{"name": "train_1028", "title": "Novel approach to super-resolution pits readout", "abstract": "We proposed a novel method to realize the readout of super-resolution pits by using a super-resolution reflective film to replace the reflective layer of the conventional ROM. At the same time, by using Sb as the super-resolution reflective layer and SiN as a dielectric layer, the super-resolution pits with diameters of 380 nm were read out by a setup whose laser wavelength is 632.8 nm and numerical aperture is 0.40. In addition, the influence of the Sb thin film thickness on the readout signal was investigated, the results showed that the optimum Sb thin film thickness is 28 to 30 nm, and the maximum CNR is 38 to 40 dB", "fulltext": "", "keywords": "super-resolution reflective film;sb super-resolution reflective layer;numerical aperture;632.8 nm;sb-sin;380 nm;readout signal;sin dielectric layer;sb thin film thickness;super-resolution pits readout;maximum cnr;28 to 30 nm"}
{"name": "train_1029", "title": "Effect of insulation layer on transcribability and birefringence distribution", "abstract": "in optical disk substrate As the need for information storage media with high storage density increases, digital video disks (DVDs) with smaller recording marks and thinner optical disk substrates than those of conventional DVDs are being required. Therefore, improving the replication quality of land-groove or pit structure and reducing the birefringence distribution are emerging as important criteria in the fabrication of high-density optical disk substrates. We control the transcribability and distribution of birefringence by inserting an insulation layer under the stamper during injection-compression molding of DVD RAM substrates. The effects of the insulation layer on the geometrical and optical properties, such as transcribability and birefringence distribution, are examined experimentally. The inserted insulation layer is found to be very effective in improving the quality of replication and leveling out the first peak of the gapwise birefringence distribution near the mold wall and reducing the average birefringence value, because the insulation layer retarded the growth of the solidified layer", "fulltext": "", "keywords": "land-groove;information storage media;optical properties;mold wall;dvd ram substrates;stamper;injection-compression molding;thinner optical disk substrates;insulation layer;gapwise birefringence distribution;polyimide thermal insulation layer;solidified layer growth retardation;transcribability;smaller recording marks;pit structure;birefringence distribution;high storage density;digital video disks;optical disk substrate;fabrication;geometrical properties;replication quality"}
{"name": "train_1030", "title": "Comparison of automated digital elevation model extraction results using", "abstract": "along-track ASTER and across-track SPOT stereo images A digital elevation model (DEM) can be extracted automatically from stereo satellite images. During the past decade, the most common satellite data used to extract DEM was the across-track SPOT. Recently, the addition of along-track ASTER data, which can be downloaded freely, provides another attractive alternative to extract DEM data. This work compares the automated DEM extraction results using an ASTER stereo pair and a SPOT stereo pair over an area of hilly mountains in Drum Mountain, Utah, when compared to a USGS 7.5-min DEM standard product. The result shows that SPOT produces better DEM results in terms of accuracy and details, if the radiometric variations between the images, taken on subsequent satellite revolutions, are small. Otherwise, the ASTER stereo pair is a better choice because of simultaneous along-track acquisition during a single pass. Compared to the USGS 7.5-min DEM, the ASTER and the SPOT extracted DEMs have a standard deviation of 11.6 and 4.6 m, respectively", "fulltext": "", "keywords": "automated digital elevation model extraction;radiometric variations;across-track spot stereo images;stereo satellite images;along-track aster data;spot stereo image pair;aster stereo pair;simultaneous along-track acquisition"}
{"name": "train_1031", "title": "Noise-constrained hyperspectral data compression", "abstract": "Storage and transmission requirements for hyperspectral data sets are significant. To reduce hardware costs, well-designed compression techniques are needed to preserve information content while maximizing compression ratios. Lossless compression techniques maintain data integrity, but yield small compression ratios. We present a slightly lossy compression algorithm that uses the noise statistics of the data to preserve information content while maximizing compression ratios. The adaptive principal components analysis (APCA) algorithm uses noise statistics to determine the number of significant principal components and selects only those that are required to represent each pixel to within the noise level. We demonstrate the effectiveness of these methods with airborne visible/infrared spectrometer (AVIRIS), hyperspectral digital imagery collection experiment (HYDICE), hyperspectral mapper (HYMAP), and Hyperion datasets", "fulltext": "", "keywords": "airborne visible/infrared spectrometer hyperspectral digital imagery collection experiment;transmission requirements;hardware costs;slightly lossy compression algorithm;hymap;storage requirements;noise-constrained hyperspectral data compression;data integrity;aviris hydice;hyperion datasets;adaptive principal components analysis algorithm;information content;hyperspectral mapper;noise statistics;lossless compression techniques;gaussian statistics;hyperspectral data sets;noise level;compression ratios"}
{"name": "train_1032", "title": "Satellite image collection optimization", "abstract": "Imaging satellite systems represent a high capital cost. Optimizing the collection of images is critical for both satisfying customer orders and building a sustainable satellite operations business. We describe the functions of an operational, multivariable, time dynamic optimization system that maximizes the daily collection of satellite images. A graphical user interface allows the operator to quickly see the results of what if adjustments to an image collection plan. Used for both long range planning and daily collection scheduling of Space Imaging's IKONOS satellite, the satellite control and tasking (SCT) software allows collection commands to be altered up to 10 min before upload to the satellite", "fulltext": "", "keywords": "satellite control tasking software;long range planning;collection commands;graphical user interface;satellite image collection optimization;imaging satellite systems;daily collection scheduling;space imaging ikonos satellite;image collection plan;multivariable time dynamic optimization system"}
{"name": "train_1033", "title": "Optical two-step modified signed-digit addition based on binary logic gates", "abstract": "A new modified signed-digit (MSD) addition algorithm based on binary logic gates is proposed for parallel computing. It is shown that by encoding each of the input MSD digits and flag digits into a pair of binary bits, the number of addition steps can be reduced to two. The flag digit is introduced to characterize the next low order pair (NLOP) of the input digits in order to suppress carry propagation. The rules for two-step addition of binary coded MSD (BCMSD) numbers are formulated that can be implemented using optical shadow-casting logic system", "fulltext": "", "keywords": "binary bits;two-step addition;input msd digits;modified signed-digit addition algorithm;optical two-step modified signed-digit addition;flag digits;optical shadow-casting logic system;addition steps;low order pair;carry propagation suppression;binary logic gates;binary coded msd;parallel computing"}
{"name": "train_1034", "title": "Vibration control of the rotating flexible-shaft/multi-flexible-disk system", "abstract": "with the eddy-current damper In this paper, the rotating flexible-Timoshenko-shaft/flexible-disk coupling system is formulated by applying the assumed-mode method into the kinetic and strain energies, and the virtual work done by the eddy-current damper. From Lagrange's equations, the resulting discretized equations of motion can be simplified as a bilinear system (BLS). Introducing the control laws, including the quadratic, nonlinear and optimal feedback control laws, into the BLS, it is found that the eddy-current damper can be used to suppress flexible and shear vibrations simultaneously, and the system is globally asymptotically stable. Numerical results are provided to validate the theoretical analysis", "fulltext": "", "keywords": "shear vibrations;quadratic feedback control laws;rotating flexible-shaft/multi-flexible-disk system;flexible vibrations;bilinear system;nonlinear feedback control laws;discretized equations of motion;assumed-mode method;lagrange's equations;virtual work;optimal feedback control laws;eddy-current damper;rotating flexible-timoshenko-shaft/flexible-disk coupling system"}
{"name": "train_1035", "title": "H/sub 2/ optimization of the three-element type dynamic vibration absorbers", "abstract": "The dynamic vibration absorber (DVA) is a passive vibration control device which is attached to a vibrating body (called a primary system) subjected to exciting force or motion. In this paper, we will discuss an optimization problem of the three-element type DVA on the basis of the H/sub 2/ optimization criterion. The objective of the H/sub 2/ optimization is to reduce the total vibration energy of the system for overall frequencies; the total area under the power spectrum response curve is minimized in this criterion. If the system is subjected to random excitation instead of sinusoidal excitation, then the H/sub 2/ optimization is probably more desirable than the popular H/sub infinity / optimization. In the past decade there has been increasing interest in the three-element type DVA. However, most previous studies on this type of DVA were based on the H/sub infinity / optimization design, and no one has been able to find the algebraic solution as of yet. We found a closed-form exact solution for a special case where the primary system has no damping. Furthermore, the general case solution including the damped primary system is presented in the form of a numerical solution. The optimum parameters obtained here are compared to those of the conventional Voigt type DVA. They are also compared to other optimum parameters based on the H/sub infinity / criterion", "fulltext": "", "keywords": "voigt type dynamic vibration absorber;h/sub 2/ optimization;power spectrum response;three-element type dynamic vibration absorbers;passive vibration control"}
{"name": "train_1036", "title": "Nonlinear control of a shape memory alloy actuated manipulator", "abstract": "This paper presents a nonlinear, robust control algorithm for accurate positioning of a single degree of freedom rotary manipulator actuated by Shape Memory Alloy (SMA). A model for an SMA actuated manipulator is presented. The model includes nonlinear dynamics of the manipulator, a constitutive model of Shape Memory Alloy, and electrical and heat transfer behavior of SMA wire. This model is used for open and closed loop motion simulations of the manipulator. Experiments are presented that show results similar to both closed and open loop simulation results. Due to modeling uncertainty and nonlinear behavior of the system, classic control methods such as Proportional-Integral-Derivative control are not able to present fast and accurate performance. Hence a nonlinear, robust control algorithm is presented based on Variable Structure Control. This algorithm is a control gain switching technique based on the weighted average of position and velocity feedbacks. This method has been designed through simulation and tested experimentally. Results show fast, accurate, and robust performance of the control system. Computer simulation and experimental results for different stabilization and tracking situations are also presented", "fulltext": "", "keywords": "feedback;control gain switching;manipulator;stabilization;shape memory alloy;variable structure control;positioning;tracking;open loop;nonlinear dynamics;nonlinear control;closed loop"}
{"name": "train_1037", "title": "A stochastic averaging approach for feedback control design of nonlinear", "abstract": "systems under random excitations This paper presents a method for designing and quantifying the performance of feedback stochastic controls for nonlinear systems. The design makes use of the method of stochastic averaging to reduce the dimension of the state space and to derive the Ito stochastic differential equation for the response amplitude process. The moment equation of the amplitude process closed by the Rayleigh approximation is used as a means to characterize the transient performance of the feedback control. The steady state and transient response of the amplitude process are used as the design criteria for choosing the feedback control gains. Numerical examples are studied to demonstrate the performance of the control", "fulltext": "", "keywords": "steady state;rayleigh approximation;stochastic averaging;transient response;random excitations;ito stochastic differential equation;feedback control;nonlinear systems;feedback stochastic controls"}
{"name": "train_1038", "title": "The analysis and control of longitudinal vibrations from wave viewpoint", "abstract": "The analysis and control of longitudinal vibrations in a rod from feedback wave viewpoint are synthesized. Both collocated and noncollocated feedback wave control strategies are explored. The control design is based on the local properties of wave transmission and reflection in the vicinity of the control force applied area, hence there is no complex closed form solution involved. The controller is designed to achieve various goals, such as absorbing the incoming vibration energy, creating a vibration free zone and eliminating standing waves in the structure. The findings appear to be very useful in practice due to the simplicity in the implementation of the controllers", "fulltext": "", "keywords": "control force;feedback waves;vibration free zone;vibration energy;control design;collocated feedback wave control;noncollocated feedback wave control;standing waves;complex closed form solution;longitudinal vibration control;wave transmission;wave reflection"}
{"name": "train_1039", "title": "Design of an adaptive vibration absorber to reduce electrical transformer", "abstract": "structural vibration This paper considers the design of a vibration absorber to reduce structural vibration at multiple frequencies, with an enlarged bandwidth control at these target frequencies. While the basic absorber is a passive device a control system has been added to facilitate tuning, effectively giving the combination of a passive and active device, which leads to far greater stability and robustness. Experimental results demonstrating the effectiveness of the absorber are also described", "fulltext": "", "keywords": "bandwidth control;adaptive vibration absorber;structural vibration;electrical transformer"}
{"name": "train_1040", "title": "CRONE control: principles and extension to time-variant plants with", "abstract": "asymptotically constant coefficients The principles of CRONE control, a frequency-domain robust control design methodology based on fractional differentiation, are presented. Continuous time-variant plants with asymptotically constant coefficients are analysed in the frequency domain, through their representation using time-variant frequency responses. A stability theorem for feedback systems including time-variant plants with asymptotically constant coefficients is proposed. Finally, CRONE control is extended to robust control of these plants", "fulltext": "", "keywords": "feedback systems;frequency-domain robust control design;crone control;stability theorem;asymptotically constant coefficients;time-variant frequency responses;automatic control;time-variant plants;robust control;fractional differentiation"}
{"name": "train_1041", "title": "Fractional differentiation in passive vibration control", "abstract": "From a single-degree-of-freedom model used to illustrate the concept of vibration isolation, a method to transform the design for a suspension into a design for a robust controller is presented. Fractional differentiation is used to model the viscoelastic behaviour of the suspension. The use of fractional differentiation not only permits optimisation of just four suspension parameters, showing the 'compactness' of the fractional derivative operator, but also leads to robustness of the suspension's performance to uncertainty of the sprung mass. As an example, an engine suspension is studied", "fulltext": "", "keywords": "vibration isolation;sprung mass;engine suspension;suspension;passive vibration control;robust controller;viscoelastic behaviour;fractional differentiation"}
{"name": "train_1042", "title": "Chaotic phenomena and fractional-order dynamics in the trajectory control of", "abstract": "redundant manipulators Redundant manipulators have some advantages when compared with classical arms because they allow the trajectory optimization, both on the free space and on the presence of obstacles, and the resolution of singularities. For this type of arms the proposed kinematic control algorithms adopt generalized inverse matrices but, in general, the corresponding trajectory planning schemes show important limitations. Motivated by these problems this paper studies the chaos revealed by the pseudoinverse-based trajectory planning algorithms, using the theory of fractional calculus", "fulltext": "", "keywords": "trajectory planning schemes;classical arms;kinematic control algorithms;trajectory control;generalized inverse matrices;fractional-order dynamics;chaotic phenomena;redundant manipulators;fractional calculus;trajectory optimization"}
{"name": "train_1043", "title": "Fractional motion control: application to an XY cutting table", "abstract": "In path tracking design, the dynamic of actuators must be taken into account in order to reduce overshoots appearing for small displacements. A new approach to path tracking using fractional differentiation is proposed with its application on a XY cutting table. It permits the generation of optimal movement reference-input leading to a minimum path completion time, taking into account both maximum velocity, acceleration and torque and the bandwidth of the closed-loop system. Fractional differentiation is used here through a Davidson-Cole filter. A methodology aiming at improving the accuracy especially on checkpoints is presented. The reference-input obtained is compared with spline function. Both are applied to an XY cutting table model and actuator outputs compared", "fulltext": "", "keywords": "xy cutting table;closed-loop system;davidson-cole filter;minimum path completion time;spline function;optimization;actuators;fractional motion control;path tracking design;fractional differentiation"}
{"name": "train_1044", "title": "Analogue realizations of fractional-order controllers", "abstract": "An approach to the design of analogue circuits, implementing fractional-order controllers, is presented. The suggested approach is based on the use of continued fraction expansions; in the case of negative coefficients in a continued fraction expansion, the use of negative impedance converters is proposed. Several possible methods for obtaining suitable rational approximations and continued fraction expansions are discussed. An example of realization of a fractional-order I/sup lambda / controller is presented and illustrated by obtained measurements. The suggested approach can be used for the control of very fast processes, where the use of digital controllers is difficult or impossible", "fulltext": "", "keywords": "rational approximations;negative impedance converters;negative coefficients;fractional-order controllers;continued fraction expansions;analogue realizations;fast processes;fractional integration;digital controllers;fraction expansion;fractional differentiation"}
{"name": "train_1045", "title": "Using fractional order adjustment rules and fractional order reference models", "abstract": "in model-reference adaptive control This paper investigates the use of Fractional Order Calculus (FOC) in conventional Model Reference Adaptive Control (MRAC) systems. Two modifications to the conventional MRAC are presented, i.e., the use of fractional order parameter adjustment rule and the employment of fractional order reference model. Through examples, benefits from the use of FOC are illustrated together with some remarks for further research", "fulltext": "", "keywords": "mrac;fractional order reference models;fractional order adjustment rules;model-reference adaptive control;foc;fractional calculus"}
{"name": "train_1046", "title": "A suggestion of fractional-order controller for flexible spacecraft attitude", "abstract": "control A controller design method for flexible spacecraft attitude control is proposed. The system is first described by a partial differential equation with internal damping. Then the frequency response is analyzed, and the three basic characteristics of the flexible system, namely, average function, lower bound and upper bound are defined. On this basis, a fractional-order controller is proposed, which functions as phase stabilization control for lower frequency and smoothly enters to amplitude stabilization at higher frequency by proper amplitude attenuation. It is shown that the equivalent damping ratio increases in proportion to the square of frequency", "fulltext": "", "keywords": "frequency response;fractional-order controller;partial differential equation;amplitude stabilization;internal damping;flexible spacecraft attitude control;phase stabilization control;damping ratio"}
{"name": "train_1047", "title": "Dynamics and control of initialized fractional-order systems", "abstract": "Due to the importance of historical effects in fractional-order systems, this paper presents a general fractional-order system and control theory that includes the time-varying initialization response. Previous studies have not properly accounted for these historical effects. The initialization response, along with the forced response, for fractional-order systems is determined. The scalar fractional-order impulse response is determined, and is a generalization of the exponential function. Stability properties of fractional-order systems are presented in the complex w-plane, which is a transformation of the s-plane. Time responses are discussed with respect to pole positions in the complex w-plane and frequency response behavior is included. A fractional-order vector space representation, which is a generalization of the state space concept, is presented including the initialization response. Control methods for vector representations of initialized fractional-order systems are shown. Finally, the fractional-order differintegral is generalized to continuous order-distributions which have the possibility of including all fractional orders in a transfer function", "fulltext": "", "keywords": "forced response;vector space representation;impulse response;exponential function;fractional-order differintegral;dynamics;control;state space concept;initialization response;transfer function;initialized fractional-order systems"}
{"name": "train_1048", "title": "Parallel and distributed Haskells", "abstract": "Parallel and distributed languages specify computations on multiple processors and have a computation language to describe the algorithm, i.e. what to compute, and a coordination language to describe how to organise the computations across the processors. Haskell has been used as the computation language for a wide variety of parallel and distributed languages, and this paper is a comprehensive survey of implemented languages. It outlines parallel and distributed language concepts and classifies Haskell extensions using them. Similar example programs are used to illustrate and contrast the coordination languages, and the comparison is facilitated by the common computation language. A lazy language is not an obvious choice for parallel or distributed computation, and we address the question of why Haskell is a common functional computation language", "fulltext": "", "keywords": "parallel languages;parallel haskell;functional programming;multiple processors;distributed languages;coordination language;lazy language;functional computation language;distributed haskell"}
{"name": "train_1049", "title": "A typed representation for HTML and XML documents in Haskell", "abstract": "We define a family of embedded domain specific languages for generating HTML and XML documents. Each language is implemented as a combinator library in Haskell. The generated HTML/XML documents are guaranteed to be well-formed. In addition, each library can guarantee that the generated documents are valid XML documents to a certain extent (for HTML only a weaker guarantee is possible). On top of the libraries, Haskell serves as a meta language to define parameterized documents, to map structured documents to HTML/XML, to define conditional content, or to define entire Web sites. The combinator libraries support element-transforming style, a programming style that allows programs to have a visual appearance similar to HTML/XML documents, without modifying the syntax of Haskell", "fulltext": "", "keywords": "combinator library;element-transforming style;html documents;functional programming;parameterized documents;software libraries;embedded domain specific languages;conditional content;web sites;typed representation;xml documents;haskell;meta language;syntax"}
{"name": "train_105", "title": "Greenberger-Horne-Zeilinger paradoxes for many qubits", "abstract": "We construct Greenberger-Horne-Zeilinger (GHZ) contradictions for three or more parties sharing an entangled state, the dimension of each subsystem being an even integer d. The simplest example that goes beyond the standard GHZ paradox (three qubits) involves five ququats (d = 4). We then examine the criteria that a GHZ paradox must satisfy in order to be genuinely M partite and d dimensional", "fulltext": "", "keywords": "entangled state;many qubits;greenberger-horne-zeilinger paradoxes;ghz paradox;ghz contradictions"}
{"name": "train_1050", "title": "Secrets of the Glasgow Haskell compiler inliner", "abstract": "Higher-order languages such as Haskell encourage the programmer to build abstractions by composing functions. A good compiler must inline many of these calls to recover an efficiently executable program. In principle, inlining is dead simple: just replace the call of a function by an instance of its body. But any compiler-writer will tell you that inlining is a black art, full of delicate compromises that work together to give good performance without unnecessary code bloat. The purpose of this paper is, therefore, to articulate the key lessons we learned from a full-scale \"production\" inliner, the one used in the Glasgow Haskell compiler. We focus mainly on the algorithmic aspects, but we also provide some indicative measurements to substantiate the importance of various aspects of the inliner", "fulltext": "", "keywords": "glasgow haskell compiler inliner;performance;functional programming;executable program;higher-order languages;algorithmic aspects;abstractions;functional language;optimising compiler"}
{"name": "train_1051", "title": "Faking it: simulating dependent types in Haskell", "abstract": "Dependent types reflect the fact that validity of data is often a relative notion by allowing prior data to affect the types of subsequent data. Not only does this make for a precise type system, but also a highly generic one: both the type and the program for each instance of a family of operations can be computed from the data which codes for that instance. Recent experimental extensions to the Haskell type class mechanism give us strong tools to relativize types to other types. We may simulate some aspects of dependent typing by making counterfeit type-level copies of data, with type constructors simulating data constructors and type classes simulating datatypes. This paper gives examples of the technique and discusses its potential", "fulltext": "", "keywords": "counterfeit type-level copies;dependent types;type class mechanism;dependent typing;functional programming;precise type system;datatypes;data validity;haskell;data constructors;type constructors"}
{"name": "train_1052", "title": "Developing a high-performance web server in Concurrent Haskell", "abstract": "Server applications, and in particular network-based server applications, place a unique combination of demands on a programming language: lightweight concurrency, high I/O throughput, and fault tolerance are all important. This paper describes a prototype Web server written in Concurrent Haskell (with extensions), and presents two useful results: firstly, a conforming server could be written with minimal effort, leading to an implementation in less than 1500 lines of code, and secondly the naive implementation produced reasonable performance. Furthermore, making minor modifications to a few time-critical components improved performance to a level acceptable for anything but the most heavily loaded Web servers", "fulltext": "", "keywords": "high i/o throughput;network-based server applications;high-performance web server;conforming server;concurrent haskell;fault tolerance;time-critical components;lightweight concurrency"}
{"name": "train_1053", "title": "A static semantics for Haskell", "abstract": "This paper gives a static semantics for Haskell 98, a non-strict purely functional programming language. The semantics formally specifies nearly all the details of the Haskell 98 type system, including the resolution of overloading, kind inference (including defaulting) and polymorphic recursion, the only major omission being a proper treatment of ambiguous overloading and its resolution. Overloading is translated into explicit dictionary passing, as in all current implementations of Haskell. The target language of this translation is a variant of the Girard-Reynolds polymorphic lambda calculus featuring higher order polymorphism. and explicit type abstraction and application in the term language. Translated programs can thus still be type checked, although the implicit version of this system is impredicative. A surprising result of this formalization effort is that the monomorphism restriction, when rendered in a system of inference rules, compromises the principal type property", "fulltext": "", "keywords": "inference rules;polymorphic lambda calculus;kind inference;type system;static semantics;type checking;higher order polymorphism;polymorphic recursion;monomorphism restriction;term language;explicit type abstraction;nonstrict purely functional programming language;explicit dictionary passing;overloading;formal specification;haskell 98"}
{"name": "train_1054", "title": "Choice preferences without inferences: subconscious priming of risk attitudes", "abstract": "We present a procedure for subconscious priming of risk attitudes. In Experiment 1, we were reliably able to induce risk-seeking or risk-averse preferences across a range of decision scenarios using this priming procedure. In Experiment 2, we showed that these priming effects can be reversed by drawing participants' attention to the priming event. Our results support claims that the formation of risk preferences can be based on preconscious processing, as for example postulated by the affective primacy hypothesis, rather than rely on deliberative mental operations, as posited by several current models of judgment and decision making", "fulltext": "", "keywords": "preconscious processing;risk-averse preferences;affective primacy hypothesis;deliberative mental operations;choice preferences;decision scenarios;risk attitudes;risk-seeking preferences;subconscious priming"}
{"name": "train_1055", "title": "A re-examination of probability matching and rational choice", "abstract": "In a typical probability learning task participants are presented with a repeated choice between two response alternatives, one of which has a higher payoff probability than the other. Rational choice theory requires that participants should eventually allocate all their responses to the high-payoff alternative, but previous research has found that people fail to maximize their payoffs. Instead, it is commonly observed that people match their response probabilities to the payoff probabilities. We report three experiments on this choice anomaly using a simple probability learning task in which participants were provided with (i) large financial incentives, (ii) meaningful and regular feedback, and (iii) extensive training. In each experiment large proportions of participants adopted the optimal response strategy and all three of the factors mentioned above contributed to this. The results are supportive of rational choice theory", "fulltext": "", "keywords": "feedback;meaningful regular feedback;choice anomaly;rationality;optimal response strategy;rational choice theory;response probabilities;probability matching;payoff probability;extensive training;large financial incentives;probability learning task"}
{"name": "train_1056", "title": "Eliminating recency with self-review: the case of auditors' 'going concern'", "abstract": "judgments This paper examines the use of self-review to debias recency. Recency is found in the 'going concern' judgments of staff auditors, but is successfully eliminated by the auditor's use of a simple self-review technique that would be extremely easy to implement in audit practice. Auditors who self-review are also less inclined to make audit report choices that are inconsistent with their going concern judgments. These results are important because the judgments of staff auditors often determine the type and extent of documentation in audit workpapers and serve as preliminary inputs for senior auditors' judgments and choices. If staff auditors' judgments are affected by recency, the impact of this bias may be impounded in the ultimate judgments and choices of senior auditors. Since biased judgments can expose auditors to significant costs involving extended audit procedures, legal liability and diminished reputation, simple debiasing techniques that reduce this exposure are valuable. The paper also explores some future research needs and other important issues concerning judgment debiasing in applied professional settings", "fulltext": "", "keywords": "judgment debiasing;recency debiasing;audit report choices;senior auditors;self-review;applied professional settings;documentation;accountability;legal liability;diminished reputation;audit workpapers;staff auditors;extended audit procedures;probability judgments;auditor going concern judgments"}
{"name": "train_1057", "title": "Acceptance of a price discount: the role of the semantic relatedness between", "abstract": "purchases and the comparative price format Two studies are reported where people are asked to accept or not a price reduction on a target product. In the high (low) relative saving version, the regular price of the target product is low (high). In both versions, the absolute value of the price reduction is the same as well as the total of regular prices of planned purchases. As first reported by Tversky and Kahneman (1981), findings show that the majority of people accept the price discount in the high-relative saving version whereas the minority do it in the low one. In Study 1, findings show that the previous preference reversal disappears when planned purchases are strongly related. Also, a previously unreported preference reversal is found. The majority of people accept the price discount when the products are weakly related whereas the minority accept when the products are strongly related. In Study 2, findings show that the classic preference reversal disappears as a function of the comparative price format. Also, another previously unreported preference reversal is found. When the offered price reduction relates to a low-priced product, people are more inclined to accept it with a control than a minimal comparative price format. Findings reported in Studies 1 and 2 are interpreted in terms of mental accounting shifts", "fulltext": "", "keywords": "high relative saving version;planned purchases;semantic relatedness hypothesis;mental accounting shifts;low-priced product;preference reversal;comparative price format;low relative saving version;price discount acceptance"}
{"name": "train_1058", "title": "Bigger is better: the influence of physical size on aesthetic preference", "abstract": "judgments The hypothesis that the physical size of an object can influence aesthetic preferences was investigated. In a series of four experiments, participants were presented with pairs of abstract stimuli and asked to indicate which member of each pair they preferred. A preference for larger stimuli was found on the majority of trials using various types of stimuli, stimuli of various sizes, and with both adult and 3-year-old participants. This preference pattern was disrupted only when participants had both stimuli that provided a readily accessible alternative source of preference-evoking information and sufficient attentional resources to make their preference judgments", "fulltext": "", "keywords": "decision making;attentional resources;adult participants;preference formation;abstract stimuli;physical size influence;preference-evoking information;preference pattern;aesthetic preference judgments;child participants;judgment cues"}
{"name": "train_1059", "title": "Mustering motivation to enact decisions: how decision process characteristics", "abstract": "influence goal realization Decision scientists tend to focus mainly on decision antecedents, studying how people make decisions. Action psychologists, in contrast, study post-decision issues, investigating how decisions, once formed, are maintained, protected, and enacted. Through the research presented here, we seek to bridge these two disciplines, proposing that the process by which decisions are reached motivates subsequent pursuit and benefits eventual realization. We identify three characteristics of the decision process (DP) as having motivation-mustering potential: DP effort investment, DP importance, and DP confidence. Through two field studies tracking participants' decision processes, pursuit and realization, we find that after controlling for the influence of the motivational mechanisms of goal intention and implementation intention, the three decision process characteristics significantly influence the successful enactment of the chosen decision directly. The theoretical and practical implications of these findings are considered and future research opportunities are identified", "fulltext": "", "keywords": "post-decision issues;decision process characteristics;research opportunities;motivation-mustering potential;goal realization;goal intention;decision enactment;decision process importance;decision process confidence;decision scientists;decision process investment;motivation;action psychologists"}
{"name": "train_106", "title": "Quantum Zeno subspaces", "abstract": "The quantum Zeno effect is recast in terms of an adiabatic theorem when the measurement is described as the dynamical coupling to another quantum system that plays the role of apparatus. A few significant examples are proposed and their practical relevance discussed. We also focus on decoherence-free subspaces", "fulltext": "", "keywords": "dynamical coupling;adiabatic theorem;quantum zeno subspaces;measurement;decoherence-free subspaces"}
{"name": "train_1060", "title": "Variety identification of wheat using mass spectrometry with neural networks", "abstract": "and the influence of mass spectra processing prior to neural network analysis The performance of matrix-assisted laser desorption/ionisation time-of-flight mass spectrometry with neural networks in wheat variety classification is further evaluated. Two principal issues were studied: (a) the number of varieties that could be classified correctly; and (b) various means of preprocessing mass spectrometric data. The number of wheat varieties tested was increased from 10 to 30. The main pre-processing method investigated was based on Gaussian smoothing of the spectra, but other methods based on normalisation procedures and multiplicative scatter correction of data were also used. With the final method, it was possible to classify 30 wheat varieties with 87% correctly classified mass spectra and a correlation coefficient of 0.90", "fulltext": "", "keywords": "correctly classified mass spectra;normalisation procedures;correlation coefficient;mass spectrometric data;mass spectra processing;multiplicative scatter correction;gaussian smoothing;neural network analysis;wheat variety classification;pre-processing- method;matrix-assisted laser desorption/ionisation time-of-flight mass spectrometry;variety identification"}
{"name": "train_1061", "title": "Abacus, EFI and anti-virus", "abstract": "The Extensible Firmware Interface (EFI) standard emerged as a logical step to provide flexibility and extensibility to boot sequence processes, enabling the complete abstraction of a system's BIOS interface from the system's hardware. In doing so, this provided the means of standardizing a boot-up sequence, extending device drivers and boot time applications' portability to non PC-AT-based architectures, including embedded systems like Internet appliances, TV Internet set-top boxes and 64-bit Itanium platforms", "fulltext": "", "keywords": "embedded systems;anti-virus;extensible firmware interface standard"}
{"name": "train_1062", "title": "Fidelity of quantum teleportation through noisy channels", "abstract": "We investigate quantum teleportation through noisy quantum channels by solving analytically and numerically a master equation in the Lindblad form. We calculate the fidelity as a function of decoherence rates and angles of a state to be teleported. It is found that the average fidelity and the range of states to be accurately teleported depend on types of noises acting on quantum channels. If the quantum channels are subject to isotropic noise, the average fidelity decays to 1/2, which is smaller than the best possible value of 2/3 obtained only by the classical communication. On the other hand, if the noisy quantum channel is modeled by a single Lindblad operator, the average fidelity is always greater than 2/3", "fulltext": "", "keywords": "analytical solution;noisy quantum channels;recipient;classical communication;dual classical channels;quantum channels;alice;numerical solution;bob;quantum teleportation;fidelity;isotropic noise;lindblad operator;eigenstate;sender"}
{"name": "train_1063", "title": "Operations that do not disturb partially known quantum states", "abstract": "Consider a situation in which a quantum system is secretly prepared in a state chosen from the known set of states. We present a principle that gives a definite distinction between the operations that preserve the states of the system and those that disturb the states. The principle is derived by alternately applying a fundamental property of classical signals and a fundamental property of quantum ones. The principle can be cast into a simple form by using a decomposition of the relevant Hilbert space, which is uniquely determined by the set of possible states. The decomposition implies the classification of the degrees of freedom of the system into three parts depending on how they store the information on the initially chosen state: one storing it classically, one storing it nonclassically, and the other one storing no information. Then the principle states that the nonclassical part is inaccessible and the classical part is read-only if we are to preserve the state of the system. From this principle, many types of no-cloning, no-broadcasting, and no-imprinting conditions can easily be derived in general forms including mixed states. It also gives a unified view on how various schemes of quantum cryptography work. The principle helps one to derive optimum amount of resources (bits, qubits, and ebits) required in data compression or in quantum teleportation of mixed-state ensembles", "fulltext": "", "keywords": "quantum system;hilbert space;nonclassical part;degrees of freedom;partially known quantum states;quantum teleportation;secretly prepared quantum state;ebits;bits;quantum cryptography;classical signals;mixed-state ensembles;qubits"}
{"name": "train_1064", "title": "Quantum-controlled measurement device for quantum-state discrimination", "abstract": "We propose a \"programmable\" quantum device that is able to perform a specific generalized measurement from a certain set of measurements depending on a quantum state of a \"program register.\" In particular, we study a situation when the programmable measurement device serves for the unambiguous discrimination between nonorthogonal states. The particular pair of states that can be unambiguously discriminated is specified by the state of a program qubit. The probability of successful discrimination is not optimal for all admissible pairs. However, for some subsets it can be very close to the optimal value", "fulltext": "", "keywords": "quantum-state discrimination;quantum-controlled measurement device;quantum state;nonorthogonal states;programmable quantum device;program register;program qubit"}
{"name": "train_1065", "title": "Quantum universal variable-length source coding", "abstract": "We construct an optimal quantum universal variable-length code that achieves the admissible minimum rate, i.e., our code is used for any probability distribution of quantum states. Its probability of exceeding the admissible minimum rate exponentially goes to 0. Our code is optimal in the sense of its exponent. In addition, its average error asymptotically tends to 0", "fulltext": "", "keywords": "quantum information theory;quantum universal variable-length source coding;admissible minimum rate;optimal code;quantum states;optimal quantum universal variable-length code;probability distribution;average error;exponent;quantum cryptography"}
{"name": "train_1066", "title": "Application of artificial intelligence to search ground-state geometry of", "abstract": "clusters We introduce a global optimization procedure, the neural-assisted genetic algorithm (NAGA). It combines the power of an artificial neural network (ANN) with the versatility of the genetic algorithm. This method is suitable to solve optimization problems that depend on some kind of heuristics to limit the search space. If a reasonable amount of data is available, the ANN can \"understand\" the problem and provide the genetic algorithm with a selected population of elements that will speed up the search for the optimum solution. We tested the method in a search for the ground-state geometry of silicon clusters. We trained the ANN with information about the geometry and energetics of small silicon clusters. Next, the ANN learned how to restrict the configurational space for larger silicon clusters. For Si/sub 10/ and Si/sub 20/, we noticed that the NAGA is at least three times faster than the \"pure\" genetic algorithm. As the size of the cluster increases, it is expected that the gain in terms of time will increase as well", "fulltext": "", "keywords": "neural-assisted genetic algorithm;si/sub 20/;cluster size;ground-state geometry;atomic clusters;artificial intelligence;optimum solution;si/sub 10/;artificial neural network;population;silicon clusters;global optimization procedure"}
{"name": "train_1067", "title": "Quantum-information processing by nuclear magnetic resonance: Experimental", "abstract": "implementation of half-adder and subtractor operations using an oriented spin-7/2 system The advantages of using quantum systems for performing many computational tasks have already been established. Several quantum algorithms have been developed which exploit the inherent property of quantum systems such as superposition of states and entanglement for efficiently performing certain tasks. The experimental implementation has been achieved on many quantum systems, of which nuclear magnetic resonance has shown the largest progress in terms of number of qubits. This paper describes the use of a spin-7/2 as a three-qubit system and experimentally implements the half-adder and subtractor operations. The required qubits are realized by partially orienting /sup 133/Cs nuclei in a liquid-crystalline medium, yielding a quadrupolar split well-resolved septet. Another feature of this paper is the proposal that labeling of quantum states of system can be suitably chosen to increase the efficiency of a computational task", "fulltext": "", "keywords": "quadrupolar split well-resolved septet;/sup 133/cs;quantum-information processing;computational tasks;quantum systems;quantum states;/sup 133/cs nuclei;nuclear magnetic resonance;state superposition;computational task;subtractor operations;half-adder operations;quantum algorithms;entanglement;oriented spin-7/2 system;three-qubit system;liquid-crystalline medium;qubits"}
{"name": "train_1068", "title": "Quantum phase gate for photonic qubits using only beam splitters and", "abstract": "postselection We show that a beam splitter of reflectivity one-third can be used to realize a quantum phase gate operation if only the outputs conserving the number of photons on each side are postselected", "fulltext": "", "keywords": "postselection;photonic qubits;quantum computation;quantum phase gate;photon number conservation;postselected quantum phase gate;quantum phase gate operation;multiqubit networks;postselected quantum gate;outputs;postselected photon number conserving outputs;quantum information processing;optical quantum gate operations;polarization beam splitters;reflectivity"}
{"name": "train_1069", "title": "Entangling atoms in bad cavities", "abstract": "We propose a method to produce entangled spin squeezed states of a large number of atoms inside an optical cavity. By illuminating the atoms with bichromatic light, the coupling to the cavity induces pairwise exchange of excitations which entangles the atoms. Unlike most proposals for entangling atoms by cavity QED, our proposal does not require the strong coupling regime g/sup 2// kappa Gamma >>1, where g is the atom cavity coupling strength, kappa is the cavity decay rate, and Gamma is the decay rate of the atoms. In this work the important parameter is Ng/sup 2// kappa Gamma , where N is the number of atoms, and our proposal permits the production of entanglement in bad cavities as long as they contain a large number of atoms", "fulltext": "", "keywords": "bichromatic light illumination;strong coupling regime;pairwise exchange;atom cavity coupling strength;excitations;coupling;entangled spin squeezed states;optical cavity;cavity qed;bad cavities;atom entanglement;cavity decay rate"}
{"name": "train_107", "title": "Deterministic single-photon source for distributed quantum networking", "abstract": "A sequence of single photons is emitted on demand from a single three-level atom strongly coupled to a high-finesse optical cavity. The photons are generated by an adiabatically driven stimulated Raman transition between two atomic ground states, with the vacuum field of the cavity stimulating one branch of the transition, and laser pulses deterministically driving the other branch. This process is unitary and therefore intrinsically reversible, which is essential for quantum communication and networking, and the photons should be appropriate for all-optical quantum information processing", "fulltext": "", "keywords": "adiabatically driven stimulated raman transition;deterministic single-photon source;all-optical quantum information processing;single three-level atom;quantum communication;high-finesse optical cavity;distributed quantum networking;vacuum field"}
{"name": "train_1070", "title": "Universal simulation of Hamiltonian dynamics for quantum systems with", "abstract": "finite-dimensional state spaces What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd et al. [Phys. Rev. A 65, 040301(R) (2002)] provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling N-qubit Hamiltonian, and local unitaries. We extend this result to the case where the component systems are qudits, that is, have D dimensions. As a consequence we explain how universal quantum computation can be performed with any fixed two-body entangling N-qudit Hamiltonian, and local unitaries", "fulltext": "", "keywords": "d-dimensional component systems;two-body hamiltonian evolution;composite quantum system;quantum dynamics;hamiltonian dynamics;fixed two-body entangling n-qubit hamiltonian;quantum systems;universal quantum computation;local unitaries;fixed two-body entangling n-qudit hamiltonian;universal simulation;finite- dimensional state spaces"}
{"name": "train_1071", "title": "Dense coding in entangled states", "abstract": "We consider the dense coding of entangled qubits shared between two parties, Alice and Bob. The efficiency of classical information gain through quantum entangled qubits is also considered for the case of pairwise entangled qubits and maximally entangled qubits. We conclude that using the pairwise entangled qubits can be more efficient when two parties communicate whereas using the maximally entangled qubits can be more efficient when the N parties communicate", "fulltext": "", "keywords": "entangled states;classical information gain efficiency;dense coding;pairwise entangled qubits;alice;bob;quantum communication;maximally entangled qubits;quantum information processing"}
{"name": "train_1072", "title": "Quantum-state information retrieval in a Rydberg-atom data register", "abstract": "We analyze a quantum search protocol to retrieve phase information from a Rydberg-atom data register using a subpicosecond half-cycle electric field pulse. Calculations show that the half-cycle pulse can perform the phase retrieval only within a range of peak field values. By varying the phases of the constituent orbitals of the Rydberg wave packet register, we demonstrate coherent control of the phase retrieval process. By specially programming the phases of the orbitals comprising the initial wave packet, we show that it is possible to use the search method as a way to synthesize single energy eigenstates", "fulltext": "", "keywords": "half-cycle pulse;coherent control;phase retrieval;subpicosecond half-cycle electric field pulse;phase information;constituent orbitals;rydberg-atom data register;rydberg wave packet register;initial wave packet;quantum search protocol;quantum-state information retrieval;peak field values;search method;single energy eigenstates"}
{"name": "train_1073", "title": "Quantum retrodiction in open systems", "abstract": "Quantum retrodiction involves finding the probabilities for various preparation events given a measurement event. This theory has been studied for some time but mainly as an interesting concept associated with time asymmetry in quantum mechanics. Recent interest in quantum communications and cryptography, however, has provided retrodiction with a potential practical application. For this purpose quantum retrodiction in open systems should be more relevant than in closed systems isolated from the environment. In this paper we study retrodiction in open systems and develop a general master equation for the backward time evolution of the measured state, which can be used for calculating preparation probabilities. We solve the master equation, by way of example, for the driven two-level atom coupled to the electromagnetic field", "fulltext": "", "keywords": "time asymmetry;probabilities;quantum retrodiction;measurement event;open systems;retrodictive master equation;cryptography;driven two level atom-electromagnetic field coupling;preparation events;quantum communications;quantum mechanics;preparation probabilities;backward time evolution"}
{"name": "train_1074", "title": "Inhibiting decoherence via ancilla processes", "abstract": "General conditions are derived for preventing the decoherence of a single two-state quantum system (qubit) in a thermal bath. The employed auxiliary systems required for this purpose are merely assumed to be weak for the general condition while various examples such as extra qubits and extra classical fields are studied for applications in quantum information processing. The general condition is confirmed by well known approaches toward inhibiting decoherence. An approach to decoherence-free quantum memories and quantum operations is presented by placing the qubit into the center of a sphere with extra qubits on its surface", "fulltext": "", "keywords": "general condition;single two-state quantum system;quantum operations;decoherence-free quantum memories;extra classical fields;qubit;extra qubits;ancilla processes;thermal bath;decoherence;auxiliary systems;quantum information processing;sphere surface;decoherence inhibition"}
{"name": "train_1075", "title": "Numerical simulation of information recovery in quantum computers", "abstract": "Decoherence is the main problem to be solved before quantum computers can be built. To control decoherence, it is possible to use error correction methods, but these methods are themselves noisy quantum computation processes. In this work, we study the ability of Steane's and Shor's fault-tolerant recovering methods, as well as a modification of Steane's ancilla network, to correct errors in qubits. We test a way to measure correctly ancilla's fidelity for these methods, and state the possibility of carrying out an effective error correction through a noisy quantum channel, even using noisy error correction methods", "fulltext": "", "keywords": "ancilla fidelity;numerical simulation;error correction methods;quantum computers;noisy quantum computation processes;fault-tolerant recovering methods;noisy quantum channel;noisy error correction methods;decoherence control;ancilla network;information recovery;qubits"}
{"name": "train_1076", "title": "Delayed-choice entanglement swapping with vacuum-one-photon quantum states", "abstract": "We report the experimental realization of a recently discovered quantum-information protocol by Peres implying an apparent nonlocal quantum mechanical retrodiction effect. The demonstration is carried out by a quantum optical method by which each singlet entangled state is physically implemented by a two-dimensional subspace of Fock states of a mode of the electromagnetic field, specifically the space spanned by the vacuum and the one-photon state, along lines suggested recently by E. Knill et al. [Nature (London) 409, 46 (2001)] and by M. Duan et al. [ibid. 414, 413 (2001)]", "fulltext": "", "keywords": "fock states;state entanglement;two-dimensional subspace;quantum optical method;one-photon state;quantum-information;singlet entangled state;delayed-choice entanglement;nonlocal quantum mechanical retrodiction effect;electromagnetic field mode;vacuum-one-photon quantum states;vacuum state"}
{"name": "train_1077", "title": "Quantum learning and universal quantum matching machine", "abstract": "Suppose that three kinds of quantum systems are given in some unknown states |f>/sup (X)N/, |g/sub 1/>/sup (X)K/, and |g/sub 2/>/sup (X)K/, and we want to decide which template state |g/sub 1/> or |g/sub 2/>, each representing the feature of the pattern class C/sub 1/ or C/sub 2/, respectively, is closest to the input feature state |f>. This is an extension of the pattern matching problem into the quantum domain. Assuming that these states are known a priori to belong to a certain parametric family of pure qubit systems, we derive two kinds of matching strategies. The first one is a semiclassical strategy that is obtained by the natural extension of conventional matching strategies and consists of a two-stage procedure: identification (estimation) of the unknown template states to design the classifier (learning process to train the classifier) and classification of the input system into the appropriate pattern class based on the estimated results. The other is a fully quantum strategy without any intermediate measurement, which we might call as the universal quantum matching machine. We present the Bayes optimal solutions for both strategies in the case of K=1, showing that there certainly exists a fully quantum matching procedure that is strictly superior to the straightforward semiclassical extension of the conventional matching strategy based on the learning process", "fulltext": "", "keywords": "learning process;two-stage procedure;semiclassical strategy;quantum domain;quantum strategy;quantum learning;matching strategies;universal quantum matching machine;qubit systems;matching strategy;bayes optimal solutions;semiclassical extension;pattern matching problem;quantum matching procedure;pattern class"}
{"name": "train_1078", "title": "Action aggregation and defuzzification in Mamdani-type fuzzy systems", "abstract": "Discusses the issues of action aggregation and defuzzification in Mamdani-type fuzzy systems. The paper highlights the shortcomings of defuzzification techniques associated with the customary interpretation of the sentence connective 'and' by means of the set union operation. These include loss of smoothness of the output characteristic and inaccurate mapping of the fuzzy response. The most appropriate procedure for aggregating the outputs of different fuzzy rules and converting them into crisp signals is then suggested. The advantages in terms of increased transparency and mapping accuracy of the fuzzy response are demonstrated", "fulltext": "", "keywords": "transparency;set union operation;crisp signals;mapping accuracy;sentence connective;mamdani-type fuzzy systems;fuzzy response;defuzzification;fuzzy rules;action aggregation"}
{"name": "train_1079", "title": "A novel robot hand with embedded shape memory alloy actuators", "abstract": "Describes the development of an active robot hand, which allows smooth and lifelike motions for anthropomorphic grasping and fine manipulations. An active robot finger 10 mm in outer diameter with a shape memory alloy (SMA) wire actuator embedded in the finger with a constant distance from the geometric centre of the finger was designed and fabricated. The practical specifications of the SMA wire and the flexible rod were determined on the basis of a series of formulae. The active finger consists of two bending parts, the SMA actuators and a connecting part. The mechanical properties of the bending part are investigated. The control system on the basis of resistance feedback is also presented. Finally, a robot hand with three fingers was designed and the grasping experiment was carried out to demonstrate its performance", "fulltext": "", "keywords": "lifelike motions;active finger;flexible rod;embedded shape memory alloy actuators;resistance feedback;anthropomorphic grasping;fine manipulations;active robot hand"}
{"name": "train_108", "title": "Exploiting randomness in quantum information processing", "abstract": "We consider how randomness can be made to play a useful role in quantum information processing-in particular, for decoherence control and the implementation of quantum algorithms. For a two-level system in which the decoherence channel is non-dissipative, we show that decoherence suppression is possible if memory is present in the channel. Random switching between two potentially harmful noise sources can then provide a source of stochastic control. Such random switching can also be used in an advantageous way for the implementation of quantum algorithms", "fulltext": "", "keywords": "stochastic control;noise;randomness;two-level system;quantum algorithms;random switching;decoherence control;quantum information processing"}
{"name": "train_1080", "title": "Car-caravan snaking. 2 Active caravan braking", "abstract": "For part 1, see ibid., p.707-22. Founded on the review and results of Part 1, Part 2 contains a description of the virtual design of an active braking system for caravans or other types of trailer, to suppress snaking vibrations, while being simple from a practical viewpoint. The design process and the design itself are explained. The performance is examined by simulations and it is concluded that the system is effective, robust and realizable with modest and available components", "fulltext": "", "keywords": "active caravan braking;virtual design;dynamics;car-caravan snaking;trailer;snaking vibrations suppression"}
{"name": "train_1081", "title": "Stability of W-methods with applications to operator splitting and to geometric", "abstract": "theory We analyze the stability properties of W-methods applied to the parabolic initial value problem u' + Au = Bu. We work in an abstract Banach space setting, assuming that A is the generator of an analytic semigroup and that B is relatively bounded with respect to A. Since W-methods treat the term with A implicitly, whereas the term involving B is discretized in an explicit way, they can be regarded as splitting methods. As an application of our stability results, convergence for nonsmooth initial data is shown. Moreover, the layout of a geometric theory for discretizations of semilinear parabolic problems u' + Au = f (u) is presented", "fulltext": "", "keywords": "nonsmooth initial data;geometric theory;analytic semigroup;linearly implicit runge-kutta methods;abstract banach space;w-methods stability;parabolic initial value problem;operator splitting"}
{"name": "train_1082", "title": "Numerical approximation of nonlinear BVPs by means of BVMs", "abstract": "Boundary Value Methods (BVMs) would seem to be suitable candidates for the solution of nonlinear Boundary Value Problems (BVPs). They have been successfully used for solving linear BVPs together with a mesh selection strategy based on the conditioning of the linear systems. Our aim is to extend this approach so as to use them for the numerical approximation of nonlinear problems. For this reason, we consider the quasi-linearization technique that is an application of the Newton method to the nonlinear differential equation. Consequently, each iteration requires the solution of a linear BVP. In order to guarantee the convergence to the solution of the continuous nonlinear problem, it is necessary to determine how accurately the linear BVPs must be solved. For this goal, suitable stopping criteria on the residual and on the error for each linear BVP are given. Numerical experiments on stiff problems give rather satisfactory results, showing that the experimental code, called TOM, that uses a class of BVMs and the quasi-linearization technique, may be competitive with well known solvers for BVPs", "fulltext": "", "keywords": "stopping criteria;mesh selection strategy;quasi-linearization technique;boundary value methods;bvms;newton method;stiff problems;nonlinear differential equation;numerical approximation;nonlinear boundary value problems"}
{"name": "train_1083", "title": "Differential algebraic systems anew", "abstract": "It is proposed to figure out the leading term in differential algebraic systems more precisely. Low index linear systems with those properly stated leading terms are considered in detail. In particular, it is asked whether a numerical integration method applied to the original system reaches the inherent regular ODE without conservation, i.e., whether the discretization and the decoupling commute in some sense. In general one cannot expect this commutativity so that additional difficulties like strong stepsize restrictions may arise. Moreover, abstract differential algebraic equations in infinite-dimensional Hilbert spaces are introduced, and the index notion is generalized to those equations. In particular, partial differential algebraic equations are considered in this abstract formulation", "fulltext": "", "keywords": "stepsize restrictions;numerical integration method;low index linear systems;abstract differential algebraic equations;commutativity;differential algebraic systems;inherent regular ode"}
{"name": "train_1084", "title": "On quasi-linear PDAEs with convection: applications, indices, numerical", "abstract": "solution For a class of partial differential algebraic equations (PDAEs) of quasi-linear type which include nonlinear terms of convection type, a possibility to determine a time and spatial index is considered. As a typical example we investigate an application from plasma physics. Especially we discuss the numerical solution of initial boundary value problems by means of a corresponding finite difference splitting procedure which is a modification of a well-known fractional step method coupled with a matrix factorization. The convergence of the numerical solution towards the exact solution of the corresponding initial boundary value problem is investigated. Some results of a numerical solution of the plasma PDAE are given", "fulltext": "", "keywords": "indices;initial boundary value problems;plasma physics;quasi-linear partial differential algebraic equations;numerical solution;finite difference splitting procedure;spatial index;convection;fractional step method;matrix factorization"}
{"name": "train_1085", "title": "A variable-stepsize variable-order multistep method for the integration of", "abstract": "perturbed linear problems G. Scheifele (1971) wrote the solution of a perturbed oscillator as an expansion in terms of a new set of functions, which extends the monomials in the Taylor series of the solution. Recently, P. Martin and J.M. Ferrandiz (1997) constructed a multistep code based on the Scheifele technique, and it was generalized by D.J. Lopez and P. Martin (1998) for perturbed linear problems. However, the remarked codes are constant steplength methods, and efficient integrators must be able to change the steplength. In this paper we extend the ideas of F.T. Krogh (1974) from Adams methods to the algorithm proposed by Lopez and Martin, and we show the advantages of the new code in perturbed problems", "fulltext": "", "keywords": "multistep code;adams methods;perturbed linear problems integration;variable-stepsize variable-order multistep method;taylor series;constant steplength methods;monomials;perturbed oscillator"}
{"name": "train_1086", "title": "Some recent advances in validated methods for IVPs for ODEs", "abstract": "Compared to standard numerical methods for initial value problems (IVPs) for ordinary differential equations (ODEs), validated methods (often called interval methods) for IVPs for ODEs have two important advantages: if they return a solution to a problem, then (1) the problem is guaranteed to have a unique solution, and (2) an enclosure of the true solution is produced. We present a brief overview of interval Taylor series (ITS) methods for IVPs for ODEs and discuss some recent advances in the theory of validated methods for IVPs for ODEs. In particular, we discuss an interval Hermite-Obreschkoff (IHO) scheme for computing rigorous bounds on the solution of an IVP for an ODE, the stability of ITS and IHO methods, and a new perspective on the wrapping effect, where we interpret the problem of reducing the wrapping effect as one of finding a more stable scheme for advancing the solution", "fulltext": "", "keywords": "wrapping effect;interval hermite-obreschkoff scheme;interval methods;validated methods;ordinary differential equations;interval taylor series;qr algorithm;initial value problems"}
{"name": "train_1087", "title": "Implementation of DIMSIMs for stiff differential systems", "abstract": "Some issues related to the implementation of diagonally implicit multistage integration methods for stiff differential systems are discussed. They include reliable estimation of the local discretization error, construction of continuous interpolants, solution of nonlinear systems of equations by simplified Newton iterations, choice of initial stepsize and order, and step and order changing strategy. Numerical results are presented which indicate that an experimental Matlab code based on type 2 methods of order one, two and three outperforms ode15s code from Matlab ODE suite on problems whose Jacobian has eigenvalues which are close to the imaginary axis", "fulltext": "", "keywords": "stiff differential systems;simplified newton iterations;local discretization error;diagonally implicit multistage integration methods;reliable estimation;dimsims;nonlinear systems of equations;interpolants;experimental matlab code"}
{"name": "train_1088", "title": "Parallel implicit predictor corrector methods", "abstract": "The performance of parallel codes for the solution of initial value problems is usually strongly sensitive to the dimension of the continuous problem. This is due to the overhead related to the exchange of information among the processors and motivates the problem of minimizing the amount of communications. According to this principle, we define the so called Parallel Implicit Predictor Corrector Methods and in this class we derive A-stable, L-stable and numerically zero-stable formulas. The latter property refers to the zero-stability condition of a given formula when roundoff errors are introduced in its coefficients due to their representation in finite precision arithmetic. Some numerical experiment show the potentiality of this approach", "fulltext": "", "keywords": "roundoff errors;parallel implicit predictor corrector methods;finite precision arithmetic;numerically zero-stable formulas;initial value problems;zero-stability condition"}
{"name": "train_1089", "title": "Accuracy and stability of splitting with Stabilizing Corrections", "abstract": "This paper contains a convergence analysis for the method of stabilizing corrections, which is an internally consistent splitting scheme for initial-boundary value problems. To obtain more accuracy and a better treatment of explicit terms several extensions are regarded and analyzed. The relevance of the theoretical results is tested for convection-diffusion-reaction equations", "fulltext": "", "keywords": "stabilizing corrections;convection-diffusion-reaction equations;splitting scheme;convergence analysis;stability;initial-boundary value problems"}
{"name": "train_109", "title": "An entanglement measure based on the capacity of dense coding", "abstract": "An asymptotic entanglement measure for any bipartite states is derived in the light of the dense coding capacity optimized with respect to local quantum operations and classical communications. General properties and some examples with explicit forms of this entanglement measure are investigated", "fulltext": "", "keywords": "dense coding capacity;local quantum operations;optimization;classical communications;entanglement measure;asymptotic entanglement measure;bipartite states"}
{"name": "train_1090", "title": "On the contractivity of implicit-explicit linear multistep methods", "abstract": "This paper is concerned with the class of implicit-explicit linear multistep methods for the numerical solution of initial value problems for ordinary differential equations which are composed of stiff and nonstiff parts. We study the contractivity of such methods, with regard to linear autonomous systems of ordinary differential equations and a (scaled) Euclidean norm. In addition, we derive a strong stability result based on the stability regions of these methods", "fulltext": "", "keywords": "linear autonomous systems;ordinary differential equations;numerical solution;stability result;euclidean norm;contractivity;implicit-explicit linear multistep methods;initial value problems"}
{"name": "train_1091", "title": "Car-caravan snaking. 1. The influence of pintle pin friction", "abstract": "A brief review of knowledge of car-caravan snaking is carried out. Against the background described, a fairly detailed mathematical model of a contemporary car-trailer system is constructed and a baseline set of parameter values is given. In reduced form, the model is shown to give results in accordance with literature. The properties of the baseline combination are explored using both linear and non-linear versions of the model. The influences of damping at the pintle joint and of several other design parameters on the stability of the linear system in the neighbourhood of the critical snaking speed are calculated and discussed. Coulomb friction damping at the pintle pin is then included and simulations are used to indicate the consequent amplitude-dependent behaviour. The friction damping, especially when its level has to be chosen by the user, is shown to give dangerous characteristics, despite having some capacity for stabilization of the snaking motions. It is concluded that pintle pin friction damping does not represent a satisfactory solution to the snaking problem. The paper sets the scene for the development of an improved solution", "fulltext": "", "keywords": "mathematical model;pintle pin friction;amplitude-dependent behaviour;coulomb friction damping;car-caravan snaking;linear system;car-trailer system;critical snaking speed"}
{"name": "train_1092", "title": "Ride quality evaluation of an actively-controlled stretcher for an ambulance", "abstract": "This study considers the subjective evaluation of ride quality during ambulance transportation using an actively-controlled stretcher (ACS). The ride quality of a conventional stretcher and an assistant driver's seat is also compared. Braking during ambulance transportation generates negative foot-to-head acceleration in patients and causes blood pressure to rise in the patient's head. The ACS absorbs the foot-to-head acceleration by changing the angle of the stretcher, thus reducing the blood pressure variation. However, the ride quality of the ACS should be investigated further because the movement of the ACS may cause motion sickness and nausea. Experiments of ambulance transportation, including rapid acceleration and deceleration, are performed to evaluate the effect of differences in posture of the transported subject on the ride quality; the semantic differential method and factor analysis are used in the investigations. Subjects are transported using a conventional stretcher with head forward, a conventional stretcher with head backward, the ACS, and an assistant driver's seat for comparison with transportation using a stretcher. Experimental results show that the ACS gives the most comfortable transportation when using a stretcher. Moreover, the reduction of the negative foot-to-head acceleration at frequencies below 0.2 Hz and the small variation of the foot-to-head acceleration result in more comfortable transportation. Conventional transportation with the head forward causes the worst transportation, although the characteristics of the vibration of the conventional stretcher seem to be superior to that of the ACS", "fulltext": "", "keywords": "braking;motion sickness;factor analysis;head backward;assistant driver seat;conventional stretcher;ambulance;negative foot-to-head acceleration;rapid acceleration;stretcher angle;comfortable transportation;vibration;nausea;patient head;posture differences;head forward;subjective evaluation;rapid deceleration;blood pressure variation;actively-controlled stretcher;transported subject;ambulance transportation;ride quality evaluation;semantic differential method"}
{"name": "train_1093", "title": "A fuzzy logic approach to accommodate thermal stress and improve the start-up", "abstract": "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 the steam turbine plant start-up time, without violating maximum thermal stress limits. An existing start-up schedule provides the benchmark by which the performance of candidate controllers is assessed. Improvements regarding possible reduced start-up times and satisfaction of maximum thermal stress restrictions have been realized using the proposed control scheme", "fulltext": "", "keywords": "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"}
{"name": "train_1094", "title": "Efficient allocation of knowledge in distributed business structures", "abstract": "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 'information objects' in the CIS allows an efficient allocation of information in all business process steps at any time. Furthermore, the specific availability of heterogeneous, distributed data is realized by a Web-based user interface, which enables effective search by a multidimensionally hierarchical composition", "fulltext": "", "keywords": "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 allocation"}
{"name": "train_1095", "title": "Development of a real-time monitoring system", "abstract": "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 monitoring, including identification of deterioration of the healthy condition and identification of causes of the failure in real-time. For this reason a fault database is developed which contains the collected information about various states of operation of the system in the form of pattern vectors. The task of the real-time monitoring system is to correlate patterns of unknown faults with the known fault signatures in the fault database. This will determine cause of failure and degree of deterioration of the system under test. The problem of fault diagnosis may involve a large number of patterns and large sampling time, which affects the learning stage of neural networks. The study here also aims to find a fast learning model of neural networks for instances when a high number of patterns and numerous processing elements are involved. It begins searching for an appropriate solution. The study is extended to the enforcement learning models and considers LVQ as a network emerged from the competitive learning model through enforcement training. Finally, tests show an accuracy of 92.3 per cent in the fault diagnostic capability of the technique", "fulltext": "", "keywords": "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 identification;fault signatures;lvq;cnc machine centre;real-time monitoring system;deterioration identification;neural networks"}
{"name": "train_1096", "title": "Evaluating alternative manufacturing control strategies using a benchmark", "abstract": "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 manufacturing environments and to investigate the relationship between the 'control' and 'controlled' systems. The experimental test-bed presented in this paper consists of an agent-based control system (implemented in C++) and a discrete-event simulation model. Using this test-bed, various control strategies were tested on a benchmark manufacturing system by varying production volumes (to model the production system with looser/tighter schedules) and disturbance frequencies. It was found that hybrid strategies that combine reactive agent mechanisms (and allocation strategies such as the contract net) with appropriate job sequencing heuristics provide the best performance, particularly when job congestion increases on a shop-floor", "fulltext": "", "keywords": "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 strategies;job sequencing decisions;distributed control system;disturbance frequencies"}
{"name": "train_1097", "title": "A study on an automatic seam tracking system by using an electromagnetic sensor", "abstract": "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 generation of an eddy current, was developed for detecting the weld line of a butt joint in which the root gap size was zero. An automatic seam tracking system designed for sheet metal arc welding was constructed with a sensor. Through experiments, it was revealed that the system had an excellent seam tracking accuracy of the order of +or-0.2 mm", "fulltext": "", "keywords": "automatic seam tracking system;seam tracking accuracy;weld line detection;root gap size;sheet metal arc welding;electromagnetic sensor;butt joints;eddy current generation"}
{"name": "train_1098", "title": "Instability phenomena in the gas-metal arc welding self-regulation process", "abstract": "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 to study stability of the self-regulation process and to develop a simulation program that helps to understand the transient or dynamic nature of the GMAW process and relationships among current, electrode extension and contact tube-work distance. The process is shown to exhibit instabilities at both long electrode extension and normal extension. Results obtained from simulation runs of the model were also experimentally confirmed by the present author, as reported in this study. In order to explain the concept of the instability phenomena, the metal transfer mode and the arc voltage-current characteristic were examined. Based on this examination, the conclusion of this study is that their combined effects lead to the oscillations in arc current and length", "fulltext": "", "keywords": "gas-metal arc welding;exact arc voltage characteristic;weld quality;instability phenomena;metal transfer mode;self-regulation process;gmaw process;arc instability"}
{"name": "train_1099", "title": "WebCAD: A computer aided design tool constrained with explicit 'design for", "abstract": "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-aware computer aided design (CAD) system called WebCAD has been developed. The system restricts the freedom of the designer in such a way that the designed parts can be manufactured on a three-axis computer numerical control milling machine. This paper discusses the vision of WebCAD and explains the rationale for its development in comparison with commercial CAD/CAM (computer aided design/manufacture) systems. The paper then goes on to describe the implementation issues that enforce the manufacturability rules. Finally, certain design tools are described that aid a user during the design process. Some examples are given of the parts designed and manufactured with WebCAD", "fulltext": "", "keywords": "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"}
{"name": "train_11", "title": "Does social capital determine innovation? To what extent?", "abstract": "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 innovation. In doing so, we have been led to follow the dominating view of the literature on social capital and innovation which claims that social capital cannot be captured through a single indicator, but that it actually takes many different forms that must be accounted for. Therefore, to the traditional explanatory variables of innovation, we have added five forms of structural social capital (business network assets, information network assets, research network assets, participation assets, and relational assets) and one form of cognitive social capital (reciprocal trust). In a context where empirical investigations regarding the relations between social capital and innovation are still scanty, this paper makes contributions to the advancement of knowledge in providing new evidence regarding the impact and the extent of social capital on innovation at the two decisionmaking stages considered in this study", "fulltext": "", "keywords": "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"}
{"name": "train_110", "title": "A switching synchronization scheme for a class of chaotic systems", "abstract": "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 robustness of the proposed scheme. We also present some simulation results", "fulltext": "", "keywords": "chaotic systems;robustness;switching synchronization scheme;state observers;piecewise-linear dynamics"}
{"name": "train_1100", "title": "Evaluation of existing and new feature recognition algorithms. 2. Experimental", "abstract": "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 been designed and implemented on a SUN Workstation in C++ using ACIS as the geometric modelling system. In this paper, extensive tests and comparative analysis are conducted on the feature detection algorithms, using carefully selected components from the public domain, mostly from the National Design Repository. The results show that the new and enhanced algorithms identify face sets that previously published algorithms cannot detect. The tests also show that each algorithm can detect, among other types, a certain type of feature that is unique to it. Hence, most of the algorithms discussed in this paper would have to be combined to obtain complete coverage", "fulltext": "", "keywords": "concavity;national design repository;face sets;general-purpose feature detection techniques;feature recognition algorithms;convex hull"}
{"name": "train_1101", "title": "Evaluation of existing and new feature recognition algorithms. 1. Theory and", "abstract": "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 components from the National Design Repository. The algorithms studied include previously published general-purpose feature detection algorithms such as the single-face inner-loop and concavity techniques. Others are improvements to existing algorithms such as extensions of the two-dimensional convex hull method to handle curved faces as well as protrusions. Lastly, new algorithms based on the three-dimensional convex hull, minimum concave, visible and multiple-face inner-loop face sets are described", "fulltext": "", "keywords": "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 inner-loop technique;depression faces;protrusion faces;multiple-face inner-loop face sets;concavity technique"}
{"name": "train_1102", "title": "Design and implementation of a reusable and extensible HL7 encoding/decoding", "abstract": "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 encoding rules. In this paper, we propose a flexible, reusable, and extensible HL7 encoding and decoding framework using a message object model (MOM) and message definition repository (MDR). The MOM provides an abstract HL7 message form represented by a group of objects and their relationships. It reflects logical relationships among the standard HL7 message elements such as segments, fields, and components, while enforcing the key structural constraints imposed by the standard. Since the MOM completely eliminates the dependency of the HL7 encoder and decoder on platform-specific data formats, it makes it possible to build the encoder and decoder as reusable standalone software components, enabling the interconnection of arbitrary heterogeneous hospital information systems (HIS) with little effort. Moreover, the MDR, an external database of key definitions for HL7 messages, helps make the encoder and decoder as resilient as possible to future modifications of the standard HL7 message formats. It is also used by the encoder and decoder to perform a well-formedness check for their respective inputs (i.e., HL7 message objects expressed in the MOM and encoded HL7 message strings). Although we implemented a prototype version of the encoder and decoder using JAVA, they can be easily packaged and delivered as standalone components using the standard component frameworks", "fulltext": "", "keywords": "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;his;activex;administrative information;reusable framework;javabean;hl7 message formats;external database;key definitions;heterogeneous hospital information systems"}
{"name": "train_1103", "title": "New age computing [autonomic computing]", "abstract": "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 little memory, but that they crash all too often. This article reviews current initiatives being carried out in the AC field by the IT industry, followed by key challenges which require to be addressed in its development and implementation", "fulltext": "", "keywords": "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"}
{"name": "train_1104", "title": "A 3-stage pipelined architecture for multi-view images decoder", "abstract": "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 of the pixels of the decoded image every clock. The multi-view images decoder consists of three modules, Node selector which transfers the value of the nodes repeatedly and Depth Extractor which extracts the depth of each pixel from the four values of the nodes and Affine Transformer which generates the projecting position on the image plane from the values of the pixels and the specified viewpoint. The proposed architecture is designed and simulated by the Max+PlusII design tool and the operating frequency is 30 MHz. The image can be constructed in a real time by the decoder with the proposed architecture", "fulltext": "", "keywords": "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"}
{"name": "train_1105", "title": "Fuzzy business [Halden Reactor Project]", "abstract": "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 Engineering, using real data from a US PWR plant. These tests showed that PEANO could reliably assess the performance of the process instrumentation at different plant conditions. Real cases of zero and span drifts were successfully detected by the system. TEMPO is a system for thermal performance monitoring and optimisation, which relies on plant-wide first principle models. The system has been installed on a Swedish BWR plant. Results obtained show an overall rms deviation from measured values of a few tenths of a percent, and giving goodness-of-fits in the order of 95%. The high accuracy demonstrated is a good basis for detecting possible faults and efficiency losses in steam turbine cycles", "fulltext": "", "keywords": "feedwater flow;calibration;thermal performance monitoring;steam generators;pwr;bwr;steam turbine cycles;peano;artificial intelligence;tempo;halden reactor project;fuzzy logic"}
{"name": "train_1106", "title": "Virtual projects at Halden [Reactor Project]", "abstract": "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 design and computer-based support system areas. The work is based on experiments and demonstrations carried out in the experimental facility HAMMLAB. Pilot-versions of several operator aids are adopted and integrated to the HAMMLAB simulators and demonstrated in a full dynamic setting. The Halden virtual reality laboratory has recently become an integral and important part of the programme", "fulltext": "", "keywords": "computer-based support system;virtual reality;man-machine systems programme;human factors;control room design;safety;halden reactor project;reliability"}
{"name": "train_1107", "title": "A knowledge-navigation system for dimensional metrology", "abstract": "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 base of dimensional metrology with many interconnections. This paper describes an approach to create a dimensional metrology knowledge base that is organized around a set of key concepts and to represent those concepts as virtual objects that can be navigated with interactive, computer visualization techniques to access the associated knowledge. The approach can enable several applications. First is the application to convey the definition and meaning of GD&T over a broad range of tolerance types. Second is the application to provide a visualization of dimensional metrology knowledge within a control hierarchy of the inspection process. Third is the application to show the coverage of interoperability standards to enable industry to make decisions on standards development and harmonization efforts. A prototype system has been implemented to demonstrate the principles involved in the approach", "fulltext": "", "keywords": "knowledge navigation;geometric dimensioning;web;dimensional metrology;visualization;manufacturing training;vrml;inspection;tolerancing;interoperability standards"}
{"name": "train_1108", "title": "The visible cement data set", "abstract": "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, France in September 2000. Most of the images obtained are for hydrating portland cement pastes, with a few data sets representing hydrating Plaster of Paris and a common building brick. All of these data sets are being made available on the Visible Cement Data Set website at http://visiblecement.nist.gov. The website includes the raw 3-D datafiles, a description of the material imaged for each data set, example two-dimensional images and visualizations for each data set, and a collection of C language computer programs that will be of use in processing and analyzing the 3-D microstructural images. This paper provides the details of the experiments performed at the ESRF, the analysis procedures utilized in obtaining the data set files, and a few representative example images for each of the three materials investigated", "fulltext": "", "keywords": "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"}
{"name": "train_1109", "title": "The existence condition of gamma -acyclic database schemes with MVDs", "abstract": "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 to improve query performance of the database system. Thus what conditions are needed to generate a gamma -acyclic database scheme for a given relational scheme? In this paper, the sufficient and necessary condition of the existence of gamma -acyclic, join-lossless and dependencies-preserved database schemes meeting 4NF is given", "fulltext": "", "keywords": "query performance;connected join expression;mvds constraints;gamma -acyclic database schemes;large-scale system;existence condition;sufficient and necessary condition;database technology"}
{"name": "train_111", "title": "Modification for synchronization of Rossler and Chen chaotic systems", "abstract": "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 overcome this limitation. An adaptive synchronization controller, which can make the states of two identical Rossler and Chen systems globally asymptotically synchronized in the presence of system's unknown constant parameters, is derived. Especially, when some unknown parameters are positive, we can make the controller more simple, besides, the controller is independent of those positive uncertain parameters. At last, when the condition that arbitrary unknown parameters in two systems are identical constants is cancelled, we demonstrate that it is possible to synchronize two chaotic systems. All results are proved using a well-known Lyapunov stability theorem. Numerical simulations are given to validate the proposed synchronization approach", "fulltext": "", "keywords": "adaptive synchronization controller;active control;global asymptotic synchronization;lyapunov stability theory;response systems;chen chaotic systems;rossler chaotic systems;synchronization"}
{"name": "train_1110", "title": "A hybrid model for smoke simulation", "abstract": "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 airflow by controlling particles' movement and fragmentation. In addition, a continuous density field for realistic rendering can be generated quickly through the look-up tables of particle's density functions. Compared with traditional particle systems, this approach can describe smoke diffusion, and provide a continuous density field for realistic rendering with much less computation. A quick rendering scheme is also presented in this paper as a useful preview tool for tuning appropriate parameters in the smoke model", "fulltext": "", "keywords": "look-up tables;rendering;smoke simulation;hybrid model;continuous density field;density functions"}
{"name": "train_1111", "title": "The contiguity in R/M", "abstract": "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/sub wtt/(B)] for any r.e. sets A, B such that deg/sub T/(A),deg/sub T/(B) in [c]. It is proved in this paper that every nonzero element in R/M is not contiguous, i.e., for every element [c] in R/M, if [c] not=[o] then there exist at least two r.e. sets A, B such that deg/sub T/(A), deg/sub T/(B) in [c] and [deg/sub wtt/(A)] not=[deg/sub wtt/(B)]", "fulltext": "", "keywords": "upper semilattice;turing degree;recursion theory;contiguity;nonzero element;recursively enumerable set"}
{"name": "train_1112", "title": "Blending parametric patches with subdivision surfaces", "abstract": "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 is employed both to blend parametric bicubic B-spline surfaces and to fill n-sided holes. It is easy to produce piecewise-smooth subdivision surfaces with both convex and concave corners on the boundary, and limit surfaces are guaranteed to be C/sup 2/ continuous on the boundaries except for a few singular points by the removing-boundary approach. Thus the blending method is very efficient and the blending surface generated is of good effect", "fulltext": "", "keywords": "subdivision surfaces;piecewise-smooth subdivision surfaces;piecewise smooth subdivision surfaces;parametric bicubic b-spline surfaces;quadrilaterals;parametric surfaces blending;subdivision patches"}
{"name": "train_1113", "title": "Word spotting based on a posterior measure of keyword confidence", "abstract": "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 for evaluating relative confidence measures by word spotting task. In a word spotting experiment with a vocabulary of 240 keywords, the keyword accuracy under the AP measure is above 94%, which well approaches its theoretical upper limit. In addition, a syllable lattice Hidden Markov Model (SLHMM) is formulated and a unified view of confidence estimation, word spotting, optimal path search, and N-best syllable re-scoring is presented. The proposed AP measure can be easily applied to various speech recognition systems as well", "fulltext": "", "keywords": "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;keyword confidence;word spotting task;word spotting;a posteriori confidence measure"}
{"name": "train_1114", "title": "A new algebraic modelling approach to distributed problem-solving in MAS", "abstract": "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 algebraic modelling of typical social behaviors, social situation and social dynamics is discussed in the context of distributed problem-solving in MAS. The comparison and simulation on distributed task allocations and resource assignments in MAS show more advantages of the algebraic approach than other conventional methods", "fulltext": "", "keywords": "social behaviors;multi-agent systems;distributed task allocations;resource assignments;unified framework;social dynamics;social intelligence;algebraic modelling approach;distributed problem-solving"}
{"name": "train_1115", "title": "Four-point wavelets and their applications", "abstract": "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 a new class of wavelets, called four-point wavelets, based on an interpolatory four-point subdivision scheme. They are of local support, symmetric and stable. The analysis and synthesis algorithms have linear time complexity. Depending on different weight parameters w, the scaling functions and wavelets generated by the four-point subdivision scheme are of different degrees of smoothness. Therefore the user can select better wavelets relevant to the practice among the classes of wavelets. The authors apply the four-point wavelets in signal compression. The results show that the four-point wavelets behave much better than B-spline wavelets in many situations", "fulltext": "", "keywords": "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"}
{"name": "train_1116", "title": "An interlingua-based Chinese-English MT system", "abstract": "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 analyzing and gives the design of interlingua in details. Experimental results and system evaluation are given. The result is satisfying", "fulltext": "", "keywords": "syntactic parsing;semantic analyzing;interlingua-based chinese-english machine translation system;information processing;natural language translation system"}
{"name": "train_1117", "title": "An attack-finding algorithm for security protocols", "abstract": "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. With exact causal dependency relations between messages considered in the model, this algorithm can avoid state space explosion caused by asynchronous composition. In order to get a finite state space, a new method called strand-added on demand is exploited, which extends a bundle in an incremental manner without requiring explicit configuration of protocol execution parameters. A finer granularity model of term structure is also introduced, in which subterms are divided into check subterms and data subterms. Moreover, data subterms can be further classified based on the compatible data subterm relation to obtain automatically the finite set of valid acceptable terms for an honest principal. In this algorithm, terms core is designed to represent the intruder's knowledge compactly, and forward search technology is used to simulate attack patterns easily. Using this algorithm, a new attack on the Dolve-Yao protocol can be found, which is even more harmful because the secret is revealed before the session terminates", "fulltext": "", "keywords": "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"}
{"name": "train_1118", "title": "Run-time data-flow analysis", "abstract": "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 paper presents a basic run-time privatization method. The definition of run-time dead code is given and its side effect is discussed. To eliminate the imprecision caused by the run-time dead code, backward data-flow information must be used. Proteus Test, which can use backward information in run-time, is then presented to exploit more dynamic parallelism. Also, a variation of Proteus Test, the Advanced Proteus Test, is offered to achieve partial parallelism. Proteus Test was implemented on the parallelizing compiler AFT. In the end of this paper the program fpppp.f of Spec95fp Benchmark is taken as an example, to show the effectiveness of Proteus Test", "fulltext": "", "keywords": "dynamic parallelism;run-time data flow analysis;run-time dead code;parallelizing compilers;proteus test;backward data-flow information;run-time privatization method"}
{"name": "train_1119", "title": "A component-based software configuration management model and its supporting", "abstract": "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 paper, the objects that need to be managed in CBSD is analyzed and a component-based SCM model is presented. In this model, components, as the integral logical constituents in a system, are managed as the basic configuration items in SCM, and the relationships between/among components are defined and maintained. Based on this model, a configuration management system is implemented", "fulltext": "", "keywords": "integral logical constituents;software development;version control;component-based software configuration management model;software reuse"}
{"name": "train_112", "title": "Revisiting Hardy's paradox: Counterfactual statements, real measurements,", "abstract": "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's scheme, and show that when they are actually performed, they yield strange and surprising outcomes. More generally, we claim that counterfactual paradoxes point to a deeper structure inherent to quantum mechanics", "fulltext": "", "keywords": "real measurements;gedanken-experiments;hardy paradox;entanglement;quantum mechanics;counterfactual statements;weak values;paradoxical effects"}
{"name": "train_1120", "title": "An effective feedback control mechanism for DiffServ architecture", "abstract": "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 when providing AF (Assured Forwarding) services, DiffServ has some problems such as unfairness among aggregated flows or among micro-flows belonging to an aggregated flow. In this paper, a feedback mechanism for AF aggregated flows is proposed to solve this problem. Simulation results show that this mechanism does improve the performance of DiffServ. First, it can improve the fairness among aggregated flows and make DiffServ more friendly toward TCP (Transmission Control Protocol) flows. Second, it can decrease the buffer requirements at the congested router and thus obtain lower delay and packet loss rate. Third, it also keeps almost the same link utility as in normal DiffServ. Finally, it is simple and easy to be implemented", "fulltext": "", "keywords": "diffserv;traffic conditioning;fairness;qos architecture;qos;tcp;af;feedback control;feedback mechanism;packet forwarding"}
{"name": "train_1121", "title": "Optimal bandwidth utilization of all-optical ring with a converter of degree 4", "abstract": "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 network contains a wavelength converter, any path that passes through this node may change its wavelength. Having converters at some of the nodes can reduce the number of wavelengths required for routing. This paper presents a wavelength converter with degree 4 and gives a routing algorithm which shows that any routing with load L can be realized with L wavelengths when a node of an all-optical ring hosts such a wavelength converter. It is also proved that 4 is the minimum degree of the converter to reach the full utilization of the available wavelengths if only one node of an all-optical ring hosts a converter", "fulltext": "", "keywords": "wavelength converter;all-optical network;all-optical ring;all-optical routing;wavelength translation;wavelength assignment;communication paths"}
{"name": "train_1122", "title": "Hybrid broadcast for the video-on-demand service", "abstract": "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 patching. Periodic broadcast, a typical server-initiated approach, can be entirety-based or segment-based. This paper focuses on the performance of the VoD service for popular videos. First, we analyze the limitation of conventional patching when the customer request rate is high. Then, by combining the advantages of each of the two broadcast schemes, we propose a hybrid broadcast scheme for popular videos, which not only lowers the service latency but also improves clients' interactivity by using an active buffering technique. This is shown to be a good compromise for both lowering service latency and improving the VCR-like interactivity", "fulltext": "", "keywords": "video-on-demand;hybrid broadcast scheme;conventional patching;quality-of-service;interactivity;scheduling;multicast;customer request rate"}
{"name": "train_1123", "title": "A transactional asynchronous replication scheme for mobile database systems", "abstract": "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 Transaction-Level Result-Set Propagation (TLRSP) model, is put forward in this paper. The conflict detection and resolution strategy based on TLRSP is discussed in detail, and the implementation algorithm is proposed. In order to compare the performance of the TLRSP model with that of other mobile replication schemes, we have developed a detailed simulation model. Experimental results show that the TLRSP model provides an efficient support for replicated mobile database systems by reducing reprocessing overhead and maintaining database consistency", "fulltext": "", "keywords": "mobile database replication;mobile computing;mobile database;conflict reconciliation;multidatabase;data replication;distributed database;transaction;transaction-level result-set propagation"}
{"name": "train_1124", "title": "Data extraction from the Web based on pre-defined schema", "abstract": "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 such documents remains a nontrivial task. In this paper, we present a schema-guided approach to extracting data from HTML pages. Under the approach, the user defines a schema specifying what to be extracted and provides sample mappings between the schema and the HTML page. The system will induce the mapping rules and generate a wrapper that takes the HTML page as input and produces the required data in the form of XML conforming to the user-defined schema. A prototype system implementing the approach has been developed. The preliminary experiments indicate that the proposed semi-automatic approach is not only easy to use but also able to produce a wrapper that extracts required data from inputted pages with high accuracy", "fulltext": "", "keywords": "internet;schema;information source;html;distributed database;queries;wrapper generation;data integration;data extraction"}
{"name": "train_1125", "title": "Structure of weakly invertible semi-input-memory finite automata with delay 1", "abstract": "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 invertible semi-input-memory finite automata with delay 1, in which the state graph of each autonomous finite automaton is a cycle. From a result on mutual invertibility of finite automata obtained by the authors recently, it leads to a characterization of the structure of feedforward inverse finite automata with delay 1", "fulltext": "", "keywords": "semi-input-memory;delay 1;weakly invertible;invertibility;feedforward inverse finite automata;semi-input-memory finite automata;state graph;finite automata"}
{"name": "train_1126", "title": "A note on an axiomatization of the core of market games", "abstract": "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-person TU game, it is shown that weak symmetry is redundant in this result. Hence, the core on market games is axiomatized by the remaining five properties, if the universe of players contains at least four members", "fulltext": "", "keywords": "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"}
{"name": "train_1127", "title": "Repeated games with lack of information on one side: the dual differential", "abstract": "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 approach: We identify the limit value of a repeated game in discrete time as the value of a differential game. Namely, we use the recursive structure for the finitely repeated version of the dual game to construct a differential game for which the upper values of the uniform discretization satisfy precisely the same property. The value of the dual differential game exists and is the unique viscosity solution of a first-order derivative equation with a limit condition. We identify the solution by translating viscosity properties in the primal", "fulltext": "", "keywords": "repeated games;discrete time;repeated game;viscosity solution;discrete time approximations;limit condition;limit value;dual differential game"}
{"name": "train_1128", "title": "The semi-algebraic theory of stochastic games", "abstract": "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, which hold uniformly for all stochastic games in which the number of states and players' actions are predetermined to some fixed values. As a corollary, we prove a uniform polynomial convergence rate of the value of the N-stage game to the value of the nondiscount game, over a bounded set of payoffs", "fulltext": "", "keywords": "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"}
{"name": "train_1129", "title": "Computing stationary Nash equilibria of undiscounted single-controller", "abstract": "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 copositive class so that Lemke's algorithm will process it. We will also do the same for a special class of N-person stochastic games called polymatrix stochastic games", "fulltext": "", "keywords": "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"}
{"name": "train_113", "title": "Quantum limit on computational time and speed", "abstract": "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 decide as to what type of interaction should be allowed in building quantum computers in achieving the desired speed", "fulltext": "", "keywords": "quantum computer;fundamental interactions;computational speed;quantum limit;computational time"}
{"name": "train_1130", "title": "Node-capacitated ring routing", "abstract": "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 and only if the so-called distance inequality holds for every choice of distance functions arising from nonnegative node weights. For rings, this (straightforward) result will be improved in two ways. We prove that, independent of the integrality of node capacities, it suffices to require the distance inequality only for distances arising from (0-1-2)-valued node weights, a requirement that will be called the double-cut condition. Moreover, for integer-valued node capacities, the double-cut condition implies the existence of a half-integral multicommodity flow. In this case there is even an integer-valued multicommodity flow that violates each node capacity by at most one. Our approach gives rise to a combinatorial, strongly polynomial algorithm to compute either a violating double-cut or a node-capacitated multicommodity flow. A relation of the problem to its edge-capacitated counterpart will also be explained", "fulltext": "", "keywords": "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;feasibility problem;node capacity integrality;node-capacitated ring routing;distance functions;integer-valued node capacities;farkas lemma;combinatorial strongly polynomial algorithm"}
{"name": "train_1131", "title": "A min-max theorem on feedback vertex sets", "abstract": "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 with strongly polynomial time algorithms for the feedback vertex set problem and the cycle packing problem on the corresponding bipartite tournaments. In addition, we show that the feedback vertex set problem on general bipartite tournaments is NP-complete and approximable within 3.5 based on the min-max theorem", "fulltext": "", "keywords": "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 tournament;necessary sufficient condition;covering cycles"}
{"name": "train_1132", "title": "Semidefinite programming vs. LP relaxations for polynomial programming", "abstract": "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 recent semidefinite programming (SDP) relaxations introduced by the author. The comparison is analyzed in light of recent results in real algebraic geometry on various representations of polynomials, positive on a compact semi-algebraic set", "fulltext": "", "keywords": "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"}
{"name": "train_1133", "title": "An analytic center cutting plane method for semidefinite feasibility problems", "abstract": "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 symmetric positive semidefinite matrix Gamma either confirms that Y epsilon Gamma or returns a cut, i.e., a symmetric matrix A such that Gamma is in the half-space {Y : A . Y <or= A . Y}. We study an analytic center cutting plane algorithm for this problem. At each iteration, the algorithm computes an approximate analytic center of a working set defined by the cutting plane system generated in the previous iterations. If this approximate analytic center is a solution, then the algorithm terminates; otherwise the new cutting plane returned by the oracle is added into the system. As the number of iterations increases, the working set shrinks and the algorithm eventually finds a solution to the problem. All iterates generated by the algorithm are positive definite matrices. The algorithm has a worst-case complexity of O*(m/sup 3// epsilon /sup 2/) on the total number of cuts to be used, where epsilon is the maximum radius of a ball contained by Gamma", "fulltext": "", "keywords": "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"}
{"name": "train_1134", "title": "Relationship between strong monotonicity property, P/sub 2/-property, and the", "abstract": "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/ is the space of all symmetric and real n * n matrices. In an attempt to characterize the P/sub 2/-property, they raised the following two questions: (i) Does the strong monotonicity imply the P/sub 2/-property? (ii) Does the GUS-property imply the P/sub 2/-property? In this paper, we show that the strong monotonicity property implies the P/sub 2/-property for any linear transformation and describe an equivalence between these two properties for Lyapunov and other transformations. We show by means of an example that the GUS-property need not imply the P/sub 2/-property, even for Lyapunov transformations", "fulltext": "", "keywords": "p/sub 2/-property;semidefinite linear complementarity problems;lyapunov transformations;strong monotonicity property;symmetric real matrices;linear transformation;gus-property"}
{"name": "train_1135", "title": "A combinatorial, graph-based solution method for a class of continuous-time", "abstract": "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 control theory are used. This paper solves optimal control problems by reducing them to the combinatorial search for the shortest path in a specially constructed graph. Since the nodes of the graph are weighted in a sequence-dependent manner, we extend the classical, shortest-path algorithm to our case. The proposed solution method is currently limited to single-state problems with multiple control functions. A production planning problem and a train operation problem are optimally solved to illustrate the method", "fulltext": "", "keywords": "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 optimal control problems"}
{"name": "train_1136", "title": "Q-learning for risk-sensitive control", "abstract": "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 stochastic approximation algorithms, with most of the work involved used for the analysis of the specific o.d.e.s that arise", "fulltext": "", "keywords": "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"}
{"name": "train_1137", "title": "On deciding stability of constrained homogeneous random walks and queueing", "abstract": "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 algorithmically undecidable. We also prove that stability of a homogeneous random walk in L/sub +//sup d/ is undecidable. Finally, we show that the problem of computing a fluid limit of a queueing system or of a constrained homogeneous random walk is undecidable. To the best of our knowledge these are the first undecidability results in the area of stability of queueing systems and random walks in L/sub +//sup d/. We conjecture that stability of common policies like First-In-First-Out and priority policy is also an undecidable problem", "fulltext": "", "keywords": "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"}
{"name": "train_1138", "title": "Approximating martingales for variance reduction in Markov process simulation", "abstract": "\"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 for obtaining variance reduction in Markov process simulation that is applicable to a vast array of different performance measures. The approach relies on the construction of a martingale that is then used as an internal control variate", "fulltext": "", "keywords": "variance reduction;performance measures;martingales;markov process simulation;approximating martingale-process method;complex stochastic processes;single-server queue;internal control variate"}
{"name": "train_1139", "title": "Development and evaluation of a case-based reasoning classifier for prediction", "abstract": "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 (931 benign) biopsy-proven mammographic cases. CBR similarity was defined using either the Hamming or Euclidean distance measure over case features. Ten features represented each case: calcification distribution, calcification morphology, calcification number, mass margin, mass shape, mass density, mass size, associated findings, special cases, and age. Performance was evaluated using Round Robin sampling, Receiver Operating Characteristic (ROC) analysis, and bootstrap. To determine the most influential features for the CBR, an exhaustive feature search was performed over all possible feature combinations (1022) and similarity thresholds. Influential features were defined as the most frequently occurring features in the feature subsets with the highest partial ROC areas (/sub 0.90/AUC). For CBR with Hamming distance, the most influential features were found to be mass margin, calcification morphology, age, calcification distribution, calcification number, and mass shape, resulting in an /sub 0.90/AUC of 0.33. At 95% sensitivity, the Hamming CBR would spare from biopsy 34% of the benign lesions. At 98% sensitivity, the Hamming CBR would spare 27% benign lesions. For the CBR with Euclidean distance, the most influential feature subset consisted of mass margin, calcification morphology, age, mass density, and associated findings, resulting in /sub 0.90/AUC of 0.37. At 95% sensitivity, the Euclidean CBR would spare from biopsy 41% benign lesions. At 98% sensitivity, the Euclidean CBR would spare 27% benign lesions. The profile of cases spared by both distance measures at 98% sensitivity indicates that the CBR is a potentially useful diagnostic tool for the classification of mammographic lesions, by recommending short-term follow-up for likely benign lesions that is in agreement with final biopsy results and mammographer's intuition", "fulltext": "", "keywords": "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 robin sampling;feature combinations;mammographic lesion classification;biopsy-proven mammographic cases;mass size;receiver operating characteristic analysis;short-term follow-up;feature subsets;highest partial roc areas;bi-rads lexicon;diagnostic tool;special cases;mass margin"}
{"name": "train_114", "title": "Cooperative three- and four-player quantum games", "abstract": "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", "fulltext": "", "keywords": "nonzero sum difficulty;quantum entanglement;quantum superposed operator;cooperative three-player quantum games;cooperative four-player quantum games;initial state"}
{"name": "train_1140", "title": "Computer aided classification of masses in ultrasonic mammography", "abstract": "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 normalized Nakagami parameters from two different images of a mass was undertaken to improve the performance of classification. Receiver operating characteristic (ROC) analysis showed that such an approach resulted in an area of 0.83 under the ROC curve. The aim of the work described in this paper is to see whether a feature describing the characteristic of the boundary can be extracted and combined with the Nakagami parameter to further improve the performance of classification. The combination of the features has been performed using a weighted summation. Results indicate a 10% improvement in specificity at a sensitivity of 96% after combining the information at the site and at the boundary. Moreover, the technique requires minimal clinical intervention and has a performance that reaches that of the trained radiologist. It is hence suggested that this technique may be utilized in practice to characterize breast masses", "fulltext": "", "keywords": "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;nakagami distribution;malignant"}
{"name": "train_1141", "title": "Reproducibility of mammary gland structure during repeat setups in a supine", "abstract": "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 position may be used for accurate tumor localization and marking of its extent immediately prior to surgery. Our aims in this study are to assess the reproducibility of mammary gland structure during repeat setups in a supine position, to evaluate the effect of a breast immobilization device, and to derive reproducibility margins that take internal tissue shifts into account occurring between repeat setups. Materials Methods: The reproducibility of mammary gland structure during repeat setups in a supine position is estimated by quantification of tissue shifts in the breasts of healthy volunteers between repeat MR setups. For each volunteer fiducials are identified and registered with their counter locations in corresponding MR volumes. The difference in position denotes the shift of breast tissue. The dependence on breast volume and the part of the breast, as well as the effect of a breast immobilization cast are studied. Results: The tissue shifts are small with a mean standard deviation on the order of 1.5 mm, being slightly larger in large breasts (V>1000 cm/sup 3/), and in the posterior part (toward the pectoral muscle) of both small and large breasts. The application of a breast immobilization cast reduces the tissue shifts in large breasts. A reproducibility margin on the order of 5 mm will take the internal tissue shifts into account that occur between repeat setups. Conclusion: The results demonstrate a high reproducibility of mammary gland structure during repeat setups in a supine position", "fulltext": "", "keywords": "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"}
{"name": "train_1142", "title": "Fast and accurate leaf verification for dynamic multileaf collimation using an", "abstract": "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 methods, a fast, accurate and two-dimensional method for daily leaf verification, using our CCD-camera based electronic portal imaging device (EPID), has been developed. This method is based on a flat field produced with a 0.5 cm wide sliding gap for each leaf pair. Deviations in gap widths are detected as deviations in gray scale value profiles derived from the EPID images, and not by directly assessing leaf positions in the images. Dedicated software was developed to reduce the noise level in the low signal images produced with the narrow gaps. The accuracy of this quality assurance procedure was tested by introducing known leaf position errors. It was shown that errors in leaf gap as small as 0.01-0.02 cm could be detected, which is certainly adequate to guarantee accurate dose delivery of DMLC treatments, even for strongly modulated beam profiles. Using this method, it was demonstrated that both short and long term reproducibility in leaf positioning were within 0.01 cm (1 sigma ) for all gantry angles, and that the effect of gravity was negligible", "fulltext": "", "keywords": "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 multileaf collimation;leaf positioning;electronic portal imaging device images;modulated beam profiles;gap widths;noise level;sliding gap"}
{"name": "train_1143", "title": "A three-source model for the calculation of head scatter factors", "abstract": "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, and irregular open fields shaped by the tertiary collimator (a multileaf collimator or blocks) at different source-to-chamber distance. The algorithm was based on a three-source model, in which the photon radiation to the point of calculation was treated as if it originated from three effective sources: one source for the primary photons from the target and two extra-focal photon sources for the scattered photons from the primary collimator and the flattening filter, respectively. The field mapping method proposed by Kim et al. [Phys. Med. Biol. 43, 1593-1604 (1998)] was extended to two extra-focal source planes and the scatter contributions were integrated over the projected areas (determined by the detector's eye view) in the three source planes considering the source intensity distributions. The algorithm was implemented using Microsoft Visual C/C++ in the MS Windows environment. The only input data required were head scatter factors for symmetric square fields, which are normally acquired during machine commissioning. A large number of different fields were used to evaluate the algorithm and the results were compared with measurements. We found that most of the calculated S/sub c/'s agreed with the measured values to within 0.4%. The algorithm can also be easily applied to deal with irregular fields shaped by a multileaf collimator that replaces the upper or lower collimator jaws", "fulltext": "", "keywords": "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;flattening filter;multileaf collimator;extra-focal source planes;scattered photons;field mapping method;three-source model;upper collimator jaws;ms windows environment;machine commissioning;symmetric;photon radiation;tertiary collimator;symmetric square fields"}
{"name": "train_1144", "title": "Simultaneous iterative reconstruction of emission and attenuation images in", "abstract": "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, it is not clear if the information content is sufficient to yield an adequate attenuation correction together with a satisfactory activity distribution. Therefore, we determined the log likelihood distribution for a thorax phantom depending on the choice of attenuation and activity pixel values to measure the crosstalk between both. In addition an iterative image reconstruction (one-dimensional Newton-type algorithm with a maximum likelihood estimator), which simultaneously reconstructs the images of the activity distribution and the attenuation coefficients is used to demonstrate the problems and possibilities of such a reconstruction. As result we show that for a change of the log likelihood in the range of statistical noise, the associated change in the activity value of a structure is between 6% and 263%. In addition, we show that it is not possible to choose the best maximum on the basis of the log likelihood when a regularization is used, because the coupling between different structures mediated by the (smoothing) regularization prevents an adequate solution due to crosstalk. We conclude that taking into account the attenuation information in the emission data improves the performance of image reconstruction with respect to the bias of the activities, however, the reconstruction still is not quantitative", "fulltext": "", "keywords": "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;smoothing;activity pixel values;log likelihood distribution"}
{"name": "train_1145", "title": "Mammogram synthesis using a 3D simulation. II. Evaluation of synthetic", "abstract": "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 compartments. It was hypothesized that the synthetic and clinical texture have similar properties, assuming that the mammogram texture reflects the 3D tissue distribution. The size of the projected compartments was computed by mathematical morphology. The texture energy and fractal dimension were also computed and analyzed in terms of the distribution of texture features within four different tissue regions in clinical and synthetic mammograms. Comparison of the cumulative distributions of the mean features computed from 95 mammograms showed that the synthetic images simulate the mean features of the texture of clinical mammograms. Correlation of clinical and synthetic texture feature histograms, averaged over all images, showed that the synthetic images can simulate the range of features seen over a large group of mammograms. The best agreement with clinical texture was achieved for simulated compartments with radii of 4-13.3 mm in predominantly adipose tissue regions, and radii of 2.7-5.33 and 1.3-2.7 mm in retroareolar and dense fibroglandular tissue regions, respectively", "fulltext": "", "keywords": "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;mathematical morphology"}
{"name": "train_1146", "title": "Mammogram synthesis using a 3D simulation. I. Breast tissue model and image", "abstract": "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 of simulated structures (adipose compartments and ducts) provide a method for consistently modeling images of the same simulated breast with modified position or acquisition parameters. The mammographic imaging process is simulated using a compression model and a model of the X-ray image acquisition process. The compression model estimates breast deformation using tissue elasticity parameters found in the literature and clinical force values. The synthetic mammograms were generated by a mammogram acquisition model using a monoenergetic parallel beam approximation applied to the synthetically compressed breast phantom", "fulltext": "", "keywords": "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 compression;x-ray image acquisition"}
{"name": "train_1147", "title": "Angular disparity in ETACT scintimammography", "abstract": "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 angular disparity between the ETACT projections on image quality through the use of a computer simulation. A small, spherical tumor of variable size (5, 7.5 or 10 mm) was placed at the center of a hemispherical breast (15 cm diameter). The tumor to nontumor ratio was either 5:1 or 10:1. The detector was modeled to be a gamma camera fitted with a 4-mm-diam pinhole collimator. The pinhole-to-detector and the pinhole-to-tumor distances were 25 and 15 cm, respectively. A ray tracing technique was used to generate three sets of projections (10 degrees , 15 degrees , and 20 degrees , angular disparity). These data were blurred to a resolution consistent with the 4 mm pinhole. The TACT reconstruction method was used to reconstruct these three image sets. The tumor contrast and the axial spatial resolution was measured. Smaller angular disparity led to an improvement in image contrast but at a cost of degraded axial spatial resolution. The improvement in contrast is due to a slight improvement in the in-plane spatial resolution. Since improved contrast should lead to better tumor detectability, smaller angular disparity should be used. However, the difference in contrast between 10 degrees and 15 degrees was very slight and therefore a reasonable clinical choice for angular disparity is 15 degrees", "fulltext": "", "keywords": "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;image quality;axial spatial resolution;in-plane spatial resolution;gamma camera;small tumors"}
{"name": "train_1148", "title": "Benchmarking of the Dose Planning Method (DPM) Monte Carlo code using electron", "abstract": "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 measurements and a series of profile scans at various depths were acquired in a water phantom using a Scanditronix type RK ion chamber. Source spatial distributions for the Monte Carlo calculations were reconstructed from in-air ion chamber measurements carried out across the two-dimensional beam profile at 100 cm downstream from the source. The in-air spatial distributions were found to have full width at half maximum of 4.7 and 1.3 cm, at 100 cm from the source, for the 10 and 50 MeV beams, respectively. Energy spectra for the 10 and 50 MeV beams were determined by simulating the components of the microtron treatment head using the code MCNP4B. DPM calculations are on average within +or-2% agreement with measurement for all depth dose and profile comparisons conducted in this study. The accuracy of the DPM code illustrated in this work suggests that DPM may be used as a valuable tool for electron beam dose calculations", "fulltext": "", "keywords": "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 axis depth dose measurements;radiotherapy treatment planning"}
{"name": "train_1149", "title": "Deterministic calculations of photon spectra for clinical accelerator targets", "abstract": "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 Carlo calculations over the angular range of interest for therapy applications. Relative energy spectra computed by deterministic and 3-D Monte Carlo methods, respectively, are compared for several realistic target materials and different electron beams, and are found to give similar photon energy distributions and mean energies. The deterministic calculations typically require 1-2 mins of execution time on a Sun Workstation, compared to 2-36 h for the Monte Carlo runs", "fulltext": "", "keywords": "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 electron accelerator targets;photon energy spectra"}
{"name": "train_115", "title": "Non-optimal universal quantum deleting machine", "abstract": "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), and manifest some of their distinctions", "fulltext": "", "keywords": "universal quantum cloning machine;nuqdm;fidelity;nonoptimal universal quantum deleting machine"}
{"name": "train_1150", "title": "Effect of multileaf collimator leaf width on physical dose distributions in the", "abstract": "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 therapy (IMRT). Three clinical patients with CNS tumors were planned with two different MLC leaf sizes, 5 and 10 mm, representing Varian-120 and Varian-80 Millennium multileaf collimators, respectively. Two sets of IMRT treatment plans were developed. The goal of the first set was radiation dose conformality in three dimensions. The goal for the second set was organ avoidance of a nearby critical structure while maintaining adequate coverage of the target volume. Treatment planning utilized the CadPlan/Helios system (Varian Medical Systems, Milpitas CA) for dynamic MLC treatment delivery. All beam parameters and optimization (cost function) parameters were identical for the 5 and 10 mm plans. For all cases the number of beams, gantry positions, and table positions were taken from clinically treated three-dimensional conformal radiotherapy plans. Conformality was measured by the ratio of the planning isodose volume to the target volume. Organ avoidance was measured by the volume of the critical structure receiving greater than 90% of the prescription dose (V/sub 90/). For three patients with squamous cell carcinoma of the head and neck (T2-T4 N0-N2c M0) 5 and 10 mm leaf widths were compared for parotid preservation utilizing nine coplanar equally spaced beams delivering a simultaneous integrated boost. Because modest differences in physical dose to the parotid were detected, a NTCP model based upon the clinical parameters of Eisbruch et al. was then used for comparisons. The conformality improved in all three CNS cases for the 5 mm plans compared to the 10 mm plans. For the organ avoidance plans, V/sub 90/ also improved in two of the three cases when the 5 mm leaf width was utilized for IMRT treatment delivery. In the third case, both the 5 and 10 mm plans were able to spare the critical structure with none of the structure receiving more than 90% of the prescription dose, but in the moderate dose range, less dose was delivered to the critical structure with the 5 mm plan. For the head and neck cases both the 5 and 10*2.5 mm beamlets dMLC sliding window techniques spared the contralateral parotid gland while maintaining target volume coverage. The mean parotid dose was modestly lower with the smaller beamlet size (21.04 Gy vs 22.36 Gy). The resulting average NTCP values were 13.72% for 10 mm dMLC and 8.24% for 5 mm dMLC. In conclusion, five mm leaf width results in an improvement in physical dose distribution over 10 mm leaf width that may be clinically relevant in some cases. These differences may be most pronounced for single fraction radiosurgery or in cases where the tolerance of the sensitive organ is less than or close to the target volume prescription", "fulltext": "", "keywords": "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 preservation;minimal toxicity;single fraction radiosurgery"}
{"name": "train_1151", "title": "A method for geometrical verification of dynamic intensity modulated", "abstract": "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 using an electronic portal imaging device with scanning read-out, independent of the multileaf collimator. Examples of such scanning imagers are electronic portal imaging devices (EPIDs) based on liquid-filled ionization chambers and those based on amorphous silicon. Portal images were acquired continuously with a liquid-filled ionization chamber EPID during the delivery, together with the signal of treatment progress that is generated by the accelerator. For each portal image, the prescribed leaf and diaphragm positions were computed from the dynamic prescription and the progress information. Motion distortion effects of the leaves are corrected based on the treatment progress that is recorded for each image row. The aperture formed by the prescribed leaves and diaphragms is used as the reference field edge, while the actual field edge is found using a maximum-gradient edge detector. The errors in leaf and diaphragm position are found from the deviations between the reference field edge and the detected field edge. Earlier measurements of the dynamic EPID response show that the accuracy of the detected field edge is better than 1 mm. To ensure that the verification is independent of inaccuracies in the acquired progress signal, the signal was checked with diode measurements beforehand. The method was tested on three different dynamic prescriptions. Using the described method, we correctly reproduced the distorted field edges. Verifying a single portal image took 0.1 s on an 866 MHz personal computer. Two flaws in the control system of our experimental dynamic multileaf collimator were correctly revealed with our method. First, the errors in leaf position increase with leaf speed, indicating a delay of approximately 0.8 s in the control system. Second, the accuracy of the leaves and diaphragms depends on the direction of motion. In conclusion, the described verification method is suitable for detailed verification of leaf trajectories during dynamic IMRT", "fulltext": "", "keywords": "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 distributions;leaf positions;on-line verification"}
{"name": "train_1152", "title": "Incorporating multi-leaf collimator leaf sequencing into iterative IMRT", "abstract": "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 limitations and characteristics of the MLC, the deliverable intensity distributions often differ from those produced by the optimizer, leading to differences between the delivered and the optimized doses. Objective function parameters are then adjusted empirically, and the plan is reoptimized to achieve a desired deliverable dose distribution. The resulting plan, though usually acceptable, may not be the best achievable. A method has been developed to incorporate the MLC restrictions into the optimization process. Our in-house IMRT system has been modified to include the calculation of the deliverable intensity into the optimizer. In this process, prior to dose calculation, the MLC leaf sequencer is used to convert intensities to dynamic MLC sequences, from which the deliverable intensities are then determined. All other optimization steps remain the same. To evaluate the effectiveness of deliverable-based optimization, 17 patient cases have been studied. Compared with standard optimization plus conversion to deliverable beams, deliverable-based optimization results show improved isodose coverage and a reduced dose to critical structures. Deliverable-based optimization results are close to the original nondeliverable optimization results, suggesting that IMRT can overcome the MLC limitations by adjusting individual beamlets. The use of deliverable-based optimization may reduce the need for empirical adjustment of objective function parameters and reoptimization of a plan to achieve desired results", "fulltext": "", "keywords": "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;multileaf collimator leaf sequencing;beamlet ray intensities"}
{"name": "train_1153", "title": "Direct aperture optimization: A turnkey solution for step-and-shoot IMRT", "abstract": "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 shapes. In this article, we introduce an automated planning system in which we bypass the traditional intensity optimization, and instead directly optimize the shapes and the weights of the apertures. We call this approach \"direct aperture optimization.\" This technique allows the user to specify the maximum number of apertures per beam direction, and hence provides significant control over the complexity of the treatment delivery. This is possible because the machine dependent delivery constraints imposed by the MLC are enforced within the aperture optimization algorithm rather than in a separate leaf-sequencing step. The leaf settings and the aperture intensities are optimized simultaneously using a simulated annealing algorithm. We have tested direct aperture optimization on a variety of patient cases using the EGS4/BEAM Monte Carlo package for our dose calculation engine. The results demonstrate that direct aperture optimization can produce highly conformal step-and-shoot treatment plans using only three to five apertures per beam direction. As compared with traditional optimization strategies, our studies demonstrate that direct aperture optimization can result in a significant reduction in both the number of beam segments and the number of monitor units. Direct aperture optimization therefore produces highly efficient treatment deliveries that maintain the full dosimetric benefits of IMRT", "fulltext": "", "keywords": "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;mlc;deliverable aperture shapes;aperture weights;egs4/beam monte carlo package;treatment delivery complexity;full dosimetric benefits;intensity map;imrt treatment plans;step-and-shoot imrt;machine dependent delivery constraints;dose calculation engine;highly efficient treatment deliveries;beam angle;simulated annealing algorithm"}
{"name": "train_1154", "title": "The effect of voxel size on the accuracy of dose-volume histograms of prostate", "abstract": "/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 on the accuracy of DVHs using an in-house computer program. The program was validated by comparison with a hand-calculated DVH for a single 0.4-U iodine-125 model 6711 seed. We used the program to find the voxel size required to obtain accurate DVHs of five iodine-125 prostate implant patients at our institution. One-millimeter cubes were sufficient to obtain DVHs that are accurate within 5% up to 200% of the prescription dose. For the five patient plans, we obtained good agreement with the VariSeed (version 6.7, Varian, USA) treatment planning software's DVH algorithm by using voxels with a sup-inf dimension equal to the spacing between successive transverse seed implant planes (5 mm). The volume that receives at least 200% of the target dose, V/sub 200/, calculated by VariSeed was 30% to 43% larger than that calculated by our program with small voxels. The single-seed DVH calculated by VariSeed fell below the hand calculation by up to 50% at low doses (30 Gy), and above it by over 50% at high doses (>250 Gy)", "fulltext": "", "keywords": "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 software's dose-volume histogram algorithm"}
{"name": "train_1155", "title": "A leaf sequencing algorithm to enlarge treatment field length in IMRT", "abstract": "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 mostly made equal to the full length of the MLC field without violating the upper jaw overtravel limit. For any given intensity pattern, a criterion was proposed to assess whether an intensity pattern can be delivered without violation of the jaw position constraints. If the criterion is met, the new algorithm will consider the jaw position constraints during the segmentation for the step and shoot delivery method. The strategy employed by the algorithm is to connect the intensity elements outside the jaw overtravel limits with those inside the jaw overtravel limits. Several methods were used to establish these connections during segmentation by modifying a previously published algorithm (areal algorithm), including changing the intensity level, alternating the leaf-sequencing direction, or limiting the segment field size. The algorithm was tested with 1000 random intensity patterns with dimensions of 21*27 cm/sup 2/, 800 intensity patterns with higher intensity outside the jaw overtravel limit, and three different types of clinical treatment plans that were undeliverable using a segmentation method from a commercial treatment planning system. The new algorithm achieved a success rate of 100% with these test patterns. For the 1000 random patterns, the new algorithm yields a similar average number of segments of 36.9+or-2.9 in comparison to 36.6+or-1.3 when using the areal algorithm. For the 800 patterns with higher intensities outside the jaw overtravel limits, the new algorithm results in an increase of 25% in the average number of segments compared to the areal algorithm. However, the areal algorithm fails to create deliverable segments for 90% of these patterns. Using a single isocenter, the new algorithm provides a solution to extend the usable IMRT field length from 21 to 27 cm for IMRT on a commercial linear accelerator using the step and shoot delivery method", "fulltext": "", "keywords": "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 elements;segment field size;conformal radiation therapy;commercial linear accelerator;deliverable segments;single isocenter;random intensity patterns;jaw position constraints;segmentation method;multileaf collimators leaves;treatment field length;areal algorithm;multileaf-based collimators intensity modulated radiation therapy"}
{"name": "train_1156", "title": "Favorable noise uniformity properties of Fourier-based interpolation and", "abstract": "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-contrast object detectability and have also been identified as the cause of the zebra artifacts that plague maximum intensity projection (MIP) images of such volumes. While these spatially variant noise levels have their root in the peculiarities of the helical scan geometry, there is also a strong dependence on the interpolation and reconstruction algorithms employed. In this paper, we seek to develop image reconstruction strategies that eliminate or reduce, at its source, the nonuniformity of noise levels in helical CT relative to that in conventional CT. We pursue two approaches, independently and in concert. We argue, and verify, that Fourier-based longitudinal interpolation approaches lead to more uniform noise ratios than do the standard 360LI and 180LI approaches. We also demonstrate that a Fourier-based fan-to-parallel rebinning algorithm, used as an alternative to fanbeam filtered backprojection for slice reconstruction, also leads to more uniform noise ratios, even when making use of the 180LI and 360LI interpolation approaches", "fulltext": "", "keywords": "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;zebra artifacts;conventional ct"}
{"name": "train_1157", "title": "Portal dose image prediction for dosimetric treatment verification in", "abstract": "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 (1998)]. Transmission functions for open fields are being used in our clinic for prediction of portal dose images (PDI, i.e., a dose distribution behind the patient in a plane normal to the beam axis), which are compared with PDIs measured with an electronic portal imaging device (EPID). The calculations are based on the planning CT scan of the patient and on the irradiation geometry as determined in the treatment planning process. Input data for the developed algorithm for wedged beams are derived from (the already available) measured input data set for transmission prediction in open beams, which is extended with only a limited set of measurements in the wedged beam. The method has been tested for a PDI plane at 160 cm from the focus, in agreement with the applied focus-to-detector distance of our fluoroscopic EPIDs. For low and high energy photon beams (6 and 23 MV) good agreement (~1%) has been found between calculated and measured transmissions for a slab and a thorax phantom", "fulltext": "", "keywords": "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 beams;two-dimensional function;planning ct scan;cadplan planning system;wedged beams algorithm;23 mv;pencil beam algorithm"}
{"name": "train_1158", "title": "From powder to perfect parts", "abstract": "GKN Sinter Metals has increased productivity and quality by automating the powder metal lines that produce its transmission parts", "fulltext": "", "keywords": "gkn sinter metals;automating;robotic systems;gentle transfer units;powder metal lines;conveyors"}
{"name": "train_1159", "title": "Sigma -admissible families over linear orders", "abstract": "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. Fundamental subsets and families are characterized for models of dense linear orderings", "fulltext": "", "keywords": "dense linear orderings;sigma -admissible families;linear orders;recursively saturated system;hyp(m);fundamental subsets"}
{"name": "train_116", "title": "Frontier between separability and quantum entanglement in a many spin system", "abstract": "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 > is a special entangled state. The cases x = 0 and x = 1 correspond respectively to fully random spins and to a fully entangled state. In the first of these series we consider special states | phi > invariant under charge conjugation, that generalizes the N = 2 spin S = 1/2 Einstein-Podolsky-Rosen state, and in the second one we consider generalizations of the Werner (1989) density matrices. The evaluation of the critical point x/sub c/ was done through bounds coming from the partial transposition method of Peres (1996) and the conditional nonextensive entropy criterion. Our results suggest the conjecture that whenever the bounds coming from both methods coincide the result of x/sub c/ is the exact one. The results we present are relevant for the discussion of quantum computing, teleportation and cryptography", "fulltext": "", "keywords": "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"}
{"name": "train_1160", "title": "Monoids all polygons over which are omega -stable: proof of the Mustafin-Poizat", "abstract": "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 -stabilizers", "fulltext": "", "keywords": "mustafin-poizat conjecture;regular monoid;s-polygon;monoids all polygons;omega -stabilizer"}
{"name": "train_1161", "title": "Model theory for hereditarily finite superstructures", "abstract": "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 described via definable functions. Yet theories for such superstructures admit a description in terms of iterated families TF and SF. These are constructed using a definable union taken over countable ordinals in the subsets which are unions of finitely many complete subsets and of finite subsets, respectively. Simultaneously, we describe theories that share a unique (up to isomorphism) countable hereditarily finite superstructure", "fulltext": "", "keywords": "countable signatures;iterated families;countable hereditarily finite superstructure;finitely many complete subsets;definable union;model theory;model-theoretic properties"}
{"name": "train_1162", "title": "Recognition of finite simple groups S/sub 4/(q) by their element orders", "abstract": "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), and /sup 2/E/sub 6/(2) are recognizable, but L/sub 3/(3) is not", "fulltext": "", "keywords": "divisibility relation;element orders;finite simple groups recognition"}
{"name": "train_1163", "title": "Evaluating the complexity of index sets for families of general recursive", "abstract": "functions in the arithmetic hierarchy The complexity of index sets of families of general recursive functions is evaluated in the Kleene-Mostowski arithmetic hierarchy", "fulltext": "", "keywords": "general recursive functions;kleene-mostowski arithmetic hierarchy;index sets complexity;arithmetic hierarchy"}
{"name": "train_1164", "title": "Friedberg numberings of families of n-computably enumerable sets", "abstract": "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 for the family of all n-c.e. sets for any n > 2. Second, it is stated that there exists an infinite family of d.c.e. sets without a Friedberg numbering. Third, it is shown that there exists an infinite family of c.e. sets (treated as a family of d.c.e. sets) with a numbering which is unique up to equivalence. Fourth, it is proved that there exists a family of d.c.e. sets with a least numbering (under reducibility) which is Friedberg but is not the only numbering (modulo reducibility)", "fulltext": "", "keywords": "computability theory;infinite family;friedberg numberings;families of n-computably enumerable sets"}
{"name": "train_1165", "title": "Recognizing groups G/sub 2/(3/sup n/) by their element orders", "abstract": "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", "fulltext": "", "keywords": "element orders;isomorphism;finite group"}
{"name": "train_1166", "title": "Embedding the outer automorphism group Out(F/sub n/) of a free group of rank n", "abstract": "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", "fulltext": "", "keywords": "free group;outer automorphism group embedding;arbitrary natural number coprime"}
{"name": "train_1167", "title": "A new approach to the d-MC problem", "abstract": "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, limited and multi-valued random capacities. In this paper, all MCs are assumed to be known in advance, and the authors focused on how to verify each d-MC candidate before using d-MCs to calculate the network reliability. The proposed algorithm is more efficient than existing algorithms. The algorithm runs in O(p sigma mn) time, a significant improvement over the previous O(p sigma m/sup 2/) time bounds based on max-flow/min-cut, where p and or are the number of MCs and d-MC candidates, respectively. It is simple, intuitive and uses no complex data structures. An example is given to show how all d-MC candidates are found and verified by the proposed algorithm. Then the reliability of this example is computed", "fulltext": "", "keywords": "multi-state systems;time bounds;max-flow/min-cut;flow networks;multi-state components;d-mc problem;reliability computation;failure analysis algorithm;d-mincuts"}
{"name": "train_1168", "title": "Computing failure probabilities. Applications to reliability analysis", "abstract": "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 probability using a recursive method based on the Gauss-Legendre quadrature formulas to calculate the resulting multiple integrals. An example of application is used to illustrate the proposed method", "fulltext": "", "keywords": "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"}
{"name": "train_1169", "title": "An efficient algorithm for sequential generation of failure states in a network", "abstract": "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 algorithm for shortest paths enumeration and also of the characteristics of the reliability problem in which it will be used, an algorithm with lower complexity than the best algorithm in the literature for solving this problem, was obtained. Computational results will be presented for comparing the efficiency of both algorithms in terms of CPU time and for problems of different size", "fulltext": "", "keywords": "multi-mode components reliability;sequential failure states generation algorithm;network failure states;cpu time;state enumeration problem;k-shortest paths problem"}
{"name": "train_117", "title": "Multiresolution Markov models for signal and image processing", "abstract": "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 second goal is to describe how this topic fits into the even larger field of MR methods and concepts-in particular, making ties to topics such as wavelets and multigrid methods. A third goal is to provide several alternate viewpoints for this body of work, as the methods and concepts we describe intersect with a number of other fields. The principle focus of our presentation is the class of MR Markov processes defined on pyramidally organized trees. The attractiveness of these models stems from both the very efficient algorithms they admit and their expressive power and broad applicability. We show how a variety of methods and models relate to this framework including models for self-similar and 1/f processes. We also illustrate how these methods have been used in practice", "fulltext": "", "keywords": "multigrid methods;1/f processes;multiresolution markov models;wavelets;statistical multiresolution modeling;pyramidally organized trees;self-similar processes"}
{"name": "train_1170", "title": "Upper bound analysis of oblique cutting with nose radius tools", "abstract": "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 find the length of the corresponding element on the shear surface using the ratio of the shear velocity to the chip velocity. The area of each element is found as the cross product of the length and its width along the cutting edge. Summing up the area of the elements along the shear surface, the total shear surface area is obtained. The friction area is calculated using the similarity between orthogonal and oblique cutting in the 'equivalent' plane that includes both the cutting velocity and chip velocity. The cutting power is obtained by summing the shear power and the friction power. The actual chip flow angle and chip velocity are obtained by minimizing the cutting power with respect to both these variables. The shape of the curved shear surface, the chip cross section and the cutting force obtained from this model are presented", "fulltext": "", "keywords": "friction area;uncut chip area;nose radius tools;chip velocity;chip flow angle;shear surface;upper bound analysis;oblique cutting;shear velocity"}
{"name": "train_1171", "title": "Manufacturing data analysis of machine tool errors within a contemporary small", "abstract": "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 component on a co-ordinate measuring machine. This manufacturing data analysis activity adopts a feature-based approach and is conducted through the application of a forward chaining expert system, called the product data analysis distributed diagnostic expert system, which forms part of a larger prototype feedback system entitled the production data analysis framework. The paper introduces the manufacturing error categorisations that are associated with milling type operations, knowledge acquisition and representation, conceptual structure and operating procedure of the prototype manufacturing data analysis facility. The paper concludes with a brief evaluation of the logic employed through the simulation of manufacturing error scenarios. This prototype manufacturing data analysis expert system provides a valuable aid for the rapid diagnosis and elimination of manufacturing errors on a 3-axis vertical machining centre in an environment where operator expertise is limited", "fulltext": "", "keywords": "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;inspection;product data analysis distributed diagnostic expert system;contemporary small manufacturing enterprise;programming errors"}
{"name": "train_1172", "title": "Marble cutting with single point cutting tool and diamond segments", "abstract": "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 the depth of cut per diamond grit increases as the blades move forward. Only a few grits per segment can remove the material in the cutting process. When the direction of the stroke changes, the cutting forces do not decrease to zero because of the residual plastic deformation beneath the diamond grits. The plastic deformation and fracture chipping of material are the dominant removal processes, which can be explained by the fracture theory of brittle material indentation", "fulltext": "", "keywords": "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"}
{"name": "train_1173", "title": "A comprehensive chatter prediction model for face turning operation including", "abstract": "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 radius. The underlying dynamic force model simulates the variation in the chip cross-sectional area by accounting for the displacements in the axial and radial directions. The model can be used to determine stability boundaries under various cutting conditions and different states of flank wear. Experimental results for different amounts of wear are provided as a validation for the model", "fulltext": "", "keywords": "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"}
{"name": "train_1174", "title": "Optimization of cutting conditions for single pass turning operations using a", "abstract": "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 constraints. It is shown that the deterministic optimization approach involving mathematical analyses of constrained economic trends and graphical representation on the feed-speed domain provides a clearly defined strategy that not only provides a unique global optimum solution, but also the software that is suitable for on-line CAM applications. A numerical study has verified the developed optimization strategies and software and has shown the economic benefits of using optimization", "fulltext": "", "keywords": "deterministic approach;economic cutting conditions;process planning;cam software;cutting conditions optimization;constrained economic trends;maximum production rate;mathematical analyses;single pass turning operations"}
{"name": "train_1175", "title": "Prediction of tool and chip temperature in continuous and interrupted machining", "abstract": "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 tool-rake face contact zone. The shear energy created in the primary zone, the friction energy produced at the rake face-chip contact zone and the heat balance between the moving chip and stationary tool are considered. The temperature distribution is solved using the finite difference method. Later, the model is extended to milling where the cutting is interrupted and the chip thickness varies with time. The proposed model combines the steady-state temperature prediction in continuous machining with transient temperature evaluation in interrupted cutting operations where the chip and the process change in a discontinuous manner. The mathematical models and simulation results are in satisfactory agreement with experimental temperature measurements reported in the literature", "fulltext": "", "keywords": "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;first-order dynamic system"}
{"name": "train_1176", "title": "A summary of methods applied to tool condition monitoring in drilling", "abstract": "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 cover all the methods that have been used with indirect measurements including e.g. statistical parameters and Fast Fourier and Wavelet Transform. Only a limited number of automatic diagnostic tools have been developed for diagnosis of the condition of the tool in drilling. All of these rather diverse approaches that have been available are covered in this study. Only in a few of the papers have attempts been made to compare the chosen approach with other methods. Many of the papers only present one approach and unfortunately quite often the test material of the study is limited especially in what comes to the cutting process parameter variation and also workpiece material", "fulltext": "", "keywords": "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"}
{"name": "train_1177", "title": "Comparative statistical analysis of hole taper and circularity in laser", "abstract": "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 composite design was employed to plan the experiments in order to achieve required information with reduced number of experiments. The process performance was evaluated. The ratio of minimum to maximum Feret's diameter was considered as circularity characteristic of the hole. The models of these three process characteristics were developed by linear multiple regression technique. The significant coefficients were obtained by performing analysis of variance (ANOVA) at 1, 5 and 7% levels of significance. The final models were checked by complete residual analysis and finally were experimentally verified. It was found that the pulse frequency had a significant effect on the hole entrance diameter and hole circularity in drilling stainless steel unlike the drilling of mild steel where the pulse frequency had no significant effect on the hole characteristics", "fulltext": "", "keywords": "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;stainless steel workpieces;laser peak power;focal plane position;comparative statistical analysis;circularity;assist gas pressure"}
{"name": "train_1178", "title": "Network-centric systems", "abstract": "The author describes a graduate-level course that addresses cutting-edge issues in network-centric systems while following a more traditional graduate seminar format", "fulltext": "", "keywords": "graduate level course;network-centric systems"}
{"name": "train_1179", "title": "Evolution complexity of the elementary cellular automaton rule 18", "abstract": "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 evolution complexity of the elementary cellular automaton with local rule number 18 and prove that its width 1-evolution language is regular, but for every n >or= 2 its width n-evolution language is not context free but context sensitive", "fulltext": "", "keywords": "elementary cellular automaton;formal languages;complexity;cellular automata;evolution complexity;symbolic dynamical theory"}
{"name": "train_118", "title": "Sensorless control of induction motor drives", "abstract": "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 estimating the magnitude and spatial orientation of the fundamental magnetic flux waves in the stator or in the rotor. Open-loop estimators or closed-loop observers are used for this purpose. They differ with respect to accuracy, robustness, and sensitivity against model parameter variations. Dynamic performance and steady-state speed accuracy in the low-speed range can be achieved by exploiting parasitic effects of the machine. The overview in this paper uses signal flow graphs of complex space vector quantities to provide an insightful description of the systems used in sensorless control of induction motors", "fulltext": "", "keywords": "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;magnitude;sensitivity;reliability"}
{"name": "train_1180", "title": "Decomposition of additive cellular automata", "abstract": "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 cyclic subspaces are described in terms of symmetries. As an application, the lengths and frequencies of limit cycles in the transition diagram of the automaton are calculated", "fulltext": "", "keywords": "endomorphisms;cellular automata;finite cellular automaton;computational complexity;transition diagram"}
{"name": "train_1181", "title": "Dynamic neighborhood structures in parallel evolution strategies", "abstract": "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 communication scheme in an evolution strategy will be compared with conventional static and dynamic approaches. The communication structure is based on a so-called diffusion model approach. The links between adjacent individuals are dynamically chosen according to deterministic or probabilistic rules. Due to self-organization effects, efficient and stable communication structures are established that perform robustly and quickly on a multimodal test function", "fulltext": "", "keywords": "multimodal test function;parallelizing;convergence speed;convergence probability;parallel evolutionary algorithms;evolutionary algorithms"}
{"name": "train_1182", "title": "Optimization of the memory weighting function in stochastic functional", "abstract": "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 behavior is a distributed sorting and clustering based only on local information and a memory register that records the past objects encountered. An optimum weighting function for the memory registers is theoretically derived. The optimum time-dependent weighting function allows sorting and clustering of the randomly distributed objects in the shortest time. By maximizing the average speed of a texture feature (the contrast) we check the central assumption, the intermediate steady-states hypothesis, of our theoretical result. It is proved that the algorithm optimization based on maximum speed variation of the contrast feature gives relationships similar to the theoretically derived annealing law", "fulltext": "", "keywords": "autonomous mobile agents;algorithm optimization;random walk;sorting;memory weighting function;clustering"}
{"name": "train_1183", "title": "Evolving robust asynchronous cellular automata for the density task", "abstract": "In this paper the evolution of three kinds of asynchronous cellular automata are studied for the density task. Results are compared with those obtained for synchronous automata and the influence of various asynchronous update policies on the computational strategy is described. How synchronous and asynchronous cellular automata behave is investigated when the update policy is gradually changed, showing that asynchronous cellular automata are more adaptable. The behavior of synchronous and asynchronous evolved automata are studied under the presence of random noise of two kinds and it is shown that asynchronous cellular automata implicitly offer superior fault tolerance", "fulltext": "", "keywords": "asynchronous cellular automata;synchronous automata;discrete dynamical systems;random noise;cellular automata;fault tolerance"}
{"name": "train_1184", "title": "Measuring return: revealing ROI", "abstract": "The most critical part of the return-on-investment odyssey is to develop metrics that matter to the business and to measure systems in terms of their ability to help achieve those business goals. Everything must flow from those key metrics. And don't forget to revisit those every now and then, too. Since all systems wind down over time, it's important to keep tabs on how well your automation investment is meeting the metrics established by your company. Manufacturers are clamoring for a tool to help quantify returns and analyze the results", "fulltext": "", "keywords": "key metrics;roi;automation investment;technology purchases;return-on-investment"}
{"name": "train_1185", "title": "Trading exchanges: online marketplaces evolve", "abstract": "Looks at how trading exchanges are evolving rapidly to help manufacturers keep up with customer demand", "fulltext": "", "keywords": "supply chain management;manufacturers;online marketplaces;customer demand;xml standards;enterprise platforms;core software platform;private exchanges;integration technology;middleware;enterprise resource planning;trading exchanges;content management capabilities"}
{"name": "train_1186", "title": "Implementing: it's all about processes", "abstract": "Looks at how the key to successful technology deployment can be found in a set of four basic disciplines", "fulltext": "", "keywords": "implementation;manufacturers;third-party integration;vendor-supplied hardware integration services;technology deployment;incremental targets;vendor-supplied software integration services"}
{"name": "train_1187", "title": "Ethernet networks: getting down to business", "abstract": "While it seems pretty clear that Ethernet has won the battle for the mindshare as the network of choice for the factory floor, there's still a war to be won in implementation as cutting-edge manufacturers begin to adopt the technology on a widespread basis", "fulltext": "", "keywords": "ethernet;supervisory level;cutting-edge manufacturers;factory floor"}
{"name": "train_1188", "title": "It's time to buy", "abstract": "There is an upside to a down economy: over-zealous suppliers are willing to make deals that were unthinkable a few years ago. That's because vendors are experiencing the same money squeeze as manufacturers, which makes the year 2002 the perfect time to invest in new technology. The author states that when negotiating the deal, provisions for unexpected costs, an exit strategy, and even shared risk with the vendor should be on the table", "fulltext": "", "keywords": "exit strategy;money squeeze;bargaining power;vendor;buyers market;shared risk;negotiation;suppliers;unexpected costs"}
{"name": "train_1189", "title": "CRM: approaching zenith", "abstract": "Looks at how manufacturers are starting to warm up to the concept of customer relationship management. CRM has matured into what is expected to be big business. As CRM software evolves to its second, some say third, generation, it's likely to be more valuable to holdouts in manufacturing and other sectors", "fulltext": "", "keywords": "manufacturers;customer relationship management;manufacturing;crm"}
{"name": "train_119", "title": "JPEG2000: standard for interactive imaging", "abstract": "JPEG2000 is the latest image compression standard to emerge from the Joint Photographic Experts Group (JPEG) working under the auspices of the International Standards Organization. Although the new standard does offer superior compression performance to JPEG, JPEG2000 provides a whole new way of interacting with compressed imagery in a scalable and interoperable fashion. This paper provides a tutorial-style review of the new standard, explaining the technology on which it is based and drawing comparisons with JPEG and other compression standards. The paper also describes new work, exploiting the capabilities of JPEG2000 in client-server systems for efficient interactive browsing of images over the Internet", "fulltext": "", "keywords": "image compression;client-server systems;international standards organization;joint photographic experts group;interoperable compression;review;interactive imaging;scalable compression;jpeg2000"}
{"name": "train_1190", "title": "Buying into the relationship [business software]", "abstract": "Choosing the right software to improve business processes can have a huge impact on a company's efficiency and profitability. While it is sometimes hard to get beyond vendor hype about software features and functionality and know what to realistically expect, it is even more difficult to determine if the vendor is the right vendor to partner with. Thus picking the right software is important, but companies have to realize that what they are really buying into is a relationship with the vendor", "fulltext": "", "keywords": "business software;software evaluation;management;functionality;vendor relationship"}
{"name": "train_1191", "title": "On the monotonicity conservation in numerical solutions of the heat equation", "abstract": "It is important to choose such numerical methods in practice that mirror the characteristic properties of the described process beyond the stability and convergence. The investigated qualitative property in this paper is the conservation of the monotonicity in space of the initial heat distribution. We prove some statements about the monotonicity conservation and total monotonicity of one-step vector-iterations. Then, applying these results, we consider the numerical solutions of the one-dimensional heat equation. Our main theorem formulates the necessary and sufficient condition of the uniform monotonicity conservation. The sharpness of the conditions is demonstrated by numerical examples", "fulltext": "", "keywords": "monotonicity conservation;characteristic properties;qualitative property;necessary and sufficient condition;heat equation;one-step vector-iterations;numerical solutions"}
{"name": "train_1192", "title": "Construction of two-sided bounds for initial-boundary value problems", "abstract": "This paper extends the bounding operator approach developed for boundary value problems to the case of initial-boundary value problems (IBVPs). Following the general principle of bounding operators enclosing methods for the case of partial differential equations are discussed. In particular, continuous discretization methods with an appropriate error bound controlled shift and monotone extensions of Rothe's method for parabolic problems are investigated", "fulltext": "", "keywords": "partial differential equations;two-sided bounds;bounding operators;parabolic problems;bounding operator approach;initial-boundary value problems"}
{"name": "train_1193", "title": "Operator splitting and approximate factorization for taxis-diffusion-reaction", "abstract": "models In this paper we consider the numerical solution of 2D systems of certain types of taxis-diffusion-reaction equations from mathematical biology. By spatial discretization these PDE systems are approximated by systems of positive, nonlinear ODEs (Method of Lines). The aim of this paper is to examine the numerical integration of these ODE systems for low to moderate accuracy by means of splitting techniques. An important consideration is maintenance of positivity. We apply operator splitting and approximate matrix factorization using low order explicit Runge-Kutta methods and linearly implicit Runge-Kutta-Rosenbrock methods. As a reference method the general purpose solver VODPK is applied", "fulltext": "", "keywords": "numerical integration;mathematical biology;approximate matrix factorization;taxis-diffusion-reaction models;spatial discretization;runge-kutta methods;numerical solution;nonlinear odes;approximate factorization;pde systems;operator splitting;linearly implicit runge-kutta-rosenbrock methods"}
{"name": "train_1194", "title": "New methods for oscillatory problems based on classical codes", "abstract": "The numerical integration of differential equations with oscillatory solutions is a very common problem in many fields of the applied sciences. Some methods have been specially devised for this kind of problem. In most of them, the calculation of the coefficients needs more computational effort than the classical codes because such coefficients depend on the step-size in a not simple manner. On the contrary, in this work we present new algorithms specially designed for perturbed oscillators whose coefficients have a simple dependence on the step-size. The methods obtained are competitive when comparing with classical and special codes", "fulltext": "", "keywords": "numerical integration;oscillatory problems;oscillatory solutions;perturbed oscillators;classical codes;differential equations"}
{"name": "train_1195", "title": "Sharpening the estimate of the stability constant in the maximum-norm of the", "abstract": "Crank-Nicolson scheme for the one-dimensional heat equation This paper is concerned with the stability constant C/sub infinity / in the maximum-norm of the Crank-Nicolson scheme applied. to the one-dimensional heat equation. A well known result due to S.J. Serdyukova is that C/sub infinity / < 23. In the present paper, by using a sharp resolvent estimate for the discrete Laplacian together with the Cauchy formula, it is shown that 3 <or= C/sub infinity / < 4.325. This bound also holds when the heat equation is considered on a bounded interval along with Dirichlet or Neumann boundary conditions", "fulltext": "", "keywords": "one-dimensional heat equation;cauchy formula;discrete laplacian;dirichlet boundary conditions;stability constant;sharp resolvent estimate;crank-nicolson scheme;neumann boundary conditions"}
{"name": "train_1196", "title": "Multiple shooting using a dichotomically stable integrator for solving", "abstract": "differential-algebraic equations In previous work by the first author, it has been established that a dichotomically stable discretization is needed when solving a stiff boundary-value problem in ordinary differential equations (ODEs), when sharp boundary layers may occur at each end of the interval. A dichotomically stable implicit Runge-Kutta method, using the 3-stage, fourth-order, Lobatto IIIA formulae, has been implemented in a variable step-size initial-value integrator, which could be used in a multiple-shooting approach. In the case of index-one differential-algebraic equations (DAEs) the use of the Lobatto IIIA formulae has an advantage, over a comparable Gaussian method, that the order is the same for both differential and algebraic variables, and there is no need to treat them separately. The ODE integrator has been adapted for the solution of index-one DAEs, and the resulting integrator (SYMDAE) has been inserted into the multiple-shooting code (MSHDAE) previously developed by R. Lamour for differential-algebraic boundary-value problems. The standard version of MSHDAE uses a BDF integrator, which is not dichotomically stable, and for some stiff test problems this fails to integrate across the interval of interest, while the dichotomically stable integrator SYMDAE encounters no difficulty. Indeed, for such problems, the modified version of MSHDAE produces an accurate solution, and within limits imposed by computer word length, the efficiency of the solution process improves with increasing stiffness. For some nonstiff problems, the solution is also entirely satisfactory", "fulltext": "", "keywords": "implicit runge-kutta method;stiff boundary-value problem;ordinary differential equations;lobatto iiia formulae;initial-value integrator;differential-algebraic equations;dichotomically stable integrator;multiple shooting"}
{"name": "train_1197", "title": "Numerical behaviour of stable and unstable solitary waves", "abstract": "In this paper we analyse the behaviour in time of the numerical approximations to solitary wave solutions of the generalized Benjamin-Bona-Mahony equation. This equation possesses an important property: the stability of these solutions depends on their velocity. We identify the error propagation mechanisms in both the stable and unstable case. In particular, we show that in the stable case, numerical methods that preserve some conserved quantities of the problem are more appropriate for the simulation of this kind of solutions", "fulltext": "", "keywords": "numerical methods;stable solitary waves;numerical approximations;numerical behaviour;unstable solitary waves;error propagation mechanisms;generalized benjamin-bona-mahony equation"}
{"name": "train_1198", "title": "Post-projected Runge-Kutta methods for index-2 differential-algebraic equations", "abstract": "A new projection technique for Runge-Kutta methods applied to index-2 differential-algebraic equations is presented in which the numerical approximation is projected only as part of the output process. It is shown that for methods that are strictly stable at infinity, the order of convergence is unaffected compared to standard projected methods. Gauss methods, for which this technique is of special interest when some symmetry is to be preserved, are studied in more detail", "fulltext": "", "keywords": "post-projected runge-kutta methods;index-2 differential-algebraic equations;order of convergence;projected methods;numerical approximation"}
{"name": "train_1199", "title": "Quasi stage order conditions for SDIRK methods", "abstract": "The stage order condition is a simplifying assumption that reduces the number of order conditions to be fulfilled when designing a Runge-Kutta (RK) method. Because a DIRK (diagonally implicit RK) method cannot have stage order greater than 1, we introduce quasi stage order conditions and derive some of their properties for DIRKs. We use these conditions to derive a low-order DIRK method with embedded error estimator. Numerical tests with stiff ODEs and DAEs of index 1 and 2 indicate that the method is competitive with other RK methods for low accuracy tolerances", "fulltext": "", "keywords": "quasi stage order conditions;sdirk methods;differential-algebraic systems;numerical tests;embedded error estimator;diagonally implicit runge-kutta method"}
{"name": "train_12", "title": "National learning systems: a new approach on technological change in late", "abstract": "industrializing economies and evidences from the cases of Brazil and South Korea The paper has two intertwined parts. The first one is a proposal for a conceptual and theoretical framework to understand technical change in late industrializing economies. The second part develops a kind of empirical test of the usefulness of that new framework by means of a comparative study of the Brazilian and South Korean cases. All the four types of macroevidences of the technical change processes of Brazil and Korea corroborate, directly or indirectly, the hypothesis of the existence of actual cases of national learning systems (NLSs) of passive and active nature, as it is shown to be the cases of Brazil and South Korea, respectively. The contrast between the two processes of technical change prove remarkable, despite both processes being essentially confined to learning. The concepts of passive and active NLSs show how useful they are to apprehend the diversity of those realities, and, consequently, to avoid, for instance, interpretations that misleadingly suppose (based on conventional economic theory) that those countries have a similar lack of technological dynamism", "fulltext": "", "keywords": "national learning systems;brazil;late industrializing economies;technological change;national innovation system;south korea"}
{"name": "train_120", "title": "Self-organized critical traffic in parallel computer networks", "abstract": "In a recent paper, we analysed the dynamics of traffic flow in a simple, square lattice architecture. It was shown that a phase transition takes place between a free and a congested phase. The transition point was shown to exhibit optimal information transfer and wide fluctuations in time, with scale-free properties. In this paper, we further extend our analysis by considering a generalization of the previous model in which the rate of packet emission is regulated by the local congestion perceived by each node. As a result of the feedback between traffic congestion and packet release, the system is poised at criticality. Many well-known statistical features displayed by Internet traffic are recovered from our model in a natural way", "fulltext": "", "keywords": "internet traffic;parallel computer networks;wide fluctuations;phase transition;scale-free properties;packet release;square lattice architecture;statistical features;self-organized critical traffic;congested phase;optimal information transfer;traffic flow dynamics;packet emission;free phase;transition point;generalization"}
{"name": "train_1200", "title": "From continuous recovery to discrete filtering in numerical approximations of", "abstract": "conservation laws Modern numerical approximations of conservation laws rely on numerical dissipation as a means of stabilization. The older, alternative approach is the use of central differencing with a dose of artificial dissipation. In this paper we review the successful class of weighted essentially non-oscillatory finite volume schemes which comprise sophisticated methods of the first kind. New developments in image processing have made new devices possible which can serve as highly nonlinear artificial dissipation terms. We view artificial dissipation as discrete filter operation and introduce several new algorithms inspired by image processing", "fulltext": "", "keywords": "conservation laws;continuous recovery;discrete filter operation;image processing;numerical approximations;central differencing;artificial dissipation;numerical dissipation;finite volume schemes;discrete filtering;highly nonlinear artificial dissipation terms"}
{"name": "train_1201", "title": "Moving into the mainstream [product lifecycle management]", "abstract": "Product lifecycle management (PLM) is widely recognised by most manufacturing companies, as manufacturers begin to identify and implement targeted projects intended to deliver return-on investment in a timely fashion. Vendors are also releasing second-generation PLM products that are packaged, out-of-the-box solutions", "fulltext": "", "keywords": "product data management;product lifecycle management;manufacturing companies;enterprise resource planning;product development"}
{"name": "train_1202", "title": "More than the money [software project]", "abstract": "Experiences creating budgets for large software projects have taught manufacturers that it is not about the money - it is about what one really needs. Before a company can begin to build a budget for a software. project, it has to have a good understanding of what business issues need to be addressed and what the business objectives are. This step is critical because it defines the business goals, outlines the metrics for success, sets the scope for the project, and defines the criteria for selecting the right software", "fulltext": "", "keywords": "budgeting;management;software requirements;software projects;manufacturing industry"}
{"name": "train_1203", "title": "Technology decisions 2002", "abstract": "The paper looks at the critical hardware, software, and services choices manufacturers are making as they begin to emerge from the recession and position themselves for the future", "fulltext": "", "keywords": "manufacturing industries;customer relationship management;information technology;management of change;enterprise resource planning;services choices"}
{"name": "train_1204", "title": "Design and prototype of a performance tool interface for OpenMP", "abstract": "This paper proposes a performance tools interface for OpenMP, similar in spirit to the MPI profiling interface in its intent to define a clear and portable API that makes OpenMP execution events visible to runtime performance tools. We present our design using a source-level instrumentation approach based on OpenMP directive rewriting. Rules to instrument each directive and their combination are applied to generate calls to the interface consistent with directive semantics and to pass context information (e.g., source code locations) in a portable and efficient way. Our proposed OpenMP performance API further allows user functions and arbitrary code regions to be marked and performance measurement to be controlled using new OpenMP directives. To prototype the proposed OpenMP performance interface, we have developed compatible performance libraries for the EXPERT automatic event trace analyzer [17, 18] and the TAU performance analysis framework [13]. The directive instrumentation transformations we define are implemented in a source-to-source translation tool called OPARI. Application examples are presented for both EXPERT and TAU to show the OpenMP performance interface and OPARI instrumentation tool in operation. When used together with the MPI profiling interface (as the examples also demonstrate), our proposed approach provides a portable and robust solution to performance analysis of OpenMP and mixed-mode (OpenMP + MPI) applications", "fulltext": "", "keywords": "opari;openmp directive rewriting;source-to-source translation tool;expert automatic event trace analyzer;mpi profiling interface;directive semantics;performance tool interface;source-level instrumentation approach;arbitrary code regions;tau performance analysis framework;parallel programming;api;performance libraries"}
{"name": "train_1205", "title": "HPCVIEW: a tool for top-down analysis of node performance", "abstract": "It is increasingly difficult for complex scientific programs to attain a significant fraction of peak performance on systems that are based on microprocessors with substantial instruction-level parallelism and deep memory hierarchies. Despite this trend, performance analysis and tuning tools are still not used regularly by algorithm and application designers. To a large extent, existing performance tools fail to meet many user needs and are cumbersome to use. To address these issues, we developed HPCVIEW - a toolkit for combining multiple sets of program profile data, correlating the data with source code, and generating a database that can be analyzed anywhere with a commodity Web browser. We argue that HPCVIEW addresses many of the issues that have limited the usability and the utility of most existing tools. We originally built HPCVIEW to facilitate our own work on data layout and optimizing compilers. Now, in addition to daily use within our group, HPCVIEW is being used by several code development teams in DoD and DoE laboratories as well as at NCSA", "fulltext": "", "keywords": "peak performance;binary analysis;software tools;instruction-level parallelism;performance analysis;data layout;commodity web browser;source code;deep memory hierarchies;complex scientific programs;optimizing compilers;node performance;hpcview;top-down analysis"}
{"name": "train_1206", "title": "The MAGNeT toolkit: design, implementation and evaluation", "abstract": "The current trend in constructing high-performance computing systems is to connect a large number of machines via a fast interconnect or a large-scale network such as the Internet. This approach relies on the performance of the interconnect (or Internet) to enable fast, large-scale distributed computing. A detailed understanding of the communication traffic is required in order to optimize the operation of the entire system. Network researchers traditionally monitor traffic in the network to gain the insight necessary to optimize network operations. Recent work suggests additional insight can be obtained by also monitoring traffic at the application level. The Monitor for Application-Generated Network Traffic toolkit (MAGNeT) we describe here monitors application traffic patterns in production systems, thus enabling more highly optimized networks and interconnects for the next generation of high-performance computing systems", "fulltext": "", "keywords": "internet;interconnects;virtual supercomputing;traffic characterization;optimized networks;monitor for application-generated network traffic toolkit;high-performance computing;magnet;computational grids;high-performance computing systems;network protocol"}
{"name": "train_1207", "title": "Packet spacing: an enabling mechanism for delivering multimedia content in", "abstract": "computational grids Streaming multimedia with UDP has become increasingly popular over distributed systems like the Internet. Scientific applications that stream multimedia include remote computational steering of visualization data and video-on-demand teleconferencing over the Access Grid. However, UDP does not possess a self-regulating, congestion-control mechanism; and most best-effort traffic is served by congestion-controlled TCP. Consequently, UDP steals bandwidth from TCP such that TCP flows starve for network resources. With the volume of Internet traffic continuing to increase, the perpetuation of UDP-based streaming will cause the Internet to collapse as it did in the mid-1980's due to the use of non-congestion-controlled TCP. To address this problem, we introduce the counter-intuitive notion of inter-packet spacing with control feedback to enable UDP-based applications to perform well in the next-generation Internet and computational grids. When compared with traditional UDP-based streaming, we illustrate that our approach can reduce packet loss over 50% without adversely affecting delivered throughput", "fulltext": "", "keywords": "udp;internet;transport protocols;inter-packet spacing;streaming multimedia;udp-based streaming;distributed systems;remote computational steering;visualization data;network protocol"}
{"name": "train_1208", "title": "A Virtual Test Facility for the simulation of dynamic response in materials", "abstract": "The Center for Simulating Dynamic Response of Materials at the California Institute of Technology is constructing a virtual shock physics facility for studying the response of various target materials to very strong shocks. The Virtual Test Facility (VTF) is an end-to-end, fully three-dimensional simulation of the detonation of high explosives (HE), shock wave propagation, solid material response to pressure loading, and compressible turbulence. The VTF largely consists of a parallel fluid solver and a parallel solid mechanics package that are coupled together by the exchange of boundary data. The Eulerian fluid code and Lagrangian solid mechanics model interact via a novel approach based on level sets. The two main computational packages are integrated through the use of Pyre, a problem solving environment written in the Python scripting language. Pyre allows application developers to interchange various computational models and solver packages without recompiling code, and it provides standardized access to several data visualization engines and data input mechanisms. In this paper, we outline the main components of the VTF, discuss their integration via Pyre, and describe some recent accomplishments in large-scale simulation using the VTF", "fulltext": "", "keywords": "problem solving environment;compressible turbulence;python scripting language;shock physics simulation;pressure loading;parallel fluid solver;pyre;parallel solid mechanics;solid material response;virtual test facility;data visualization;high explosives;virtual shock physics facility;shock wave propagation"}
{"name": "train_1209", "title": "High-level language support for user-defined reductions", "abstract": "The optimized handling of reductions on parallel supercomputers or clusters of workstations is critical to high performance because reductions are common in scientific codes and a potential source of bottlenecks. Yet in many high-level languages, a mechanism for writing efficient reductions remains surprisingly absent. Further, when such mechanisms do exist, they often do not provide the flexibility a programmer needs to achieve a desirable level of performance. In this paper, we present a new language construct for arbitrary reductions that lets a programmer achieve a level of performance equal to that achievable with the highly flexible, but low-level combination of Fortran and MPI. We have implemented this construct in the ZPL language and evaluate it in the context of the initialization of the NAS MG benchmark. We show a 45 times speedup over the same code written in ZPL without this construct. In addition, performance on a large number of processors surpasses that achieved in the NAS implementation showing that our mechanism provides programmers with the needed flexibility", "fulltext": "", "keywords": "clusters of workstations;reductions;parallel supercomputers;language construct;parallel programming;scientific computing"}
{"name": "train_121", "title": "Formula-dependent equivalence for compositional CTL model checking", "abstract": "We present a polytime computable state equivalence that is defined with respect to a given CTL formula. Since it does not attempt to preserve all CTL formulas, like bisimulation does, we can expect to compute coarser equivalences. This equivalence can be used to reduce the complexity of model checking a system of interacting FSM. Additionally, we show that in some cases our techniques can detect if a formula passes or fails, without forming the entire product machine. The method is exact and fully automatic, and handles full CTL", "fulltext": "", "keywords": "interacting fsm;formula-dependent equivalence;computation tree logic;ctl model checking;automatic method;compositional minimization;formal design verification;complexity reduction;coarse equivalence;ctl formula;polytime computable state equivalence"}
{"name": "train_1210", "title": "Adaptive optimizing compilers for the 21st century", "abstract": "Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This paper describes a prototype system that uses biased random search to discover a program-specific compilation sequence that minimizes an explicit, external objective function. The result is a compiler framework that adapts its behavior to the application being compiled, to the pool of available transformations, to the objective function, and to the target machine. This paper describes experiments that attempt to characterize the space that the adaptive compiler must search. The preliminary results suggest that optimal solutions are rare and that local minima are frequent. If this holds true, biased random searches, such as a,genetic algorithm, should find good solutions more quickly than simpler strategies, such as hill climbing", "fulltext": "", "keywords": "compilers;configurable compilers;compilation sequence;biased random search;optimizing compilers;adaptive compiler;optimizations"}
{"name": "train_1211", "title": "Hybrid decision tree", "abstract": "In this paper, a hybrid learning approach named hybrid decision tree (HDT) is proposed. HDT simulates human reasoning by using symbolic learning to do qualitative analysis and using neural learning to do subsequent quantitative analysis. It generates the trunk of a binary HDT according to the binary information gain ratio criterion in an instance space defined by only original unordered attributes. If unordered attributes cannot further distinguish training examples falling into a leaf node whose diversity is beyond the diversity-threshold, then the node is marked as a dummy node. After all those dummy nodes are marked, a specific feedforward neural network named FANNC that is trained in an instance space defined by only original ordered attributes is exploited to accomplish the learning task. Moreover, this paper distinguishes three kinds of incremental learning tasks. Two incremental learning procedures designed for example-incremental learning with different storage requirements are provided, which enables HDT to deal gracefully with data sets where new data are frequently appended. Also a hypothesis-driven constructive induction mechanism is provided, which enables HDT to generate compact concept descriptions", "fulltext": "", "keywords": "data sets;hypothesis-driven constructive induction;storage requirements;neural learning;incremental learning;fannc;hybrid learning approach;qualitative analysis;quantitative analysis;reasoning;symbolic learning;feedforward neural network;hybrid decision tree;binary information gain ratio criterion"}
{"name": "train_1212", "title": "TCRM: diagnosing tuple inconsistency for granulized datasets", "abstract": "Many approaches to granularization have been presented for knowledge discovery. However, the inconsistent tuples that exist in granulized datasets are hardly ever revealed. We developed a model, tuple consistency recognition model (TCRM) to help efficiently detect inconsistent tuples for datasets that are granulized. The main outputs of the developed model include explored inconsistent tuples and consumed processing time. We further conducted an empirical test where eighteen continuous real-life datasets granulized by the equal width interval technique that embedded S-plus histogram binning algorithm (SHBA) and largest binning size algorithm (LBSA) binning algorithms were diagnosed. Remarkable results: almost 40% of the granulized datasets contain inconsistent tuples and 22% have the amount of inconsistent tuples more than 20%", "fulltext": "", "keywords": "tuple inconsistency;processing time;relational database;granularization;granulized datasets;large database;knowledge discovery;largest binning size algorithm;tcrm;sql;equal width interval technique;s-plus histogram binning algorithm;tuple consistency recognition model"}
{"name": "train_1213", "title": "A knowledge intensive multi-agent framework for cooperative/collaborative", "abstract": "design modeling and decision support of assemblies Multi-agent modeling has emerged as a promising discipline for dealing with the decision making process in distributed information system applications. One of such applications is the modeling of distributed design or manufacturing processes which can link up various designs or manufacturing processes to form a virtual consortium on a global basis. This paper proposes a novel knowledge intensive multi-agent cooperative/collaborative framework for concurrent intelligent design and assembly planning, which integrates product design, design for assembly, assembly planning, assembly system design, and assembly simulation subjected to econo-technical evaluations. An AI protocol based method is proposed to facilitate the integration of intelligent agents for assembly design, planning, evaluation and simulation processes. A unified class of knowledge intensive Petri nets is defined using the OO knowledge-based Petri net approach and used as an AI protocol for handling both the integration and the negotiation problems among multi-agents. The detailed cooperative/collaborative mechanism and algorithms are given based on the knowledge object cooperation formalisms. As such, the assembly-oriented design system can easily be implemented under the multi-agent-based knowledge-intensive Petri net framework with concurrent integration of multiple cooperative knowledge sources and software. Thus, product design and assembly planning can be carried out simultaneously and intelligently in an entirely computer-aided concurrent design and assembly planning system", "fulltext": "", "keywords": "agent negotiation;knowledge intensive multi-agent framework;collaborative design modeling;concurrent intelligent design;distributed information system applications;cooperative framework;knowledge intensive petri nets;design for assembly;knowledge object cooperation;assembly simulation;ai protocol;assembly planning;distributed design;product design;decision support;virtual consortium"}
{"name": "train_1214", "title": "Multi-agent collaboration for B2B workflow monitoring", "abstract": "Business-to-business (B2B) application environments are exceedingly dynamic and competitive. This dynamism is manifested in the form of changing process requirements and time constraints. However, current workflow management technologies have difficulties trying to solve problems, such as: how to deal with the dynamic nature of B2B commerce processes, how to manage the distributed knowledge and recourses, and how to reduce the transaction risk. In this paper, a collaborative multi-agent system is proposed. Multiple intelligent agents in our system can work together not only to identify the workflow problems, but also to solve such problems, by applying business rules, such as re-organizing the procurement and the transaction processes, and making necessary workflow process changes", "fulltext": "", "keywords": "business rules;internet;electronic commerce;b2b workflow monitoring;workflow management;changing process requirements;business-to-business applications;time constraints;transaction risk;multi-agent collaboration"}
{"name": "train_1215", "title": "A knowledge-based approach for business process reengineering, SHAMASH", "abstract": "We present an overview of SHAMASH, a process modelling tool for business process reengineering. The main features that differentiate it from most current related tools are its ability to define and use organisation standards, functional structure, and develop automatic model simulation and optimisation. SHAMASH is a knowledge-based system, and we include a discussion on how knowledge acquisition takes place. Furthermore, we introduce a high level description of the architecture, the conceptual model, and other important modules of the system", "fulltext": "", "keywords": "process modelling tool;automatic model simulation;knowledge acquisition;knowledge-based approach;shamash;conceptual model;business process reengineering;knowledge-based system;functional structure;optimisation;organisation standards"}
{"name": "train_1216", "title": "Knowledge flow management for distributed team software development", "abstract": "Cognitive cooperation is often neglected in current team software development processes. This issue becomes more important than ever when team members are globally distributed. This paper presents a notion of knowledge flow and the related management mechanism for realizing an ordered knowledge sharing and cognitive cooperation in a geographically distributed team software development process. The knowledge flow can carry and accumulate knowledge when it goes through from one team member to another. The coordination between the knowledge flow process and the workflow process of a development team provides a new way to improve traditional team software development processes. A knowledge grid platform has been implemented to support the knowledge flow management across the Internet", "fulltext": "", "keywords": "knowledge grid platform;internet;knowledge flow management;software development management;knowledge flow representation;workflow process;cognitive cooperation;ordered knowledge sharing;cooperative work;distributed team software development"}
{"name": "train_1217", "title": "A knowledge-based approach for managing urban infrastructures", "abstract": "This paper presents a knowledge e-based approach dedicated to the efficient management, regulation, interactive and dynamic monitoring of urban infrastructures. This approach identifies the data and related treatments common to several municipal activities and defines the requirements and functionalities of the computer tools developed to improve the delivery and coordination of municipal services to the population. The resulting cooperative system called SIGIU is composed of a set of integrated operating systems (SYDEX) and the global planning and coordination system (SYGEC). The objective is to integrate the set of SYDEX and the SYGEC into a single coherent system for all the SIGIU's users according to their tasks, their roles, and their responsibilities within the municipal administration. SIGIU is provided by different measurement and monitoring instruments installed on some system's elements to be supervised. In this context, the information can be presented in different forms: video, pictures, data and alarms. One of SIGIU's objectives is the real-time management of urban infrastructures' control mechanisms. To carry out this process, the alarm control agent creates a mobile agent associated with the alarm, which is sent to a mobile station and warns an operator. Preliminary implementation results show that SIGIU supports effectively and efficiently the decision making process related to managing urban infrastructures", "fulltext": "", "keywords": "intelligent decision support system;global planning system;sigiu;municipal activities;regulation;video;multi-agent systems;mobile agent;sygec;knowledge-based approach;urban infrastructure management;dynamic monitoring;real-time management;alarm control agent;sydex;cooperative system;coordination system;integrated operating systems;urban planning"}
{"name": "train_1218", "title": "Knowledge acquisition for expert systems in accounting and financial problem", "abstract": "domains Since the mid-1980s, expert systems have been developed for a variety of problems in accounting and finance. The most commonly cited problems in developing these systems are the unavailability of the experts and knowledge engineers and difficulties with the rule extraction process. Within the field of artificial intelligence, this has been called the 'knowledge acquisition' (KA) problem and has been identified as a major bottleneck in the expert system development process. Recent empirical research reveals that certain KA techniques are significantly more efficient than others in helping to extract certain types of knowledge within specific problem domains. This paper presents a mapping between these empirical studies and a generic taxonomy of expert system problem domains. To accomplish this, we first examine the range of problem domains and suggest a mapping of accounting and finance tasks to a generic problem domain taxonomy. We then identify and describe the most prominent KA techniques employed in developing expert systems in accounting and finance. After examining and summarizing the existing empirical KA work, we conclude by showing how the empirical KA research in the various problem domains can be used to provide guidance to developers of expert systems in the fields of accounting and finance", "fulltext": "", "keywords": "problem domain taxonomy;finance;knowledge acquisition;expert systems;artificial intelligence;accounting;rule extraction process"}
{"name": "train_1219", "title": "Knowledge organisation of product design blackboard systems via graph", "abstract": "decomposition Knowledge organisation plays an important role in building a knowledge-based product design blackboard system. Well-organised knowledge sources will facilitate the effectiveness and efficiency of communication and data exchange in a blackboard system. In a previous investigation, an approach for constructing blackboard systems for product design using a non-directed graph decomposition algorithm was proposed. In this paper, the relationship between graph decomposition and the resultant blackboard system is further studied. A case study of a number of hypothetical blackboard systems that comprise different knowledge organisations is provided", "fulltext": "", "keywords": "case study;knowledge-based product design;product design blackboard systems;knowledge organisation;graph decomposition;data exchange"}
{"name": "train_122", "title": "A formal framework for viewpoint consistency", "abstract": "Multiple viewpoint models of system development are becoming increasingly important. Each viewpoint offers a different perspective on the target system and system development involves parallel refinement of the multiple views. Viewpoint related approaches have been considered in a number of different guises by a spectrum of researchers. Our work particularly focuses on the use of viewpoints in open distributed processing (ODP) which is an ISO/ITU standardisation framework. The requirements of viewpoint modelling in ODP are very broad and, hence, demanding. Multiple viewpoints, though, prompt the issue of consistency between viewpoints. This paper describes a very general interpretation of consistency which we argue is broad enough to meet the requirements of consistency in ODP. We present a formal framework for this general interpretation; highlight basic properties of the interpretation and locate restricted classes of consistency. Strategies for checking consistency are also investigated. Throughout we illustrate our theory using the formal description technique LOTOS. Thus, the paper also characterises the nature of and options for consistency checking in LOTOS", "fulltext": "", "keywords": "viewpoint consistency;open distributed processing;formal description technique;iso/itu standardisation framework;system development;odp;consistency checking;development models;formal framework;lotos;multiple viewpoint models;process algebra"}
{"name": "train_1220", "title": "Modeling discourse in collaborative work support systems: a knowledge", "abstract": "representation and configuration perspective Collaborative work processes usually raise a lot of intricate debates and negotiations among participants, whereas conflicts of interest are inevitable and support for achieving consensus and compromise is required. Individual contributions, brought up by parties with different backgrounds and interests, need to be appropriately structured and maintained. This paper presents a model of discourse acts that participants use to communicate their attitudes to each other, or affect the attitudes of others, in such environments. The first part deals with the knowledge representation and communication aspects of the problem, while the second one, in the context of an already implemented system, namely HERMES, with issues related to the configuration of the contributions asserted at each discourse instance. The overall work focuses on the machinery needed in a computer-assisted collaborative work environment, the aim being to further enhance the human-computer interaction", "fulltext": "", "keywords": "human-computer interaction;compromise;consensus;conflicts of interest;hermes;knowledge representation;knowledge communication;collaborative work support systems;discourse modeling"}
{"name": "train_1221", "title": "An approach to developing computational supports for reciprocal tutoring", "abstract": "This study presents a novel approach to developing computational supports for reciprocal tutoring. Reciprocal tutoring is a collaborative learning activity, where two participants take turns to play the role of a tutor and a tutee. The computational supports include scaffolding tools for the tutor and a computer-simulated virtual participant. The approach, including system architecture, implementations of scaffolding tools for the tutor and of a virtual participant is presented herein. Furthermore, a system for reciprocal tutoring is implemented as an example of the approach", "fulltext": "", "keywords": "collaborative learning;computer-simulated virtual participant;intelligent tutoring system;system architecture;reciprocal tutoring computational support;scaffolding tools"}
{"name": "train_1222", "title": "Mining the optimal class association rule set", "abstract": "We define an optimal class association rule set to be the minimum rule set with the same predictive power of the complete class association rule set. Using this rule set instead of the complete class association rule set we can avoid redundant computation that would otherwise be required for mining predictive association rules and hence improve the efficiency of the mining process significantly. We present an efficient algorithm for mining the optimal class association rule set using an upward closure property of pruning weak rules before they are actually generated. We have implemented the algorithm and our experimental results show that our algorithm generates the optimal class association rule set, whose size is smaller than 1/17 of the complete class association rule set on average, in significantly less time than generating the complete class association rule set. Our proposed criterion has been shown very effective for pruning weak rules in dense databases", "fulltext": "", "keywords": "dense databases;data mining;experimental results;upward closure property;predictive association rules;optimal class association rule set mining;predictive power;relational database;redundant computation;weak rule pruning;minimum rule set"}
{"name": "train_1223", "title": "Formalising optimal feature weight setting in case based diagnosis as linear", "abstract": "programming problems Many approaches to case based reasoning (CBR) exploit feature weight setting algorithms to reduce the sensitivity to distance functions. We demonstrate that optimal feature weight setting in a special kind of CBR problems can be formalised as linear programming problems. Therefore, the optimal weight settings can be calculated in polynomial time instead of searching in exponential weight space using heuristics to get sub-optimal settings. We also demonstrate that our approach can be used to solve classification problems", "fulltext": "", "keywords": "classification;heuristics;linear programming;searching;polynomial time;case based diagnosis;optimal feature weight setting;case based reasoning;distance functions;exponential weight space"}
{"name": "train_1224", "title": "Formalization of weighted factors analysis", "abstract": "Weighted factors analysis (WeFA) has been proposed as a new approach for elicitation, representation, and manipulation of knowledge about a given problem, generally at a high and strategic level. Central to this proposal is that a group of experts in the area of the problem can identify a hierarchy of factors with positive or negative influences on the problem outcome. The tangible output of WeFA is a directed weighted graph called a WeFA graph. This is a set of nodes denoting factors that can directly or indirectly influence an overall aim of the graph. The aim is also represented by a node. Each directed arc is a direct influence of one factor on another. A chain of directed arcs indicates an indirect influence. The influences may be identified as either positive or negative. For example, sales and costs are two factors that influence the aim of profitability in an organization. Sales has a positive influence on profitability and costs has a negative influence on profitability. In addition, the relative significance of each influence is represented by a weight. We develop Binary WeFA which is a variant of WeFA where the factors in the graph are restricted to being either true or false. Imposing this restriction on a WeFA graph allows us to be more precise about the meaning of the graph and of reasoning in it. Binary WeFA is a new proposal that provides a formal yet sufficiently simple language for logic-based argumentation for use by business people in decision-support and knowledge management. Whilst Binary WeFA is expressively simpler than other logic-based argumentation formalisms, it does incorporate a novel formalization of the notion of significance", "fulltext": "", "keywords": "organization;weighted factors analysis;significance;wefa graph;directed arc;logic-based argumentation;knowledge manipulation;reasoning;knowledge representation;knowledge management;knowledge elicitation;decision-support;profitability;binary wefa;directed weighted graph"}
{"name": "train_1225", "title": "BT voices its support for IP", "abstract": "BTexact's chief technology officer, Mick Reeve, gives his views on the future for voice over DSL services and virtual private networks, and defends the slow rollout of public access WLANs", "fulltext": "", "keywords": "virtual private networks;btexact;public access wlans;voice over dsl"}
{"name": "train_1226", "title": "Temp IT chief rallies troops [Mori]", "abstract": "The appointment of a highly qualified interim IT manager enabled market research company Mori to rapidly restructure its IT department. Now the resulting improvements are allowing it to support an increasing role for technology in the assimilation and analysis of market research", "fulltext": "", "keywords": "interim it manager;mori;market research company"}
{"name": "train_1227", "title": "Will new Palms win laurels.?", "abstract": "PalmSource's latest operating system for mobile devices harnesses the ARM architecture to support more powerful business software, but there are concerns over compatibility with older applications", "fulltext": "", "keywords": "compatibility;palmsource;arm architecture;mobile devices;palm os 5.0;operating system"}
{"name": "train_1228", "title": "Outsourced backup saves time", "abstract": "To increase the efficiency of its data backup and to free staff to concentrate on core business, The Gadget Shop is relying on a secure, automated system hosted by a third party", "fulltext": "", "keywords": "the gadget shop;outsourced;data backup;e-business"}
{"name": "train_1229", "title": "Dot-Net makes slow progress", "abstract": "Microsoft's Windows .Net Enterprise Server Release Candidate I, which was released at the end of last month, provides an early glimpse of the system that will eventually replace Windows 200 Advanced Server. The software has been improved so that Active Directory is more flexible and easier to deploy; and security, scalability and management have also been enhanced", "fulltext": "", "keywords": "scalability;windows .net enterprise server;security;active directory"}
{"name": "train_123", "title": "A new identification approach for FIR models", "abstract": "The identification of stochastic discrete systems disturbed with noise is discussed in this brief. The concept of general prediction error (GPE) criterion is introduced for the time-domain estimate with optimal frequency estimation (OFE) introduced for the frequency-domain estimate. The two estimation methods are combined to form a new identification algorithm, which is called the empirical frequency-domain optimal parameter (EFOP) estimate, for the finite impulse response (FIR) model interfered by noise. The algorithm theoretically provides the global optimum of the model frequency-domain estimate. Some simulation examples are given to illustrate the new identification method", "fulltext": "", "keywords": "identification approach;stochastic discrete systems;optimal frequency estimation;frequency-domain estimate;fir models;empirical frequency-domain optimal parameter estimate;time-domain estimate;general prediction error criterion"}
{"name": "train_1230", "title": "Server safeguards tax service", "abstract": "Peterborough-based tax consultancy IE Taxguard wanted real-time failover protection for important Windows-based applications. Its solution was to implement a powerful failover server from UK supplier Neverfail in order to provide real-time backup for three core production servers", "fulltext": "", "keywords": "ie taxguard;neverfail;backup;tax consultancy;failover server"}
{"name": "train_1231", "title": "Efficient parallel programming on scalable shared memory systems with High", "abstract": "Performance Fortran OpenMP offers a high-level interface for parallel programming on scalable shared memory (SMP) architectures. It provides the user with simple work-sharing directives while it relies on the compiler to generate parallel programs based on thread parallelism. However, the lack of language features for exploiting data locality often results in poor performance since the non-uniform memory access times on scalable SMP machines cannot be neglected. High Performance Fortran (HPF), the de-facto standard for data parallel programming, offers a rich set of data distribution directives in order to exploit data locality, but it has been mainly targeted towards distributed memory machines. In this paper we describe an optimized execution model for HPF programs on SMP machines that avails itself with mechanisms provided by OpenMP for work sharing and thread parallelism, while exploiting data locality based on user-specified distribution directives. Data locality does not only ensure that most memory accesses are close to the executing threads and are therefore faster, but it also minimizes synchronization overheads, especially in the case of unstructured reductions. The proposed shared memory execution model for HPF relies on a small set of language extensions, which resemble the OpenMP work-sharing features. These extensions, together with an optimized shared memory parallelization and execution model, have been implemented in the ADAPTOR HPF compilation system and experimental results verify the efficiency of the chosen approach", "fulltext": "", "keywords": "scalable hardware;scalable shared memory;multiprocessor architectures;shared memory multiprocessor;high performance fortran;parallel programming"}
{"name": "train_1232", "title": "Techniques for compiling and implementing all NAS parallel benchmarks in HPF", "abstract": "The NAS parallel benchmarks (NPB) are a well-known benchmark set for high-performance machines. Much effort has been made to implement them in High-Performance Fortran (HPF). In previous attempts, however, the HPF versions did not include the complete set of benchmarks, and the performance was not always good. In this study, we implement all eight benchmarks of the NPB in HPF, and parallelize them using an HPF compiler that we have developed. This report describes the implementation techniques and compiler features necessary to achieve good performance. We evaluate the HPF version on the Hitachi SR2201, a distributed-memory parallel machine. With 16 processors, the execution time of the HPF version is within a factor of 1.5 of the hand-parallelized version of the NPB 2.3 beta", "fulltext": "", "keywords": "hpf compiler;compiler;nas parallel benchmarks;distributed-memory parallel supercomputers;high-performance machines"}
{"name": "train_1233", "title": "Advanced optimization strategies in the Rice dHPF compiler", "abstract": "High-Performance Fortran (HPF) was envisioned as a vehicle for modernizing legacy Fortran codes to achieve scalable parallel performance. To a large extent, today's commercially available HPF compilers have failed to deliver scalable parallel performance for a broad spectrum of applications because of insufficiently powerful compiler analysis and optimization. Substantial restructuring and hand-optimization can be required to achieve acceptable performance with an HPF port of an existing Fortran application, even for regular data-parallel applications. A key goal of the Rice dHPF compiler project has been to develop optimization techniques that enable a wide range of existing scientific applications to be ported easily to efficient HPF with minimal restructuring. This paper describes the challenges to effective parallelization presented by complex (but regular) data-parallel applications, and then describes how the novel analysis and optimization technologies in the dHPF compiler address these challenges effectively, without major rewriting of the applications. We illustrate the techniques by describing their use for parallelizing the NAS SP and BT benchmarks. The dHPF compiler generates multipartitioned parallelizations of these codes that are approaching the scalability and efficiency of sophisticated hand-coded parallelizations", "fulltext": "", "keywords": "legacy fortran codes;compiler optimization;automatic parallelization;rice dhpf compiler;multipartitioning;parallel performance;compiler analysis;hpf compilers;mgh-performance fortran"}
{"name": "train_1234", "title": "Achieving performance under OpenMP on ccNUMA and software distributed shared", "abstract": "memory systems OpenMP is emerging as a viable high-level programming model for shared memory parallel systems. It was conceived to enable easy, portable application development on this range of systems, and it has also been implemented on cache-coherent Non-Uniform Memory Access (ccNUMA) architectures. Unfortunately, it is hard to obtain high performance on the latter architecture, particularly when large numbers of threads are involved. In this paper, we discuss the difficulties faced when writing OpenMP programs for ccNUMA systems, and explain how the vendors have attempted to overcome them. We focus on one such system, the SGI Origin 2000, and perform a variety of experiments designed to illustrate the impact of the vendor's efforts. We compare codes written in a standard, loop-level parallel style under OpenMP with alternative versions written in a Single Program Multiple Data (SPMD) fashion, also realized via OpenMP, and show that the latter consistently provides superior performance. A carefully chosen set of language extensions can help us translate programs from the former style to the latter (or to compile directly, but in a similar manner). Syntax for these extensions can be borrowed from HPF, and some aspects of HPF compiler technology can help the translation process. It is our expectation that an extended language, if well compiled, would improve the attractiveness of OpenMP as a language for high-performance computation on an important class of modern architectures", "fulltext": "", "keywords": "hpf;shared memory parallel systems;cache-coherent non-uniform memory access;programming model;openmp;parallel programming;single program multiple data"}
{"name": "train_1235", "title": "Finding performance bugs with the TNO HPF benchmark suite", "abstract": "High-Performance Fortran (HPF) has been designed to provide portable performance on distributed memory machines. An important aspect of portable performance is the behavior of the available HPF compilers. Ideally, a programmer may expect comparable performance between different HPF compilers, given the same program and the same machine. To test the performance portability between compilers, we have designed a special benchmark suite, called the TNO HPF benchmark suite. It consists of a set of HPF programs that test various aspects of efficient parallel code generation. The benchmark suite consists of a number of template programs that are used to generate test programs with different array sizes, alignments, distributions, and iteration spaces. It ranges from very simple assignments to more complex assignments such as triangular iteration spaces, convex iteration spaces, coupled subscripts, and indirection arrays. We have run the TNO HPF benchmark suite on three compilers: the PREPARE prototype compiler, the PGI-HPF compiler, and the GMD Adaptor HPF compiler. Results show performance differences that can be quite large (up to two orders of magnitude for the same test program). Closer inspection reveals that the origin of most of the differences in performance is due to differences in local enumeration and storage of distributed array elements", "fulltext": "", "keywords": "compiler optimizations;benchmark suite;portable performance;parallel compilers;high-performance fortran;performance portability;hpf compilers;distributed memory machines"}
{"name": "train_1236", "title": "Compatibility comparison and performance evaluation for Japanese HPF compilers", "abstract": "using scientific applications The lack of compatibility of High-Performance Fortran (HPF) between vender implementations has been disheartening scientific application users so as to hinder the development of portable programs. Thus parallel computing is still unpopular in the computational science community, even though parallel programming is common to the computer science community. As users would like to run the same source code on parallel machines with different architectures as fast as possible, we have investigated the compatibility of source codes for Japanese HPF compilers (NEC, Fujitsu and Hitachi) with two real-world applications: a 3D fluid code and a 2D particle code. We have found that the source-level compatibility between Japanese HPF compilers is almost preserved, but more effort will be needed to sustain complete compatibility. We have also evaluated parallel performance and found that HPF can achieve good performance for the 3D fluid code with almost the same source code. For the 2D particle code, good results have also been obtained with a small number of processors, but some changes in the original source code and the addition of interface blocks is required", "fulltext": "", "keywords": "hpf;compilers;high-performance fortran;source compatability;parallel performance;portable programs;parallel programming"}
{"name": "train_1237", "title": "High-performance numerical pricing methods", "abstract": "The pricing of financial derivatives is an important field in finance and constitutes a major component of financial management applications. The uncertainty of future events often makes analytic approaches infeasible and, hence, time-consuming numerical simulations are required. In the Aurora Financial Management System, pricing is performed on the basis of lattice representations of stochastic multidimensional scenario processes using the Monte Carlo simulation and Backward Induction methods, the latter allowing for the exploitation of shared-memory parallelism. We present the parallelization of a Backward Induction numerical pricing kernel on a cluster of SMPs using HPF+, an extended version of High-Performance Fortran. Based on language extensions for specifying a hierarchical mapping of data onto an SMP cluster, the compiler generates a hybrid-parallel program combining distributed-memory and shared-memory parallelism. We outline the parallelization strategy adopted by the VFC compiler and present an experimental evaluation of the pricing kernel on an NEC SX-5 vector supercomputer and a Linux SMP cluster, comparing a pure MPI version to a hybrid-parallel MPI/OpenMP version", "fulltext": "", "keywords": "financial management;aurora financial management system;numerical pricing kernel;backward induction methods;investment strategies;finance;monte carlo simulation;derivative pricing;stochastic processes;pricing"}
{"name": "train_1238", "title": "Optimization of element-by-element FEM in HPF 1.1", "abstract": "In this study, Poisson's equation is numerically evaluated by the element-by-element (EBE) finite-element method in a parallel environment using HPF 1.1 (High-Performance Fortran). In order to achieve high parallel efficiency, the data structures have been altered to node-based data instead of mixtures of node- and element-based data, representing a node-based EBE finite-element scheme (nEBE). The parallel machine used in this study was the NEC SX-4, and experiments were performed on a single node having 32 processors sharing common memory. The HPF compiler used in the experiments is HPF/SX Rev 2.0 released in 1997 (unofficial), which supports HPF 1.1. Models containing approximately 200 000 and 1,500,000 degrees of freedom were analyzed in order to evaluate the method. The calculation time, parallel efficiency, and memory used were compared. The performance of HPF in the conjugate gradient solver for the large model, using the NEC SX-4 compiler option-noshrunk, was about 85% that of the message passing interface", "fulltext": "", "keywords": "hpf;message passing;hpf compiler;conjugate gradient solver;finite element method;parallel programs;poisson equation;element-by-element"}
{"name": "train_1239", "title": "Three-dimensional global MHD simulation code for the Earth's magnetosphere", "abstract": "using HPF/JA We have translated a three-dimensional magnetohydrodynamic (MHD) simulation code of the Earth's magnetosphere from VPP Fortran to HPF/JA on the Fujitsu VPP5000/56 vector-parallel supercomputer and the MHD code was fully vectorized and fully parallelized in VPP Fortran. The entire performance and capability of the HPF MHD code could be shown to be almost comparable to that of VPP Fortran. A three-dimensional global MHD simulation of the Earth's magnetosphere was performed at a speed of over 400 Gflops with an efficiency of 76.5% using 56 processing elements of the Fujitsu VPP5000/56 in vector and parallel computation that permitted comparison with catalog values. We have concluded that fluid and MHD codes that are fully vectorized and fully parallelized in VPP Fortran can be translated with relative ease to HPF/JA, and a code in HPF/JA may be expected to perform comparably to the same code written in VPP Fortran", "fulltext": "", "keywords": "parallel computation;hpf mhd code;mhd simulation;fujitsu vpp5000/56;vector-parallel supercomputer;magnetohydrodynamic simulation"}
{"name": "train_124", "title": "High-speed CMOS circuits with parallel dynamic logic and speed-enhanced skewed", "abstract": "static logic In this paper, we describe parallel dynamic logic (PDL) which exhibits high speed without charge sharing problem. PDL uses only parallel-connected transistors for fast logic evaluation and is a good candidate for high-speed low-voltage operation. It has less back-bias effect compared to other logic styles, which use stacked transistors. Furthermore, PDL needs no signal ordering or tapering. PDL with speed-enhanced skewed static logic renders straightforward logic synthesis without the usual area penalty due to logic duplication. Our experimental results on two 32-bit carry lookahead adders using 0.25- mu m CMOS technology show that PDL with speed-enhanced skewed static (SSS) look reduces the delay over clock-delayed(CD)-domino by 15%-27% and the power-delay product by 20%-37%", "fulltext": "", "keywords": "32 bit;parallel-connected transistors;logic synthesis;parallel dynamic logic;low-voltage operation;speed-enhanced skewed static logic;0.25 micron;back-bias effect;stacked transistors;power-delay product;delay;high-speed cmos circuits;carry lookahead adders"}
{"name": "train_1240", "title": "Implementation and evaluation of HPF/SX V2", "abstract": "We are developing HPF/SX V2, a High Performance Fortran (HPF) compiler for vector parallel machines. It provides some unique extensions as well as the features of HPF 2.0 and HPF/JA. In particular, this paper describes four of them: (1) the ON directive of HPF 2.0; (2) the REFLECT and LOCAL directives of HPF/JA; (3) vectorization directives; and (4) automatic parallelization. We evaluate these features through some benchmark programs on NEC SX-5. The results show that each of them achieved a 5-8 times speedup in 8-CPU parallel execution and the four features are useful for vector parallel execution. We also evaluate the overall performance of HPF/SX V2 by using over 30 well-known benchmark programs from HPFBench, APR Benchmarks, GENESIS Benchmarks, and NAS Parallel Benchmarks. About half of the programs showed good performance, while the other half suggest weakness of the compiler, especially on its runtimes. It is necessary to improve them to put the compiler to practical use", "fulltext": "", "keywords": "benchmark;compiler;hpf/sx v2;parallelization;vector parallel machines;high performance fortran compiler"}
{"name": "train_1241", "title": "Code generator for the HPF Library and Fortran 95 transformational functions", "abstract": "One of the language features of the core language of HPF 2.0 (High Performance Fortran) is the HPF Library. The HPF Library consists of 55 generic functions. The implementation of this library presents the challenge that all data types, data kinds, array ranks and input distributions need to be supported. For instance, more than 2 billion separate functions are required to support COPY-SCATTER fully. The efficient support of these billions of specific functions is one of the outstanding problems of HPF. We have solved this problem by developing a library generator which utilizes the mechanism of parameterized templates. This mechanism allows the procedures to be instantiated at compile time for arguments with a specific type, kind, rank and distribution over a specific processor array. We describe the algorithms used in the different library functions. The implementation gives the ease of generating a large number of library routines from a single template. The templates can be extended with special code for specific combinations of the input arguments. We describe in detail the implementation and performance of the matrix multiplication template for the Fujitsu VPP5000 platform", "fulltext": "", "keywords": "hpf;data types;parallel languages;code generation;library generator;matrix multiplication;parameterized templates;library functions;generic functions;high performance fortran;hpf library;parallel computing"}
{"name": "train_1242", "title": "VPP Fortran and the design of HPF/JA extensions", "abstract": "VPP Fortran is a data parallel language that has been designed for the VPP series of supercomputers. In addition to pure data parallelism, it contains certain low-level features that were designed to extract high performance from user programs. A comparison of VPP Fortran and High-Performance Fortran (HPF) 2.0 shows that these low-level features are not available in HPF 2.0. The features include asynchronous interprocessor communication, explicit shadow, and the LOCAL directive. They were shown in VPP Fortran to be very useful in handling real-world applications, and they have been included in the HPF/JA extensions. They are described in the paper. The HPF/JA Language Specification Version 1.0 is an extension of HPF 2.0 to achieve practical performance for real-world applications and is a result of collaboration in the Japan Association for HPF (JAHPF). Some practical programming and tuning procedures with the HPF/JA Language Specification are described, using the NAS Parallel Benchmark BT as an example", "fulltext": "", "keywords": "high performance;benchmark;data parallel language;vpp fortran;asynchronous communication;data locality;asynchronous interprocessor communication;explicit shadow;data parallelism"}
{"name": "train_1243", "title": "HPF/JA: extensions of High Performance Fortran for accelerating real-world", "abstract": "applications This paper presents a set of extensions on High Performance Fortran (HPF) to make it more usable for parallelizing real-world production codes. HPF has been effective for programs that a compiler can automatically optimize efficiently. However, once the compiler cannot, there have been no ways for the users to explicitly parallelize or optimize their programs. In order to resolve the situation, we have developed a set of HPF extensions (HPF/JA) to give the users more control over sophisticated parallelization and communication optimizations. They include parallelization of loops with complicated reductions, asynchronous communication, user-controllable shadow, and communication pattern reuse for irregular remote data accesses. Preliminary experiments have proved that the extensions are effective at increasing HPF's usability", "fulltext": "", "keywords": "hpf;compiler;data parallel language;parallel processing;high performance fortran;parallel programming;parallelization of loops;supercomputer"}
{"name": "train_1244", "title": "Applied ethics in business information units", "abstract": "The primary thesis of this paper is that business information professionals commonly overlook ethical dilemmas in the workplace. Although the thesis remains unproven, the author highlights, by way of real and hypothetical case studies, a number of situations in which ethical tensions can be identified, and suggests that information professionals need to be more aware of the moral context of their actions. Resolving ethical dilemmas should be one of the aims of competent information professionals and their managers, although it is recognized that dilemmas often cannot easily be resolved. A background to the main theories of applied ethics forms the framework for later discussion", "fulltext": "", "keywords": "moral context;ethical dilemmas;business information professionals;applied ethics;business information units"}
{"name": "train_1245", "title": "A brief guide to competitive intelligence: how to gather and use information on", "abstract": "competitors The author outlines the processes involved in competitive intelligence, and discusses what it is, how to do it and gives examples of what happens when companies fail to monitor their competitive environment effectively. The author presents a case study, showing how the company that produced the pre-cursor to the Barbie doll failed to look at their business environment and how this led to the firm's failure. The author discusses what competitive intelligence is, and what it is not, and why it is important for businesses, and presents three models used to describe the competitive intelligence process, going through the various steps involved in defining intelligence requirements and collecting, analyzing, communicating and utilizing competitive intelligence", "fulltext": "", "keywords": "intelligence analysis;intelligence collection;intelligence utilization;intelligence communication;barbie doll;competitor information;competitive intelligence;business environment"}
{"name": "train_1246", "title": "Why information departments are becoming academic", "abstract": "This article outlines the increasing convergence between academia and business over the last decade or so, and the mutual benefits that this closer association has brought. It also looks at the growing importance of the information profession, suggesting that this is leading to a greater need for specialist skills, as reflected by the rise in academic courses in this area. However, it argues that increasing specialization must not lead to insularity; if information professionals are truly concerned with gaining a competitive advantage, they must not close their minds to the potential benefits of working with external, non specialist, partners. The benefits that business has reaped from academia, it is contended, suggest that this may also be a fruitful avenue for information departments to explore", "fulltext": "", "keywords": "information departments;academic courses;information science;universities;business;academia;information profession;specialist skills"}
{"name": "train_1247", "title": "The changing landscape for multi access portals", "abstract": "Discusses the factors that have made life difficult for consumer portal operators in recent years causing them, like others in the telecommunications, media and technology sector, to take a close look at their business models following the dot.com crash and the consequent reassessment of Internet-related project financing by the venture capital community. While the pressure is on to generate income from existing customers and users, portal operators must reach new markets and find realistic revenue streams. This search for real revenues has led to a move towards charging for content, a strategy being pursued by a large number of horizontal portal players, including MSN and Terra Lycos. This trend is particularly noticeable in China, where Chinadotcom operates a mainland portal and plans a range of fee-based services, including electronic mail. The nature of advertising itself is changing, with portals seeking blue-chip sponsorship and marketing deals that span a number of years. Players are struggling to redefine and reinvent themselves as a result of the changing environment and even the term \"portal\" is believed to be obsolete, partly due to its dot.com crash associations. Multi-access portals are expected to dominate the consumer sector, becoming bigger and better overall than their predecessors and playing a more powerful role in the consumer environment", "fulltext": "", "keywords": "multi-access portals;blue-chip sponsorship;fee-based services;consumer portal operators;revenue streams;advertising"}
{"name": "train_1248", "title": "Public business libraries: the next chapter", "abstract": "Traces the history of the provision of business information by Leeds Public Libraries, UK, from the opening of the Public Commercial and Technical Library in 1918 to the revolutionary impact of the Internet in the 1990s. Describes how the Library came to terms with the need to integrate the Internet into its mainstream business information services, with particular reference to its limitations and to the provision of company information, market research, British Standards information, press cuttings and articles from specialized trade and scientific journals, and patents information. Focuses on some of the reasons why the public business library is still needed as a service to businesses, even after the introduction of the Internet and considers the Library's changing role and the need to impress on all concerned, especially government, the continuing value of these services. Looks to the partnerships formed by the Library over the years and the ways in which these are expected to assist in realizing future opportunities, in particular, the fact that all public libraries in England gained free Internet access at the end of 2001. Offers some useful ideas about how the Library could develop, noting that SINTO, a Sheffield based information network formed in 1938 and originally a partnership between the public library, the two Sheffield universities and various leading steel companies of the time, is being examined as a model for future services in Leeds. Concludes that the way forward can be defined in terms of five actions: redefinition of priorities; marketing; budgets; resources; and the use of information technology (IT)", "fulltext": "", "keywords": "trade journal articles;press cuttings;steel companies;market research;leeds public libraries;business information services;sheffield universities;budgets;sinto;government;it use;public business libraries;internet;public commercial and technical library;patents information;british standards information;resources;priority redefinition;scientific journal articles;marketing;history;company information;information network"}
{"name": "train_1249", "title": "Aggregators versus disintermediators: battling it out in the information", "abstract": "superhighstreet Perhaps the future of large-scale content aggregators is now no longer in doubt but this was not the case 10 years ago, when many leading industry experts were much more pessimistic in their predictions. In the year that Dialog celebrates its thirtieth anniversary as the world's oldest and largest professional online information service, it is appropriate to look back at these changing perceptions, the reasons for these changes, and why the experts got it wrong. We also look at the present day; the value that large-scale content aggregators bring to the information supply chain; and we discuss why users would choose to use aggregators as opposed to going directly to the publishers", "fulltext": "", "keywords": "information supply chain;disintermediators;large-scale content aggregators;online information service"}
{"name": "train_125", "title": "A fast implementation of correlation of long data sequences for coherent", "abstract": "receivers Coherent reception depends upon matching of phase between the transmitted and received signal. Fast convolution techniques based on fast Fourier transform (FFT) are widely used for extracting time delay information from such matching. The latency in processing a large data window of the received signal is a serious overhead for mission critical real time applications. The implementation of a parallel algorithm for correlation of long data sequences in multiprocessor environment is demonstrated here. The algorithm does processing while acquiring the received signal and reduces the computation overhead considerably because of inherent parallelism", "fulltext": "", "keywords": "computation;mission critical real time applications;transmitted signal;received signal;parallel algorithm;time delay information;latency;multiprocessor environment;correlation;fast fourier transform;coherent receivers;long data sequences"}
{"name": "train_1250", "title": "The impact and implementation of XML on business-to-business commerce", "abstract": "This paper discusses the impact analysis of the Extensible Markup Language (XML). Each business partner within a supply chain will be allowed to generate its own data exchange format by adopting an XML meta-data management system in the local side. Followed after a brief introduction of the information technology for Business to Customer (B2C) and Business to Business (B2B) Electronic Commerce (EC), the impact of XML on the tomorrow business world is discussed. A real case study for impact analysis on information exchange platform, Microsoft's BizTalk platform which is actually an XML schema builder and the implementation of XML commerce application will provide an interest insight for users' future implementation", "fulltext": "", "keywords": "business to customer;electronic commerce;xml schema builder;business to business;xml;electronic data interchange;enterprise resources planning;extensible markup language;biztalk"}
{"name": "train_1251", "title": "A synergic analysis for Web-based enterprise resources planning systems", "abstract": "As the central nervous system for managing an organization's mission and critical business data, Enterprise Resource Planning (ERP) system has evolved to become the backbone of e-business implementation. Since an ERP system is multimodule application software that helps a company manage its important business functions, it should be versatile enough to automate every aspect of business processes, including e-business", "fulltext": "", "keywords": "enterprise resource planning;customer relationship management;web-based enterprise resources planning;erp;synergic analysis;e-business"}
{"name": "train_1252", "title": "An agent-oriented and service-oriented environment for deploying dynamic", "abstract": "distributed systems This paper presents JASE, a Java-based Agent-oriented and Service-oriented Environment for deploying dynamic distributed systems. JASE utilizes two important concepts in the field of distributed computing: the concept of services and remote programming with mobile agents. In JASE, mobile agents are used to support applications, and service interface agents are used to wrap services. Service inter-face agents can dynamically register their services in Service Server. Mobile agent locates a specific service interface agent by submitting requests to the Service Server with descriptions of required services. JASE uses XML to describe both service descriptions and the mobile agent's queries. JASE supports two kinds of communication facility: tuple space and asynchronous messages. In this paper, the design and implementation of JASE are described. An application shows the suitability and the effectiveness of the JASE and performance evaluation is also made. Finally, related work and some conclusions are given", "fulltext": "", "keywords": "service-oriented environment;remote programming;dynamic distributed systems;performance evaluation;mobile agents;agent-oriented environment;jase;java-based agent-oriented and service-oriented environment"}
{"name": "train_1253", "title": "Application of XML for neural network exchange", "abstract": "This article introduces a framework for the interchange of trained neural network models. An XML-based language (Neural Network Markup Language) for the neural network model description is offered. It allows to write down all the components of neural network model which are necessary for its reproduction. We propose to use XML notation for the full description of neural models, including data dictionary, properties of training sample, preprocessing methods, details of network structure and parameters and methods for network output interpretation", "fulltext": "", "keywords": "network output interpretation;data dictionary;preprocessing methods;xml;neural network exchange;network structure;neural network markup language"}
{"name": "train_1254", "title": "Supporting unified interface to wrapper generator in integrated information", "abstract": "retrieval Given the ever-increasing scale and diversity of information and applications on the Internet, improving the technology of information retrieval is an urgent research objective. Retrieved information is either semi-structured or unstructured in format and its sources are extremely heterogeneous. In consequence, the task of efficiently gathering and extracting information from documents can be both difficult and tedious. Given this variety of sources and formats, many choose to use mediator/wrapper architecture, but its use demands a fast means of generating efficient wrappers. In this paper, we present a design for an automatic eXtensible Markup Language (XML)-based framework with which to generate wrappers rapidly. Wrappers created with this framework support a unified interface for a meta-search information retrieval system based on the Internet Search Service using the Common Object Request Broker Architecture (CORBA) standard. Greatly advantaged by the compatibility of CORBA and XML, a user can quickly and easily develop information-gathering applications, such as a meta-search engine or any other information source retrieval method. The two main things our design provides are a method of wrapper generation that is fast, simple, and efficient, and a wrapper generator that is CORBA and XML-compliant and that supports a unified interface", "fulltext": "", "keywords": "internet;integrated information retrieval;corba;meta-search engine;unified interface;wrapper generator;automatic extensible markup language"}
{"name": "train_1255", "title": "Succession in standardization: grafting XML onto SGML", "abstract": "Succession in standardization is often a problem. The advantages of improvements must be weighed against those of compatibility. If compatibility considerations dominate, a grafting process takes place. According to our taxonomy of succession, there are three types of outcomes. A Type I succession, where grafting is successful, entails compatibility between successors, technical paradigm compliance and continuity in the standards trajectory. In this paper, we examine issues of succession and focus on the Extensible Markup Language (XML). It was to be grafted on the Standard Generalized Markup Language (SGML), a stable standard since 1988. However, XML was a profile, a subset and an extension of SGML (1988). Adaptation of SGML was needed (SGML 1999) to forge full (downward) compatibility with XML (1998). We describe the grafting efforts and analyze their outcomes. Our conclusion is that although SGML was a technical exemplar for XML developers, full compatibility was not achieved. The widespread use of HyperText Mark-up Language (HTML) exemplified the desirability of simplicity in XML, standardization. This and HTML's user market largely explain the discontinuity in SGML-XML succession", "fulltext": "", "keywords": "type i succession;sgml;standard generalized markup language;grafting process;standardization;xml;extensible markup language"}
{"name": "train_1256", "title": "High-speed consistency checking for hypothetical reasoning systems using", "abstract": "inference path network Hypothetical reasoning is popular in fault diagnostics and design systems, but slow reasoning speed is its drawback. The goal of the current study is developing hypothetical reasoning based on an inference path network, which would overcome this drawback. In hypothetical reasoning systems based on an inference path network, there is much room for improvement regarding the computing costs of connotation processing and consistency checking. The authors of this study demonstrate improvement ideas regarding one of these problems, namely, consistency checking. First, the authors obtained necessary and sufficient conditions under which inconsistencies occur during hypothesis composition. Based on the obtained results, the authors proposed an algorithm for speeding up the process of consistency checking. Processing with this algorithm in its core consists of transforming the inference path network in such a way that inconsistencies do not occur during the hypothesis composition, under the condition of unchanged solution hypotheses. The efficiency of this algorithm was confirmed by tests", "fulltext": "", "keywords": "fault diagnostics;hypothesis composition;hypothetical reasoning;reasoning speed;inconsistencies;high-speed consistency checking;speed up;inference path network"}
{"name": "train_1257", "title": "Definition of a similarity measure between cases based on auto/cross-fuzzy", "abstract": "thesauri A similarity measure between cases is needed in order to evaluate the degree of similarity when using past similar cases in order to resolve current problems. In similar case retrieval, multiple indices are set up in order to characterize the queries and individual cases, then terms are given as values to each. The similarity measure between cases commonly used is defined using the rate at which the values provided from the corresponding indices match. In practice, however, values cannot be expected to be mutually exclusive. As a result, a natural expansion of this approach is to have relationships in which mutually similar meanings are reflected in the similarity measure between cases. In this paper the authors consider an auto-fuzzy thesaurus which gives the relationship for values between corresponding indices and a cross-fuzzy thesaurus which gives the relationship for values between mutually distinct indices, then defines a similarity measure between cases which considers the relationship of index values based on these thesauri. This definition satisfies the characteristics required for the operation of case-based retrieval even when one value is not necessarily given in the index. Finally, using a test similar case retrieval system, the authors perform a comparative analysis of the proposed similarity measure between cases and a conventional approach", "fulltext": "", "keywords": "case similarity measure;problem solving;relationship indices;case-based retrieval;mutually distinct indices;similar case retrieval;auto-fuzzy thesaurus;decision making support system;corresponding indices;cross-fuzzy thesaurus"}
{"name": "train_1258", "title": "Implementation and performance evaluation of a FIFO queue class library for", "abstract": "time warp The authors describe the implementation, use, and performance evaluation of a FIFO queue class library by means of a high-performance, easy-to-use interface employed for queuing simulations in parallel discrete simulations based on the time warp method. Various general-purpose simulation libraries and languages have been proposed, and among these some have the advantage of not requiring users to define anything other than the state vector, and not needing awareness of rollback under a platform which performs state control based on copies. However, because the state vectors must be defined as simple data structures without pointers, dynamic data structures such as a FIFO queue cannot be handled directly. Under the proposed class library, both the platform and the user can handle such structures in the same fashion that embedded data structures are handled. In addition, instead of all stored data, just the operational history can be stored and recovered efficiently at an effectively minimal cost by taking advantage of the first-in-first-out characteristics of the above data structures. When the kernel deletes past state histories during a simulation, garbage collection is also performed transparently using the corresponding method", "fulltext": "", "keywords": "object oriented method;embedded data structures;general-purpose simulation libraries;fifo queue;simulation languages;state management;operational history;performance evaluation;first-in-first-out characteristics;state vectors;time warp simulation;queuing simulations;dynamic data structures;garbage collection;easy-to-use interface;class library;parallel discrete simulations"}
{"name": "train_1259", "title": "A mechanism for inferring approximate solutions under incomplete knowledge", "abstract": "based on rule similarity This paper proposes an inference method which can obtain an approximate solution even if the knowledge stored in the problem-solving system is incomplete. When a rule needed for solving the problem does not exist, the problem can be solved by using rules similar to the existing rules. In an implementation using the SLD procedure, a resolution is executed between a subgoal and a rule if an atom of the subgoal is similar to the consequence atom of the rule. Similarities between atoms are calculated using a knowledge base of words with account of the reasoning situation, and the reliability of the derived solution is calculated based on these similarities. If many solutions are obtained, they are grouped into classes of similar solutions and a representative solution is then selected for each class. The proposed method was verified experimentally by solving simple problems", "fulltext": "", "keywords": "word knowledge base;problem solving;inference method;subgoal atom;reliability;sld procedure;reasoning;consequence atom;rule similarity;incomplete knowledge;representative solution;approximate solution;common sense knowledge"}
{"name": "train_126", "title": "A new architecture for implementing pipelined FIR ADF based on classification", "abstract": "of coefficients In this paper, we propose a new method for implementing pipelined finite-impulse response (FIR) adaptive digital filter (ADF), with an aim of reducing the maximum delay of the filtering portion of conventional delayed least mean square (DLMS) pipelined ADF. We achieve a filtering section with a maximum delay of one by simplifying a pre-upsampled and a post-downsampled FIR filter using the concept of classification of coefficients. This reduction is independent of the order of the filter, which is an advantage when the order of the filter is very large, and as a result the method can also be applied to infinite impulse response (IIR) filters. Furthermore, when the proposed method is compared with the transpose ADF, which has a filtering section with zero delay, it is realized that it significantly reduces the maximum delay associated with updating the coefficients of FIR ADF. The effect of this is that, the proposed method exhibits a higher convergence speed in comparison to the transpose FIR ADF", "fulltext": "", "keywords": "pre-upsampled filter;pipelined fir adf;coefficient classification;adaptive digital filter;convergence speed;post-downsampled filter;maximum delay;delayed least mean square filter"}
{"name": "train_1260", "title": "A dataflow computer which accelerates execution of sequential programs by", "abstract": "precedent firing instructions In the dataflow machine, it is important to avoid degradation of performance in sequential processing, and it is important from the viewpoint of hardware scale to reduce the number of waiting operands. This paper demonstrates that processing performance is degraded by sequential processing in the switching process, and presents a method of remedy. Precedent firing control is proposed as a means of remedy, and it is shown by a simulation that the execution time and the total number of waiting operands can be reduced by the precedent firing control. Then the hardware scale is examined as an evaluation of precedent firing control", "fulltext": "", "keywords": "hardware scale;processing performance;execution time;execution acceleration;precedent firing control;precedent firing instructions;sequential programs;computer architecture;switching process;waiting operands;parallel processing;dataflow computer"}
{"name": "train_1261", "title": "Topology-adaptive modeling of objects using surface evolutions based on 3D", "abstract": "mathematical morphology Level set methods were proposed mainly by mathematicians for constructing a model of a 3D object of arbitrary topology. However, those methods are computationally inefficient due to repeated distance transformations and increased dimensions. In the paper, we propose a new method of modeling fast objects of arbitrary topology by using a surface evolution approach based on mathematical morphology. Given sensor data covering the whole object surface, the method begins with an initial approximation of the object by evolving a closed surface into a model topologically equivalent to the real object. The refined approximation is then performed using energy minimization. The method has been applied in several experiments using range data, and the results are reported in the paper", "fulltext": "", "keywords": "energy minimization;arbitrary topology;surface evolutions;topology-adaptive modeling;initial approximation;3d mathematical morphology;repeated distance transformations;level set methods;3d object;pseudo curvature flow;refined approximation;range data"}
{"name": "train_1262", "title": "The development and evaluation of SHOKE2000: the PCI-based FPGA card", "abstract": "This paper describes a PCI-based FPGA card, SHOKE2000, which was developed in order to study reconfigurable computing. Since the latest field programmable gate arrays (FPGA) consist of input/output (I/O) configurable blocks as well as internal configurable logic blocks, they not only realize various user logic circuits but also connect with popular I/O standards easily. These features enable FPGA to connect several devices with different interfaces, and thus new reconfigurable systems would be realizable by connecting the FPGA with devices such as digital signal processors (DSP) and analog devices. This paper describes the basic functions of SHOKE2000, which was developed for realizing hybrid reconfigurable systems consisting of FPGA, DSP, and analog devices. We also present application examples of SHOKE2000, including a simple image recognition application, a distributed shared memory computer cluster, and teaching materials for computer education", "fulltext": "", "keywords": "user logic circuits;computer education;image recognition application;interfaces;dsp;i/o standard;pci;analog devices;reconfigurable computing;fpga;digital signal processors;fpga card;teaching materials;intellectual property;hybrid reconfigurable systems;shoke2000;field programmable gate arrays;distributed shared memory computer cluster"}
{"name": "train_1263", "title": "Super high definition image (WHD: Wide/Double HD) transmission system", "abstract": "This paper describes a WHD image transmission system constructed from a display projector, CODECs, and a camera system imaging a super high definition image (WHD: Wide/Double HD) corresponding to two screen portions of common high-vision images. This system was developed as a transmission system to communicate with or transmit information giving a reality-enhanced feeling to a remote location by using images of super high definition. In addition, the correction processing for the distortions of images occurring due to the structure of the camera system, an outline of the transmission experiments using the proposed system, and subjective evaluation experiments using WHD images are presented", "fulltext": "", "keywords": "codecs;whd image transmission system;camera system imaging;reality-enhanced feeling;super high definition image transmission system"}
{"name": "train_1264", "title": "Estimation of the vanishing point for automatic driving system using a cross", "abstract": "ratio This paper proposes a new method to estimate the vanishing point used as the vehicle heading, which is essential in automatic driving systems. The proposed method uses a cross ratio comprised of a ratio of lengths from four collinear points for extracting the edges that shape the vanishing point. Then, lines that intersect at one point are fitted to the edges in a Hough space. Consequently, the vanishing point is estimated robustly even when the lane markings are occluded by other vehicles. In the presence of lane markings, the road boundaries are also estimated at the same time. Experimental results from images of a real road scene show the effectiveness of the proposed method", "fulltext": "", "keywords": "automatic driving system;automatic driving systems;hough space;lane markings;vanishing point estimation;collinear points;cross ratio;real road scene"}
{"name": "train_1265", "title": "Optimization of requantization parameter for MPEG transcoding", "abstract": "This paper considers transcoding in which an MPEG stream is converted to a low-bit-rate MPEG stream, and proposes a method in which the transcoding error can be reduced by optimally selecting the quantization parameter for each macroblock. In transcoding with a low compression ratio, it is crucial to prohibit transcoding with a requantization parameter which is 1 to 2 times the quantization parameter of the input stream. Consequently, as the first step, an optimization method for the requantization parameter is proposed which cares for the error propagation effect by interframe prediction. Then, the proposed optimization method is extended so that the method can also be applied to the case of a high compression ratio in which the rate-distortion curve is approximated for each macroblock in the range of requantization parameters larger than 2 times the quantization parameter. It is verified by a simulation experiment that the PSNR is improved by 0.5 to 0.8 dB compared to the case in which a 6 Mbit/s MPEG stream is not optimized by twofold recompression", "fulltext": "", "keywords": "twofold recompression;requantization parameter optimization;low-bit-rate mpeg stream;error propagation effect;macroblock;rate conversion;simulation;rate control;transcoding error;psnr;6 mbit/s;interframe prediction;compression ratio;rate-distortion curve"}
{"name": "train_1266", "title": "An intelligent information gathering method for dynamic information mediators", "abstract": "The Internet is spreading into our society rapidly and is becoming one of the information infrastructures that are indispensable for our daily life. In particular, the WWW is widely used for various purposes such as sharing personal information, academic research, business work, and electronic commerce, and the amount of available information is increasing rapidly. We usually utilize information sources on the Internet as individual stand-alone sources, but if we can integrate them, we can add more value to each of them. Hence, information mediators, which integrate information distributed on the Internet, are drawing attention. In this paper, under the assumption that the information sources to be integrated are updated frequently and asynchronously, we propose an information gathering method that constructs an answer to a query from a user, accessing information sources to be integrated properly within an allowable time period. The proposed method considers the reliability of data in the cache and the quality of answer in order to efficiently access information sources and to provide appropriate answers to the user. As evaluation, we show the effectiveness of the proposed method by using an artificial information integration problem, in which some parameters can be modified, and a real-world flight information service compared with a conventional FIFO information gathering method", "fulltext": "", "keywords": "internet;electronic commerce;academic research;business work;dynamic information mediators;real-world flight information service;information infrastructures;artificial information integration problem;intelligent information gathering method;www"}
{"name": "train_1267", "title": "3D reconstruction from uncalibrated-camera optical flow and its reliability", "abstract": "evaluation We present a scheme for reconstructing a 3D structure from optical flow observed by a camera with an unknown focal length in a statistically optimal way as well as evaluating the reliability of the computed shape. First, the flow fundamental matrices are optimally computed from the observed flow. They are then decomposed into the focal length, its rate of change, and the motion parameters. Next, the flow is optimally corrected so that it satisfies the epipolar equation exactly. Finally, the 3D positions are computed, and their covariance matrices are evaluated. By simulations and real-image experiments, we test the performance of our system and observe how the normalization (gauge) for removing indeterminacy affects the description of uncertainty", "fulltext": "", "keywords": "covariance matrices;3d reconstruction;real-image experiments;epipolar equation;reliability evaluation;normalization;flow fundamental matrices;motion parameters;uncalibrated-camera optical flow"}
{"name": "train_1268", "title": "Reachability in contextual nets", "abstract": "Contextual nets, or Petri nets with read arcs, are models of concurrent systems with context dependent actions. The problem of reachability in such nets consists in finding a sequence of transitions that leads from the initial marking of a given contextual net to a given goal marking. The solution to this problem that is presented in this paper consists in constructing a finite complete prefix of the unfolding of the given contextual net, that is a finite prefix in which all the markings that are reachable from the initial marking are present, and in searching in each branch of this prefix for the goal marking by solving an appropriate linear programming problem", "fulltext": "", "keywords": "linear programming;concurrent systems;contextual nets reachability;finite prefix;context dependent actions;goal marking;petri nets"}
{"name": "train_1269", "title": "Minimizing the number of successor states in the stubborn set method", "abstract": "Combinatorial explosion which occurs in parallel compositions of LTSs can be alleviated by letting the stubborn set method construct on-the-fly a reduced LTS that is CFFD- or CSP-equivalent to the actual parallel composition. This article considers the problem of minimizing the number of successor states of a given state in the reduced LTS. The problem can be solved by constructing an and/or-graph with weighted vertices and by finding a set of vertices that satisfies a certain constraint such that no set of vertices satisfying the constraint has a smaller sum of weights. Without weights, the and/or-graph can be constructed in low-degree polynomial time w.r.t. the length of the input of the problem. However, since actions can be nondeterministic and transitions can share target states, it is not known whether the weights are generally computable in polynomial time. Consequently, it is an open problem whether minimizing the number of successor states is as \"easy\" as minimizing the number of successor transitions", "fulltext": "", "keywords": "combinatorial explosion;weighted vertices;csp-equivalence;stubborn set method;low-degree polynomial time"}
{"name": "train_127", "title": "Asymptotical stability in discrete-time neural networks", "abstract": "In this work, we present a proof of the existence of a fixed point and a generalized sufficient condition that guarantees the stability of it in discrete-time neural networks by using the Lyapunov function method. We also show that for both symmetric and asymmetric connections, the unique attractor is a fixed point when several conditions are satisfied. This is an extended result of Chen and Aihara (see Physica D, vol. 104, no. 3/4, p. 286-325, 1997). In particular, we further study the stability of equilibrium in discrete-time neural networks with the connection weight matrix in form of an interval matrix. Finally, several examples are shown to illustrate and reinforce our theory", "fulltext": "", "keywords": "connection weight matrix;unique attractor;symmetric connections;asymptotical stability;discrete-time neural networks;lyapunov function method;equilibrium stability;fixed point;asymmetric connections;interval matrix;generalized sufficient condition;stability"}
{"name": "train_1270", "title": "A comparison of different decision algorithms used in volumetric storm cells", "abstract": "classification Decision algorithms useful in classifying meteorological volumetric radar data are discussed. Such data come from the radar decision support system (RDSS) database of Environment Canada and concern summer storms created in this country. Some research groups used the data completed by RDSS for verifying the utility of chosen methods in volumetric storm cells classification. The paper consists of a review of experiments that were made on the data from RDSS database of Environment Canada and presents the quality of particular classifiers. The classification accuracy coefficient is used to express the quality. For five research groups that led their experiments in a similar way it was possible to compare received outputs. Experiments showed that the support vector machine (SVM) method and rough set algorithms which use object oriented reducts for rule generation to classify volumetric storm data perform better than other classifiers", "fulltext": "", "keywords": "support vector machine;rough set algorithms;meteorological volumetric radar data;decision algorithms;summer storms;radar decision support system;object oriented reducts;volumetric storm cells classification;classification accuracy"}
{"name": "train_1271", "title": "Verification of non-functional properties of a composable architecture with", "abstract": "Petri nets In this paper, we introduce our concept of composability and present the MSS architecture as an example for a composable architecture. MSS claims to be composable with respect to timing properties. We discuss, how to model and prove properties in such an architecture with time-extended Petrinets. As a result, the first step of a proof of composability is presented as well as a new kind of Petri net, which is more suitable for modeling architectures like MSS", "fulltext": "", "keywords": "composable architecture;mss architecture;timing properties;petri nets;non-functional properties verification;proof of composability"}
{"name": "train_1272", "title": "Global action rules in distributed knowledge systems", "abstract": "Previously Z. Ras and J.M. Zytkow (2000) introduced and investigated query answering system based on distributed knowledge mining. The notion of an action rule was introduced by Z. Ras and A. Wieczorkowska (2000) and its application domain e-business was taken. In this paper, we generalize the notion of action rules in a similar way to handling global queries. Mainly, when values of attributes for a given customer, used in action rules, can not be easily changed by business user, definitions of these attributes are extracted from other sites of a distributed knowledge system. To be more precise, attributes at every site of a distributed knowledge system are divided into two sets: stable and flexible. Values of flexible attributes, for a given consumer, sometime can be changed and this change can be influenced and controlled by a business user. However, some of these changes (for instance to the attribute \"profit') can not be done directly to a chosen attribute. In this case, definitions of such an attribute in terms of other attributes have to be learned. These new definitions are used to construct action rules showing what changes in values of flexible attributes, for a given consumer, are needed in order to re-classify this consumer the way business user wants. But, business user may be either unable or unwilling to proceed with actions leading to such changes. In all such cases we may search for definitions of these flexible attributes looking at either local or remote sites for help", "fulltext": "", "keywords": "distributed knowledge mining;query answering system;attributes;global action rules;e-commerce;action rules"}
{"name": "train_1273", "title": "Towards an ontology of approximate reason", "abstract": "This article introduces structural aspects in an ontology of approximate reason. The basic assumption in this ontology is that approximate reason is a capability of an agent. Agents are designed to classify information granules derived from sensors that respond to stimuli in the environment of an agent or received from other agents. Classification of information granules is carried out in the context of parameterized approximation spaces and a calculus of granules. Judgment in agents is a faculty of thinking about (classifying) the particular relative to decision rules derived from data. Judgment in agents is reflective, but not in the classical philosophical sense (e.g., the notion of judgment in Kant). In an agent, a reflective judgment itself is an assertion that a particular decision rule derived from data is applicable to an object (input). That is, a reflective judgment by an agent is an assertion that a particular vector of attribute (sensor) values matches to some degree the conditions for a particular rule. In effect, this form of judgment is an assertion that a vector of sensor values reflects a known property of data expressed by a decision rule. Since the reasoning underlying a reflective judgment is inductive and surjective (not based on a priori conditions or universals), this form of judgment is reflective, but not in the sense of Kant. Unlike Kant, a reflective judgment is surjective in the sense that it maps experimental attribute values onto the most closely matching descriptors (conditions) in a derived rule. Again, unlike Kant's notion of judgment, a reflective judgment is not the result of searching for a universal that pertains to a particular set of values of descriptors. Rather, a reflective judgment by an agent is a form of recognition that a particular vector of sensor values pertains to a particular rule in some degree. This recognition takes the form of an assertion that a particular descriptor vector is associated with a particular decision rule. These considerations can be repeated for other forms of classifiers besides those defined by decision rules", "fulltext": "", "keywords": "reflective judgment;ontology;granules;parameterized approximation spaces;approximate reason;decision rules;pattern recognition;rough sets;information granules"}
{"name": "train_1274", "title": "Bounded model checking for the universal fragment of CTL", "abstract": "Bounded Model Checking (BMC) has been recently introduced as an efficient verification method for reactive systems. BMC based on SAT methods consists in searching for a counterexample of a particular length and generating a propositional formula that is satisfiable iff such a counterexample-exists. This new technique has been introduced by E. Clarke et al. for model checking of linear time temporal logic (LTL). Our paper shows how the concept of bounded model checking can be extended to ACTL (the universal fragment of CTL). The implementation of the algorithm for Elementary Net Systems is described together with the experimental results", "fulltext": "", "keywords": "reactive systems;verification method;universal fragment;linear time temporal logic;bounded semantics;sat methods;bounded model checking;model checking;elementary net systems;propositional formula"}
{"name": "train_1275", "title": "Modeling dynamic objects in distributed systems with nested Petri nets", "abstract": "Nested Petri nets (NP-nets) is a Petri net extension, allowing tokens in a net marking to be represented by marked nets themselves. The paper discusses applicability of NP-nets for modeling task planning systems, multi-agent systems and recursive-parallel systems. A comparison of NP-nets with some other formalisms, such as OPNs of R. Valk (2000), recursive parallel programs of O. Kushnarenko and Ph. Schnoebelen (1997) and process algebras is given. Some aspects of decidability for object-oriented Petri net extensions are also discussed", "fulltext": "", "keywords": "nested petri nets;object-oriented petri net;recursive-parallel systems;multi-agent systems;decidability;process algebras;distributed systems;dynamic objects modelling"}
{"name": "train_1276", "title": "A comparative study of some generalized rough approximations", "abstract": "In this paper we focus upon a comparison of some generalized rough approximations of sets, where the classical indiscernibility relation is generalized to any binary reflexive relation. We aim at finding the best of several candidates for generalized rough approximation mappings, where both definability of sets by elementary granules of information as well as the issue of distinction among positive, negative, and border regions of a set are taken into account", "fulltext": "", "keywords": "generalized rough approximations;binary reflexive relation;classical indiscernibility relation;generalized rough approximation mappings;elementary granules"}
{"name": "train_1277", "title": "Dynamic modification of object Petri nets. An application to modelling", "abstract": "protocols with fork-join structures In this paper we discuss possibilities of modelling protocols by objects in object-based high-level Petri nets. Some advantages of dynamically modifying the structure of token objects are discussed and the need for further investigations into mathematically rigorous foundations of object net formalisms incorporating facilities for such operations on its token nets is emphasised", "fulltext": "", "keywords": "object petri nets;fork-join structures;dynamic modification;object net formalisms;token objects;mathematically rigorous foundations;protocols"}
{"name": "train_1278", "title": "Verification of timed automata based on similarity", "abstract": "The paper presents a modification of the standard partitioning technique to generate abstract state spaces preserving similarity for Timed Automata. Since this relation is weaker than bisimilarity, most of the obtained models (state spaces) are smaller than bisimilar ones, but still preserve the universal fragments of branching time temporal logics. The theoretical results are exemplified for strong, delay, and observational simulation relations", "fulltext": "", "keywords": "timed automata verification;branching time temporal logics;universal fragments;partitioning technique;bisimilarity;observational simulation relations;abstract state spaces"}
{"name": "train_1279", "title": "Place/Transition Petri net evolutions: recording ways, analysis and synthesis", "abstract": "Four semantic domains for Place/Transition Petri nets and their relationships are considered. They are monoids of respectively: firing sequences, processes, traces and dependence graphs. For each of them the analysis and synthesis problem is stated and solved. The monoid of processes is defined in a non-standard way, Nets under consideration involve weights of arrows and capacities (finite or infinite) of places. However, the analysis and synthesis tasks require nets to be pure, i.e. each of their transition must have the pre-set and post-set disjoint", "fulltext": "", "keywords": "monoids;post-set disjoint;firing sequences;semantic domains;dependence graphs;pre-set disjoint;place/transition petri net evolutions"}
{"name": "train_128", "title": "A new result on the global convergence of Hopfield neural networks", "abstract": "In this work, we discuss Hopfield neural networks, investigating their global stability. Some sufficient conditions for a class of Hopfield neural networks to be globally stable and globally exponentially stable are given", "fulltext": "", "keywords": "sufficient conditions;hopfield neural networks;global stability;globally exponentially stable networks"}
{"name": "train_1280", "title": "Products and polymorphic subtypes", "abstract": "This paper is devoted to a comprehensive study of polymorphic subtypes with products. We first present a sound and complete Hilbert style axiomatization of the relation of being a subtype in presence of to , * type constructors and the For all quantifier, and we show that such axiornatization is not encodable in the system with to , For all only. In order to give a logical semantics to such a subtyping relation, we propose a new form of a sequent which plays a key role in a natural deduction and a Gentzen style calculi. Interestingly enough, the sequent must have the form E implies T, where E is a non-commutative, non-empty sequence of typing assumptions and T is a finite binary tree of typing judgements, each of them behaving like a pushdown store. We study basic metamathematical properties of the two logical systems, such as subject reduction and cut elimination. Some decidability/undecidability issues related to the presented subtyping relation are also explored: as expected, the subtyping over to , *, For all is undecidable, being already undecidable for the to , For all fragment (as proved in [15]), but for the *, For all fragment it turns out to be decidable", "fulltext": "", "keywords": "gentzen style calculi;finite binary tree;decidability;polymorphic subtypes;metamathernatical properties;hilbert style axiomatization;pushdown store;products subtypes;logical semantics"}
{"name": "train_1281", "title": "A notion of non-interference for timed automata", "abstract": "The non-interference property of concurrent systems is a security property concerning the flow of information among different levels of security of the system. In this paper we introduce a notion of timed non-interference for real-time systems specified by timed automata. The notion is presented using an automata based approach and then it is characterized also by operations and equivalence between timed languages. The definition is applied to an example of a time-critical system modeling a simplified control of an airplane", "fulltext": "", "keywords": "concurrent systems;timed automata;real-time systems;time-critical system;security property;noninterference notion"}
{"name": "train_1282", "title": "Completeness of timed mu CRL", "abstract": "Previously a straightforward extension of the process algebra mu CRL was proposed to explicitly deal with time. The process algebra mu CRL has been especially designed to deal with data in a process algebraic context. Using the features for data, only a minor extension of the language was needed to obtain a very expressive variant of time. Previously it contained syntax, operational semantics and axioms characterising timed mu CRL. It did not contain an in depth analysis of theory of timed mu CRL. This paper fills this gap, by providing soundness and completeness results. The main tool to establish these is a mapping of timed to untimed mu CRL and employing the completeness results obtained for untimed mu CRL", "fulltext": "", "keywords": "timed mu crl;operational semantics;completeness;process algebra"}
{"name": "train_1283", "title": "UPSILON: universal programming system with incomplete lazy object notation", "abstract": "This paper presents a new model of computation that differs from prior models in that it emphasizes data over flow control, has no named variables and has an object-oriented flavor. We prove that this model is a complete and confluent acceptable programming system and has a usable type theory. A new data synchronization primitive is introduced in order to achieve the above properties. Subtle variations of the model are shown to fall short of having all these necessary properties", "fulltext": "", "keywords": "universal programming system;incomplete lazy object notation;programming system;usable type theory;upsilon;data synchronization primitive;object-oriented flavor"}
{"name": "train_1284", "title": "A linear time special case for MC games", "abstract": "MC games are infinite duration two-player games played on graphs. Deciding the winner in MC games is equivalent to the the modal mu-calculus model checking. In this article we provide a linear time algorithm for a class of MC games. We show that, if all cycles in each strongly connected component of the game graph have at least one common vertex, the winner can be found in linear time. Our results hold also for parity games, which are equivalent to MC games", "fulltext": "", "keywords": "two-player games;linear time special case;linear time algorithm;mc games;modal mu-calculus model checking"}
{"name": "train_1285", "title": "On fractal dimension in information systems. Toward exact sets in infinite", "abstract": "information systems The notions of an exact as well as a rough set are well-grounded as basic notions in rough set theory. They are however defined in the setting of a finite information system i.e. an information system having finite numbers of objects as well as attributes. In theoretical studies e.g. of topological properties of rough sets, one has to trespass this limitation and to consider information systems with potentially unbound number of attributes. In such setting, the notions of rough and exact sets may be defined in terms of topological operators of interior and closure with respect to an appropriate topology following the ideas from the finite case, where it is noticed that in the finite case rough-set-theoretic operators of lower and upper approximation are identical with the interior, respectively, closure operators in topology induced by equivalence classes of the indiscernibility relation. Extensions of finite information systems are also desirable from application point of view in the area of knowledge discovery and data mining, when demands of e.g. mass collaboration and/or huge experimental data call for need of working with large data tables so the sound theoretical generalization of these cases is an information system with the number of attributes not bound in advance by a fixed integer i.e. an information system with countably but infinitely many attributes, In large information systems, a need arises for qualitative measures of complexity of concepts involved free of parameters, cf. e.g. applications for the Vapnik-Czervonenkis dimension. We study here in the theoretical setting of infinite information system a proposal to apply fractal dimensions suitably modified as measures of concept complexity", "fulltext": "", "keywords": "data mining;qualitative measures;rough set;closure operators;equivalence classes;complexity;knowledge discovery;topological properties;infinite information systems;information systems;exact sets;fractal dimension"}
{"name": "train_1286", "title": "Self-describing Turing machines", "abstract": "After a sketchy historical account on the question of self-describeness and self-reproduction, and after discussing the definition of suitable encodings for self-describeness, we give the construction of several self-describing Turing machines, namely self-describing machines with, respectively, 350, 267, 224 and 206 instructions", "fulltext": "", "keywords": "self-describing turing machines;self-reproduction;encodings;self-describeness"}
{"name": "train_1287", "title": "On average depth of decision trees implementing Boolean functions", "abstract": "The article considers the representation of Boolean functions in the form of decision trees. It presents the bounds on average time complexity of decision trees for all classes of Boolean functions that are closed over substitution, and the insertion and deletion of unessential variables. The obtained results are compared with the results developed by M.Ju. Moshkov (1995) that describe the worst case time complexity of decision trees", "fulltext": "", "keywords": "decision trees;worst case time complexity;average depth;boolean functions;average time complexity"}
{"name": "train_1288", "title": "A modal logic for indiscernibility and complementarity in information systems", "abstract": "In this paper, we study indiscernibility relations and complementarity relations in information systems, The first-order characterization of indiscernibility and complementarity is obtained through a duality result between information systems and certain structures of relational type characterized by first-order conditions. The modal analysis of indiscernibility and complementarity is performed through a modal logic which modalities correspond to indiscernibility relations and complementarity relations in information systems", "fulltext": "", "keywords": "modal logic;indiscernibility;duality result;complementarity;first-order characterization;first-order conditions;relational type;information systems"}
{"name": "train_1289", "title": "Combining PC control and HMI", "abstract": "Integrating PC-based control with human machine interface (HMI) technology can benefit a plant floor system. However, before one decides on PC-based control, there are many things one should consider, especially when using a soft programmable logic controller (PLC) to command the input/output. There are three strategies to integrate a PC-based control system with an HMI: treat the PC running the control application as if it were a PLC, integrate the system using standard PC interfaces; or using application programming interfaces", "fulltext": "", "keywords": "pc-based control system;application programming interfaces;pc interfaces;shop floor system;programmable logic controller;human machine interface"}
{"name": "train_129", "title": "Phase conditions for Schur polynomials", "abstract": "The rate of change of phase of a real or complex Schur polynomial, evaluated along the unit circle traversed counterclockwise, is strictly positive. For polynomials with real coefficients, this bound can be tightened. These and some other fundamental bounds on the rate of change of phase are derived here, using the Tchebyshev representation of the image of a real polynomial evaluated on the unit circle", "fulltext": "", "keywords": "phase monotonicity;discrete-time control systems;tchebyshev representation;stabilization;phase conditions;robust stability;rate of change of phase;schur polynomial;real coefficients"}
{"name": "train_1290", "title": "Making the MIS integration process work", "abstract": "Focused, cross-functional teams that implement flexible and scalable information systems (IS) can deliver a smooth, lean manufacturing process. When integrating new technology into an existing facility, one should always consider three things: the hard infrastructure, the soft infrastructure, and information flow. Hard infrastructure includes client and server hardware and network infrastructure. Soft infrastructure includes operating systems, existing or legacy software, needed code customizations, and the human resources to run/support the system. Information flow includes how data in the new system interacts with legacy systems and what legacy data the new system will require, as well as who will want to receive/access the information that is held by the system", "fulltext": "", "keywords": "legacy software;scalable information systems;network infrastructure;human resources;client server hardware;information flow;lean manufacturing process;management information systems"}
{"name": "train_1291", "title": "Taking back control [SCADA system]", "abstract": "Most common way to implement a SCADA system is to go outside. However, in the author's opinion, to truly take control of a SCADA project, in-house personnel should handle as much of the job as possible. This includes design, equipment specification, installation, and programming. The more of these tasks one does in-house, the more control and ownership one has. To accomplish this, we first evaluated the existing SCADA system and investigated new technologies to establish a list of features the new system needed to incorporate", "fulltext": "", "keywords": "compatibility;data acquisition;scada;in-house integration;programmable logic controllers;supervisory control"}
{"name": "train_1292", "title": "The heat is on [building automation systems]", "abstract": "Integrating building automation systems (BASs) can result in systems that have the ability to sense changes in the air temperature through a building's heating, ventilation, and air conditioning (HVAC) systems. Taking advantages of the Internet, using remote monitoring, and building interoperability through open protocol systems are some of the issues discussed throughout the BAS/HVAC community. By putting information over the Internet, facility managers get real-time data on energy usage and performance issues", "fulltext": "", "keywords": "internet;interoperability;hvac;remote monitoring;real-time data;building automation systems;heating;ventilation;air conditioning"}
{"name": "train_1293", "title": "Truss topology optimization by a modified genetic algorithm", "abstract": "This paper describes the use of a stochastic search procedure based on genetic algorithms for developing near-optimal topologies of load-bearing truss structures. Most existing cases these publications express the truss topology as a combination of members. These methods, however, have the disadvantage that the resulting topology may include needless members or those which overlap other members. In addition to these problems, the generated structures are not necessarily structurally stable. A new method, which resolves these problems by expressing the truss topology as a combination of triangles, is proposed in this paper. Details of the proposed methodology are presented as well as the results of numerical examples that clearly show the effectiveness and efficiency of the method", "fulltext": "", "keywords": "load-bearing truss structures;stochastic search procedure;near-optimal topologies;modified genetic algorithm;triangles;truss topology optimization"}
{"name": "train_1294", "title": "Multicriterion optimization of composite laminates for maximum failure margins", "abstract": "with an interactive descent algorithm An interactive multicriterion optimization method for composite laminates subjected to multiple loading conditions is introduced. Laminate margins to initial failure (first ply failure, FPF) with respect of the applied loading conditions are treated as criteria. The original problem is reduced to a, bicriterion problem by introducing parameters to combine criteria in a linear manner. The problem is solved by using an interactive descent algorithm. Both the conditions required for a discrete procedure to converge towards a Pareto optimum and numerical examples are given", "fulltext": "", "keywords": "interactive descent algorithm;first ply failure;composite laminates;interactive multicriterion optimization;multiple loading conditions;convergence;pareto optimum;maximum failure margins;discrete procedure;bicriterion problem"}
{"name": "train_1295", "title": "Development of visual design steering as an aid in large-scale", "abstract": "multidisciplinary design optimization. II. Method validation For pt. I see ibid., pp. 412-24. Graph morphing, the first concept developed under the newly proposed paradigm of visual design steering (VDS), is applied to optimal design problems. Graph morphing, described in Part I of this paper, can be used to provide insights to a designer to improve efficiency, reliability, and accuracy of an optimal design in less cycle time. It is demonstrated in this part of the paper that graph morphing can be used to provide insights into design variable impact, constraint redundancy, reasonable values for constraint allowable limits, and function smoothness, that otherwise might not be attainable", "fulltext": "", "keywords": "function smoothness;visual design steering;reliability;design variable impact;optimal design problems;large-scale multidisciplinary design optimization;accuracy;graph morphing;constraint redundancy;constraint allowable limits;method validation;cycle time"}
{"name": "train_1296", "title": "Development of visual design steering as an aid in large-scale", "abstract": "multidisciplinary design optimization. I. Method development A modified paradigm of computational steering (CS), termed visual design steering (VDS), is developed in this paper. The VDS paradigm is applied to optimal design problems to provide a means for capturing and enabling designer insights. VDS allows a designer to make decisions before, during or after an analysis or optimization via a visual environment, in order to effectively steer the solution process. The objective of VDS is to obtain a better solution in less time through the use of designer knowledge and expertise. Using visual representations of complex systems in this manner enables human experience and judgement to be incorporated into the optimal design process at appropriate steps, rather than having traditional black box solvers return solutions from a prescribed input set. Part I of this paper focuses on the research issues pertaining to the Graph Morphing visualization method created to represent an n-dimensional optimization problem using 2-dimensional and 3-dimensional visualizations. Part II investigates the implementation of the VDS paradigm, using the graph morphing approach, to improve an optimal design process. Specifically, the following issues are addressed: impact of design variable changes on the optimal design space; identification of possible constraint redundancies; impact of constraint tolerances on the optimal solution: and smoothness of the objective function contours. It is demonstrated that graph morphing can effectively reduce the complexity and computational time associated with some optimization problems", "fulltext": "", "keywords": "graph morphing visualization method;visual design steering;n-dimensional optimization;visual representations;design variable changes;3d visualizations;complexity;complex systems;constraint redundancies;optimal design problems;2d visualizations;objective function contour smoothness;large-scale multidisciplinary design optimization;computational time;designer decision making;constraint tolerances;computational steering"}
{"name": "train_1297", "title": "Stochastic optimization of acoustic response - a numerical and experimental", "abstract": "comparison The objective of the work presented is to compare results from numerical optimization with experimental data and to highlight and discuss the differences between two fundamentally different optimization methods. The problem domain is minimization of acoustic emission and the structure used in the work is a closed cylinder with forced vibration of one end. The optimization method used in this paper is simulated annealing (SA), a stochastic method. The results are compared with those from a gradient-based method used on the same structure in an earlier paper (Tinnsten, 2000)", "fulltext": "", "keywords": "simulated annealing;forced vibration;gradient-based method;acoustic response;numerical optimization;acoustic emission minimization;closed cylinder;structure;stochastic optimization"}
{"name": "train_1298", "title": "An analytical model for a composite adaptive rectangular structure using the", "abstract": "Heaviside function The objective of this article is to describe a mathematical model, based on the Heaviside function and on the delta -Dirac distribution, for a composite adaptive rectangular structure with embedded and/or bonded piezoelectric actuators and sensors. In the adopted structure model, the laminae are made up a configuration of rectangular nonpiezoelectric and piezoelectric patches. The laminae do not all have the same area nor do they present the same configuration, such that there are points where there is no material. The equations of motion and the boundary conditions, which describe the electromechanical coupling, are based on the Mindlin displacement field, on the linear theory of piezoelectricity, and on the Hamilton principle", "fulltext": "", "keywords": "hamilton principle;virtual kinetic energy;delta-dirac distribution;electromechanical coupling;embedded actuators;heaviside function;mindlin displacement field;linear piezoelectricity;constitutive relations;closed-form solution;piezoelectric sensors;lagrangian functions;equations of motion;rectangular composite plate;piezoelectric actuators;finite-element method;mathematical model;bonded sensors;embedded sensors;bonded actuators;piezoelectric patches;composite adaptive rectangular structure;boundary conditions;nonpiezoelectric patches"}
{"name": "train_1299", "title": "How much should publishers spend on technology?", "abstract": "A study confirms that spending on publishing-specific information technology (IT) resources is growing much faster than IT spending for general business activities, at least among leading publishers in the scientific, technical and medical (STM) market. The survey asked about information technology funding and staffing levels-past, present and future-and also inquired about activities in content management, Web delivery, computer support and customer relationship management. The results provide a starting point for measuring information technology growth and budget allocations in this publishing segment", "fulltext": "", "keywords": "content management;customer relationship management;budget;publishing;computer support;web delivery;it spending"}
{"name": "train_13", "title": "Stability analysis of the characteristic polynomials whose coefficients are", "abstract": "polynomials of interval parameters using monotonicity We analyze the stability of the characteristic polynomials whose coefficients are polynomials of interval parameters via monotonicity methods. Our stability conditions are based on Frazer-Duncan's theorem and all conditions can be checked using only endpoint values of interval parameters. These stability conditions are necessary and sufficient under the monotonicity assumptions. When the monotonicity conditions do not hold on the whole parameter region, we present an interval division method and a transformation algorithm in order to apply the monotonicity conditions. Then, our stability analysis methods can be applied to all characteristic polynomials whose coefficients are polynomials of interval parameters", "fulltext": "", "keywords": "necessary and sufficient conditions;interval division method;monotonicity;interval parameters;transformation algorithm;characteristic polynomials;frazer-duncan theorem;stability analysis;endpoint values"}
{"name": "train_130", "title": "Resolution of a current-mode algorithmic analog-to-digital converter", "abstract": "Errors limiting the resolution of current-mode algorithmic analog-to-digital converters are mainly related to current mirror operation. While systematic errors can be minimized by proper circuit techniques, random sources are unavoidable. In this paper a statistical analysis of the resolution of a typical converter is carried out taking into account process tolerances. To support the analysis, a 4-bit ADC, realized in a 0.35- mu m CMOS technology, was exhaustively simulated. Results were found to be in excellent agreement with theoretical derivations", "fulltext": "", "keywords": "0.35 micron;cmos technology;a/d converters;resolution;algorithmic adc;error analysis;analog-to-digital converters;circuit analysis;4 bit;current-mode adc;statistical analysis;circuit techniques;tolerance analysis"}
{"name": "train_1300", "title": "Will CPXe save the photofinishing market?", "abstract": "A consortium of film suppliers and electronics firms has proposed the Common Picture Exchange environment. It will let diverse providers cooperate via the Internet to sell digital-photo prints", "fulltext": "", "keywords": "photofinishing market;kodak;web-services standards;fujifilm;common picture exchange environment;cpxe;hp"}
{"name": "train_1301", "title": "Integrate-and-fire neurons driven by correlated stochastic input", "abstract": "Neurons are sensitive to correlations among synaptic inputs. However, analytical models that explicitly include correlations are hard to solve analytically, so their influence on a neuron's response has been difficult to ascertain. To gain some intuition on this problem, we studied the firing times of two simple integrate-and-fire model neurons driven by a correlated binary variable that represents the total input current. Analytic expressions were obtained for the average firing rate and coefficient of variation (a measure of spike-train variability) as functions of the mean, variance, and correlation time of the stochastic input. The results of computer simulations were in excellent agreement with these expressions. In these models, an increase in correlation time in general produces an increase in both the average firing rate and the variability of the output spike trains. However, the magnitude of the changes depends differentially on the relative values of the input mean and variance: the increase in firing rate is higher when the variance is large relative to the mean, whereas the increase in variability is higher when the variance is relatively small. In addition, the firing rate always tends to a finite limit value as the correlation time increases toward infinity, whereas the coefficient of variation typically diverges. These results suggest that temporal correlations may play a major role in determining the variability as well as the intensity of neuronal spike trains", "fulltext": "", "keywords": "correlated binary variable;integrate-and-fire neurons;computer simulation;synaptic input correlations;coefficient of variation;spike-train variability;output spike trains;temporal correlations;firing times;correlated stochastic input"}
{"name": "train_1302", "title": "Dynamics of the firing probability of noisy integrate-and-fire neurons", "abstract": "Cortical neurons in vivo undergo a continuous bombardment due to synaptic activity, which acts as a major source of noise. We investigate the effects of the noise filtering by synapses with various levels of realism on integrate-and-fire neuron dynamics. The noise input is modeled by white (for instantaneous synapses) or colored (for synapses with a finite relaxation time) noise. Analytical results for the modulation of firing probability in response to an oscillatory input current are obtained by expanding a Fokker-Planck equation for small parameters of the problem-when both the amplitude of the modulation is small compared to the background firing rate and the synaptic time constant is small compared to the membrane time constant. We report the detailed calculations showing that if a synaptic decay time constant is included in the synaptic current model, the firing-rate modulation of the neuron due to an oscillatory input remains finite in the high-frequency limit with no phase lag. In addition, we characterize the low-frequency behavior and the behavior of the high-frequency limit for intermediate decay times. We also characterize the effects of introducing a rise time to the synaptic currents and the presence of several synaptic receptors with different kinetics. In both cases, we determine, using numerical simulations, an effective decay time constant that describes the neuronal response completely", "fulltext": "", "keywords": "colored noise;white noise;membrane time constant;noise filtering;numerical simulation;synaptic activity;firing probability;fokker-planck equation;synaptic time constant;phase lag;cortical neurons;noisy integrate-and-fire neurons;synaptic receptors"}
{"name": "train_1303", "title": "Reply to Carreira-Perpinan and Goodhill [mathematics in biology]", "abstract": "In a paper by Carreira-Perpinan and Goodhill (see ibid., vol.14, no.7, p.1545-60, 2002) the authors apply mathematical arguments to biology. Swindale et al. think it is inappropriate to apply the standards of proof required in mathematics to the acceptance or rejection of scientific hypotheses. To give some examples, showing that data are well described by a linear model does not rule out an infinity of other possible models that might give better descriptions of the data. Proving in a mathematical sense that the linear model was correct would require ruling out all other possible models, a hopeless task. Similarly, to demonstrate that two DNA samples come from the same individual, it is sufficient to show a match between only a few regions of the genome, even though there remains a very large number of additional comparisons that could be done, any one of which might potentially disprove the match. This is unacceptable in mathematics, but in the real world, it is a perfectly reasonable basis for belief", "fulltext": "", "keywords": "cortical maps;mathematical arguments;biology;dna;scientific hypotheses;genome;hypothesis testing;neural nets;linear model"}
{"name": "train_1304", "title": "Center-crossing recurrent neural networks for the evolution of rhythmic", "abstract": "behavior A center-crossing recurrent neural network is one in which the null(hyper)surfaces of each neuron intersect at their exact centers of symmetry, ensuring that each neuron's activation function is centered over the range of net inputs that it receives. We demonstrate that relative to a random initial population, seeding the initial population of an evolutionary search with center-crossing networks significantly improves both the frequency and the speed with which high-fitness oscillatory circuits evolve on a simple walking task. The improvement is especially striking at low mutation variances. Our results suggest that seeding with center-crossing networks may often be beneficial, since a wider range of dynamics is more likely to be easily accessible from a population of center-crossing networks than from a population of random networks", "fulltext": "", "keywords": "random initial population;random networks;center-crossing recurrent neural networks;evolutionary algorithm;activation function;high-fitness oscillatory circuits;learning;null surfaces;low mutation variance;rhythmic behavior evolution;evolutionary search;symmetry"}
{"name": "train_1305", "title": "Learning nonregular languages: a comparison of simple recurrent networks and", "abstract": "LSTM Rodriguez (2001) examined the learning ability of simple recurrent nets (SRNs) (Elman, 1990) on simple context-sensitive and context-free languages. In response to Rodriguez's (2001) article, we compare the performance of simple recurrent nets and long short-term memory recurrent nets on context-free and context-sensitive languages", "fulltext": "", "keywords": "context-free languages;performance;nonregular language learning;lstm;short-term memory recurrent nets;recurrent neural networks;context-sensitive languages"}
{"name": "train_1306", "title": "Scalable hybrid computation with spikes", "abstract": "We outline a hybrid analog-digital scheme for computing with three important features that enable it to scale to systems of large complexity: First, like digital computation, which uses several one-bit precise logical units to collectively compute a precise answer to a computation, the hybrid scheme uses several moderate-precision analog units to collectively compute a precise answer to a computation. Second, frequent discrete signal restoration of the analog information prevents analog noise and offset from degrading the computation. Third, a state machine enables complex computations to be created using a sequence of elementary computations. A natural choice for implementing this hybrid scheme is one based on spikes because spike-count codes are digital, while spike-time codes are analog. We illustrate how spikes afford easy ways to implement all three components of scalable hybrid computation. First, as an important example of distributed analog computation, we show how spikes can create a distributed modular representation of an analog number by implementing digital carry interactions between spiking analog neurons. Second, we show how signal restoration may be performed by recursive spike-count quantization of spike-time codes. Third, we use spikes from an analog dynamical system to trigger state transitions in a digital dynamical system, which reconfigures the analog dynamical system using a binary control vector; such feedback interactions between analog and digital dynamical systems create a hybrid state machine (HSM). The HSM extends and expands the concept of a digital finite-state-machine to the hybrid domain. We present experimental data from a two-neuron HSM on a chip that implements error-correcting analog-to-digital conversion with the concurrent use of spike-time and spike-count codes. We also present experimental data from silicon circuits that implement HSM-based pattern recognition using spike-time synchrony. We outline how HSMs may be used to perform learning, vector quantization, spike pattern recognition and generation, and how they may be reconfigured", "fulltext": "", "keywords": "frequent discrete signal restoration;spike-time codes;learning;distributed analog computation;digital carry interactions;feedback interactions;silicon circuits;spikes;finite-state-machine;hybrid analog-digital scheme;error-correcting analog-to-digital conversion;pattern recognition;scalable hybrid computation;analog noise;spike-count codes;vector quantization;two neuron hybrid state machine;binary control vector;moderate-precision analog units"}
{"name": "train_1307", "title": "Law librarians' survey: are academic law librarians in decline?", "abstract": "The author reports on the results of one extra element in the BIALL/SPTL survey, designed to acquire further information about academic law librarians. The survey has fulfilled the aim of providing a snapshot of the academic law library profession and has examined the concerns that have been raised. Perhaps most importantly, it has shown that more long-term work needs to be done to monitor the situation effectively. We hope that BIALL will take on this challenge and help to maintain the status of academic law librarians and aid them in their work", "fulltext": "", "keywords": "academic law librarians;biall/sptl;academic law library;survey"}
{"name": "train_1308", "title": "SPTL/BIALL academic law library survey 2000/2001", "abstract": "The paper outlines the activities and funding of academic law libraries in the UK and Ireland in the academic year 2000/2001. The figures have been taken from the results of a postal questionnaire undertaken by information services staff at Cardiff University on behalf of BIALL", "fulltext": "", "keywords": "funding;information services;uk;ireland;survey;sptl/biall;postal questionnaire;cardiff university;academic law libraries"}
{"name": "train_1309", "title": "Transcripts: bane or boon? [law reporting]", "abstract": "Because judge-made law, by its very nature, is less immediately accessible than the law of codified, statutory systems, it calls for an efficient system of law reporting. Of necessity, any such system will be selective, the majority of decisions going unreported. Considerable power thereby comes to repose in the hands of the law reporters. The author shares his invaluable perception and extensive research on the difficulties which arise from the excess of access to judgments", "fulltext": "", "keywords": "judge-made law;law reporting;transcripts;judgments"}
{"name": "train_131", "title": "On biorthogonal nonuniform filter banks and tree structures", "abstract": "This paper concerns biorthogonal nonuniform filter banks. It is shown that a tree structured filter bank is biorthogonal if it is equivalent to a tree structured filter bank whose matching constituent levels on the analysis and synthesis sides are themselves biorthogonal pairs. We then show that a stronger statement can be made about dyadic filter banks in general: That a dyadic filter bank is biorthogonal if both the analysis and synthesis banks can be decomposed into dyadic trees. We further show that these decompositions are stability and FIR preserving. These results, derived for filter banks having filters with rational transfer functions, thus extend some of the earlier comparable results for orthonormal filter banks", "fulltext": "", "keywords": "dyadic filter banks;rational transfer functions;stability preserving;fir preserving;tree structured filter bank;biorthogonal pairs;dyadic trees;biorthogonal nonuniform filter banks"}
{"name": "train_1310", "title": "Cat and class: what use are these skills to the new legal information", "abstract": "professional? This article looks at the cataloguing and classification skills taught on information studies courses and the use these skills are to new legal information professionals. The article is based on the opinions of nine new legal information professionals from both academic and law firm libraries", "fulltext": "", "keywords": "information studies courses;classification;legal information professional;law firm libraries;academic libraries;cataloguing"}
{"name": "train_1311", "title": "Blended implementation of block implicit methods for ODEs", "abstract": "In this paper we further develop a new approach for naturally defining the nonlinear splittings needed for the implementation of block implicit methods for ODEs, which has been considered by Brugnano [J. Comput. Appl. Math. 116 (2000) 41] and by Brugnano and Trigiante [in: Recent Trends in Numerical Analysis, Nova Science, New York, 2000, pp. 81-105]. The basic idea is that of defining the numerical method as the combination (blending) of two suitable component methods. By carefully choosing such methods, it is shown that very efficient implementations can be obtained. Moreover, some of them, characterized by a diagonal splitting, are well suited for parallel computers. Numerical tests comparing the performances of the proposed implementation with existing ones are also presented, in order to make evident the potential of the approach", "fulltext": "", "keywords": "blended implementation;odes;numerical tests;parallel computers;numerical method;nonlinear splittings;diagonal splitting;block implicit methods"}
{"name": "train_1312", "title": "Stability in the numerical solution of the heat equation with nonlocal boundary", "abstract": "conditions This paper deals with numerical methods for the solution of the heat equation with integral boundary conditions. Finite differences are used for the discretization in space. The matrices specifying the resulting semidiscrete problem are proved to satisfy a sectorial resolvent condition, uniformly with respect to the discretization parameter. Using this resolvent condition, unconditional stability is proved for the fully discrete numerical process generated by applying A( theta )-stable one-step methods to the semidiscrete problem. This stability result is established in the maximum norm; it improves some previous results in the literature in that it is not subject to various unnatural restrictions which were imposed on the boundary conditions and on the one-step methods", "fulltext": "", "keywords": "integral boundary conditions;fully discrete numerical process;maximum norm;matrices;numerical solution;one-step methods;sectorial resolvent condition;finite differences;semidiscrete problem;space discretization;stability;heat equation;nonlocal boundary conditions"}
{"name": "train_1313", "title": "A collocation formulation of multistep methods for variable step-size", "abstract": "extensions Multistep methods are classically constructed by specially designed difference operators on an equidistant time grid. To make them practically useful, they have to be implemented by varying the step-size according to some error-control algorithm. It is well known how to extend Adams and BDF formulas to a variable step-size formulation. In this paper we present a collocation approach to construct variable step-size formulas. We make use of piecewise polynomials to show that every k-step method of order k+1 has a variable step-size polynomial collocation formulation", "fulltext": "", "keywords": "variable step-size polynomial collocation formulation;equidistant time grid;multistep methods;collocation formulation;k-step method;error-control algorithm;variable step-size extensions;piecewise polynomials;difference operators"}
{"name": "train_1314", "title": "Multi-timescale Internet traffic engineering", "abstract": "The Internet is a collection of packet-based hop-by-hop routed networks. Internet traffic engineering is the process of allocating resources to meet the performance requirements of users and operators for their traffic. Current mechanisms for doing so, exemplified by TCP's congestion control or the variety of packet marking disciplines, concentrate on allocating resources on a per-packet basis or at data timescales. This article motivates the need for traffic engineering in the Internet at other timescales, namely control and management timescales, and presents three mechanisms for this. It also presents a scenario to show how these mechanisms increase the flexibility of operators' service offerings and potentially also ease problems of Internet management", "fulltext": "", "keywords": "packet-based hop-by-hop routed networks;multi-timescale internet traffic engineering;internet management;operator services;control timescale;bgp routing protocol;tcp congestion control;ecn proxy;admission control;resource allocation;packet marking disciplines"}
{"name": "train_1315", "title": "Traffic engineering with traditional IP routing protocols", "abstract": "Traffic engineering involves adapting the routing of traffic to network conditions, with the joint goals of good user performance and efficient use of network resources. We describe an approach to intradomain traffic engineering that works within the existing deployed base of interior gateway protocols, such as Open Shortest Path First and Intermediate System-Intermediate System. We explain how to adapt the configuration of link weights, based on a networkwide view of the traffic and topology within a domain. In addition, we summarize the results of several studies of techniques for optimizing OSPF/IS-IS weights to the prevailing traffic. The article argues that traditional shortest path routing protocols are surprisingly effective for engineering the flow of traffic in large IP networks", "fulltext": "", "keywords": "intradomain traffic engineering;traffic routing;shortest path routing protocols;network conditions;ip routing protocols;network topology;tcp;open shortest path first protocol;interior gateway protocols;ip networks;network resources;intermediate system-intermediate system protocol;transmission control protocol;user performance;link weights configuration;ospf/is-is weights"}
{"name": "train_1316", "title": "Understanding Internet traffic streams: dragonflies and tortoises", "abstract": "We present the concept of network traffic streams and the ways they aggregate into flows through Internet links. We describe a method of measuring the size and lifetime of Internet streams, and use this method to characterize traffic distributions at two different sites. We find that although most streams (about 45 percent of them) are dragonflies, lasting less than 2 seconds, a significant number of streams have lifetimes of hours to days, and can carry a high proportion (50-60 percent) of the total bytes on a given link. We define tortoises as streams that last longer than 15 minutes. We point out that streams can be classified not only by lifetime (dragonflies and tortoises) but also by size (mice and elephants), and note that stream size and lifetime are independent dimensions. We submit that ISPs need to be aware of the distribution of Internet stream sizes, and the impact of the difference in behavior between short and long streams. In particular, any forwarding cache mechanisms in Internet routers must be able to cope with a high volume of short streams. In addition ISPs should realize that long-running streams can contribute a significant fraction of their packet and byte volumes-something they may not have allowed for when using traditional \"flat rate user bandwidth consumption\" approaches to provisioning and engineering", "fulltext": "", "keywords": "internet stream size measurement;internet stream lifetime measurement;packet volume;tortoises;network traffic streams;isp;elephants;traffic engineering;long-running streams;mice;traffic provisioning;internet routers;dragonflies;traffic distributions;forwarding cache mechanisms;internet traffic streams;byte volume"}
{"name": "train_1317", "title": "Dynamic spectrum management for next-generation DSL systems", "abstract": "The performance of DSL systems is severely constrained by crosstalk due to the electromagnetic coupling among the multiple twisted pairs making up a phone cable. In order to reduce performance loss arising from crosstalk, DSL systems are currently designed under the assumption of worst-case crosstalk scenarios leading to overly conservative DSL deployments. This article presents a new paradigm for DSL system design, which takes into account the multi-user aspects of the DSL transmission environment. Dynamic spectrum management (DSM) departs from the current design philosophy by enabling transceivers to autonomously and dynamically optimize their communication settings with respect to both the channel and the transmissions of neighboring systems. Along with this distributed optimization, when an additional degree of coordination becomes available for future DSL deployment, DSM will allow even greater improvement in DSL performance. Implementations are readily applicable without causing any performance degradation to the existing DSLs under static spectrum management. After providing an overview of the DSM concept, this article reviews two practical DSM methods: iterative water-filling, an autonomous distributed power control method enabling great improvement in performance, which can be implemented through software options in some existing ADSL and VDSL systems; and vectored-DMT, a coordinated transmission/reception technique achieving crosstalk-free communication for DSL systems, which brings within reach the dream of providing universal Internet access at speeds close to 100 Mb/s to 500 m on 1-2 lines and beyond 1 km on 2-4 lines. DSM-capable DSL thus enables the broadband age", "fulltext": "", "keywords": "static spectrum management;coordinated transmission/reception;adsl systems;vectored-dmt;dsl systems performance;crosstalk-free communication;universal internet access;data transmission;twisted pairs;iterative water-filling;phone cable;dsl system design;electromagnetic coupling;transceivers;dynamic spectrum management;autonomous distributed power control method;500 m;vdsl systems;distributed optimization;broadband networks;100 mbit/s;software options"}
{"name": "train_1318", "title": "Network intrusion and fault detection: a statistical anomaly approach", "abstract": "With the advent and explosive growth of the global Internet and electronic commerce environments, adaptive/automatic network/service intrusion and anomaly detection in wide area data networks and e-commerce infrastructures is fast gaining critical research and practical importance. We present and demonstrate the use of a general-purpose hierarchical multitier multiwindow statistical anomaly detection technology and system that operates automatically, adaptively, and proactively, and can be applied to various networking technologies, including both wired and wireless ad hoc networks. Our method uses statistical models and multivariate classifiers to detect anomalous network conditions. Some numerical results are also presented that demonstrate that our proposed methodology can reliably detect attacks with traffic anomaly intensity as low as 3-5 percent of the typical background traffic intensity, thus promising to generate an effective early warning", "fulltext": "", "keywords": "background traffic intensity;fault detection;computer network attacks;early warning systems;traffic anomaly intensity;adaptive/automatic network/service intrusion;wireless ad hoc networks;multiwindow anomaly detection;neural network classification;internet;multivariate classifiers;e-commerce infrastructure;network intrusion;ad hoc wireless experiments;electronic commerce environment;backpropagation;perceptron-back propagation hybrid;denial of service;statistical models;wired ad hoc networks;wide area data networks;hierarchical multitier statistical anomaly detection"}
{"name": "train_1319", "title": "Routing security in wireless ad hoc networks", "abstract": "A mobile ad hoc network consists of a collection of wireless mobile nodes that are capable of communicating with each other without the use of a network infrastructure or any centralized administration. MANET is an emerging research area with practical applications. However, wireless MANET is particularly vulnerable due to its fundamental characteristics, such as open medium, dynamic topology, distributed cooperation, and constrained capability. Routing plays an important role in the security of the entire network. In general, routing security in wireless MANETs appears to be a problem that is not trivial to solve. In this article we study the routing security issues of MANETs, and analyze in detail one type of attack-the \"black hole\" problem-that can easily be employed against the MANETs. We also propose a solution for the black hole problem for ad hoc on-demand distance vector routing protocol", "fulltext": "", "keywords": "on-demand distance vector routing protocol;distributed cooperation;mobile ad hoc network;dynamic topology;wireless ad hoc networks;home wireless personal area networks;wireless mobile nodes;routing security;open medium;wireless manet;satellite transmission"}
{"name": "train_132", "title": "A unified view for vector rotational CORDIC algorithms and architectures based", "abstract": "on angle quantization approach Vector rotation is the key operation employed extensively in many digital signal processing applications. In this paper, we introduce a new design concept called Angle Quantization (AQ). It can be used as a design index for vector rotational operation, where the rotational angle is known in advance. Based on the AQ process, we establish a unified design framework for cost-effective low-latency rotational algorithms and architectures. Several existing works, such as conventional COordinate Rotational Digital Computer (CORDIC), AR-CORDIC, MVR-CORDIC, and EEAS-based CORDIC, can be fitted into the design framework, forming a Vector Rotational CORDIC Family. Moreover, we address four searching algorithms to solve the optimization problem encountered in the proposed vector rotational CORDIC family. The corresponding scaling operations of the CORDIC family are also discussed. Based on the new design framework, we can realize high-speed/low-complexity rotational VLSI circuits, whereas without degrading the precision performance in fixed-point implementations", "fulltext": "", "keywords": "scaling operations;high-speed rotational vlsi circuits;dsp applications;fixed-point implementations;vector rotational cordic algorithms;low-latency rotational architectures;angle quantization;trellis-based searching algorithm;low-latency rotational algorithms;vector rotational operation;searching algorithms;greedy searching algorithm;low-complexity rotational vlsi circuits;design index;optimization problem;digital signal processing applications;unified design framework"}
{"name": "train_1320", "title": "Securing the Internet routing infrastructure", "abstract": "The unprecedented growth of the Internet over the last years, and the expectation of an even faster increase in the numbers of users and networked systems, resulted in the Internet assuming its position as a mass communication medium. At the same time, the emergence of an increasingly large number of application areas and the evolution of the networking technology suggest that in the near future the Internet may become the single integrated communication infrastructure. However, as the dependence on the networking infrastructure grows, its security becomes a major concern, in light of the increased attempt to compromise the infrastructure. In particular, the routing operation is a highly visible target that must be shielded against a wide range of attacks. The injection of false routing information can easily degrade network performance, or even cause denial of service for a large number of hosts and networks over a long period of time. Different approaches have been proposed to secure the routing protocols, with a variety of countermeasures, which, nonetheless, have not eradicated the vulnerability of the routing infrastructure. In this article, we survey the up-to-date secure routing schemes. that appeared over the last few years. Our critical point of view and thorough review of the literature are an attempt to identify directions for future research on an indeed difficult and still largely open problem", "fulltext": "", "keywords": "networking infrastructure;countermeasures;routing infrastructure;secure routing schemes;network performance;networked systems;routing protocols;preventive security mechanisms;networking technology;integrated communication infrastructure;link state protocols;internet routing infrastructure security;research;false routing information"}
{"name": "train_1323", "title": "Editorial system vendors focus on Adobe and the future", "abstract": "Looking over the newspaper-system market, we note that the Mac is getting new respect. Adobe InDesign has established itself as a solid alternative to Quark XPress for pagination. Positioning themselves for the long run, developers are gradually shifting to new software architectures", "fulltext": "", "keywords": "newspaper-system market;publishing;macintosh;adobe indesign;pagination"}
{"name": "train_1324", "title": "A look at MonacoProfiler 4", "abstract": "The newest profiling program from Monaco Software adds some valuable features: support for up to 8-color printing, profiling for digital cameras, fine-tuning of black generation and tweaking of profile transforms. We tested its ease of use and a few of the advanced functions. In all, it's pretty good", "fulltext": "", "keywords": "color-correction;commercial printers;monacoprofiler 4;pantone hexachrome"}
{"name": "train_1325", "title": "X-Rite: more than a graphic arts company", "abstract": "Although it is well known as a maker of densitometers and spectrophotometers, X-Rite is active in measuring light and shape in many industries. Among them are automobile finishes, paint and home improvements, scientific instruments, optical semiconductors and even cosmetic dentistry", "fulltext": "", "keywords": "colour measurement;graphic arts;x-rite"}
{"name": "train_1326", "title": "Verona Lastre: consolidation provides opening for a new plate vendor", "abstract": "Fewer companies than ever are manufacturing CTP plates. The market has become globalized, with just four big firms dominating the picture. To the Samor Group, however, globalization looked like an opportunity; it reasoned that many a national and local distributor would welcome a small, competitive, regional manufacturer. A couple of years ago it formed a company, Verona Lastre, to exploit that opportunity. Now Vela, as it's familiarly called, has launched its line of high-quality thermal plates and is busily lining up dealers in Europe and the Americas", "fulltext": "", "keywords": "verona lastre;ctp plates;vela"}
{"name": "train_1328", "title": "Tablet PCs on the way [publishing markets]", "abstract": "Previews of hardware and software look promising for publishing markets", "fulltext": "", "keywords": "publishing markets;tablet pc"}
{"name": "train_1329", "title": "PageFlex + MediaRich = PageRich", "abstract": "Layout and graphics innovators collaborate on fully variable combination. Pageflex and Equilibrium have melded their respective EDIT and MediaRich technologies to make a variable-data composition engine with a Web interface. Though a first-generation effort, it shows substantial promise", "fulltext": "", "keywords": "mediarich;layout;pagerich;pageflex;graphics;composition;software houses"}
{"name": "train_133", "title": "L/sub p/ stability and linearization", "abstract": "A theorem by Hadamard gives a two-part condition under which a map from one Banach space to another is a homeomorphism. The theorem, while often very useful, is incomplete in the sense that it does not explicitly specify the family of maps for which the condition is met. Recently, under a typically weak additional assumption on the map, it was shown that Hadamard's condition is met if and only if the map is a homeomorphism with a Lipschitz continuous inverse. Here, an application is given concerning the relation between the L/sub p/ stability (with 1 <or= p < infinity ) of a nonlinear system and the stability of related linear systems. We also give a result that directs attention to a fundamental limitation concerning what can be proved about linearization and stability for a related familiar family of feedback systems", "fulltext": "", "keywords": "banach space;nonlinear system;feedback systems;lipschitz continuous inverse;l/sub p/ stability;linear systems;hadamard's condition"}
{"name": "train_1330", "title": "Strobbe Graphics' next frontier: CTP for commercial printers", "abstract": "Strobbe is one of the more successful makers of newspaper platesetters, which are sold by Agfa under the Polaris name. But the company also has a growing presence in commercial printing markets, where it sells under its own name", "fulltext": "", "keywords": "strobbe graphics;polaris;commercial printing;punch international;platesetters;workflow;agfa"}
{"name": "train_1331", "title": "Enterprise content integration III: Agari Mediaware's Media Star", "abstract": "Since we introduced the term Enterprise Content Integration (ECI) in January, the concept has gained momentum in the market. In addition to Context Media's Interchange Platform and Savantech's Photon Commerce, Agari Mediaware's Media Star is in the fray. It is a middleware platform that allows large media companies to integrate their digital systems with great flexibility", "fulltext": "", "keywords": "agari mediaware media star;enterprise content integration;middleware"}
{"name": "train_1332", "title": "Personal cards for on-line purchases", "abstract": "Buying presents over the Web has advantages for a busy person: lots of choices, 24-hour accessibility, quick delivery, and you don't even have to wrap the gift. But many people like to select a card or write a personal note to go with their presents, and the options for doing that have been limited. Two companies have seen this limitation as an opportunity: 4YourSoul.com and CardintheBox.com", "fulltext": "", "keywords": "personalized printing;cardinthebox.com;personal cards;online purchases;4yoursoul.com"}
{"name": "train_1333", "title": "The crossing number of P(N, 3)", "abstract": "It is proved that the crossing number of the generalized Petersen graph P(3k + h, 3) is k + h if h in {0, 2} and k + 3 if h = 1, for each k >or= 3, with the single exception of P(9,3), whose crossing number is 2", "fulltext": "", "keywords": "crossing number;generalized petersen graph"}
{"name": "train_1334", "title": "A shy invariant of graphs", "abstract": "Moving from a well known result of P.L. Hammer et al. (1982), we introduce a new graph invariant, say lambda (G) referring to any graph G. It is a non-negative integer which is non-zero whenever G contains particular induced odd cycles or, equivalently, admits a particular minimum clique-partition. We show that).(G) can be efficiently evaluated and that its determination allows one to reduce the hard problem of computing a minimum clique-cover of a graph to an identical problem of smaller size and special structure. Furthermore, one has alpha (G) <or= theta (G) - lambda (G), where alpha (G) and theta (G) respectively denote the cardinality of a maximum stable set of G and of a minimum clique-partition of G", "fulltext": "", "keywords": "minimum clique-cover;graph invariant;minimum clique-partition;cardinality;induced odd cycles;maximum stable set"}
{"name": "train_1335", "title": "Arranging solid balls to represent a graph", "abstract": "By solid balls, we mean a set of balls in R/sup 3/ no two of which can penetrate each other. Every finite graph G can be represented by arranging solid balls in the following way: Put red balls in R/sup 3/, one for each vertex of G, and connect two red balls by a chain when they correspond to a pair of adjacent vertices of G, where a chain means a finite sequence of blue solid balls in which each consecutive balls are tangent. (We may omit the chain if the two red balls are already tangent.) The ball number b(G) of G is the minimum number of balls (red and blue) necessary to represent G. If we put the balls and chains on a table so that all balls sit on the table, then the minimum number of balls for G is denoted by bT(G). Among other things, we prove that b(K/sub 6/) = 8, b(K/sub 7/) = 13 and b/sub T/(K/sub 5/) = 8,b/sub T/(K/sub 6/) = 14. We also prove that c/sub 1/n/sup 3/ < b(K/sub n/) < c/sub 2/n/sup 3/ log n, c/sub 3/n/sup 4//log n < b/sub T/(K/sub n/) < c/sub 4/n/sup 4/", "fulltext": "", "keywords": "adjacent vertices;graph representation;finite graph;finite sequence;solid balls"}
{"name": "train_1336", "title": "On abelian branched coverings of the sphere", "abstract": "We obtain an enumeration formula for the number of weak equivalence classes of the branched (A * B)-covering of the sphere with m-branch points, when A and B are finite abelian groups with (|A|, |B|) = 1. From this, we can deduce an explicit formula for enumerating the weak equivalence classes of pseudofree spherical (Zp * Zq)-actions on a given surface, when p and q are distinct primes", "fulltext": "", "keywords": "explicit formula;enumeration formula;abelian branched coverings;pseudofree spherical;weak equivalence classes;finite abelian groups"}
{"name": "train_1337", "title": "Some properties of Hadamard matrices coming from dihedral groups", "abstract": "H. Kimura (1996) introduced a method to construct Hadamard matrices of degree 8n + 4 from the dihedral group of order 2n. In this paper we study some properties of this construction", "fulltext": "", "keywords": "dihedral groups;hadamard matrices"}
{"name": "train_1338", "title": "The chromatic spectrum of mixed hypergraphs", "abstract": "A mixed hypergraph is a triple H = (X, C, D), where X is the vertex set, and each of C, D is a list of subsets of X. A strict k-coloring of H is a surjection c : X {1,..., k} such that each member of le has two vertices assigned a common value and each member of D has two vertices assigned distinct values. The feasible set of H is {k: H has a strict k-coloring}. Among other results, we prove that a finite set of positive integers is the feasible set of some mixed hypergraph if and only if it omits the number I or is an interval starting with 1. For the set {s, t} with 2 <or= s <or= t - 2, the smallest realization has 2t - s vertices. When every member of C union D is a single interval in an underlying linear order on the vertices, the feasible set is also a single interval of integers", "fulltext": "", "keywords": "positive integers;mixed hypergraph;vertex set;mixed hypergraphs;chromatic spectrum;strict k-coloring"}
{"name": "train_1339", "title": "Edge-colorings with no large polychromatic stars", "abstract": "Given a graph G and a positive integer r, let f/sub r/(G) denote the largest number of colors that can be used in a coloring of E(G) such that each vertex is incident to at most r colors. For all positive integers n and r, we determine f/sub r/(K/sub n,n/) exactly and f/sub r/(K/sub n/) within 1. In doing so, we disprove a conjecture by Y. Manoussakis et al. (1996)", "fulltext": "", "keywords": "positive integer;positive integers;edge colorings;polychromatic stars"}
{"name": "train_134", "title": "A model of periodic oscillation for genetic regulatory systems", "abstract": "In this paper, we focus on modeling and explaining periodic oscillations in gene-protein systems with a simple nonlinear model and on analyzing effects of time delay on the stability of oscillations. Our main model of genetic regulation comprises of a two-gene system with an autoregulatory feedback loop. We exploit multiple time scales and hysteretic properties of the model to construct periodic oscillations with jumping dynamics and analyze the possible mechanism according to the singular perturbation theory. As shown in this paper, periodic oscillations are mainly generated by nonlinearly negative and positive feedback loops in gene regulatory systems, whereas the jumping dynamics is generally caused by time scale differences among biochemical reactions. This simple model may actually act as a genetic oscillator or switch in gene-protein networks because the dynamics are robust for parameter perturbations or environment variations. We also explore effects of time delay on the stability of the dynamics, showing that the time delay generally increases the stability region of the oscillations, thereby making the oscillations robust to parameter changes. Two examples are also provided to numerically demonstrate our theoretical results", "fulltext": "", "keywords": "bifurcation;nonlinearly positive feedback loops;time delay;circadian rhythm;genetic regulation;modeling;autoregulatory feedback loop;genetic regulatory system;two-gene system;jumping dynamics;singular perturbation theory;stability region;biochemical reactions;nonlinear model;relaxation oscillator;hysteretic properties;nonlinearly negative feedback loops;periodic oscillations;gene-protein systems;oscillations stability"}
{"name": "train_1340", "title": "Orthogonal decompositions of complete digraphs", "abstract": "A family G of isomorphic copies of a given digraph G is said to be an orthogonal decomposition of the complete digraph D/sub n/ by G, if every arc of D/sub n/ belongs to exactly one member of G and the union of any two different elements from G contains precisely one pair of reverse arcs. Given a digraph h, an h family mh is the vertex-disjoint union of m copies of h . In this paper, we consider orthogonal decompositions by h-families. Our objective is to prove the existence of such an orthogonal decomposition whenever certain necessary conditions hold and m is sufficiently large", "fulltext": "", "keywords": "vertex-disjoint union;isomorphic copies;orthogonal decompositions;necessary conditions;complete digraphs"}
{"name": "train_1341", "title": "STEM: Secure Telephony Enabled Middlebox", "abstract": "Dynamic applications, including IP telephony, have not seen wide acceptance within enterprises because of problems caused by the existing network infrastructure. Static elements, including firewalls and network address translation devices, are not capable of allowing dynamic applications to operate properly. The Secure Telephony Enabled Middlebox (STEM) architecture is an enhancement of the existing network design to remove the issues surrounding static devices. The architecture incorporates an improved firewall that can interpret and utilize information in the application layer of packets to ensure proper functionality. In addition to allowing dynamic applications to function normally, the STEM architecture also incorporates several detection and response mechanisms for well-known network-based vulnerabilities. This article describes the key components of the architecture with respect to the SIP protocol", "fulltext": "", "keywords": "stem;ip telephony;response mechanisms;network-based vulnerabilities;network address translation devices;static devices;network design;network infrastructure;detection mechanisms;firewalls;dynamic applications;sip protocol;stem architecture;secure telephony enabled middlebox;application layer"}
{"name": "train_1342", "title": "Defending against flooding-based distributed denial-of-service attacks: a", "abstract": "tutorial Flooding-based distributed denial-of-service (DDoS) attack presents a very serious threat to the stability of the Internet. In a typical DDoS attack, a large number of compromised hosts are amassed to send useless packets to jam a victim, or its Internet connection, or both. In the last two years, it was discovered that DDoS attack methods and tools are becoming more sophisticated, effective, and also more difficult to trace to the real attackers. On the defense side, current technologies are still unable to withstand large-scale attacks. The main purpose of this article is therefore twofold. The first one is to describe various DDoS attack methods, and to present a systematic review and evaluation of the existing defense mechanisms. The second is to discuss a longer-term solution, dubbed the Internet-firewall approach, that attempts to intercept attack packets in the Internet core, well before reaching the victim", "fulltext": "", "keywords": "internet stability;internet firewall;distributed attack detection;reflector attacks;ddos attack tools;attack packets interception;ddos attack methods;large-scale attacks;flooding-based distributed denial-of-service attacks;tutorial"}
{"name": "train_1343", "title": "Estimating the intrinsic dimension of data with a fractal-based method", "abstract": "In this paper, the problem of estimating the intrinsic dimension of a data set is investigated. A fractal-based approach using the Grassberger-Procaccia algorithm is proposed. Since the Grassberger-Procaccia algorithm (1983) performs badly on sets of high dimensionality, an empirical procedure that improves the original algorithm has been developed. The procedure has been tested on data sets of known dimensionality and on time series of Santa Fe competition", "fulltext": "", "keywords": "fractal-based method;time series;santa fe competition;pattern recognition;data intrinsic dimension estimation"}
{"name": "train_1344", "title": "Restoration of archival documents using a wavelet technique", "abstract": "This paper addresses a problem of restoring handwritten archival documents by recovering their contents from the interfering handwriting on the reverse side caused by the seeping of ink. We present a novel method that works by first matching both sides of a document such that the interfering strokes are mapped with the corresponding strokes originating from the reverse side. This facilitates the identification of the foreground and interfering strokes. A wavelet reconstruction process then iteratively enhances the foreground strokes and smears the interfering strokes so as to strengthen the discriminating capability of an improved Canny edge detector against the interfering strokes. The method has been shown to restore the documents effectively with average precision and recall rates for foreground text extraction at 84 percent and 96 percent, respectively", "fulltext": "", "keywords": "archival documents restoration;handwritten archival documents;wavelet reconstruction process;iterative stroke enhancement;ink seepage;wavelet technique;canny edge detector"}
{"name": "train_1345", "title": "Infrared-image classification using hidden Markov trees", "abstract": "An image of a three-dimensional target is generally characterized by the visible target subcomponents, with these dictated by the target-sensor orientation (target pose). An image often changes quickly with variable pose. We define a class as a set of contiguous target-sensor orientations over which the associated target image is relatively stationary with aspect. Each target is in general characterized by multiple classes. A distinct set of Wiener filters are employed for each class of images, to identify the presence of target subcomponents. A Karhunen-Loeve representation is used to minimize the number of filters (templates) associated with a given subcomponent. The statistical relationships between the different target subcomponents are modeled via a hidden Markov tree (HMT). The HMT classifier is discussed and example results are presented for forward-looking-infrared (FLIR) imagery of several vehicles", "fulltext": "", "keywords": "karhunen-loeve representation;vehicles;hmt;target pose;3d target image;hidden markov trees;target-sensor orientation;infrared-image classification;minimization;ir image classification;contiguous target-sensor orientations;wiener filters;flir imagery;forward-looking-infrared imagery"}
{"name": "train_1346", "title": "Automatic multilevel thresholding for image segmentation by the growing time", "abstract": "adaptive self-organizing map In this paper, a Growing TASOM (Time Adaptive Self-Organizing Map) network called \"GTASOM\" along with a peak finding process is proposed for automatic multilevel thresholding. The proposed GTASOM is tested for image segmentation. Experimental results demonstrate that the GTASOM is a reliable and accurate tool for image segmentation and its results outperform other thresholding methods", "fulltext": "", "keywords": "growing tasom;image segmentation;growing time adaptive self-organizing map;gtasom;automatic multilevel thresholding;peak finding process"}
{"name": "train_1347", "title": "A maximum-likelihood surface estimator for dense range data", "abstract": "Describes how to estimate 3D surface models from dense sets of noisy range data taken from different points of view, i.e., multiple range maps. The proposed method uses a sensor model to develop an expression for the likelihood of a 3D surface, conditional on a set of noisy range measurements. Optimizing this likelihood with respect to the model parameters provides an unbiased and efficient estimator. The proposed numerical algorithms make this estimation computationally practical for a wide variety of circumstances. The results from this method compare favorably with state-of-the-art approaches that rely on the closest-point or perpendicular distance metric, a convenient heuristic that produces biased solutions and fails completely when surfaces are not sufficiently smooth, as in the case of complex scenes or noisy range measurements. Empirical results on both simulated and real ladar data demonstrate the effectiveness of the proposed method for several different types of problems. Furthermore, the proposed method offers a general framework that can accommodate extensions to include surface priors, more sophisticated noise models, and other sensing modalities, such as sonar or synthetic aperture radar", "fulltext": "", "keywords": "surface fitting;simulated ladar data;noisy range measurements;3d surface models;bayesian estimation;unbiased estimator;synthetic aperture radar;calibration;real ladar data;complex scenes;noisy range data;parameter estimation;heuristic;optimal estimation;maximum-likelihood surface estimator;biased solutions;dense range data;registration;sonar;surface reconstruction;sensor model"}
{"name": "train_1348", "title": "Reconstructing surfaces by volumetric regularization using radial basis", "abstract": "functions We present a new method of surface reconstruction that generates smooth and seamless models from sparse, noisy, nonuniform, and low resolution range data. Data acquisition techniques from computer vision, such as stereo range images and space carving, produce 3D point sets that are imprecise and nonuniform when compared to laser or optical range scanners. Traditional reconstruction algorithms designed for dense and precise data do not produce smooth reconstructions when applied to vision-based data sets. Our method constructs a 3D implicit surface, formulated as a sum of weighted radial basis functions. We achieve three primary advantages over existing algorithms: (1) the implicit functions we construct estimate the surface well in regions where there is little data, (2) the reconstructed surface is insensitive to noise in data acquisition because we can allow the surface to approximate, rather than exactly interpolate, the data, and (3) the reconstructed surface is locally detailed, yet globally smooth, because we use radial basis functions that achieve multiple orders of smoothness", "fulltext": "", "keywords": "3d point sets;vision-based data sets;sparse range data;data acquisition techniques;surfaces reconstruction;noisy data;computer vision;low resolution range data;radial basis functions;stereo range images;nonuniform data;weighted radial basis functions;3d implicit surface;space carving;volumetric regularization"}
{"name": "train_1349", "title": "Efficient simplicial reconstructions of manifolds from their samples", "abstract": "An algorithm for manifold learning is presented. Given only samples of a finite-dimensional differentiable manifold and no a priori knowledge of the manifold's geometry or topology except for its dimension, the goal is to find a description of the manifold. The learned manifold must approximate the true manifold well, both geometrically and topologically, when the sampling density is sufficiently high. The proposed algorithm constructs a simplicial complex based on approximations to the tangent bundle of the manifold. An important property of the algorithm is that its complexity depends on the dimension of the manifold, rather than that of the embedding space. Successful examples are presented in the cases of learning curves in the plane, curves in space, and surfaces in space; in addition, a case when the algorithm fails is analyzed", "fulltext": "", "keywords": "sampling density;simplicial reconstructions;true manifold;learned manifold;finite-dimensional differentiable manifold;manifold learning;simplicial complex"}
{"name": "train_135", "title": "Hysteretic threshold logic and quasi-delay insensitive asynchronous design", "abstract": "We introduce the class of hysteretic linear-threshold (HLT) logic functions as a novel extension of linear threshold logic, and prove their general applicability for constructing state-holding Boolean functions. We then demonstrate a fusion of HLT logic with the quasi-delay insensitive style of asynchronous circuit design, complete with logical design examples. Future research directions are also identified", "fulltext": "", "keywords": "cmos implementation;hlt logic;state-holding boolean functions;asynchronous circuit design;quasi-delay insensitive style;digital logic;hysteretic linear-threshold logic functions;logic design"}
{"name": "train_1350", "title": "Generalized mosaicing: wide field of view multispectral imaging", "abstract": "We present an approach to significantly enhance the spectral resolution of imaging systems by generalizing image mosaicing. A filter transmitting spatially varying spectral bands is rigidly attached to a camera. As the system moves, it senses each scene point multiple times, each time in a different spectral band. This is an additional dimension of the generalized mosaic paradigm, which has demonstrated yielding high radiometric dynamic range images in a wide field of view, using a spatially varying density filter. The resulting mosaic represents the spectrum at each scene point. The image acquisition is as easy as in traditional image mosaics. We derive an efficient scene sampling rate, and use a registration method that accommodates the spatially varying properties of the filter. Using the data acquired by this method, we demonstrate scene rendering under different simulated illumination spectra. We are also able to infer information about the scene illumination. The approach was tested using a standard 8-bit black/white video camera and a fixed spatially varying spectral (interference) filter", "fulltext": "", "keywords": "scene sampling rate;scene illumination;registration method;image fusion;wide field of view multispectral imaging;physics-based vision;image-based rendering;color balance;image acquisition;spatially varying spectral bands;generalized mosaicing;scene rendering;hyperspectral imaging;simulated illumination spectra;spatially varying density filter"}
{"name": "train_1351", "title": "Analytic PCA construction for theoretical analysis of lighting variability in", "abstract": "images of a Lambertian object We analyze theoretically the subspace best approximating images of a convex Lambertian object taken from the same viewpoint, but under different distant illumination conditions. We analytically construct the principal component analysis for images of a convex Lambertian object, explicitly taking attached shadows into account, and find the principal eigenmodes and eigenvalues with respect to lighting variability. Our analysis makes use of an analytic formula for the irradiance in terms of spherical-harmonic coefficients of the illumination and shows, under appropriate assumptions, that the principal components or eigenvectors are identical to the spherical harmonic basis functions evaluated at the surface normal vectors. Our main contribution is in extending these results to the single-viewpoint case, showing how the principal eigenmodes and eigenvalues are affected when only a limited subset (the upper hemisphere) of normals is available and the spherical harmonics are no longer orthonormal over the restricted domain. Our results are very close, both qualitatively and quantitatively, to previous empirical observations and represent the first essentially complete theoretical explanation of these observations", "fulltext": "", "keywords": "principal eigenvalues;irradiance;lighting variability;surface normal vectors;five-dimensional subspace;radiance;spherical harmonics;principal eigenmodes;analytic principal component analysis;convex lambertian object"}
{"name": "train_1352", "title": "Elastically adaptive deformable models", "abstract": "We present a technique for the automatic adaptation of a deformable model's elastic parameters within a Kalman filter framework for shape estimation applications. The novelty of the technique is that the model's elastic parameters are not constant, but spatio-temporally varying. The variation of the elastic parameters depends on the distance of the model from the data and the rate of change of this distance. Each pass of the algorithm uses physics-based modeling techniques to iteratively adjust both the geometric and the elastic degrees of freedom of the model in response to forces that are computed from the discrepancy between the model and the data. By augmenting the state equations of an extended Kalman filter to incorporate these additional variables, we are able to significantly improve the quality of the shape estimation. Therefore, the model's elastic parameters are always initialized to the same value and they are subsequently modified depending on the data and the noise distribution. We present results demonstrating the effectiveness of our method for both two-dimensional and three-dimensional data", "fulltext": "", "keywords": "elastically adaptive deformable models;physics-based modeling techniques;elastic degrees of freedom;extended kalman filter;geometric degrees of freedom;state equations;kalman filter framework;shape estimation;elastic parameters;automatic adaptation"}
{"name": "train_1353", "title": "Generalized spatio-chromatic diffusion", "abstract": "A framework for diffusion of color images is presented. The method is based on the theory of thermodynamics of irreversible transformations which provides a suitable basis for designing correlations between the different color channels. More precisely, we derive an equation for color evolution which comprises a purely spatial diffusive term and a nonlinear term that depends on the interactions among color channels over space. We apply the proposed equation to images represented in several color spaces, such as RGB, CIELAB, Opponent colors, and IHS", "fulltext": "", "keywords": "vector-valued diffusion;opponent colors;generalized spatio-chromatic diffusion;cielab;diffusion;thermodynamics;color evolution;color images;rgb;ihs;irreversible transformations;nonlinear term;color channels;spatial diffusive term;scale-space"}
{"name": "train_1354", "title": "Design and analysis of optimal material distribution policies in flexible", "abstract": "manufacturing systems using a single AGV Modern automated manufacturing processes employ automated guided vehicles (AGVs) for material handling, which serve several machine centres (MC) in a factory. Optimal scheduling of AGVs can significantly help to increase the efficiency of the manufacturing process by minimizing the idle time of MCs waiting for the raw materials. We analyse the requirements for an optimal schedule and then provide a mathematical framework for an efficient schedule of material delivery by an AGV. A mathematical model is developed and then a strategy for optimal material distribution of the available raw material to the MCs is derived. With this model, the optimal number of MCs to be utilized is also determined. Finally, the material delivery schedule employing multiple journeys to the MCs by the AGV is carried out. Through rigorous analysis and simulation experiments, we show that such a delivery strategy will optimize the overall performance", "fulltext": "", "keywords": "manufacturing lead time;optimal scheduling;material delivery;automated guided vehicle;idle time minimization;machine centres;waiting time;agv;flexible manufacturing systems;optimal material distribution policies;material handling"}
{"name": "train_1355", "title": "Comparison of push and pull systems with transporters: a metamodelling approach", "abstract": "Analyses push and pull systems with transportation consideration. A multiproduct, multiline, multistage production system was used to compare the two systems. The effects of four factors (processing time variation, demand variation, transporters, batch size) on throughput rate, average waiting time in the system and machine utilization were studied. The study uses metamodels to compare the two systems. They serve a dual purpose of expressing system performance measures in the form of a simple equation and reducing computational time when comparing the two systems. Research shows that the number of transporters used and the batch size have a significant effect on the performance measures of both systems", "fulltext": "", "keywords": "performance measures;multiproduct multiline multistage production system;throughput rate;average waiting time;pull systems;machine utilization;metamodelling approach;push systems;batch size;demand variation;processing time variation;transporters"}
{"name": "train_1356", "title": "Five-axis NC milling of ruled surfaces: optimal geometry of a conical tool", "abstract": "The side milling of ruled surfaces using a conical milling cutter was studied. This is a field that has largely been ignored by research scientists, but it is much used in industry, especially to machine turbine blades. We first suggest an improved positioning with respect to the directrices of the ruled surface. As compared with the methods already developed for the cylindrical cutter, this positioning enables the error between the cutter and the work-piece to be reduced. An algorithm is then introduced to calculate error so one can determine the cutter dimensions (cone radius and angle) in order to respect the tolerance interval imposed by the design office. This study provides an opportunity to determine cutters with greater dimensions, thus alleviating bending problems during milling", "fulltext": "", "keywords": "optimal geometry;conical milling cutter;conical;side milling;tolerance interval;positioning;five-axis nc milling;cutter dimensions;ruled surfaces"}
{"name": "train_1357", "title": "Work sequencing in a manufacturing cell with limited labour constraints", "abstract": "This study focuses on the analysis of group scheduling heuristics in a dual-constrained, automated manufacturing cell, where labour utilization is limited to setups, tear-downs and loads/unloads. This scenario is realistic in today's automated manufacturing cells. The results indicate that policies for allocating labour to tasks have very little impact in such an environment. Furthermore, the performance of efficiency oriented, exhaustive, group scheduling heuristics deteriorated while the performance of the more complex, non-exhaustive heuristics improved. Thus, it is recommended that production managers use the simplest labour scheduling policy, and instead focus their efforts to activities such as job scheduling and production planning in such environments", "fulltext": "", "keywords": "efficiency oriented exhaustive group scheduling heuristics;automated manufacturing cells;job scheduling;dual-constrained automated manufacturing cell;nonexhaustive heuristics;manufacturing cell;group scheduling heuristics;limited labour constraints;work sequencing;labour allocation policies;production planning"}
{"name": "train_1358", "title": "Analysis of the surface roughness and dimensional accuracy capability of fused", "abstract": "deposition modelling processes Building up materials in layers poses significant challenges from the viewpoint of material science, heat transfer and applied mechanics. However, numerous aspects of the use of these technologies have yet to be studied. One of these aspects is the characterization of the surface roughness and dimensional precision obtainable in layered manufacturing processes. In this paper, a study of roughness parameters obtained through the use of these manufacturing processes was made. Prototype parts were manufactured using FDM techniques and an experimental analysis of the resulting roughness average (R/sub a/) and rms roughness (R/sub q/) obtained through the use of these manufacturing processes was carried out. Dimensional parameters were also studied in order to determine the capability of the Fused Deposition Modelling process for manufacturing parts", "fulltext": "", "keywords": "cnc-controlled robot;rms roughness;surface roughness;dimensional accuracy capability;layered manufacturing processes;fused deposition modelling processes;prototype parts;dimensional precision;cad model;rapid prototyping;three-dimensional solid objects;extrusion head;roughness average"}
{"name": "train_1359", "title": "On fuzzy and probabilistic control charts", "abstract": "In this article, different procedures of constructing control charts for linguistic data, based on fuzzy and probability theory, are discussed. Three sets of membership functions, with different degrees of fuzziness, are proposed for fuzzy approaches. A comparison between fuzzy and probability approaches, based on the Average Run Length and samples under control, is conducted for real data. Contrary to the conclusions of Raz and Wang (1990) the choice of degree of fuzziness affected the sensitivity of control charts", "fulltext": "", "keywords": "control chart construction;membership functions;fuzzy control charts;probabilistic control charts;average run length;fuzzy subsets;porcelain products;fuzziness degree;linguistic data;sensitivity"}
{"name": "train_136", "title": "Design of 1-D and 2-D variable fractional delay allpass filters using weighted", "abstract": "least-squares method In this paper, a weighted least-squares method is presented to design one-dimensional and two-dimensional variable fractional delay allpass filters. First, each coefficient of the variable allpass filter is expressed as the polynomial of the fractional delay parameter. Then, the nonlinear phase error is approximated by a weighted equation error such that the cost function can be converted into a quadratic form. Next, by minimizing the weighted equation error, the optimal polynomial coefficients can be obtained iteratively by solving a set of linear simultaneous equations at each iteration. Finally, the design examples are demonstrated to illustrate the effectiveness of the proposed approach", "fulltext": "", "keywords": "cost function;fractional delay parameter;variable fractional delay allpass filters;linear simultaneous equations;nonlinear phase error approximation;1d allpass filters;2d allpass filters;weighted least-squares method;optimal polynomial coefficients;weighted equation error"}
{"name": "train_1360", "title": "Automated post bonding inspection by using machine vision techniques", "abstract": "Inspection plays an important role in the semiconductor industry. In this paper, we focus on the inspection task after wire bonding in packaging. The purpose of wire bonding (W/B) is to connect the bond pads with the lead fingers. Two major types of defects are (1) bonding line missing and (2) bonding line breakage. The numbers of bonding lines and bonding balls are used as the features for defect classification. The proposed method consists of image preprocessing, orientation determination, connection detection, bonding line detection, bonding ball detection, and defect classification. The proposed method is simple and fast. The experimental results show that the proposed method can detect the defects effectively", "fulltext": "", "keywords": "defect classification;wire bonding;orientation determination;lead fingers;bonding line detection;machine vision;packaging;connection detection;semiconductor industry;bonding line missing;ic manufacturing;bonding line breakage;bonding balls;automated post bonding inspection;bonding ball detection;image preprocessing;bond pad connection"}
{"name": "train_1361", "title": "Adaptive scheduling of batch servers in flow shops", "abstract": "Batch servicing is a common way of benefiting from economies of scale in manufacturing operations. Good examples of production systems that allow for batch processing are ovens found in the aircraft industry and in semiconductor manufacturing. In this paper we study the issue of dynamic scheduling of such systems within the context of multi-stage flow shops. So far, a great deal of research has concentrated on the development of control strategies, which only address the batch stage. This paper proposes an integral scheduling approach that also includes succeeding stages. In this way, we aim for shop optimization, instead of optimizing performance for a single stage. Our so-called look-ahead strategy adapts its scheduling decision to shop status, which includes information on a limited number of near-future arrivals. In particular, we study a two-stage flow shop, in which the batch stage is succeeded by a serial stage. The serial stage may be realized by a single machine or by parallel machines. Through an extensive simulation study it is demonstrated how shop performance can be improved by the proposed strategy relative to existing strategies", "fulltext": "", "keywords": "flow shops;control strategies;two-stage flow shop;batch servers;simulation study;parallel machines;manufacturing operations;production systems;integral scheduling approach;near-future arrivals;dynamic scheduling;batch servicing;look-ahead strategy;aircraft industry;shop optimization;single machine;ovens;semiconductor manufacturing;adaptive scheduling;multi-stage flow shops"}
{"name": "train_1362", "title": "Process planning for reliable high-speed machining of moulds", "abstract": "A method of generating NC programs for the high-speed milling of moulds is investigated. Forging dies and injection moulds, whether plastic or aluminium, have a complex surface geometry. In addition they are made of steels of hardness as much as 30 or even 50 HRC. Since 1995, high-speed machining has been much adopted by the die-making industry, which with this technology can reduce its use of Sinking Electrodischarge Machining (SEDM). EDM, in general, calls for longer machining times. The use of high-speed machining makes it necessary to redefine the preliminary stages of the process. In addition, it affects the methodology employed in the generation of NC programs, which requires the use of high-level CAM software. The aim is to generate error-free programs that make use of optimum cutting strategies in the interest of productivity and surface quality. The final result is a more reliable manufacturing process. There are two risks in the use of high-speed milling on hardened steels. One of these is tool breakage, which may be very costly and may furthermore entail marks on the workpiece. The other is collisions between the tool and the workpiece or fixtures, the result of which may be damage to the ceramic bearings in the spindles. in order to minimize these risks it is necessary that new control and optimization steps be included in the CAM methodology. There are three things that the firm adopting high-speed methods should do. It should redefine its process engineering, it should systematize access by its CAM programmers to high-speed knowhow, and it should take up the use of process simulation tools. In the latter case, it will be very advantageous to use tools for the estimation of cutting forces. The new work methods proposed in this article have made it possible to introduce high speed milling (HSM) into the die industry. Examples are given of how the technique has been applied with CAM programming re-engineered as here proposed, with an explanation of the novel features and the results", "fulltext": "", "keywords": "forging dies;cam methodology;process engineering redefinition;optimum cutting strategies;complex surface geometry;cutting strategies;injection moulds;error-free programs;moulds;process simulation tools;cam programming re-engineering;productivity;tool workpiece collisions;tool breakage;nc programs;process planning;high-speed milling;surface quality;ceramic bearings;hardened steels;reliable high-speed machining"}
{"name": "train_1363", "title": "Heuristics for single-pass welding task sequencing", "abstract": "Welding task sequencing is a prerequisite in the offline programming of robot arc welding. Single-pass welding task sequencing can be modelled as a modified travelling salesman problem. Owing to the difficulty of the resulting arc-routing problems, effective local search heuristics are developed. Computational speed becomes important because robot arc welding is often part of an automated process-planning procedure. Generating a reasonable solution in an acceptable time is necessary for effective automated process planning. Several different heuristics are proposed for solving the welding task-sequencing problem considering both productivity and the potential for welding distortion. Constructive heuristics based on the nearest neighbour concept and tabu search heuristics are developed and enhanced using improvement procedures. The effectiveness of the heuristics developed is tested and verified on actual welded structure problems and random problems", "fulltext": "", "keywords": "random problems;nearest neighbour concept;welding distortion;welded structure problems;tabu search heuristics;single-pass welding task sequencing;local search heuristics;offline programming;modified travelling salesman problem;productivity;computational speed;automated process-planning procedure;robot arc welding;constructive heuristics"}
{"name": "train_1364", "title": "An adaptive sphere-fitting method for sequential tolerance control", "abstract": "The machining of complex parts typically involves a logical and chronological sequence of n operations on m machine tools. Because manufacturing datums cannot always match design constraints, some of the design specifications imposed on the part are usually satisfied by distinct subsets of the n operations prescribed in the process plan. Conventional tolerance control specifies a fixed set point for each operation and a permissible variation about this set point to insure compliance with the specifications, whereas sequential tolerance control (STC) uses real-time measurement information at the completion of one stage to reposition the set point for subsequent operations. However, it has been shown that earlier sphere-fitting methods for STC can lead to inferior solutions when the process distributions are skewed. This paper introduces an extension of STC that uses an adaptive sphere-fitting method that significantly improves the yield in the presence of skewed distributions as well as significantly reducing the computational effort required by earlier probabilistic search methods", "fulltext": "", "keywords": "real-time measurement information;compliance;skewed distributions;sequential tolerance control;yield improvement;adaptive sphere-fitting method;computational effort;machine tools;design constraints"}
{"name": "train_1365", "title": "Deadlock-free scheduling in flexible manufacturing systems using Petri nets", "abstract": "This paper addresses the deadlock-free scheduling problem in Flexible Manufacturing Systems. An efficient deadlock-free scheduling algorithm was developed, using timed Petri nets, for a class of FMSs called Systems of Sequential Systems with Shared Resources (S/sup 4/ R). The algorithm generates a partial reachability graph to find the optimal or near-optimal deadlock-free schedule in terms of the firing sequence of the transitions of the Petri net model. The objective is to minimize the mean flow time (MFT). An efficient truncation technique, based on the siphon concept, has been developed and used to generate the minimum necessary portion of the reachability graph to be searched. It has been shown experimentally that the developed siphon truncation technique enhances the ability to develop deadlock-free schedules of systems with a high number of deadlocks, which cannot be achieved using standard Petri net scheduling approaches. It may be necessary, in some cases, to relax the optimality condition for large FMSs in order to make the search effort reasonable. Hence, a User Control Factor (UCF) was defined and used in the scheduling algorithm. The objective of using the UCF is to achieve an acceptable trade-off between the solution quality and the search effort. Its effect on the MFT and the CPU time has been investigated. Randomly generated examples are used for illustration and comparison. Although the effect of UCF did not affect the mean flow time, it was shown that increasing it reduces the search effort (CPU time) significantly", "fulltext": "", "keywords": "optimal deadlock-free schedule;siphon truncation technique;systems of sequential systems with shared resources;optimality condition relaxation;mean flow time minimization;user control factor;randomly generated examples;deadlock-free scheduling;near-optimal deadlock-free schedule;petri net model transitions firing sequence;flexible manufacturing systems;partial reachability graph;cpu time;petri nets"}
{"name": "train_1366", "title": "A fuzzy-soft learning vector quantization for control chart pattern recognition", "abstract": "This paper presents a supervised competitive learning network approach, called a fuzzy-soft learning vector quantization, for control chart pattern recognition. Unnatural patterns in control charts mean that there are some unnatural causes for variations in statistical process control (SPC). Hence, control chart pattern recognition becomes more important in SPC. In order to detect effectively the patterns for the six main types of control charts, Pham and Oztemel (1994) described a class of pattern recognizers for control charts based on the learning vector quantization (LVQ) such as LVQ, LVQ2 and LVQ-X etc. In this paper, we propose a new supervised LVQ for control charts based on a fuzzy-soft competitive learning network. The proposed fuzzy-soft LVQ (FS-LVQ) uses a fuzzy relaxation technique and simultaneously updates all neurons. It can increase correct recognition accuracy and also decrease the learning time. Comparisons between LVQ, LVQ-X and FS-LVQ are made", "fulltext": "", "keywords": "numerical results;simultaneous neuron update;unnatural patterns;learning time;fuzzy-soft learning vector quantization;control chart pattern recognition;supervised competitive learning network approach;supervised lvq;correct recognition accuracy;fuzzy relaxation technique;spc;manufacturing process;statistical process control"}
{"name": "train_1367", "title": "The set of just-in-time management strategies: an assessment of their impact on", "abstract": "plant-level productivity and input-factor substitutability using variable cost function estimates Many manufacturers in the automobile industry around the world have adopted the just-in-time (JIT) set of management strategies in an effort to improve productivity, efficiency and product quality. The paper provides empirical evidence that supports the idea that JIT manufacturing environments are, in fact, more productive than their non-JIT counterparts. Plant-level cross-sectional data from auto-parts manufacturing firms are used to estimate variable cost functions for a JIT group as well as for a non-JIT group of plants. Differences in cost function characteristics between the two groups are examined and discussed", "fulltext": "", "keywords": "plant-level productivity;variable cost function estimates;auto-parts manufacturing firms;jit;efficiency;just-in-time management strategies;product quality;automobile industry;input-factor substitutability"}
{"name": "train_1368", "title": "Exploratory study of the adoption of manufacturing technology innovations in", "abstract": "the USA and the UK Manufacturing technologies, appropriately implemented, provide competitive advantage to manufacturers. The use of manufacturing technologies across countries is difficult to compare. One such comparison has been provided in the literature with a study of US and Japanese practices in advanced manufacturing technology use using a common questionnaire. The present study compares the use of 17 different technologies in similar industries in the USA (n=1025) and UK (n=166) using a common questionnaire. Largely, there are remarkable similarities between the two countries. This may partly correlate with the heavy traffic in foreign direct investment between the two nations. Notable differences are (1) across-the-board, US manufacturers are ahead of the UK firms in computerized integration with units inside and outside manufacturing organizations; (2) US manufacturers show higher labour productivity, which is consistent with macro-economic data, and (3) more UK manufacturers report the use of soft technologies such as just-in-time, total quality manufacturing and manufacturing cells. Hypotheses for future investigation are proposed", "fulltext": "", "keywords": "manufacturing technology innovations;total quality manufacturing;uk;foreign direct investment;manufacturing cells;competitive advantage;just-in-time;labour productivity;macro-economic data;usa;soft technologies"}
{"name": "train_1369", "title": "Use of Bayesian Belief Networks when combining disparate sources of information", "abstract": "in the safety assessment of software-based systems The paper discusses how disparate sources of information can be combined in the safety assessment of software-based systems. The emphasis is put on an emerging methodology, relevant for intelligent product-support systems, to combine information about disparate evidences systematically based on Bayesian Belief Networks. The objective is to show the link between basic information and the confidence one can have in a system. How one combines the Bayesian Belief Net (BBN) method with a software safety standard (RTCA/DO-178B,) for safety assessment of software-based systems is also discussed. Finally, the applicability of the BBN methodology and experiences from cooperative research work together with Kongsberg Defence & Aerospace and Det Norske Veritas, and ongoing research with VTT Automation are presented", "fulltext": "", "keywords": "intelligent product-support systems;safety assessment;software-based systems;software safety standard;bayesian belief networks"}
{"name": "train_137", "title": "An efficient DIPIE algorithm for CAD of electrostatically actuated MEMS devices", "abstract": "Pull-in parameters are important properties of electrostatic actuators. Efficient and accurate analysis tools that can capture these parameters for different design geometries, are therefore essential. Current simulation tools approach the pull-in state by iteratively adjusting the voltage applied across the actuator electrodes. The convergence rate of this scheme gradually deteriorates as the pull-in state is approached. Moreover, the convergence is inconsistent and requires many mesh and accuracy refinements to assure reliable predictions. As a result, the design procedure of electrostatically actuated MEMS devices can be time-consuming. In this paper a novel Displacement Iteration Pull-In Extraction (DIPIE) scheme is presented. The DIPIE scheme is shown to converge consistently and far more rapidly than the Voltage Iterations (VI) scheme (>100 times faster!). The DIPIE scheme requires separate mechanical and electrostatic field solvers. Therefore, it can be easily implemented in existing MOEMS CAD packages. Moreover, using the DIPIE scheme, the pull-in parameters extraction can be performed in a fully automated mode, and no user input for search bounds is required", "fulltext": "", "keywords": "mechanical field solver;design geometries;computer-aided design;convergence rate;moems cad packages;dipie algorithm;electrostatic field solver;displacement iteration;electrostatic actuators;electrostatically actuated mems devices;pull-in parameters;displacement iteration pull-in extraction scheme"}
{"name": "train_1370", "title": "Integrated support based on task models for the design, evaluation, and", "abstract": "documentation of interactive safety-critical systems: a case study in the air-traffic control domain This paper presents an approach to using task models in both the design and the evaluation phases of interactive safety-critical applications. We explain how it is possible to use information contained in task models to support the design and development of effective user interfaces. Moreover, we show how task models can also support a systematic inspection-based usability assessment by examining possible deviations that can occur while users interact with the system, an important issue especially when coping with the peculiar requirements of safety-critical applications. Such evaluation provides useful technical documentation to help users achieve an in-depth understanding of the system and its design rationale. Lastly, a description of the application of our approach to a real case study in the air-traffic control domain will illustrate the main features of the proposed method. In particular, we discuss examples taken from an application for air-traffic controllers in an aerodrome supported by graphical user interfaces for data-link communications with pilots", "fulltext": "", "keywords": "air-traffic control domain;data-link communications;graphical user interfaces;technical documentation;task models;user interfaces;integrated support;interactive safety-critical systems;inspection-based usability assessment"}
{"name": "train_1371", "title": "Design methodology for diagnostic strategies for industrial systems", "abstract": "This paper presents a method for the construction of diagnostic systems for complex industrial applications. The approach has been explicitely developed to shorten the design cycle and meet some specific requirements, such as modularity, flexibility, and the possibility of merging many different sources of information. The method allows one to consider multiple simultaneous failures and is specifically designed to make easier the coordination and simplification of local diagnostic algorithms developed by different teams", "fulltext": "", "keywords": "modularity;design methodology;local diagnostic algorithms;diagnostic strategies;industrial systems"}
{"name": "train_1372", "title": "Knowledge acquisition and ontology modelling for construction of a control and", "abstract": "monitoring expert system This paper presents the processes of knowledge acquisition and ontology development for structuring the knowledge base of an expert system. Ontological engineering is a process that facilitates construction of the knowledge base of an intelligent system. Ontology is the study of the organization and classification of knowledge. Ontological engineering in artificial intelligence has the practical goal of constructing frameworks for knowledge that allow computational systems to tackle knowledge-intensive problems and it supports knowledge sharing and reuse. To illustrate the process of conceptual modelling using the Inferential Modelling Technique as a basis for ontology construction, the tool and processes are applied to build an expert system in the domain of monitoring of a petroleum-production facility", "fulltext": "", "keywords": "knowledge reuse;inferential modelling technique;knowledge base;knowledge acquisition;artificial intelligence;petroleum-production facility;ontology modelling;ontological engineering;control and monitoring expert system;intelligent system"}
{"name": "train_1373", "title": "Agent-based product-support logistics system using XML and RDF", "abstract": "The capability of the timely provision of maintenance services and service parts is critical to the competitiveness of industrial systems. To enhance the timely operations in a product-support logistics chain, business partners (equipment manufacturers, parts distributors, customers) may have to collaborate for the efficient exchange of relevant information. We propose the architecture of an agent-based product-support logistics system. Emphasis is placed on the problems of sharing and exchanging information through agent communication. We adopt the Resource Description Framework (RDF) schema for information modelling in product-support logistics domain. The eXtensible Markup Language (XML) serialization generates messages for agent communication. The use of XML and RDF enables software agents to understand the contents of messages correctly and consistently. We demonstrate the feasibility of our agent architecture using a scenario in logistical support processes. We believe that the approach can provide a promising way to the automation of business processes in product-support logistics through seamless communication among the partners", "fulltext": "", "keywords": "resource description framework schema;service parts;maintenance services;information modelling;rdf;xml;industrial systems;extensible markup language;agent-based product-support logistics system;software agents"}
{"name": "train_1374", "title": "Using technology to facilitate the design and delivery of warnings", "abstract": "This paper describes several ways in which new technologies can assist in the design and delivery of warnings. There are four discussion points: (1) current product information can be delivered via the Internet; (2) computer software and hardware are available to assist in the design, construction, and production of visual and auditory warnings; (3) various detection devices can be used to recognize instances in which warnings might be delivered; and (4) a warning presentation can be modified to fit conditions and persons. Implications, example applications and future prospects of these points are described", "fulltext": "", "keywords": "internet;auditory warnings;computer hardware;computer software;warning presentation;product information"}
{"name": "train_1375", "title": "Evaluation of the usability of digital maintenance manuals developed without", "abstract": "either user input or a task analysis The primary objective was to investigate the value that can be added to a low-cost digital maintenance manual by the addition of a navigational aid. Two versions of a digital maintenance manual were developed, the difference between them being the number of design heuristics observed when designing navigational aids. Neither version was based on an analysis of the tasks carried out by users, nor were users involved in the design process. Instead, the manuals were developed directly from the digital information used to produce the existing paper manual. Usability trials were carried out to test both versions according to the time taken and errors committed by users during typical information retrieval tasks. Users were questioned to determine their ease of use (EOU) perceptions for each manual. The main outcomes were that the navigation aid used in the second version reduced the time taken to use the manual but increased the number of errors made by users. The navigational aid also seemed to reduce the perceived EOU compared with the first version. In both cases, the perceived EOU was lower than for a previous digital manual that had been developed using a task analysis and user input. The paper concludes by recommending the development of a generic task model of user interaction with digital maintenance manuals", "fulltext": "", "keywords": "usability trials;task analysis;user interaction;information retrieval;digital maintenance manuals usability;generic task model;navigational aid"}
{"name": "train_1376", "title": "Enhanced product support through intelligent product manuals", "abstract": "The scope of this paper is the provision of intelligent product support within the distributed Intranet/Internet environment. From the point of view of user requirements, the limitations of conventional product manuals and methods of authoring them are first outlined. It is argued that enhanced product support requires new technology solutions both for product manuals and for their authoring and presentation. The concept and the architecture of intelligent product manuals are then discussed. A prototype system called ProARTWeb is presented to demonstrate advanced features of intelligent product manuals. Next, the problem of producing such manuals in a cost-effective way is addressed and a concurrent engineering approach to their authoring is proposed. An integrated environment for collaborative authoring called ProAuthor is described to illustrate the approach suggested and to show how consistent, up-to-date and user-oriented-product manuals can be designed. The solutions presented here enable product knowledge to be captured and delivered to users and developers of product manuals when, where and in the form they need it", "fulltext": "", "keywords": "product knowledge;product manuals;concurrent engineering;intelligent product support;intelligent product manuals;proartweb;technical information"}
{"name": "train_1377", "title": "Open hypermedia for product support", "abstract": "As industrial systems become increasingly more complex, the maintenance and operating information increases both in volume and complexity. With the current pressures on manufacturing, the management of information resources has become a critical issue. In particular, ensuring that personnel can access current information quickly and effectively when undertaking a specific task. This paper discusses some of the issues involved in, and the benefits of using, open hypermedia to manage and deliver a diverse range of information. While the paper concentrates on the problems specifically associated with manufacturing organizations, the problems are generic across other business sectors such as healthcare, defence and finance. The open hypermedia approach to information management and delivery allows a multimedia resource base to be used for a range of applications and it permits a user to have controlled access to the required information in an easily accessible and structured manner. Recent advancement in hypermedia also permits just-in-time support in the most appropriate format for all users. Our approach is illustrated by the discussion of a case study in which an open hypermedia system delivers maintenance and process information to factory-floor users to support the maintenance and operation of a very large manufacturing cell", "fulltext": "", "keywords": "just-in-time support;maintenance;information resources;operating information;open hypermedia;product support"}
{"name": "train_1378", "title": "Development of an Internet-based intelligent design support system for rolling", "abstract": "element bearings This paper presents a novel approach to developing an intelligent agile design system for rolling bearings based on artificial intelligence (AI), Internet and Web technologies and expertise. The underlying philosophy of the approach is to use AI technology and Web-based design support systems as smart tools from which design customers can rapidly and responsively access the systems' built-in design expertise. The approach is described in detail with a novel AI model and system implementation issues. The major issues in implementing the approach are discussed with particular reference to using AI technologies, network programming, client-server technology and open computing of bearing design and manufacturing requirements", "fulltext": "", "keywords": "internet-based intelligent design support system;web technologies;manufacturing requirements;intelligent agile design system;artificial intelligence;smart tools;rolling element bearings;internet technologies;bearing design;client-server technology;network programming"}
{"name": "train_1379", "title": "Web-based intelligent helpdesk-support environment", "abstract": "With the advent of Internet technology, it is now feasible to provide effective and efficient helpdesk service over the global Internet to meet customers' requirements and satisfaction. In this research, we have designed and developed a Web-based intelligent helpdesk-support environment, WebHotLine, to support the customer service centre of a large multinational corporation in the electronics industry. The paper describes the basic architecture of the environment that supports the major functions of Web-based fault information retrieval, online multilingual translation capability, different operating modes of video-conferencing for enhanced support and direct intelligent fault diagnosis by customers or customer support engineers. As a result, WebHotLine helps to save cost in eliminating the expensive overseas telephone charges, reduction in machine down time and number of on-site visits by service engineers as in traditional helpdesk environment", "fulltext": "", "keywords": "webhotline;online multilingual translation capability;web-based fault information retrieval;web-based intelligent helpdesk-support environment;customer service centre;videoconferencing;internet technology"}
{"name": "train_138", "title": "Optical actuation of a bistable MEMS", "abstract": "This paper presents an optical actuation scheme for MEMS devices based on the well-established fact that light possesses momentum, and hence, imparts a force equal to 2 W/c when reflected by a surface. Here, W is the total power of the reflected light, and c is the speed of light. Radiation pressure, as it is known, is nearly insignificant for most macroscale applications, but it can be quite significant for MEMS devices. In addition, light actuation offers a new paradigm. First, intersecting light beams do not interfere, in contrast to electrical conductors, which short when they come into contact. Second, light can operate in high temperature and high radiation environments far outside the capability of solid state electronic components. This actuation method is demonstrated, both in air and in vacuum, by switching the state of a bistable MEMS device. The associated heat transfer model is also presented", "fulltext": "", "keywords": "optical actuation scheme;high temperature environments;mems devices;intersecting light beams;radiation pressure;heat transfer model;high radiation environments;bistable mems"}
{"name": "train_1380", "title": "A feature-preserving volumetric technique to merge surface triangulations", "abstract": "Several extensions and improvements to surface merging procedures based on the extraction of isosurfaces from a distance map defined on an adaptive background grid are presented. The main objective is to extend the application of these algorithms to surfaces with sharp edges and comers. In order to deal with objects of different length scales, the initial background grids are created using a Delaunay triangulation method and local voxelizations. A point enrichment technique that introduces points into the background grid along detected surface features such as ridges is used to ensure that these features are preserved in the final merged surface. The surface merging methodology is extended to include other Boolean operations between surface triangulations. The iso-surface extraction algorithms are modified to obtain the correct iso-surface for multi-component objects. The procedures are demonstrated with various examples, ranging from simple geometrical entities to complex engineering applications. The present algorithms allow realistic modelling of a large number of complex engineering geometries using overlapping components defined discretely, i.e. via surface triangulations. This capability is very useful for grid generation starting from data originated in measurements or images", "fulltext": "", "keywords": "overlapping components;surface intersection;surface triangulations;haemoglobin molecule;arterial surfaces;ridges;surface merging procedures;sharp edges;boolean operations;adaptive background grid;unstructured grids;discrete data;sharp comers;point enrichment technique background grid;iso-surfaces extraction;local voxelizations;simple geometrical entities;complex engineering applications;mesh generation;merge surface triangulations;geometric modelling;images;feature-preserving volumetric technique;delaunay triangulation method;multi-component objects"}
{"name": "train_1381", "title": "An augmented spatial digital tree algorithm for contact detection in", "abstract": "computational mechanics Based on the understanding of existing spatial digital tree-based contact detection approaches, and the alternating digital tree (ADT) algorithm in particular, a more efficient algorithm, termed the augmented spatial digital tree (ASDT) algorithm, is proposed in the present work. The ASDT algorithm adopts a different point representation scheme that uses only the lower comer vertex to represent a (hyper-)rectangle, with the upper comer vertex serving as the augmented information. Consequently, the ASDT algorithm can keep the working space the same as the original n-dimensional space and, in general, a much better balanced tree can be expected. This, together with the introduction of an additional bounding subregion for the rectangles associated with each tree node, makes it possible to significantly reduce the number of node visits in the region search, although each node visit may be slightly more expensive. Three examples arising in computational mechanics are presented to provide an assessment of the performance of the ASDT. The numerical results indicate that the ASDT is, at least, over 3.9 times faster than the ADT", "fulltext": "", "keywords": "spatial binary tree-based contact detection approaches;contact detection;alternating digital tree algorithm;computational mechanics;augmented data structure;upper comer vertex;augmented spatial digital tree algorithm"}
{"name": "train_1382", "title": "Loop restructuring for data I/O minimization on limited on-chip memory embedded", "abstract": "processors In this paper, we propose a framework for analyzing the flow of values and their reuse in loop nests to minimize data traffic under the constraints of limited on-chip memory capacity and dependences. Our analysis first undertakes fusion of possible loop nests intra-procedurally and then performs loop distribution. The analysis discovers the closeness factor of two statements which is a quantitative measure of data traffic saved per unit memory occupied if the statements were under the same loop nest over the case where they are under different loop nests. We then develop a greedy algorithm which traverses the program dependence graph to group statements together under the same loop nest legally to promote maximal reuse per unit of memory occupied. We implemented our framework in Petit, a tool for dependence analysis and loop transformations. We compared our method with one based on tiling of fused loop nest and one based on a greedy strategy to purely maximize reuse. We show that our methods work better than both of these strategies in most cases for processors such as TMS320Cxx, which have a very limited amount of on-chip memory. The improvements in data I/O range from 10 to 30 percent over tiling and from 10 to 40 percent over maximal reuse for JPEG loops", "fulltext": "", "keywords": "embedded processors;loop restructuring;petit;dsp;closeness factor;fused loop nest;data locality;on-chip memory;loop fusion;data i/o minimization;program dependence graph;data traffic"}
{"name": "train_1383", "title": "Semantic data broadcast for a mobile environment based on dynamic and adaptive", "abstract": "chunking Database broadcast is an effective and scalable approach to disseminate information of high affinity to a large collection of mobile clients. A common problem of existing broadcast approaches is the lack of knowledge for a client to determine if all data items satisfying its query could be obtained from the broadcast. We therefore propose a semantic-based broadcast approach. A semantic descriptor is attached to each broadcast unit, called a data chunk. This semantic descriptor allows a client to determine if a query can be answered entirely based on broadcast items and, if needed, identify the precise definition of the remaining items in the form of a \"supplementary\" query. Data chunks can be of static or dynamic sizes and organized hierarchically. Their boundary can be determined on-the-fly, adaptive to the nature of client queries. We investigate different ways of organizing the data chunks over a broadcast channel to improve access performance. We introduce the data affinity index metric, which more accurately reflects client-perceived performance. A simulation model is built to evaluate our semantic-based broadcast schemes", "fulltext": "", "keywords": "answerability;semantic data broadcast;mobile computing;mobile databases;query processing;adaptive chunking;semantic descriptor;data affinity index;mobile clients;data chunking"}
{"name": "train_1384", "title": "Data allocation on wireless broadcast channels for efficient query processing", "abstract": "Data broadcast is an excellent method for efficient data dissemination in the mobile computing environment. The application domain of data broadcast will be widely expanded in the near future, where the client is expected to perform complex queries or transactions on the broadcast data. To reduce the access latency for processing the complex query, it is beneficial to place the data accessed in a query close to each other on the broadcast channel. In this paper, we propose an efficient algorithm to determine the allocation of the data on the broadcast channel such that frequently co-accessed data are not only allocated close to each other, but also in a particular order which optimizes the performance of query processing. Our mechanism is based on the well-known problem named optimal linear ordering. Experiments are performed to justify the benefit of our approach", "fulltext": "", "keywords": "access time;mobile computing;database broadcasting;broadcast program;access latency;tuning time;wireless broadcast channels;query processing"}
{"name": "train_1385", "title": "Cache invalidation and replacement strategies for location-dependent data in", "abstract": "mobile environments Mobile location-dependent information services (LDISs) have become increasingly popular in recent years. However, data caching strategies for LDISs have thus far received little attention. In this paper, we study the issues of cache invalidation and cache replacement for location-dependent data under a geometric location model. We introduce a new performance criterion, called caching efficiency, and propose a generic method for location-dependent cache invalidation strategies. In addition, two cache replacement policies, PA and PAID, are proposed. Unlike the conventional replacement policies, PA and PAID take into consideration the valid scope area of a data value. We conduct a series of simulation experiments to study the performance of the proposed caching schemes. The experimental results show that the proposed location-dependent invalidation scheme is very effective and the PA and PAID policies significantly outperform the conventional replacement policies", "fulltext": "", "keywords": "location-dependent information;cache invalidation;mobile computing;performance evaluation;data caching;cache replacement;semantic caching;mobile location-dependent information services"}
{"name": "train_1386", "title": "When the unexpected happens [disaster planning in banks]", "abstract": "A business disruption can be as simple as a power failure or as complex as a terrorist attack. Regardless, you will need to have a plan to minimize interruptions to both your bank and your customers. Marketers have a role in this readiness process", "fulltext": "", "keywords": "recovery;public relations;planning;disaster planning;banks;emergency management"}
{"name": "train_1389", "title": "The case for activity based management", "abstract": "In today's stormy economic climate businesses need Activity Based Management (ABM) more than ever before. In an economic downturn it is a vital tool for pinpointing a business' most profitable customers, products, regions or channels, as well as uncovering the costs of individual business processes that may need to be improved in order to drive higher profit levels. Changes may be afoot in the ABM market, but Armstrong Laing Group CEO Mike Sherratt argues that businesses need specialists with an ABM focus to keep up with their requirements in such a climate. He looks at what benefits a `best-of-breed' ABM system can offer businesses and contends that businesses must choose carefully when going down the ABM route - and also ask themselves the question whether 'generalist' organisations will be able to deliver the best possible ABM solution", "fulltext": "", "keywords": "armstrong laing group;best-of-breed abm;activity based management;activity based costing"}
{"name": "train_139", "title": "Equilibrium swelling and kinetics of pH-responsive hydrogels: models,", "abstract": "experiments, and simulations The widespread application of ionic hydrogels in a number of applications like control of microfluidic flow, development of muscle-like actuators, filtration/separation and drug delivery makes it important to properly understand these materials. Understanding hydrogel properties is also important from the standpoint of their similarity to many biological tissues. Typically, gel size is sensitive to outer solution pH and salt concentration. In this paper, we develop models to predict the swelling/deswelling of hydrogels in buffered pH solutions. An equilibrium model has been developed to predict the degree of swelling of the hydrogel at a given pH and salt concentration in the solution. A kinetic model has been developed to predict the rate of swelling of the hydrogel when the solution pH is changed. Experiments are performed to characterize the mechanical properties of the hydrogel in different pH solutions. The degree of swelling as well as the rate of swelling of the hydrogel are also studied through experiments. The simulations are compared with experimental results and the models are found to predict the swelling/deswelling processes accurately", "fulltext": "", "keywords": "mechanical properties;filtration/separation;ph-responsive hydrogels;equilibrium model;microfluidic flow;buffered ph solutions;drug delivery;gel size;muscle-like actuators;ionic hydrogels;swelling/deswelling"}
{"name": "train_1390", "title": "Data quality - unlocking the ROI in CRM", "abstract": "While many organisations realise their most valuable asset is their customers, many more fail to realise the importance of auditing, maintaining and updating the information contained in their customer databases. Today's growing awareness in the importance of data quality in relation to CRM and ROI will help change this attitude. In response, CRM vendors will follow suit and begin to differentiate themselves by offering data quality as part of an enterprise-wide data management methodology", "fulltext": "", "keywords": "data management;customer databases;crm;customer relationships;return on investment"}
{"name": "train_1391", "title": "Government budget and accounting information policy and practice in Taiwan", "abstract": "The principal government budget and accounting information policies in Taiwan are founded on the ability to provide integrated, consistent, and timely information for government managers to make more rational decisions concerning national resource allocation and evaluation. A specific accounting organization system has been designed for this purpose. This paper analyzes information policies and practices according to the relevant laws and regulations, identifies issues regarding the policies, and presents strategies to resolve the issues", "fulltext": "", "keywords": "taiwan;accounting information policy;rational decisions;national resource evaluation;national resource allocation;government managers;generally accepted accounting principles;government budget"}
{"name": "train_1392", "title": "Enlisting on-line residents: Expanding the boundaries of e-government in a", "abstract": "Japanese rural township The purpose of this article is to analyze and learn from an unusual way in which local bureaucrats in a Japanese rural township are using the Internet to serve their constituents by enlisting the support of \"on-line residents.\" Successful e-government requires not only rethinking the potential uses of computer technology, but in adopting new patterns of decision-making, power sharing, and office management that many bureaucrats may not be predisposed to make. The main thesis of this article is that necessity and practicality can play a powerful motivational role in facilitating the incorporation of information technology (IT) at the level of local government. This case study of how bureaucrats in Towa-cho, a small, agricultural town in Northeastern Japan, have harnessed the Internet demonstrates clearly the fundamentals of building a successful e-government framework in this rural municipality, similar to many communities in Europe and North America today", "fulltext": "", "keywords": "internet;power sharing;rural municipality;local bureaucrats;japanese rural township;e-government;decision-making;on-line residents;office management;towa-cho"}
{"name": "train_1393", "title": "ERP systems implementation: Best practices in Canadian government organizations", "abstract": "ERP (Enterprise resource planning) systems implementation is a complex exercise in organizational innovation and change management. Government organizations are increasing their adoption of these systems for various benefits such as integrated real-time information, better administration, and result-based management. Government organizations, due to their social obligations, higher legislative and public accountability, and unique culture face many specific challenges in the transition to enterprise systems. This motivated the authors to explore the key considerations and typical activities in government organizations adopting ERP systems. The article adopts the innovation process theory framework as well as the (Markus & Tanis, 2000) model as a basis to delineate the ERP adoption process. Although, each adopting organization has a distinct set of objectives for its systems, the study found many similarities in motivations, concerns, and strategies across organizations", "fulltext": "", "keywords": "innovation process theory framework;administration;social obligations;erp systems implementation;higher legislative accountability;canadian government organizations;result-based management;enterprise resource planning;integrated real-time information;best practices;public accountability"}
{"name": "train_1394", "title": "Subject access to government documents in an era of globalization: intellectual", "abstract": "bundling of entities affected by the decisions of supranational organizations As a result of the growing influence of supranational organizations, there is a need for a new model for subject access to government information in academic libraries. Rulings made by supranational bodies such as the World Trade Organization (WTO) and rulings determined under the auspices of transnational economic agreements such as the North American Free Trade Agreement (NAFTA) often supersede existing law, resulting in obligatory changes to national, provincial, state, and municipal legislation. Just as important is the relationship among private sector companies, third party actors such as nongovernmental organizations (NGOs), and governments. The interaction among the various entities affected by supranational rulings could potentially form the basis of a new model for subject access to government information", "fulltext": "", "keywords": "north american free trade agreement;national legislation;state legislation;government documents;globalization;provincial legislation;supranational organizations;intellectual bundling;world trade organization;municipal legislation;academic libraries;transnational economic agreements"}
{"name": "train_1395", "title": "Work in progress: Developing policies for access to government information in", "abstract": "the New South Africa Following South Africa's transition to democracy in 1994, the SA government has adopted policies supporting freedom of expression and freedom of access to information. The Bill of Rights in the new Constitution includes a constitutional right of access to information held by the state. Since 1994 various initiatives have been taken by government and other bodies to promote such access. These include moves to reorganize government printing and publishing, restructure the government's public information services, make government information available on the Internet, and extend telephony and Internet access to poor communities. SA's new Legal Deposit Act, (1997) makes provision for the creation of official publications depositories. The Promotion of Access to Information Act, (2000) was enacted to ensure access to information held by the state and public bodies. However, despite much activity, it has proved difficult to translate principles into practical and well-coordinated measures to improve access to government information. A specific concern is the failure of policy-makers to visualize a role for libraries", "fulltext": "", "keywords": "government information;internet;official publications depositories;freedom of access to information;public bodies;government publishing;libraries;freedom of expression;constitutional right of access;bill of rights;government printing;south africa;public information services"}
{"name": "train_1396", "title": "Construction of double sampling s-control charts for agile manufacturing", "abstract": "Double sampling (DS) X-control charts are designed to allow quick detection of a small shift of process mean and provides a quick response in an agile manufacturing environment. However, the DS X-control charts assume that the process standard deviation remains unchanged throughout the entire course of the statistical process control. Therefore, a complementary DS chart that can be used to monitor the process variation caused by changes in process standard deviation should be developed. In this paper, the development of the DS s-charts for quickly detecting small shift in process standard deviation for agile manufacturing is presented. The construction of the DS s-charts is based on the same concepts in constructing the DS X-charts and is formulated as an optimization problem and solved with a genetic algorithm. The efficiency of the DS s-control chart is compared with that of the traditional s-control chart. The results show that the DS s-control charts can be a more economically preferable alternative in detecting small shifts than traditional s-control charts", "fulltext": "", "keywords": "double sampling s-control charts;process mean shift detection;genetic algorithm;process standard deviation;double sampling x-control charts;statistical process control;agile manufacturing"}
{"name": "train_1397", "title": "Computer program for calculating the p-value in testing process capability", "abstract": "index C/sub pmk/ Many process capability indices, including C/sub p/, C/sub pk/, and C/sub pm/, have been proposed to provide numerical measures on the process potential and performance. Combining the advantages of these indices, Pearn et al. (1992) introduced a new capability index called C/sub pmk/, which has been shown to be a useful capability index for processes with two-sided specification limits. In this paper, the authors implement the theory of a testing hypothesis using the natural estimator of C/sub pmk/, and provide an efficient Maple computer program to calculate the p-values. They also provide tables of the critical values for some commonly used capability requirements. Based on the test, they develop a simple step-by-step procedure for in-plant applications. The practitioners can use the proposed procedure to determine whether their process meets the preset capability requirement, and make reliable decisions", "fulltext": "", "keywords": "natural estimator;computer program;reliable decisions;in-plant applications;testing hypothesis;process performance;preset capability requirement;p-value calculation;maple;process potential;testing process capability index"}
{"name": "train_1398", "title": "Swamped by data [storage]", "abstract": "While the cost of storage has plummeted, the demand continued to climb and there are plenty of players out there offering solutions to a company's burgeoning storage needs", "fulltext": "", "keywords": "disk capacity management;storage area networks;cost of storage;network attached storage;disk optimisation;it personnel;resource management;file system automation;storage virtualisation"}
{"name": "train_14", "title": "Application of hybrid models for prediction and optimization of enzyme", "abstract": "fermentation process. A comparative study The paper presents a comparison of the biotechnological process prediction and optimization results obtained by using different structure hybrid mathematical models for modeling of the same bioprocess. The hybrid models under investigation consist of the product mass balance equation in which different means - an artificial neural network, fuzzy-neural network and cell age distribution based calculation scheme - are incorporated for modeling the specific biosynthesis rate of a desired product. Experimental data from alpha -amylase laboratory and industrial fermentation processes are used for model parameter identification and the process prediction tests", "fulltext": "", "keywords": "identification;product mass balance equation;industrial processes;bioprocess;fuzzy-neural network;cell age distribution;biosynthesis rate;optimization;enzyme fermentation;hybrid models;mathematical models"}
{"name": "train_140", "title": "A high-resolution high-frequency monolithic top-shooting microinjector free of", "abstract": "satellite drops - part II: fabrication, implementation, and characterization For pt. I, see ibid., vol. 11, no. 5, p. 427-36 (2002). Describes the fabrication, implementation and characterization of a thermal driven microinjector, featuring a bubble check valve and monolithic fabrication. Microfabrication of this microinjector is based on bulk/surface-combined micromachining of the silicon wafer, free of the bonding process that is commonly used in the fabrication of commercial printing head, so that even solvents and fuels can be ejected. Droplet ejection sequences of two microinjectors have been studied along with a commercial inkjet printhead for comparison. The droplet ejection of our microinjector with 10 mu m diameter nozzle has been characterized at a frequency over 35 kHz, at least 3 times higher than those of commercial counterparts. The droplet volume from this device is smaller than 1 pl, 10 times smaller than those of commercial inkjets employed in the consumer market at the time of testing. Visualization results have verified that our design, although far from being optimized, operates in the frequency several times higher than those of commercial products and reduces the crosstalk among neighboring chambers", "fulltext": "", "keywords": "crosstalk;bubble check valve;bonding process;10 micron;thermal driven microinjector;bulk/surface-combined micromachining;consumer market;nozzle;droplet volume;35 khz;satellite drops;monolithic top-shooting microinjector;inkjet printhead"}
{"name": "train_1402", "title": "Web talk is cheap", "abstract": "Web technology provides a wealth of opportunities for reaching potential customers. So how do you make it work for your business?", "fulltext": "", "keywords": "web chat;website;customer service representative;collaborative browsing;call centre"}
{"name": "train_1403", "title": "IT: Utilities", "abstract": "A look at five utilities to make your PCs more, efficient, effective, and efficacious", "fulltext": "", "keywords": "easynotes;download accelerator plus;utilities;print shop pro;post-it software;mobilemessenger;pcs"}
{"name": "train_1404", "title": "Creating the right mail model", "abstract": "If you know your post room is not as efficiently organised as it might be, but you are not sure how best to go about making improvements, then consider this advice from John Edgar of consultant MCS", "fulltext": "", "keywords": "post room;mail;consultant;mcs"}
{"name": "train_1405", "title": "Winning post [mail systems]", "abstract": "Businesses that take their mail for granted can end up wasting money as well as opportunities. Mike Stecyk, VP of marketing and lines of business at Pitney Bowes, suggests strategies for making more of a great opportunity", "fulltext": "", "keywords": "direct mail shots;mail;inserters;franking machines;folders;strategies;pitney bowes"}
{"name": "train_1406", "title": "Bluetooth bites back", "abstract": "It is now more than four years since we started to hear about Bluetooth, and from the user's point of view very little seems to have happened since then. Paul Haddlesey looks at the progress, and the role Bluetooth may eventually play in your firm's communications strategy", "fulltext": "", "keywords": "bluetooth;wireless connection;mobile;communications strategy"}
{"name": "train_1407", "title": "Soft options for software upgrades?", "abstract": "Several new products claim to take the work out of installing software and patches, and even migrating operating systems. Software migration products fall into two broad categories. The drive imaging type is designed to make exact copies of a hard disk, either an entire drive or certain directories, so you can use it to back up data. The application management type is designed for more incremental upgrades and often provides additional features such as the ability to monitor or control users' access to applications", "fulltext": "", "keywords": "microsoft windows;software installation;software upgrades;operating systems migration"}
{"name": "train_1408", "title": "PKI: coming to an enterprise near you?", "abstract": "For many years public key infrastructure (PKI) deployments were the provenance of governments and large, security-conscious corporations and financial institutions. These organizations have the financial and human resources necessary to successfully manage the complexities of a public key system. Lately however, several forces have converged to encourage a broader base of enterprises to take a closer look at PKI. These forces are discussed. PKI vendors are now demonstrating to customers how they can make essential business applications faster and more efficient by moving them to the Internet-without sacrificing security. Those applications usually include secure remote access, secure messaging, electronic document exchange, transaction validation, and network authentication. After a brief discussion of PKI basics the author reviews various products available on the market", "fulltext": "", "keywords": "verisign;electronic document exchange;public key infrastructure;pki;rsa security;geotrust;ipsec vpns;network authentication;entrust;security;secure remote access;business-critical applications;transaction validation;baltimore technologies;pki vendors;e-commerce;secure messaging"}
{"name": "train_1409", "title": "North American carrier survey: simply the best", "abstract": "Network Magazine carried out a North American carrier survey. Thousands of network engineers gave information on providers' strengths and weaknesses across seven services: private lines, frame relay, ATM, VPNs, dedicated Internet access, Ethernet services, and Web hosting. Respondents also ranked providers on their ability to perform in up to eight categories including customer service, reliability, and price. Users rated more than a dozen providers for each survey. Carriers needed to receive at least 30 votes for inclusion in the survey. Readers were asked to rate carriers on up to nine categories using a scale of 1 (unacceptable) to 5 (excellent). Not all categories are equally important. To try and get at these differences, Network Magazine asked readers to assign a weight to each category. The big winners were VPNs", "fulltext": "", "keywords": "private lines;service providers;atm;price;dedicated internet access;customer service;vpns;web hosting;north american carrier survey;frame relay;ethernet services;reliability"}
{"name": "train_141", "title": "A high-resolution high-frequency monolithic top-shooting microinjector free of", "abstract": "satellite drops - part I: concept, design, and model Introduces an innovative microinjector design, featuring a bubble valve, which entails superior droplet ejection characteristics and monolithic fabrication, which allows handling of a wide range of liquids. This new microinjector uses asymmetric bubbles to reduce crosstalk, increase frequency response and eliminate satellite droplets. During a firing, i.e., droplet ejection, the \"virtual valve\" closes, by growing a thermal bubble in the microchannel, to isolate the microchamber from the liquid supply and neighboring chambers. Between firings, however, the virtual valve opens, by collapsing the bubble, to reduce flow restriction for fast refilling of the microchamber. The use of bubble valves brings about fast and reliable device operation without imposing the significant complication fabrication of physical microvalves would call for. In addition, through a special heater configuration and chamber designs, bubbles surrounding the nozzle cut off the tail of the droplets being ejected and completely eliminate satellite droplets. A simple one-dimensional model of the operation of the microinjector is used to estimate the bubble formation and liquid refilling", "fulltext": "", "keywords": "frequency response;flow restriction;bubble valve;virtual valve;asymmetric bubbles;liquid refilling;crosstalk;droplet ejection characteristics;satellite droplets;chamber designs;monolithic top-shooting microinjector;thermal bubble jet;inkjet printing"}
{"name": "train_1410", "title": "WAM!Net: private pipes for electronic media", "abstract": "\"We are the digital version of FedEx. We offer storage and intelligent workflow.\" The United States military - especially during war time - is pretty careful about the way it handles its workflow and communications. Before a company is awarded a government contract, the company and its technology are screened and verified. If the technology or its creators aren't trustworthy and secure, chances are they aren't getting by Uncle Sam. Record companies and publishing houses tend to feel the same way. After all, security is just as important to a record executive as it is to a Navy commander. WAM!Net, a Wide-Area Media network (hence, the name) passes muster with both. The company, which employs about 320 employees around the world, has 15000 customers including the US Navy and a host of record labels, publishing companies, healthcare providers, and advertising agencies, all of whom use its network as a way to transport, store, and receive data. \"We are the digital version of FedEx. We offer storage and intelligent workflow,\" says Murad Velani, executive vice president of sales and marketing for WAM!Net. \"We started out as purely transport and we've become a digital platform.\"", "fulltext": "", "keywords": "atm technology;advertising agencies;digital platform;healthcare providers;publishing companies;wide-area media network;client-server format;content information;content creators;intelligent workflow;record labels;u.s. navy;publishing information;wam!net;high-speed private network;asp format;united states military;electronic media"}
{"name": "train_1411", "title": "Speedera: Web without the wait", "abstract": "There's no greater testament to the utility of the Internet than the fact that hundreds of millions of people worldwide are willing to wait for Web pages as they build incrementally on screen. But while users may put up with the \"World Wide Wait,\" they definitely don't like it. That's where Content Delivery Networks come in. CDNs can't turn a footpath into a freeway, but they can help data in transit take advantage of shortcuts and steer clear of traffic jams. And while enhancing the responsiveness of Web interaction, CDNs also enhance the prospects of their clients, who need engaged visitors to keep their Web-based business models afloat. \"Our mission is to improve the quality of the Internet experience for end-users,\" says Gordon Smith, vice president of marketing at Speedera Networks in Santa Clara, California, \"and to enable Web-site operators to provide better delivery quality, performance, scalability, and security through an outsourced service model that slashes IT costs.\"", "fulltext": "", "keywords": "delivery quality;web-site operators;outsourced service model;scalability;internet experience;content delivery networks;security;web interaction;world wide web;web-based business models"}
{"name": "train_1412", "title": "Arbortext: enabler of multichannel publishing", "abstract": "A company has a document-say, dosage instructions for a prescription drug or a troubleshooting sheet for a DVD drive. That document starts its life in a predictable format, probably Microsoft Word or WordPerfect, but then-to meet the needs of readers who nowadays demand access via multiple devices-the material has to be translated into many more formats: HTML, PageMaker, or Quark, possibly RTF, almost certainly PDF, and nowadays, next-generation devices (cell phones, handheld computers) also impose their own requirements. And what if, suddenly, the dosage levels change or new workarounds emerge to handle DVD problems? That's when a company should put in a call to Arbortext, a 20-year-old Ann Arbor, Michigan-based company that exists to solve a single problem: helping clients automate multichannel publishing", "fulltext": "", "keywords": "arbortext;document format;multichannel publishing;content assets;next-generation devices"}
{"name": "train_1413", "title": "Web content extraction. A WhizBang! approach", "abstract": "The extraction technology that Whizbang uses consists of a unique approach to scouring the Web for current, very specific forms of information. FlipDog, for example, checks company Web sites for hyperlinks to pages that list job opportunities. It then crawls to the deeper page and, using the WhizBang! Extraction Framework, extracts the key elements of the postings, such as job title, name of employer, job category, and job function. Click on a job and you are transferred to the company Web site to view the job description as it appears there", "fulltext": "", "keywords": "flipdog;company web sites;job description;job-hunting site;whizbang! extraction framework;web content extraction"}
{"name": "train_1414", "title": "Survey says! [online world of polls and surveys]", "abstract": "Many content managers miss the fundamental interactivity of the Web by not using polls and surveys. Using interactive features-like a poll or quiz-offers your readers an opportunity to become more engaged in your content. Using a survey to gather feedback about your content provides cost-effective data to help make modifications or plot the appropriate course of action. The Web has allowed us to take traditional market research and turn it on its ear. Surveys and polls can be conducted faster and cheaper than with telephone and mail. But if you are running a Web site, should you care about polls and surveys? Do you know the difference between the two in Web-speak?", "fulltext": "", "keywords": "content managers;surveys;polls;world wide web;site feedback;site owners"}
{"name": "train_1415", "title": "The disconnect continues [digital content providers]", "abstract": "The relationships between the people who buy digital content and those who sell it are probably more acrimonious than ever before, says Dick Curtis, a director and lead analyst for the research firm Outsell Inc., where he covers econtent contract and negotiation strategies. Several buyers agree with his observation. They cite aggressive sales tactics, an unwillingness to deliver content in formats buyers need, a reluctance to provide licensing terms that take into account the structure of today's corporations, and inadequate service and support as a few of the factors underlying the acrimony. Still, many buyers remain optimistic that compromises can be reached on some of these issues. But first, they say, sellers must truly understand the econtent needs of today's enterprises", "fulltext": "", "keywords": "econtent negotiation;news databases;econtent buyers;econtent contract;web site;sales tactics;digital content"}
{"name": "train_1416", "title": "Look into the future of content management", "abstract": "Predictions of consolidation in the Content Management (CM) vendor arena have appeared in nearly every major industry prognosis over the past two years. Gartner Group, for example, recently reiterated its prediction that half the CM vendors in existence in mid-2001 would leave the marketplace by the end of 2002. Analysts consistently advise prospective CM buyers to tread carefully because their vendor may not stick around. But fortunately, the story goes, fewer vendor choices will finally bring greater clarity and sharper differentiators to this otherwise very messy product landscape. In fact, the number of CM vendors continues to rise. Industry growth has come through greater demand among CM buyers, but also expanding product functionality as well as successful partnerships. The marketplace certainly cannot sustain its current breadth of vendors in the long run, yet it remains unclear when and how any serious industry consolidation will occur. In the meantime, evolving business models and feature sets have created just the kind of clearer segmentation and transparent product differences that were supposed to emerge following an industry contraction", "fulltext": "", "keywords": "content management;enterprise systems;industry consolidation;product functionality;partnerships"}
{"name": "train_1417", "title": "Craigslist: virtual community maintains human touch", "abstract": "If it works why change it? This might have been the thought on the minds of dot com executives back when Internet businesses were booming, and most of the Web content was free. Web sites were overflowing with advertisements of every kind and size. Now that dot com principals know better, Web ads are no longer the only path to revenue generation. Community portals, however, never seemed to have many ads to begin with, and their content stayed truer to who they served. Many of them started off as simple places for users to list announcements, local events, want ads, real estate, and mingle with other local users. The author saw the need for San Franciscans to have a place to do all of that for free, without any annoying advertising, and ended up offering much more to his community with the creation of craigslist. \"[Polling users] was a good way for us to connect with our members, this is the way to operate successfully in situations like these - your members come first.\"", "fulltext": "", "keywords": "craigslist;web content;announcements;virtual community;real estate;revenue generation;local events;san francisco bay community;community portals;internet businesses;want ads"}
{"name": "train_1418", "title": "Documentum completes CM Trifecta", "abstract": "Daily, people participating in clinical trials for drug companies fill out forms describing how they feel physically and emotionally. For some trials, there are hundreds, possibly thousands, of participants. The drug companies must compile all the forms and submit them electronically to the FDA. That's where Documentum comes in. \"We've streamlined the whole process of managing clinical trial content for companies, such as Johnson & Johnson, Bristol Myers Squibb, and Pfizer,\" notes Documentum's president and CEO Dave De Walt. \"And by the way, the FDA also is one of our customers, as well as the EPA and the FAA.\" And there are about 1,300 other organizations in various industries worldwide that rely on Documentum's technologies, consulting, and training services. The company's products are designed to manage digital content and facilitate online transactions, partner and supplier relationships, and ebusiness interactions", "fulltext": "", "keywords": "clinical trial content;fda;drug companies;clinical trials;documentum;consulting services;training services"}
{"name": "train_1419", "title": "PacketVideo. One step ahead of the streaming wireless market", "abstract": "Go beyond the hype, however, and it's clear that PacketVideo is making strides in delivering streaming multimedia content to wireless devices. For one thing, its technology, based on the industry-standard Motion Pictures Expert Group 4 (MPEG-4) video encoder/decoder, actually works as promised. Secondly, the company has forged a broad-based band of alliances that not only will eventually help it reach potential customers down the road, but provides it financial support until the company can ramp up sales. The list of PacketVideo's technology partners who are also investors-and who have pumped more than $121 million into the company-includes not just wireless device manufacturers, but content providers and semiconductor vendors, all of whom stand to benefit by increased sales of handheld wireless terminals", "fulltext": "", "keywords": "content providers;multimedia content streaming;mpeg-4;semiconductor vendors;wireless device manufacturers;handheld wireless terminals;packetvideo;wireless devices"}
{"name": "train_142", "title": "Surface micromachined paraffin-actuated microvalve", "abstract": "Normally-open microvalves have been fabricated and tested which use a paraffin microactuator as the active element. The entire structure with nominal dimension of phi 600 mu m * 30 mu m is batch-fabricated by surface micromachining the actuator and channel materials on top of a single substrate. Gas flow rates in the 0.01-0.1 sccm range have been measured for several devices with actuation powers ranging from 50 to 150 mW on glass substrates. Leak rates as low as 500 mu sccm have been measured. The normally-open blocking microvalve structure has been used to fabricate a precision flow control system of microvalves consisting of four blocking valve structures. The control valve is designed to operate over a 0.01-5.0 sccm flow range at a differential pressure of 800 torr. Flow rates ranging from 0.02 to 4.996 sccm have been measured. Leak rates as low as 3.2 msccm for the four valve system have been measured", "fulltext": "", "keywords": "gas flow rates;normally-open microvalves;30 micron;blocking valve structures;800 torr;differential pressure;surface micromachined microvalve;channel materials;active element;600 micron;paraffin microactuator;50 to 150 mw;leak rates;actuation powers;flow rates"}
{"name": "train_1420", "title": "PDF subscriptions bolster revenue", "abstract": "In 1999 SD Times offered prospective subscribers the option of receiving their issues as Adobe Acrobat PDF files. What set the proposal apart from what other publishers were doing electronically on the Web was that readers would get the entire version of the paper-including both advertising and editorial just as it looked when it was laid out and went to press. SD Times is only one of a small, but growing, number of publications that are taking on the electronic world and finding success. In the past six months alone, the New York Times, Popular Mechanics, trade magazine Electronic Buyers' News, and the Harvard Business Review have launched digital versions of their newspapers and magazines to augment their online and print versions. The reasons are as varied as the publishers themselves. Some companies are finding that readers don't like their Web-based versions either due to poor navigation or missing graphics and images. Others want to expand their publications nationally and internationally, but don't want the added cost of postage and printing. Still others are looking for ways to give advertisers additional visibility and boost advertising and subscription revenues. No matter what the reason, it's a trend worth watching", "fulltext": "", "keywords": "newspaper;electronic issue;sd times;digital versions;adobe acrobat pdf files;pdf subscriptions;magazines"}
{"name": "train_1421", "title": "Extracting linguistic DNA: NStein goes to work for UPI", "abstract": "It's a tantalizing problem for categorization. United Press International (UPI) has more than 700 correspondents creating thousands of stories every week, running the gamut from business news to sports to entertainment to global coverage of America's war on terrorism. And while UPI and others news services have mechanisms for adding keywords and categorizing their content, UPI recognized a need to add more automation to the process. With the recent growth and improvement in tools for Computer-Aided Indexing (CAI), UPI undertook a process of looking at its needs and evaluating the many CAI tools out there. In the end, they chose technology from Montreal-based NStein Technologies. \"Our main objective was to acquire the best CAI tool to help improve our customers' access and interaction with our content,\" says Steve Sweet, CIO at UPI. \"We examined a number of solutions, and NStein's NServer suite clearly came out on top. The combination of speed, scalability, accuracy, and flexibility was what really sold us.\"", "fulltext": "", "keywords": "wire service stories;computer-aided indexing;electronic archive;united press international;nstein technologies;upi"}
{"name": "train_1422", "title": "Taxonomy's role in content management", "abstract": "A taxonomy is simply a way of classifying things. Still, there is a rapidly growing list of vendors offering taxonomy software and related applications. They promise many benefits, especially to enterprise customers: Content management will be more efficient. Corporate portals will be enhanced by easily created Yahoo!-like directories of internal information. And the end-user experience will be dramatically improved by more successful content retrieval and more effective knowledge discovery. But today's taxonomy products represent emerging technologies. They are not out-of-the-box solutions. And even the most automated systems require some manual assistance from people who know how to classify content", "fulltext": "", "keywords": "content management;corporate portals;effective knowledge discovery;internal information;enterprise customers;taxonomy applications;taxonomy software"}
{"name": "train_1423", "title": "P2P is dead, long live P2P", "abstract": "Picture the problem: a sprawling multinational has hundreds of offices, thousands of workers, and countless amounts of intellectual property scattered here, there, everywhere. In Kuala Lumpur an executive needs to see an internally-generated report on oil futures in central Asia-but where is it? London? New York? Moscow? With a few clicks of the mouse-and the right P2P technology deployed in-house-that executive will find and retrieve the report. Without P2P that might be impossible-certainly it would be time-consuming-and, right there, the argument for P2P implementations inside enterprises becomes clear. Who are the players? No companies have managed to stake out clear leads and the fact is that the P2P marketplace now is up for grabs-but the exciting news is that a range of small and startup businesses are trying to grab turf and quite probably, if the analysts are right, a few of these now little-known companies will emerge as digital content stars within the next few years. Cases in point: Groove Networks, Avaki, WorldStreet, Yaga, NextPage, and Kontiki. Very different companies-their approach to the markets radically differ-but, say the analysts, each is worth a close look because among them they are defining the future of P2P", "fulltext": "", "keywords": "content owners;worldstreet;businesses;p2p technology;avaki;kontiki;yaga;nextpage;digital content;groove networks"}
{"name": "train_1424", "title": "FinancialContent. Credibility is king", "abstract": "If you went to a site named Financialcontent.com, you'd probably expect to find, well, financial content. Maybe stock prices or company earnings or market charts or economic statistics or corporate news reports. Well, you'd be partially correct. Financialcontent.com does deal in financial information, but its main objective is not to distribute its financial content to individual investors, but to distribute it through other Web sites. In other words, FinancialContent is a wholesaler, not a retailer. As an aggregator, FinancialContent provides partner sites with financial information that is tailored to that individual Web site", "fulltext": "", "keywords": "partner sites;aggregator;web sites;financial information;financialcontent.com"}
{"name": "train_1425", "title": "Kontiki. Shortcuts for content's trip to the edge", "abstract": "When electronic files get zapped from one location to another, you probably aren't thinking about the physical distance they must travel-or how that distance might affect the time it takes to get there. But if you work for CDN company Kontiki, this is just about all you think about. Championing a P2P-like \"bandwidth harvesting\" technology, Kontiki has figured out how to not only quickly distribute content to the \"edge\" but to utilize a combination of centralized servers and a network of enduser machines to collect, or \"harvest,\" underutilized bandwidth and make redundant file requests more efficient", "fulltext": "", "keywords": "redundant file requests;p2p-like bandwidth harvesting technology;underutilized bandwidth;kontiki;electronic files;centralized servers;enduser machines"}
{"name": "train_1426", "title": "Groove Networks. Matching technology with human needs", "abstract": "If what has been occurring in information technology during the past decade or so can be classified as the \"Information Age,\" then going forward, I believe it's going to be viewed more as the \"connection age\",\" says Ray Ozzie, CEO and chairman of Groove Networks, the Beverly, Massachusetts company that produces collaboration software. \"We're all going to be thinking more about the connections between people and the connections between companies,\" Ozzie says. \"Our mission has two parts: to help businesses achieve a greater \"return on connection\" from their relationships with customers, vendors, and partners; and to help individuals strengthen online connections with the people with whom they interact.\"", "fulltext": "", "keywords": "server products;online collaboration;businesses;organizational perspective;collaborative technologies;online connections;personal perspective;knowledge work;groove networks;inking technology"}
{"name": "train_1427", "title": "Training for trouble", "abstract": "In a security context, one example of digitized video's integration into a networked knowledge base is found in the Accident Response Group (ARG) at Sandia National Labs. A \"national security laboratory\" headquartered in Albuquerque, New Mexico, Sandia is operated by Lockheed Martin and primarily funded by the U.S. Department of Energy. The organization handles research, design and development of all non-nuclear components used in U.S. nuclear weapons programs, and is involved as well in programs related to energy, critical infrastructure, non-proliferation, materials control, and emerging threats. ARG's searchable video database has been implemented using the Screening Room package of applications from Convera in Vienna, Virginia. Formed in December 2000 from Excalibur Technologies and Intel's Interactive Media Services Division, Convera targets corporate and institutional markets with products for securely accessing, indexing, and searching rich media content-text, images, audio, and video-across interconnected computer networks. Among its public-sector clients are the FBI, NASA, the Nuclear Regulatory Commission, U.S. military services, the Departments of Justice and State, and various domestic and foreign intelligence agencies", "fulltext": "", "keywords": "rich media content;digitized video integration;accident response group;national security laboratory;screening room package;sandia national labs;public-sector clients;u.s. nuclear weapons programs;searchable video database;networked knowledge base"}
{"name": "train_1428", "title": "Syndicators turn to the enterprise", "abstract": "Syndicators have started reshaping offerings, products, and services towards the marketplace that was looking for enterprise-wide content syndication technology and service. Syndication companies are turning themselves into infrastructure companies. Many syndication companies are now focusing their efforts on enterprise clients instead of the risky dot coms", "fulltext": "", "keywords": "business web sites;aggregator;infrastructure companies;customer base;enterprise-wide content syndication technology;business model;enterprise clients"}
{"name": "train_1429", "title": "Online coverage of the Olympic Games", "abstract": "In 1956 a new medium was evolving which helped shape not only the presentation of the Games to a worldwide audience, but created entirely new avenues for marketing and sponsorship which changed the entire economic relevance of the Games. The medium in 1956 was television, and the medium now, of course, is the Internet. Not since 1956 has Olympic coverage been so impacted by the onset of new technology as the current Olympiad has been. But now the IOC finds itself in another set of circumstances not altogether different from 1956", "fulltext": "", "keywords": "online coverage;sponsorship;olympiad;online rights;marketing;e-broadcast;economic relevance;ioc;olympic games"}
{"name": "train_143", "title": "An automated irradiation device for use in cyclotrons", "abstract": "Two cyclotrons are being operated at IPEN-CNEN/SP: one model CV-28, capable of accelerating protons with energies up to 24 MeV and beam currents up to 30 mu A, and three other particles; the other one, model Cyclone 30, accelerates protons with energy of 30 MeV and currents up to 350 mu A. Both have the objective of irradiating targets both for radioisotope production for use in nuclear medicine and general research. The development of irradiating systems completely automatized was the objective of this work, always aiming to reduce the radiation exposition dose to the workers and to increase the reliability of use of these systems", "fulltext": "", "keywords": "protons;cv-28;cyclone 30;automated irradiation device;radiation exposition dose;radioisotope production;nuclear medicine;general research;cyclotrons"}
{"name": "train_1430", "title": "The free lunch is over: online content subscriptions on the rise", "abstract": "High need, rather than high use, may be what really determines a user's willingness to pay. Retooling and targeting content may be a sharper strategy than trying to re-educate users that it is time to pay up for material that has been free. Waiting for a paradigm shift in general user attitudes about paying for online content Could be a fool's errand", "fulltext": "", "keywords": "content targeting;pay-to-play business models;online content subscriptions;content retooling"}
{"name": "train_1431", "title": "Cataloguing to help law library users", "abstract": "The author takes a broader view of the catalogue than is usual; we can include within it items that have locations other than the office/library itself. This may well start with Internet resources, but can perfectly appropriately continue with standard works not held in the immediate collection but available in some other accessible collection, such as the local reference library. The essential feature is to include entries for the kind of material sought by users, with the addition of a location mark indicating where they can find it", "fulltext": "", "keywords": "law library users;internet resources;location mark;reference library;cataloguing"}
{"name": "train_1432", "title": "To classify or not to classify, that is the question?", "abstract": "In addressing classification issues, the librarian needs to decide what best suits the purpose and requirements of the user group and the organisation they work in. The author has used the well-established Moys Classification Scheme. This gives the level of detail required for current stock and allows for the incorporation of new material as the firm's specialisations develop. The scheme is widely used in other firms as well as in the local law society library, so it will be familiar to many users", "fulltext": "", "keywords": "law society library;moys classification scheme"}
{"name": "train_1433", "title": "The role and future of subject classification: the exploitation of resources", "abstract": "It is imperative that the library information systems (LIS) profession and LIS educators appreciate fully the contribution that classification makes to the discipline and that it is no longer seen as the domain of the academic, isolated theorist, but becomes an integral part of our understanding of the contribution that the LIS community can make to society as a whole - as well as to particular areas such as legal information", "fulltext": "", "keywords": "lis;legal information;information resources;library information systems;subject classification"}
{"name": "train_1434", "title": "A simple etalon-stabilized visible laser diode", "abstract": "Visible laser diodes (LDs) are inexpensively available with single-transverse-mode, single-longitudinal-mode operation with a coherence length in the metre range. With constant current bias and constant operating temperature, the optical output power and operating wavelength are stable. A simple and inexpensive way is developed to maintain a constant LD temperature as the temperature of the local environment varies, by monitoring the initially changing wavelength with an external etalon and using this information to apply a heating correction to the monitor photodiode commonly integral to the LD package. The fractional wavelength stability achieved is limited by the solid etalon to 7*10/sup -6/ degrees C/sup -1/", "fulltext": "", "keywords": "heating correction;constant operating temperature;visible laser diode;index-guided multi-quantum-well;fractional wavelength stability;closed-loop operation;constant current bias;etalon-stabilized laser diode;feedback loop;single-transverse-mode;monitor photodiode;single-longitudinal-mode"}
{"name": "train_1435", "title": "Experimental investigations on monitoring and control of induction heating", "abstract": "process for semi-solid alloys using the heating coil as sensor A method of monitoring the state of metal alloys during induction heating and control of the heating process utilizing the heating coil itself as a sensor is proposed, and its usefulness and effectiveness were experimentally investigated using aluminium A357 billets for the semi-solid metal (SSM) casting processes. The impedance of the coil containing the billet was continuously measured by the proposed method in the temperature range between room temperature and 700 degrees C. It was found that the reactance component of the impedance varied distinctively according to the billet state and could clearly monitor the deformation of the billet, while the resistance component increased with temperature, reflecting the variation of the resistivity of the billet which has strong correlation to the solid/liquid fraction of the billets. The measured impedance is very sensitive to the billet states such as temperature, deformation and solid/liquid fraction and could be used as a parameter to monitor and control the heating process for SSMs", "fulltext": "", "keywords": "process control;coil impedance;solenoid coil;20 to 700 c;induction heating process;resistance component;billet deformation;solid/liquid fraction;heating coil sensor;semisolid alloys;billet state;semisolid metal casting;resistivity variation;reactance component;process monitoring"}
{"name": "train_1436", "title": "Modelling tomographic cone-beam projection data from a polyhedral phantom", "abstract": "Analytical phantoms are used to generate projection data for testing reconstruction accuracy in computed axial tomography. A circular source locus (equivalent to rotating specimen with a fixed source) provides insufficient data for 'exact' reconstruction in cone-beam transmission tomography, thus phantom data are useful for studying the consequent errors and also for investigating alternative scanning loci and reconstruction techniques. We present an algorithm that can compute phantom cone-beam projection data from a phantom comprising geometrically defined polyhedra. Each polyhedron is defined as a set of polygons enclosing a volume of fixed linear attenuation coefficient. The algorithm works by projecting each polygon in turn onto the modelled detector array, which accumulates the product of source to polygon intersection distance (for the rays intersecting each detector element), linear attenuation coefficient and sign of projected polygon area (indicating whether rays enter or exit the polyhedron at this face). The phantom data are rotated according to the projection angle, whilst the source location and detector plane remain fixed. Polyhedra can be of simple geometric form, or complex surfaces derived from 3D images of real specimens. This algorithm is illustrated using a phantom comprising 989 238 polygons, representing an iso-surface generated from a microtomographic reconstruction of a piece of walrus tusk", "fulltext": "", "keywords": "x-ray attenuation;alternative scanning loci;cumulative pixel array;tomographic cone-beam projection data;walrus tusk;reconstruction accuracy;polyhedral phantom;computed axial tomography;linear attenuation coefficient;reconstruction software accuracy;cone-beam transmission tomography;geometry file;microtomographic reconstruction;interpolation;geometrically defined polyhedra"}
{"name": "train_1437", "title": "Improving the frequency stability of microwave oscillators by utilizing the", "abstract": "dual-mode sapphire-loaded cavity resonator The design and experimental testing of a novel control circuit to stabilize the temperature of a sapphire-loaded cavity whispering gallery resonator-oscillator and improve its medium-term frequency stability is presented. Finite-element software was used to predict frequencies and quality factors of WGE/sub 7,0,0/ and the WGH/sub 9,0,0/ modes near 9 GHz, and separated in frequency by approximately 80 MHz. Calculations show that the novel temperature control circuits from the difference frequency can result in a frequency stability of better than one part in 10/sup 13/ at 270 K. Also, we present details on the best way to couple orthogonally to two modes of similar frequency but different polarization", "fulltext": "", "keywords": "whispering gallery modes;frequency standard;9 ghz;high-quality factor;finite-element analysis;dual-mode sapphire-loaded cavity resonator;270 k;temperature control circuit;microwave oscillators;difference frequency;temperature stabilisation;frequency stability;whispering gallery resonator-oscillator"}
{"name": "train_1438", "title": "Three-dimensional particle image tracking for dilute particle-liquid flows in a", "abstract": "pipe A three-dimensional (3D) particle image tracking technique was used to study the coarse spherical particle-liquid flows in a pipe. The flow images from both the front view and the normal side view, which was reflected into the front view by a mirror, were recorded with a CCD camera and digitized by a PC with an image grabber card. An image processing program was developed to enhance and segment the flow image, and then to identify the particles. Over 90% of all the particles can be identified and located from the partially overlapped particle images using the circular Hough transform. Then the 3D position of each detected particle was determined by matching its front view image to its side view image. The particle velocity was then obtained by pairing its images in successive video fields. The measurements for the spherical expanded polystyrene particle-oil flows show that the particles, like the spherical bubbles in laminar bubbly flows, tend to conglomerate near the pipe wall and to line up to form the particle clusters. As liquid velocity decreases, the particle clusters disperse and more particles are distributed in the pipe centre region", "fulltext": "", "keywords": "ccd camera;image segmentation;spherical expanded polystyrene particle;spherical bubble;particle clusters;image recognition;3d position;hough transform;image matching;three-dimensional particle image tracking;two-phase flow;region growing technique;stereo-imaging technique;pipe flow;wiener filter;phase distribution;dilute particle-liquid flows"}
{"name": "train_1439", "title": "On-line robust processing techniques for elimination of measurement drop-out", "abstract": "When processing measurement data, it is usually assumed that some amount of normally distributed measurement noise is present. In some situations, outliers are present in the measurements and consequently the noise is far from normally distributed. In this case classical least-squares procedures for estimating Fourier spectra (or derived quantities like the frequency response function) can give results which are inaccurate or even useless. In this paper, a novel technique for the on-line processing of measurement outliers will be proposed. Both the computation speed and the accuracy of the technique presented will be compared with different classical approaches for handling outliers in measurement data (i.e. filtering techniques, outlier rejection techniques and robust regression techniques). In particular, all processing techniques will be validated by applying them to the problem of speckle drop-out in optical vibration measurements (performed with a laser Doppler vibrometer), which typically causes outliers in the measurements", "fulltext": "", "keywords": "on-line robust processing techniques;iterative technique;speckle dropout;classical least-squares procedures;modal analysis;robust regression;laser doppler vibrometer;laser interferometer;measurement outliers;broadband excitation;sinusoidal excitation;median filtering;order statistics;vibration velocity;low-pass filtering;frequency response function;frequency spectra;computation speed;fourier spectra;measurement dropout elimination;signal sampling;optical vibration measurements;normally distributed measurement noise"}
{"name": "train_144", "title": "Development of a 3.5 inch magneto-optical disk with a capacity of 2.3 GB", "abstract": "The recording capacity of GIGAMO media was enlarged from 1.3 GB to 2.3 GB for 3.5 inch magneto-optical (MO) disks while maintaining downward compatibility. For the new GIGAMO technology, a land and groove recording method was applied in addition to magnetically induced super resolution (MSR) media. Furthermore, a novel address format suitable for the land and groove recording method was adopted. The specifications of the new GIGAMO media were examined to satisfy requirements for practical use with respect to margins. Durability of more than 10/sup 6/ rewritings and an enough lifetime were confirmed", "fulltext": "", "keywords": "2.3 gb;lifetime;land-groove recording method;recording capacity;crosstalk;mo disks;address format;magneto-optical disk;gigamo media;magnetically induced super resolution;rewriting durability;3.5 inch;msr;sin-gdfeco-gdfe-tbfeco-sin-al"}
{"name": "train_1440", "title": "Application of ultrasonic sensors in the process industry", "abstract": "Continuous process monitoring in gaseous, liquid or molten media is a fundamental requirement for process control. Besides temperature and pressure other process parameters such as level, flow, concentration and conversion are of special interest. More qualified information obtained from new or better sensors can significantly enhance the process quality and thereby product properties. Ultrasonic sensors or sensor systems can contribute to this development. The state of the art of ultrasonic sensors and their advantages and disadvantages will be discussed. Commercial examples will be presented. Among others, applications in the food, chemical and pharmaceutical industries are described. Possibilities and limitations of ultrasonic process sensors are discussed", "fulltext": "", "keywords": "process control;acoustic microsensors;pharmaceutical industries;ultrasonic attenuation;acoustic impedance;temperature measurement;level measurement;pressure measurement;continuous process monitoring;distance measurement;chemical industries;process industry;ultrasonic measurements;process quality;flow measurement;ultrasonic sensors application;food industries"}
{"name": "train_1441", "title": "Handles and exception safety, Part 1. A simple handle class", "abstract": "Every C++ program that uses inheritance must manage memory somehow. The most obvious way to do so is directly, but programmers who create complicated data structures often have trouble figuring out what parts of those data structures are safe to delete when. The classical method of dealing with such complexity is to hide it in a class. Such classes are typically called handles; the idea is to attach a handle object to another object that contains the actual data. The simplest form of a handle, which we have discussed in this article, is one in which each handle object corresponds to a single object from the inheritance hierarchy. Such handles are straightforward to use and to implement and tend to be intrinsically exception safe in almost all respects. The one exception hazard in such a class is typically the assignment operator. Assignment operators often test for self-assignment to avoid aliasing problems. As Herb Sutter has observed (2000), programs that need such tests are almost always exception unsafe. By rewriting the assignment operator, we ensure that we do not do anything irrevocable until the possibility of throwing an exception has passed. This strategy ensures that if an exception occurs while our assignment operator is executing, we do not corrupt the rest of our system", "fulltext": "", "keywords": "c++ program;inheritance hierarchy;self-assignment;exception;handles;aliasing problems;assignment operator"}
{"name": "train_1442", "title": "Using constructed types in C++ unions", "abstract": "The C++ Standard states that a union type cannot have a member with a nontrivial constructor or destructor. While at first this seems unreasonable, further thought makes it clear why this is the case: The crux of the problem is that unions don't have built-in semantics for denoting when a member is the \"current\" member of the union. Therefore, the compiler can't know when it's appropriate to call constructors or destructors on the union members. Still, there are good reasons for wanting to use constructed object types in a union. For example, you might want to implement a scripting language with a single variable type that can either be an integer, a string, or a list. A union is the perfect candidate for implementing such a composite type, but the restriction on constructed union members may prevent you from using an existing string or list class (for example, from the STL) to provide the underlying functionality. Luckily, a feature of C++ called placement new can provide a workaround", "fulltext": "", "keywords": "union type;union members;constructors;placement new;destructors;scripting language;c++ standard"}
{"name": "train_1443", "title": "C and C++: a case for compatibility", "abstract": "Modern C and C++ are sibling languages descended from Classic C. In many people's minds, they are (wrongly, but understandably) fused into the mythical C/C++ programming language. There is no C/C++ language, but there is a C/C++ community. Previously the author described some of the incompatibilities that complicate the work of developers within that C/C++ community. In this article, he discusses some of the underlying myths that help perpetuate these incompatibilities. He also shows why more compatibility (ideally, full compatibility) is in the best interest of the C/C++ community. In the next paper, he presents some examples of how the incompatibilities in C and C++ might be resolved", "fulltext": "", "keywords": "low-level programming;c language;c++ libraries;incompatibilities;object-oriented programming;c++ language;class hierarchies"}
{"name": "train_1444", "title": "Adaptable dialog boxes for cross-platform programming", "abstract": "The author presents a framework for building dialog boxes that adapt to the look and feel of their platform. This method also helps with a few related problems: specifying cross-platform resources and handling dialog size changes due to localization. He uses a combination of XML, automatic layout, and run-time dialog creation to give you most of the benefits of platform-specific resources, without the associated pain. Source code with an implementation of the layout engine for Mac OS 9.1 (\"Carbon\"), Mac OS X, and Microsoft Windows can be downloaded from the CUJ website at <www.cuj.com/code>. You can use this code as is, or as a starting point for your own more complete implementation", "fulltext": "", "keywords": "microsoft windows;dialog size changes;localization;adaptable dialog boxes;cross-platform programming;xml;dialog boxes;automatic layout;mac os x;platform-specific resources;run-time dialog creation;mac os 9.1;cross-platform resources"}
{"name": "train_1445", "title": "Applying BGL to computational geometry", "abstract": "The author applies Boost Graph Library to the domain of computational geometry. First, he formulates a concrete problem in graph terms. Second, he develops a way to transform the output of an existing algorithm into an appropriate Boost Graph Library data structure. Finally, he implements two new algorithms for my Boost Graph Library graph. The first algorithm gets the job done, but could have been written in any programming language. The second algorithm, however, shows the power of Boost Graph Library's generic programming approach.Graphs, graphics, and generic programming combine in this novel use of the Boost Graph Library", "fulltext": "", "keywords": "boost libraries;file dependencies;directed graph;computational geometry;c++;bgl graph;graph-theoretic concepts;boost graph library;threads;generic programming approach;smart pointers"}
{"name": "train_1446", "title": "The Tattletale technique", "abstract": "Practical experience has taught many Java developers one thing: critical resources (mutexes, database connections, transactions, file handles, etc.) require timely and systematic release. Unfortunately, Java's garbage collector is not up to that job. According to the Java Language Specification, there are no guarantees when a garbage collector will run, when it will collect an object, or when it will finalize an object - if ever. Even more unfortunately, Java's counterpart to the C++ destructor (the finally block) is both tedious and error-prone, requiring developers to constantly remember and duplicate resource-releasing code. Consequently, even good Java developers can forget to release critical resources. There is a light at the end of the tunnel. Java may make it easier to leak critical resources, but it also provides the necessary mechanisms to easily track them down. The Tattletale technique is a simple method for designing new classes and retrofitting existing classes to quickly and easily detect the offending code responsible for leaking resources", "fulltext": "", "keywords": "file handles;transactions;tattletale technique;critical resources;resource-releasing code;resources leaking;mutexes;java;garbage collector;database connections"}
{"name": "train_1447", "title": "International swinging: making Swing components locale-sensitive", "abstract": "Although Java and its GUI library Swing provide software developers with a highly customizable framework for creating truly \"international\" applications, the Swing library is not sensitive to locale switches: it cannot automatically change an application's appearance to conform to the conventions of a specific locale at run time. Several types of applications benefit from the ability to easily switch the language at run time. Training applications and other programs that run on computers in public spaces (such as libraries, airports, or government offices) may need to support multiple languages. Other applications (like travel dictionaries or translation programs) are inherently multilingual and are specifically designed to support users of dissimilar tongues. Such applications would greatly benefit if the user-interface language could be customized at run time. The article shows you how to customize Swing to support locale switching at run time. The author has created a new look-and-feel called the MLMetalLookandFeel (where ML stands for multilingual). This new look-and-feel extends the standard Metal look-and-feel but is locale-sensitive at run time", "fulltext": "", "keywords": "gui library;travel dictionaries;translation programs;swing library;java;locale switching;mlmetallookandfeel;user-interface language"}
{"name": "train_1448", "title": "Implementing equals for mixed-type comparison", "abstract": "The idea of comparing objects of different types is not entirely off base, in particular for classes from the same class hierarchy. After all, objects from the same class hierarchy (and by class hierarchy we mean all classes derived from a common superclass other than Object) have something in common, namely at least the superclass part. As we demonstrated in a previous paper (2002), providing a correct implementation of a mixed-type comparison is a non-trivial task. In this article, we will show one way of implementing a mixed-type comparison of objects from the same class hierarchy that meets the requirements of the equals contract", "fulltext": "", "keywords": "transitivity requirement;mixed-type comparison;java;equals contract;superclass"}
{"name": "train_1449", "title": "Raising the standard of management education for electronic commerce", "abstract": "professionals The teaching of electronic commerce in universities has become a growth industry in itself. The rapid expansion of electronic commerce programmes raises the question of what actually is being taught. The association of electronic commerce as primarily a technical or information technology (IT) phenomenon has not been sufficient to constrain it to IT and information systems departments. Business schools have been keen entrants into the electronic commerce coursework race and they are developing electronic commerce programmes in an environment where there is no agreed definition of the term. This paper draws on the work of Kenneth Boulding who argued that the dynamics of change in society are largely a product of changing skills and the way these skills are arranged into roles at the organizational level. It is argued that an overly technical interpretation of electronic commerce narrows the skills being acquired as part of formal education. Universities, under pressure from the market and technological change, are changing their roles resulting in a further narrowing of the breadth of issues that is seen as legitimate to be included as electronic commerce. The outcome is that aspiring electronic commerce professionals are not being exposed to a wide enough agenda of ideas and concepts that will assist them to make better business decisions", "fulltext": "", "keywords": "information technology;management education standards improvement;formal education;it;universities;kenneth boulding;electronic commerce professionals;business schools;information systems;organizational level"}
{"name": "train_145", "title": "If the RedBoot fits [open-source ROM monitor]", "abstract": "Many embedded developers today use a ROM- or flash-resident software program that provides functionality such as loading and running application software, scripting, read/write access to processor registers, and memory dumps. A ROM monitor, as it is often called, can be a useful and far less expensive debugging tool than an in-circuit emulator. This article describes the RedBoot ROM monitor. It takes a look at the features offered by the RedBoot ROM monitor and sees how it can be configured. It also walks through the steps of rebuilding and installing a new RedBoot image on a target platform. Finally, it looks at future enhancements that are coming in new releases and how to get support and additional information when using RedBoot. Although RedBoot uses software modules from the eCos real-time operating system (RTOS) and is often used in systems running embedded Linux, it is completely independent of both operating systems. RedBoot can be used with any operating system or RTOS, or even without one", "fulltext": "", "keywords": "embedded linux;open-source rom monitor;processor register access;debugging tool;flash-resident software program;scripting;redboot;real-time operating system;embedded systems;ecos;bootstrapping;memory dumps"}
{"name": "train_1450", "title": "Networking in the palm of your hand [PDA buyer's guide]", "abstract": "As PDAs move beyond the personal space and into the enterprise, you need to get a firm grip on the options available for your users. What operating system do you choose? What features do you and your company need? How will these devices fit into the existing corporate infrastructure? What about developer support?", "fulltext": "", "keywords": "pdas;buyer's guide;operating system;corporate infrastructure;developer support"}
{"name": "train_1451", "title": "From information gateway to digital library management system: a case analysis", "abstract": "This paper discusses the design, implementation and evolution of the Cornell University Library Gateway using the case analysis method. It diagnoses the Gateway within the conceptual framework of definitions and best practices associated with information gateways, portals, and emerging digital library management systems, in particular the product ENCompass", "fulltext": "", "keywords": "portals;metadata;digital library management system;encompass;cornell university library gateway;information gateways"}
{"name": "train_1452", "title": "Creating Web-based listings of electronic journals without creating extra work", "abstract": "Creating up-to-date listings of electronic journals is challenging due to frequent changes in titles available and in URLs for electronic journal titles. However, many library users may want to browse Web pages which contain listings of electronic journals arranged by title and/or academic disciplines. This case study examines the development of a system which automatically exports data from the online catalog and incorporates it into dynamically-generated Web sites. These sites provide multiple access points for journals, include Web-based interfaces enabling subject specialists to manage the list of titles which appears in their subject area. Because data are automatically extracted from the catalog, overlap in updating titles and URLs is avoided. Following the creation of this system, usage of electronic journals dramatically increased and feedback has been positive. Future challenges include developing more frequent updates and motivating subject specialists to more regularly monitor new titles", "fulltext": "", "keywords": "web pages;feedback;case study;web-based listings;url;library;web sites;public services partnerships;technical services;online catalog;electronic journals"}
{"name": "train_1453", "title": "Mobile banking's tough sell", "abstract": "Banks are having to put their mobile-commerce projects on hold because the essential technology to make the services usable, in particular GPRS (general packet radio service) hasn't become widely available. It is estimated that by the end of 2002, only 5 per cent of adults will have GPRS phones. This will have a knock-on effect for other technologies such as clickable icons and multimedia messaging. In fact banking via WAP (wireless application protocol) has proved to be a frustrating and time-consuming process for the customer. Financial firms' hopes for higher mobile usage are stymied by the fact that improvements to the systems won't happen as fast as they want and the inadequacies of the system go beyond immature technology. Financial services institutions should not wait for customers to become au fait with their WAP. Instead they should be the ones \"driving the traffic\"", "fulltext": "", "keywords": "mobile-commerce;gprs;banking;wireless application protocol"}
{"name": "train_1455", "title": "A wizard idea [Internet in finance]", "abstract": "New technology is set to become an ever-more important area of work for brokers. Lawrie Holmes looks at how the Internet is driving change and opportunity", "fulltext": "", "keywords": "internet;brokers;finance"}
{"name": "train_1456", "title": "Look who's talking [voice recognition]", "abstract": "Voice recognition could be the answer to the problem of financial fraud, but in the world of biometric technology, money talks", "fulltext": "", "keywords": "voice recognition;biometric;financial fraud;cost"}
{"name": "train_1457", "title": "A discontinuous Galerkin method for transient analysis of wave propagation in", "abstract": "unbounded domains A technique based on the discontinuous Galerkin finite element method is developed and applied to the derivation of an absorbing boundary condition for the analysis of transient wave propagation. The condition is exact in that only discretization error is involved. Furthermore, the computational cost associated with use of the condition is an order of magnitude lower than for conditions based on Green functions. The time-stepping scheme resulting from an implicit method in conjunction with this boundary condition appears to be unconditionally stable", "fulltext": "", "keywords": "time-stepping scheme;implicit method;unbounded domains;discontinuous galerkin finite element method;computational cost;discretization error;unconditional stability;absorbing boundary condition;transient wave propagation;transient analysis"}
{"name": "train_1458", "title": "Direct gear tooth contact analysis for hypoid bevel gears", "abstract": "A new methodology for tooth contact analysis based on a very general mathematical model of the generating process is proposed. Considering the line of action as a first order singularity of a certain operator equation we develop first and second order conditions for a pair of generated gear tooth flanks to be in contact. The constructive approach allows the direct computation of the paths of contact as the solution of a nonlinear equation system including the exact determination of the bounds of the paths of contact. The transmission error as well as curvature properties in the contact points are obtained in a convenient way. The resulting contact ellipses approximate the bearing area. Through the use of automatic differentiation all the geometric quantities are calculable within the machine accuracy of the computer", "fulltext": "", "keywords": "computer;first order singularity;mathematical model;geometric quantities;direct gear tooth contact analysis;contact paths;nonlinear equation system;first order conditions;operator equation;automatic differentiation;transmission error;generating process;exact bound determination;second order conditions;machine accuracy;contact ellipses;bearing area;hypoid bevel gears;curvature properties;generated gear tooth flanks"}
{"name": "train_1459", "title": "Wave propagation related to high-speed train. A scaled boundary FE-approach for", "abstract": "unbounded domains Analysis of wave propagation in solid materials under moving loads is a topic of great interest in railway engineering. The objective of the paper is three-dimensional modelling of high-speed train related ground vibrations; in particular the question of how to account for the unbounded media is addressed. For efficient and accurate modelling of railway structural components taking the unbounded media into account, a hybrid method based on a combination of the conventional finite element method and scaled boundary finite element method is established. In the paper, element matrices and solution procedures for the scaled boundary finite element method (SBFEM) are derived. A non-linear finite element iteration scheme using Lagrange multipliers and coupling between the unbounded domain and the finite element domain are also discussed. Two numerical examples including one example demonstrating the dynamical response of a railroad section are presented to demonstrate the performance of the proposed method", "fulltext": "", "keywords": "lagrange multipliers;wave propagation;solution procedures;nonlinear finite element iteration scheme;dynamical response;element matrices;3d modelling;unbounded media;modelling;railway structural components;solid materials;high-speed train related ground vibrations;scaled boundary finite element method;railway engineering;railroad section"}
{"name": "train_146", "title": "Design patterns for high availability", "abstract": "It is possible to achieve five-nines reliability with everyday commercial-quality hardware and software. The key is the way in which these components are combined. The design of high availability systems is based on a combination of redundant hardware components and software to manage fault detection and correction without human intervention. The author quickly reviews some definitions tied to high availability and fault management, and then goes on to discuss some hardware and software design patterns for fault tolerant systems", "fulltext": "", "keywords": "software reliability;fault detection;checkpointing;high availability systems;hardware reliability;software design patterns;software redundancy;redundant hardware components;fault tolerant systems;fault correction"}
{"name": "train_1460", "title": "Detection of flaws in composites from scattered elastic-wave field using an", "abstract": "improved mu GA and a local optimizer An effective technique for flaw detection of composites is proposed. In this technique, the detection problem is formulated as an optimization problem minimizing the difference between the measured and calculated surface displacement response derived from scattered elastic-wave fields. A combined optimization technique using an improved mu GA and a local optimizer is developed to solve the optimization problem so as to obtain the flaw parameters defining flaw configurations. Guidelines for implementing the detection technique, including formulation of the objective function of the optimization problem using different error norms, improvement of mu GA convergence performance, switching from mu GA to local optimizer in the optimization process, and suppression of the effect of noise on detection results, are addressed in detail. Numerical examples are presented to demonstrate the effectiveness and efficiency of the proposed detection technique", "fulltext": "", "keywords": "error norms;flaw detection;composites;flaw configurations;objective function;scattered elastic-wave field;convergence;improved mu ga;local optimizer;surface displacement response;optimization problem;noise effect suppression"}
{"name": "train_1461", "title": "Adaptive multiresolution approach for solution of hyperbolic PDEs", "abstract": "This paper establishes an innovative and efficient multiresolution adaptive approach combined with high-resolution methods, for the numerical solution of a single or a system of partial differential equations. The proposed methodology is unconditionally bounded (even for hyperbolic equations) and dynamically adapts the grid so that higher spatial resolution is automatically allocated to domain regions where strong gradients are observed, thus possessing the two desired properties of a numerical approach: stability and accuracy. Numerical results for five test problems are presented which clearly show the robustness and cost effectiveness of the proposed method", "fulltext": "", "keywords": "unconditionally bounded methodology;cost effectiveness;robustness;numerical solution;dynamic grid adaptation;strong gradients;accuracy;high-resolution methods;spatial resolution;stability;hyperbolic partial differential equations;multiresolution adaptive approach"}
{"name": "train_1462", "title": "Non-linear analysis of nearly saturated porous media: theoretical and numerical", "abstract": "formulation A formulation for a porous medium saturated with a compressible fluid undergoing large elastic and plastic deformations is presented. A consistent thermodynamic formulation is proposed for the two-phase mixture problem; thus preserving a straightforward and robust numerical scheme. A novel feature is the specification of the fluid compressibility in terms of a volumetric logarithmic strain, which is energy conjugated to the fluid pressure in the entropy inequality. As a result, the entropy inequality is used to separate three different mechanisms representing the response: effective stress response according to Terzaghi in the solid skeleton, fluid pressure response to compressibility of the fluid, and dissipative Darcy flow representing the interaction between the two phases. The paper is concluded with a couple of numerical examples that display the predictive capabilities of the proposed formulation. In particular, we consider results for the kinematically linear theory as compared to the kinematically non-linear theory", "fulltext": "", "keywords": "dissipative darcy flow;fluid pressure response;robust numerical scheme;kinematically linear theory;nonlinear analysis;large plastic deformations;consistent thermodynamic formulation;compressible fluid;large elastic deformations;fluid compressibility;fluid pressure;solid skeleton;volumetric logarithmic strain;predictive capabilities;two-phase mixture problem;nearly saturated porous media;entropy inequality;kinematically nonlinear theory;effective stress response"}
{"name": "train_1463", "title": "Computational complexity of probabilistic disambiguation", "abstract": "Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various linguistic phenomena of interest, are gathered from actual linguistic data and used to estimate the probabilities of the various entities that are generated by a given grammar, e.g., derivations, parse-trees and sentences. The extension of grammars with probabilities makes it possible to state ambiguity resolution as a constrained optimization formula, which aims at maximizing the probability of some entity that the grammar generates given the input (e.g., maximum probability parse-tree given some input sentence). The implementation of these optimization formulae in efficient algorithms, however, does not always proceed smoothly. In this paper, we address the computational complexity of ambiguity resolution under various kinds of probabilistic models. We provide proofs that some, frequently occurring problems of ambiguity resolution are NP-complete. These problems are encountered in various applications, e.g., language understanding for textand speech-based applications. Assuming the common model of computation, this result implies that, for many existing probabilistic models it is not possible to devise tractable algorithms for solving these optimization problems", "fulltext": "", "keywords": "formal grammars;np-completeness results;probabilistic disambiguation;speech processing;statistics;state ambiguity resolution;constrained optimization formula;natural language processing;computational complexity;parsing problems;statistical reasoning;language understanding;probabilistic models"}
{"name": "train_1464", "title": "LR parsing for conjunctive grammars", "abstract": "The generalized LR parsing algorithm for context-free grammars, introduced by Tomita in 1986, is a polynomial-time implementation of nondeterministic LR parsing that uses graph-structured stack to represent the contents of the nondeterministic parser's pushdown for all possible branches of computation at a single computation step. It has been specifically developed as a solution for practical parsing tasks arising in computational linguistics, and indeed has proved itself to be very suitable for natural language processing. Conjunctive grammars extend context-free grammars by allowing the use of an explicit intersection operation within grammar rules. This paper develops a new LR-style parsing algorithm for these grammars, which is based on the very same idea of a graph-structured pushdown, where the simultaneous existence of several paths in the graph is used to perform the mentioned intersection operation. The underlying finite automata are treated in the most general way: instead of showing the algorithm's correctness for some particular way of constructing automata, the paper defines a wide class of automata usable with a given grammar, which includes not only the traditional LR(k) automata, but also, for instance, a trivial automaton with a single reachable state. A modification of the SLR(k) table construction method that makes use of specific properties of conjunctive grammars is provided as one possible way of making finite automata to use with the algorithm", "fulltext": "", "keywords": "graph-structured stack;computation;trivial automaton;generalized lr parsing algorithm;single reachable state;computational linguistics;boolean closure;deterministic context-free languages;context-free grammars;explicit intersection operation;natural language processing;grammar rules;nondeterministic parser pushdown;conjunctive grammars;finite automata"}
{"name": "train_1465", "title": "P systems with symport/antiport rules: the traces of objects", "abstract": "We continue the study of those P systems where the computation is performed by the communication of objects, that is, systems with symport and antiport rules. Instead of the (number of) objects collected in a specified membrane, as the result of a computation we consider the itineraries of a certain object through membranes, during a halting computation, written as a coding of the string of labels of the visited membranes. The family of languages generated in this way is investigated with respect to its place in the Chomsky hierarchy. When the (symport and antiport) rules are applied in a conditional manner, promoted or inhibited by certain objects which should be present in the membrane where a rule is applied, then a characterization of recursively enumerable languages is obtained; the power of systems with the rules applied freely is only partially described", "fulltext": "", "keywords": "symport rules;object traces;halting computation;recursively enumerable languages;antiport rules;chomsky hierarchy;label string coding;object communication;languages;p systems;itineraries"}
{"name": "train_1466", "title": "Feldkamp-type image reconstruction from equiangular data", "abstract": "The cone-beam approach for image reconstruction attracts increasing attention in various applications, especially medical imaging. Previously, the traditional practical cone-beam reconstruction method, the Feldkamp algorithm, was generalized into the case of spiral/helical scanning loci with equispatial cone-beam projection data. In this paper, we formulated the generalized Feldkamp algorithm in the case of equiangular cone-beam projection data, and performed numerical simulation to evaluate the image quality. Because medical multi-slice/cone-beam CT scanners typically use equiangular projection data, our new formula may be useful in this area as a framework for further refinement and a benchmark for comparison", "fulltext": "", "keywords": "equiangular data;equispatial cone-beam projection data;feldkamp-type image reconstruction;equiangular cone-beam projection data;medical multi-slice/cone-beam ct scanners;generalized feldkamp algorithm;practical cone-beam reconstruction method;medical imaging;image quality;cone-beam approach;spiral/helical scanning loci;numerical simulation"}
{"name": "train_1467", "title": "Utilizing Web-based case studies for cutting-edge information services issues", "abstract": "This article reports on a pilot study conducted by the Academic Libraries of the 21st Century project team to determine whether the benefits of the case study method as a training framework for change initiatives could successfully transfer from the traditional face-to-face format to a virtual format. Methods of developing the training framework, as well as the benefits, challenges, and recommendations for future strategies gained from participant feedback are outlined. The results of a survey administered to chat session registrants are presented in three sections: (1) evaluation of the training framework; (2) evaluation of participants' experiences in the virtual environment; and (3) a comparison of participants' preference of format. The overall participant feedback regarding the utilization of the case study method in a virtual environment for professional development and collaborative problem solving is very positive", "fulltext": "", "keywords": "web-based case studies;professional development;internet;academic libraries;training;collaborative problem solving;survey;cutting-edge information services;virtual environment;change initiatives"}
{"name": "train_1468", "title": "Developing Web-enhanced learning for information fluency-a liberal arts", "abstract": "college's perspective Learning is likely to take a new form in the twenty-first century, and a transformation is already in process. Under the framework of information fluency, efforts are being made at Rollins College to develop a Web-enhanced course that encompasses information literacy, basic computer literacy, and critical thinking skills. Computer-based education can be successful when librarians use technology effectively to enhance their integrated library teaching. In an online learning environment, students choose a time for learning that best suits their needs and motivational levels. They can learn at their own pace, take a nonlinear approach to the subject, and maintain constant communication with instructors and other students. The quality of a technology-facilitated course can be upheld if the educational objectives and methods for achieving those objectives are carefully planned and explored", "fulltext": "", "keywords": "integrated library teaching;computer-based education;online learning;critical thinking skills;librarians;liberal arts college;information fluency;information literacy;web-enhanced learning;computer literacy"}
{"name": "train_1469", "title": "The necessity of real-time-fact and fiction in digital reference systems", "abstract": "Current discussions and trends in digital reference have emphasized the use of real-time digital reference services. Recent articles have questioned both the utility and use of asynchronous services such as e-mail. This article uses data from the AskERIC digital reference service to demonstrate that asynchronous services are not only useful and used, but may have greater utility than real-time systems", "fulltext": "", "keywords": "e-mail;asynchronous services;digital library;real-time digital reference services;askeric;personalized internet-based service"}
{"name": "train_147", "title": "Embedded Linux and the law", "abstract": "The rising popularity of Linux, combined with perceived cost savings, has spurred many embedded developers to consider a real-time Linux variant as an alternative to a traditional RTOS. The paper presents the legal implications for the proprietary parts of firmware", "fulltext": "", "keywords": "embedded linux;real-time linux;proprietary firmware;legal implications"}
{"name": "train_1470", "title": "When reference works are not books-the new edition of the Guide to Reference", "abstract": "Books The author considers the history of the Guide to Reference Books (GRB) and its importance in librarianship. He discusses the ways in which the new edition is taking advantage of changing times. GRB has become a cornerstone of the literature of U.S. librarianship. The biggest change GRB will undergo to become GRS (Guide to Reference Sources) will be designing it primarily as a Web product", "fulltext": "", "keywords": "guide to reference books;internet;guide to reference sources;reference works;web product;grs;librarianship;history;grb"}
{"name": "train_1471", "title": "E-commerce-resources for doing business on the Internet", "abstract": "There are many different types of e-commerce depending upon who or what is selling and who or what is buying. In addition, e-commerce is more than an exchange of funds and goods or services, it encompasses an entire infrastructure of services, computer hardware and software products, technologies, and communications formats. The paper discusses e-commerce terminology, types and information resources, including books and Web sites", "fulltext": "", "keywords": "internet;information resources;terminology;business;books;web sites;e-commerce"}
{"name": "train_1472", "title": "Surface textures improve the robustness of stereoscopic depth cues", "abstract": "This research develops design recommendations for surface textures (patterns of color on object surfaces) rendered with stereoscopic displays. In 3 method-of-adjustment procedure experiments, 8 participants matched the disparity of a circular probe and a planar stimulus rendered using a single visible edge. The experiments varied stimulus orientation and surface texture. Participants more accurately matched the depth of vertical stimuli than that of horizontal stimuli, consistent with previous studies and existing theory. Participants matched the depth of surfaces with large pixel-to-pixel luminance variations more accurately than they did surfaces with a small pixel-to-pixel luminance variation. Finally, they matched the depth of surfaces with vertical line patterns more accurately than they did surfaces with horizontal-striped texture patterns. These results suggest that designers can enhance depth perception in stereoscopic displays, and also reduce undesirable sensitivity to orientation, by rendering objects with surface textures using large pixel-to-pixel luminance variations", "fulltext": "", "keywords": "object rendering;stereoscopic displays;vertical line patterns;stimulus orientation;robustness;depth perception;planar stimulus disparity;orientation sensitivity reduction;single visible edge;stereoscopic depth cues;horizontal-striped texture patterns;surface texture;surface textures;pixel-to-pixel luminance variations;circular probe disparity"}
{"name": "train_1473", "title": "Control performance with three translational degrees of freedom", "abstract": "For multiple degree-of-freedom (DOF) systems, it is important to determine how accurately operators can control each DOF and what influence perceptual, information processing, and psychomotor components have on performance. Sixteen right-handed male students participated in 2 experiments: 1 involving positioning and 1 involving tracking with 3 translational DOFs. To separate perceptual and psychomotor effects, we used 2 control-display mappings that differed in the coupling of vertical and depth dimensions to the up-down and fore-aft control axes. We observed information processing effects in the positioning task: Initial error correction on the vertical dimension lagged in time behind the horizontal dimension. The depth dimension error correction lagged behind both, which was ascribed to the poorer perceptual information. We observed this perceptual effect also in the tracking experiment. Motor effects were also present, with tracking errors along the up-down axis of the hand controller being 1.1 times larger than along the fore-aft axis. These results indicate that all 3 components contribute to control performance. Actual applications of this research include interface design", "fulltext": "", "keywords": "virtual reality;multi-dof systems;depth dimension error correction;perceptual effects;initial error correction;remote control;tracking;positioning;interface design;control performance;psychomotor effects"}
{"name": "train_1474", "title": "Contrast sensitivity in a dynamic environment: effects of target conditions and", "abstract": "visual impairment Contrast sensitivity was determined as a function of target velocity (0 degrees -120 degrees /s) over a variety of viewing conditions. In Experiment 1, measurements of dynamic contrast sensitivity were determined for observers as a function of target velocity for letter stimuli. Significant main effects were found for target velocity, target size, and target duration, but significant interactions among the variables indicated especially pronounced adverse effects of increasing target velocity for small targets and brief durations. In Experiment 2, the effects of simulated cataracts were determined. Although the simulated impairment had no effect on traditional acuity scores, dynamic contrast sensitivity was markedly reduced. Results are discussed in terms of dynamic contrast sensitivity as a useful composite measure of visual functioning that may provide a better overall picture of an individual's visual functioning than does traditional static acuity, dynamic acuity, or contrast sensitivity alone. The measure of dynamic contrast sensitivity may increase understanding of the practical effects of various conditions, such as aging or disease, on the visual system, or it may allow improved prediction of individuals' performance in visually dynamic situations", "fulltext": "", "keywords": "disease;acuity scores;target size;dynamic environment;target velocity;dynamic contrast sensitivity;target conditions;target duration;aging;contrast sensitivity;visual impairment"}
{"name": "train_1475", "title": "Relation between glare and driving performance", "abstract": "The present study investigated the effects of discomfort glare on driving behavior. Participants (old and young; US and Europeans) were exposed to a simulated low- beam light source mounted on the hood of an instrumented vehicle. Participants drove at night in actual traffic along a track consisting of urban, rural, and highway stretches. The results show that the relatively low glare source caused a significant drop in detecting simulated pedestrians along the roadside and made participants drive significantly slower on dark and winding roads. Older participants showed the largest drop in pedestrian detection performance and reduced their driving speed the most. The results indicate that the de Boer rating scale, the most commonly used rating scale for discomfort glare, is practically useless as a predictor of driving performance. Furthermore, the maximum US headlamp intensity (1380 cd per headlamp) appears to be an acceptable upper limit", "fulltext": "", "keywords": "glare;urban road;road traffic;simulated low-beam light source;highway;deboer rating scale;driving performance;discomfort glare;rural road"}
{"name": "train_1476", "title": "The perceived utility of human and automated aids in a visual detection task", "abstract": "Although increases in the use of automation have occurred across society, research has found that human operators often underutilize (disuse) and overly rely on (misuse) automated aids (Parasuraman-Riley (1997)). Nearly 275 Cameron University students participated in 1 of 3 experiments performed to examine the effects of perceived utility (Dzindolet et al. (2001)) on automation use in a visual detection task and to compare reliance on automated aids with reliance on humans. Results revealed a bias for human operators to rely on themselves. Although self-report data indicate a bias toward automated aids over human aids, performance data revealed that participants were more likely to disuse automated aids than to disuse human aids. This discrepancy was accounted for by assuming human operators have a \"perfect automation\" schema. Actual or potential applications of this research include the design of future automated decision aids and training procedures for operators relying on such aids", "fulltext": "", "keywords": "automated decision aids;visual detection task;automated aids;automation;human operators;social process"}
{"name": "train_1477", "title": "Ecological interface design: progress and challenges", "abstract": "Ecological interface design (EID) is a theoretical framework for designing human-computer interfaces for complex socio-technical systems. Its primary aim is to support knowledge workers in adapting to change and novelty. This literature review shows that in situations requiring problem solving, EID improves performance when compared with current design approaches in industry. EID has been applied to industry-scale problems in a broad variety of application domains (e.g., process control, aviation, computer network management, software engineering, medicine, command and control, and information retrieval) and has consistently led to the identification of new information requirements. An experimental evaluation of EID using a full-fidelity simulator with professional workers has yet to be conducted, although some are planned. Several significant challenges remain as obstacles to the confident use of EID in industry. Promising paths for addressing these outstanding issues are identified. Actual or potential applications of this research include improving the safety and productivity of complex socio-technical systems", "fulltext": "", "keywords": "human-computer interfaces;productivity;industry;user interface;complex social technical systems;ecological interface design;human factors"}
{"name": "train_1478", "title": "The effects of work pace on within-participant and between-participant keying", "abstract": "force, electromyography, and fatigue A laboratory study was conducted to determine the effects of work pace on typing force, electromyographic (EMG) activity, and subjective discomfort. We found that as participants typed faster, their typing force and finger flexor and extensor EMG activity increased linearly. There was also an increase in subjective discomfort, with a sharp threshold between participants' self-selected pace and their maximum typing speed. The results suggest that participants self-select a typing pace that maximizes typing speed and minimizes discomfort. The fastest typists did not produce significantly more finger flexor EMG activity but did produce proportionately less finger extensor EMG activity compared with the slower typists. We hypothesize that fast typists may use different muscle recruitment patterns that allow them to be more efficient than slower typists at striking the keys. In addition, faster typists do not experience more discomfort than slow typists. These findings show that the relative pace of typing is more important than actual typing speed with regard to discomfort and muscle activity. These results suggest that typists may benefit from skill training to increase maximum typing speed. Potential applications of this research includes skill training for typists", "fulltext": "", "keywords": "discomfort;keying force;skill training;muscle recruitment patterns;work pace effect;emg activity;typing speed;subjective discomfort;finger flexor;typists"}
{"name": "train_1479", "title": "Agreeing with automated diagnostic aids: a study of users' concurrence", "abstract": "strategies Automated diagnostic aids that are less than perfectly reliable often produce unwarranted levels of disuse by operators. In the present study, users' tendencies to either agree or disagree with automated diagnostic aids were examined under conditions in which: (1) the aids were less than perfectly reliable but aided-diagnosis was still more accurate that unaided diagnosis; and (2) the system was completely opaque, affording users no additional information upon which to base a diagnosis. The results revealed that some users adopted a strategy of always agreeing with the aids, thereby maximizing the number of correct diagnoses made over several trials. Other users, however, adopted a probability-matching strategy in which agreement and disagreement rates matched the rate of correct and incorrect diagnoses of the aids. The probability-matching strategy, therefore, resulted in diagnostic accuracy scores that were lower than was maximally possible. Users who adopted the maximization strategy had higher self-ratings of problem-solving and decision-making skills, were more accurate in estimating aid reliabilities, and were more confident in their diagnosis on trials in which they agreed with the aids. The potential applications of these findings include the design of interface and training solutions that facilitate the adoption of the most effective concurrence strategies by users of automated diagnostic aids", "fulltext": "", "keywords": "fault diagnosis;probability-matching;disagreement rates;problem-solving;user concurrence strategy;maximization;complex systems;automated diagnostic aids;reliability"}
{"name": "train_148", "title": "Axioms for branching time", "abstract": "Logics of general branching time, or historical necessity, have long been studied but important axiomatization questions remain open. Here the difficulties of finding axioms for such logics are considered and ideas for solving some of the main open problems are presented. A new, more expressive logical account is also given to support Peirce's prohibition on truth values being attached to the contingent future", "fulltext": "", "keywords": "axioms;branching time;truth values;temporal logic"}
{"name": "train_1480", "title": "Formal verification of human-automation interaction", "abstract": "This paper discusses a formal and rigorous approach to the analysis of operator interaction with machines. It addresses the acute problem of detecting design errors in human-machine interaction and focuses on verifying the correctness of the interaction in complex and automated control systems. The paper describes a systematic methodology for evaluating whether the interface provides the necessary information about the machine to enable the operator to perform a specified task successfully and unambiguously. It also addresses the adequacy of information provided to the user via training materials (e.g., user manual) about the machine's behavior. The essentials of the methodology, which can be automated and applied to the verification of large systems, are illustrated by several examples and through a case study of pilot interaction with an autopilot aboard a modern commercial aircraft. The expected application of this methodology is an augmentation and enhancement, by formal verification, of human-automation interfaces", "fulltext": "", "keywords": "formal verification;autopilot;human-automation interaction;automated control systems;commercial aircraft;user interface;man-machine interaction"}
{"name": "train_1481", "title": "Impact of aviation highway-in-the-sky displays on pilot situation awareness", "abstract": "Thirty-six pilots (31 men, 5 women) were tested in a flight simulator on their ability to intercept a pathway depicted on a highway-in-the-sky (HITS) display. While intercepting and flying the pathway, pilots were required to watch for traffic outside the cockpit. Additionally, pilots were tested on their awareness of speed, altitude, and heading during the flight. Results indicated that the presence of a flight guidance cue significantly improved flight path awareness while intercepting the pathway, but significant practice effects suggest that a guidance cue might be unnecessary if pilots are given proper training. The amount of time spent looking outside the cockpit while using the HITS display was significantly less than when using conventional aircraft instruments. Additionally, awareness of flight information present on the HITS display was poor. Actual or potential applications of this research include guidance for the development of perspective flight display standards and as a basis for flight training requirements", "fulltext": "", "keywords": "aircraft display;flight guidance;situation awareness;pilots;cockpit;highway-in-the-sky display;flight simulator;flight path awareness;human factors"}
{"name": "train_1482", "title": "A parareal in time procedure for the control of partial differential equations", "abstract": "We have proposed in a previous note a time discretization for partial differential evolution equation that allows for parallel implementations. This scheme is here reinterpreted as a preconditioning procedure on an algebraic setting of the time discretization. This allows for extending the parallel methodology to the problem of optimal control for partial differential equations. We report a first numerical implementation that reveals a large interest", "fulltext": "", "keywords": "optimal control;hilbert space;evolution equation;algebraic setting;time procedure;preconditioning procedure;partial differential equation control;time discretization"}
{"name": "train_1483", "title": "Hypothesis-based concept assignment in software maintenance", "abstract": "Software maintenance accounts for a significant proportion of the lifetime cost of a software system. Software comprehension is required in many parts of the maintenance process and is one of the most expensive activities. Many tools have been developed to help the maintainer reduce the time and cost of this task, but of the numerous tools and methods available one group has received relatively little attention: those using plausible reasoning to address the concept assignment problem. We present a concept assignment method for COBOL II: hypothesis-based concept assignment (HB-CA). An implementation of a prototype tool is described, and results from a comprehensive evaluation using commercial COBOL II sources are summarised. In particular, we identify areas of a standard maintenance process where such methods would be appropriate, and discuss the potential cost savings that may result", "fulltext": "", "keywords": "cobol ii;lifetime cost;software maintenance;scalability;hypothesis-based concept assignment"}
{"name": "train_1484", "title": "Portfolio optimization and the random magnet problem", "abstract": "Diversification of an investment into independently fluctuating assets reduces its risk. In reality, movements of assets are mutually correlated and therefore knowledge of cross-correlations among asset price movements are of great importance. Our results support the possibility that the problem of finding an investment in stocks which exposes invested funds to a minimum level of risk is analogous to the problem of finding the magnetization of a random magnet. The interactions for this \"random magnet problem\" are given by the cross-correlation matrix C of stock returns. We find that random matrix theory allows us to make an estimate for C which outperforms the standard estimate in terms of constructing an investment which carries a minimum level of risk", "fulltext": "", "keywords": "minimum risk level;spin glasses;price movements;portfolio optimization;invested funds;investment;random magnet problem;magnetization;cross-correlation matrix;cross-correlations;fluctuating assets;stocks"}
{"name": "train_1485", "title": "Telemedicine in the management of a cervical dislocation by a mobile", "abstract": "neurosurgeon Neurosurgical teams, who are normally located in specialist centres, frequently use teleradiology to make a decision about the transfer of a patient to the nearest neurosurgical department. This decision depends on the type of pathology, the clinical status of the patient and the prognosis. If the transfer of the patient is not possible, for example because of an unstable clinical status, a mobile neurosurgical team may be used. We report a case which was dealt with in a remote French military airborne surgical unit, in the Republic of Chad. The unit, which provides health-care to the French military personnel stationed there, also provides free medical care for the local population. It conducts about 100 operations each month. The unit comprises two surgeons (an orthopaedic and a general surgeon), one anaesthetist, two anaesthetic nurses, one operating room nurse, two nurses, three paramedics and a secretary. The civilian patient presented with unstable cervical trauma. A mobile neurosurgeon operated on her, and used telemedicine before, during and after surgery", "fulltext": "", "keywords": "remote french military airborne surgical unit;republic of chad;telemedicine;unstable cervical trauma;health care;teleradiology;surgery;french military personnel;mobile neurosurgeon;civilian patient;cervical dislocation management"}
{"name": "train_1486", "title": "Hand-held digital video-camera for eye examination and follow-up", "abstract": "We developed a hand-held digital colour video-camera for eye examination in primary care. The device weighed 550 g. It featured a charge-coupled device (CCD) and corrective optics. Both colour video and digital still images could be taken. The video-camera was connected to a PC with software for database storage, image processing and telecommunication. We studied 88 normal subjects (38 male, 50 female), aged 7-62 years. It was not necessary to use mydriatic eye drops for pupillary dilation. Satisfactory digital images of the whole face and the anterior eye were obtained. The optic disc and the central part of the ocular fundus could also be recorded. Image quality of the face and the anterior eye were excellent; image quality of the optic disc and macula were good enough for tele-ophthalmology. Further studies are needed to evaluate the usefulness of the equipment in different clinical conditions", "fulltext": "", "keywords": "normal subjects;digital still images;tele-ophthalmology;image processing;hand-held digital colour video camera;charge-coupled device;image quality;pc;database storage;software;optic disc;corrective optics;whole face;ocular fundus;eye examination;anterior eye;primary care;colour video images;follow-up;telecommunication;clinical conditions"}
{"name": "train_1487", "title": "Assessment of prehospital chest pain using telecardiology", "abstract": "Two hundred general practitioners were equipped with a portable electrocardiograph which could transmit a 12-lead electrocardiogram (ECG) via a telephone line. A cardiologist was available 24 h a day for an interactive teleconsultation. In a 13 month period there were 5073 calls to the telecardiology service and 952 subjects with chest pain were identified. The telecardiology service allowed the general practitioners to manage 700 cases (74%) themselves; further diagnostic tests were requested for 162 patients (17%) and 83 patients (9%) were sent to the hospital emergency department. In the last group a cardiological diagnosis was confirmed in 60 patients and refuted in 23. Seven patients in whom the telecardiology service failed to detect a cardiac problem were hospitalized in the subsequent 48 h. The telecardiology service showed a sensitivity of 97.4%, a specificity of 89.5% and a diagnostic accuracy of 86.9% for chest pain. Telemedicine could be a useful tool in the diagnosis of chest pain in primary care", "fulltext": "", "keywords": "primary care;hospital emergency department;13 month;diagnostic accuracy;portable electrocardiograph;telephone line;diagnostic tests;prehospital chest pain assessment;specificity;patients;general practitioners;electrocardiogram transmission;sensitivity;telecardiology;interactive teleconsultation"}
{"name": "train_1488", "title": "Social presence in telemedicine", "abstract": "We studied consultations between a doctor, emergency nurse practitioners (ENPs) and their patients in a minor accident and treatment service (MATS). In the conventional consultations, all three people were located at the main hospital. In the teleconsultations, the doctor was located in a hospital 6 km away from the MATS and used a videoconferencing link connected at 384 kbit/s. There were 30 patients in the conventional group and 30 in the telemedical group. The presenting problems were similar in the two groups. The mean duration of teleconsultations was 951 s and the mean duration of face-to-face consultations was 247 s. In doctor-nurse communication there was a higher rate of turn taking in teleconsultations than in face-to-face consultations; there were also more interruptions, more words and more `backchannels' (e.g. `mhm', `uh-huh') per teleconsultation. In doctor-patient communication there was a higher rate of turn taking, more words, more interruptions and more backchannels per teleconsultation. In patient-nurse communication there was. relatively little difference between the two modes of consulting the doctor. Telemedicine appeared to empower the patient to ask more questions of the doctor. It also seemed that the doctor took greater care in a teleconsultation to achieve coordination of beliefs with the patient than in a face-to-face consultation", "fulltext": "", "keywords": "telemedicine;turn taking;384 kbit/s;doctor-nurse communication;951 s;doctor;social presence;teleconsultations;minor accident and treatment service;interruptions;belief coordination;emergency nurse practitioners;backchannels;face-to-face consultations;247 s;patients;videoconferencing link;words;patient-nurse communication"}
{"name": "train_1489", "title": "An eight-year study of Internet-based remote medical counselling", "abstract": "We carried out a prospective study of an Internet-based remote counselling service. A total of 15,456 Internet users visited the Web site over eight years. From these, 1500 users were randomly selected for analysis. Medical counselling had been granted to 901 of the people requesting it (60%). One hundred and sixty-four physicians formed project groups to process the requests and responded using email. The distribution of patients using the service was similar to the availability of the Internet: 78% were from the European Union, North America and Australia. Sixty-seven per cent of the patients lived in urban areas and the remainder were residents of remote rural areas with limited local medical coverage. Sixty-five per cent of the requests were about problems of internal medicine and 30% of the requests concerned surgical issues. The remaining 5% of the patients sought information about recent developments, such as molecular medicine or aviation medicine. During the project, our portal became inaccessible five times, and counselling was not possible on 44 days. There was no hacking of the Web site. Internet-based medical counselling is a helpful addition to conventional practice", "fulltext": "", "keywords": "email;urban areas;web site;telemedicine;portal;remote rural areas;internet-based remote medical counselling;surgical issues;internet users;medical education"}
{"name": "train_149", "title": "Extending Kamp's theorem to model time granularity", "abstract": "In this paper, a generalization of Kamp's theorem relative to the functional completeness of the until operator is proved. Such a generalization consists in showing the functional completeness of more expressive temporal operators with respect to the extension of the first-order theory of linear orders MFO[<] with an extra binary relational symbol. The result is motivated by the search of a modal language capable of expressing properties and operators suitable to model time granularity in omega -layered temporal structures", "fulltext": "", "keywords": "functional completeness;linear orders;temporal operators;omega -layered temporal structures;first-order theory;kamp's theorem;model time granularity;until operator;binary relational symbol"}
{"name": "train_1490", "title": "Client satisfaction in a feasibility study comparing face-to-face interviews", "abstract": "with telepsychiatry We carried out a pilot study comparing satisfaction levels between psychiatric patients seen face to face (FTF) and those seen via videoconference. Patients who consented were randomly assigned to one of two groups. One group received services in person (FTF from the visiting psychiatrist) while the other was seen using videoconferencing at 128 kbit/s. One psychiatrist provided all the FTF and videoconferencing assessment and follow-up visits. A total of 24 subjects were recruited. Three of the subjects (13%) did not attend their appointments and two subjects in each group were lost to follow-up. Thus there were nine in the FTF group and eight in the videoconferencing group. The two groups were similar in most respects. Patient satisfaction with the services was assessed using the Client Satisfaction Questionnaire (CSQ-8), completed four months after the initial consultation. The mean scores were 25.3 in the FTF group and 21.6 in the videoconferencing group. Although there was a trend in favour of the FTF service, the difference was not significant. Patient satisfaction is only one component of evaluation. The efficacy of telepsychiatry must also be measured relative to that of conventional, FTF care before policy makers can decide how extensively telepsychiatry should be implemented", "fulltext": "", "keywords": "videoconference;telemedicine;psychiatric patient satisfaction;telepsychiatry;client satisfaction;128 kbit/s;client satisfaction questionnaire;human factors;face-to-face interviews"}
{"name": "train_1491", "title": "Evaluation of videoconferenced grand rounds", "abstract": "We evaluated various aspects of grand rounds videoconferenced from a tertiary care hospital to a regional hospital in Nova Scotia. During a five-month study period, 29 rounds were broadcast (19 in medicine and 10 in cardiology). The total recorded attendance at the remote site was 103, comprising 70 specialists, nine family physicians and 24 other health-care professionals. We received 55 evaluations, a response rate of 53%. On a five-point Likert scale (on which higher scores indicated better quality), mean ratings by remote-site participants of the technical quality of the videoconference were 3.0-3.5, with the lowest ratings being for ability to hear the discussion (3.0) and to see visual aids (3.1). Mean ratings for content, presentation, discussion and educational value were 3.8 or higher. Of the 49 physicians who presented the rounds, we received evaluations from 41, a response rate of 84%. The presenters rated all aspects of the videoconference and interaction with remote sites at 3.8 or lower. The lowest ratings were for ability to see the remote sites (3.0) and the usefulness of the discussion (3.4). We received 278 evaluations from participants at the presenting site, an estimated response rate of about 55%. The results indicated no adverse opinions of the effect of videoconferencing (mean scores 3.1-3.3). The estimated costs of videoconferencing one grand round to one site and four sites were C$723 and C$1515, respectively. The study confirmed that videoconferenced rounds can provide satisfactory continuing medical education to community specialists, which is an especially important consideration as maintenance of certification becomes mandatory", "fulltext": "", "keywords": "tertiary care hospital;telemedicine;health-care professionals;remote sites;regional hospital;certification;five-point likert scale;cardiology;videoconferenced grand rounds;continuing medical education"}
{"name": "train_1492", "title": "A systematic review of the efficacy of telemedicine for making diagnostic and", "abstract": "management decisions We conducted a systematic review of the literature to evaluate the efficacy of telemedicine for making diagnostic and management decisions in three classes of application: office/hospital-based, store-and-forward, and home-based telemedicine. We searched the MEDLINE, EMBASE, CINAHL and HealthSTAR databases and printed resources, and interviewed investigators in the field. We excluded studies where the service did not historically require face-to-face encounters (e.g. radiology or pathology diagnosis). A total of 58 articles met the inclusion criteria. The articles were summarized and graded for the quality and direction of the evidence. There were very few high-quality studies. The strongest evidence for the efficacy of telemedicine for diagnostic and management decisions came from the specialties of psychiatry and dermatology. There was also reasonable evidence that general medical history and physical examinations performed via telemedicine had relatively good sensitivity and specificity. Other specialties in which some evidence for efficacy existed were cardiology and certain areas of ophthalmology. Despite the widespread use of telemedicine in most major medical specialties, there is strong evidence in only a few of them that the diagnostic and management decisions provided by telemedicine are comparable to face-to-face care", "fulltext": "", "keywords": "telemedicine;ophthalmology;embase;psychiatry;healthstar;cinahl;dermatology;management decision making;literature review;cardiology;medical diagnosis;medline"}
{"name": "train_1493", "title": "Research into telehealth applications in speech-language pathology", "abstract": "A literature review was conducted to investigate the extent to which telehealth has been researched within the domain of speech-language pathology and the outcomes of this research. A total of 13 studies were identified. Three early studies demonstrated that telehealth was feasible, although there was no discussion of the cost-effectiveness of this process in terms of patient outcomes. The majority of the subsequent studies indicated positive or encouraging outcomes resulting from telehealth. However, there were a number of shortcomings in the research, including a lack of cost-benefit information, failure to evaluate the technology itself, an absence of studies of the educational and informational aspects of telehealth in relation to speech-language pathology, and the use of telehealth in a limited range of communication disorders. Future research into the application of telehealth to speech-language pathology services must adopt a scientific approach, and have a well defined development and evaluation framework that addresses the effectiveness of the technique, patient outcomes and satisfaction, and the cost-benefit relationship", "fulltext": "", "keywords": "patient outcomes;telemedicine;cost-benefit analysis;cost-effectiveness;communication disorders;speech-language pathology;literature review;patient satisfaction;telehealth applications"}
{"name": "train_1494", "title": "Where have all the PC makers gone?", "abstract": "PC makers are dwindling. If you are planning to make a PC purchase soon, here are a few things to look out for before you buy", "fulltext": "", "keywords": "pc makers;pc purchase"}
{"name": "train_1495", "title": "Laptops zip to 2 GHz-plus", "abstract": "Intel's Pentium 4-M processor has reached the coveted 2-GHz mark, and speed-hungry mobile users will be tempted to buy a laptop with the chip. However, while our exclusive tests found 2-GHz P4-M notebooks among the fastest units we've tested, the new models failed to make dramatic gains compared with those based on Intel's 1.8-GHz mobile chip. Since 2-GHz notebooks carry a hefty price premium, buyers seeking both good performance and a good price might prefer a 1.8-GHz unit instead", "fulltext": "", "keywords": "intel pentium 4-m processor;notebooks;mobile;laptop;2 ghz"}
{"name": "train_1496", "title": "Web ad explosion", "abstract": "Financed by advertising dollars from big names, online marketers are embracing more aggressive tactics", "fulltext": "", "keywords": "web advertising;online marketers"}
{"name": "train_1497", "title": "Research challenges and perspectives of the Semantic Web", "abstract": "Accessing documents and services on today's Web requires human intelligence. The interface to these documents and services is the Web page, written in natural language, which humans must understand and act upon. The paper discusses the Semantic Web which will augment the current Web with formalized knowledge and data that computers can process. In the future, some services will mix human-readable and structured data so that both humans and computers can use them. Others will support formalized knowledge that only machines will use", "fulltext": "", "keywords": "internet;web page;formalized knowledge;artificial intelligence;document access;natural language;semantic web"}
{"name": "train_1498", "title": "John McCarthy: father of AI", "abstract": "If John McCarthy, the father of AI, were to coin a new phrase for \"artificial intelligence\" today, he would probably use \"computational intelligence.\" McCarthy is not just the father of AI, he is also the inventor of the Lisp (list processing) language. The author considers McCarthy's conception of Lisp and discusses McCarthy's recent research that involves elaboration tolerance, creativity by machines, free will of machines, and some improved ways of doing situation calculus", "fulltext": "", "keywords": "situation calculus;free will;father of ai;artificial intelligence;john mccarthy;elaboration tolerance;lisp;computational intelligence;list processing;creativity"}
{"name": "train_1499", "title": "A digital-driving system for smart vehicles", "abstract": "In the wake of the computer and information technology revolutions, vehicles are undergoing dramatic changes in their capabilities and how they interact with drivers. Although some vehicles can decide to either generate warnings for the human driver or control the vehicle autonomously, they must usually make these decisions in real time with only incomplete information. So, human drivers must still maintain control over the vehicle. I sketch a digital driving behavior model. By simulating and analyzing driver behavior during different maneuvers such as lane changing, lane following, and traffic avoidance, researchers participating in the Beijing Institute of Technology's digital-driving project will be able to examine the possible correlations or causal relations between the smart vehicle, IVISs, the intelligent road-traffic-information network, and the driver. We aim to successfully demonstrate that a digital-driving system can provide a direction for developing human-centered smart vehicles", "fulltext": "", "keywords": "maneuvers;human-centered smart vehicles;intelligence;in-vehicle information systems;intelligent road traffic information network;intelligent transportation systems;digital driving system;ecological driver-vehicle interface;intelligent driver-vehicle interface;vehicle control;traffic avoidance;lane following;lane changing;interactive communication"}
{"name": "train_15", "title": "Optimal and safe ship control as a multi-step matrix game", "abstract": "The paper describes the process of the safe ship control in a collision situation using a differential game model with j participants. As an approximated model of the manoeuvring process, a model of a multi-step matrix game is adopted here. RISKTRAJ computer program is designed in the Matlab language in order to determine the ship's trajectory as a certain sequence of manoeuvres executed by altering the course and speed, in the online navigator decision support system. These considerations are illustrated with examples of a computer simulation of the safe ship's trajectories in real situation at sea when passing twelve of the encountered objects", "fulltext": "", "keywords": "optimal control;differential game;ship control;trajectory tracking;multistep matrix game;online navigation;risktraj computer program;decision support system;collision avoidance"}
{"name": "train_150", "title": "Model checking games for branching time logics", "abstract": "This paper defines and examines model checking games for the branching time temporal logic CTL*. The games employ a technique called focus which enriches sets by picking out one distinguished element. This is necessary to avoid ambiguities in the regeneration of temporal operators. The correctness of these games is proved, and optimizations are considered to obtain model checking games for important fragments of CTL*. A game based model checking algorithm that matches the known lower and upper complexity bounds is sketched", "fulltext": "", "keywords": "temporal operators;complexity bounds;branching time logics;temporal logic;model checking games"}
{"name": "train_1500", "title": "DAML+OIL: an ontology language for the Semantic Web", "abstract": "By all measures, the Web is enormous and growing at a staggering rate, which has made it increasingly difficult-and important-for both people and programs to have quick and accurate access to Web information and services. The Semantic Web offers a solution, capturing and exploiting the meaning of terms to transform the Web from a platform that focuses on presenting information, to a platform that focuses on understanding and reasoning with information. To support Semantic Web development, the US Defense Advanced Research Projects Agency launched the DARPA Agent Markup Language (DAML) initiative to fund research in languages, tools, infrastructure, and applications that make Web content more accessible and understandable. Although the US government funds DAML, several organizations-including US and European businesses and universities, and international consortia such as the World Wide Web Consortium-have contributed to work on issues related to DAML's development and deployment. We focus on DAML's current markup language, DAML+OIL, which is a proposed starting point for the W3C's Semantic Web Activity's Ontology Web Language (OWL). We introduce DAML+OIL syntax and usage through a set of examples, drawn from a wine knowledge base used to teach novices how to build ontologies", "fulltext": "", "keywords": "daml+oil;darpa agent markup language;ontology web language;wine knowledge base;semantic web;syntax"}
{"name": "train_1501", "title": "Computational challenges in cell simulation: a software engineering approach", "abstract": "Molecular biology's advent in the 20th century has exponentially increased our knowledge about the inner workings of life. We have dozens of completed genomes and an array of high-throughput methods to characterize gene encodings and gene product operation. The question now is how we will assemble the various pieces. In other words, given sufficient information about a living cell's molecular components, can we predict its behavior? We introduce the major classes of cellular processes relevant to modeling, discuss software engineering's role in cell simulation, and identify cell simulation requirements. Our E-Cell project aims to develop the theories, techniques, and software platforms necessary for whole-cell-scale modeling, simulation, and analysis. Since the project's launch in 1996, we have built a variety of cell models, and we are currently developing new models that vary with respect to species, target subsystem, and overall scale", "fulltext": "", "keywords": "e-cell project;whole-cell-scale modeling;cell simulation;object-oriented design;molecular biology;software engineering"}
{"name": "train_1502", "title": "Mining open answers in questionnaire data", "abstract": "Surveys are important tools for marketing and for managing customer relationships; the answers to open-ended questions, in particular, often contain valuable information and provide an important basis for business decisions. The summaries that human analysts make of these open answers, however, tend to rely too much on intuition and so aren't satisfactorily reliable. Moreover, because the Web makes it so easy to take surveys and solicit comments, companies are finding themselves inundated with data from questionnaires and other sources. Handling it all manually would be not only cumbersome but also costly. Thus, devising a computer system that can automatically mine useful information from open answers has become an important issue. We have developed a survey analysis system that works on these principles. The system mines open answers through two statistical learning techniques: rule learning (which we call rule analysis) and correspondence analysis", "fulltext": "", "keywords": "text mining system;open answer mining;rule analysis;correspondence analysis;survey analysis;statistical learning techniques;questionnaire data;natural language response analysis"}
{"name": "train_1503", "title": "Neural networks for web content filtering", "abstract": "With the proliferation of harmful Internet content such as pornography, violence, and hate messages, effective content-filtering systems are essential. Many Web-filtering systems are commercially available, and potential users can download trial versions from the Internet. However, the techniques these systems use are insufficiently accurate and do not adapt well to the ever-changing Web. To solve this problem, we propose using artificial neural networks to classify Web pages during content filtering. We focus on blocking pornography because it is among the most prolific and harmful Web content. However, our general framework is adaptable for filtering other objectionable Web material", "fulltext": "", "keywords": "violence;harmful web content;learning capabilities;web page classification;artificial neural networks;pornographic/nonpornographic web page differentiation;intelligent classification engine;web content filtering"}
{"name": "train_1504", "title": "Designing human-centered distributed information systems", "abstract": "Many computer systems are designed according to engineering and technology principles and are typically difficult to learn and use. The fields of human-computer interaction, interface design, and human factors have made significant contributions to ease of use and are primarily concerned with the interfaces between systems and users, not with the structures that are often more fundamental for designing truly human-centered systems. The emerging paradigm of human-centered computing (HCC)-which has taken many forms-offers a new look at system design. HCC requires more than merely designing an artificial agent to supplement a human agent. The dynamic interactions in a distributed system composed of human and artificial agents-and the context in which the system is situated-are indispensable factors. While we have successfully applied our methodology in designing a prototype of a human-centered intelligent flight-surgeon console at NASA Johnson Space Center, this article presents a methodology for designing human-centered computing systems using electronic medical records (EMR) systems", "fulltext": "", "keywords": "human-centered distributed information systems design;human-computer interaction;nasa johnson space center;multiple analysis levels;electronic medical records systems;human-centered intelligent flight surgeon console;distributed cognition;interface design;artificial agents;human agents;human factors;human-centered computing systems"}
{"name": "train_1505", "title": "Modeling and simulating practices, a work method for work systems design", "abstract": "Work systems involve people engaging in activities over time-not just with each other, but also with machines, tools, documents, and other artifacts. These activities often produce goods, services, or-as is the case in the work system described in this article-scientific data. Work systems and work practice evolve slowly over time. The integration and use of technology, the distribution and collocation of people, organizational roles and procedures, and the facilities where the work occurs largely determine this evolution", "fulltext": "", "keywords": "communication;teamwork;problem solving;learning behavior;work practice simulation;complex system interactions;tool usage;work practice modeling;work system design method;workspace usage;collaboration;human activity"}
{"name": "train_1506", "title": "Intelligent control of life support for space missions", "abstract": "Future manned space operations will include a greater use of automation than we currently see. For example, semiautonomous robots and software agents will perform difficult tasks while operating unattended most of the time. As these automated agents become more prevalent, human contact with them will occur more often and become more routine, so designing these automated agents according to the principles of human-centered computing is important. We describe two cases of semiautonomous control software developed and fielded in test environments at the NASA Johnson Space Center. This software operated continuously at the JSC and interacted closely with humans for months at a time", "fulltext": "", "keywords": "semiautonomous control software;life support;nasa johnson space center;human intervention;space missions;automation;automated agents;semiautonomous robots;crew water recovery;manned space operations;intelligent control;software agents;crew air regeneration"}
{"name": "train_1507", "title": "Ethnography, customers, and negotiated interactions at the airport", "abstract": "In the late 1990s, tightly coordinated airline schedules unraveled owing to massive delays resulting from inclement weather, overbooked flights, and airline operational difficulties. As schedules slipped, the delayed departures and late arrivals led to systemwide breakdowns, customers missed their connections, and airline work activities fell further out of sync. In offering possible answers, we emphasize the need to consider the customer as participant, following the human-centered computing model. Our study applied ethnographic methods to understand the airline system domain and the nature of airline delays, and it revealed the deficiencies of the airline production system model of operations. The research insights that led us to shift from a production and marketing system perspective to a customer-as-participant view might appear obvious to some readers. However, we do not know of any airline that designs its operations and technologies around any other model than the production and marketing system view. Our human-centered analysis used ethnographic methods to gather information, offering new insight into airline delays and suggesting effective ways to improve operations reliability", "fulltext": "", "keywords": "airline delays;employees;operations reliability;negotiated interactions;airports;human-centered computing model;customer trajectories;customer-as-participant view;ethnography;airline production system operations model"}
{"name": "train_1508", "title": "Rats, robots, and rescue", "abstract": "In early May, media inquiries started arriving at my office at the Center for Robot-Assisted Search and Rescue (www.crasar.org). Because I'm CRASAR's director, I thought the press was calling to follow up on the recent humanitarian award given to the center's founder, John Blitch, for successfully using small, backpackable robots at the World Trade Center disaster. Instead, I found they were asking me to comment on the \"roborats\" study in the 2 May 2002 Nature. In this study, rats with medial force brain implants underwent operant conditioning to force them into a form of guided behavior, one aspect of which was thought useful for search and rescue. The article's closing comment suggested that a guided rat could serve as both a mobile robot and a biological sensor. Although a roboticist by training, I'm committed to any technology that will help save lives while reducing the risk to rescuers. But rats?", "fulltext": "", "keywords": "biological sensor;guided rat;mobile robot;robot-assisted search and rescue"}
{"name": "train_1509", "title": "Mathematical modelling of the work of the system of wells in a layer with the", "abstract": "exponential law of permeability variation and the mobile liquid interface We construct and study a two-dimensional model of the work of the system of wells in a layer with the mobile boundary between liquids of various viscosity. We use a 'plunger' displacement model of liquids. The boundaries of the filtration region of these liquids are modelled by curves of the Lyapunov class. Unlike familiar work, we solve two-dimensonal problems in an inhomogeneous layer when the mobile boundary and the boundaries of the filtration region are modelled by curves of the Lyapunov class. We show the practical convergence of the numerical solution of the problems studied", "fulltext": "", "keywords": "exponential law;lyapunov class curves;mathematical modelling;mobile boundary;permeability variation;2d model;plunger displacement model;numerical solution;viscosity;inhomogeneous layer;convergence;filtration region boundaries;well system;work;mobile liquid interface"}
{"name": "train_151", "title": "Extending CTL with actions and real time", "abstract": "In this paper, we present the logic ATCTL, which is intended to be used for model checking models that have been specified in a lightweight version of the Unified Modelling Language (UML). Elsewhere, we have defined a formal semantics for LUML to describe the models. This paper's goal is to give a specification language for properties that fits LUML; LUML includes states, actions and real time. ATCTL extends CTL with concurrent actions and real time. It is based on earlier extensions of CTL by R. De Nicola and F. Vaandrager (ACTL) (1990) and R. Alur et aL (TCTL) (1993). This makes it easier to adapt existing model checkers to ATCTL. To show that we can check properties specified in ATCTL in models specified in LUML, we give a small example using the Kronos model checker", "fulltext": "", "keywords": "model checking models;real time logic;specification language;formal semantics;logic atctl;unified modelling language;actions;computation tree logic;kronos model checker"}
{"name": "train_1510", "title": "Estimation of the gradient of the solution of an adjoint diffusion equation by", "abstract": "the Monte Carlo method For the case of isotropic diffusion we consider the representation of the weighted concentration of trajectories and its space derivatives in the form of integrals (with some weights) of the solution to the corresponding boundary value problem and its directional derivative of a convective velocity. If the convective velocity at the domain boundary is degenerate and some other additional conditions are imposed this representation allows us to construct an efficient 'random walk by spheres and balls' algorithm. When these conditions are violated, transition to modelling the diffusion trajectories by the Euler scheme is realized, and the directional derivative of velocity is estimated by the dependent testing method, using the parallel modelling of two closely-spaced diffusion trajectories. We succeeded in justifying this method by statistically equivalent transition to modelling a single trajectory after the first step in the Euler scheme, using a suitable weight. This weight also admits direct differentiation with respect to the initial coordinate along a given direction. The resulting weight algorithm for calculating concentration derivatives is especially efficient if the initial point is in the subdomain in which the coefficients of the diffusion equation are constant", "fulltext": "", "keywords": "random walk by spheres and balls algorithm;weighted trajectory concentration;closely-spaced diffusion trajectories;directional derivative;weight;diffusion trajectories;monte carlo method;adjoint diffusion equation;gradient estimation;space derivatives;euler scheme;domain boundary;statistically equivalent transition;direct differentiation;initial coordinate;dependent testing method;isotropic diffusion;boundary value problem;convective velocity;concentration derivatives;integrals;parallel modelling"}
{"name": "train_1511", "title": "Efficient algorithms for stiff elliptic problems with large parameters", "abstract": "We consider a finite element approximation and iteration algorithms for solving stiff elliptic boundary value problems with large parameters in front of a higher derivative. The convergence rate of the algorithms is independent of the spread in coefficients and a discretization parameter", "fulltext": "", "keywords": "higher derivative;large parameters;stiff elliptic boundary value problems;convergence rate;finite element approximation;iteration algorithms;efficient algorithms"}
{"name": "train_1512", "title": "Mathematical aspects of computer-aided share trading", "abstract": "We consider problems of statistical analysis of share prices and propose probabilistic characteristics to describe the price series. We discuss three methods of mathematical modelling of price series with given probabilistic characteristics", "fulltext": "", "keywords": "mathematical modelling;probabilistic characteristics;computer-aided share trading;share price;statistical analysis;price series"}
{"name": "train_1513", "title": "Solution of the reconstruction problem of a source function in the", "abstract": "coagulation-fragmentation equation We study the problem of reconstructing a source function in the kinetic coagulation-fragmentation equation. The study is based on optimal control methods, the solvability theory of operator equations, and the use of iteration algorithms", "fulltext": "", "keywords": "solvability;kinetic coagulation-fragmentation equation;optimal control methods;operator equations;iteration algorithms;source function reconstruction"}
{"name": "train_1514", "title": "Universal parametrization in constructing smoothly-connected B-spline surfaces", "abstract": "In this paper, we explore the feasibility of universal parametrization in generating B-spline surfaces, which was proposed recently in the literature (Lim, 1999). We present an interesting property of the new parametrization that it guarantees Go continuity on B-spline surfaces when several independently constructed patches are put together without imposing any constraints. Also, a simple blending method of patchwork is proposed to construct C/sup n-1/ surfaces, where overlapping control nets are utilized. It takes into account the semi-localness property of universal parametrization. It effectively helps us construct very natural looking B-spline surfaces while keeping the deviation from given data points very low. Experimental results are shown with several sets of surface data points", "fulltext": "", "keywords": "universal parametrization;overlapping control nets;smoothly-connected b-spline surface generation;c/sup n-1/ surfaces;patches;semi-localness property;patchwork blending method;surface data points;g/sup 0/ continuity"}
{"name": "train_1515", "title": "p-Bezier curves, spirals, and sectrix curves", "abstract": "We elucidate the connection between Bezier curves in polar coordinates, also called p-Bezier or focal Bezier curves, and certain families of spirals and sectrix curves. p-Bezier curves are the analogue in polar coordinates of nonparametric Bezier curves in Cartesian coordinates. Such curves form a subset of rational Bezier curves characterized by control points on radial directions regularly spaced with respect to the polar angle, and weights equal to the inverse of the polar radius. We show that this subset encompasses several classical sectrix curves, which solve geometrically the problem of dividing an angle into equal spans, and also spirals defining the trajectories of particles in central fields. First, we identify as p-Bezier curves a family of sinusoidal spirals that includes Tschirnhausen's cubic. Second, the trisectrix of Maclaurin and their generalizations, called arachnidas. Finally, a special class of epi spirals that encompasses the trisectrix of Delanges", "fulltext": "", "keywords": "sectrix curves;rational bezier curves;particle trajectories;epi spirals;cubic;polar angle;central fields;angle division;equal spans;focal bezier curves;spirals;polar coordinates;arachnidas;geometry;radial directions;sinusoidal spirals;p-bezier curves;control points;trisectrix"}
{"name": "train_1516", "title": "Using duality to implicitize and find cusps and inflection points of Bezier", "abstract": "curves A planar algebraic curve C has an implicit equation and a tangential equation. The tangential equation defines a dual curve to C. Starting with a parametrization of C, we find a parametrization of the dual curve, and the tangential equation and implicit equation of C in a novel way. We also find equations whose roots are the parameter values of the cusps and inflection points of C. Methods include polar reciprocation and the theory of envelopes", "fulltext": "", "keywords": "bezier curves;planar algebraic curve;inflection points;envelope theory;cusps;tangential equation;parametrization;polar reciprocation;implicit equation;dual curve"}
{"name": "train_1517", "title": "Minimizing blossoms under symmetric linear constraints", "abstract": "In this paper, we show that there exists a close dependence between the control polygon of a polynomial and the minimum of its blossom under symmetric linear constraints. We consider a given minimization problem P, for which a unique solution will be a point delta on the Bezier curve. For the minimization function f, two sufficient conditions exist that ensure the uniqueness of the solution, namely, the concavity of the control polygon of the polynomial and the characteristics of the Polya frequency-control polygon where the minimum coincides with a critical point of the polynomial. The use of the blossoming theory provides us with a useful geometrical interpretation of the minimization problem. In addition, this minimization approach leads us to a new method of discovering inequalities about the elementary symmetric polynomials", "fulltext": "", "keywords": "concavity;critical point;elementary symmetric polynomials;symmetric linear constraints;bezier curve;polynomial;geometrical interpretation;inequalities;polya frequency-control polygon;control polygon;blossom minimization"}
{"name": "train_1518", "title": "Explicit matrix representation for NURBS curves and surfaces", "abstract": "The matrix forms for curves and surfaces were largely promoted in CAD/CAM. In this paper we have presented two matrix representation formulations for arbitrary degree NURBS curves and surfaces explicitly other than recursively. The two approaches are derived from the computation of divided difference and the Marsden identity respectively. The explicit coefficient matrix of B-spline with equally spaced knot and Bezier curves and surfaces can be obtained by these formulae. The coefficient formulae and the coefficient matrix formulae developed in this paper express non-uniform B-spline functions of arbitrary degree in explicit polynomial and matrix forms.. They are useful for the evaluation and the conversion of NURBS curves and surfaces, in CAD/CAM systems", "fulltext": "", "keywords": "b-spline;nurbs curves;nonuniform b-spline functions;bezier curves;equally spaced knot;explicit polynomial forms;explicit coefficient matrix;explicit matrix forms;nurbs surfaces;coefficient matrix formulae;cad/cam;bezier surfaces;explicit matrix representation;coefficient formulae;marsden identity;matrix representation formulations;divided difference"}
{"name": "train_1519", "title": "Structural invariance of spatial Pythagorean hodographs", "abstract": "The structural invariance of the four-polynomial characterization for three-dimensional Pythagorean hodographs introduced by Dietz et al. (1993), under arbitrary spatial rotations, is demonstrated. The proof relies on a factored-quaternion representation for Pythagorean hodographs in three-dimensional Euclidean space-a particular instance of the \"PH representation map\" proposed by Choi et al. (2002)-and the unit quaternion description of spatial rotations. This approach furnishes a remarkably simple derivation for the polynomials u(t), upsilon (t), p(t), q(t) that specify the canonical form of a rotated Pythagorean hodograph, in terms of the original polynomials u(t), upsilon (t), p(t), q(t) and the angle theta and axis n of the spatial rotation. The preservation of the canonical form of PH space curves under arbitrary spatial rotations is essential to their incorporation into computer-aided design and manufacturing applications, such as the contour machining of free-form surfaces using a ball-end mill and realtime PH curve CNC interpolators", "fulltext": "", "keywords": "ph representation map;ball-end mill;structural invariance;arbitrary spatial rotations;3d pythagorean hodographs;cad/cam;real-time ph curve cnc interpolators;spatial pythagorean hodographs;free-form surfaces;unit quaternion description;spatial rotations;factored quaternion representation;four-polynomial characterization;3d euclidean space;contour machining"}
{"name": "train_152", "title": "Linear tense logics of increasing sets", "abstract": "We provide an extension of the language of linear tense logic with future and past connectives F and P, respectively, by a modality that quantifies over the points of some set which is assumed to increase in the course of time. In this way we obtain a general framework for modelling growth qualitatively. We develop an appropriate logical system, prove a corresponding completeness and decidability result and discuss the various kinds of flow of time in the new context. We also consider decreasing sets briefly", "fulltext": "", "keywords": "temporal reasoning;completeness;future and past connectives;decreasing sets;decidability;logical system;linear tense logic"}
{"name": "train_1520", "title": "Uniform hyperbolic polynomial B-spline curves", "abstract": "This paper presents a new kind of uniform splines, called hyperbolic polynomial B-splines, generated over the space Omega =span{sinh t, cosh t, t/sup k-3/, t/sup k-3/, t/sup k-4/, ..., t 1} in which k is an arbitrary integer larger than or equal to 3. Hyperbolic polynomial B-splines share most of the properties of B-splines in polynomial space. We give subdivision formulae for this new kind of curve and then prove that they have variation diminishing properties and the control polygons of the subdivisions converge. Hyperbolic polynomial B-splines can handle freeform curves as well as remarkable curves such as the hyperbola and the catenary. The generation of tensor product surfaces using these new splines is straightforward. Examples of such tensor product surfaces: the saddle surface, the catenary cylinder, and a certain kind of ruled surface are given", "fulltext": "", "keywords": "uniform hyperbolic polynomial b-spline curves;catenary cylinder;arbitrary integer;subdivisions;tensor product surface generation;subdivision formulae;saddle surface;freeform curves;ruled surface;catenary;control polygons;hyperbola"}
{"name": "train_1521", "title": "Optimal multi-degree reduction of Bezier curves with constraints of endpoints", "abstract": "continuity Given a Bezier curve of degree n, the problem of optimal multi-degree reduction (degree reduction of more than one degree) by a Bezier curve of degree m (m<n-1) with constraints of endpoint continuity is investigated. With respect to L/sub 2/ norm, this paper presents an approximate method (MDR by L/sub 2/) that gives an explicit solution to deal with it. The method has good properties of endpoint interpolation: continuity of any r, s (r, s>or=0) orders can be preserved at two endpoints respectively. The method in the paper performs multi-degree reduction at one time and does not need stepwise computing. When applied to multi-degree reduction with endpoint continuity of any order, the MDR by L/sub 2/ obtains the best least squares approximation. Comparison with another method of multi-degree reduction (MDR by L/sub infinity /), which achieves the nearly best uniform approximation with respect to L/sub infinity / norm, is also given. The approximate effect of the MDR by L/sub 2/ is better than that of the MDR by L/sub infinity /. Explicit approximate error analysis of the multi-degree reduction methods is presented", "fulltext": "", "keywords": "bezier curves;uniform approximation;endpoint continuity constraints;optimal multi-degree reduction;endpoint interpolation;explicit approximate error analysis;least squares approximation;approximate method;explicit solution"}
{"name": "train_1522", "title": "Waltzing through Port 80 [Web security]", "abstract": "Web services follow the trusting model of the Internet, but allow ever more powerful payloads to travel between businesses and consumers. Before you leap online, the author advises to scan the security concerns and the available fixes. He looks at how we define and store Web services and incorporate them into business processes", "fulltext": "", "keywords": "internet;trust;data security;business processes;web services"}
{"name": "train_1523", "title": "Process specialization: defining specialization for state diagrams", "abstract": "A precise definition of specialization and inheritance promises to be as useful in organizational process modeling as it is in object modeling. It would help us better understand, maintain, reuse, and generate process models. However, even though object-oriented analysis and design methodologies take full advantage of the object specialization hierarchy, the process specialization hierarchy is not supported in major process representations, such as the state diagram, data flow diagram, and UML representations. Partly underlying this lack of support is an implicit assumption that we can always specialize a process by treating it as \"just another object.\" We argue in this paper that this is not so straightforward as it might seem; we argue that a process-specific approach must be developed. We propose such an approach in the form of a set of transformations which, when applied to a process description, always result in specialization. We illustrate this approach by applying it to the state diagram representation and demonstrate that this approach to process specialization is not only theoretically possible, but shows promise as a method for categorizing and analyzing processes. We point out apparent inconsistencies between our notion of process specialization and existing work on object specialization but show that these inconsistencies are superficial and that the definition we provide is compatible with the traditional notion of specialization", "fulltext": "", "keywords": "inheritance;object-oriented analysis;state diagrams;organizational process modeling;object specialization hierarchy;process representation;object-oriented design;process specialization"}
{"name": "train_1524", "title": "Organizational design, information transfer, and the acquisition of", "abstract": "rent-producing resources Within the resource-based view of the firm, a dynamic story has emerged in which the knowledge accumulated over the history of a firm and embedded in organizational routines and structures influences the firm's ability to recognize the value of new resources and capabilities. This paper explores the possibility of firms to select organizational designs that increase the likelihood that they will recognize and value rent-producing resources and capabilities. A computational model is developed to study the tension between an organization's desire to explore its environment for new capabilities and the organization's need to exploit existing capabilities. Support is provided for the proposition that integration, both externally and internally, is an important source of dynamic capability. The model provides greater insight into the tradeoffs between these two forms of integration and suggests when one form may be preferred over another. In particular, evidence is provided that in uncertain environments, the ability to explore possible alternatives is critical while in more certain environments, the ability to transfer information internally is paramount", "fulltext": "", "keywords": "investments;business strategy;organizational design;computational model;information transfer;probability;social networks;uncertain environments;rent-producing resources;certain environments"}
{"name": "train_1525", "title": "Dependence graphs: dependence within and between groups", "abstract": "This paper applies the two-party dependence theory (Castelfranchi, Cesta and Miceli, 1992, in Y. Demazeau and E. Werner (Eds.) Decentralized AI-3, Elsevier, North Holland) to modelling multiagent and group dependence. These have theoretical potentialities for the study of emerging groups and collective structures, and more generally for understanding social and organisational complexity, and practical utility for both social-organisational and agent systems purposes. In the paper, the dependence theory is extended to describe multiagent links, with a special reference to group and collective phenomena, and is proposed as a framework for the study of emerging social structures, such as groups and collectives. In order to do so, we propose to extend the notion of dependence networks (applied to a single agent) to dependence graphs (applied to an agency). In its present version, the dependence theory is argued to provide (a) a theoretical instrument for the study of social complexity, and (b) a computational system for managing the negotiation process in competitive contexts and for monitoring complexity in organisational and other cooperative contexts", "fulltext": "", "keywords": "collective structures;two-party dependence theory;group dependence;multiagent dependence;agent systems;emerging groups;dependence graphs;multiagent systems;organisational complexity;dependence networks;social complexity"}
{"name": "train_1526", "title": "GK-DEVS: Geometric and kinematic DEVS formalism for simulation modeling of", "abstract": "3-dimensional multi-component systems A combined discrete/continuous simulation methodology based on the DEVS (discrete event system specification) formalism is presented in this paper that satisfies the simulation requirements of 3-dimensional and dynamic systems with multi-components. We propose a geometric and kinematic DEVS (GK-DEVS) formalism that is able to describe the geometric and kinematic structure of a system and its continuous state dynamics as well as the interaction among the multi-components. To establish one model having dynamic behavior and a particular hierarchical structure, the atomic and the coupled model of the conventional DEVS are merged into one model in the proposed formalism. For simulation of the continuous motion of 3-D components, the sequential state set is partitioned into the discrete and the continuous state set and the rate of change function over the continuous state set is employed. Although modified from the conventional DEVS formalism, the GK-DEVS formalism preserves a hierarchical, modular modeling fashion and a coupling scheme. Furthermore, for the GK-DEVS model simulation, we propose an abstract simulation algorithm, called a GK-Simulator, in which data and control are separated and events are scheduled not globally but hierarchically so that an object-oriented principle is satisfied. The proposed GK-DEVS formalism and the GK-Simulator algorithm have been applied to the simulation of a flexible manufacturing system consisting of a 2-axis lathe, a 3-axis milling machine, and a vehicle-mounted robot", "fulltext": "", "keywords": "object-oriented principle;continuous motion;geometric devs;gk-devs;simulation requirements;3 dimensional multi-component systems;vehicle-mounted robot;3-axis milling machine;kinematic devs;continuous state dynamics;abstract simulation algorithm;sequential state set;dynamic behavior;gk-simulator;simulation modeling;combined discrete/continuous simulation methodology;flexible manufacturing system;2-axis lathe"}
{"name": "train_1527", "title": "Using DEVS formalism to operationalize ELP models for diagnosis in SACHEM", "abstract": "This paper describes an original approach to discrete event control of continuous processes by means of expert knowledge. We present an application of this approach on the SACHEM diagnosis subsystem. The SACHEM system is a large-scale knowledge-based system that aims in helping a set of operators to control the dynamics of complex continuous systems (e.g., blast furnaces). The proposed method is based on: (i) The definition of a language facilitating the acquisition and representation of expert knowledge, called ELP (Expert Language Process); (ii) The use of the DEVS formalism to make ELP models operational; (iii) Algorithms for exploiting operational models", "fulltext": "", "keywords": "complex continuous systems;expert knowledge;discrete event control;knowledge acquisition;sachem system;devs;knowledge representation;continuous processes;sachem;elp models"}
{"name": "train_1528", "title": "DEVS simulation of distributed intrusion detection systems", "abstract": "An intrusion detection system (IDS) attempts to identify unauthorized use, misuse, and abuse of computer and network systems. As intrusions become more sophisticated, dealing with them moves beyond the scope of one IDS. The need arises for systems to cooperate with one another, to manage diverse attacks across networks. The feature of recent attacks is that the packet delivery is moderately slow, and the attack sources and attack targets are distributed. These attacks are called \"stealthy attacks.\" To detect these attacks, the deployment of distributed IDSs is needed. In such an environment, the ability of an IDS to share advanced information about these attacks is especially important. In this research, the IDS model exploits blacklist facts to detect the attacks that are based on either slow or highly distributed packets. To maintain the valid blacklist facts in the knowledge base of each IDS, the model should communicate with the other IDSs. When attack level goes beyond the interaction threshold, ID agents send interaction messages to ID agents in other hosts. Each agent model is developed as an interruptible atomic-expert model in which the expert system is embedded as a model component", "fulltext": "", "keywords": "distributed intrusion detection system;intrusion detection system;ids;cooperative intrusion detection;warning threshold;intrusions;expert system"}
{"name": "train_1529", "title": "Quantized-State Systems: A DEVS-approach for continuous system simulation", "abstract": "A new class of dynamical systems, Quantized State Systems or QSS, is introduced in this paper. QSS are continuous time systems where the input trajectories are piecewise constant functions and the state variable trajectories - being themselves piecewise linear functions - are converted into piecewise constant functions via a quantization function equipped with hysteresis. It is shown that QSS can be exactly represented and simulated by a discrete event model, within the framework of the DEVS-approach. Further, it is shown that QSS can be used to approximate continuous systems, thus allowing their discrete-event simulation in opposition to the classical discrete-time simulation. It is also shown that in an approximating QSS, some stability properties of the original system are conserved and the solutions of the QSS go to the solutions of the original system when the quantization goes to zero", "fulltext": "", "keywords": "continuous time systems;dynamical systems;discrete-event simulation;discrete event model;piecewise constant functions;quantized state systems"}
{"name": "train_153", "title": "On the relationship between omega -automata and temporal logic normal forms", "abstract": "We consider the relationship between omega -automata and a specific logical formulation based on a normal form for temporal logic formulae. While this normal form was developed for use with execution and clausal resolution in temporal logics, we show how it can represent, syntactically, omega -automata in a high-level way. Technical proofs of the correctness of this representation are given", "fulltext": "", "keywords": "omega -automata;temporal logic normal forms;logical formulation;program correctness;clausal resolution"}
{"name": "train_1530", "title": "Uniform supersaturated design and its construction", "abstract": "Supersaturated designs are factorial designs in which the number of main effects is greater than the number of experimental runs. In this paper, a discrete discrepancy is proposed as a measure of uniformity for supersaturated designs, and a lower bound of this discrepancy is obtained as,a benchmark of design uniformity. A construction method for uniform supersaturated designs via resolvable balanced incomplete block designs is also presented along with the investigation of properties of the resulting designs. The construction method shows a strong link between these two different kinds of designs", "fulltext": "", "keywords": "uniform supersaturated design;factorial designs;experimental runs;discrete discrepancy;resolvable balanced incomplete block designs"}
{"name": "train_1531", "title": "Average optimization of the approximate solution of operator equations and its", "abstract": "application In this paper, a definition of the optimization of operator equations in the average case setting is given. And the general result about the relevant optimization problem is obtained. This result is applied to the optimization of approximate solution of some classes of integral equations", "fulltext": "", "keywords": "integral n-width;average case setting;optimization;operator equations;gaussian measure;integral equations"}
{"name": "train_1532", "title": "Dedekind zeta-functions and Dedekind sums", "abstract": "In this paper we use Dedekind zeta functions of two real quadratic number fields at -1 to denote Dedekind sums of high rank. Our formula is different from that of Siegel's (1969). As an application, we get a polynomial representation of zeta /sub K/(-1) = zeta /sub K/(-1) = 1/45(26n/sup 3/ - 41n +or- 9), n identical to +or-2(mod 5), where K = Q( square root (5q)), prime q = 4n/sup 2/ + 1, and the class number of quadratic number field K/sub 2/ = Q( square root q) is 1", "fulltext": "", "keywords": "dedekind sums;real quadratic number fields;dedekind zeta-functions;polynomial representation"}
{"name": "train_1533", "title": "Generic simulation approach for multi-axis machining. Part 2: model calibration", "abstract": "and feed rate scheduling For Part 1 see ibid. vol.124 (2002). This is the second part of a two-part paper presenting a new methodology for analytically simulating multi-axis machining of complex sculptured surfaces. The first section of this paper offers a detailed explanation of the model calibration procedure. A new methodology is presented for accurately determining the cutting force coefficients for multi-axis machining. The force model presented in Part 1 is reformulated so that the cutting force coefficients account for the effects of feed rate, cutting speed, and a complex cutting edge design. Experimental results are presented for the calibration procedure. Model verification tests were conducted with these cutting force coefficients. These tests demonstrate that the predicted forces are within 5% of experimentally measured forces. Simulated results are also shown for predicting dynamic cutting forces and static/dynamic tool deflection. The second section of the paper discusses how the modeling methodology can be applied for feed rate scheduling in an industrial application. A case study for process optimization of machining an airfoil-like surface is used for demonstration. Based on the predicted instantaneous chip load and/or a specified force constraint, the feed rate scheduling is utilized to increase the metal removal rate. The feed rate scheduling implementation results in a 30% reduction in machining time for the airfoil-like surface", "fulltext": "", "keywords": "cutting force coefficients;model calibration;cutting edge design;optimization;metal removal rate;multiple axis machining;complex sculptured surfaces;generic simulation;feed rate scheduling;force model"}
{"name": "train_1534", "title": "Generic simulation approach for multi-axis machining. Part 1: modeling", "abstract": "methodology This paper presents a new methodology for analytically simulating multi-axis machining of complex sculptured surfaces. A generalized approach is developed for representing an arbitrary cutting edge design, and the local surface topology of a complex sculptured surface. A NURBS curve is used to represent the cutting edge profile. This approach offers the advantages of representing any arbitrary cutting edge design in a generic way, as well as providing standardized techniques for manipulating the location and orientation of the cutting edge. The local surface topology of the part is defined as those surfaces generated by previous tool paths in the vicinity of the current tool position. The local surface topology of the part is represented without using a computationally expensive CAD system. A systematic prediction technique is then developed to determine the instantaneous tool/part interaction during machining. The methodology employed here determines the cutting edge in-cut segments by determining the intersection between the NURBS curve representation of the cutting edge and the defined local surface topology. These in-cut segments are then utilized for predicting instantaneous chip load, static and dynamic cutting forces, and tool deflection. Part 1 of this paper details the modeling methodology and demonstrates the capabilities of the simulation for machining a complex surface", "fulltext": "", "keywords": "complex surface machining;systematic prediction;tool path specification;surface topology;nurbs curve;multiple axis machining;complex sculptured surfaces;generic modeling;cutting edge profile"}
{"name": "train_1535", "title": "Hot controllers", "abstract": "Over the last few years, the semiconductor industry has put much emphasis on ways to improve the accuracy of thermal mass flow controllers (TMFCs). Although issues involving TMFC mounting orientation and pressure effects have received much attention, little has been done to address the effect of changes in ambient temperature or process gas temperature. Scientists and engineers at Qualiflow have succeeded to solve the problem using a temperature correction algorithm for digital TMFCs. Using an in situ environmental temperature compensation technique, we calculated correction factors for the temperature effect and obtained satisfactory results with both the traditional sensor and the new, improved thin-film sensors", "fulltext": "", "keywords": "semiconductor manufacturing;temperature correction algorithm;process gas flow;thermal mass flow controller;in situ environmental temperature compensation"}
{"name": "train_1536", "title": "Connection management for QoS service on the Web", "abstract": "The current Web service model treats all requests equivalently, both while being processed by servers and while being transmitted over the network. For some uses, such as multiple priority schemes, different levels of service are desirable. We propose application-level TCP connection management mechanisms for Web servers to provide two different levels of Web service, high and low service, by setting different time-outs for inactive TCP connections. We evaluated the performance of the mechanism under heavy and light loading conditions on the Web server. Our experiments show that, though heavy traffic saturates the network, high level class performance is improved by as much as 25-28%. Therefore, this mechanism can effectively provide QoS guaranteed services even in the absence of operating system and network supports", "fulltext": "", "keywords": "internet;time-outs;quality of service;tcp connections;web service model;telecommunication traffic;web transaction;client server system;connection management"}
{"name": "train_1537", "title": "Technology on social issues of videoconferencing on the Internet: a survey", "abstract": "Constant advances in audio/video compression, the development of the multicast protocol as well as fast improvement in computing devices (e.g. higher speed, larger memory) have set forth the opportunity to have resource demanding videoconferencing (VC) sessions on the Internet. Multicast is supported by the multicast backbone (Mbone), which is a special portion of the Internet where this protocol is being deployed. Mbone VC tools are steadily emerging and the user population is growing fast. VC is a fascinating application that has the potential to greatly impact the way we remotely communicate and work. Yet, the adoption of VC is not as fast as one could have predicted. Hence, it is important to examine the factors that affect a widespread adoption of VC. This paper examines the enabling technology and the social issues. It discusses the achievements and identifies the future challenges. It suggests an integration of many emerging multimedia tools into VC in order to enhance its versatility for more effectiveness", "fulltext": "", "keywords": "internet;mbone;multimedia;data compression;multicast protocol;social issues;multicast backbone;videoconferencing"}
{"name": "train_1538", "title": "A heuristic approach to resource locations in broadband networks", "abstract": "In broadband networks, such as ATM, the importance of dynamic migration of data resources is increasing because of its potential to improve performance especially for transaction processing. In environments with migratory data resources, it is necessary to have mechanisms to manage the locations of each data resource. In this paper, we present an algorithm that makes use of system state information and heuristics to manage locations of data resources in a distributed network. In the proposed algorithm, each site maintains information about state of other sites with respect to each data resource of the system and uses it to find: (1) a subset of sites likely to have the requested data resource; and (2) the site where the data resource is to be migrated from the current site. The proposed algorithm enhances its effectiveness by continuously updating system state information stored at each site. It focuses on reducing the overall average time delay needed by the transaction requests to locate and access the migratory data resources. We evaluated the performance of the proposed algorithm and also compared it with one of the existing location management algorithms, by simulation studies under several system parameters such as the frequency of requests generation, frequency of data resource migrations, network topology and scale of network. The experimental results show the effectiveness of the proposed algorithm in all cases", "fulltext": "", "keywords": "broadband networks;resource locations;distributed network;network topology;atm;data resource migrations;heuristics"}
{"name": "train_1539", "title": "Comments on some recent methods for the simultaneous determination of", "abstract": "polynomial zeros In this note we give some comments on the recent results concerning a simultaneous method of the fourth-order for finding complex zeros in circular interval arithmetic. The main discussion is directed to a rediscovered iterative formula and its modification, presented recently in Sun and Kosmol, (2001). The presented comments include some critical parts of the papers Petkovic, Trickovic, Herceg, (1998) and Sun and Kosmol, (2001) which treat the same subject", "fulltext": "", "keywords": "zeros;polynomial;complex zeros;iterative formula;circular interval arithmetic"}
{"name": "train_154", "title": "Verifying concurrent systems with symbolic execution", "abstract": "Current techniques for interactively proving temporal properties of concurrent systems translate transition systems into temporal formulas by introducing program counter variables. Proofs are not intuitive, because control flow is not explicitly considered. For sequential programs symbolic execution is a very intuitive, interactive proof strategy. In this paper we adopt this technique for parallel programs. Properties are formulated in interval temporal logic. An implementation in the interactive theorem prover KIV has shown that this technique offers a high degree of automation and allows simple, local invariants", "fulltext": "", "keywords": "symbolic execution;concurrent systems verification;concurrent systems;parallel programs;temporal properties;interactive theorem prover kiv;sequential programs;program counter variables;temporal formulas;transition systems;local invariants"}
{"name": "train_1540", "title": "Adaptive thinning for bivariate scattered data", "abstract": "This paper studies adaptive thinning strategies for approximating a large set of scattered data by piecewise linear functions over triangulated subsets. Our strategies depend on both the locations of the data points in the plane, and the values of the sampled function at these points - adaptive thinning. All our thinning strategies remove data points one by one, so as to minimize an estimate of the error that results by the removal of a point from the current set of points (this estimate is termed \"anticipated error\"). The thinning process generates subsets of \"most significant\" points, such that the piecewise linear interpolants over the Delaunay triangulations of these subsets approximate progressively the function values sampled at the original scattered points, and such that the approximation errors are small relative to the number of points in the subsets. We design various methods for computing the anticipated error at reasonable cost, and compare and test the performance of the methods. It is proved that for data sampled from a convex function, with the strategy of convex triangulation, the actual error is minimized by minimizing the best performing measure of anticipated error. It is also shown that for data sampled from certain quadratic polynomials, adaptive thinning is equivalent to thinning which depends only on the locations of the data points - nonadaptive thinning. Based on our numerical tests and comparisons, two practical adaptive thinning algorithms are proposed for thinning large data sets, one which is more accurate and another which is faster", "fulltext": "", "keywords": "scattered data;triangulated subsets;convex function;delaunay triangulations;error;piecewise linear functions;adaptive thinning"}
{"name": "train_1541", "title": "The AT89C51/52 flash memory programmers", "abstract": "When faced with a plethora of applications to design, it's essential to have a versatile microcontroller in hand. The author describes the AT89C51/52 microcontrollers. To get you started, he'll describe his inexpensive microcontroller programmer", "fulltext": "", "keywords": "microcontroller programmer;microcontrollers;flash memory programmers;at89c51/52;device programmer"}
{"name": "train_1542", "title": "The open-source HCS project", "abstract": "Despite the rumors, the HCS II project is not dead. In fact, HCS has been licensed and is now an open-source project. In this article, the author brings us up to speed on the HCS II project's past, present, and future. The HCS II is an expandable, standalone, network-based (RS-485), intelligent-node, industrial-oriented supervisory control (SC) system intended for demanding home control applications. The HCS incorporates direct and remote digital inputs and outputs, direct and remote analog inputs and outputs, real time or Boolean decision event triggering, X10 transmission and reception, infrared remote control transmission and reception, remote LCDs, and a master console. Its program is compiled on a PC with the XPRESS compiler and then downloaded to the SC where it runs independently of the PC", "fulltext": "", "keywords": "supervisory control system;network-based;hcs ii;home control"}
{"name": "train_1543", "title": "RISCy business. Part 1: RISC projects by Cornell students", "abstract": "The author looks at several projects that Cornell University students entered in the Atmel Design 2001 contest. Those covered include a vertical plotter; BiLines, an electronic game; a wireless Internet pager; Cooking Coach; Barbie's zip drive; and a model train controller", "fulltext": "", "keywords": "atmel's design logic 2001 contest;barbie's zip drive;model train controller;bilines;vertical plotter;electronic game;risc projects;cooking coach;cornell students;wireless internet pager"}
{"name": "train_1544", "title": "Driving the NKK Smartswitch.2. Graphics and text", "abstract": "Whether your message is one of workplace safety or world peace, the long nights of brooding over ways to tell the world are over. Part 1 described the basic interface to drive the Smartswitch. Part 2 adds the bells and whistles to allow both text and messages to be placed anywhere on the screen. It considers character generation, graphic generation and the user interface", "fulltext": "", "keywords": "graphic generation;character generation;computer graphics;messages;user interface;nkk smartswitch;text"}
{"name": "train_1545", "title": "Pontryagin maximum principle of optimal control governed by fluid dynamic", "abstract": "systems with two point boundary state constraint We study the optimal control problem subject to the semilinear equation with a state constraint. We prove certain theorems and give examples of state constraints so that the maximum principle holds. The main difficulty of the problem is to make the sensitivity analysis of the state with respect to the control caused by the unboundedness and nonlinearity of an operator", "fulltext": "", "keywords": "optimal control;state constraints;fluid dynamics;pontryagin maximum principle;semilinear equation"}
{"name": "train_1546", "title": "Necessary conditions of optimality for impulsive systems on Banach spaces", "abstract": "We present necessary conditions of optimality for optimal control problems arising in systems governed by impulsive evolution equations on Banach spaces. Basic notations and terminologies are first presented and necessary conditions of optimality are presented. Special cases are discussed and we present an application to the classical linear quadratic regulator problem", "fulltext": "", "keywords": "optimal control;impulsive systems;banach spaces;linear quadratic regulator;optimality;necessary conditions;impulsive evolution equations"}
{"name": "train_1547", "title": "New projection-type methods for monotone LCP with finite termination", "abstract": "In this paper we establish two new projection-type methods for the solution of the monotone linear complementarity problem (LCP). The methods are a combination of the extragradient method and the Newton method, in which the active set strategy is used and only one linear system of equations with lower dimension is solved at each iteration. It is shown that under the assumption of monotonicity, these two methods are globally and linearly convergent. Furthermore, under a nondegeneracy condition they have a finite termination property. Finally, the methods are extended to solving the monotone affine variational inequality problem", "fulltext": "", "keywords": "projection-type methods;linear system of equations;monotonicity;active set strategy;nondegeneracy condition;iteration;matrix;convergence;vector;monotone linear complementarity problem;monotone lcp;monotone affine variational inequality problem;newton method;extragradient method;finite termination"}
{"name": "train_1548", "title": "A second order characteristic finite element scheme for convection-diffusion", "abstract": "problems A new characteristic finite element scheme is presented for convection-diffusion problems. It is of second order accuracy in time increment, symmetric, and unconditionally stable. Optimal error estimates are proved in the framework of L/sup 2/-theory. Numerical results are presented for two examples, which show the advantage of the scheme", "fulltext": "", "keywords": "optimal error estimates;l/sup 2/ -theory;second order accuracy;convection-diffusion problems;second order characteristic finite element scheme"}
{"name": "train_1549", "title": "Riccati-based preconditioner for computing invariant subspaces of large", "abstract": "matrices This paper introduces and analyzes the convergence properties of a method that computes an approximation to the invariant subspace associated with a group of eigenvalues of a large not necessarily diagonalizable matrix. The method belongs to the family of projection type methods. At each step, it refines the approximate invariant subspace using a linearized Riccati's equation which turns out to be the block analogue of the correction used in the Jacobi-Davidson method. The analysis conducted in this paper shows that the method converges at a rate quasi-quadratic provided that the approximate invariant subspace is close to the exact one. The implementation of the method based on multigrid techniques is also discussed and numerical experiments are reported", "fulltext": "", "keywords": "riccati-based preconditioner;invariant subspaces;jacobi-davidson method;projection type methods;eigenvalues;multigrid techniques;large matrices;diagonalizable matrix"}
{"name": "train_155", "title": "Fuzzy non-homogeneous Markov systems", "abstract": "In this paper the theory of fuzzy logic and fuzzy reasoning is combined with the theory of Markov systems and the concept of a fuzzy non-homogeneous Markov system is introduced for the first time. This is an effort to deal with the uncertainty introduced in the estimation of the transition probabilities and the input probabilities in Markov systems. The asymptotic behaviour of the fuzzy Markov system and its asymptotic variability is considered and given in closed analytic form. Moreover, the asymptotically attainable structures of the system are estimated also in a closed analytic form under some realistic assumptions. The importance of this result lies in the fact that in most cases the traditional methods for estimating the probabilities can not be used due to lack of data and measurement errors. The introduction of fuzzy logic into Markov systems represents a powerful tool for taking advantage of the symbolic knowledge that the experts of the systems possess", "fulltext": "", "keywords": "uncertainty;measurement errors;fuzzy reasoning;symbolic knowledge;transition probabilities;fuzzy nonhomogeneous markov systems;probability theory;asymptotic variability;input probabilities;fuzzy logic"}
{"name": "train_1550", "title": "On the convergence of the Bermudez-Moreno algorithm with constant parameters", "abstract": "A. Bermudez and C. Moreno (1981) presented a duality numerical algorithm for solving variational inequalities of the second kind. The performance of this algorithm strongly depends on the choice of two constant parameters. Assuming a further hypothesis of the inf-sup type, we present here a convergence theorem that improves on the one presented by A. Bermudez and C. Moreno. We prove that the convergence is linear, and we give the expression of the asymptotic error constant and the explicit form of the optimal parameters, as a function of some constants related to the variational inequality. Finally, we present some numerical examples that confirm the theoretical results", "fulltext": "", "keywords": "bermudez-moreno algorithm;convergence theorem;optimal parameters;duality numerical algorithm;asymptotic error constant;variational inequalities;constant parameters"}
{"name": "train_1551", "title": "The numerical solution of an evolution problem of second order in time on a", "abstract": "closed smooth boundary We consider an initial value problem for the second-order differential equation with a Dirichlet-to-Neumann operator coefficient. For the numerical solution we carry out semi-discretization by the Laguerre transformation with respect to the time variable. Then an infinite system of the stationary operator equations is obtained. By potential theory, the operator equations are reduced to boundary integral equations of the second kind with logarithmic or hypersingular kernels. The full discretization is realized by Nystrom's method which is based on the trigonometric quadrature rules. Numerical tests confirm the ability of the method to solve these types of nonstationary problems", "fulltext": "", "keywords": "stationary operator equations;evolution problem;hypersingular kernels;initial value problem;closed smooth boundary;laguerre transformation;second-order differential equation;boundary integral equations"}
{"name": "train_1552", "title": "Stability of Runge-Kutta methods for delay integro-differential equations", "abstract": "We study stability of Runge-Kutta (RK) methods for delay integro-differential equations with a constant delay on the basis of the linear equation du/dt = Lu(t) + Mu(t- tau ) + K integral /sub t- tau //sup t/ u( theta )d theta , where L, M, K are constant complex matrices. In particular, we show that the same result as in the case K = 0 (Koto, 1994) holds for this test equation, i.e., every A-stable RK method preserves the delay-independent stability of the exact solution whenever a step-size of the form h = tau /m is used, where m is a positive integer", "fulltext": "", "keywords": "constant delay;stability;runge-kutta methods;delay integro-differential equations"}
{"name": "train_1553", "title": "Numerical solution of forward and backward problem for 2-D heat conduction", "abstract": "equation For a two-dimensional heat conduction problem, we consider its initial boundary value problem and the related inverse problem of determining the initial temperature distribution from transient temperature measurements. The conditional stability for this inverse problem and the error analysis for the Tikhonov regularization are presented. An implicit inversion method, which is based on the regularization technique and the successive over-relaxation (SOR) iteration process, is established. Due to the explicit difference scheme for a direct heat problem developed in this paper, the inversion process is very efficient, while the application of SOR technique makes our inversion convergent rapidly. Numerical results illustrating our method are also given", "fulltext": "", "keywords": "initial boundary value problem;transient temperature measurements;error analysis;successive over-relaxation iteration process;heat conduction;tikhonov regularization;conditional stability;initial temperature distribution;inverse problem"}
{"name": "train_1554", "title": "Differential calculus for p-norms of complex-valued vector functions with", "abstract": "applications For complex-valued n-dimensional vector functions t to s(t), supposed to be sufficiently smooth, the differentiability properties of the mapping t to ||s(t)||/sub p/ at every point t = t/sub 0/ epsilon R/sub 0//sup +/:= {t epsilon R | t >or= 0} are investigated, where || . ||/sub p/ is the usual vector norm in C/sup n/ resp. R/sup n/, for p epsilon [1, o infinity ]. Moreover, formulae for the first three right derivatives D/sub +//sup k/||s(t)||/sub p/, k = 1, 2,3 are determined. These formulae are applied to vibration problems by computing the best upper bounds on ||s(t)||/sub p/ in certain classes of bounds. These results cannot be obtained by the methods used so far. The systematic use of the differential calculus for vector norms, as done here for the first time, could lead to major advances also in other branches of mathematics and other sciences", "fulltext": "", "keywords": "mapping;differential calculus;vibration problems;vector functions;vector norms"}
{"name": "train_1555", "title": "A note on multi-index polynomials of Dickson type and their applications in", "abstract": "quantum optics We discuss the properties of a new family of multi-index Lucas type polynomials, which are often encountered in problems of intracavity photon statistics. We develop an approach based on the integral representation method and show that this class of polynomials can be derived from recently introduced multi-index Hermite like polynomials", "fulltext": "", "keywords": "generating functions;quantum optics;multi-index polynomials;intracavity photon statistics;integral representation;lucas type polynomials"}
{"name": "train_1556", "title": "Regularity of some 'incomplete' Pal-type interpolation problems", "abstract": "In this paper the regularity of nine Pal-type interpolation problems is proved. In the literature interpolation on the zeros of the pair W/sub n//sup ( alpha )/(z) = (z + alpha )/sup n/ + (1 + alpha z)/sup n/, v/sub n//sup ( alpha )/(z) = (z + alpha )/sup n/ - (1 + alpha z)/sup n/ with 0 < alpha < 1 has been studied. Here the nodes form a subset of these sets of zeros", "fulltext": "", "keywords": "pal-type interpolation problems;zeros"}
{"name": "train_1557", "title": "L/sub p/ boundedness of (C, 1) means of orthonormal expansions for general", "abstract": "exponential weights Let I be a finite or infinite interval, and let W:I to (0, infinity ). Assume that W/sup 2/ is a weight, so that we may define orthonormal polynomials corresponding to W/sup 2/. For f :R to R, let s/sub m/ [f] denote the mth partial sum of the orthonormal expansion of f with respect to these polynomials. We investigate boundedness in weighted L/sub p/ spaces of the (C, 1) means 1/n /sub m=1/ Sigma /sup n/s/sub m/[f]. The class of weights W/sup 2/ considered includes even and noneven exponential weights", "fulltext": "", "keywords": "general exponential weights;boundedness;infinite interval;finite interval;orthonormal expansions;orthonormal polynomials;mth partial sum"}
{"name": "train_1558", "title": "Orthogonality of the Jacobi polynomials with negative integer parameters", "abstract": "It is well known that the Jacobi polynomials P/sub n//sup ( alpha , beta )/(x) are orthogonal with respect to a quasi-definite linear functional whenever alpha , beta , and alpha + beta + 1 are not negative integer numbers. Recently, Sobolev orthogonality for these polynomials has been obtained for alpha a negative integer and beta not a negative integer and also for the case alpha = beta negative integer numbers. In this paper, we give a Sobolev orthogonality for the Jacobi polynomials in the remainder cases", "fulltext": "", "keywords": "sobolev orthogonality;jacobi polynomials;orthogonality;negative integer parameters;quasi-definite linear functional"}
{"name": "train_1559", "title": "A comparison theorem for the iterative method with the preconditioner (I +", "abstract": "S/sub max/) A.D. Gunawardena et al. (1991) have reported the modified Gauss-Seidel method with a preconditioner (I + S). In this article, we propose to use a preconditioner (I + S/sub max/) instead of (I + S). Here, S/sub max/ is constructed by only the largest element at each row of the upper triangular part of A. By using the lemma established by M. Neumann and R.J. Plemmons (1987), we get the comparison theorem for the proposed method. Simple numerical examples are also given", "fulltext": "", "keywords": "preconditioner;modified gauss-seidel method;comparison theorem;iterative method"}
{"name": "train_156", "title": "Using extended logic programming for alarm-correlation in cellular phone", "abstract": "networks Alarm correlation is a necessity in large mobile phone networks, where the alarm bursts resulting from severe failures would otherwise overload the network operators. We describe how to realize alarm-correlation in cellular phone networks using extended logic programming. To this end, we describe an algorithm and system solving the problem, a model of a mobile phone network application, and a detailed solution for a specific scenario", "fulltext": "", "keywords": "fault diagnosis;extended logic programming;alarm-correlation;cellular phone networks;large mobile phone networks;network operators"}
{"name": "train_1560", "title": "Determinantal solutions of solvable chaotic systems", "abstract": "It is shown that two solvable chaotic systems, the arithmetic-harmonic mean (ARM) algorithm and the Ulam-von Neumann (UvN) map, have determinantal solutions. An additional formula for certain determinants and Riccati difference equations play a key role in both cases. Two infinite hierarchies of solvable chaotic systems are presented which have determinantal solutions", "fulltext": "", "keywords": "riccati difference equations;ulam-von neumann map;chebyshev polynomial;determinants;solvable chaotic systems;arithmetic-harmonic mean algorithm;determinantal solutions"}
{"name": "train_1561", "title": "Self-validating integration and approximation of piecewise analytic functions", "abstract": "Let an analytic or a piecewise analytic function on a compact interval be given. We present algorithms that produce enclosures for the integral or the function itself. Under certain conditions on the representation of the function, this is done with the minimal order of numbers of operations. The integration algorithm is implemented and numerical comparisons to non-validating integration software are presented", "fulltext": "", "keywords": "self-validating approximation;self-validating integration;enclosures;piecewise analytic functions;minimal order;integration algorithm;compact interval;complex interval arithmetic"}
{"name": "train_1562", "title": "Solution of a class of two-dimensional integral equations", "abstract": "The two-dimensional integral equation 1/ pi integral integral /sub D/( phi (r, theta )/R/sup 2/)dS=f(r/sub 0/, theta /sub 0/) defined on a circular disk D: r/sub 0/<or=a, 0<or= theta /sub 0/<or=2 pi , is considered in the present paper. Here R in the kernel denotes the distance between two points P(r, theta ) and P/sub 0/(r/sub 0/, theta /sub 0/) in D, and 0< alpha <2 or 2< alpha <4. Based on some known results of Bessel functions, integral representations of the kernel are established for 0< alpha <2 and 2< alpha <4, respectively, and employed to solve the corresponding two-dimensional integral equation. The solutions of the weakly singular integral equation for 0< alpha <2 and of the hypersingular integral equation for 2< alpha <4 are obtained, respectively", "fulltext": "", "keywords": "hypersingular integral equation;2d integral equations;integral representations;bessel functions;circular disk;weakly singular integral equation;kernel"}
{"name": "train_1563", "title": "A distance between elliptical distributions based in an embedding into the", "abstract": "Siegel group This paper describes two different embeddings of the manifolds corresponding to many elliptical probability distributions with the informative geometry into the manifold of positive-definite matrices with the Siegel metric, generalizing a result published previously elsewhere. These new general embeddings are applicable to a wide class of elliptical probability distributions, in which the normal, t-Student and Cauchy are specific examples. A lower bound for the Rao distance is obtained, which is itself a distance, and, through these embeddings, a number of statistical tests of hypothesis are derived", "fulltext": "", "keywords": "siegel group;positive-definite matrices;manifolds embeddings;elliptical distributions;lower bound;elliptical probability distributions;informative geometry"}
{"name": "train_1564", "title": "Asymptotic normality for the K/sub phi /-divergence goodness-of-fit tests", "abstract": "In this paper for a wide class of goodness-of-fit statistics based K/sub phi /-divergences, the asymptotic normality is established under the assumption n/m/sub n/ to a in (0, infinity ), where n denotes sample size and m/sub n/ the number of cells. This result is extended to contiguous alternatives to study asymptotic efficiency", "fulltext": "", "keywords": "asymptotic efficiency;asymptotic normality;k/sub phi /-divergence goodness-of-fit tests"}
{"name": "train_1565", "title": "On lag windows connected with Jacobi polynomials", "abstract": "Lag windows whose corresponding spectral windows are Jacobi polynomials or sums of Jacobi polynomials are introduced. The bias and variance of their spectral density estimators are investigated and their window bandwidth and characteristic exponent are determined", "fulltext": "", "keywords": "characteristic exponent;lag windows;jacobi polynomials;spectral windows;spectral density estimators;window bandwidth"}
{"name": "train_1566", "title": "A numerical C/sup 1/-shadowing result for retarded functional differential", "abstract": "equations This paper gives a numerical C/sup 1/-shadowing between the exact solutions of a functional differential equation and its numerical approximations. The shadowing result is obtained by comparing exact solutions with numerical approximation which do not share the same initial value. Behavior of stable manifolds of functional differential equations under numerics will follow from the shadowing result", "fulltext": "", "keywords": "numerical approximations;exact solutions;retarded functional differential equations;stable manifolds;numerical c/sup 1/-shadowing"}
{"name": "train_1567", "title": "Asymptotic expansions for the zeros of certain special functions", "abstract": "We derive asymptotic expansions for the zeros of the cosine-integral Ci(x) and the Struve function H/sub 0/(x), and extend the available formulae for the zeros of Kelvin functions. Numerical evidence is provided to illustrate the accuracy of the expansions", "fulltext": "", "keywords": "zeros;asymptotic expansions;struve function;cosine-integral;kelvin functions;accuracy"}
{"name": "train_1568", "title": "Natural language from artificial life", "abstract": "This article aims to show that linguistics, in particular the study of the lexico-syntactic aspects of language, provides fertile ground for artificial life modeling. A survey of the models that have been developed over the last decade and a half is presented to demonstrate that ALife techniques have a lot to offer an explanatory theory of language. It is argued that this is because much of the structure of language is determined by the interaction of three complex adaptive systems: learning, culture, and biological evolution. Computational simulation, informed by theoretical linguistics, is an appropriate response to the challenge of explaining real linguistic data in terms of the processes that underpin human language", "fulltext": "", "keywords": "lexico-syntactic aspects;culture;biological evolution;learning;alife;artificial life;adaptive systems;natural language;linguistics;computational simulation"}
{"name": "train_1569", "title": "An interactive self-replicator implemented in hardware", "abstract": "Self-replicating loops presented to date are essentially worlds unto themselves, inaccessible to the observer once the replication process is launched. We present the design of an interactive self-replicating loop of arbitrary size, wherein the user can physically control the loop's replication and induce its destruction. After introducing the BioWall, a reconfigurable electronic wall for bio-inspired applications, we describe the design of our novel loop and delineate its hardware implementation in the wall", "fulltext": "", "keywords": "biowall;field programmable gate array;reconfigurable electronic wall;interactive self-replicating loop;self-replication;artificial life;reconfigurable computing;cellular automata;hardware implementation;bio-inspired applications;interactive self-replicator"}
{"name": "train_157", "title": "Automatic extraction of eye and mouth fields from a face image using", "abstract": "eigenfeatures and ensemble networks This paper presents a novel algorithm for the extraction of the eye and mouth (facial features) fields from 2D gray level images. Eigenfeatures are derived from the eigenvalues and eigenvectors of the binary edge data set constructed from eye and mouth fields. Such eigenfeatures are ideal features for finely locating fields efficiently. The eigenfeatures are extracted from a set of the positive and negative training samples for facial features and are used to train a multilayer perceptron (MLP) whose output indicates the degree to which a particular image window contains the eyes or the mouth within itself. An ensemble network consisting of a multitude of independent MLPs was used to enhance the generalization performance of a single MLP. It was experimentally verified that the proposed algorithm is robust against facial size and even slight variations of the pose", "fulltext": "", "keywords": "eigenfeatures;training samples;binary edge data set;multilayer perceptron;eye field extraction;mouth field extraction;ensemble neural networks;2d gray level images;eigenvalues;eigenvectors;experiment;face feature extraction;generalization"}
{"name": "train_1570", "title": "Self-reproduction in three-dimensional reversible cellular space", "abstract": "Due to inevitable power dissipation, it is said that nano-scaled computing devices should perform their computing processes in a reversible manner. This will be a large problem in constructing three-dimensional nano-scaled functional objects. Reversible cellular automata (RCA) are used for modeling physical phenomena such as power dissipation, by studying the dissipation of garbage signals. We construct a three-dimensional self-inspective self-reproducing reversible cellular automaton by extending the two-dimensional version SR/sub 8/. It can self-reproduce various patterns in three-dimensional reversible cellular space without dissipating garbage signals", "fulltext": "", "keywords": "3d self-inspective self-reproducing cellular automata;reversible cellular automata;self-reproduction;nano-scaled computing devices;artificial life;power dissipation;three-dimensional reversible cellular space"}
{"name": "train_1571", "title": "The simulated emergence of distributed environmental control in evolving", "abstract": "microcosms This work continues investigation into Gaia theory (Lovelock, The ages of Gaia, Oxford University Press, 1995) from an artificial life perspective (Downing, Proceedings of the 7th International Conference on Artificial Life, p. 90-99, MIT Press, 2000), with the aim of assessing the general compatibility of emergent distributed environmental control with conventional natural selection. Our earlier system, GUILD (Downing and Zvirinsky, Artificial Life, 5, p.291-318, 1999), displayed emergent regulation of the chemical environment by a population of metabolizing agents, but the chemical model underlying those results was trivial, essentially admitting all possible reactions at a single energy cost. The new model, METAMIC, utilizes abstract chemistries that are both (a) constrained to a small set of legal reactions, and (b) grounded in basic fundamental relationships between energy, entropy, and biomass synthesis/breakdown. To explore the general phenomena of emergent homeostasis, we generate 100 different chemistries and use each as the basis for several METAMIC runs, as part of a Gaia hunt. This search discovers 20 chemistries that support microbial populations capable of regulating a physical environmental factor within their growth-optimal range, despite the extra metabolic cost. Case studies from the Gaia hunt illustrate a few simple mechanisms by which real biota might exploit the underlying chemistry to achieve some control over their physical environment. Although these results shed little light on the question of Gaia on Earth, they support the possibility of emergent environmental control at the microcosmic level", "fulltext": "", "keywords": "simulated emergence;artificial metabolisms;natural selection;chemical model;guild system;artificial life;gaia theory;artificial chemistry;genetic algorithms;evolving microcosms;emergent distributed environmental control;metabolizing agents;emergent homeostasis;metamic model;gaia hunt"}
{"name": "train_1572", "title": "Ant colony optimization and stochastic gradient descent", "abstract": "We study the relationship between the two techniques known as ant colony optimization (ACO) and stochastic gradient descent. More precisely, we show that some empirical ACO algorithms approximate stochastic gradient descent in the space of pheromones, and we propose an implementation of stochastic gradient descent that belongs to the family of ACO algorithms. We then use this insight to explore the mutual contributions of the two techniques", "fulltext": "", "keywords": "reinforcement learning;combinatorial optimization;swarm intelligence;empirical aco algorithms;artificial life;ant colony optimization;local search algorithms;social insects;pheromones;heuristic;stochastic gradient descent"}
{"name": "train_1574", "title": "No-go areas? [content management]", "abstract": "Alex Fry looks at how content management systems can be used to ensure website access for one important customer group, the disabled", "fulltext": "", "keywords": "disabled;website access;content management systems"}
{"name": "train_1578", "title": "Records role in e-business", "abstract": "Records management standards are now playing a key role in e-business strategy", "fulltext": "", "keywords": "e-business strategy;records management"}
{"name": "train_158", "title": "Neural and neuro-fuzzy integration in a knowledge-based system for air quality", "abstract": "prediction We propose a unified approach for integrating implicit and explicit knowledge in neurosymbolic systems as a combination of neural and neuro-fuzzy modules. In the developed hybrid system, a training data set is used for building neuro-fuzzy modules, and represents implicit domain knowledge. The explicit domain knowledge on the other hand is represented by fuzzy rules, which are directly mapped into equivalent neural structures. The aim of this approach is to improve the abilities of modular neural structures, which are based on incomplete learning data sets, since the knowledge acquired from human experts is taken into account for adapting the general neural architecture. Three methods to combine the explicit and implicit knowledge modules are proposed. The techniques used to extract fuzzy rules from neural implicit knowledge modules are described. These techniques improve the structure and the behavior of the entire system. The proposed methodology has been applied in the field of air quality prediction with very encouraging results. These experiments show that the method is worth further investigation", "fulltext": "", "keywords": "hybrid system;neuro-fuzzy integration;training data set;air quality prediction;knowledge-based system;implicit domain knowledge representation;incomplete learning;air pollution;neurosymbolic systems;neural architecture;experiments;fuzzy rules"}
{"name": "train_1583", "title": "Cutting through the confusion [workflow & content management]", "abstract": "Information management vendors are rushing to re-position themselves and put a portal spin on their products, says ITNET's Graham Urquhart. The result is confusion, with a range of different definitions and claims clouding the true picture", "fulltext": "", "keywords": "portals;itnet;workflow;collaboratively"}
{"name": "train_1584", "title": "Content all clear [workflow & content management]", "abstract": "Graeme Muir of SchlumbergerSema cuts through the confusion between content, document and records management", "fulltext": "", "keywords": "content management;schlumbergersema;document management;records management"}
{"name": "train_1588", "title": "Contentment management", "abstract": "Andersen's William Yarker and Richard Young outline the route to a successful content management strategy", "fulltext": "", "keywords": "andersen consulting;content management strategy"}
{"name": "train_1589", "title": "View from the top [workflow & content management]", "abstract": "International law firm Linklaters has installed a global document and content management system that is accessible to clients and which has helped it move online", "fulltext": "", "keywords": "content management;document management;online;linklaters;international law firm"}
{"name": "train_159", "title": "An intelligent system combining different resource-bounded reasoning techniques", "abstract": "In this paper, PRIMES (Progressive Reasoning and Intelligent multiple MEthods System), a new architecture for resource-bounded reasoning that combines a form of progressive reasoning and the so-called multiple methods approach is presented. Each time-critical reasoning unit is designed in such a way that it delivers an approximate result in time whenever an overload or a failure prevents the system from producing the most accurate result. Indeed, reasoning units use approximate processing based on two salient features. First, an incremental processing unit constructs an approximate solution quickly and then refines it incrementally. Second, a multiple methods approach proposes different alternatives to solve the problem, each of them being selected according to the available resources. In allowing several resource-bounded reasoning paradigms to be combined, we hope to extend their actual scope to cover more real-world application domains", "fulltext": "", "keywords": "real-time performance;time-critical reasoning unit;progressive reasoning;approximate processing;primes;complex systems;resource-bounded reasoning techniques;intelligent multiple methods system"}
{"name": "train_1590", "title": "Holding on [workflow & content management]", "abstract": "Marc Fresko of Cornwell Management Consultants says 'think ahead' when developing your electronic records management policy", "fulltext": "", "keywords": "cornwell management consultants;electronic records management policy"}
{"name": "train_1591", "title": "Quadratic interpolation on spheres", "abstract": "Riemannian quadratics are C/sup 1/ curves on Riemannian manifolds, obtained by performing the quadratic recursive deCastlejeau algorithm in a Riemannian setting. They are of interest for interpolation problems in Riemannian manifolds, such as trajectory-planning for rigid body motion. Some interpolation properties of Riemannian quadratics are analysed when the ambient manifold is a sphere or projective space, with the usual Riemannian metrics", "fulltext": "", "keywords": "corner-cutting;trajectory-planning;ambient manifold;riemannian manifolds;quadratic interpolation;parallel translation;approximation theory;rigid body motion"}
{"name": "train_1592", "title": "Hermite interpolation by rotation-invariant spatial Pythagorean-hodograph", "abstract": "curves The interpolation of first-order Hermite data by spatial Pythagorean-hodograph curves that exhibit closure under arbitrary 3-dimensional rotations is addressed. The hodographs of such curves correspond to certain combinations of four polynomials, given by Dietz et al. (1993), that admit compact descriptions in terms of quaternions - an instance of the \"PH representation map\" proposed by Choi et al. (2002). The lowest-order PH curves that interpolate arbitrary first-order spatial Hermite data are quintics. It is shown that, with PH quintics, the quaternion representation yields a reduction of the Hermite interpolation problem to three \"simple\" quadratic equations in three quaternion unknowns. This system admits a closed-form solution, expressing all PH quintic interpolants to given spatial Hermite data as a two-parameter family. An integral shape measure is invoked to fix these two free parameters", "fulltext": "", "keywords": "first-order hermite data;polynomials;spatial pythagorean hodograph curves;integral shape measure;quaternions;closed-form solution;interpolation"}
{"name": "train_1593", "title": "Single and multi-interval Legendre tau -methods in time for parabolic equations", "abstract": "In this paper, we take the parabolic equation with periodic boundary conditions as a model to present a spectral method with the Fourier approximation in spatial and single/multi-interval Legendre Petrov-Galerkin methods in time. For the single interval spectral method in time, we obtain the optimal error estimate in L/sup 2/-norm. For the multi-interval spectral method in time, the L/sup 2/-optimal error estimate is valid in spatial. Numerical results show the efficiency of the methods", "fulltext": "", "keywords": "legendre petrov-galerkin method;interval decomposition;optimal error estimation;fourier approximation;parabolic equation;error analysis;interval spectral method;partial differential equations;periodic boundary conditions"}
{"name": "train_1594", "title": "Training multilayer perceptrons via minimization of sum of ridge functions", "abstract": "Motivated by the problem of training multilayer perceptrons in neural networks, we consider the problem of minimizing E(x)= Sigma /sub i=1//sup n/ f/sub i/( xi /sub i/.x), where xi /sub i/ in R/sup S/, 1<or=i<or=n, and each f/sub i/( xi /sub i/.x) is a ridge function. We show that when n is small the problem of minimizing E can be treated as one of minimizing univariate functions, and we use the gradient algorithms for minimizing E when n is moderately large. For a large n, we present the online gradient algorithms and especially show the monotonicity and weak convergence of the algorithms", "fulltext": "", "keywords": "multilayer perceptrons;monotonicity;neural networks;minimization;gradient algorithms;weak convergence;ridge functions;online gradient algorithms;univariate functions"}
{"name": "train_1595", "title": "Convergence of finite element approximations and multilevel linearization for", "abstract": "Ginzburg-Landau model of d-wave superconductors In this paper, we consider the finite element approximations of a recently proposed Ginzburg-Landau-type model for d-wave superconductors. In contrast to the conventional Ginzburg-Landau model the scalar complex valued order-parameter is replaced by a multicomponent complex order-parameter and the free energy is modified according to the d-wave paring symmetry. Convergence and optimal error estimates and some super-convergent estimates for the derivatives are derived. Furthermore, we propose a multilevel linearization procedure to solve the nonlinear systems. It is proved that the optimal error estimates and super-convergence for the derivatives are preserved by the multi-level linearization algorithm", "fulltext": "", "keywords": "multilevel linearization;finite element method;d-wave;error estimation;two-grid method;superconductivity;nonlinear systems;free energy;ginzburg-landau model"}
{"name": "train_1596", "title": "Wavelet collocation methods for a first kind boundary integral equation in", "abstract": "acoustic scattering In this paper we consider a wavelet algorithm for the piecewise constant collocation method applied to the boundary element solution of a first kind integral equation arising in acoustic scattering. The conventional stiffness matrix is transformed into the corresponding matrix with respect to wavelet bases, and it is approximated by a compressed matrix. Finally, the stiffness matrix is multiplied by diagonal preconditioners such that the resulting matrix of the system of linear equations is well conditioned and sparse. Using this matrix, the boundary integral equation can be solved effectively", "fulltext": "", "keywords": "first kind integral operators;boundary element solution;boundary integral equation;piecewise constant collocation;stiffness matrix;wavelet transform;linear equations;computational complexity;acoustic scattering;wavelet algorithm"}
{"name": "train_1597", "title": "Application of heuristic methods for conformance test selection", "abstract": "In this paper we focus on the test selection problem. It is modeled after a real-life problem that arises in telecommunication when one has to check the reliability of an application. We apply different metaheuristics, namely Reactive Tabu Search (RTS), Genetic Algorithms (GA) and Simulated Annealing (SA) to solve the problem. We propose some modifications to the conventional schemes including an adaptive neighbourhood sampling in RTS, an adaptive variable mutation rate in GA and an adaptive variable neighbourhood structure in SA. The performance of the algorithms is evaluated in different models for existing protocols. Computational results show that GA and SA can provide high-quality solutions in acceptable time compared to the results of a commercial software, which makes them applicable in practical test selection", "fulltext": "", "keywords": "simulated annealing;test selection problem;adaptive variable mutation rate;gsm protocol;adaptive variable neighbourhood structure;genetic algorithms;adaptive neighbourhood sampling;metaheuristics;isdn protocol;heuristic methods;telecommunication conformance test selection;reliability;reactive tabu search"}
{"name": "train_1598", "title": "A decision support model for selecting product/service benefit positionings", "abstract": "The art (and science) of successful product/service positioning generally hinges on the firm's ability to select a set of attractively priced consumer benefits that are: valued by the buyer, distinctive in one or more respects, believable, deliverable, and sustainable (under actual or potential competitive abilities to imitate, neutralize, or overcome) in the target markets that the firm selects. For many years, the ubiquitous quadrant chart has been used to provide a simple graph of product/service benefits (usually called product/service attributes) described in terms of consumers' perceptions of the importance of attributes (to brand/supplier choice) and the performance of competing firms on these attributes. This paper describes a model that extends the quadrant chart concept to a decision support system that optimizes a firm's market share for a specified product/service. In particular, we describe a decision support model that utilizes relatively simple marketing research data on consumers' judged benefit importances, and supplier performances on these benefits to develop message components for specified target buyers. A case study is used to illustrate the model. The study deals with developing advertising message components for a relatively new entrant in the US air shipping market. We also discuss, more briefly, management reactions to application of the model to date, and areas for further research and model extension", "fulltext": "", "keywords": "management reactions;message components;decision support model;product/service attributes;market share optimization;product/service benefit positionings;consumer judged benefit importances;marketing research data;attractively priced consumer benefits;quadrant chart;optimal message design;brand/supplier choice;advertising;advertising message components;simple graph;greedy heuristic;us air shipping market"}
{"name": "train_1599", "title": "Evaluating the best main battle tank using fuzzy decision theory with", "abstract": "linguistic criteria evaluation In this paper, experts' opinions are described in linguistic terms which can be expressed in trapezoidal (or triangular) fuzzy numbers. To make the consensus of the experts consistent, we utilize the fuzzy Delphi method to adjust the fuzzy rating of every expert to achieve the consensus condition. For the aggregate of many experts' opinions, we take the operation of fuzzy numbers to get the mean of fuzzy rating, x/sub ij/ and the mean of weight, w/sub .j/. In multi-alternatives and multi-attributes cases, the fuzzy decision matrix X=[x/sub ij/]/sub m*n/ is constructed by means of the fuzzy rating, x/sub ij/. Then, we can derive the aggregate fuzzy numbers by multiplying the fuzzy decision matrix with the corresponding fuzzy attribute weights. The final results become a problem of ranking fuzzy numbers. We also propose an easy procedure of using fuzzy numbers to rank aggregate fuzzy numbers A/sub i/. In this way, we can obtain the best selection for evaluating the system. For practical application, we propose an algorithm for evaluating the best main battle tank by fuzzy decision theory and comparing it with other methods", "fulltext": "", "keywords": "multiple criteria problems;fuzzy rating;fuzzy number ranking;trapezoidal fuzzy numbers;group decision making;fuzzy decision theory;linguistic criteria evaluation;fuzzy decision matrix;triangular fuzzy numbers;aggregate fuzzy numbers;fuzzy group decision making;consensus condition;fuzzy attribute weights;battle tank evaluation;subjective-objective backgrounds;fuzzy delphi method"}
{"name": "train_16", "title": "Dual nature of mass multi-agent systems", "abstract": "Dual nature of mass multi-agent systems (mMAS) emerging as an internal discord of two spheres - micro (virtual) consisting of agents and their internal phenomena, and macro arising at the interface to the real world $stems the necessity of a new approach to analysis, design and utilisation of such systems. Based on the concept of VR decomposition, the problem of management of such systems is discussed. As a sub-type that makes mMAS closer to the application sphere, an evolutionary multi-agent system (EMAS) is proposed. EMAS combines features of mMAS with advantages of an evolutionary model of computation. As an illustration of this consideration two particular EMAS are presented, which allow us to obtain promising results in the fields of multiobjective optimisation and time-series prediction, and thus justify the approach", "fulltext": "", "keywords": "virtual reality;vr decomposition;mass multiple agent systems;evolutionary multiple agent system;formal model;multiobjective optimisation;time-series prediction;micro-macro link"}
{"name": "train_160", "title": "Taming the paper tiger [paperwork organization]", "abstract": "Generally acknowledged as a critical problem for many information professionals, the massive flow of documents, paper trails, and information needs efficient and dependable approaches for processing and storing and finding items and information", "fulltext": "", "keywords": "information professionals;paperwork organization;information processing;information retrieval;information storage"}
{"name": "train_1600", "title": "The development and evaluation of a fuzzy logic expert system for renal", "abstract": "transplantation assignment: Is this a useful tool? Allocating donor kidneys to patients is a complex, multicriteria decision-making problem which involves not only medical, but also ethical and political issues. In this paper, a fuzzy logic expert system approach was proposed as an innovative way to deal with the vagueness and complexity faced by medical doctors in kidney allocation decision making. A pilot fuzzy logic expert system for kidney allocation was developed and evaluated in comparison with two existing allocation algorithms: a priority sorting system used by multiple organ retrieval and exchange (MORE) in Canada and a point scoring systems used by united network for organ sharing (UNOS) in US. Our simulated experiment based on real data indicated that the fuzzy logic system can represent the expert's thinking well in handling complex tradeoffs, and overall, the fuzzy logic derived recommendations were more acceptable to the expert than those from the MORE and UNOS algorithms", "fulltext": "", "keywords": "point scoring systems;complex tradeoff handling;united network for organ sharing;kidney allocation decision making;simulated experiment;fuzzy logic expert system;priority sorting system;multicriteria decision-making problem;renal transplantation assignment;donor kidneys;multiple organ retrieval exchange"}
{"name": "train_1601", "title": "Solving the multiple competitive facilities location problem", "abstract": "In this paper we propose five heuristic procedures for the solution of the multiple competitive facilities location problem. A franchise of several facilities is to be located in a trade area where competing facilities already exist. The objective is to maximize the market share captured by the franchise as a whole. We perform extensive computational tests and conclude that a two-step heuristic procedure combining simulated annealing and an ascent algorithm provides the best solutions", "fulltext": "", "keywords": "simulated annealing;computational tests;multiple competitive facilities location problem;ascent algorithm;heuristic procedures;market share maximization;two-step heuristic procedure;facilities franchise"}
{"name": "train_1602", "title": "An optimization approach to plan for reusable software components", "abstract": "It is well acknowledged in software engineering that there is a great potential for accomplishing significant productivity improvements through the implementation of a successful software reuse program. On the other hand, such gains are attainable only by instituting detailed action plans at both the organizational and program level. Given this need, the paucity of research papers related to planning, and in particular, optimized planning is surprising. This research, which is aimed at this gap, brings out an application of optimization for the planning of reusable software components (SCs). We present a model that selects a set of SCs that must be built, in order to lower development and adaptation costs. We also provide implications to project management based on simulation, an approach that has been adopted by other cost models in the software engineering literature. Such a prescriptive model does not exist in the literature", "fulltext": "", "keywords": "reusable software components;adaptation costs;software reuse program;optimized planning;action plans;optimization;simulation;productivity improvements;development costs;project management;software engineering"}
{"name": "train_1603", "title": "Exploiting structure in adaptive dynamic programming algorithms for a", "abstract": "stochastic batch service problem The purpose of this paper is to illustrate the importance of using structural results in dynamic programming algorithms. We consider the problem of approximating optimal strategies for the batch service of customers at a service station. Customers stochastically arrive at the station and wait to be served, incurring a waiting cost and a service cost. Service of customers is performed in groups of a fixed service capacity. We investigate the structure of cost functions and establish some theoretical results including monotonicity of the value functions. Then, we use our adaptive dynamic programming monotone algorithm that uses structure to preserve monotonicity of the estimates at each iterations to approximate the value functions. Since the problem with homogeneous customers can be solved optimally, we have a means of comparison to evaluate our heuristic. Finally, we compare our algorithm to classical forward dynamic programming methods", "fulltext": "", "keywords": "inventory theory;optimal strategy approximation;waiting cost;stochastic batch service problem;service station;fixed service capacity;structural results;service cost;cost function structure;value function monotonicity;adaptive dynamic programming algorithms"}
{"name": "train_1604", "title": "Improving supply-chain performance by sharing advance demand information", "abstract": "In this paper, we analyze how sharing advance demand information (ADI) can improve supply-chain performance. We consider two types of ADI, aggregated ADI (A-ADI) and detailed ADI (D-ADI). With A-ADI, customers share with manufacturers information about whether they will place an order for some product in the next time period, but do not share information about which product they will order and which of several potential manufacturers will receive the order. With D-ADI, customers additionally share information about which product they will order, but which manufacturer will receive the order remains uncertain. We develop and solve mathematical models of supply chains where ADI is shared. We derive exact expressions and closed-form approximations for expected costs, expected base-stock levels, and variations of the production quantities. We show that both the manufacturer and the customers benefit from sharing ADI, but that sharing ADI increases the bullwhip effect. We also show that under certain conditions it is optimal to collect ADI from either none or all of the customers. We study two supply chains in detail: a supply chain with an arbitrary number of products that have identical demand rates, and a supply chain with two products that have arbitrary demand rates. For these two supply chains, we analyze how the values of A-ADI and D-ADI depend on the characteristics of the supply chain and on the quality of the shared information, and we identify conditions under which sharing A-ADI and D-ADI can significantly reduce cost. Our results can be used by decision makers to analyze the cost savings that can be achieved by sharing ADI and help them to determine if sharing ADI is beneficial for their supply chains", "fulltext": "", "keywords": "shared information quality;expected base-stock levels;bullwhip effect;closed-form approximations;cost savings;forecasting;advance demand information;production quantity variations;expected costs;detailed adi;information sharing;arbitrary demand rates;decision makers;manufacturing;arbitrary product number;supply-chain performance improvement;identical demand rates;aggregated adi;mathematical models"}
{"name": "train_1605", "title": "A GRASP heuristic for the mixed Chinese postman problem", "abstract": "Arc routing problems (ARPs) consist of finding a traversal on a graph satisfying some conditions related to the links of the graph. In the Chinese postman problem (CPP) the aim is to find a minimum cost tour (closed walk) traversing all the links of the graph at least once. Both the Undirected CPP, where all the links are edges that can be traversed in both ways, and the Directed CPP, where all the links are arcs that must be traversed in a specified way, are known to be polynomially solvable. However, if we deal with a mixed graph (having edges and arcs), the problem turns out to be NP-hard. In this paper, we present a heuristic algorithm for this problem, the so-called Mixed CPP (MCPP), based on greedy randomized adaptive search procedure (GRASP) techniques. The algorithm has been tested and compared with other known and recent methods from the literature on a wide collection of randomly generated instances, with up to 200 nodes and 600 links, producing encouraging computational results. As far as we know, this is the best heuristic algorithm for the MCPP, with respect to solution quality, published up to now", "fulltext": "", "keywords": "greedy randomized adaptive search procedure;closed walk;heuristic algorithm;mixed chinese postman problem;optimization problems;np-hard problem;arc routing problems;graph traversal;metaheuristics;minimum cost tour;grasp heuristic"}
{"name": "train_1606", "title": "Single machine earliness-tardiness scheduling with resource-dependent release", "abstract": "dates This paper deals with the single machine earliness and tardiness scheduling problem with a common due date and resource-dependent release dates. It is assumed that the cost of resource consumption of a job is a non-increasing linear function of the job release date, and this function is common for all jobs. The objective is to find a schedule and job release dates that minimize the total resource consumption, and earliness and tardiness penalties. It is shown that the problem is NP-hard in the ordinary sense even if the due date is unrestricted (the number of jobs that can be scheduled before the due date is unrestricted). An exact dynamic programming (DP) algorithm for small and medium size problems is developed. A heuristic algorithm for large-scale problems is also proposed and the results of a computational comparison between heuristic and optimal solutions are discussed", "fulltext": "", "keywords": "heuristic algorithm;exact dynamic programming algorithm;polynomial time algorithm;small size problems;resource-dependent release dates;total resource consumption minimization;np-hard problem;job resource consumption cost;common due date;single machine earliness-tardiness scheduling;medium size problems;nonincreasing linear function;job release date;large-scale problems"}
{"name": "train_1607", "title": "A solvable queueing network model for railway networks and its validation and", "abstract": "applications for the Netherlands The performance of new railway networks cannot be measured or simulated, as no detailed train schedules are available. Railway infrastructure and capacities are to be determined long before the actual traffic is known. This paper therefore proposes a solvable queueing network model to compute performance measures of interest without requiring train schedules (timetables). Closed form expressions for mean delays are obtained. New network designs, traffic scenarios, and capacity expansions can so be evaluated. A comparison with real delay data for the Netherlands supports the practical value of the model. A special Dutch cargo-line application is included", "fulltext": "", "keywords": "solvable queueing network model;closed form expressions;performance measures;network designs;dutch cargo-line application;railway networks;railway capacities;traffic scenarios;netherlands;railway infrastructure;capacity expansions;mean delays"}
{"name": "train_1608", "title": "A geometric process equivalent model for a multistate degenerative system", "abstract": "In this paper, a monotone process model for a one-component degenerative system with k+1 states (k failure states and one working state) is studied. We show that this model is equivalent to a geometric process (GP) model for a two-state one component system such that both systems have the same long-run average cost per unit time and the same optimal policy. Furthermore, an explicit expression for the determination of an optimal policy is derived", "fulltext": "", "keywords": "monotone process model;renewal reward process;long-run average cost;optimal policy;geometric process equivalent model;one-component degenerative system;two-state one component system;working state;failure states;multistate degenerative system;replacement policy"}
{"name": "train_1609", "title": "Modeling undesirable factors in efficiency evaluation", "abstract": "Data envelopment analysis (DEA) measures the relative efficiency of decision making units (DMUs) with multiple performance factors which are grouped into outputs and inputs. Once the efficient frontier is determined, inefficient DMUs can improve their performance to reach the efficient frontier by either increasing their current output levels or decreasing their current input levels. However, both desirable (good) and undesirable (bad) factors may be present. For example, if inefficiency exists in production processes where final products are manufactured with a production of wastes and pollutants, the outputs of wastes and pollutants are undesirable and should be reduced to improve the performance. Using the classification invariance property, we show that the standard DEA model can be used to improve the performance via increasing the desirable outputs and decreasing the undesirable outputs. The method can also be applied to situations when some inputs need to be increased to improve the performance. The linearity and convexity of DEA are preserved through our proposal", "fulltext": "", "keywords": "wastes;linear programming;undesirable outputs;classification invariance property;final product manufacture;current input levels;current output levels;data envelopment analysis;efficiency evaluation;efficient frontier;undesirable factor modeling;pollutants;multiple performance factors;decision making units;desirable outputs;production processes"}
{"name": "train_161", "title": "Electronic books: reports of their death have been exaggerated", "abstract": "E-books will survive, but not in the consumer market - at least not until reading devices become much cheaper and much better in quality (which is not likely to happen soon). Library Journal's review of major events of the year 2001 noted that two requirements for the success of E-books were development of a sustainable business model and development of better reading devices. The E-book revolution has therefore become more of an evolution. We can look forward to further developments and advances in the future", "fulltext": "", "keywords": "e-books;library journal;electronic books"}
{"name": "train_1610", "title": "Dynamic multi-objective heating optimization", "abstract": "We develop a multicriteria approach to the problem of space heating under a time varying price of electricity. In our dynamic goal programming model the goals are ideal temperature intervals and the other criteria are the costs and energy consumption. We discuss the modelling requirements in multicriteria problems with a dynamic structure and present a new relaxation method combining the traditional epsilon -constraint and goal programming (GP) methods. The multi-objective heating optimization (MOHO) application in a spreadsheet environment with numerical examples is described", "fulltext": "", "keywords": "relaxation method;space heating;modelling requirements;dynamic structure;energy consumption;multicriteria approach;multi-objective heating optimization;spreadsheet environment;numerical examples;dynamic goal programming model;dynamic multi-objective heating optimization;time varying electricity price;ideal temperature intervals;epsilon -constraint"}
{"name": "train_1611", "title": "Data mining business intelligence for competitive advantage", "abstract": "Organizations have lately realized that just processing transactions and/or information faster and more efficiently no longer provides them with a competitive advantage vis-a-vis their competitors for achieving business excellence. Information technology (IT) tools that are oriented towards knowledge processing can provide the edge that organizations need to survive and thrive in the current era of fierce competition. Enterprises are no longer satisfied with business information system(s); they require business intelligence system(s). The increasing competitive pressures and the desire to leverage information technology techniques have led many organizations to explore the benefits of new emerging technology, data warehousing and data mining. The paper discusses data warehouses and data mining tools and applications", "fulltext": "", "keywords": "organizations;knowledge processing;data mining;information technology;competitive advantage;business information system;data warehouses;business intelligence"}
{"name": "train_1613", "title": "Current waveform control of a high-power-factor rectifier circuit for harmonic", "abstract": "suppression of voltage and current in a distribution system This paper presents the input current waveform control of the rectifier circuit which realizes simultaneously the high input power factor and the harmonics suppression of the receiving-end voltage and the source current under the distorted receiving-end voltage. The proposed input current waveform includes the harmonic components which are in phase with the receiving-end voltage harmonics. The control parameter in the proposed waveform is designed by examining the characteristics of both the harmonic suppression effect in the distribution system and the input power factor of the rectifier circuit. The effectiveness of the proposed current waveform has been confirmed experimentally", "fulltext": "", "keywords": "source current;distorted receiving-end voltage;receiving-end voltage harmonics;input current waveform;60 hz;receiving-end voltage;harmonic current suppression;200 v;8 kva;2 kw;high input power factor;distribution system;high-power-factor rectifier circuit;harmonic voltage suppression;input current waveform control"}
{"name": "train_1614", "title": "A transmission line fault-location system using the wavelet transform", "abstract": "This paper describes the locating system of line-to-ground faults on a power transmission line by using a wavelet transform. The possibility of the location with the surge generated by a fault has been theoretically proposed. In order to make the method practicable, the authors realize very fast processors. They design the wavelet transform and location chips, and construct a very fast fault location system by processing the measured data in parallel. This system is realized by a computer with three FPGA processor boards on a PCI bus. The processors are controlled by UNIX and the system has a graphical user interface with an X window system", "fulltext": "", "keywords": "fpga processor boards;computer simulation;pci bus;line-to-ground faults;wavelet transform;unix;fault surge generation;graphic user interface;x window system;power transmission line fault-location system"}
{"name": "train_1615", "title": "Laguerre approximation of fractional systems", "abstract": "Systems characterised by fractional power poles can be called fractional systems. Here, Laguerre orthogonal polynomials are employed to approximate fractional systems by minimum phase, reduced order, rational transfer functions. Both the time and the frequency-domain analysis exhibit the accuracy of the approximation", "fulltext": "", "keywords": "fractional power poles;fractional systems;robust controllers;closed-loop system;reduced order;rational transfer functions;frequency-domain analysis;orthogonal polynomials;time-domain analysis;laguerre approximation;minimum phase"}
{"name": "train_1616", "title": "Pitch post-processing technique based on robust statistics", "abstract": "A novel pitch post-processing technique based on robust statistics is proposed. Performances in terms of pitch error rates and pitch contours show the superiority of the proposed method compared with the median filtering technique. Further improvement is achieved through incorporating an uncertainty term in the robust statistics model", "fulltext": "", "keywords": "speech communications;pitch contours;median filtering;pitch post-processing technique;speech quality;robust statistics;uncertainty term;pitch error rates"}
{"name": "train_1617", "title": "Adaptive array antenna based on radial basis function network as multiuser", "abstract": "detection for WCDMA An adaptive array antenna is proposed based on the radial basis function (RBF) network as a multiuser detector for a WCDMA system. The proposed system calculates the optimal combining weight coefficients using sample matrix inversion with a common correlation matrix algorithm and obtains the channel response vector using the RBF output signal", "fulltext": "", "keywords": "channel response vector;correlation matrix algorithm;radial basis function network;w-cdma;rbf network;optimal combining weight coefficients;multiuser detection;sample matrix inversion;adaptive array antenna;wideband code division multiple access"}
{"name": "train_1618", "title": "Optimal learning for patterns classification in RBF networks", "abstract": "The proposed modifying of the structure of the radial basis function (RBF) network by introducing the weight matrix to the input layer (in contrast to the direct connection of the input to the hidden layer of a conventional RBF) so that the training space in the RBF network is adaptively separated by the resultant decision boundaries and class regions is reported. The training of this weight matrix is carried out as for a single-layer perceptron together with the clustering process. In this way the network is capable of dealing with complicated problems, which have a high degree of interference in the training data, and achieves a higher classification rate over the current classifiers using RBF", "fulltext": "", "keywords": "single-layer perceptron;class regions;classification rate improvement;decision boundaries;radial basis function network;optimal learning;weight matrix training;rbf networks;clustering process;input layer;training space;pattern classification"}
{"name": "train_1619", "title": "Rate allocation for video transmission over lossy correlated networks", "abstract": "A novel rate allocation algorithm for video transmission over lossy networks subject to bursty packet losses is presented. A Gilbert-Elliot model is used at the encoder to drive the selection of coding parameters. Experimental results using the H.26L test model show a significant performance improvement with respect to the assumption of independent packet losses", "fulltext": "", "keywords": "rate allocation algorithm;video transmission;gilbert-elliot model;lossy correlated networks;bursty packet losses;coding parameters;video coding;h.26l test model"}
{"name": "train_162", "title": "International news sites in English", "abstract": "Web access to news sites all over the world allows us the opportunity to have an electronic news stand readily available and stocked with a variety of foreign (to us) news sites. A large number of currently available foreign sites are English-language publications or English language versions of non-North American sites. These sites are quite varied in terms of quality, coverage, and style. Finding them can present a challenge. Using them effectively requires critical-thinking skills that are a part of media awareness or digital literacy", "fulltext": "", "keywords": "english-language publications;web access;digital literacy;non north american sites;critical-thinking skills;media awareness;international news sites"}
{"name": "train_1620", "title": "Rapid Cauer filter design employing new filter model", "abstract": "The exact three-dimensional (3D) design of a coaxial Cauer filter employing a new filter model, a 3D field simulator and a circuit simulator, is demonstrated. Only a few iterations between the field simulator and the circuit simulator are necessary to meet a given specification", "fulltext": "", "keywords": "filter model;3d design;field simulator;circuit simulator;bandpass filters;cauer filter;filter design;coaxial filter;iterations"}
{"name": "train_1621", "title": "Current-mode fully-programmable piece-wise-linear block for neuro-fuzzy", "abstract": "applications A new method to implement an arbitrary piece-wise-linear characteristic in current mode is presented. Each of the breaking points and each slope is separately controllable. As an example a block that implements an N-shaped piece-wise-linearity has been designed. The N-shaped block operates in the subthreshold region and uses only ten transistors. These characteristics make it especially suitable for large arrays of neuro-fuzzy systems where the number of transistors and power consumption per cell is an important concern. A prototype of this block has been fabricated in a 0.35 mu m CMOS technology. The functionality and programmability of this circuit has been verified through experimental results", "fulltext": "", "keywords": "0.35 micron;neuro-fuzzy systems;power consumption;subthreshold region;vlsi;n-shaped piece-wise-linearity;cmos;current mode;breaking points;arbitrary piece-wise-linear characteristic;separately controllable"}
{"name": "train_1622", "title": "Error resilient intra refresh scheme for H.26L stream", "abstract": "Recently much attention has been focused on video streaming through IP-based networks. An error resilient RD intra macro-block refresh scheme for H.26L Internet video streaming is introduced. Various channel simulations have proved that this scheme is more effective than those currently adopted in H.26L", "fulltext": "", "keywords": "channel simulations;error resilient scheme;rderr scheme;internet;h.26l video streaming;intra macro-block refresh scheme;ip-based networks;rd intra refresh scheme;rdall scheme;video communication"}
{"name": "train_1623", "title": "Transmission of real-time video over IP differentiated services", "abstract": "Multimedia applications require high bandwidth and guaranteed quality of service (QoS). The current Internet, which provides 'best effort' services, cannot meet the stringent QoS requirements for delivering MPEG videos. It is proposed that MPEG frames are transported through various service models of DiffServ. Performance analysis and simulation results show that the proposed approach can not only guarantee QoS but can also achieve high bandwidth utilisation", "fulltext": "", "keywords": "diffserv;internet;ip differentiated services;real-time video transmission;quality of service;high bandwidth utilisation;multimedia applications;mpeg video;qos guarantees"}
{"name": "train_1624", "title": "Genetic algorithm for input/output selection in MIMO systems based on", "abstract": "controllability and observability indices A time domain optimisation algorithm using a genetic algorithm in conjunction with a linear search scheme has been developed to find the smallest or near-smallest subset of inputs and outputs to control a multi-input-multi-output system. Experimental results have shown that this proposed algorithm has a very fast convergence rate and high computation efficiency", "fulltext": "", "keywords": "very fast convergence;observability indices;mimo systems;input/output selection;multi-input-multi-output system;near-smallest subset;linear search scheme;genetic algorithm;smallest subset;time domain optimisation algorithm;controllability indices;multivariable control systems;high computation efficiency"}
{"name": "train_1625", "title": "Use of fuzzy weighted autocorrelation function for pitch extraction from noisy", "abstract": "speech An investigation is presented into the feasibility of incorporating a fuzzy weighting scheme into the calculation of an autocorrelation function for pitch extraction. Simulation results reveal that the proposed method provides better robustness against background noise than the conventional approaches for extracting pitch period in a noisy environment", "fulltext": "", "keywords": "cepstrum method;fuzzy weighting scheme;average magnitude difference function;speech analysis-synthesis system;autocorrelation function;background noise;pitch extraction;noisy speech;simulation results"}
{"name": "train_1626", "title": "Modifier formula on mean square convergence of LMS algorithm", "abstract": "In describing the mean square convergence of the LMS algorithm, the update formula based on independence assumption will bring explicit errors, especially when step-size is large. A modifier formula that describes the convergence well, is proposed. Simulations support the proposed formula in different conditions", "fulltext": "", "keywords": "lms filter;modifier formula;adaptive filtering;independence assumption;mean square convergence;lms algorithm;update formula"}
{"name": "train_1627", "title": "Blind identification of non-stationary MA systems", "abstract": "A new adaptive algorithm for blind identification of time-varying MA channels is derived. This algorithm proposes the use of a novel system of equations derived by combining the third- and fourth-order statistics of the output signals of MA models. This overdetermined system of equations has the important property that it can be solved adaptively because of their symmetries via an overdetermined recursive instrumental variable-type algorithm. This algorithm shows good behaviour in arbitrary noisy environments and good performance in tracking time-varying systems", "fulltext": "", "keywords": "fourth-order statistics;higher-order statistics;additive gaussian noise;overdetermined recursive algorithm;arbitrary noisy environments;time-varying channels;ma models;tracking;iterative algorithms;third-order statistics;blind identification;nonstationary systems;adaptive algorithm;recursive instrumental variable algorithm"}
{"name": "train_1628", "title": "Quasi-Newton algorithm for adaptive minor component extraction", "abstract": "An adaptive quasi-Newton algorithm is first developed to extract a single minor component corresponding to the smallest eigenvalue of a stationary sample covariance matrix. A deflation technique instead of the commonly used inflation method is then applied to extract the higher-order minor components. The algorithm enjoys the advantage of having a simpler computational complexity and a highly modular and parallel structure for efficient implementation. Simulation results are given to demonstrate the effectiveness of the proposed algorithm for extracting multiple minor components adaptively", "fulltext": "", "keywords": "stationary sample covariance matrix;adaptive estimation;quasi-newton algorithm;simulation results;modular structure;doa estimation;higher-order minor components;parallel structure;root-music estimator;deflation technique;computational complexity;adaptive minor component extraction;eigenvalue"}
{"name": "train_1629", "title": "Robot trajectory control using neural networks", "abstract": "The use of a new type of neural network (NN) for controlling the trajectory of a robot is discussed. A control system is described which comprises an NN-based controller and a fixed-gain feedback controller. The NN-based controller employs a modified recurrent NN, the weights of which are obtained by training another NN to identify online the inverse dynamics of the robot. The work has confirmed the superiority of the proposed NN-based control system in rejecting large disturbances", "fulltext": "", "keywords": "robot manipulators;fourth-order runge-kutta algorithm;robot trajectory control;modified recurrent neural network;fixed-gain feedback controller;time-varying nonlinear multivariable plant;neural network training;large disturbance rejection;control system;neural networks;neural network-based controller;robot inverse dynamics"}
{"name": "train_163", "title": "Boolean operators and the naive end-user: moving to AND", "abstract": "Since so few end-users make use of Boolean searching, it is obvious that any effective solution needs to take this reality into account. The most important aspect of a technical solution should be that it does not require any effort on the part of users. What is clearly needed is for search engine designers and programmers to take account of the information-seeking behavior of Internet users. Users must be able to enter a series of words at random and have those words automatically treated as a carefully constructed Boolean AND search statement", "fulltext": "", "keywords": "internet;information-seeking behavior;boolean searching;search engine design;boolean operators;and operator"}
{"name": "train_1630", "title": "Digital-domain self-calibration technique for video-rate pipeline A/D", "abstract": "converters using Gaussian white noise A digital-domain self-calibration technique for video-rate pipeline A/D converters based on a Gaussian white noise input signal is presented. The proposed algorithm is simple and efficient. A design example is shown to illustrate that the overall linearity of a pipeline ADC can be highly improved using this technique", "fulltext": "", "keywords": "gaussian white noise input signal;digital-domain self-calibration technique;video-rate pipeline a/d converters;pipeline adc linearity"}
{"name": "train_1631", "title": "Recovering lost efficiency of exponentiation algorithms on smart cards", "abstract": "At the RSA cryptosystem implementation stage, a major security concern is resistance against so-called side-channel attacks. Solutions are known but they increase the overall complexity by a non-negligible factor (typically, a protected RSA exponentiation is 133% slower). For the first time, protected solutions are proposed that do not penalise the running time of an exponentiation", "fulltext": "", "keywords": "rsa cryptosystem implementation stage;exponentiation algorithms;smart cards;public-key encryption;security;side-channel attack resistance"}
{"name": "train_1632", "title": "One structure for fractional delay filter with small number of multipliers", "abstract": "A wide-bandwidth, high-resolution fractional delay filter (FDF) structure with a small number of multipliers per output sample and a short coefficient computing time is presented. The proposal is based on the use of a frequency FDF design method up to only half of the Nyquist frequency, in a multirate structure", "fulltext": "", "keywords": "high-resolution filter;fractional delay filter;frequency domain design method;wide-bandwidth filter;finite impulse response filter;fir filter;short coefficient computing time;multirate structure;multipliers"}
{"name": "train_1633", "title": "48 Gbit/s InP DHBT MS-DFF with very low time jitter", "abstract": "A master-slave D-type flip-flop (MS DFF) fabricated in a self-aligned InP DHBT technology is presented. The packaged circuit shows full-rate clock operation at 48 Gbit/s. Very low time jitter and good retiming capabilities are observed. Layout aspects, packaging and measurement issues are discussed in particular", "fulltext": "", "keywords": "layout aspects;master-slave d-type flip-flop;inp;48 gbit/s;self-aligned dhbt technology;inp dhbt technology;dhbt ms-dff;low time jitter;retiming capabilities;packaged circuit"}
{"name": "train_1634", "title": "Maple 8 keeps everyone happy", "abstract": "The author is impressed with the upgrade to the mathematics package Maple 8, finding it genuinely useful to scientists and educators. The developments Waterloo Maple class as revolutionary include a student calculus package, and Maplets. The first provides a high-level command set for calculus exploration and plotting (removing the need to work with, say, plot primitives). The second is a package for hand-coding custom graphical user interfaces (GUIs) using elements such as check boxes, radio buttons, slider bars and pull-down menus. When called, a Maplet launches a runtime Java environment that pops up a window-analogous to a Java applet-to perform a programmed routine, if required passing the result back to the Maple worksheet", "fulltext": "", "keywords": "maplet;runtime java environment;calculus plotting;student calculus package;guis;high-level command set;maple 8 mathematics package;calculus exploration"}
{"name": "train_1635", "title": "Simple...But complex", "abstract": "FlexPro 5.0, from Weisang and Co., is one of those products which aim to serve an often ignored range of data users: those who, in FlexPro's words, are interested in documenting, analysing and archiving data in the simplest way possible. The online help system is clearly designed to promote the product in this market segment, with a very clear introduction from first principles and a hands-on tutorial, and the live project to which it was applied was selected with this in mind", "fulltext": "", "keywords": "data archiving;flexpro 5.0;hands-on tutorial;data analysis;data documentation;online help system"}
{"name": "train_1636", "title": "SPARC ignites scholarly publishing", "abstract": "During the past several years, initiatives which bring together librarians, researchers, university administrators and independent publishers have re-invigorated the scholarly publishing marketplace. These initiatives take advantage of electronic technology and show great potential for restoring science to scientists. The author outlines SPARC (the Scholarly Publishing and Academic Resources Coalition), an initiative to make scientific journals more accessible", "fulltext": "", "keywords": "scholarly publishing and academic resources coalition;electronic publishing;initiative;sparc;scientific journal access"}
{"name": "train_1637", "title": "What's best practice for open access?", "abstract": "The business of publishing journals is in transition. Nobody knows exactly how it will work in the future, but everybody knows that the electronic publishing revolution will ensure it won't work as it does now. This knowledge has provoked a growing sense of nervous anticipation among those concerned, some edgy and threatened by potential changes to their business, others excited by the prospect of change and opportunity. The paper discusses the open publishing model for dissemination of research", "fulltext": "", "keywords": "electronic publishing;business;journal publishing;open publishing model;research dissemination;open access"}
{"name": "train_1638", "title": "The chemical brotherhood", "abstract": "It has always been more difficult for chemistry to keep up in the Internet age but a new language could herald a new era for the discipline. The paper discusses CML, or chemical mark-up language. The eXtensible Mark-up Language provides a universal format for structured documents and data on the Web and so offers a way for scientists and others to carry a wide range of information types across the net in a transparent way. All that is needed is an XML browser", "fulltext": "", "keywords": "internet;structured document format;chemistry;cml;world wide web;xml browser;chemical mark-up language;extensible mark-up language"}
{"name": "train_1639", "title": "New hub gears up for algorithmic exchange", "abstract": "Warwick University in the UK is on the up and up. Sometimes considered a typical 1960s, middle-of-the-road redbrick institution-not known for their distinction the 2001 UK Research Assessment Exercise (RAE) shows its research to be the fifth most highly-rated in the country, with outstanding standards in the sciences. This impressive performance has rightly given Warwick a certain amount of muscle, which it is flexing rather effectively, aided by a snappy approach to making things happen that leaves some older institutions standing. The result is a brand new Centre for Scientific Computing (CSC), launched within a couple of years of its initial conception", "fulltext": "", "keywords": "warwick university centre for scientific computing"}
{"name": "train_164", "title": "Plug-ins for critical media literacy: a collaborative program", "abstract": "Information literacy is important in academic and other libraries. The paper looks at whether it would be more useful to librarians and to instructors, as well as the students, to deal with information-literacy skill levels of students beginning their academic careers, rather than checking them at the end. Approaching the situation with an eye toward the broader scope of critical media literacy opens the discussion beyond a skills inventory to the broader range of intellectual activity", "fulltext": "", "keywords": "critical media literacy;collaborative program;information literacy;instructors;academic libraries"}
{"name": "train_1640", "title": "Integration is LIMS inspiration", "abstract": "For software manufacturers, blessings come in the form of fast-moving application areas. In the case of LIMS, biotechnology is still in the driving seat, inspiring developers to maintain consistently rapid and creative levels of innovation. Current advancements are no exception. Integration and linking initiatives are still popular and much of the activity appears to be coming from a very productive minority", "fulltext": "", "keywords": "software manufacturers;biotechnology;lims"}
{"name": "train_1641", "title": "Development through gaming", "abstract": "Mainstream observers commonly underestimate the role of fringe activities in propelling science and technology. Well-known examples are how wars have fostered innovation in areas such as communications, cryptography, medicine and aerospace; and how erotica has been a major factor in pioneering visual media, from the first printed books to photography, cinematography, videotape, or the latest online video streaming. The article aims to be a sampler of a less controversial, but still often underrated, symbiosis between scientific computing and computing for leisure and entertainment", "fulltext": "", "keywords": "computer games;entertainment;graphics;leisure;scientific computing"}
{"name": "train_1642", "title": "Development and validation of user-adaptive navigation and information", "abstract": "retrieval tools for an intranet portal organizational memory information system Based on previous research and properties of organizational memory, a conceptual model for navigation and retrieval functions in an intranet portal organizational memory information system was proposed, and two human-centred features (memory structure map and history-based tool) were developed to support user's navigation and retrieval in a well-known organizational memory. To test two hypotheses concerning the validity of the conceptual model and two human-centred features, an experiment was conducted with 30 subjects. Testing of the two hypotheses indicated the following: (1) the memory structure map's users showed 29% better performance in navigation, and (2) the history-based tool's users outperformed by 34% in identifying information. The results of the study suggest that a conceptual model and two human-centred features could be used in a user-adaptive interface design to improve user's performance in an intranet portal organizational memory information system", "fulltext": "", "keywords": "experiment;user-adaptive interface design;organizational memory information system;conceptual model;information retrieval tools;history-based tool;user-adaptive navigation;user performance;memory structure map;intranet portal;human factors"}
{"name": "train_1643", "title": "Effectiveness of user testing and heuristic evaluation as a function of", "abstract": "performance classification For different levels of user performance, different types of information are processed and users will make different types of errors. Based on the error's immediate cause and the information being processed, usability problems can be classified into three categories. They are usability problems associated with skill-based, rule-based and knowledge-based levels of performance. In this paper, a user interface for a Web-based software program was evaluated with two usability evaluation methods, user testing and heuristic evaluation. The experiment discovered that the heuristic evaluation with human factor experts is more effective than user testing in identifying usability problems associated with skill-based and rule-based levels of performance. User testing is more effective than heuristic evaluation in finding usability problems associated with the knowledge-based level of performance. The practical application of this research is also discussed in the paper", "fulltext": "", "keywords": "user performance;performance classification;rule-based performance levels;usability;heuristic evaluation;knowledge-based performance levels;web-based software;user testing;user interface;skill-based performance levels;experiment;human factors"}
{"name": "train_1644", "title": "An experimental evaluation of comprehensibility aspects of knowledge structures", "abstract": "derived through induction techniques: a case study of industrial fault diagnosis Machine induction has been extensively used in order to develop knowledge bases for decision support systems and predictive systems. The extent to which developers and domain experts can comprehend these knowledge structures and gain useful insights into the basis of decision making has become a challenging research issue. This article examines the knowledge structures generated by the C4.5 induction technique in a fault diagnostic task and proposes to use a model of human learning in order to guide the process of making comprehensive the results of machine induction. The model of learning is used to generate hierarchical representations of diagnostic knowledge by adjusting the level of abstraction and varying the goal structures between 'shallow' and 'deep' ones. Comprehensibility is assessed in a global way in an experimental comparison where subjects are required to acquire the knowledge structures and transfer to new tasks. This method of addressing the issue of comprehensibility appears promising especially for machine induction techniques that are rather inflexible with regard to the number and sorts of interventions allowed to system developers", "fulltext": "", "keywords": "industrial plants;industrial fault diagnosis;case study;predictive systems;induction techniques;diagnostic knowledge representations;human learning model;decision support systems;knowledge structure comprehensibility aspects;experimental evaluation;knowledge bases;c4.5 induction technique"}
{"name": "train_1645", "title": "Effects of the transition to a client-centred team organization in", "abstract": "administrative surveying work A new work organization was introduced in administrative surveying work in Sweden during 1998. The new work organization implied a transition to a client-centred team-based organization and required a change in competence from specialist to generalist knowledge as well as a transition to a new information technology, implying a greater integration within the company. The aim of this study was to follow the surveyors for two years from the start of the transition and investigate how perceived consequences of the transition, job, organizational factors, well-being and effectiveness measures changed between 1998 and 2000. The Teamwork Profile and QPS Nordic questionnaire were used. The 205 surveyors who participated in all three study phases constituted the study group. The result showed that surveyors who perceived that they were working as generalists rated the improvements in job and organizational factors significantly higher than those who perceived that they were not yet generalists. Improvements were noted in 2000 in quality of service to clients, time available to handle a case and effectiveness of teamwork in a transfer to a team-based work organization group, cohesion and continuous improvement practices-for example, learning by doing, mentoring and guided delegation-were important to improve the social effectiveness of group work", "fulltext": "", "keywords": "information technology;social effectiveness;organizational factors;qps nordic questionnaire;public administrative sector;company;client-centred team organization;job;administrative surveying work;teamwork profile;effectiveness measures"}
{"name": "train_1646", "title": "The limits of shape constancy: point-to-point mapping of perspective", "abstract": "projections of flat figures The present experiments investigate point-to-point mapping of perspective transformations of 2D outline figures under diverse viewing conditions: binocular free viewing, monocular perspective with 2D cues masked by an optic tunnel, and stereoptic viewing through an optic tunnel. The first experiment involved upright figures, and served to determine baseline point-to-point mapping accuracy, which was found to be very good. Three shapes were used: square, circle and irregularly round. The main experiment, with slanted figures, involved only two shapes-square and irregularly shaped-showed at several slant degrees. Despite the accumulated evidence for shape constancy when the outline of perspective projections is considered, metric perception of the inner structure of such projections was quite limited. Systematic distortions were found, especially with more extreme slants, and attributed to the joint effect of several factors: anchors, 3D information, and slant underestimation. Contradictory flatness cues did not detract from performance, while stereoptic information improved it", "fulltext": "", "keywords": "binocular free viewing;flat figure perspective projections;point-to-point mapping;optic tunnel;2d cues;diverse viewing conditions;stereoptic viewing;anchors;3d shape perception;3d information;shape constancy;slant underestimation;monocular perspective;2d outline figures;3d information displays;experiments;human factors"}
{"name": "train_1647", "title": "Examining children's reading performance and preference for different", "abstract": "computer-displayed text This study investigated how common online text affects reading performance of elementary school-age children by examining the actual and perceived readability of four computer-displayed typefaces at 12- and 14-point sizes. Twenty-seven children, ages 9 to 11, were asked to read eight children's passages and identify erroneous/substituted words while reading. Comic Sans MS, Arial and Times New Roman typefaces, regardless of size, were found to be more readable (as measured by a reading efficiency score) than Courier New. No differences in reading speed were found for any of the typeface combinations. In general, the 14-point size and the examined sans serif typefaces were perceived as being the easiest to read, fastest, most attractive, and most desirable for school-related material. In addition, participants significantly preferred Comic Sans MS and 14-point Arial to 12-point Courier. Recommendations for appropriate typeface combinations for children reading on computers are discussed", "fulltext": "", "keywords": "educational computing;fonts;elementary school-age children;computer-displayed text;user interface;child reading performance;online text;computer-displayed typefaces;human factors"}
{"name": "train_1648", "title": "Spatial solutions [office furniture]", "abstract": "Take the stress out of the office by considering the design of furniture and staff needs, before major buying decisions", "fulltext": "", "keywords": "buying decisions;staff needs;office furniture"}
{"name": "train_1649", "title": "Office essentials [stationery suppliers]", "abstract": "Make purchasing stationery a relatively simple task through effective planning and management of stock, and identifying the right supplier", "fulltext": "", "keywords": "purchasing;management of stock;stationery suppliers;planning"}
{"name": "train_165", "title": "Monitoring the news online", "abstract": "The author looks at how we can focus on what we want, finding small stories in vast oceans of news. There is no one tool that will scan every news resource available and give alerts on new available materials. Every one has a slightly different focus. Some are paid sources, while many are free. If used wisely, an excellent news monitoring system for a large number of topics can be set up for surprisingly little cost", "fulltext": "", "keywords": "internet;online news;news monitoring"}
{"name": "train_1650", "title": "Low to mid-speed copiers [buyer's guide]", "abstract": "The low to mid-speed copier market is being transformed by the almost universal adoption of digital solutions. The days of the analogue copier are numbered as the remaining vendors plan to withdraw from this sector by 2005. Reflecting the growing market for digital, vendors are reducing prices, making a digital solution much more affordable. The battle for the copier market is intense, and the popularity of the multifunctional device is going to transform the office equipment market. As total cost of ownership becomes increasingly important and as budgets are squeezed, the most cost-effective solutions are those that will survive this shake-down", "fulltext": "", "keywords": "low to mid-speed copier market;total cost of ownership"}
{"name": "train_1651", "title": "H-matrix approximation for the operator exponential with applications", "abstract": "We previously developed a data-sparse and accurate approximation to parabolic solution operators in the case of a rather general elliptic part given by a strongly P-positive operator . Also a class of matrices (H-matrices) has been analysed which are data-sparse and allow an approximate matrix arithmetic with almost linear complexity. In particular, the matrix-vector/matrix-matrix product with such matrices as well as the computation of the inverse have linear-logarithmic cost. In this paper, we apply the H-matrix techniques to approximate the exponent of an elliptic operator. Starting with the Dunford-Cauchy representation for the operator exponent, we then discretise the integral by the exponentially convergent quadrature rule involving a short sum of resolvents. The latter are approximated by the H-matrices. Our algorithm inherits a two-level parallelism with respect to both the computation of resolvents and the treatment of different time values. In the case of smooth data (coefficients, boundaries), we prove the linear-logarithmic complexity of the method", "fulltext": "", "keywords": "operator exponential;dunford-cauchy representation;exponentially convergent quadrature rule;parabolic solution operators;strongly p-positive operator;data-sparse approximation;h-matrix approximation;almost linear complexity"}
{"name": "train_1652", "title": "Convergence of a finite volume scheme for nonlinear degenerate parabolic", "abstract": "equations One approximates the entropy weak solution u of a nonlinear parabolic degenerate equation u/sub t/+div(qf(u))- Delta phi (u)=0 by a piecewise constant function u/sub D/ using a discretization D in space and time and a finite volume scheme. The convergence of u/sub D/ to u is shown as the size of the space and time steps tend to zero. In a first step, estimates on u/sub D/ are used to prove the convergence, up to a subsequence, of u/sub D/ to a measure valued entropy solution (called here an entropy process solution). A result of uniqueness of the entropy process solution is proved, yielding the strong convergence of u/sub D/ to u. Some numerical results on a model equation are shown", "fulltext": "", "keywords": "finite volume scheme;numerical results;model equation;piecewise constant function;nonlinear degenerate parabolic equations;entropy weak solution;strong convergence"}
{"name": "train_1653", "title": "The best circulant preconditioners for Hermitian Toeplitz systems.II. The", "abstract": "multiple-zero case For pt.I. see SIAM J. Numer. Anal., vol. 38, p. 876-896. Circulant-type preconditioners have been proposed previously for ill-conditioned Hermitian Toeplitz systems that are generated by nonnegative continuous functions with a zero of even order. The proposed circulant preconditioners can be constructed without requiring explicit knowledge of the generating functions. It was shown that the spectra of the preconditioned matrices are uniformly bounded except for a fixed number of outliers and that all eigenvalues are uniformly bounded away from zero. Therefore the conjugate gradient method converges linearly when applied to solving the circulant preconditioned systems. Previously it was claimed that this result can be extended to the case where the generating functions have multiple zeros. The main aim of this paper is to give a complete convergence proof of the method for this class of generating functions", "fulltext": "", "keywords": "generating functions;conjugate gradient method;nonnegative continuous functions;hermitian toeplitz systems;multiple-zero case;circulant preconditioners;preconditioned matrices;eigenvalues"}
{"name": "train_1654", "title": "Numerical validation of solutions of complementarity problems: the nonlinear", "abstract": "case This paper proposes a validation method for solutions of nonlinear complementarity problems. The validation procedure performs a computational test. If the result of the test is positive, then it is guaranteed that a given multi-dimensional interval either includes a solution or excludes all solutions of the nonlinear complementarity problem", "fulltext": "", "keywords": "nonlinear complementarity problem;optimization;computational test;numerical validation"}
{"name": "train_1655", "title": "An empirical investigation of the influences of the degree of interactivity on", "abstract": "user-outcomes in a multimedia environment The study reported here investigates the influence of \"interactivity\" on the learning outcomes of users in a multimedia systems environment. Drawing from past literature base and based on key tenets of three learning theories - behaviorist, cognitivist, and constructivist - the study first proposes a measurement scheme for \"interactivity\" and then hypothesizes that \"interactivity\" would influence the learning outcomes positively in terms of users' learning achievement and attitude. Three prototypes of a multimedia instructional/training system to represent high, low, and noninteractive modes of use were developed and implemented and the hypothesized influences were investigated using a controlled laboratory research design. Multiple analysis of variance (MANOVA) results indicate that while interactivity does not necessarily enable enhanced gain in user learning, it positively influences participants' attitude. The study finds no support for hypothesized moderating effects of learning styles (measured using Kolb's Learning Style Inventory scale) on the relationship between interactivity and user outcomes. The results of this study have important implications for both education and corporations' training efforts and investments. Implications and future research directions are discussed", "fulltext": "", "keywords": "measurement scheme;multiple analysis of variance;training system;interactivity;multimedia systems environment;cognitivist learning theories;manova;behaviorist learning theories;corporations;user outcomes;user attitude;constructivist learning theories;learning outcomes;kolb learning style inventory scale;education"}
{"name": "train_1656", "title": "Impact of user satisfaction and trust on virtual team members", "abstract": "Pressured by the growing need for fast response times, mass customization, and globalization, many organizations are turning to flexible organizational forms, such as virtual teams. Virtual teams consist of cooperative relationships supported by information technology to overcome limitations of time and/or location. Virtual teams require their members to rely heavily on the use of information technology and trust in coworkers. This study investigates the impacts that the reliance on information technology (operationalized in our study via the user satisfaction construct) and trust have on the job satisfaction of virtual team members. The study findings reveal that both user satisfaction and trust are positively related to job satisfaction in virtual teams, while system use was not found to play a significant role. These findings emphasize that organizations seeking the benefits of flexible, IT-enabled virtual teams must consider both the level of trust among colleagues, and the users' satisfaction with the information technology on which virtual teams rely", "fulltext": "", "keywords": "information technology;job satisfaction;it;virtual team members;user satisfaction;trust"}
{"name": "train_1657", "title": "Breaking the myths of rewards: an exploratory study of attitudes about", "abstract": "knowledge sharing Many CEO and managers understand the importance of knowledge sharing among their employees and are eager to introduce the knowledge management paradigm in their organizations. However little is known about the determinants of the individual's knowledge sharing behavior. The purpose of this study is to develop an understanding of the factors affecting the individual's knowledge sharing behavior in the organizational context. The research model includes various constructs based on social exchange theory, self-efficacy, and theory of reasoned action. Research results from the field survey of 467 employees of four large, public organizations show that expected associations and contribution are the major determinants of the individual's attitude toward knowledge sharing. Expected rewards, believed by many to be the most important motivating factor for knowledge sharing, are not significantly related to the attitude toward knowledge sharing. As expected, positive attitude toward knowledge sharing is found to lead to positive intention to share knowledge and, finally, to actual knowledge sharing behaviors", "fulltext": "", "keywords": "self-efficacy;social exchange theory;strategic management;rewards;public organizations;theory of reasoned action;knowledge management;knowledge sharing"}
{"name": "train_1658", "title": "Chaos theory as a framework for studying information systems", "abstract": "This paper introduces chaos theory as a means of studying information systems. It argues that chaos theory, combined with new techniques for discovering patterns in complex quantitative and qualitative evidence, offers a potentially more substantive approach to understand the nature of information systems in a variety of contexts. The paper introduces chaos theory concepts by way of an illustrative research design", "fulltext": "", "keywords": "qualitative evidence;complex quantitative evidence;pattern discovery;chaos theory;information systems"}
{"name": "train_1659", "title": "Mobile commerce: transforming the vision into reality", "abstract": "This editorial preface investigates current developments in mobile commerce (M-commerce) and proposes an integrated architecture that supports business and consumer needs in an optimal way to successfully implement M-commerce business processes. The key line of thought is based on the heuristic observation that customers will not want to receive M-commerce offerings to their mobile telephones. As a result, a pull as opposed to a push approach becomes a necessary requirement to conduct M-commerce. In addition, M-commerce has to rely on local, regional, demographic and many other variables to be truly effective. Both observations necessitate an M-commerce architecture that allows the coherent integration of enterprise-level systems as well as the aggregation of product and service offerings from many different and partially competing parties into a collaborative M-commerce platform. The key software component within this integrated architecture is an event management engine to monitor, detect, store, process and measure information about outside events that are relevant to all participants in M-commerce", "fulltext": "", "keywords": "consumer needs;business needs;integrated architecture;collaborative platform;mobile telephones;pull approach;event management engine;mobile commerce;m-commerce"}
{"name": "train_166", "title": "The semantic Web: differentiating between taxonomies and ontologies", "abstract": "There is a new vision of the WWW - the semantic Web - that will dramatically improve Web-based services and products. It creates a setting where software agents perform everyday jobs for end-users. Deploying hierarchies, metadata, and structured vocabularies, the semantic Web expands basic Internet functions", "fulltext": "", "keywords": "internet;metadata;structured vocabularies;hierarchies;software agents;semantic web;www"}
{"name": "train_1660", "title": "A regularized conjugate gradient method for symmetric positive definite system", "abstract": "of linear equations A class of regularized conjugate gradient methods is presented for solving the large sparse system of linear equations of which the coefficient matrix is an ill-conditioned symmetric positive definite matrix. The convergence properties of these methods are discussed in depth, and the best possible choices of the parameters involved in the new methods are investigated in detail. Numerical computations show that the new methods are more efficient and robust than both classical relaxation methods and classical conjugate direction methods", "fulltext": "", "keywords": "ill-conditioned linear system;convergence properties;symmetric positive definite system;linear equations;regularized conjugate gradient method;classical conjugate direction methods;coefficient matrix;large sparse system;classical relaxation methods"}
{"name": "train_1661", "title": "The road to perpetual progress [retail inventory management]", "abstract": "With annual revenues increasing 17.0% to 20.0% consistently over the last three years and more than 2,500 new stores opened from 1998 through 2001, Dollar General is on the fast track. However, the road to riches could have easily become the road to ruin had the retailer not exerted control over its inventory management", "fulltext": "", "keywords": "dollar general;retailer;inventory management"}
{"name": "train_1663", "title": "VSAT technology aids growth", "abstract": "Choosing to migrate to IP-based applications also means deciding whether terrestrial technologies such as frame relay, DSL or \"plain old telephone service\" (POTS) can provide the scalability, flexibility and high bandwidth required to support those applications, and whether these technologies can do so affordably. Each option has its tradeoffs. Also, in each case, retailers with nationwide chains have to deal with multiple last-mile service providers for service installation and network maintenance. Because of this, many retailers are selecting two-way satellite networking technology (frequently referred to as VSAT) as the technology of choice for always-on, nationwide, high-speed connectivity coupled with end-to-end network ownership and favorable economics. Enterprises are adopting VSAT platforms not only for emerging IP and Web-based applications, but also for mission-critical, front-office functions such as credit authorization and point-of-sale polling", "fulltext": "", "keywords": "vsat;ip-based applications;retailers"}
{"name": "train_1664", "title": "Disappointment reigns [retail IT]", "abstract": "CPFR remains at the forefront of CIOs' minds, but a number of barriers, such as secretive corporate cultures and spotty data integrity, stand between retail organizations and true supply-chain collaboration. CIOs remain vexed at these obstacles, as was evidenced at a roundtable discussion by retail and consumer-goods IT leaders at the Retail Systems 2002 conference, held in Chicago by the consultancy MoonWatch Media Inc., Newton Upper Falls, Mass. Other annoyances discussed by retail CIOs include poorly designed business processes and retail's poor image with the IT talent emerging from school into the job market", "fulltext": "", "keywords": "moonwatch media;cios;collaborative planning forecasting and replenishment;retail;retail systems 2002 conference"}
{"name": "train_1665", "title": "How airlines and airports recover from schedule perturbations: a survey", "abstract": "The explosive growth in air traffic as well as the widespread adoption of Operations Research techniques in airline scheduling has given rise to tight flight schedules at major airports. An undesirable consequence of this is that a minor incident such as a delay in the arrival of a small number of flights can result in a chain reaction of events involving several flights and airports, causing disruption throughout the system. This paper reviews recent literature in the area of recovery from schedule disruptions. First we review how disturbances at a given airport could be handled, including the effects of runways and fixes. Then we study the papers on recovery from airline schedule perturbations, which involve adjustments in flight schedules, aircraft, and crew. The mathematical programming techniques used in ground holding are covered in some detail. We conclude the review with suggestions on how singular perturbation theory could play a role in analyzing disruptions to such highly sensitive schedules as those in the civil aviation industry", "fulltext": "", "keywords": "recovery;flight schedule adjustments;airports;ground holding;aircraft adjustments;disturbance handling;singular perturbation theory;schedule perturbation;crew adjustments;runways;operations research techniques;schedule disruptions;mathematical programming techniques;airline scheduling;air traffic management;civil aviation industry;tight flight schedules"}
{"name": "train_1666", "title": "Airline base schedule optimisation by flight network annealing", "abstract": "A system for rigorous airline base schedule optimisation is described. The architecture of the system reflects the underlying problem structure. The architecture is hierarchical consisting of a master problem for logical aircraft schedule optimisation and a sub-problem for schedule evaluation. The sub-problem is made up of a number of component sub-problems including connection generation, passenger choice modelling, passenger traffic allocation by simulation and revenue and cost determination. Schedule optimisation is carried out by means of simulated annealing of flight networks. The operators for the simulated annealing process are feasibility preserving and form a complete set of operators", "fulltext": "", "keywords": "simulated annealing;passenger traffic allocation;cost determination;operators;hierarchical architecture;passenger choice modelling;airline base schedule optimisation;flight network annealing;master problem;system architecture;time complexity;schedule evaluation;logical aircraft schedule optimisation;connection generation"}
{"name": "train_1667", "title": "Combining constraint programming and linear programming on an example of bus", "abstract": "driver scheduling Provides details of a successful application where the column generation algorithm was used to combine constraint programming and linear programming. In the past, constraint programming and linear programming were considered to be two competing technologies that solved similar types of problems. Both these technologies had their strengths and weaknesses. The paper shows that the two technologies can be combined together to extract the strengths of both these technologies. Details of a real-world application to optimize bus driver duties are given. This system was developed by ILOG for a major software house in Japan using ILOG-Solver and ILOG-CPLEX, constraint programming and linear programming C/C++ libraries", "fulltext": "", "keywords": "linear programming;ilog;constraint programming;ilog-cplex;column generation algorithm;ilog-solver;c/c++ libraries;bus driver scheduling"}
{"name": "train_1668", "title": "Elastic constraint branching, the Wedelin/Carmen Lagrangian heuristic and", "abstract": "integer programming for personnel scheduling The Wedelin algorithm is a Lagrangian based heuristic that is being successfully used by Carmen Systems to solve large crew pairing problems within the airline industry. We extend the Wedelin approach by developing an implementation for personnel scheduling problems (also termed staff rostering problems) that exploits the special structure of these problems. We also introduce elastic constraint branching with the twin aims of improving the performance of our new approach and making it more column generation friendly. Numerical results show that our approach can outperform the commercial solver CPLEX on difficult commercial rostering problems", "fulltext": "", "keywords": "lagrangian based heuristic;column generation friendly approach;integer programming;personnel scheduling;airline industry;large crew pairing problems;staff rostering problems;elastic constraint branching;wedelin algorithm;carmen systems"}
{"name": "train_1669", "title": "Supply chain optimisation in the paper industry", "abstract": "We describe the formulation and development of a supply-chain optimisation model for Fletcher Challenge Paper Australasia (FCPA). This model, known as the paper industry value optimisation tool (PIVOT), is a large mixed integer program that finds an optimal allocation of supplier to mill, product to paper machine, and paper machine to customer, while at the same time modelling many of the supply chain details and nuances which are peculiar to FCPA. PIVOT has assisted FCPA in solving a number of strategic and tactical decision problems, and provided significant economic benefits for the company", "fulltext": "", "keywords": "tactical decision problems;paper industry value optimisation tool;supply chain optimisation;strategic decision problems;economic benefits;pivot;optimal allocation;large mixed integer program;fletcher challenge paper australasia"}
{"name": "train_167", "title": "Business school research: bridging the gap between producers and consumers", "abstract": "There has been a great deal of continuing discussion concerning the seemingly unbridgeable gap between so much of the research produced by business school professors and the needs of the business people who, ideally, would use it. Here, we examine this gap and suggest a model for bridging it. We sample four groups of people, business school academics (professors), deans of business schools, executive MBA students/recent graduates, and senior business executives. Each group rates 44 different (potential) properties of exemplary research. We analyze within-group differences, and more meaningfully, between-group differences. We then offer commentary on the results and use the results to develop the aforementioned suggestions for bridging the gap we find", "fulltext": "", "keywords": "within-group differences;recent graduates;producers;exemplary research;coefficient of concordance;multiple comparison testing;business school;anova;academics;business people;professors;between-group differences;deans;students;senior business executives;consumers"}
{"name": "train_1670", "title": "An integrated optimization model for train crew management", "abstract": "Train crew management involves the development of a duty timetable for each of the drivers (crew) to cover a given train timetable in a rail transport organization. This duty timetable is spread over a certain period, known as the roster planning horizon. Train crew management may arise either from the planning stage, when the total number of crew and crew distributions are to be determined, or from the operating stage when the number of crew at each depot is known as input data. In this paper, we are interested in train crew management in the planning stage. In the literature, train crew management is decomposed into two stages: crew scheduling and crew rostering which are solved sequentially. We propose an integrated optimization model to solve both crew scheduling and crew rostering. The model enables us to generate either cyclic rosters or non-cyclic rosters. Numerical experiments are carried out over data sets arising from a practical application", "fulltext": "", "keywords": "cyclic rosters;integer programming;crew scheduling;rail transport organization;noncyclic rosters;train crew management;duty timetable;integrated optimization model;crew rostering;roster planning horizon"}
{"name": "train_1671", "title": "Cane railway scheduling via constraint logic programming: labelling order and", "abstract": "constraints in a real-life application In Australia, cane transport is the largest unit cost in the manufacturing of raw sugar, making up around 35% of the total manufacturing costs. Producing efficient schedules for the cane railways can result in significant cost savings. The paper presents a study using constraint logic programming (CLP) to solve the cane transport scheduling problem. Tailored heuristic labelling order and constraints strategies are proposed and encouraging results of application to several test problems and one real-life case are presented. The preliminary results demonstrate that CLP can be used as an effective tool for solving the cane transport scheduling problem, with a potential decrease in development costs of the scheduling system. It can also be used as an efficient tool for rescheduling tasks which the existing cane transport scheduling system cannot perform well", "fulltext": "", "keywords": "total manufacturing costs;heuristic labelling order;cane transport;cost savings;cane railway scheduling;constraints strategies;constraint logic programming;raw sugar"}
{"name": "train_1672", "title": "Two issues in setting call centre staffing levels", "abstract": "Motivated by a problem facing the Police Communication Centre in Auckland, New Zealand, we consider the setting of staffing levels in a call centre with priority customers. The choice of staffing level over any particular time period (e.g., Monday from 8 am-9 am) relies on accurate arrival rate information. The usual method for identifying the arrival rate based on historical data can, in some cases, lead to considerable errors in performance estimates for a given staffing level. We explain why, identify three potential causes of the difficulty, and describe a method for detecting and addressing such a problem", "fulltext": "", "keywords": "nonstationarity;arrival rate information;new zealand;conditional poisson process;priority customers;forecast error;performance estimates;call centre staffing levels;police communication centre;auckland"}
{"name": "train_1673", "title": "Mission planning for regional surveillance", "abstract": "The regional surveillance problem discussed involves formulating a flight route for an aircraft to scan a given geographical region. Aerial surveillance is conducted using a synthetic aperture radar device mounted on the aircraft to compose a complete, high-resolution image of the region. Two models for determining an optimised flight route are described, the first employing integer programming and the second, genetic algorithms. A comparison of the solution optimality in terms of the total distance travelled, and model efficiency of the two techniques in terms of their required CPU times, is made in order to identify the conditions under which it is appropriate to apply each model", "fulltext": "", "keywords": "synthetic aperture radar device;flight route;integer programming;high-resolution image;total distance travelled;mission planning;genetic algorithms;geographical region scanning;regional surveillance;aerial surveillance;optimised flight route;solution optimality"}
{"name": "train_1674", "title": "A column generation approach to delivery planning over time with inhomogeneous", "abstract": "service providers and service interval constraints We consider a problem of delivery planning over multiple time periods. Deliveries must be made to customers having nominated demand in each time period. Demand must be met in each time period by use of some combination of inhomogeneous service providers. Each service provider has a different delivery capacity, different cost of delivery to each customer, a different utilisation requirement, and different rules governing the spread of deliveries in time. The problem is to plan deliveries so as to minimise overall costs, subject to demand being met and service rules obeyed. A natural integer programming model was found to be intractable, except on problems with loose demand constraints, with gaps between best lower bound and best feasible solution of up to 35.1%, with an average of 15.4% over the test data set. In all but the problem with loosest demand constraints, Cplex 6.5 applied to this formulation failed to find the optimal solution before running out of memory. However a column generation approach improved the lower bound by between 0.6% and 21.9%, with an average of 9.9%, and in all cases found the optimal solution at the root node, without requiring branching", "fulltext": "", "keywords": "inhomogeneous service providers;service interval constraints;transportation;delivery planning over time;delivery capacity;column generation approach;lower bound"}
{"name": "train_1675", "title": "An operations research approach to the problem of the sugar cane selection", "abstract": "Selection for superior clones is the most important aspect of sugar cane improvement programs, and is a long and expensive process. While studies have investigated different components of selection independently, there has not been a whole system approach to improve the process. This study observes the problem as an integrated system, where if one parameter changes the state of the whole system changes. A computer based stochastic simulation model that accurately represents the selection was developed. The paper describes the simulation model, showing its accuracy as well as how a combination of dynamic programming and branch and bound can be applied to the model to optimise the selection system, giving a new application of these techniques. The model can be directly applied to any region targeted by sugar cane breeding programs or to other clonally propagated crops", "fulltext": "", "keywords": "clonally propagated crops;sugar cane selection;improvement programs;operations research approach;branch and bound;agriculture;computer based stochastic simulation model;dynamic programming;superior clones;breeding programs"}
{"name": "train_1676", "title": "An optimization based approach to the train operator scheduling problem at", "abstract": "Singapore MRT Singapore Mass Rapid Transit (SMRT) operates two train lines with 83 kilometers of track and 48 stations. A total of 77 trains are in operation during peak hours and 41 during off-peak hours. We report on an optimization based approach to develop a computerized train-operator scheduling system that has been implemented at SMRT. The approach involves a bipartite matching algorithm for the generation of night duties and a tabu search algorithm for the generation of day duties. The system automates the train-operator scheduling process at SMRT and produces favorable schedules in comparison with the manual process. It is also able to handle the multiple objectives inherent in the crew scheduling system. While trying to minimize the system wide crew-related costs, the system is also able to address concern with respect to the number of split duties", "fulltext": "", "keywords": "computerized train-operator scheduling system;optimization based approach;crew scheduling system;bipartite matching algorithm;day duties;tabu search algorithm;night duties;singapore mass rapid transit"}
{"name": "train_1677", "title": "Minimised geometric Buchberger algorithm for integer programming", "abstract": "Recently, various algebraic integer programming (IP) solvers have been proposed based on the theory of Grobner bases. The main difficulty of these solvers is the size of the Grobner bases generated. In algorithms proposed so far, large Grobner bases are generated by either introducing additional variables or by considering the generic IP problem IP/sub A,C/. Some improvements have been proposed such as Hosten and Sturmfels' method (GRIN) designed to avoid additional variables and Thomas' truncated Grobner basis method which computes the reduced Grobner basis for a specific IP problem IP/sub A,C/(b) (rather than its generalisation IPA,C). In this paper we propose a new algebraic algorithm for solving IP problems. The new algorithm, called Minimised Geometric Buchberger Algorithm, combines Hosten and Sturmfels' GRIN and Thomas' truncated Grobner basis method to compute the fundamental segments of an IP problem IP/sub A,C/ directly in its original space and also the truncated Grobner basis for a specific IP problem IP/sub A,C/ (b). We have carried out experiments to compare this algorithm with others such as the geometric Buchberger algorithm, the truncated geometric Buchberger algorithm and the algorithm in GRIN. These experiments show that the new algorithm offers significant performance improvement", "fulltext": "", "keywords": "reduced grobner basis;algebraic integer programming;minimised geometric buchberger algorithm;truncated grobner basis method;truncated geometric buchberger algorithm;performance improvement;grin algorithm;geometric buchberger algorithm;fundamental segments;grobner bases"}
{"name": "train_1678", "title": "Parallel interior point schemes for solving multistage convex programming", "abstract": "The predictor-corrector interior-point path-following algorithm is promising in solving multistage convex programming problems. Among many other general good features of this algorithm, especially attractive is that the algorithm allows the possibility to parallelise the major computations. The dynamic structure of the multistage problems specifies a block-tridiagonal system at each Newton step of the algorithm. A wrap-around permutation is then used to implement the parallel computation for this step", "fulltext": "", "keywords": "multistage convex programming;parallel computation;block-tridiagonal system;dynamic structure;parallel interior point schemes;wrap-around permutation;predictor-corrector interior-point path-following algorithm;newton step"}
{"name": "train_1679", "title": "Project scheduling under time dependent costs-a branch and bound algorithm", "abstract": "In a given project network, execution of each activity in normal duration requires utilization of certain resources. If faster execution of an activity is desired then additional resources at extra cost would be required. Given a project network, the cost structure for each activity and a planning horizon, the project compression problem is concerned with the determination of optimal schedule of performing each activity while satisfying given restrictions and minimizing the total cost of project execution. The paper considers the project compression problem with time dependent cost structure for each activity. The planning horizon is divided into several regular time intervals over which the cost structure of an activity may vary. But the cost structure of the activities remains the same within a time interval. The objective is to find an optimal project schedule minimizing the total project cost. We present a mathematical model for this problem, develop some heuristics and an exact branch and bound algorithm. Using simulated problems we provide an insight into the computational performances of heuristics and the branch and bound algorithm", "fulltext": "", "keywords": "planning horizon;project scheduling;branch and bound algorithm;optimal schedule;project network;heuristics;time dependent costs;project compression problem"}
{"name": "train_168", "title": "Nurturing clients' trust to encourage engagement success during the", "abstract": "customization of ERP systems Customization is a crucial, lengthy, and costly aspect in the successful implementation of ERP systems, and has, accordingly, become a major specialty of many vendors and consulting companies. The study examines how such companies can increase their clients' perception of engagement success through increased client trust that is brought about through responsive and dependable customization. Survey data from ERP customization clients show that, as hypothesized, clients' trust influenced their perception of engagement success with the company. The data also show that clients' trust in the customization company was increased when the company behaved in accordance with client expectations by being responsive, and decreased when the company behaved in a manner that contradicted these expectations by not being dependable. Responses to an open-ended question addendum attached to the survey corroborated the importance of responsiveness and dependability. Implications for customization companies and research on trust are discussed", "fulltext": "", "keywords": "integrity;perceived responsiveness;enterprise resource planning systems;customization;vendors;dependability;engagement success;client trust;erp systems;consulting companies;mrp ii implementation;benevolence"}
{"name": "train_1680", "title": "Minimizing weighted number of early and tardy jobs with a common due window", "abstract": "involving location penalty Studies a single machine scheduling problem to minimize the weighted number of early and tardy jobs with a common due window. There are n non-preemptive and simultaneously available jobs. Each job will incur an early (tardy) penalty if it is early (tardy) with respect to the common due window under a given schedule. The window size is a given parameter but the window location is a decision variable. The objective of the problem is to find a schedule that minimizes the weighted number of early and tardy jobs and the location penalty. We show that the problem is NP-complete in the ordinary sense and develop a dynamic programming based pseudo-polynomial algorithm. We conduct computational experiments, the results of which show that the performance of the dynamic algorithm is very good in terms of memory requirement and CPU time. We also provide polynomial time algorithms for two special cases", "fulltext": "", "keywords": "pseudo-polynomial algorithm;np-complete problem;tardy jobs;common due window;single machine scheduling problem;decision variable;dynamic programming;early jobs;location penalty"}
{"name": "train_1681", "title": "One and two facility network design revisited", "abstract": "The one facility one commodity network design problem (OFOC) with nonnegative flow costs considers the problem of sending d units of flow from a source to a destination where arc capacity is purchased in batches of C units. The two facility problem (TFOC) is similar, but capacity can be purchased either in batches of C units or one unit. Flow costs are zero. These problems are known to be NP-hard. We describe an exact O(n/sup 3/3/sup n/) algorithm for these problems based on the repeated use of a bipartite matching algorithm. We also present a better lower bound of Omega (n/sup 2k*/) for an earlier Omega (n/sup 2k/) algorithm described in the literature where k = [d/C] and k* = min{k, [(n 2)/2]}. The matching algorithm is faster than this one for k >or= [(n - 2)/2]. Finally, we provide another reformulation of the problem that is quasi integral. This property could be useful in designing a modified version of the simplex method to solve the problem using a sequence of pivots with integer extreme solutions, referred to as the integral simplex method in the literature", "fulltext": "", "keywords": "np-hard problems;flow costs;bipartite matching algorithm;integral simplex method;one facility one commodity network design problem;exact algorithm;nonnegative flow costs;pivots;lower bound;quasi integral;two facility network design"}
{"name": "train_1682", "title": "Data mining efforts increase business productivity and efficiency", "abstract": "The use and acquisition of information is a key part of the way any business makes money. Data mining technologies provide greater insight into how this information can be better used and more effectively acquired. Steven Kudyba, an expert in the field of data mining technologies, shares his expertise in an interview", "fulltext": "", "keywords": "productivity;efficiency;data mining"}
{"name": "train_1683", "title": "Unlocking the potential of videoconferencing", "abstract": "I propose in this paper to show, through a number of case studies, that videoconferencing is user-friendly, cost-effective, time-effective and life-enhancing for people of all ages and abilities and that it requires only a creative and imaginative approach to unlock its potential. I believe that these benefits need not, and should not, be restricted to the education sector. My examples will range from simple storytelling, through accessing international experts, professional development and distance learning in a variety of forms, to the use of videoconferencing for virtual meetings and planning sessions. In some cases, extracts from the reactions and responses of the participants will be included to illustrate the impact of the medium", "fulltext": "", "keywords": "videoconferencing;education;case studies;benefits"}
{"name": "train_1684", "title": "E-learning on the college campus: a help or hindrance to students learning", "abstract": "objectives: a case study If you know how to surf the World Wide Web, have used email before, and can learn how to send an email attachment, then learning how to interact in an online course should not be difficult at all. In a way to find out, I decided to offer two identical courses, one of which would be offered online and the other the \"traditional way\". I wanted to see how students would fare with identical material provided in each course. I wanted their anonymous feedback, when the course was over", "fulltext": "", "keywords": "e-learning;distance education;william paterson university"}
{"name": "train_1685", "title": "Use of web technologies in construction project management: what are the", "abstract": "critical success/failure factors? A concept of how the World Wide Web (WWW) and its associated technologies can be used to manage construction projects has been recognized by practitioners in the construction industry for quite sometime. This concept is often referred to as a Web-Based Project Management System (WPMS). It promises, to enhance construction project documentation and control, and to revolutionize the way construction project teams process and transmit project information. WPMS is an electronic project-management system conducted through the Internet. The system provides a centralized, commonly accessible, reliable means of transmitting and storing project information. Project information is stored on the server and a standard Web browser is used as the gateway to exchange this information, eliminating geographic and hardware platforms boundary", "fulltext": "", "keywords": "implementation;construction industry;web-based project management system;web browser;success;project control;project documentation"}
{"name": "train_1686", "title": "Internet infrastructure and the emerging information society: an appraisal of", "abstract": "the Internet backbone industry This paper examines the real constraints to the expansion of all encumbering and all pervasive information technology in our contemporary society. Perhaps the U.S. Internet infrastructure is the most appropriate to examine since it is U.S. technology that has led the world into the Internet age. In this context, this paper reviews the state of the U.S. Internet backbone that will lead us into information society of the future by facilitating massive data transmission", "fulltext": "", "keywords": "internet service providers;backbone companies;local telephone companies;users;internet infrastructure"}
{"name": "train_1687", "title": "Cleared for take-off [Hummingbird Enterprise]", "abstract": "A recent Gartner report identifies Hummingbird in the first wave of vendors as an early example of convergence in the 'smart enterprise suite' market. We spoke to Hummingbird's Marketing Director for Northern Europe", "fulltext": "", "keywords": "smart enterprise suite;hummingbird enterprise;information content;collaboration;knowledge content"}
{"name": "train_1688", "title": "Connecting the business without busting the budget", "abstract": "The \"multi-channel content delivery\" model (MCCD) might be a new concept to you, but it is already beginning to replace traditional methods of business communications, print and content delivery, argues Darren Atkinson, CTO, FormScape", "fulltext": "", "keywords": "content management;business process management;formscape;documents;distributed output management;multi-channel content delivery;retrieval;archive"}
{"name": "train_169", "title": "MRP in a job shop environment using a resource constrained project scheduling", "abstract": "model One of the most difficult tasks in a job shop manufacturing environment is to balance schedule and capacity in an ongoing basis. MRP systems are commonly used for scheduling, although their inability to deal with capacity constraints adequately is a severe drawback. In this study, we show that material requirements planning can be done more effectively in a job shop environment using a resource constrained project scheduling model. The proposed model augments MRP models by incorporating capacity constraints and using variable lead time lengths. The efficacy of this approach is tested on MRP systems by comparing the inventory carrying costs and resource allocation of the solutions obtained by the proposed model to those obtained by using a traditional MRP model. In general, it is concluded that the proposed model provides improved schedules with considerable reductions in inventory carrying costs", "fulltext": "", "keywords": "mrp;project management;job shop environment;inventory carrying costs;scheduling;capacity constraints;material requirements planning;resource constrained project scheduling model;variable lead time lengths;resource allocation"}
{"name": "train_1692", "title": "Passing the image test [imaging accreditation]", "abstract": "Accredited imaging qualifications, hot on the heels of Microsoft, Cisco and others, are taking off in the USA. Dave Tyler looks at the CDIA+ qualification that looks likely to become the exam of choice for the DM industry", "fulltext": "", "keywords": "imaging qualifications;cdia+;accreditation"}
{"name": "train_1693", "title": "Healthy, wealthy and wise? [health sector document management]", "abstract": "NHS spending will rise from Pounds 65.4bn in 2002 to Pounds 87.2bn in 2006, and by 2008, spending will total Pounds 105.6bn. David Tyler looks at how the health sector is already beginning to exploit IT, and particularly document management, to improve service and cut costs", "fulltext": "", "keywords": "nhs spending;scansoft paperport;it;document management"}
{"name": "train_1694", "title": "Product development: using a 3D computer model to optimize the stability of the", "abstract": "Rocket TM powered wheelchair A three-dimensional (3D) lumped-parameter model of a powered wheelchair was created to aid the development of the Rocket prototype wheelchair and to help explore the effect of innovative design features on its stability. The model was developed using simulation software, specifically Working Model 3D. The accuracy of the model was determined by comparing both its static stability angles and dynamic behavior as it passed down a 4.8-cm (1.9\") road curb at a heading of 45 degrees with the performance of the actual wheelchair. The model's predictions of the static stability angles in the forward, rearward, and lateral directions were within 9.3, 7.1, and 3.8% of the measured values, respectively. The average absolute error in the predicted position of the wheelchair as it moved down the curb was 2.2 cm/m (0.9\" per 3'3\") traveled. The accuracy was limited by the inability to model soft bodies, the inherent difficulties in modeling a statically indeterminate system, and the computing time. Nevertheless, it was found to be useful in investigating the effect of eight design alterations on the lateral stability of the wheelchair. Stability was quantified by determining the static lateral stability angles and the maximum height of a road curb over which the wheelchair could successfully drive on a diagonal heading. The model predicted that the stability was more dependent on the configuration of the suspension system than on the dimensions and weight distribution of the wheelchair. Furthermore, for the situations and design alterations studied, predicted improvements in static stability were not correlated with improvements in dynamic stability", "fulltext": "", "keywords": "innovative design features;weight distribution;dynamic stability improvements;predicted position;rocket tm powered wheelchair;4.8 cm;design alterations effect;suspension system configuration;soft bodies modeling;average absolute error;statically indeterminate system;product development;3d computer model;diagonal heading;computing time"}
{"name": "train_1695", "title": "Medical image computing at the Institute of Mathematics and Computer Science in", "abstract": "Medicine, University Hospital Hamburg-Eppendorf The author reviews the history of medical image computing at his institute, summarizes the achievements, sketches some of the difficulties encountered, and draws conclusions that might be of interest especially to people new to the field. The origin and history section provides a chronology of this work, emphasizing the milestones reached during the past three decades. In accordance with the author's group's focus on imaging, the paper is accompanied by many pictures, some of which, he thinks, are of historical value", "fulltext": "", "keywords": "historical value;work chronology;medical diagnostic imaging;university hospital hamburg-eppendorf;medical image computing history;institute of mathematics and computer science in medicine;difficulties encountered"}
{"name": "train_1696", "title": "Comments on \"Frequency decomposition and computing of ultrasound medical images", "abstract": "with wavelet packets\" In this paper, errors and discrepancies in the subject paper [Cincotti et al. (2002)] are highlighted. A comment, concerning the axial resolution associated to the adopted processing procedure is also reported", "fulltext": "", "keywords": "frequency decomposition;wavelet packets;axial resolution;medical diagnostic imaging;ultrasound medical images"}
{"name": "train_1697", "title": "Exact frequency-domain reconstruction for thermoacoustic tomography. II.", "abstract": "Cylindrical geometry For pt. I see ibid., vol. 21, no. 7, p. 823-8 (2002). Microwave-induced thermoacoustic tomography (TAT) in a cylindrical configuration is developed to image biological tissue. Thermoacoustic signals are acquired by scanning a flat ultrasonic transducer. Using a new expansion of a spherical wave in cylindrical coordinates, we apply the Fourier and Hankel transforms to TAT and obtain an exact frequency-domain reconstruction method. The effect of discrete spatial sampling on image quality is analyzed. An aliasing-proof reconstruction method is proposed. Numerical and experimental results are included", "fulltext": "", "keywords": "hankel transform;flat ultrasonic transducer;aliasing-proof reconstruction method;thermoacoustic tomography;discrete spatial sampling effect;medical diagnostic imaging;cylindrical geometry;ultrasound imaging;frequency-domain reconstruction;spherical wave expansion"}
{"name": "train_1698", "title": "Exact frequency-domain reconstruction for thermoacoustic tomography. I. Planar", "abstract": "geometry We report an exact and fast Fourier-domain reconstruction algorithm for thermoacoustic tomography in a planar configuration assuming thermal confinement and constant acoustic speed. The effects of the finite size of the detector and the finite length of the excitation pulse are explicitly included in the reconstruction algorithm. The algorithm is numerically and experimentally verified. We also demonstrate that the blurring caused by the finite size of the detector surface is the primary limiting factor on the resolution and that it can be compensated for by deconvolution", "fulltext": "", "keywords": "thermal confinement;primary limiting factor;constant acoustic speed;reconstruction algorithm;deconvolution;blurring;planar configuration;resolution limitation;thermoacoustic tomography;medical diagnostic imaging;planar geometry;exact frequency-domain reconstruction;finite detector surface size;excitation pulse"}
{"name": "train_1699", "title": "Time-domain reconstruction for thermoacoustic tomography in a spherical", "abstract": "geometry Reconstruction-based microwave-induced thermoacoustic tomography in a spherical configuration is presented. Thermoacoustic waves from biological tissue samples excited by microwave pulses are measured by a wide-band unfocused ultrasonic transducer, which is set on a spherical surface enclosing the sample. Sufficient data are acquired from different directions to reconstruct the microwave absorption distribution. An exact reconstruction solution is derived and approximated to a modified backprojection algorithm. Experiments demonstrate that the reconstructed images agree well with the original samples. The spatial resolution of the system reaches 0.5 mm", "fulltext": "", "keywords": "time-domain reconstruction;exact reconstruction solution;spherical geometry;spherical surface enclosing sample;biological tissue samples;thermoacoustic tomography;0.5 mm;modified backprojection algorithm;medical diagnostic imaging;reconstructed images;system spatial resolution;wide-band unfocused ultrasonic transducer"}
{"name": "train_17", "title": "Fault diagnosis and fault tolerant control of linear stochastic systems with", "abstract": "unknown inputs This paper presents an integrated robust fault detection and isolation (FDI) and fault tolerant control (FTC) scheme for a fault in actuators or sensors of linear stochastic systems subjected to unknown inputs (disturbances). As usual in this kind of works, it is assumed that single fault occurs at a time and the fault treated is of random bias type. The FDI module is constructed using banks of robust two-stage Kalman filters, which simultaneously estimate the state and the fault bias, and generate residual sets decoupled from unknown disturbances. All elements of residual sets are evaluated by using a hypothesis statistical test, and the fault is declared according to the prepared decision logic. The FTC module is activated based on the fault indicator, and additive compensation signal is computed using the fault bias estimate and combined to the nominal control law for compensating the fault's effect on the system. Simulation results for the simplified longitudinal flight control system with parameter variations, process and measurement noises demonstrate the effectiveness of the approach proposed", "fulltext": "", "keywords": "state estimation;fault detection;fault tolerant control;longitudinal flight control system;linear systems;two-stage kalman filters;robust control;stochastic systems;fault isolation;discrete-time system"}
{"name": "train_170", "title": "The impact of the product mix on the value of flexibility", "abstract": "Product-mix flexibility is one of the major types of manufacturing flexibility, referring to the ability to produce a broad range of products or variants with presumed low changeover costs. The value of such a capability is important to establish for an industrial firm in order to ensure that the flexibility provided will be at the right level and used profitably rather than in excess of market requirements and consequently costly. We use option-pricing theory to analyse the impact of various product-mix issues on the value of flexibility. The real options model we use incorporates multiple products, capacity constraints as well as set-up costs. The issues treated here include the number of products, demand variability, correlation between products, and the relative demand distribution within the product mix. Thus, we are interested in the nature of the input data to analyse its effect on the value of flexibility. We also check the impact at different capacity levels. The results suggest that the value of flexibility (i) increases with an increasing number of products, (ii) decreases with increasing volatility of product demand, (iii) decreases the more positively correlated the demand is, and (iv) reduces for marginal capacity with increasing levels of capacity. Of these, the impact of positively correlated demand seems to be a major issue. However, the joint impact of the number of products and demand correlation showed some non-intuitive results", "fulltext": "", "keywords": "marginal capacity;flexible manufacturing;option-pricing theory;positively correlated demand;multiple products;industrial firm;product demand volatility;manufacturing flexibility;capital budgeting;product correlation;demand variability;low changeover costs;demand correlation;product-mix flexibility;capacity constraints;real options model;relative demand distribution;set-up costs"}
{"name": "train_1700", "title": "Computation of unmeasured third-generation VCT views from measured views", "abstract": "We compute unmeasured cone-beam projections from projections measured by a third-generation helical volumetric computed tomography system by solving a characteristic problem for an ultrahyperbolic differential equation [John (1938)]. By working in the Fourier domain, we convert the second-order PDE into a family of first-order ordinary differential equations. A simple first-order integration is used to solve the ODES", "fulltext": "", "keywords": "first-order ordinary differential equations;ultrahyperbolic differential equation;range conditions;third-generation helical volumetric computed tomography system;characteristic problem solution;unmeasured third-generation vct views computation;fourier domain;measured views;medical diagnostic imaging;simple first-order integration;cone-beam projections"}
{"name": "train_1701", "title": "Estimation of 3-D left ventricular deformation from medical images using", "abstract": "biomechanical models The quantitative estimation of regional cardiac deformation from three-dimensional (3-D) image sequences has important clinical implications for the assessment of viability in the heart wall. We present here a generic methodology for estimating soft tissue deformation which integrates image-derived information with biomechanical models, and apply it to the problem of cardiac deformation estimation. The method is image modality independent. The images are segmented interactively and then initial correspondence is established using a shape-tracking approach. A dense motion field is then estimated using a transversely isotropic, linear-elastic model, which accounts for the muscle fiber directions in the left ventricle. The dense motion field is in turn used to calculate the deformation of the heart wall in terms of strain in cardiac specific directions. The strains obtained using this approach in open-chest dogs before and after coronary occlusion, exhibit a high correlation with strains produced in the same animals using implanted markers. Further, they show good agreement with previously published results in the literature. This proposed method provides quantitative regional 3-D estimates of heart deformation", "fulltext": "", "keywords": "regional cardiac deformation;biomechanical models;open-chest dogs;quantitative estimation;interactively segmented images;cardiac specific directions;left ventricular motion estimation;nonrigid motion estimation;transversely isotropic linear-elastic model;muscle fiber directions;3-d left ventricular deformation estimation;medical diagnostic imaging;magnetic resonance imaging;generic methodology;3-d image sequences"}
{"name": "train_1702", "title": "Reconstruction of time-varying 3-D left-ventricular shape from multiview X-ray", "abstract": "cineangiocardiograms This paper reports on the clinical application of a system for recovering the time-varying three-dimensional (3-D) left-ventricular (LV) shape from multiview X-ray cineangiocardiograms. Considering that X-ray cineangiocardiography is still commonly employed in clinical cardiology and computational costs for 3-D recovery and visualization are rapidly decreasing, it is meaningful to develop a clinically applicable system for 3-D LV shape recovery from X-ray cineangiocardiograms. The system is based on a previously reported closed-surface method of shape recovery from two-dimensional occluding contours with multiple views. To apply the method to \"real\" LV cineangiocardiograms, user-interactive systems were implemented for preprocessing, including detection of LV contours, calibration of the imaging geometry, and setting of the LV model coordinate system. The results for three real LV angiographic image sequences are presented, two with fixed multiple views (using supplementary angiography) and one with rotating views. 3-D reconstructions utilizing different numbers of views were compared and evaluated in terms of contours manually traced by an experienced radiologist. The performance of the preprocesses was also evaluated, and the effects of variations in user-specified parameters on the final 3-D reconstruction results were shown to be sufficiently small. These experimental results demonstrate the potential usefulness of combining multiple views for 3-D recovery from \"real\" LV cineangiocardiograms", "fulltext": "", "keywords": "b-spline;multiview x-ray cineangiocardiograms;computational costs;clinical cardiology;time-varying 3-d left-ventricular shape reconstruction;fixed multiple views;angiographic image sequences;user-interactive systems;two-dimensional occluding contours;medical diagnostic imaging;user-specified parameters variations;experienced radiologist;arterial septal defect"}
{"name": "train_1703", "title": "Statistical analysis of nonlinearly reconstructed near-infrared tomographic", "abstract": "images. II. Experimental interpretation For pt. I see ibid., vol. 21, no. 7, p. 755-63 (2002). Image error analysis of a diffuse near-infrared tomography (NIR) system has been carried out on simulated data using a statistical approach described in pt. I of this paper (Pogue et al., 2002). The methodology is used here with experimental data acquired on phantoms with a prototype imaging system intended for characterizing breast tissue. Results show that imaging performance is not limited by random measurement error, but rather by calibration issues. The image error over the entire field of view is generally not minimized when an accurate homogeneous estimate of the phantom properties is available; however, local image error over a target region of interest (ROI) is reduced. The image reconstruction process which includes a Levenberg-Marquardt style regularization provides good minimization of the objective function, yet its reduction is not always correlated with an overall image error decrease. Minimization of the bias in an ROI which contains localized changes in the optical properties can be achieved through five to nine iterations of the algorithm. Precalibration of the algorithm through statistical evaluation of phantom studies may provide a better measure of the image accuracy than that implied by minimization of the standard objective function", "fulltext": "", "keywords": "nonlinearly reconstructed near-infrared tomographic images;random measurement error;target region of interest;accurate homogeneous estimate;image error;bias minimization;phantom properties;hemoglobin;medical diagnostic imaging;objective function minimization;algorithm iterations;algorithm precalibration;levenberg-marquardt style regularization"}
{"name": "train_1704", "title": "Statistical analysis of nonlinearly reconstructed near-infrared tomographic", "abstract": "images. I. Theory and simulations Near-infrared (NIR) diffuse tomography is an emerging method for imaging the interior of tissues to quantify concentrations of hemoglobin and exogenous chromophores noninvasively in vivo. It often exploits an optical diffusion model-based image reconstruction algorithm to estimate spatial property values from measurements of the light flux at the surface of the tissue. In this study, mean-squared error (MSE) over the image is used to evaluate methods for regularizing the ill-posed inverse image reconstruction problem in NIR tomography. Estimates of image bias and image standard deviation were calculated based upon 100 repeated reconstructions of a test image with randomly distributed noise added to the light flux measurements. It was observed that the bias error dominates at high regularization parameter values while variance dominates as the algorithm is allowed to approach the optimal solution. This optimum does not necessarily correspond to the minimum projection error solution, but typically requires further iteration with a decreasing regularization parameter to reach the lowest image error. Increasing measurement noise causes a need to constrain the minimum regularization parameter to higher values in order to achieve a minimum in the overall image MSE", "fulltext": "", "keywords": "ill-posed inverse image reconstruction problem regularization;test image;light flux;spatial property values estimation;mean-squared error;lowest image error;decreasing regularization parameter;minimum regularization parameter constraint;photon migration;o/sub 2/;randomly distributed noise;optimal solution;medical diagnostic imaging;hemoglobin;bias error;oxygen saturation;optical diffusion model-based image reconstruction algorithm"}
{"name": "train_1705", "title": "The use of visual search for knowledge gathering in image decision support", "abstract": "This paper presents a new method of knowledge gathering for decision support in image understanding based on information extracted from the dynamics of saccadic eye movements. The framework involves the construction of a generic image feature extraction library, from which the feature extractors that are most relevant to the visual assessment by domain experts are determined automatically through factor analysis. The dynamics of the visual search are analyzed by using the Markov model for providing training information to novices on how and where to look for image features. The validity of the framework has been evaluated in a clinical scenario whereby the pulmonary vascular distribution on Computed Tomography images was assessed by experienced radiologists as a potential indicator of heart failure. The performance of the system has been demonstrated by training four novices to follow the visual assessment behavior of two experienced observers. In all cases, the accuracy of the students improved from near random decision making (33%) to accuracies ranging from 50% to 68%", "fulltext": "", "keywords": "visual assessment behavior;student accuracy;experienced observers;heart failure indicator;pulmonary vascular distribution;training information;domain experts;medical diagnostic imaging;markov model;saccadic eye movements dynamics;experienced radiologists;image features;near random decision making"}
{"name": "train_1706", "title": "Quantitative analysis of reconstructed 3-D coronary arterial tree and", "abstract": "intracoronary devices Traditional quantitative coronary angiography is performed on two-dimensional (2-D) projection views. These views are chosen by the angiographer to minimize vessel overlap and foreshortening. With 2-D projection views that are acquired in this nonstandardized fashion, however, there is no way to know or estimate how much error occurs in the QCA process. Furthermore, coronary arteries possess a curvilinear shape and undergo a cyclical deformation due to their attachment to the myocardium. Therefore, it is necessary to obtain three-dimensional (3-D) information to best describe and quantify the dynamic curvilinear nature of the human coronary artery. Using a patient-specific 3-D coronary reconstruction algorithm and routine angiographic images, a new technique is proposed to describe: (1) the curvilinear nature of 3-D coronary arteries and intracoronary devices; (2) the magnitude of the arterial deformation caused by intracoronary devices and due to heart motion; and (3) optimal view(s) with respect to the desired \"pathway\" for delivering intracoronary devices", "fulltext": "", "keywords": "patient-specific 3-d coronary reconstruction algorithm;routine angiographic images;myocardium;intracoronary devices delivery pathway;cyclical deformation;medical diagnostic imaging;human coronary artery;arterial deformation magnitude;dynamic curvilinear nature quantification"}
{"name": "train_1707", "title": "Tactical airborne reconnaissance goes dual-band and beyond", "abstract": "Multispectral imaging technologies are satisfying the need for a \"persistent\" look at the battlefield. We highlight the need to persistently monitor a battlefield to determine exactly who and what is there. For example, infrared imaging can be used to expose the fuel status of an aircraft on the runway. A daytime, visible-spectrum image of the same aircraft would offer information about external details, such as the plane's markings and paint scheme. A dual-band camera enables precision image registration by fusion and frequently yields more information than is possible by evaluating the images separately", "fulltext": "", "keywords": "aircraft;daytime visible-spectrum image;sensor fusion;dual-band camera;infrared imaging;fuel status;tactical airborne reconnaissance;multispectral imaging technologies;battlefield;precision image registration"}
{"name": "train_1708", "title": "A study of hospitality and tourism information technology education and", "abstract": "industrial applications The purpose of this study was to examine the subject relevance of information technology (IT) in hospitality and tourism management programs with skills deployed in the workplace. This study aimed at investigating graduates' transition from education to employment, and to determine how well they appear to be equipped to meet the needs of the hospitality and tourism industry. One hundred and seventeen graduates responded to a mail survey. These graduates rated the importance of IT skills in the workplace, the level of IT teaching in hotel and tourism management programs, and the self-competence level in IT. This study concluded that a gap exists between the IT skills required at work and those acquired at university", "fulltext": "", "keywords": "employment;university;tourism industry;it skills;mail survey;hospitality and tourism management programs;graduates;it teaching;hospitality industry;education"}
{"name": "train_1709", "title": "Development of computer-mediated teaching resources for tourism distance", "abstract": "education: the University of Otago model This article presents a qualitative account of the development of computer-mediated tourism distance learning resources. A distance learning model was developed at the Centre for Tourism, University of Otago (New Zealand) in 1998-1999. The article reviews the development of this Internet-based learning resource explaining the design and development of programme links (providing study information for students) and paper links (course material and learning features). The design of course material is reviewed with emphasis given to consistency of presentation between papers. The template for course material is described and illustrated and the article concludes with an overview of important design considerations", "fulltext": "", "keywords": "internet-based learning resource;computer-mediated tourism distance learning resources;paper links;university of otago;programme links"}
{"name": "train_171", "title": "Education, training and development policies and practices in medium-sized", "abstract": "companies in the UK: do they really influence firm performance? This paper sets out to examine the relationship between training and firm performance in middle-sized UK companies. It recognises that there is evidence that \"high performance work practices\" appear to be associated with better performance in large US companies, but argues that this relationship is less likely to be present in middle-sized companies. The paper's key contribution is to justify the wider concept of education, training and development (ETD) as applicable to such companies. It then finds that clusters of some ETD variables do appear to be associated with better middle-sized company performance", "fulltext": "", "keywords": "training;etd variable clusters;firm performance;high performance work practices;human resources;medium-sized uk companies;education;development policies"}
{"name": "train_1710", "title": "VONNA(HBP): a multimedia learning package on hotel budget planning", "abstract": "In this paper, a new learning package, VONNA(HBP), which provides an interactive and online environment for novices to study and practice hotel budget planning, is introduced. Its design philosophy will be discussed thoughtfully with special focus on how to make use of the multimedia and Internet. According to literatures, learning packages are faced to be more effective in delivering teaching material. Researchers indicate that students using a self-paced learning package score higher than in a traditional classroom setting. Moreover, the learning package provides different scenarios for students to explore themselves in a practical environment and is more cost effective and systematic than lectures. Currently, most learning packages in hotel education are not implemented using multimedia with Internet access. Our paper describes a new learning package that fills the gaps. VONNA(HBP) requires participants to investigate operational budgets on various areas such as sales levels, payroll, inventory level, promotion strategies, and facilities planning, etc. Eventually, the students/novices are required to practice their skills in a comprehensive case about a hypothetical hotel. They need to solve managerial problems by a combination of budgetary planning on human resources, staff training programmes, facilities' maintenance and replacement, or promotion schemes. Analytical tools are available for students/novices to judge an appropriate decision in handling constrained resources", "fulltext": "", "keywords": "self-paced learning package;sales;internet;multimedia learning package;hotel education;hotel budget planning;facility maintenance;interactive online environment;vonna(hbp);facility replacement;human resources;constrained resource handling;teaching material delivery;managerial problems;promotion strategies;staff training programmes;payroll;facilities planning;inventory"}
{"name": "train_1711", "title": "Developing a CD-ROM as a teaching and learning tool in food and beverage", "abstract": "management: a case study in hospitality education Food and beverage management is the traditional core of hospitality education but, in its laboratory manifestation, has come under increasing pressure in recent years. It is an area that, arguably, presents the greatest challenges in adaptation to contemporary learning technologies but, at the same time, stands to benefit most from the potential of the Web. This paper addresses the design and development of a CD-ROM learning resource for food and beverage. It is a learning resource which is designed to integrate with rather than to replace existing conventional classroom and laboratory learning methods and, thus, compensate for the decline in the resource base faced in food and beverage education in recent years. The paper includes illustrative material drawn from the CD-ROM which demonstrates its use in teaching and learning", "fulltext": "", "keywords": "food and beverage management;learning tool;cd-rom;teaching tool;hospitality education"}
{"name": "train_1712", "title": "Eliminating counterevidence with applications to accountable certificate", "abstract": "management This paper presents a method to increase the accountability of certificate management by making it intractable for the certification authority (CA) to create contradictory statements about the validity of a certificate. The core of the method is a new primitive, undeniable attester, that allows someone to commit to some set S of bitstrings by publishing a short digest of S and to give attestations for any x that it is or is not a member of S. Such an attestation can be verified by obtaining in an authenticated way the published digest and applying a verification algorithm to the triple of the bitstring, the attestation and the digest. The most important feature of this primitive is the intractability of creating two contradictory proofs for the same candidate element x and digest. We give an efficient construction for undeniable attesters based on authenticated search trees. We show that the construction also applies to sets of more structured elements. We also show that undeniable attesters exist iff collision-resistant hash functions exist", "fulltext": "", "keywords": "long-term authenticity;accountable certificate management;undeniable attester primitive;accountability;attestations;bitstring;counterevidence elimination;collision-resistant hash functions;contradictory proofs;time-stamping;public-key infrastructure;non repudiation;structured elements;verification algorithm;certification authority;authenticated search trees;published digest"}
{"name": "train_1713", "title": "A uniform framework for regulating service access and information release on", "abstract": "the Web The widespread use of Internet-based services is increasing the amount of information (such as user profiles) that clients are required to disclose. This information demand is necessary for regulating access to services, and functionally convenient (e.g., to support service customization), but it has raised privacy-related concerns which, if not addressed, may affect the users disposition to use network services. At the same time, servers need to regulate service access without disclosing entirely the details of their access control policy. There is therefore a pressing need for privacy-aware techniques to regulate access to services open to the network. We propose an approach for regulating service access and information disclosure on the Web. The approach consists of a uniform formal framework to formulate - and reason about - both service access and information disclosure constraints. It also provides a means for parties to communicate their requirements while ensuring that no private information be disclosed and that the communicated requirements are correct with respect to the constraints", "fulltext": "", "keywords": "internet;network services;user profiles;uniform formal framework;privacy-aware techniques;reasoning;information release;information disclosure;client server systems;service access regulation;information demand;access control policy;www"}
{"name": "train_1714", "title": "Hordes: a multicast based protocol for anonymity", "abstract": "With widespread acceptance of the Internet as a public medium for communication and information retrieval, there has been rising concern that the personal privacy of users can be eroded by cooperating network entities. A technical solution to maintaining privacy is to provide anonymity. We present a protocol for initiator anonymity called Hordes, which uses forwarding mechanisms similar to those used in previous protocols for sending data, but is the first protocol to make use of multicast routing to anonymously receive data. We show this results in shorter transmission latencies and requires less work of the protocol participants, in terms of the messages processed. We also present a comparison of the security and anonymity of Hordes with previous protocols, using the first quantitative definition of anonymity and unlinkability. Our analysis shows that Hordes provides anonymity in a degree similar to that of Crowds and Onion Routing, but also that Hordes has numerous performance advantages", "fulltext": "", "keywords": "initiator anonymity;protocol;multicast routing;transmission latencies;onion routing;performance;internet;crowds;unlinkability;personal privacy;hordes;cooperating network entities;forwarding mechanisms"}
{"name": "train_1715", "title": "Information-processing and computing systems at thermal power stations in China", "abstract": "The development and commissioning of information-processing and computing systems (IPCSs) at four power units, each of 500 MW capacity at the thermal power stations Tszisyan' and Imin' in China, are considered. The functional structure and the characteristics of the functions of the IPCSs are presented as is information on the technology of development and experience in adjustments. Ways of using the experience gained in creating a comprehensive functional firmware system are shown", "fulltext": "", "keywords": "500 mw;commissioning;thermal power stations;functional structure;firmware system;development;information-processing systems;china;functions characteristics;computing systems"}
{"name": "train_1716", "title": "The vibration reliability of poppet and contoured actuator valves", "abstract": "The problem of selecting the shape of the actuator valve (the final control valve) itself is discussed; the solution to this problem will permit appreciable dynamic loads to be eliminated from the moving elements of the steam distribution system of steam turbines under all operating conditions", "fulltext": "", "keywords": "actuator valve shape selection;steam distribution system;steam turbines;vibration reliability;contoured actuator valves;poppet actuator valves;dynamic loads elimination;moving elements"}
{"name": "train_1717", "title": "Responding to market trends with predictive segmentation [health care]", "abstract": "Technology and technological advances have always been a part of healthcare, but often it's advances in treatment machinery and materials that get the attention. However, technology gains also occur behind the scenes in operations. One of the less glamorous but powerful technological advances available today is predictive segmentation, a phrase that means \"a new way to assess and view individuals in the market based on their health status and health needs.\" Sophisticated databases, data mining, neural networks and statistical capabilities have enabled the development of predictive segmentation techniques. These predictive models for healthcare can identify who is likely to need certain services and who is likely to become ill. They are a significant departure from various geographical and attitudinal segmentation methods that healthcare strategists have used in the past to gain a better understanding of their customers", "fulltext": "", "keywords": "data mining;market trends;predictive segmentation;neural networks;healthcare"}
{"name": "train_1719", "title": "The UPS as network management tool", "abstract": "Uninterrupted power supplies (UPS), or battery backup systems, once provided a relatively limited, although important, function-continual battery support to connected equipment in the event of a power failure. However, yesterday's \"battery in a box\" has evolved into a sophisticated network power management tool that can monitor and actively correct many of the problems that might plague a healthy network. This new breed of UPS system provides such features as automatic voltage regulation, generous runtimes and unattended system shutdown, and now also monitors and automatically restarts critical services and operating systems if they lock up or otherwise fail", "fulltext": "", "keywords": "network power management;automatic voltage regulation;uninterrupted power supplies;unattended system shutdown"}
{"name": "train_172", "title": "A VMEbus interface for multi-detector trigger and control system", "abstract": "MUSE (MUltiplicity SElector) is the trigger and control system of CHIMERA, a 4 pi charged particle detector. Initialization of MUSE can be performed via VMEbus. This paper describes the design of VMEbus interface and functional module in MUSE, and briefly discusses an application of MUSE", "fulltext": "", "keywords": "chimera;trigger system;muse;control system;vmebus interface"}
{"name": "train_1721", "title": "Dueling platforms [healthcare network servers]", "abstract": "Many large hospitals and healthcare systems have grown accustomed to the reliability of mainframe architecture, although tighter operating budgets, coupled with advances in client/server technology, have led to more office and clinical applications being moved off mainframes. But Evanston Northwestern Healthcare wasn't ready to get rid of its IBM OS 390 mainframe just yet. While a number of new clinical applications are being installed on two brand new IBM servers, Evanston Northwestern Healthcare will retain its favored hospital billing system and let it reside on the organization's mainframe, as it has since 1982", "fulltext": "", "keywords": "network servers;evanston northwestern healthcare;leapfrog group;ibm os 390 mainframe;computerized physician order entry system"}
{"name": "train_1723", "title": "Positive productivity, better billing [health care]", "abstract": "Workflow software provides the right communication solution for hospital specialists, and delivers an unexpected financial boost too", "fulltext": "", "keywords": "san francisco general hospital;workflow software;health care;provation md"}
{"name": "train_1724", "title": "A winning combination [wireless health care]", "abstract": "Three years ago, the Institute of Medicine (IOM) reported that medical errors result in at least 44,000 deaths each year-more than deaths from highway accidents, breast cancer or AIDS. That report, and others which placed serious errors as high as 98,000 annually, served as a wake-up call for healthcare providers such as the CareGroup Healthcare System Inc., a Boston-area healthcare network that is the second largest integrated delivery system in the northeastern United States. With annual revenues of $1.2B, CareGroup provides primary care and specialty services to more than 1,000,000 patients. CareGroup combined wireless technology with the Web to create a provider order entry (POE) system designed to reduce the frequency of costly medical mistakes. The POE infrastructure includes InterSystems Corporation's CACHE database, Dell Computer C600 laptops and Cisco Systems' Aironet 350 wireless networks", "fulltext": "", "keywords": "cisco systems aironet 350 wireless networks;dell computer c600 laptops;healthcare network;intersystems corporation cache database;wireless;caregroup healthcare system;medical errors;provider order entry"}
{"name": "train_1725", "title": "Cutting the cord [wireless health care]", "abstract": "More and more healthcare executives are electing to cut the cord to their existing computer systems by implementing mobile technology. The allure of information anywhere, anytime is intoxicating, demonstrated by the cell phones and personal digital assistants (PDAs) that adorn today's professionals. The utility and convenience of these devices is undeniable. But what is the best strategy for implementing a mobile solution within a healthcare enterprise, be it large or small-and under what circumstances? What types of healthcare workers benefit most from mobile technology? And how state-of-the-art is security for wireless applications and devices? These are the questions that healthcare executives are asking-and should be asking-as they evaluate mobile solutions", "fulltext": "", "keywords": "mobile computing;security;wireless computing;healthcare"}
{"name": "train_1726", "title": "Two-layer model for the formation of states of the hidden Markov chains", "abstract": "Procedures for the formation of states of the hidden Markov models are described. Formant amplitudes and frequencies are used as state features. The training strategy is presented that allows one to calculate the parameters of conditional probabilities of the generation of a given formant set by a given hidden state with the help of the maximum likelihood method", "fulltext": "", "keywords": "state features;conditional probabilities;hidden state;hidden markov models;formant amplitudes;formant frequencies;maximum likelihood method"}
{"name": "train_1727", "title": "Linguistic knowledge and new technologies", "abstract": "Modern language studies are characterized by a variety of forms, ways, and methods of their development. In this connection, it is necessary to specify the problem of the development of their internal differentiation and classification, which lead to the formation of specific areas knowledge. An example of such an area is speechology-a field of science belonging to fundamental, theoretical, and applied linguistics", "fulltext": "", "keywords": "theoretical linguistics;speechology;applied linguistics;internal differentiation;fundamental linguistics;internal classification;modern language studies;linguistic knowledge"}
{"name": "train_1728", "title": "A characterization of generalized Pareto distributions by progressive censoring", "abstract": "schemes and goodness-of-fit tests In this paper we generalize a characterization property of generalized Pareto distributions, which is known for ordinary order statistics, to arbitrary schemes of progressive type-II censored order statistics. Various goodness-of-fit tests for generalized Pareto distributions based on progressively censored data statistics are discussed", "fulltext": "", "keywords": "progressive type-ii censored order statistics;progressive censoring schemes;generalized pareto distributions;goodness-of-fit tests;ordinary order statistics"}
{"name": "train_1729", "title": "Maintaining e-commerce", "abstract": "E-commerce over the Web has created a relatively new type of information system. So it is hardly surprising that little attention has been given to the maintenance of such systems-and even less to attempting to develop them with future maintenance in mind. But there are various ways e-commerce systems can be developed to reduce future maintenance", "fulltext": "", "keywords": "web systems;e-commerce systems maintenance"}
{"name": "train_173", "title": "Stock market trading rule discovery using technical charting heuristics", "abstract": "In this case study in knowledge engineering and data mining, we implement a recognizer for two variations of the 'bull flag' technical charting heuristic and use this recognizer to discover trading rules on the NYSE Composite Index. Out-of-sample results indicate that these rules are effective", "fulltext": "", "keywords": "out-of-sample results;case study;data mining;technical charting heuristics;financial expert system;rule discovery;nyse composite index;stock market trading;knowledge engineering"}
{"name": "train_1730", "title": "Meeting of minds", "abstract": "Technical specialists need to think about their role in IT projects and how they communicate with end-users and other participants to ensure they contribute fully as team members. It is especially important to communicate and document trade-offs that may have to be made, including the rationale behind them, so that if requirements change, the impact and decisions can be readily communicated to the stakeholders", "fulltext": "", "keywords": "communication;technical specialists;end-users;it projects"}
{"name": "train_1731", "title": "Hit the road, Jack", "abstract": "Going freelance offers the potential of higher earnings, variety and independence - but also removes the benefits of permanent employment and can mean long distance travel and periods out of work. The author looks at the benefits and drawbacks - and how to get started as an IT contractor", "fulltext": "", "keywords": "it contractor;freelance working"}
{"name": "train_1732", "title": "Community spirit", "abstract": "IT companies that contribute volunteers, resources or funding to charities and local groups not only make a real difference to their communities but also add value to their businesses. So says a new coalition of IT industry bodies formed to raise awareness of the options for community involvement, promote the business case, and publicise examples of best practice. The BCS, Intellect (formed from the merger of the Computing Services and Software Association and the Federation of the Electronics Industry) and the Worshipful Company of Information Technologists plan to run advisory seminars and provide guidelines on how companies of all sizes can transform their local communities using their specialist IT skills and resources while reaping business benefits", "fulltext": "", "keywords": "volunteer staff;resource contribution;staff development;it companies;best practice;community projects;business benefits;charity projects"}
{"name": "train_1733", "title": "Computing grid unlocks research", "abstract": "Under the UK government's spending review in 2000 the Office of Science and Technology was allocated Pounds 98m to establish a three year e-science research and development programme. The programme has a bold vision: to change the dynamic of the way science is undertaken. The term 'e-science' was introduced by John Taylor, director general of research councils in the Office of Science and Technology. He saw many areas of science becoming increasingly reliant on new ways of collaborative, multidisciplinary, interorganisation working. E-science is intended to capture these new modes of working. There are two major components to the programme: the science, and the infrastructure to support that science. The infrastructure is generally referred to as the Grid. The choice of name resonates with the idea of a future in which computing resources and storage, as well as expensive scientific facilities and software, can be accessed on demand, like electricity. Open source prototypes of the middleware are available and under development as part of the e-science programme and other international efforts", "fulltext": "", "keywords": "computing resources;software;open source prototypes;grid computing;uk programme;middleware;e-science;collaboration;scientific research"}
{"name": "train_1734", "title": "Going electronic [auditing]", "abstract": "A study group examines the issues auditors face in gathering electronic information as evidence and its impact on the audit", "fulltext": "", "keywords": "auditing;electronic information;assurance standards;audit evidence"}
{"name": "train_1735", "title": "Mid-market accounting systems", "abstract": "Welcome to our fourth annual survey of accounting systems and enterprise resource planning (ERP) systems. Last September, we concentrated on financial and distribution systems for medium-sized businesses (mid market) and included 22 products in our charts. This year, we extended the products to include manufacturing and added 34 products to the list", "fulltext": "", "keywords": "mid-market accounting systems;enterprise resource planning;survey;manufacturing"}
{"name": "train_1736", "title": "Wired right [accounting]", "abstract": "From business intelligence to wireless networking to service providers, here is what you need to know to keep up to speed with a changing landscape", "fulltext": "", "keywords": "service providers;wireless networking;accounting;business intelligence"}
{"name": "train_1737", "title": "The road to recovery [disaster planning]", "abstract": "September 11 stripped us of our innocence, forcing corporations to recognize that disaster planning is a business necessity", "fulltext": "", "keywords": "disaster planning;recovery;risk management"}
{"name": "train_1738", "title": "Nurture the geek in you [accounting on the Internet]", "abstract": "When chartered accountants focus on IT, it's not simply because we think technology is neat. We keep on top of tech trends and issues because it helps us do our jobs well. We need to know how to best manage and implement the wealth of technology systems within out client base or employer, as well as to determine on an ongoing basis how evolving technologies might affect business strategies, threats and opportunities. One way to stay current with technology is by monitoring the online drumbeat. Imagine the Internet as an endless conversation of millions of chattering voices, each focusing on a multitude of topics and issues. It's not surprising that a great deal of the information relates to technology itself, and if you learn how to tune in to the drumbeat, you can keep yourself informed", "fulltext": "", "keywords": "securityfocus;techdirt;chartered accountants;internet;information technology;dan gillmor's wournal;techweb;slashdot;risks;the register;daypop top 40"}
{"name": "train_1739", "title": "Application of normal possibility decision rule to silence", "abstract": "The paper presents the way of combining two decision problems concerning a single (or a common) dimension, so that an effective fuzzy decision rule can be obtained. Normality of the possibility distribution is assumed, leading to possibility of fusing the respective functions related to the two decision problems and their characteristics (decisions, states of nature, utility functions, etc.). The approach proposed can be applied in cases when the statement of the problem requires making of more refined distinctions rather than considering simply a bi-criterion or bi-utility two-decision problem", "fulltext": "", "keywords": "silence;conflicting objectives;conflicting utilities;normal possibility decision rule;warm heart;decision problems;two-dimensional fuzzy events;cool head"}
{"name": "train_174", "title": "The BIOGENES system for knowledge-based bioprocess control", "abstract": "The application of knowledge-based control systems in the area of biotechnological processes has become increasingly popular over the past decade. This paper outlines the structure of the advanced knowledge-based part of the BIOGENES Copyright control system for the control of bioprocesses such as the fed-batch Saccharomyces cerevisiae cultivation. First, a brief overview of all the tasks implemented in the knowledge-based level including process data classification, qualitative process state identification and supervisory process control is given. The procedures performing the on-line identification of metabolic states and supervisory process control (setpoint calculation and control strategy selection) are described in more detail. Finally, the performance of the system is discussed using results obtained from a number of experimental cultivation runs in a laboratory unit", "fulltext": "", "keywords": "qualitative process state identification;biotechnological processes;online identification;fed-batch saccharomyces cerevisiae cultivation;metabolic states;process data classification;biogenes system;supervisory process control;experiment;knowledge-based bioprocess control"}
{"name": "train_1740", "title": "Verification of ideological classifications-a statistical approach", "abstract": "The paper presents a statistical method of verifying ideological classifications of votes. Parliamentary votes, preclassified by an expert (on a chosen subset), are verified at an assumed significance level by seeking the most likely match with the actual vote results. Classifications that do not meet the requirements defined are rejected. The results obtained can be applied in the ideological dimensioning algorithms, enabling ideological identification of dimensions obtained", "fulltext": "", "keywords": "ideological dimensioning algorithms;statistical approach;parliamentary votes;significance level;bootstrap;ideological space;ideological classifications"}
{"name": "train_1741", "title": "The top cycle and uncovered solutions for weak tournaments", "abstract": "We study axiomatic properties of the top cycle and uncovered solutions for weak tournaments. Subsequently, we establish its connection with the rational choice theory", "fulltext": "", "keywords": "rational choice theory;weak tournaments;uncovered solutions;axiomatic properties;top cycle"}
{"name": "train_1742", "title": "A sufficient condition for optimality in nondifferentiable invex programming", "abstract": "A sufficient optimality condition is established for a nonlinear programming problem without differentiability assumption on the data wherein Clarke's (1975) generalized gradient is used to define invexity", "fulltext": "", "keywords": "locally lipschitz function;generalized gradient;invexity;semiconvex function;sufficient optimality condition;nondifferentiable invex programming;nonlinear programming problem"}
{"name": "train_1743", "title": "Adaptive stabilization of undamped flexible structures", "abstract": "In the paper non-identifier-based adaptive stabilization of undamped flexible structures is considered in the case of collocated input and output operators. The systems have poles and zeros on the imaginary axis. In the case where velocity feedback is available, the adaptive stabilizer is constructed by an adaptive PD-controller (proportional plus derivative controller). In the case where only position feedback is available, the adaptive stabilizer is constructed by an adaptive P-controller for the augmented system which consists of the controlled system and a parallel compensator. Numerical examples are given to illustrate the effectiveness of the proposed controllers", "fulltext": "", "keywords": "position feedback;poles and zeros;adaptive stabilization;velocity feedback;adaptive p-controller;proportional plus derivative controller;parallel compensator;undamped flexible structures;adaptive pd-controller;augmented system;imaginary axis"}
{"name": "train_1744", "title": "Convergence of Toland's critical points for sequences of DC functions and", "abstract": "application to the resolution of semilinear elliptic problems We prove that if a sequence (f/sub n/)/sub n/ of DC functions (difference of two convex functions) converges to a DC function f in some appropriate way and if u/sub n/ is a critical point of f/sub n/, in the sense described by Toland (1978, 1979), and is such that (u/sub n/)/sub n/ converges to u, then u is a critical point of f, still in Toland's sense. We also build a new algorithm which searches for this critical point u and then apply it in order to compute the solution of a semilinear elliptic equation", "fulltext": "", "keywords": "semilinear elliptic problems;convex function difference;semilinear elliptic equation;dc function sequences;critical point convergence"}
{"name": "train_1745", "title": "Approximate relaxed descent method for optimal control problems", "abstract": "We consider an optimal control problem for systems governed by ordinary differential equations with control constraints. Since no convexity assumptions are made on the data, the problem is reformulated in relaxed form. The relaxed state equation is discretized by the implicit trapezoidal scheme and the relaxed controls are approximated by piecewise constant relaxed controls. We then propose a combined descent and discretization method that generates sequences of discrete relaxed controls and progressively refines the discretization. Since here the adjoint of the discrete state equation is not defined, we use, at each iteration, an approximate derivative of the cost functional defined by discretizing the continuous adjoint equation and the integral involved by appropriate trapezoidal schemes. It is proved that accumulation points of sequences constructed by this method satisfy the strong relaxed necessary conditions for optimality for the continuous problem. Finally, the computed relaxed controls can be easily approximated by piecewise constant classical controls", "fulltext": "", "keywords": "trapezoidal schemes;discretization refinement;relaxed state equation discretization;approximate relaxed descent method;cost functional approximate derivative;optimal control problems;ordinary differential equations;relaxed control approximation;implicit trapezoidal scheme;discrete relaxed control sequences;piecewise constant relaxed controls;discrete state equation"}
{"name": "train_1746", "title": "The exact solution of coupled thermoelectroelastic behavior of piezoelectric", "abstract": "laminates Exact solutions for static analysis of thermoelectroelastic laminated plates are presented. In this analysis, a new concise procedure for the analytical solution of composite laminated plates with piezoelectric layers is developed. A simple eigenvalue formula in real number form is directly developed from the basic coupled piezoelectric differential equations and the difficulty of treating imaginary eigenvalues is avoided. The solution is defined in the trigonometric series and can be applied to thin and thick plates. Numerical studies are conducted on a five-layer piezoelectric plate and the complexity of stresses and deformations under combined loading is illustrated. The results could be used as a benchmark for assessing any numerical solution by approximate approaches such as the finite element method while also providing useful physical insight into the behavior of piezoelectric plates in a thermal environment", "fulltext": "", "keywords": "analytical solution;coupled thermoelectroelastic behavior;stresses;five-layer piezoelectric plate;thermal environment;coupled piezoelectric differential equations;eigenvalue formula;thick plates;piezoelectric laminates;finite element method;piezoelectric layers;exact solution;deformations;thin plates;numerical study;composite laminated plates;real number form;trigonometric series;combined loading;thermoelectroelastic laminated plates"}
{"name": "train_1747", "title": "On a general constitutive description for the inelastic and failure behavior of", "abstract": "fibrous laminates. II. Laminate theory and applications For pt. I see ibid., pp. 1159-76. The two papers report systematically a constitutive description for the inelastic and strength behavior of laminated composites reinforced with various fiber preforms. The constitutive relationship is established micromechanically, through layer-by-layer analysis. Namely, only the properties of the constituent fiber and matrix materials of the composites are required as input data. In the previous part lamina theory was presented. Three fundamental quantities of the laminae, i.e. the internal stresses generated in the constituent fiber and matrix materials and the instantaneous compliance matrix, with different fiber preform (including woven, braided, and knitted fabric) reinforcements were explicitly obtained by virtue of the bridging micromechanics model. In this paper, the laminate stress analysis is shown. The purpose of this analysis is to determine the load shared by each lamina in the laminate, so that the lamina theory can be applied. Incorporation of the constitutive equations into an FEM software package is illustrated. A number of application examples are given to demonstrate the efficiency of the constitutive theory. The predictions made include: failure envelopes of multidirectional laminates subjected to biaxial in-plane loads, thermomechanical cycling stress-strain curves of a titanium metal matrix composite laminate, S-N curves of multilayer knitted fabric reinforced laminates under tensile fatigue, and bending load-deflection plots and ultimate bending strengths of laminated braided fabric reinforced beams subjected to lateral loads", "fulltext": "", "keywords": "s-n curves;multilayer knitted fabric reinforced laminates;thermomechanical cycling stress-strain curves;inelastic behavior;matrix materials;fibrous laminates;layer-by-layer analysis;strength behavior;composites;laminate theory;load;stress analysis;multidirectional laminates;internal stresses;fem software package;micromechanics;failure behavior;ultimate bending strengths;bending load deflection plots;titanium metal matrix composite laminate;fiber preforms;laminated braided fabric reinforced beams;instantaneous compliance matrix;tensile fatigue;lateral loads;general constitutive description;failure envelopes;biaxial in-plane loads"}
{"name": "train_1748", "title": "On a general constitutive description for the inelastic and failure behavior of", "abstract": "fibrous laminates. I. Lamina theory It is well known that a structural design with isotropic materials can only be accomplished based on a stress failure criterion. This is, however, generally not true with laminated composites. Only when the laminate is subjected to an in-plane load, can the ultimate failure of the laminate correspond to its last-ply failure, and hence a stress failure criterion may be sufficient to detect the maximum load that can be sustained by the laminate. Even in such a case, the load shared by each lamina in the laminate cannot be correctly determined if the lamina instantaneous stiffness matrix is inaccurately provided, since the lamina is always statically indeterminate in the laminate. If, however, the laminate is subjected to a lateral load, its ultimate failure occurs before last-ply failure and use of the stress failure criterion is no longer sufficient; an additional critical deflection or curvature condition must also be employed. This necessitates development of an efficient constitutive relationship for laminated composites in order that the laminate strains/deflections up to ultimate failure can be accurately calculated. A general constitutive description for the thermomechanical response of a fibrous laminate up to ultimate failure with applications to various fibrous laminates is presented in the two papers. The constitutive relationship is obtained by combining classical lamination theory with a recently developed bridging micromechanics model, through a layer-by-layer analysis. This paper focuses on lamina analysis", "fulltext": "", "keywords": "micromechanics model;stress failure criterion;laminate deflections;critical deflection condition;inelastic behavior;thermomechanical response;woven fabric composites;lamina theory;fibrous laminates;layer-by-layer analysis;last-ply failure;isotropic materials;multidirectional tape laminae;composites;braided fabric composites;laminate strains;failure behavior;elastoplasticity;in-plane load;structural design;lateral load;critical curvature condition;elastic-viscoplasticity;knitted fabric reinforced composites;instantaneous stiffness matrix;general constitutive description"}
{"name": "train_1749", "title": "Advanced aerostatic stability analysis of cable-stayed bridges using", "abstract": "finite-element method Based on the concept of limit point instability, an advanced nonlinear finite-element method that can be used to analyze the aerostatic stability of cable-stayed bridges is proposed. Both geometric nonlinearity and three components of wind loads are considered in this method. The example bridge is the second Santou Bay cable-stayed bridge with a main span length of 518 m built in China. Aerostatic stability of the example bridge is investigated using linear and proposed methods. The effect of pitch moment coefficient on the aerostatic stability of the bridge has been studied. The results show that the aerostatic instability analyses of cable-stayed bridges based on the linear method considerably overestimate the wind-resisting capacity of cable-stayed bridges. The proposed method is highly accurate and efficient. Pitch moment coefficient has a major effect on the aerostatic stability of cable-stayed bridges. Finally, the aerostatic failure mechanism of cable-stayed bridges is explained by tracing the aerostatic instability path", "fulltext": "", "keywords": "advanced nonlinear finite element method;aerostatic failure mechanism;china;cable-stayed bridges;limit point instability;pitch moment coefficient;wind loads;santou bay cable-stayed bridge;geometric nonlinearity;advanced aerostatic stability analysis"}
{"name": "train_175", "title": "Diagnostic expert system using non-monotonic reasoning", "abstract": "The objective of this work is to develop an expert system for cucumber disorder diagnosis using non-monotonic reasoning to handle the situation when the system cannot reach a conclusion. One reason for this situation is when the information is incomplete. Another reason is when the domain knowledge itself is incomplete. Another reason is when the information is inconsistent. This method maintains the truth of the system in case of changing a piece of information. The proposed method uses two types of non-monotonic reasoning namely: default reasoning and reasoning in the presence of inconsistent information to achieve its goal", "fulltext": "", "keywords": "default reasoning;inconsistent information;cucumber disorder diagnosis;diagnostic expert system;agriculture;incomplete information;truth maintenance;nonmonotonic reasoning"}
{"name": "train_1750", "title": "A dynamic method for weighted linear least squares problems", "abstract": "A new method for solving the weighted linear least squares problems with full rank is proposed. Based on the theory of Liapunov's stability, the method associates a dynamic system with a weighted linear least squares problem, whose solution we are interested in and integrates the former numerically by an A-stable numerical method. The numerical tests suggest that the new method is more than comparative with current conventional techniques based on the normal equations", "fulltext": "", "keywords": "weighted linear least squares problems;dynamic method;a-stable numerical method;lyapunov stability"}
{"name": "train_1751", "title": "An adaptive time step procedure for a parabolic problem with blow-up", "abstract": "In this paper we introduce and analyze a fully discrete approximation for a parabolic problem with a nonlinear boundary condition which implies that the solutions blow up in finite time. We use standard linear elements with mass lumping for the space variable. For the time discretization we write the problem in an equivalent form which is obtained by introducing an appropriate time re-scaling and then, we use explicit Runge-Kutta methods for this equivalent problem. In order to motivate our procedure we present it first in the case of a simple ordinary differential equation and show how the blow up time is approximated in this case. We obtain necessary and sufficient conditions for the blowup of the numerical solution and prove that the numerical blow-up time converges to the continuous one. We also study, for the explicit Euler approximation, the localization of blow-up points for the numerical scheme", "fulltext": "", "keywords": "parabolic problem;adaptive time step procedure;runge-kutta methods;explicit euler approximation;nonlinear boundary condition;fully discrete approximation;standard linear elements"}
{"name": "train_1752", "title": "Non-nested multi-level solvers for finite element discretisations of mixed", "abstract": "problems We consider a general framework for analysing the convergence of multi-grid solvers applied to finite element discretisations of mixed problems, both of conforming and nonconforming type. As a basic new feature. our approach allows to use different finite element discretisations on each level of the multi-grid hierarchy. Thus, in our multi-level approach, accurate higher order finite element discretisations can be combined with fast multi-level solvers based on lower order (nonconforming) finite element discretisations. This leads to the design of efficient multi-level solvers for higher order finite element discretisations", "fulltext": "", "keywords": "higher order finite element discretisations;non-nested multi-level solvers;multi-level solvers;multi-grid solvers;finite element discretisations;mixed problems"}
{"name": "train_1753", "title": "Risk theory with a nonlinear dividend barrier", "abstract": "In the framework of classical risk theory we investigate a surplus process in the presence of a nonlinear dividend barrier and derive equations for two characteristics of such a process, the probability of survival and the expected sum of discounted dividend payments. Number-theoretic solution techniques are developed for approximating these quantities and numerical illustrations are given for exponential claim sizes and a parabolic dividend barrier", "fulltext": "", "keywords": "number-theoretic solution;parabolic dividend barrier;risk theory;discounted dividend payments;exponential claim sizes;numerical illustrations;probability of survival;surplus process;nonlinear dividend barrier"}
{"name": "train_1754", "title": "Coordination [crisis management]", "abstract": "Communications during a crisis, both internal and external, set the tone during response and carry a message through recovery. The authors describe how to set up a system for information coordination to make sure the right people get the right message, and the organization stays in control", "fulltext": "", "keywords": "information coordination;crisis management;communications process"}
{"name": "train_1755", "title": "Theta functions with harmonic coefficients over number fields", "abstract": "We investigate theta functions attached to quadratic forms over a number field K. We establish a functional equation by regarding the theta functions as specializations of symplectic theta functions. By applying a differential operator to the functional equation, we show how theta functions with harmonic coefficients over K behave under modular transformations", "fulltext": "", "keywords": "quadratic forms;differential operator;harmonic coefficients;symplectic theta functions;modular transformations;number fields;functional equation"}
{"name": "train_1756", "title": "On the diophantine equation x/sup 2/+q/sup 2k+1/=y/sup n/", "abstract": "In this paper it has been proved that if q is an odd prime, q not=7 (mod 8), n is an odd integer >or=5, n is not a multiple of 3 and (h, n)=1, where h is the class number of the filed Q( square root (-q)), then the diophantine equation x/sup 2/+q/sup 2k+1/=y/sup n/ has exactly two families of solutions (q, n, k, x, y)", "fulltext": "", "keywords": "primitive divisors;odd prime;odd integer;diophantine equation;lucas sequence"}
{"name": "train_1757", "title": "Even unimodular Gaussian lattices of rank 12", "abstract": "We classify even unimodular Gaussian lattices of rank 12, that is, even unimodular integral lattices of rank 12 over the ring of Gaussian integers. This is equivalent to the classification of the automorphisms tau with tau /sup 2/=-1 in the automorphism groups of all the Niemeier lattices, which are even unimodular (real) integral lattices of rank 24. There are 28 even unimodular Gaussian lattices of rank 12 up to equivalence", "fulltext": "", "keywords": "even unimodular integral lattices;automorphisms;gaussian integers;niemeier lattices;even unimodular gaussian lattices"}
{"name": "train_1758", "title": "Hilbert modular threefolds of arithmetic genus one", "abstract": "D. Weisser (1981) proved that there are exactly four Galois cubic number fields with Hilbert modular threefolds of arithmetic genus one. In this paper, we extend Weisser's work to cover all cubic number fields. Our main result is that there are exactly 33 fields with Hilbert modular threefolds of arithmetic genus one. These fields are enumerated explicitly", "fulltext": "", "keywords": "galois cubic number fields;arithmetic genus one;hilbert modular threefolds"}
{"name": "train_1759", "title": "On the p-adic Birch, Swinnerton-Dyer Conjecture for non-semistable reduction", "abstract": "In this paper, we examine the Iwasawa theory of elliptic curves E with additive reduction at an odd prime p. By extending Perrin-Riou's theory to certain nonsemistable representations, we are able to convert Kato's zeta-elements into p-adic L-functions. This allows us to deduce the cotorsion of the Selmer group over the cyclotomic Z/sub p/-extension of Q, and thus prove an inequality in the p-adic Birch and Swinnerton-Dyer conjecture at primes p whose square divides the conductor of E", "fulltext": "", "keywords": "lwasawa theory;elliptic curves;additive reduction;perrin-riou's theory;p-adic birch;p-adic l-functions;nonsemistable reduction;cotorsion;selmer group;swinnerton-dyer conjecture;cyclotomic z/sub p/-extension"}
{"name": "train_176", "title": "Knowledge model reuse: therapy decision through specialisation of a generic", "abstract": "decision model We present the definition of the therapy decision task and its associated Heuristic Multi-Attribute (HM) solving method, in the form of a KADS-style specification. The goal of the therapy decision task is to identify the ideal therapy, for a given patient, in accordance with a set of objectives of a diverse nature constituting a global therapy-evaluation framework in which considerations such as patient preferences and quality-of-life results are integrated. We give a high-level overview of this task as a specialisation of the generic decision task, and additional decomposition methods for the subtasks involved. These subtasks possess some reflective capabilities for reasoning about self-models, particularly the learning subtask, which incrementally corrects and refines the model used to assess the effects of the therapies. This work illustrates the process of reuse in the framework of AI software development methodologies such as KADS-CommonKADS in order to obtain new (more specialised but still generic) components for the analysis libraries developed in this context. In order to maximise reuse benefits, where possible, the therapy decision task and HM method have been defined in terms of regular components from the earlier-mentioned libraries. To emphasise the importance of using a rigorous approach to the modelling of domain and method ontologies, we make extensive use of the semi-formal object-oriented analysis notation UML, together with its associated constraint language OCL, to illustrate the ontology of the decision method and the corresponding specific one of the therapy decision domain, the latter being a refinement via inheritance of the former", "fulltext": "", "keywords": "kads-style specification;generic decision model specialisation;global therapy-evaluation framework;heuristic multi-attribute solving method;therapy decision task;uml;reasoning;software development methodologies;commonkads;knowledge model reuse;constraint language;ontologies;patient preferences;object-oriented analysis notation;learning subtask;ocl"}
{"name": "train_1760", "title": "Dihedral congruence primes and class fields of real quadratic fields", "abstract": "We show that for a real quadratic field F the dihedral congruence primes with respect to F for cusp forms of weight k and quadratic nebentypus are essentially the primes dividing expressions of the form epsilon /sub +//sup k-1/+or-1 where epsilon /sub +/ is a totally positive fundamental unit of F. This extends work of Hida. Our results allow us to identify a family of (ray) class fields of F which are generated by torsion points on modular abelian varieties", "fulltext": "", "keywords": "class field theory;quadratic nebentypus;dihedral congruence primes;class fields;real quadratic fields;torsion points;modular abelian varieties"}
{"name": "train_1761", "title": "Superconvergence of discontinuous Galerkin method for nonstationary hyperbolic", "abstract": "equation For the first order nonstationary hyperbolic equation taking the piecewise linear discontinuous Galerkin solver, we prove that under the uniform rectangular partition, such a discontinuous solver, after postprocessing, can have two and half approximative order which is half order higher than the optimal estimate by P. Lesaint and P. Raviart (1974) under the rectangular partition", "fulltext": "", "keywords": "rectangular partition;piecewise linear discontinuous galerkin solver;nonstationary hyperbolic equation;approximative order;superconvergence of discontinuous galerkin method"}
{"name": "train_1762", "title": "Laguerre pseudospectral method for nonlinear partial differential equations", "abstract": "The Laguerre Gauss-Radau interpolation is investigated. Some approximation results are obtained. As an example, the Laguerre pseudospectral scheme is constructed for the BBM equation. The stability and the convergence of proposed scheme are proved. The numerical results show the high accuracy of this approach", "fulltext": "", "keywords": "approximation results;nonlinear partial differential equations;nonlinear differential equations;numerical results;laguerre pseudospectral method;stability;laguerre gauss-radau interpolation;bbm equation"}
{"name": "train_1763", "title": "Numerical studies of 2D free surface waves with fixed bottom", "abstract": "The motion of surface waves under the effect of bottom is a very interesting and challenging phenomenon in the nature. we use boundary integral method to compute and analyze this problem. In the linear analysis, the linearized equations have bounded error increase under some compatible conditions. This contributes to the cancellation of instable Kelvin-Helmholtz terms. Under the effect of bottom, the existence of equations is hard to determine, but given some limitations it proves true. These limitations are that the swing of interfaces should be small enough, and the distance between surface and bottom should be large enough. In order to maintain the stability of computation, some compatible relationship must be satisfied. In the numerical examples, the simulation of standing waves and breaking waves are calculated. And in the case of shallow bottom, we found that the behavior of waves are rather singular", "fulltext": "", "keywords": "numerical studies;linear analysis;boundary integral method;linearized equations;instable kelvin-helmholtz terms;2d free surface waves"}
{"name": "train_1764", "title": "Two-scale curved element method for elliptic problems with small periodic", "abstract": "coefficients This paper is concerned with the second order elliptic problems with small periodic coefficients on a bounded domain with a curved boundary. A two-scale curved element method which couples linear elements and isoparametric elements is proposed. The error estimate is obtained over the given smooth domain. Furthermore an additive Schwarz method is provided for the isoparametric element method", "fulltext": "", "keywords": "two-scale curved element method;error estimate;linear elements;curved boundary;small periodic coefficients;additive schwarz method;bounded domain;second order elliptic problems;isoparametric element method;isoparametric elements;elliptic problems"}
{"name": "train_1765", "title": "On bandlimited scaling function", "abstract": "This paper discusses band-limited scaling function, especially the single interval band case and three interval band cases. Their relationship to oversampling property and weakly translation invariance are also studied. At the end, we propose an open problem", "fulltext": "", "keywords": "weakly translation invariance;oversampling property;interval band case;bandlimited scaling function"}
{"name": "train_1766", "title": "A note on vector cascade algorithm", "abstract": "The focus of this paper is on the relationship between accuracy of multivariate refinable vector and vector cascade algorithm. We show that, if the vector cascade algorithm (1.5) with isotropic dilation converges to a vector-valued function with regularity, then the initial function must satisfy the Strang-Fix conditions", "fulltext": "", "keywords": "strang-fix conditions;multivariate refinable vector;vector cascade algorithm;isotropic dilation;vector-valued function;matrix algebra"}
{"name": "train_1767", "title": "Bivariate fractal interpolation functions on rectangular domains", "abstract": "Non-tensor product bivariate fractal interpolation functions defined on gridded rectangular domains are constructed. Linear spaces consisting of these functions are introduced. The relevant Lagrange interpolation problem is discussed. A negative result about the existence of affine fractal interpolation functions defined on such domains is obtained", "fulltext": "", "keywords": "linear spaces;lagrange interpolation problem;rectangular domains;affine fractal interpolation functions;gridded rectangular domains;bivariate fractal interpolation functions"}
{"name": "train_1768", "title": "Isogenous of the elliptic curves over the rationals", "abstract": "An elliptic curve is a pair (E, O), where E is a smooth projective curve of genus 1 and O is a point of E, called the point at infinity. Every elliptic curve can be given by a Weierstrass equation E : y/sup 2/ + a/sub 1/xy + a/sub 3/y = x/sup 3/ + a/sub 2/x/sup 2/ + a/sub 4/x + a/sub 6/. Let Q be the set of rationals. E is said to be defined over Q if the coefficients a/sub i/, i = 1, 2, 3, 4, 6 are rationals and O is defined over Q. Let E/Q be an elliptic curve and let E(Q)/sub tors/ be the torsion group of points of E defined over Q. The theorem of Mazur asserts that E(Q)/sub tors/ is one of the following 15 groups E(Q)/sub tors/ {Z/mZ, Z/mZ * Z/2mZ, m, = 1, 2, ..., 10, 12, m = 1, 2, 3, 4. We say that an elliptic curve E'/Q is isogenous to the elliptic curve E if there is an isogeny, i.e. a morphism phi : E to E' such that phi (O) = O, where O is the point at infinity. We give an explicit model of all elliptic curves for which E(Q)/sub tors/ is in the form Z/mZ where m = 9,10,12 or Z/2Z * Z/2mZ where m = 4, according to Mazur's theorem. Moreover, for every family of such elliptic curves, we give an explicit model of all their isogenous curves with cyclic kernels consisting of rational points", "fulltext": "", "keywords": "smooth projective curve;mazur's theorem;elliptic curves isogenous;explicit model;rationals;weierstrass equation;cyclic kernels"}
{"name": "train_1769", "title": "Transformation rules and strategies for functional-logic programs", "abstract": "This paper abstracts the contents of a PhD dissertation entitled 'Transformation Rules and Strategies for Functional-Logic Programs' which has been recently defended. These techniques are based on fold/unfold transformations and they can be used to optimize integrated (functional-logic) programs for a wide class of applications. Experimental results show that typical examples in the field of artificial intelligence are successfully enhanced by our transformation system SYNTH. The thesis presents the first approach of these methods for declarative languages that integrate the best features from functional and logic programming", "fulltext": "", "keywords": "experimental results;program transformation rules;declarative languages;functional programming;artificial intelligence;functional-logic programs;fold-unfold transformations;synth;logic programming"}
{"name": "train_177", "title": "Turning telecommunications call details to churn prediction: a data mining", "abstract": "approach As deregulation, new technologies, and new competitors open up the mobile telecommunications industry, churn prediction and management has become of great concern to mobile service providers. A mobile service provider wishing to retain its subscribers needs to be able to predict which of them may be at-risk of changing services and will make those subscribers the focus of customer retention efforts. In response to the limitations of existing churn-prediction systems and the unavailability of customer demographics in the mobile telecommunications provider investigated, we propose, design, and experimentally evaluate a churn-prediction technique that predicts churning from subscriber contractual information and call pattern changes extracted from call details. This proposed technique is capable of identifying potential churners at the contract level for a specific prediction time-period. In addition, the proposed technique incorporates the multi-classifier class-combiner approach to address the challenge of a highly skewed class distribution between churners and non-churners. The empirical evaluation results suggest that the proposed call-behavior-based churn-prediction technique exhibits satisfactory predictive effectiveness when more recent call details are employed for the churn prediction model construction. Furthermore, the proposed technique is able to demonstrate satisfactory or reasonable predictive power within the one-month interval between model construction and churn prediction. Using a previous demographics-based churn-prediction system as a reference, the lift factors attained by our proposed technique appear largely satisfactory", "fulltext": "", "keywords": "mobile telecommunications industry;telecommunications call details;call pattern changes;lift factors;multi-classifier class-combiner approach;skewed class distribution;decision tree induction;customer demographics;customer retention efforts;deregulation;subscriber contractual information;mobile service providers"}
{"name": "train_1770", "title": "New developments in inductive learning", "abstract": "Any intelligent system, whether natural or artificial, must have three characteristics: knowledge, reasoning, and learning. Artificial intelligence (AI) studies these three aspects in artificial systems. Briefly, we could say that knowledge refers to the system's world model, and reasoning to the manipulation of this knowledge. Learning is slightly more complex; the system interacts with the world and as a consequence it builds onto and modifies its knowledge. This process of self-building and self-modifying is known as learning. This thesis is set within the field of artificial intelligence and focuses on learning. More specifically, it deals with the inductive learning of decision trees", "fulltext": "", "keywords": "new developments;artificial intelligence;decision trees;reasoning;inductive learning;knowledge;intelligent system"}
{"name": "train_1771", "title": "Quadratic Gauss sums over finite commutative rings", "abstract": "This article explicitly determines the quadratic Gauss sum over finite commutative rings", "fulltext": "", "keywords": "quadratic gauss sum;finite commutative rings"}
{"name": "train_1772", "title": "The effects of technology on midcareer librarians", "abstract": "This article investigates technology competency requirements in the library profession. Using the position advertisements in American Libraries in five-year increments over a twenty-year period (1970-1990), the article examines and evaluates the advertised qualifications of positions and attempts to see if midcareer librarians-especially those who have achieved their degree prior to the change in MLS curriculum that currently emphasizes technology-are \"effective\" librarians in the present and future job market", "fulltext": "", "keywords": "job market;library profession;midcareer librarians;technology competency requirements"}
{"name": "train_1773", "title": "Happily ever after: plateauing as a means for long-term career satisfaction", "abstract": "Little did I know when I attended Judith Bardwick's presentation on plateauing at the ALA annual convention in 1988 that it would turn out to be one of the most valuable sessions I would attend at any library conference, since it has enabled me to understand the phenomenon of plateauing and to use the strategies she suggested to rejuvenate my career and personal life continually. Key concepts and solutions from her book and from other literature on plateauing are summarized and examples given as to how I incorporated them into my life", "fulltext": "", "keywords": "long-term career satisfaction;librarians;personal life;plateauing"}
{"name": "train_1774", "title": "A work journal [librarianship]", "abstract": "Keeping a work journal can be useful in exploring one's thoughts and feelings about work challenges and work decisions. It can help bring about greater fulfillment in one's work life by facilitating self-renewal, change, the search for new meaning, and job satisfaction. One example of a work journal which I kept in 1998 is considered. It touches on several issues of potential interest to midlife career librarians including the challenge of technology, returning to work at midlife after raising a family, further education, professional writing, and job exchange", "fulltext": "", "keywords": "change;work challenges;job satisfaction;technology;further education;self-renewal;work journal;job exchange;work decisions;professional writing;midlife career librarians"}
{"name": "train_1775", "title": "Are we there yet?: facing the never-ending speed and change of technology in", "abstract": "midlife This essay is a personal reflection on entering librarianship in middle age at a time when the profession, like society in general, is experiencing rapidly accelerating change. Much of this change is due to the increased use of computers and information technologies in the library setting. These aids in the production, collection, storage, retrieval, and dissemination of the collective information, knowledge, and sometimes wisdom of the past and the contemporary world can exhilarate or burden depending on one's worldview, the organization, and the flexibility of the workplace. This writer finds herself working in a library where everyone is expected continually to explore and use new ways of working and providing library service to a campus and a wider community. No time is spent in reflecting on what was, but all efforts are to anticipate and prepare for what will be", "fulltext": "", "keywords": "dissemination;middle age;changing technology;collection;storage;computers;information technologies;librarianship;retrieval"}
{"name": "train_1776", "title": "Job rotation in an academic library: damned if you do and damned if you don't!", "abstract": "This article considers job rotation-the systematic movement of employees from one job to another-as one of the many tools within the organizational development tool kit. There is a brief consideration of useful print and Internet literature on the subject as well as a discussion of the pros and cons of job rotation. The application of job rotation methods in Ryerson University Library, a small academic library, concludes the article in order to illustrate process and insights through example", "fulltext": "", "keywords": "ryerson university library;organizational development;systematic employee movement;job rotation;academic library"}
{"name": "train_1777", "title": "Midlife career choices: how are they different from other career choices?", "abstract": "It was 1963 when Candy Start began working in libraries. Libraries seemed to be a refuge from change, a dependable environment devoted primarily to preservation. She was mistaken. Technological changes in every decade of her experience have affected how and where she used her MLS. Far from a static refuge, libraries have proven to be spaceships loaded with precious cargo hurtling into the unknown. The historian in the author says that perhaps libraries have always been like this. This paper looks at a midlife decision point and the choice that this librarian made to move from a point of lessening productivity and interest to one of increasing challenge and contribution. It is a personal narrative of midlife experience from one librarian's point of view. Since writing this article, Candy's career has followed more changes. After selling the WINGS TM system, she has taken her experiences and vision to another library vendor, Gaylord Information Systems, where she serves as a senior product strategist", "fulltext": "", "keywords": "productivity;technological changes;midlife career choices;libraries"}
{"name": "train_1778", "title": "HeLIN pilot mentoring scheme", "abstract": "The health care libraries unit coordinates, facilitates, and promotes continuing personal development for all staff in the Health Libraries and Information Network (HeLIN) of the Oxford Deanery (UK). It supports the development of a culture of lifelong learning and recognizes that CPD should help deliver organizational objectives, as well as enabling all staff to expand and fulfill their potential. A major emphasis for 2000 was to investigate ways of improving support for individual learning within the workplace. The group identified a need to build on existing informal support networks in order to provide additional learning opportunities and decided to investigate the feasibility of piloting a mentoring scheme. The objectives of the pilot were to increase understanding and knowledge of mentoring as a tool for CPD; to investigate existing mentoring schemes and their applicability for HeLIN; to develop a pilot mentoring scheme for HeLIN incorporating a program for accreditation of mentors; and to evaluate the scheme and disseminate the results. In order to identify current practice in this area, a literature review was carried out, and colleagues with an interest in or existing knowledge of mentoring schemes were contacted where possible. In the absence of clearly defined appraisal tools, all abstracts were read, and articles that met the following criteria were obtained and distributed to the group for review", "fulltext": "", "keywords": "continuing personal development;health care libraries unit;midcareer librarians;helin pilot mentoring scheme;lifelong learning;accreditation;staff;literature review;health libraries and information network;informal support networks"}
{"name": "train_1779", "title": "Maybe it's not too late to join the circus: books for midlife career management", "abstract": "Midcareer librarians looking for career management help on the bookshelf face thousands of choices. This article reviews thirteen popular career self-help books. The reviewed books cover various aspects of career management and provide information on which might be best suited for particular goals, including career change, career tune-up, and personal and professional self-evaluation. The comments reflect issues of interest to midcareer professionals", "fulltext": "", "keywords": "career change;midlife career management;libraries;librarians;personal self-evaluation;professional self-evaluation;career self-help books"}
{"name": "train_178", "title": "A parallelized indexing method for large-scale case-based reasoning", "abstract": "Case-based reasoning (CBR) is a problem solving methodology commonly seen in artificial intelligence. It can correctly take advantage of the situations and methods in former cases to find out suitable solutions for new problems. CBR must accurately retrieve similar prior cases for getting a good performance. In the past, many researchers proposed useful technologies to handle this problem. However, the performance of retrieving similar cases may be greatly influenced by the number of cases. In this paper, the performance issue of large-scale CBR is discussed and a parallelized indexing architecture is then proposed for efficiently retrieving similar cases in large-scale CBR. Several algorithms for implementing the proposed architecture are also described. Some experiments are made and the results show the efficiency of the proposed method", "fulltext": "", "keywords": "bitwise indexing;problem solving methodology;performance;artificial intelligence;parallelized indexing method;similar prior case retrieval;large-scale case-based reasoning;experiments"}
{"name": "train_1780", "title": "Migrating to public librarianship: depart on time to ensure a smooth flight", "abstract": "Career change can be a difficult, time-consuming, and anxiety-laden process for anyone contemplating this important decision. The challenges faced by librarians considering the move from academic to public librarianship can be equally and significantly demanding. To most outsiders, at least on the surface, it may appear to be a quick and easy transition to make, but some professional librarians recognize the distinct differences between these areas of librarianship. Although the ubiquitous nature of technology has brought the various work responsibilities of academic and public librarians closer together during the last decade, there remain key differences in job-related duties and the work environments. These dissimilarities pose meaningful hurdles to leap for academic librarians wishing to migrate to the public sector. The paper considers the variations between academic and public librarianship", "fulltext": "", "keywords": "public librarianship;career change;library technology;work environments;job-related duties;work responsibilities;public library;professional librarians;academic library"}
{"name": "train_1781", "title": "Making it to the major leagues: career movement between library and archival", "abstract": "professions and from small college to large university libraries Issues of career movement and change are examined between library and archival fields and from small colleges to large universities. Issues examined include professional education and training, initial career-planning and placement, continuing education, scouting and mentoring, job market conditions, work experience and personal skills, professional involvement, and professional association self-interest. This examination leads to five observations: 1. It is easier, in terms of career transitions, for a librarian to become an archivist than it is for an archivist to become a librarian; 2. The progression from a small college venue to a large research university is very manageable with the proper planning and experience; 3. At least three of the career elements-professional education, career-planning, and professional association self-interest-in their best moments provide a foundation that enables a future consideration of change between institutional types and professional areas and in their worst moments conspire against the midcareer professional in terms of change; 4. The elements of scouting, continuing education, work experience, and professional involvement offer the greatest assistance in career transitions; 5. The job market is the wildcard that either stymies or stimulates occupational development", "fulltext": "", "keywords": "job market;midcareer;continuing education;professional education;training;librarian;large university libraries;archival profession;work experience;personal skills;small college library;library profession;occupational development;career movement"}
{"name": "train_1782", "title": "Exploring the sabbatical or other leave as a means of energizing a career", "abstract": "This article challenges librarians to create leaves that will not only inspire professional growth but also renewal. It presents a framework for developing a successful leave, incorporating useful advice from librarians at Concordia University (Montreal). As food for thought, the article offers examples of specific options meant to encourage professionals to explore their own creative ideas. Finally, a central theme of this article is that a midlife leave provides one with the perfect opportunity to take stock of oneself in order to define future career directions. Midlife is a time when rebel forces, feisty protestors from within, often insist on being heard. It is a time, in other words, when professionals often long to break loose from the stress \"to do far more, in less time\" (Barner, 1994). Escaping from current job constraints into a world of creative endeavor, when well-executed, is a superb means of invigorating a career stuck in gear and discovering a fresh perspective from which to view one's profession. To ignite renewal, midcareer is the perfect time to grant one's imagination free reign", "fulltext": "", "keywords": "sabbatical leave;career;midlife leave;library staff;librarians;professional growth"}
{"name": "train_1783", "title": "Becoming a chief librarian: an analysis of transition stages in academic", "abstract": "library leadership The author explores how the four-part model of transition cycles identified by Nicholson and West (1988) applies to becoming a chief librarian of an academic library. The four stages: preparation, encounter, adjustment, and stabilization, are considered from the micro-, mezzo-, and macrolevels of the organization, as well as for their psychological and social impact on the new job incumbent. An instrument for assessment of transitional success which could be administered in the adjustment or stabilization stage is considered", "fulltext": "", "keywords": "organization;transition stages;transition cycles model;social impact;psychological impact;job;chief librarian;academic library leadership"}
{"name": "train_1784", "title": "CyberEthics bibliography 2002: a select list of recent works", "abstract": "Included in the 2002 annual bibliography update is a select list of recent books and conference proceedings that have been published since 2000. Also included is a select list of special issues of journals and periodicals that were recently published. For additional lists of recently published books and articles, see ibid. (June 2000, June 2001)", "fulltext": "", "keywords": "cyberethics bibliography;conference proceedings;special issues;2002 annual bibliography;journals;periodicals;recent books"}
{"name": "train_1785", "title": "The effect of a male-oriented computer gaming culture on careers in the", "abstract": "computer industry If careers in the computer industry were viewed, it would be evident that there is a conspicuous gender gap between the number of male and female employees. The same gap can be observed at the college level where males are dominating females as to those who pursue and obtain a degree in computer science. The question that this research paper intends to show is: why are males so dominant when it comes to computer related matters? The author has traced this question back to the computer game. Computer games are a fun medium and provide the means for an individual to become computer literate through the engagement of spatial learning and cognitive processing abilities. Since such games are marketed almost exclusively to males, females have a distinct disadvantage. Males are more computer literate through the playing of computer games, and are provided with an easy lead-in to more advanced utilization of computers such as programming. Females tend to be turned off due to the male stereotypes and marketing associated with games and thus begins the gender gap", "fulltext": "", "keywords": "cognitive processing;male stereotypes;computer science degree;computer games;spatial learning;gender gap;computer industry;marketing;careers;female employees;computer literacy"}
{"name": "train_1786", "title": "A humane tool for aiding computer science advisors, computer science students,", "abstract": "and parents Over the past few years, the computer science department faculty at Baylor has observed that some students who perform adequately during the freshman and sophomore years have substantial difficulty during the junior and senior years of study. Baylor University is an institution committed to being caring of its students. The objective for this study grew out of these two realities. There are three objectives of this research. One objective is to identify students, no later than the sophomore year, who are less likely to succeed as computer science majors. A second objective is to accomplish this identification by using data from seniors majoring in computer science. A third objective is to begin to use this information at the end of their sophomore year when meeting with a computer science faculty advisor. A regression study is conducted on the data from all students classified as seniors, majoring in computer science in May 2001, showing grades in six freshman and sophomore courses, and showing grades for at least five junior or senior level computer science courses. These students and their course performance data constituted the study sample", "fulltext": "", "keywords": "computer science students;student care;course performance data;humane tool;baylor university;regression study;computer science majors;sophomore year;computer science advisors;parents"}
{"name": "train_1787", "title": "The theory of information reversal", "abstract": "The end of the industrial age coincides with the advent of the information society as the next model of social and economic organization, which brings about significant changes in the way modern man conceives work and the social environment. The functional basis of the new model is pivoted upon the effort to formulate the theory on the violent reversal of the basic relationship between man and information, and isolate it as one of the components for the creation of the new electronic reality. The objective of the theory of reversal is to effectively contribute to the formulation of a new definition consideration in regards to the concept of the emerging information society. In order to empirically apply the theory of reversal, we examine a case study based on the example of the digital library", "fulltext": "", "keywords": "case study;industrial age;digital library;information society;social organization;information reversal theory;economic organization;information systems"}
{"name": "train_1788", "title": "Resolving Web user on the fly", "abstract": "Identity authentication systems and procedures are rapidly becoming central issues in the practice and study of information systems development and security. Requirements for Web transaction security (WTS) include strong authentication of a user, non-repudiation and encryption of all traffic. In this paper, we present an effective mechanism involving two different channels, which addresses the prime concerns involved in the security of electronic commerce transactions (ECT) viz. user authentication and non-repudiation. Although the product is primarily targeted to provide a fillip to transactions carried out over the Web, this product can also be effectively used for non-Internet transactions that are carried out where user authentication is required", "fulltext": "", "keywords": "nonrepudiation;information systems security;traffic;web transaction security;identity authentication systems;information systems development;encryption;electronic commerce transactions"}
{"name": "train_1789", "title": "Dousing terrorist funding: mission possible? [banks]", "abstract": "The government is tightening its grip on terrorist money flows. But as the banking industry continues to expand its Patriot Act compliance activities, it is with the realization that a great deal of work remains to be done before the American financial system can become truly airtight. Identification instruments, especially drivers licenses, represent a significant weak spot", "fulltext": "", "keywords": "patriot act;identification;terrorist funding;banking"}
{"name": "train_179", "title": "Document-based workflow modeling: a case-based reasoning approach", "abstract": "A workflow model is useful for business process analysis. A well-built workflow can help a company streamline its internal processes by reducing overhead. The results of workflow modeling need to be managed as information assets in a systematic fashion. Reusing these results is likely to enhance the quality of the modeling. Therefore, this paper proposes a document-based workflow modeling mechanism, which employs a case-based reasoning (CBR) technique for the effective reuse of design outputs. A repository is proposed to support this CBR process. A real-life case is illustrated to demonstrate the usefulness of our approach", "fulltext": "", "keywords": "information assets;design output reuse;business process analysis;company;case-based reasoning;document-based workflow modeling"}
{"name": "train_1790", "title": "Copyright of electronic publishing", "abstract": "With the spreading of the Internet and the wide use of computers, electronic publishing is becoming an indispensable measure to gain knowledge and skills. Meanwhile, copyright is facing much more infringement than ever in this electronic environment. So, it is a key factor to effectively protect copyright of electronic publishing to foster the new publication fields. The paper analyzes the importance of copyright, the main causes for copyright infringement in electronic publishing, and presents viewpoints on the definition and application of fair use of a copyrighted work and thinking of some means to combat breach of copyright", "fulltext": "", "keywords": "internet;fair use;copyright protection;copyright infringement;copyrighted work;electronic environment;electronic publishing copyright"}
{"name": "train_1791", "title": "The pedagogy of on-line learning: a report from the University of the Highlands", "abstract": "and Islands Millennium Institute Authoritative sources concerned with computer-aided learning, resource-based learning and on-line learning and teaching are generally agreed that, in addition to subject matter expertise and technical support, the quality of the learning materials and the learning experiences of students are critically dependent on the application of pedagogically sound theories of learning and teaching and principles of course design. The University of the Highlands and Islands Project (UHIMI) is developing \"on-line learning\" on a large scale. These developments have been accompanied by a comprehensive programme of staff development. A major emphasis of the programme is concerned with ensuring that course developers and tutors are pedagogically aware. This paper reviews (i) what is meant by \"on-line learning\" in the UHIMI context (ii) the theories of learning and teaching and principles of course design that inform the staff development programme and (iii) a review of progress to date", "fulltext": "", "keywords": "internet;staff development;computer-aided learning;university of the highlands and islands project;distance education;technical support;online learning;pedagogy;resource-based learning;educational course design;teaching"}
{"name": "train_1792", "title": "Database technology in digital libraries", "abstract": "Database technology advancements have provided many opportunities for libraries. These advancements can bring the world closer together through information accessibility. Digital library projects have been established worldwide to, ultimately, fulfil the needs of end users through more efficiency and convenience. Resource sharing will continue to be the trend for libraries. Changes often create issues which need to be addressed. Issues relating to database technology and digital libraries are reviewed. Some of the major challenges in digital libraries and managerial issues are identified as well", "fulltext": "", "keywords": "information accessibility;resource sharing;database technology;managerial issues;digital library projects;interoperability;metadata;digital libraries;data quality;user interface;end users;query processing"}
{"name": "train_1793", "title": "The paradigm of viral communication", "abstract": "The IIW Institute of Information Management (www.IIW.de) is dealing with commercial applications of digital technologies, such as the Internet, digital printing, and many more. A study which has been carried out by the institute, identifies viral messages as a new paradigm of communication, mostly found in the area of Direct Marketing, and - who wonders - mainly within the USA. Viral messages underlie certain principles: (1) prospects and customers of the idea are offered a technology platform providing a possibility to send a message to a majority of persons; (2) there is an emotional or pecuniary incentive to participate. Ideally, niches of needs and market vacua are filled with funny ideas; (3) also, the recipients are facing emotional or pecuniary incentives to contact a majority of further recipients - this induces a snowball effect and the message is spread virally; and (4) the customer is activated as an \"ambassador\" of the piece of information, for instance promoting a product or a company. It is evident that there has been a long lasting history of what we call \"word-of-mouth\" ever since, however bundles of digital technologies empower the viral communication paradigm", "fulltext": "", "keywords": "internet;commercial applications;viral messages;computer virus;direct marketing;e-mails;business;viral communication paradigm"}
{"name": "train_1794", "title": "Well-posed anisotropic diffusion for image denoising", "abstract": "A nonlinear iterative smoothing filter based on a second-order partial differential equation is introduced. It smooths out the image according to an anisotropic diffusion process. The approach is based on a smooth approximation of the total variation (TV) functional which overcomes the non-differentiability of the TV functional at the origin. In particular, the authors perform linear smoothing over smooth areas but selective smoothing over candidate edges. By relating the smoothing parameter to the time step, they arrive at a CFL condition which guarantees the causality of the discrete scheme. This allows the adoption of higher time discretisation steps, while ensuring the absence of artefacts deriving from the non-smooth behaviour of the TV functional at the origin. In particular, it is shown that the proposed approach avoids the typical staircase effects in smooth areas which occur in the standard time-marching TV scheme", "fulltext": "", "keywords": "linear smoothing;image denoising;nonlinear iterative smoothing filter;causality;image restoration problem;selective smoothing;total variation functional;higher time discretisation steps;cfl condition;well-posed anisotropic diffusion;random gaussian noise;second-order partial differential equation;discrete scheme"}
{"name": "train_1795", "title": "New voice over Internet protocol technique with hierarchical data security", "abstract": "protection The authors propose a voice over Internet protocol (VoIP) technique with a new hierarchical data security protection (HDSP) scheme. The proposed HDSP scheme can maintain the voice quality degraded from packet loss and preserve high data security. It performs both the data inter-leaving on the inter-frame of voice for achieving better error recovery of voices suffering from continuous packet loss, and the data encryption on the intra-frame of voice for achieving high data security, which are controlled by a random bit-string sequence generated from a chaotic system. To demonstrate the performance of the proposed HDSP scheme, we have successfully verified and analysed the proposed approach through software simulation and statistical measures on several test voices", "fulltext": "", "keywords": "random bit-string sequence;voip;software simulation;hdsp scheme;packet loss;voice over internet protocol;packet voice communications;chaotic system;statistical measures;hierarchical data security protection;data encryption;high data security;data interleaving"}
{"name": "train_1796", "title": "Taylor series based two-dimensional digital differentiators", "abstract": "A new type of Taylor series based 2-D finite difference approximation is presented, and it is shown that the coefficients of these approximations are not unique. Explicit formulas are presented for one of the possible sets of coefficients for an arbitrary order, by extending the previously presented 1-D approximations. These coefficients are implemented as maximally linear 2-D FIR digital differentiators, and their formulas are modified to narrow the inaccuracy regions on the resultant frequency responses, close to the Nyquist frequencies", "fulltext": "", "keywords": "frequency response;2d fir digital differentiators;2d finite difference approximation;magnitude response;fir digital filters;taylor series;maximally linear digital differentiators;nyquist frequencies;two-dimensional digital differentiators"}
{"name": "train_1797", "title": "Use of periodic and monotonic activation functions in multilayer feedforward", "abstract": "neural networks trained by extended Kalman filter algorithm The authors investigate the convergence and pruning performance of multilayer feedforward neural networks with different types of neuronal activation functions in solving various problems. Three types of activation functions are adopted in the network, namely, the traditional sigmoid function, the sinusoidal function and a periodic function that can be considered as a combination of the first two functions. To speed up the learning, as well as to reduce the network size, the extended Kalman filter (EKF) algorithm conjunct with a pruning method is used to train the network. The corresponding networks are applied to solve five typical problems, namely, 4-point XOR logic function, parity generation, handwritten digit recognition, piecewise linear function approximation and sunspot series prediction. Simulation results show that periodic activation functions perform better than monotonic ones in solving multicluster classification problems. Moreover, the combined periodic activation function is found to possess the fast convergence and multicluster classification capabilities of the sinusoidal activation function while keeping the robustness property of the sigmoid function required in the modelling of unknown systems", "fulltext": "", "keywords": "sigmoid function;handwritten digit recognition;pruning performance;ekf algorithm;sunspot series prediction;parity generation;periodic activation functions;4-point xor logic function;convergence;multilayer feedforward neural networks;neuronal activation functions;piecewise linear function approximation;sinusoidal function;multicluster classification problems;monotonic activation functions;extended kalman filter algorithm"}
{"name": "train_1798", "title": "Robustness evaluation of a minimal RBF neural network for", "abstract": "nonlinear-data-storage-channel equalisation The authors present a performance-robustness evaluation of the recently developed minimal resource allocation network (MRAN) for equalisation in highly nonlinear magnetic recording channels in disc storage systems. Unlike communication systems, equalisation of signals in these channels is a difficult problem, as they are corrupted by data-dependent noise and highly nonlinear distortions. Nair and Moon (1997) have proposed a maximum signal to distortion ratio (MSDR) equaliser for data storage channels, which uses a specially designed neural network, where all the parameters of the neural network are determined theoretically, based on the exact knowledge of the channel model parameters. In the present paper, the performance of the MSDR equaliser is compared with that of the MRAN equaliser using a magnetic recording channel model, under Conditions that include variations in partial erasure, jitter, width and noise power, as well as model mismatch. Results from the study indicate that the less complex MRAN equaliser gives consistently better performance robustness than the MSDR equaliser in terms of signal to distortion ratios (SDRs)", "fulltext": "", "keywords": "minimal resource allocation network;rbf neural network;disc storage systems;digital magnetic recording;jitter noise;nonlinear-data-storage-channel equalisation;highly nonlinear distortions;data-dependent noise;highly nonlinear magnetic recording channels;mran equaliser;msdr equaliser;robustness evaluation;maximum signal to distortion ratio equaliser"}
{"name": "train_1799", "title": "Steady-state mean-square error analysis of the cross-correlation and constant", "abstract": "modulus algorithm in a MIMO convolutive system The cross-correlation and constant modulus algorithm (CC-CMA) has been proven to be an effective approach in the problem of joint blind equalisation and source separation in a multi-input and multi-output system. In the paper, the steady-state mean-square error performance of CC-CMA in a noise-free environment is studied, and a new expression is derived based on the energy preservation approach of Mai and Sayed (2000). Simulation studies are undertaken to support the analysis", "fulltext": "", "keywords": "energy preservation approach;constant modulus algorithm;multi-input multi-output system;joint blind equalisation;cross-correlation;cc-cma;noise-free environment;mimo convolutive system;steady-state mean-square error analysis;source separation"}
{"name": "train_18", "title": "Differential and integral calculus on discrete time series data", "abstract": "It has been found that discontinuity plays a crucial role in natural evolutions (Lin 1998). In this presentation, we will generalize the idea of integration and differentiation, we developed in calculus, to the study of time series in the hope that the problem of outliers and discontinuities can be resolved more successfully than simply deleting the outliers and avoiding discontinuities from the overall data analysis. In general, appearances of outliers tend to mean existence of discontinuities, explosive growth or decline in the evolution. At the same time, our approach can be employed to partially overcome the problem of not having enough data values in any available time series. At the end, we will look at some real-life problems of prediction in order to see the power of this new approach", "fulltext": "", "keywords": "integration;time series;prediction;outliers;differentiation;natural evolutions"}
{"name": "train_180", "title": "Problems with my PDA", "abstract": "Tom Berry has lost his PDA, and now he has an even better understanding of the risks and benefits of working on the move", "fulltext": "", "keywords": "benefits;risks;pda;mobile technology"}
{"name": "train_1800", "title": "Multi-output regression using a locally regularised orthogonal least-squares", "abstract": "algorithm The paper considers data modelling using multi-output regression models. A locally regularised orthogonal least-squares (LROLS) algorithm is proposed for constructing sparse multi-output regression models that generalise well. By associating each regressor in the regression model with an individual regularisation parameter, the ability of the multi-output orthogonal least-squares (OLS) model selection to produce a parsimonious model with a good generalisation performance is greatly enhanced", "fulltext": "", "keywords": "data modelling;multi-output regression models;parsimonious model;sparse multi-output regression models;lrols algorithm;nonlinear system modelling;locally regularised orthogonal least-squares algorithm"}
{"name": "train_1801", "title": "Least load dispatching algorithm for parallel Web server nodes", "abstract": "A least load dispatching algorithm for distributing requests to parallel Web server nodes is described. In this algorithm, the load offered to a node by a request is estimated based on the expected transfer time of the corresponding reply through the Internet. This loading information is then used by the algorithm to identify the least load node of the Web site. By using this algorithm, each request will always be sent for service at the earliest possible time. Performance comparison using NASA and ClarkNet access logs between the proposed algorithm and commonly used dispatching algorithms is performed. The results show that the proposed algorithm gives 10% higher throughput than that of the commonly used random and round-robin dispatching algorithms", "fulltext": "", "keywords": "internet;parallel web server nodes;world wide web server;random dispatching algorithms;throughput;nasa access logs;round-robin dispatching algorithms;transfer time;clarknet access logs;least load dispatching algorithm"}
{"name": "train_1802", "title": "Novel TCP congestion control scheme and its performance evaluation", "abstract": "A novel self-tuning proportional and derivative (ST-PD) control based TCP congestion control scheme is proposed. The new scheme approaches the congestion control problem from a control-theoretical perspective and overcomes several Important limitations associated with existing TCP congestion control schemes, which are heuristic based. In the proposed scheme, a PD controller is employed to keep the buffer occupancy of the bottleneck node on the connection path at an ideal operating level, and it adjusts the TCP window accordingly. The control gains of the PD controller are tuned online by a fuzzy logic controller based on the perceived bandwidth-delay product of the TCP connection. This scheme gives ST-PD TCP several advantages over current TCP implementations. These include rapid response to bandwidth variations, insensitivity to buffer sizes, and significant improvement of TCP throughput over lossy links by decoupling congestion control and error control functions of TCP", "fulltext": "", "keywords": "tcp congestion control scheme;buffer occupancy;connection path;performance evaluation;lossy links;control-theoretical perspective;self-tuning proportional-derivative control;bandwidth-delay product;fuzzy logic controller;bottleneck node;pd controller"}
{"name": "train_1803", "title": "Linear complexity of polyphase power residue sequences", "abstract": "The well known family of binary Legendre or quadratic residue sequences can be generalised to the multiple-valued case by employing a polyphase representation. These p-phase sequences, with p prime, also have prime length L, and can be constructed from the index sequence of length L or, equivalently, from the cosets of pth power residues and non-residues modulo-L. The linear complexity of these polyphase sequences is derived and shown to fall into four classes depending on the value assigned to b/sub 0/, the initial digit of the sequence, and on whether p belongs to the set of pth power residues or not. The characteristic polynomials of the linear feedback shift registers that generate these sequences are also derived", "fulltext": "", "keywords": "cryptographic applications;linear complexity;linear feedback shift registers;polynomials;quadratic residue sequences;key stream ciphers;binary sequences;binary legendre sequences;multiple-valued case;p-phase sequences;polyphase power residue sequences"}
{"name": "train_1804", "title": "Module placement with boundary constraints using B*-trees", "abstract": "The module placement problem is to determine the co-ordinates of logic modules in a chip such that no two modules overlap and some cost (e.g. silicon area, interconnection length, etc.) is optimised. To shorten connections between inputs and outputs and/or make related modules adjacent, it is desired to place some modules along the specific boundaries of a chip. To deal with such boundary constraints, we explore the feasibility conditions of a B*-tree with boundary constraints and develop a simulated annealing-based algorithm using B*-trees. Unlike most previous work, the proposed algorithm guarantees a feasible B*-tree with boundary constraints for each perturbation. Experimental results show that the algorithm can obtain a smaller silicon area than the most recent work based on sequence pairs", "fulltext": "", "keywords": "boundary constraints;silicon area;logic module placement;interconnection length;b*-tree;simulated annealing algorithm"}
{"name": "train_1805", "title": "Exact analytical model for the AEP of control signals", "abstract": "An exact analytical model for the aliasing error probability (AEP) in the signature analysis of control signals using a modified signature analyser is presented. The signature analyser used comprises a general-structure two-input compacting module (TICM), which simplifies the motherboard VLSI design by providing a flexible geometry, which could be easily integrated with neighbouring structures. The use of the modified data probe eliminates the ambiguity introduced by the high-impedance state and at the same time retains the same signature of the binary stream. The model specifies algebraically the effects of the TICM architecture, the test pattern length, and the control stream error probabilities. It is proved that the (hardware) criterion used for calculating the AEP for the internal- and external exclusive-OR two-input shift registers is not valid for the general case and a new criterion is provided. The results obtained are augmented by two special cases, a case study, and associated simulation", "fulltext": "", "keywords": "control signals;signature analyser;binary stream;motherboard vlsi design;high-impedance state;flexible geometry;aep;analytical model;two-input shift registers;two-input compacting module;control stream error probabilities;test pattern length;aliasing error probability;signature analysis"}
{"name": "train_1806", "title": "Fast and efficient algorithm for the multiplierless realisation of linear DSP", "abstract": "transforms A fast algorithm having a pseudopolynomial run-time and memory requirement in the worst case is developed to generate multiplierless architectures at all wordlengths for constant multiplications in linear DSP transforms. It is also re-emphasised that indefinitely reducing operators for multiplierless architectures is not sufficient to reduce the final chip area. For a major reduction, techniques like resource folding must be used. Simple techniques for improving the results are also presented", "fulltext": "", "keywords": "resource folding;memory requirement;wordlengths;final chip area;constant multiplications;multiplierless realisation;linear dsp transforms;pseudopolynomial run-time"}
{"name": "train_1807", "title": "Regional flux target with minimum energy", "abstract": "An extension of a gradient controllability problem to the case where the target subregion is a part of the boundary of a parabolic system domain is discussed. A definition and some properties adapted to this case are presented. The focus is on the characterisation of the control achieving a regional boundary gradient target with minimum energy. An approach is developed that leads to a numerical algorithm for the computation of optimal control. Numerical illustrations show the efficiency of the approach and lead to conjectures", "fulltext": "", "keywords": "optimal control;target subregion;minimum energy;regional flux target;parabolic system domain boundary;regional boundary gradient target;numerical algorithm;gradient controllability problem"}
{"name": "train_1808", "title": "Nonlinearities in NARX polynomial models: representation and estimation", "abstract": "It is shown how nonlinearities are mapped in NARX polynomial models. General expressions are derived for the gain and eigenvalue functions in terms of the regressors and coefficients of NARX models. Such relationships are useful in grey-box identification problems. The results are illustrated using simulated and real data", "fulltext": "", "keywords": "eigenvalue functions;gain functions;regressors;nonlinearity estimation;nonlinearity representation;nonlinear autoregressive exogenous-input polynomial model;grey-box identification problems;narx polynomial model nonlinearities"}
{"name": "train_1809", "title": "Approach to adaptive neural net-based H/sub infinity / control design", "abstract": "An approach is investigated for the adaptive neural net-based H/sub infinity / control design of a class of nonlinear uncertain systems. In the proposed framework, two multilayer feedforward neural networks are constructed as an alternative to approximate the nonlinear system. The neural networks are piecewisely interpolated to generate a linear differential inclusion model by which a linear state feedback H/sub infinity / control law can be applied. An adaptive weight adjustment mechanism for the multilayer feedforward neural networks is developed to ensure H/sub infinity / regulation performance. It is shown that finding the control gain matrices can be transformed into a standard linear matrix inequality problem and solved via a developed recurrent neural network", "fulltext": "", "keywords": "recurrent neural network;linear matrix inequality problem;piecewise interpolation;multilayer feedforward neural networks;linear differential inclusion model;lmi;linear state feedback;nonlinear uncertain systems;adaptive neural net-based h/sub infinity / control design;control gain matrices"}
{"name": "train_181", "title": "Electromagnetics computations using the MPI parallel implementation of the", "abstract": "steepest descent fast multipole method (SDFMM) The computational solution of large-scale linear systems of equations necessitates the use of fast algorithms but is also greatly enhanced by employing parallelization techniques. The objective of this work is to demonstrate the speedup achieved by the MPI (message passing interface) parallel implementation of the steepest descent fast multipole method (SDFMM). Although this algorithm has already been optimized to take advantage of the structure of the physics of scattering problems, there is still the opportunity to speed up the calculation by dividing tasks into components using multiple processors and solve them in parallel. The SDFMM has three bottlenecks ordered as (1) filling the sparse impedance matrix associated with the near-field method of moments interactions (MoM), (2) the matrix vector multiplications associated with this sparse matrix and (3) the far field interactions associated with the fast multipole method. The parallel implementation task is accomplished using a thirty-one node Intel Pentium Beowulf cluster and is also validated on a 4-processor Alpha workstation. The Beowulf cluster consists of thirty-one nodes of 350 MHz Intel Pentium IIs with 256 MB of RAM and one node of a 4*450 MHz Intel Pentium II Xeon shared memory processor with 2 GB of RAM with all nodes connected to a 100 BaseTX Ethernet network. The Alpha workstation has a maximum of four 667 MHz processors. Our numerical results show significant linear speedup in filling the sparse impedance matrix. Using the 32-processors on the Beowulf cluster lead to a 7.2 overall speedup while a 2.5 overall speedup is gained using the 4-processors on the Alpha workstation", "fulltext": "", "keywords": "4-processor alpha workstation;method of moments;steepest descent fast multipole method;electromagnetics computations;scattering problems;2 gbyte;667 mhz;xeon shared memory processor;scattered magnetic field;large-scale linear systems;450 mhz;multiple processors;message passing interface;mpi parallel implementation;matrix vector multiplications;intel pentium ii;ram;intel pentium beowulf cluster;350 mhz;near-field mom;sparse impedance matrix;scattered electric field;fast algorithms;physics;100 basetx ethernet network;256 mbyte"}
{"name": "train_1810", "title": "Input-output based pole-placement controller for a class of time-delay systems", "abstract": "A controller structure valid for SISO plants involving both internal and external point delays is presented. The control signal is based only on the input and output plant signals. The controller allows finite or infinite spectrum assignment. The most important feature of the proposed controller is that it only involves the use of a class of point-delayed signals. Thus the controller synthesis involves less computational cost than former methods. Since the plant control input is generated by filtering the input and output plant signals, this controller structure is potentially applicable to the adaptive case of unknown plant parameters", "fulltext": "", "keywords": "i/o-based pole-placement controller;and external point delays;infinite spectrum assignment;finite spectrum assignment;controller synthesis;filtering;computational cost;internal point delays;siso plants;point-delayed signals;input-output based pole-placement controller;time-delay systems"}
{"name": "train_1811", "title": "Adaptive tracking controller design for robotic systems using Gaussian wavelet", "abstract": "networks An adaptive tracking control design for robotic systems using Gaussian wavelet networks is proposed. A Gaussian wavelet network with accurate approximation capability is employed to approximate the unknown dynamics of robotic systems by using an adaptive learning algorithm that can learn the parameters of the dilation and translation of Gaussian wavelet functions. Depending on the finite number of wavelet basis functions which result in inevitable approximation errors, a robust control law is provided to guarantee the stability of the closed-loop robotic system that can be proved by Lyapunov theory. Finally, the effectiveness of the Gaussian wavelet network-based control approach is illustrated through comparative simulations on a six-link robot manipulator", "fulltext": "", "keywords": "adaptive tracking controller design;approximation errors;closed-loop system;lyapunov theory;six-link robot manipulator;gaussian wavelet networks;accurate approximation capability;robotic systems;unknown dynamics;robust control law;adaptive learning algorithm"}
{"name": "train_1812", "title": "Computing the frequency response of systems affinely depending on uncertain", "abstract": "parameters The computation of the frequency response of systems depending affinely on uncertain parameters can be reduced to that of all its one-dimensional edge plants while the image of such an edge plant at a fixed frequency is an arc or a line segment in the complex plane. Based on this conclusion, four computational formulas of the maximal and minimal (maxi-mini) magnitudes and phases of an edge plant at a fixed frequency are given. The formulas, besides sharing a simpler form of expression, concretely display how the extrema of the frequency response of the edge plant relate to the typical characteristics of the arc and line segment such as the centre, radius and tangent points of the arc, the distance from the origin to the line segment etc. The direct application of the results is to compute the Bode-, Nichols- and Nyquist-plot collections of the systems which are needed in robustness analysis and design", "fulltext": "", "keywords": "line segment;frequency response;robustness analysis;nichols-plot;frequency-domain design methods;arc;robustness design;bode-plot;uncertain parameters;one-dimensional edge plants;affine systems;nyquist-plot"}
{"name": "train_1813", "title": "LMI approach to digital redesign of linear time-invariant systems", "abstract": "A simple design methodology for the digital redesign of static state feedback controllers by using linear matrix inequalities is presented. The proposed method provides close matching of the states between the original continuous-time system and those of the digitally redesigned system with a guaranteed stability. Specifically, the digital redesign problem is reformulated as linear matrix inequalities (LMIs) and solved by a numerical optimisation technique. The main feature of the proposed method is that the closed-loop stability of the digitally redesigned system is explicitly guaranteed within the design procedure using the LMI-based approach. A numerical example of the position control of a simple crane system is presented", "fulltext": "", "keywords": "guaranteed stability;design methodology;lmi approach;digital redesign;crane system;linear matrix inequalities;continuous-time system;position control;linear time-invariant systems;closed-loop stability;numerical optimisation technique"}
{"name": "train_1814", "title": "Control of integral processes with dead-time. 2. Quantitative analysis", "abstract": "For part 1, see ibid., p.285-90, (2002). Several different control schemes for integral processes with dead time resulted in the same disturbance response. It has already been shown that such a response is subideal. Hence, it is necessary to quantitatively analyse the achievable specifications and the robust stability regions. The control parameter can be quantitatively determined with a compromise between the disturbance response and the robustness. Four specifications: (normalised) maximum dynamic error, maximum decay rate, (normalised) control action bound and approximate recovery time are used to characterise the step-disturbance response. It is shown that any attempt to obtain a (normalised) dynamic error less than tau /sub m/ is impossible and a sufficient condition on the (relative) gain-uncertainty bound is square root (3)/2", "fulltext": "", "keywords": "gain-uncertainty bound;maximum dynamic error;step-disturbance response;robustness;sufficient condition;maximum decay rate;approximate recovery time;integral processes;dead-time;robust stability regions;disturbance response;control action bound;quantitative analysis"}
{"name": "train_1815", "title": "Control of integral processes with dead-time. 1. Disturbance observer-based 2", "abstract": "DOF control scheme A disturbance observer-based control scheme (a version of 2 DOF internal model control) which is very effective in controlling integral processes with dead time is presented. The controller can be designed to reject ramp disturbances as well as step disturbances and even arbitrary disturbances. When the plant model is available only two parameters are left to tune. One is the time constant of the set-point response and the other is the time constant of the disturbance response. The latter is tuned according to the compromise between disturbance response and robustness. This control scheme has a simple, clear, easy-to-design, easy-to-implement structure and good performance. It is compared to the best results (so far) using some simulation examples", "fulltext": "", "keywords": "time constant;robustness;integral processes;dead-time;disturbance response;2 dof internal model control;disturbance observer-based 2 dof control scheme;set-point response;ramp disturbances rejection"}
{"name": "train_1816", "title": "Hamiltonian modelling and nonlinear disturbance attenuation control of TCSC for", "abstract": "improving power system stability To tackle the obstacle of applying passivity-based control (PBC) to power systems, an affine non-linear system widely existing in power systems is formulated as a standard Hamiltonian system using a pre-feedback method. The port controlled Hamiltonian with dissipation (PCHD) model of a thyristor controlled serial compensator (TCSC) is then established corresponding with a revised Hamiltonian function. Furthermore, employing the modified Hamiltonian function directly as the storage function, a non-linear adaptive L/sub 2/ gain control method is proposed to solve the problem of L/sub 2/ gain disturbance attenuation for this Hamiltonian system with parametric perturbations. Finally, simulation results are presented to verify the validity of the proposed controller", "fulltext": "", "keywords": "passivity-based control;nonlinear disturbance attenuation control;power system stability;nonlinear adaptive l/sub 2/ gain control method;thyristor controlled serial compensator;hamiltonian modelling;parametric perturbations;pre-feedback method;hamiltonian function;port controlled hamiltonian with dissipation model;affine nonlinear system;storage function"}
{"name": "train_1817", "title": "Nonlinear adaptive control via sliding-mode state and perturbation observer", "abstract": "The paper presents a nonlinear adaptive controller (NAC) for single-input single-output feedback linearisable nonlinear systems. A sliding-mode state and perturbation observer is designed to estimate the system states and perturbation which includes the combined effect of system nonlinearities, uncertainties and external disturbances. The NAC design does not require the details of the nonlinear system model and full system states. It possesses an adaptation capability to deal with system parameter uncertainties, unmodelled system dynamics and external disturbances. The convergence of the observer and the stability analysis of the controller/observer system are given. The proposed control scheme is applied for control of a synchronous generator, in comparison with a state-feedback linearising controller (FLC). Simulation study is carried out based on a single-generator infinite-bus power system to show the performance of the controller/observer system", "fulltext": "", "keywords": "synchronous generator control;external disturbances;sliding-mode state observer;flc;siso feedback linearisable nonlinear systems;single-generator infinite-bus power system;convergence;perturbation observer;unmodelled system dynamics;parameter uncertainties;nac;nonlinear adaptive control;state-feedback linearising controller"}
{"name": "train_1818", "title": "Sliding-mode control scheme for a class of continuous chemical reactors", "abstract": "The synthesis of a robust control law for regulation control of a class of relative-degree-one nonlinear systems is presented. The control design is based on a sliding-mode uncertainty estimator, developed under a framework of algebraic-differential concepts. The closed-loop stability for the underlying closed-loop system is achieved via averaging techniques. Robustness of the proposed control scheme is proved in the face of noise measurements, model uncertainties and sustained disturbances. The performance of the proposed control law is illustrated with numerical simulations, comparing the proposed controller with a well tuned PI controller", "fulltext": "", "keywords": "sustained disturbances;continuous chemical reactors;closed-loop system;noise measurements;robust control law synthesis;sliding-mode uncertainty estimator;relative-degree-one nonlinear systems;averaging techniques;closed-loop stability;sliding-mode control scheme;algebraic-differential concepts;model uncertainties"}
{"name": "train_1819", "title": "Structural interpretation of matched pole-zero discretisation", "abstract": "Deals with matched pole-zero discretisation, which has been used in practice for hand calculations in the digital redesign of continuous-time systems but available only in the transfer-function form. Since this form is inconvenient for characterising the time-domain properties of sampled-data loops and for computerising the design of such systems, a state-space formulation is developed. Under the new interpretation, the matched pole-zero model is shown to be structurally identical to a hold-equivalent discrete-time model, where the generalised hold takes integral part, thus unifying the most widely used discretisation approaches. An algorithm for obtaining the generalised hold function is presented. The hold-equivalent structure of the matched pole-zero model clarifies several discrete-time system properties, such as controllability and observability, and their preservation or loss with a matched pole-zero discretisation. With the proposed formulation, the matched pole-zero, hold-equivalent, and mapping models can now all be constructed with a single schematic model", "fulltext": "", "keywords": "observability;controllability;structural interpretation;sampled-data loops;closed-loop system;state-space formulation;digital simulations;time-domain properties;continuous-time systems;hold-equivalent discrete-time model;matched pole-zero discretisation"}
{"name": "train_182", "title": "Phase transition for parking blocks, Brownian excursion and coalescence", "abstract": "In this paper, we consider hashing with linear probing for a hashing table with m places, n items (n<m), and l=m-n empty places. For a noncomputer science-minded reader, we shall use the metaphore of n cars parking on m places: each car c/sub i/ chooses a place p/sub i/ at random, and if p/sub i/ is occupied, c/sub i/ tries successively p/sub i/+1, p/sub i/+2, until it finds an empty place. Pittel [42] proves that when l/m goes to some positive limit beta <1, the size B/sub 1//sup m,l/ of the largest block of consecutive cars satisfies 2( beta -1-log beta ) B/sub 1//sup m,l/=2 log m-3 log log m+ Xi /sub m/, where Xi /sub m/ converges weakly to an extreme-value distribution. In this paper we examine at which level for n a phase transition occurs between B/sub 1//sup m,l/=o(m) and m-B/sub 1//sup m,l/=o(m). The intermediate case reveals an interesting behavior of sizes of blocks, related to the standard additive coalescent in the same way as the sizes of connected components of the random graph are related to the multiplicative coalescent", "fulltext": "", "keywords": "brownian excursion;hashing;parking blocks;linear probing;coalescence;empirical processes"}
{"name": "train_1820", "title": "Fast, accurate and stable simulation of power electronic systems using virtual", "abstract": "resistors and capacitors Simulation of power electronic circuits remains a problem due to the high level of stiffness brought about by the modelling of switches as biresistors i.e. very low turn-on resistance and very high turn-off resistance. The merits and drawbacks of two modelling methods that address this problem are discussed. A modelling solution for ensuring numerically stable, accurate and fast simulation of power electronic systems is proposed. The solution enables easy connectivity between power electronic elements in the simulation model. It involves the modelling of virtual capacitance at switching nodes to soften voltage discontinuity due to the switch current suddenly going to zero. Undesirable ringing effects that may arise due to the interaction between the virtual capacitance and circuit inductance are eliminated by modelling virtual damping resistors in parallel to inductors that are adjacent to switching elements. A midpoint configuration method is also introduced for modelling shunt capacitors. A DC traction system is simulated using this modelling strategy and the results are included. Simulation results obtained using this modelling strategy are validated by comparison with the established mesh analysis technique of modelling. The simulation performance is also compared with the Power System Blockset commercial software", "fulltext": "", "keywords": "voltage discontinuity softening;virtual resistors;ringing effects;computer simulation;turn-on resistance;switching nodes;dc traction system;high turn-off resistance;power electronic systems simulation;power system blockset software;mesh analysis technique;virtual capacitors;switch modelling"}
{"name": "train_1821", "title": "Performance, design and control of a series-parallel (CL/sup 2/-type) resonant", "abstract": "DC/DC converter The three-element resonant network has various topological alternatives, one of which, a prospective compound topology, is investigated in detail. The converter uses one capacitor (C) and two inductors (L/sup 2/), to form a compound type CL/sup 2/ network. Various advantages and limitations of the converter are detailed, and a new design procedure for such converters is also introduced. The converter may be controlled by varying the switching frequency or by pulse-width modulation. An experimental prototype has been produced and an excellent performance in the lagging power-factor mode has been confirmed", "fulltext": "", "keywords": "performance;inductors;design procedure;three-element resonant network;series-parallel resonant dc/dc power converter;lagging power factor mode;capacitor;switching frequency;pulse-width modulation"}
{"name": "train_1822", "title": "Single-phase half-bridge converter topology for power quality compensation", "abstract": "A high power factor half-bridge rectifier with neutral point switch clamped scheme is proposed. Three power switches are employed in the proposed rectifier. Two PWM control schemes are used to draw a sinusoidal line current with low current distortion. The control signals of the power switches are derived from the DC link voltage balance compensator, line current controller and DC link voltage regulator. The hysteresis current control scheme is employed to track the line current command. The proposed control scheme and the circuit configuration can be applied to the active power filter to eliminate the harmonic currents and compensate the reactive power generated from the nonlinear load. Analytical and experimental results are included to illustrate the validity and effectiveness of the proposed control scheme", "fulltext": "", "keywords": "dc link voltage regulator;sinusoidal line current;line current command tracking;harmonic currents elimination;hysteresis current control scheme;neutral point switch clamped scheme;current distortion;circuit configuration;power switches control signals;pwm control schemes;dc link voltage balance compensator;line current controller;single-phase half-bridge rectifier topology;power quality compensation"}
{"name": "train_1823", "title": "Single-phase shunt active power filter with harmonic detection", "abstract": "An advanced active power filter for the compensation of instantaneous harmonic current components in nonlinear current loads is presented. A signal processing technique using an adaptive neural network algorithm is applied for the detection of harmonic components generated by nonlinear current loads and it can efficiently determine the instantaneous harmonic components in real time. The validity of this active filtering processing system to compensate current harmonics is substantiated by simulation results", "fulltext": "", "keywords": "instantaneous harmonic current components compensation;signal processing technique;simulation;adaptive neural network algorithm;harmonic detection;instantaneous harmonic components;nonlinear current loads;single-phase shunt active power filter"}
{"name": "train_1824", "title": "Parallel operation of capacity-limited three-phase four-wire active power", "abstract": "filters Three-phase four-wire active power filters (APFs) are presented that can be paralleled to enlarge the system capacity and reliability. The APF employs the PWM four-leg voltage-source inverter. A decoupling control approach for the leg connected to the neutral line is proposed such that the switching of all legs has no interaction. Functions of the proposed APF include compensation of reactive power, harmonic current, unbalanced power and zero-sequence current of the load. The objective is to achieve unity power factor, balanced line current and zero neutral-line current. Compensation of all components is capacity-limited, co-operating with the cascaded load current sensing scheme. Multiple APFs can be paralleled to share the load power without requiring any control interconnection. In addition to providing the theoretic bases and detailed design of the APFs, two 6 kVA APFs are implemented. The effectiveness of the proposed method is validated with experimental results", "fulltext": "", "keywords": "6 kva;unbalanced power compensation;zero neutral-line current;decoupling control approach;zero-sequence load current compensation;capacity-limited three-phase four-wire active power filters;parallel operation;control design;leg switching;reactive power compensation;pwm four-leg voltage-source inverter;control performance;balanced line current;harmonic current compensation;load power sharing;unity power factor"}
{"name": "train_1825", "title": "Fuzzy logic controlled shunt active power filter for power quality improvement", "abstract": "The simulation and experimental study of a fuzzy logic controlled, three-phase shunt active power filter to improve power quality by compensating harmonics and reactive power required by a nonlinear load is presented. The advantage of fuzzy control is that it is based on a linguistic description and does not require a mathematical model of the system. The fuzzy control scheme is realised on an inexpensive dedicated micro-controller (INTEL 8031) based system. The compensation process is based on sensing line currents only, an approach different from conventional methods, which require harmonics or reactive volt-ampere requirement of the load. The performance of the fuzzy logic controller is compared with a conventional PI controller. The dynamic behavior of the fuzzy controller is found to be better than the conventional PI controller. PWM pattern generation is based on carrierless hysteresis based current control to obtain the switching signals. Various simulation and experimental results are presented under steady state and transient conditions", "fulltext": "", "keywords": "switching signals;pwm pattern generation;carrierless hysteresis based current control;micro-controller;three-phase shunt active power filter;power quality improvement;reactive power compensation;fuzzy logic control simulation;control performance;harmonics compensation;nonlinear load"}
{"name": "train_1826", "title": "Modeling shape and topology of low-resolution density maps of biological", "abstract": "macromolecules We develop an efficient way of representing the geometry and topology of volumetric datasets of biological structures from medium to low resolution, aiming at storing and querying them in a database framework. We make use of a new vector quantization algorithm to select the points within the macromolecule that best approximate the probability density function of the original volume data. Connectivity among points is obtained with the use of the alpha shapes theory. This novel data representation has a number of interesting characteristics, such as (1) it allows us to automatically segment and quantify a number of important structural features from low-resolution maps, such as cavities and channels, opening the possibility of querying large collections of maps on the basis of these quantitative structural features; (2) it provides a compact representation in terms of size; (3) it contains a subset of three-dimensional points that optimally quantify the densities of medium resolution data; and (4) a general model of the geometry and topology of the macromolecule (as opposite to a spatially unrelated bunch of voxels) is easily obtained by the use of the alpha shapes theory", "fulltext": "", "keywords": "vector quantization algorithm;probability density function;database framework;biological macromolecules;three-dimensional points;cavities;connectivity;channels;compact representation;low-resolution density maps;volumetric datasets;biological structures;general model;medium resolution data;data representation;structural features;geometry;topology;original volume data;alpha shapes theory;modeling"}
{"name": "train_1827", "title": "Gossip is synteny: Incomplete gossip and the syntenic distance between genomes", "abstract": "The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of genes within chromosomes. Computing this distance is NP-hard. In the present work, we give a tight connection between syntenic distance and the incomplete gossip problem, a novel generalization of the classical gossip problem. In this problem, there are n gossipers, each with a unique piece of initial information; they communicate by phone calls in which the two participants exchange all their information. The goal is to minimize the total number of phone calls necessary to inform each gossiper of his set of relevant gossip which he desires to learn. As an application of the connection between syntenic distance and incomplete gossip, we derive an O(2/sup O(n log n)/) algorithm to exactly compute the syntenic distance between two genomes with at most n chromosomes each. Our algorithm requires O(n/sup 2/+2/sup O(d log d)/) time when this distance is d, improving the O(n/sup 2/+2(O(d//sup 2/))) running time of the best previous exact algorithm", "fulltext": "", "keywords": "comparative genomics;running time;incomplete gossip problem;genomes;chromosomes;syntenic distance;np-hard"}
{"name": "train_1828", "title": "Exploiting structure in quantified formulas", "abstract": "We study the computational problem \"find the value of the quantified formula obtained by quantifying the variables in a sum of terms.\" The \"sum\" can be based on any commutative monoid, the \"quantifiers\" need only satisfy two simple conditions, and the variables can have any finite domain. This problem is a generalization of the problem \"given a sum-of-products of terms, find the value of the sum\" studied by R.E. Stearns and H.B. Hunt III (1996). A data structure called a \"structure tree\" is defined which displays information about \"subproblems\" that can be solved independently during the process of evaluating the formula. Some formulas have \"good\" structure trees which enable certain generic algorithms to evaluate the formulas in significantly less time than by brute force evaluation. By \"generic algorithm,\" we mean an algorithm constructed from uninterpreted function symbols, quantifier symbols, and monoid operations. The algebraic nature of the model facilitates a formal treatment of \"local reductions\" based on the \"local replacement\" of terms. Such local reductions \"preserve formula structure\" in the sense that structure trees with nice properties transform into structure trees with similar properties. These local reductions can also be used to transform hierarchical specified problems with useful structure into hierarchically specified problems having similar structure", "fulltext": "", "keywords": "satisfiability problems;data structure;generic algorithms;structure tree;quantified formulas;hierarchically specified problems;monoid operations;commutative monoid;computational complexity;dynamic programming;quantifier symbols;function symbols;constraint satisfaction problems;structure exploitation"}
{"name": "train_1829", "title": "Improved approximation of Max-Cut on graphs of bounded degree", "abstract": "Let alpha approximately=0.87856 denote the best approximation ratio currently known for the Max-Cut problem on general graphs. We consider a semidefinite relaxation of the Max-Cut problem, round it using the random hyperplane rounding technique of M.X. Goemans and D.P. Williamson (1995), and then add a local improvement step. We show that for graphs of degree at most Delta , our algorithm achieves an approximation ratio of at least alpha + epsilon , where epsilon >0 is a constant that depends only on Delta .. Using computer assisted analysis, we show that for graphs of maximal degree 3 our algorithm obtains an approximation ratio of at least 0.921, and for 3-regular graphs the approximation ratio is at least 0.924. We note that for the semidefinite relaxation of Max-Cut used by Goemans and Williamson the integrality gap is at least 1/0.885, even for 2-regular graphs", "fulltext": "", "keywords": "computer assisted analysis;bounded degree graph;2-regular graphs;best approximation ratio;approximation ratio;semidefinite relaxation;max-cut approximation"}
{"name": "train_183", "title": "Asymptotic analysis of (3, 2, 1)-Shell Sort", "abstract": "We analyze the (3, 2, 1)-Shell Sort algorithm under the usual random permutation model", "fulltext": "", "keywords": "algorithm;local limit theorem;moderate-sized lists;additive functional;asymptotic analysis;markov chain;random permutation;sorting;shell sort;poissonization"}
{"name": "train_1830", "title": "Approximation of pathwidth of outerplanar graphs", "abstract": "There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs, but the large exponent makes this algorithm impractical. In this paper, we give an algorithm that, given a biconnected outerplanar graph G, finds a path decomposition of G of pathwidth at most twice the pathwidth of G plus one. To obtain the result, several relations between the pathwidth of a biconnected outerplanar graph and its dual are established", "fulltext": "", "keywords": "path decomposition;polynomial time algorithm;outerplanar graphs;biconnected outerplanar graph;pathwidth approximation"}
{"name": "train_1831", "title": "Fast broadcasting and gossiping in radio networks", "abstract": "We establish an O(n log/sup 2/ n) upper bound on the time for deterministic distributed broadcasting in multi-hop radio networks with unknown topology. This nearly matches the known lower bound of Omega (n log n). The fastest previously known algorithm for this problem works in time O(n/sup 3/2/). Using our broadcasting algorithm, we develop an O(n/sup 3/2/ log/sup 2/ n) algorithm for gossiping in the same network model", "fulltext": "", "keywords": "fast broadcasting;upper bound;deterministic distributed broadcasting;radio networks;gossiping"}
{"name": "train_1832", "title": "A linear time algorithm for recognizing regular Boolean functions", "abstract": "A positive (or monotone) Boolean function is regular if its variables are naturally ordered, left to fight, by decreasing strength, so that shifting the nonzero component of any true vector to the left always yields another true vector. This paper considers the problem of recognizing whether a positive function f is regular, where f is given by min T(f) (the set of all minimal true vectors of f). We propose a simple linear time (i.e., O(n|min T(f)|)-time) algorithm for it. This improves upon the previous algorithm by J.S. Provan and M.O. Ball (1988) which requires O(n/sup 2/|min T(f)|) time. As a corollary, we also present an O(n(n+|min T(f)|))-time algorithm for the recognition problem of 2-monotonic functions", "fulltext": "", "keywords": "true vector;monotone boolean function;linear time algorithm;regular boolean functions;positive function;2-monotonic functions;nonzero component"}
{"name": "train_1833", "title": "British Standard 7666 as a framework for geocoding land and property", "abstract": "information the UK The article examines the role of British Standard 7666 in the development of a national framework for geocoding land and property information in the United Kingdom. The author assesses how local authorities, and other agencies concerned with property and address datasets, are coping with the introduction of British Standard 7666, and examines the prospects and limitations of this development. British Standard 7666 has four parts, comprising specifications for street gazetteer; land and property gazetteer; addresses; and public rights of way. The organisation coordinating the introduction of British Standard 7666, Improvement and Development Agency (IDeA), is also overseeing the development and maintenance of a National Land and Property Gazetteer (NLPG) based on British Standard 7666. The introduction of the new addressing standard has mainly been prompted by Britain's effort to set up a national cadastral service to replace the obsolescent property registration system currently in place", "fulltext": "", "keywords": "public rights of way;property information;local authorities;national cadastral service;land information systems;land information;street gazetteer;uk;national land and property gazetteer;addressing standard;property gazetteer;nlpg;idea;united kingdom;land gazetteer;address datasets;property datasets;improvement and development agency;addresses;national framework;geocoding;property registration system;british standard 7666"}
{"name": "train_1834", "title": "A formal model of correctness in a cadastre", "abstract": "A key issue for cadastral systems is the maintenance of their correctness. Correctness is defined to be the proper correspondence between the valid legal situation and the content of the cadastre. This correspondence is generally difficult to achieve, since the cadastre is not a complete representation of all aspects influencing the legal situation in reality. The goal of the paper is to develop a formal model comprising representations of the cadastre and of reality that allows the simulation and investigation of cases where this correspondence is potentially violated. For this purpose the model consists of two parts, the first part represents the valid legal situation and the second part represents the cadastre. This makes it feasible to mark the differences between reality and the cadastre. The marking together with the two parts of the model facilitate the discussion of issues in \"real-world\" cadastral systems where incorrectness occurs. In order to develop a formal model, the paper uses the transfer of ownership of a parcel between two persons as minimal case study. The foundation for the formalization is a modern version of the situation calculus. The focus moves from the analysis of the cadastre to the preparation of a conceptual and a formalized model and the implementation of a prototype", "fulltext": "", "keywords": "situation calculus;formalized model;formal model;minimal case study;formal correctness model;transfer of ownership;legal situation;cadastre;cadastral systems;correctness maintenance"}
{"name": "train_1835", "title": "Establishing an urban digital cadastre: analytical reconstruction of parcel", "abstract": "boundaries A new method for generating a spatially accurate, legally supportive and operationally efficient cadastral database of the urban cadastral reality is described. The definition and compilation of an accurate cadastral database (achieving a standard deviation smaller than 0.1 m) is based on an analytical reconstruction of cadastral boundaries rather than on the conventional field reconstruction process. The new method is based on GPS control points and traverse networks for providing the framework; the old field books for defining the links between the various original ground features; and a geometrical and cadastral adjustment process as the conceptual basis. A pilot project that was carried out in order to examine and evaluate the new method is described", "fulltext": "", "keywords": "land information systems;cadastral adjustment process;lis;geographic information systems;field reconstruction process;parcel boundaries;analytical reconstruction;spatially accurate cadastral database;urban digital cadastre;urban cadastral reality;old field books;standard deviation;traverse networks;gps control points;ground features"}
{"name": "train_1836", "title": "Parcel boundary identification with computer-assisted boundary overlay process", "abstract": "for Taiwan The study investigates the design of a process for parcel boundary identification with cadastral map overlay using the principle of least squares. The objective of this research is to provide an objective tool for boundary identification survey. The proposed process includes an adjustment model, a weighting scheme, and other related operations. A numerical example is included", "fulltext": "", "keywords": "weighted least squares adjustment;objective tool;boundary identification survey;gauss-marker model;cadastral map overlay;taiwan;computer assisted boundary overlay process;parcel boundary identification;adjustment model;weighting scheme;geographic information system"}
{"name": "train_1837", "title": "A review of methodologies used in research on cadastral development", "abstract": "World-wide, much attention has been given to cadastral development. As a consequence of experiences made during recent decades, several authors have stated the need for research in the domain of cadastre and proposed methodologies to be used. The paper contributes to the acceptance of research methodologies needed for cadastral development, and thereby enhances theory in the cadastral domain. The paper reviews nine publications on cadastre and identifies the methodologies used. The review focuses on the institutional, social, political and economic aspects of cadastral development, rather than on the technical aspects. The main conclusion is that the methodologies used are largely those of the social sciences. That agrees with the notion that cadastre relates as much to people and institutions, as it relates to land, and that cadastral systems are shaped by social, political and economic conditions, as well as technology. Since the geodetic survey profession has been the keeper of the cadastre, geodetic surveyors will have to deal ever more with social science matters, a fact that universities will have to consider", "fulltext": "", "keywords": "case study;political aspects;economic conditions;economic aspects;geodetic survey profession;social sciences;cadastre;land registration;cadastral development methodologies;research methodologies;geodetic surveyors"}
{"name": "train_1838", "title": "Anticipating the further development of cadastral systems", "abstract": "Although the paper recognises the merits of the evolution of cadastral systems towards an increased capability over time, it promotes a radical introduction or overhaul of existing cadastral systems. It encourages the development of a capability to cope with some key drivers of major change. These have been identified as globalisation, the advent of fully automated cadastral environments, improved decentralised methods of governance and greatly improved service delivery of future cadastral systems to a wide range of users. The paper promotes the registration of title supported by government guarantee as an effective means for rapidly introducing cadastral systems to facilitate globally competitive land markets in developing countries. In developing automated environments for cadastral systems, the need to completely re-engineer and redesign cadastral systems to meet basic cadastral principles and responsiveness to individual user needs is promoted. In this environment, highly decentralised cadastral operations and administration combined with light regulatory control are advocated as a future governance strategy. With regard to the level of services to users, an emphasis on recognising and serving the future needs of users is seen as essential. International and national professional and user organisations involved in land administration are seen as an important vehicle for developing strategies and providing evaluation to guide the over-arching development of cadastral systems around the world", "fulltext": "", "keywords": "user needs;decentralised governance;user organisations;future governance strategy;light regulatory control;developing countries;land administration;cadastral systems development;future user needs;cadastral principles;professional organisations;service delivery;automated environments;globally competitive land markets;highly decentralised cadastral operations;government guarantee;globalisation;automated cadastral environments"}
{"name": "train_1839", "title": "The dynamic aspect of land administration: an often-forgotten component in", "abstract": "system design Although the establishment of a land administration system is enough of a challenge as it is, the task of keeping the system up to date with developments in society is even more challenging. Initial adjudication and cadastral mapping basically record land tenure as it exists at a given moment, i.e. the static situation. The paper aims to analyse the developments that might occur in a society with respect to tenure, value and use of land. These developments constitute a dynamic component of land administration. As land administration systems have to serve society on a long-term basis and normally have a long-term return on investment, the author recommends taking into account both the static and dynamic component when designing land administration systems", "fulltext": "", "keywords": "land administration system;land tenure;dynamic component;static situation;system design;dynamic aspect;cadastral mapping;return on investment;adjudication;societal developments;static component"}
{"name": "train_184", "title": "On the expected value of the minimum assignment", "abstract": "The minimum k-assignment of an m*n matrix X is the minimum sum of k entries of X, no two of which belong to the same row or column. Coppersmith and Sorkin conjectured that if X is generated by choosing each entry independently from the exponential distribution with mean 1, then the expected value of its minimum k-assignment is given by an explicit formula, which has been proven only in a few cases. In this paper we describe our efforts to prove the Coppersmith-Sorkin conjecture by considering the more general situation where the entries x/sub ij/ of X are chosen independently from different distributions. In particular, we require that x/sub ij/ be chosen from the exponential distribution with mean 1/r/sub i/c/sub j/. We conjecture an explicit formula for the expected value of the minimum k-assignment of such X and give evidence for this formula", "fulltext": "", "keywords": "m * n matrix;minimum k-assignment;exponential distribution;rational function;bipartite graph"}
{"name": "train_1840", "title": "Too much middleware", "abstract": "The movement from client-server computing to multi-tier computing has created a potpourri of so-called middleware systems, including application servers, workflow products, EAI systems, ETL systems and federated data systems. We argue that the explosion in middleware has created a myriad of poorly integrated systems with overlapping functionality. The world would be well served by considerable consolidation, and we present some of the ways this might happen. Some of the points covered in the article have been previously explored by P. Bernstein (1996)", "fulltext": "", "keywords": "multi-tier computing;middleware systems;eai systems;federated data systems;client-server computing;etl systems;poorly integrated systems;overlapping functionality;application servers;workflow products"}
{"name": "train_1841", "title": "The XML typechecking problem", "abstract": "When an XML document conforms to a given type (e.g. a DTD or an XML schema type) it is called a valid document. Checking if a given XML document is valid is called the validation problem, and is typically performed by a parser (hence, validating parser), more precisely it is performed right after parsing, by the same program module. In practice however, XML documents are often generated dynamically, by some program: checking whether all XML documents generated by the program are valid WRT a given type is called the typechecking problem. While a validation analyzes an XML document, a type checker analyzes a program, and the problem's difficulty is a function of the language in which that program is expressed. The XML typechecking problem has been investigated recently and the XQuery Working Group adopted some of these techniques for typechecking XQuery. All these techniques, however, have limitations which need to be understood and further explored and investigated. We define the XML typechecking problem, and present current approaches to typechecking, discussing their limitations", "fulltext": "", "keywords": "xml document;xquery;xml typechecking problem;validation"}
{"name": "train_1842", "title": "The role of B2B engines in B2B integration architectures", "abstract": "Semantic B2B integration architectures must enable enterprises to communicate standards-based B2B events like purchase orders with any potential trading partner. This requires not only back end application integration capabilities to integrate with e.g. enterprise resource planning (ERP) systems as the company-internal source and destination of B2B events, but also a capability to implement every necessary B2B protocol like electronic data interchange (EDI), RosettaNet as well as more generic capabilities like Web services (WS). This paper shows the placement and functionality of B2B engines in semantic B2B integration architectures that implement a generic framework for modeling and executing any B2B protocol. A detailed discussion shows how a B2B engine can provide the necessary abstractions to implement any standard-based B2B protocol or any trading partner specific specialization", "fulltext": "", "keywords": "edi;semantic b2b integration architectures;b2b engines;trading partner;rosettanet;purchase orders;erp systems;modeling;standards-based b2b event communication;web services"}
{"name": "train_1843", "title": "Supply chain infrastructures: system integration and information sharing", "abstract": "The need for supply chain integration (SCI) methodologies has been increasing as a consequence of the globalization of production and sales, and the advancement of enabling information technologies. In this paper, we describe our experience with implementing and modeling SCIs. We present the integration architecture and the software components of our prototype implementation. We then discuss a variety of information sharing methodologies. Then, within the framework of a multi-echelon supply chain process model spanning multiple organizations, we summarize research on the benefits of intraorganizational knowledge sharing, and we discuss performance scalability", "fulltext": "", "keywords": "system integration;sales;performance scalability;software components;supply chain infrastructures;globalization;intraorganizational knowledge sharing;information sharing;multiple organizations;production;multi-echelon supply chain process model;supply chain integration"}
{"name": "train_1844", "title": "A multi-agent system infrastructure for software component marketplace: an", "abstract": "ontological perspective In this paper, we introduce a multi-agent system architecture and an implemented prototype for a software component marketplace. We emphasize the ontological perspective by discussing ontology modeling for the component marketplace, UML extensions for ontology modeling, and the idea of ontology transfer which makes the multi-agent system adapt itself to dynamically changing ontologies", "fulltext": "", "keywords": "ontology modeling;uml extensions;dynamically changing ontologies;multi-agent system architecture;ontology transfer;software component marketplace;adaptation"}
{"name": "train_1845", "title": "Business data management for business-to-business electronic commerce", "abstract": "Business-to-business electronic commerce (B2B EC) opens up new possibilities for trade. For example, new business partners from around the globe can be found, their offers can be compared, even complex negotiations can be conducted electronically, and a contract can be drawn up and fulfilled via an electronic marketplace. However, sophisticated data management is required to provide such facilities. In this paper, the results of a multi-national project on creating a business-to-business electronic marketplace for small and medium-sized enterprises are presented. Tools for information discovery, protocol-based negotiations, and monitored contract enactment are provided and based on a business data repository. The repository integrates heterogeneous business data with business communication. Specific problems such as multilingual nature, data ownership, and traceability of contracts and related negotiations are addressed and it is shown that the present approach provides efficient business data management for B2B EC", "fulltext": "", "keywords": "business data repository;multilingual system;electronic marketplace;business communication;data ownership;protocol-based negotiations;traceability;information discovery;multi-national project;small and medium-sized enterprises;heterogeneous business data;business-to-business electronic commerce;monitored contract enactment;business data management"}
{"name": "train_1846", "title": "Semantic B2B integration: issues in ontology-based approaches", "abstract": "Solving queries to support e-commerce transactions can involve retrieving and integrating information from multiple information resources. Often, users don't care which resources are used to answer their query. In such situations, the ideal solution would be to hide from the user the details of the resources involved in solving a particular query. An example would be providing seamless access to a set of heterogeneous electronic product catalogues. There are many problems that must be addressed before such a solution can be provided. In this paper, we discuss a number of these problems, indicate how we have addressed these and go on to describe the proof-of-concept demonstration system we have developed", "fulltext": "", "keywords": "e-commerce transactions;multiple information resources;semantic b2b integration;information integration;queries;information retrieval;ontology-based approaches;heterogeneous electronic product catalogues"}
{"name": "train_1847", "title": "Conceptual modeling and specification generation for B2B business processes", "abstract": "based on ebXML In order to support dynamic setup of business processes among independent organizations, a formal standard schema for describing the business processes is basically required. The ebXML framework provides such a specification schema called BPSS (Business Process Specification Schema) which is available in two standalone representations: a UML version, and an XML version. The former, however, is not intended for the direct creation of business process specifications, but for defining specification elements and their relationships required for creating an ebXML-compliant business process specification. For this reason, it is very important to support conceptual modeling that is well organized and directly matched with major modeling concepts. This paper deals with how to represent and manage B2B business processes using UML-compliant diagrams. The major challenge is to organize UML diagrams in a natural way that is well suited to the business process meta-model and then to transform the diagrams into an XML version. This paper demonstrates the usefulness of conceptually modeling business processes by prototyping a business process editor tool called ebDesigner", "fulltext": "", "keywords": "ebdesigner;business process specification schema;conceptual modeling;ebxml;uml-compliant diagrams;specification generation;business process editor;meta model;formal standard schema;b2b business processes"}
{"name": "train_1848", "title": "Contracting in the days of ebusiness", "abstract": "Putting electronic business on a sound foundation-model theoretically as well as technologically-is a central challenge for research as well as commercial development. This paper concentrates on the discovery and negotiation phase of concluding an agreement based on a contract. We present a methodology for moving seamlessly from a many-to-many relationship in the discovery phase to a one-to-one relationship in the contract negotiation phase. Making the content of contracts persistent is achieved by reconstructing contract templates by means of mereologic (logic of the whole-part relation). Possibly nested sub-structures of the contract template are taken as a basis for negotiation in a dialogical way. For the negotiation itself the contract templates are extended by implications (logical) and sequences (topical)", "fulltext": "", "keywords": "contract negotiation phase;sequences;contract templates;many-to-many relationship;discovery phase;nested sub-structure;mereologic;implications;one-to-one relationship;electronic business;contracting"}
{"name": "train_1849", "title": "An active functionality service for e-business applications", "abstract": "Service based architectures are a powerful approach to meet the fast evolution of business rules and the corresponding software. An active functionality service that detects events and involves the appropriate business rules is a critical component of such a service-based middleware architecture. In this paper we present an active functionality service that is capable of detecting events in heterogeneous environments, it uses an integral ontology-based approach for the semantic interpretation of heterogeneous events and data, and provides notifications through a publish/subscribe notification mechanism. The power of this approach is illustrated with the help of an auction application and through the personalization of car and driver portals in Internet-enabled vehicles", "fulltext": "", "keywords": "business rules;personalized driver portals;personalized car portals;heterogeneous environments;auction application;ontology based approach;internet-enabled vehicles;software;publish/subscribe notification mechanism;service-based middleware architecture;event detection;e-business applications;semantic interpretation;active functionality service"}
{"name": "train_185", "title": "Property testers for dense Constraint Satisfaction programs on finite domains", "abstract": "Many NP-hard languages can be \"decided\" in subexponential time if the definition of \"decide\" is relaxed only slightly. Rubinfeld and Sudan introduced the notion of property testers, probabilistic algorithms that can decide, with high probability, if a function has a certain property or if it is far from any function having this property. Goldreich, Goldwasser, and Ron constructed property testers with constant query complexity for dense instances of a large class of graph problems. Since many graph problems can be viewed as special cases of the Constraint Satisfaction Problem on Boolean domains, it is natural to try to construct property testers for more general cases of the Constraint Satisfaction Problem. In this paper, we give explicit constructions of property testers using a constant number of queries for dense instances of Constraint Satisfaction Problems where the constraints have constant arity and the variables assume values in some domain of finite size", "fulltext": "", "keywords": "dense instances;constraint satisfaction problem;subexponential time;randomized sampling;constraint satisfaction;graph problems;np-hard languages;property testers;constant query complexity;probabilistic algorithms"}
{"name": "train_1850", "title": "The n-tier hub technology", "abstract": "During 2001, the Enterprise Engineering Laboratory at George Mason University was contracted by the Boeing Company to develop an eHub capability for aerospace suppliers in Taiwan. In a laboratory environment, the core technology was designed, developed, and tested, and now a large first-tier aerospace supplier in Taiwan is commercializing the technology. The project objective was to provide layered network and application services for transporting XML-based business transaction flows across multi-tier, heterogeneous data processing environments. This paper documents the business scenario, the eHub application, and the network transport mechanisms that were used to build the n-tier hub. In contrast to most eHubs, this solution takes the point of view of suppliers, pushing data in accordance with supplier requirements; hence, enhancing the probability of supplier adoption. The unique contribution of this project is the development of an eHub that meets the needs of small and medium enterprises (SMEs) and first-tier suppliers", "fulltext": "", "keywords": "multi-tier heterogeneous data processing environments;business scenario;boeing company;n-tier hub technology;xml-based business transaction flows;taiwan;network transport mechanisms;small and medium enterprises;supplier adoption;aerospace suppliers;first-tier suppliers"}
{"name": "train_1851", "title": "Supporting global user profiles through trusted authorities", "abstract": "Personalization generally refers to making a Web site more responsive to the unique and individual needs of each user. We argue that for personalization to work effectively, detailed and interoperable user profiles should be globally available for authorized sites, and these profiles should dynamically reflect changes in user interests. Creating user profiles from user click-stream data seems to be an effective way of generating detailed and dynamic user profiles. However, a user profile generated in this way is available only on the computer where the user accesses his browser, and is inaccessible when the same user works on a different computer. On the other hand, integration of the Internet with telecommunication networks has made it possible for the users to connect to the Web with a variety of mobile devices as well as desktops. This requires that user profiles should be available to any desktop or mobile device on the Internet that users choose to work with. In this paper, we address these problems through the concept of \"trusted authority\". A user agent at the client side that captures the user click stream, dynamically generates a navigational history 'log' file in Extensible Markup Language (XML). This log file is then used to produce 'user profiles' in a resource description framework (RDF). A user's right to privacy is provided through the Platform for Privacy Preferences (P3P) standard. User profiles are uploaded to the trusted authority and served next time the user connects to the Web", "fulltext": "", "keywords": "trusted authorities;privacy;namespace qualifier;user click stream;telecommunication networks;internet;platform for privacy preferences standard;resource description framework;user agent;navigational history log file;globally unique user id/password identification;xml;personalization;global user profiles;web site;mobile device"}
{"name": "train_1852", "title": "The design and performance evaluation of alternative XML storage strategies", "abstract": "This paper studies five strategies for storing XML documents including one that leaves documents in the file system, three that use a relational database system, and one that uses an object manager. We implement and evaluate each approach using a number of XQuery queries. A number of interesting insights are gained from these experiments and a summary of the advantages and disadvantages of the approaches is presented", "fulltext": "", "keywords": "file system;xml document storage;xquery queries;relational database system;performance evaluation;object manager"}
{"name": "train_1853", "title": "CherylAnn Silberer: all about process [accounting technologist]", "abstract": "Silberer's company, CompLete, is making a specialty of workflow process analysis", "fulltext": "", "keywords": "complete;workflow process analysis;accounting technologist"}
{"name": "train_1854", "title": "Software Technology: looking for quality accountants", "abstract": "Software Technology wants to turn 23 years of reselling experience in the legal business into an asset in the accounting market", "fulltext": "", "keywords": "software technology;accounting market;reselling"}
{"name": "train_1855", "title": "Distribution software: ROI is king", "abstract": "Middle-market accounting software vendors are taking to the open road, by way of souped-up distribution suites that can track product as it wends its way from warehouse floor to customer site. Integration provides efficiencies, and cost savings", "fulltext": "", "keywords": "distribution;accounting software;warehouse management"}
{"name": "train_1856", "title": "Tax forms: CD or not CD?", "abstract": "The move from CD to the Web looks unstoppable. Besides counting how many thousands of electronic tax forms they offer, vendors are rapidly moving those documents to the Web", "fulltext": "", "keywords": "web;cch perform plus h;electronic tax forms;ria eform;universal tax systems forms complete;stf services superform;nelco laserlibrarian ii;atx forms zillion forms;kleinrock forms library plus"}
{"name": "train_1858", "title": "Account aggregation: shaping up portfolios", "abstract": "CPA providers of financial planning services are providing clients with a unified view of their investments", "fulltext": "", "keywords": "financial planning services;account aggregation"}
{"name": "train_1859", "title": "Practice management goes remote [accounting]", "abstract": "There's a lot of life in accounting practice management software, a valuable category that has been subject to much change in the last few years. Web-based time tracking grows in popularity. Looks at CCH ProSystem fx Practice, CMS Open Solutions 6, Creative Solutions Practice, Time Matters, CPASoftware Visual Practice Management, and Abak", "fulltext": "", "keywords": "web-based time tracking;cms open solutions 6;cpasoftware visual practice management;abak;creative solutions practice;cch prosystem fx practice;accounting practice management software;time matters"}
{"name": "train_186", "title": "The diameter of a long-range percolation graph", "abstract": "We consider the following long-range percolation model: an undirected graph with the node set {0, 1, . . . , N}/sup d/, has edges (x, y) selected with probability approximately= beta /||x - y||/sup s/ if ||x - y|| > 1, and with probability 1 if ||x - y|| = 1, for some parameters beta , s > 0. This model was introduced by who obtained bounds on the diameter of this graph for the one-dimensional case d = 1 and for various values of s, but left cases s = 1, 2 open. We show that, with high probability, the diameter of this graph is Theta (log N/log log N) when s = d, and, for some constants 0 < eta /sub 1/ < eta /sub 2/ < 1, it is at most N/sup eta 2/ when s = 2d, and is at least N/sup eta 1/ when d = 1, s = 2, beta < 1 or when s > 2d. We also provide a simple proof that the diameter is at most log/sup O(1)/ N with high probability, when d < s < 2d, established previously in Benjamini and Berger (2001)", "fulltext": "", "keywords": "positive probability;undirected graph;random graph;probability;networks;percolation;long-range percolation model"}
{"name": "train_1860", "title": "The art of the cross-sell [accounting software]", "abstract": "With the market for accounting software nearing saturation, vendors are training resellers in the subtleties of the cross-sell. The rewards can be great. The key is knowing when to focus, and when to partner", "fulltext": "", "keywords": "resellers;cross-selling;accounting software"}
{"name": "train_1861", "title": "Technology in distance education: a global perspective to alternative delivery", "abstract": "mechanisms Technology is providing a positive impact on delivery mechanisms employed in distance education at the university level. Some institutions are incorporating distance education as a way to extend the classroom. Other institutions are investigating new delivery mechanisms, which support a revised perspective on education. These latter institutions are revising their processes for interacting with students, and taking a more \"learner centered\" approach to the delivery of education. This article discusses the impact of technology on the delivery mechanisms employed in distance education. A framework is proposed here, which presents a description of alternative modes of generic delivery mechanisms. It is suggested that those institutions, which adopt a delivery mechanism employing an asynchronous mode, can gain the most benefit from technology. This approach seems to represent the only truly innovative use of technology in distance education. The approach creates a student-oriented environment while maintaining high levels of interaction, both of which are factors that contribute to student satisfaction with their overall educational experience", "fulltext": "", "keywords": "student satisfaction;distance education;university education;learner centered approach;global perspective;asynchronous mode;educational technology"}
{"name": "train_1862", "title": "Global comparison of stages of growth based on critical success factors", "abstract": "With increasing globalization of business, the management of IT in international organizations is faced with the complex task of dealing with the difference between local and international IT needs. This study evaluates, and compares, the level of IT maturity and the critical success factors (CSFs) in selected geographic regions, namely, Norway, Australia/New Zealand, North America, Europe, Asia/Pacific, and India. The results show that significant differences in the IT management needs in these geographic regions exist, and that the IT management operating in these regions must balance the multiple critical success factors for achieving an optimal local-global mix for business success", "fulltext": "", "keywords": "asia/pacific;business success;india;critical success factors;local it needs;australia;it maturity;europe;international it needs;north america;optimal local-global mix;business globalization;new zealand;it management;norway"}
{"name": "train_1863", "title": "Information systems project failure: a comparative study of two countries", "abstract": "Many organizations, regardless of size, engage in at least one, and often many information system projects each year. Many of these projects consume massive amounts of resources, and may cost as little as a few thousand dollars to ten, and even hundreds of millions of dollars. Needless to say, the investment of time and resources into these ventures are of significant concern to chief information officers (CIOs), executives staff members, project managers, and others in leadership positions. This paper describes the results of a survey performed between Australia and the United States regarding factors leading to IS project failure. The findings suggest that, among other things, end user involvement and executive management leadership are key indicators influencing IS project failure", "fulltext": "", "keywords": "australia;information systems project failure;end user involvement;executive management leadership;united states"}
{"name": "train_1864", "title": "Cultural differences in developers' perceptions of information systems success", "abstract": "factors: Japan vs. the United States The study examined the perceptions of information systems (IS) developers from Japan and the United States regarding the strategies that are considered most important for successful implementation of an IS. The results of principal component analysis revealed that the IS strategies could be reduced to five components: (1) characteristics of the team members, (2) characteristics of the project leader, (3) management/user input, (4) proper technology, and (5) communication. The results indicated that there was a significant difference in the perceptions of Japanese and US developers with respect to the importance of the five components. Japanese developers perceived the project leader as the most crucial component for determining the success of an IS project. Team member characteristics was viewed as the least important by Japanese developers. On the other hand, developers from the US viewed communications as the most critical component. Project leader characteristics were perceived to be the least important by US developers. The results were discussed in terms of cultural differences", "fulltext": "", "keywords": "communication;united states;principal component analysis;japan;cultural differences;information systems developer perceptions;management/user input;proper technology;project leader characteristics;is project;team member characteristics;information systems success factors"}
{"name": "train_1865", "title": "Towards the globalisation of the IS/IT function", "abstract": "The IS/IT function has recently emerged from the peripheral aspects of the finance department to the centre of critical organisational change. There is an increasing dependency on its activities as systems extend beyond supporting the internal efficiency of the organisation to augmenting global performance. The growth of wide and local networks has resulted in communication possibilities that were not possible a few years ago. E-commerce challenges the achievements of the IS/IT function and is very prominent in the globalisation of modern organisations. The complexity and diversity of electronic exchange is also well documented (Hackney et al., 2000). This has a number of impacts on the development and implementation of IS/IT solutions for organisations involved in international trade. It is a conjecture that the IS/IT function is critically important for the alignment of the business to meet the demands of global competition, through building internal marketing strategies and creating knowledge based communities. There is clear evidence that IS/IT can lead to improved business performance and potentially for sustained competitive advantage. This is obviously true through the advent of new and emerging technologies such as the Internet", "fulltext": "", "keywords": "internet;wide area networks;knowledge based communities;electronic exchange;internal marketing strategies;international trade;is/it function;e-commerce;globalisation;local area networks"}
{"name": "train_1866", "title": "Tracking with sensor failures", "abstract": "Studies the reliability with sensor failures of the asymptotic tracking problem for linear time invariant systems using the factorization approach. The plant is two-output and the compensator is two-degree-of-freedom. Necessary and sufficient conditions are presented for the general problem and a simple solution is given for problems with stable plants", "fulltext": "", "keywords": "linear time invariant systems;necessary and sufficient conditions;asymptotic tracking problem;two-output plant;sensor failures;factorization approach;two-degree-of-freedom compensator;reliability"}
{"name": "train_1867", "title": "Optimization-based design of fixed-order controllers for command following", "abstract": "For discrete-time scalar systems, we propose an approach for designing feedback controllers of fixed order to minimize an upper bound on the peak magnitude of the tracking error to a given command input. The work makes use of linear programming to design over a class of closed-loop systems proposed for the rejection of non-zero initial conditions and bounded disturbances. We incorporate performance robustness in the form of a guaranteed upper bound on the peak magnitude of the tracking error under plant coprime factor uncertainty", "fulltext": "", "keywords": "closed-loop systems;coprime factor uncertainty;guaranteed upper bound;linear programming;fixed-order controllers;command following;tracking error;performance robustness;optimization-based design;feedback controllers;discrete-time scalar systems"}
{"name": "train_1868", "title": "Estimation of an N-L-N Hammerstein-Wiener model", "abstract": "Estimation of a single-input single-output block-oriented model is studied. The model consists of a linear block embedded between two static nonlinear gains. Hence, it is called an N-L-N Hammerstein-Wiener model. First, the model structure is motivated and the disturbance model is discussed. The paper then concentrates on parameter estimation. A relaxation iteration scheme is proposed by making use of a model structure in which the error is bilinear-in-parameters. This leads to a simple algorithm which minimizes the original loss function. The convergence and consistency of the algorithm are studied. In order to reduce the variance error, the obtained linear model is further reduced using frequency weighted model reduction. A simulation study is used to illustrate the method", "fulltext": "", "keywords": "bilinear-in-parameters error;nonlinear process;n-l-n hammerstein-wiener model;disturbance model;linear block;convergence;frequency weighted model reduction;model structure;relaxation iteration scheme;variance error;parameter estimation;static nonlinear gains;single-input single-output block-oriented model;consistency"}
{"name": "train_1869", "title": "Stability and L/sub 2/ gain properties of LPV systems", "abstract": "Stability and L/sub 2/ gain properties of linear parameter-varying systems are obtained under assumed bounds on either the maximum or average value of the parameter rate", "fulltext": "", "keywords": "parameter rate;linear parameter-varying systems;gain scheduled control;l/sub 2/ gain properties;gromwall-bellman inequality;stability"}
{"name": "train_187", "title": "Control of a thrust-vectored flying wing: a receding horizon - LPV approach", "abstract": "This paper deals with the application of receding horizon methods to hover and forward flight models of an experimental tethered flying wing developed at Caltech. The dynamics of the system are representative of a vertical landing and take off aircraft, such as a Harrier around hover, or a thrust-vectored aircraft such as F18-HARV or X-31 in forward flight. The adopted control methodology is a hybrid of receding horizon techniques and control Lyapunov function (CLF)-based ideas. First, a CLF is generated using quasi-LPV methods and then, by using the CLF as the terminal cost in the receding horizon optimization, stability is guaranteed. The main advantage of this approach is that stability can be guaranteed without imposing constraints in the on-line optimization, allowing the problem to be solved in a more efficient manner. Models of the experimental set-up are obtained for the hover and forward flight modes. Numerical simulations for different time horizons are presented to illustrate the effectiveness of the discussed methods. Specifically, it is shown that a mere upper bound on the cost-to-go is not an appropriate choice for a terminal cost, when the horizon length is short. Simulation results are presented using experimentally verified model parameters", "fulltext": "", "keywords": "x-31;caltech;stability guarantee;f18-harv;nonlinear system;forward flight models;thrust-vectored aircraft;numerical simulations;receding horizon-lpv approach;vertical landing take off aircraft;quasi-lpv methods;tethered flying wing;hover flight models;terminal cost;harrier around hover;thrust-vectored flying wing control;control lyapunov function-based ideas;receding horizon optimization;receding horizon techniques"}
{"name": "train_1870", "title": "Robust control of nonlinear systems with parametric uncertainty", "abstract": "Probabilistic robustness analysis and synthesis for nonlinear systems with uncertain parameters are presented. Monte Carlo simulation is used to estimate the likelihood of system instability and violation of performance requirements subject to variations of the probabilistic system parameters. Stochastic robust control synthesis searches the controller design parameter space to minimize a cost that is a function of the probabilities that design criteria will not be satisfied. The robust control design approach is illustrated by a simple nonlinear example. A modified feedback linearization control is chosen as controller structure, and the design parameters are searched by a genetic algorithm to achieve the tradeoff between stability and performance robustness", "fulltext": "", "keywords": "performance requirements violation;probabilistic robustness synthesis;probabilistic robustness analysis;modified feedback linearization control;stochastic control synthesis;monte carlo simulation;uncertain parameters;parametric uncertainty;system instability;genetic algorithm;robust control;nonlinear systems;input-to-state stability"}
{"name": "train_1871", "title": "Strong and weak points of the MUSCADET theorem prover-examples from CASC-JC", "abstract": "MUSCADET is a knowledge-based theorem prover based on natural deduction. It has participated in CADE Automated theorem proving System Competitions. The results show its complementarity with regard to resolution-based provers. This paper presents some of its crucial methods and gives some examples of MUSCADET proofs from the last competition (CASC-JC in IJCAR 2001)", "fulltext": "", "keywords": "muscadet;resolution-based provers;knowledge-based theorem prover;casc-jc;natural deduction;cade automated theorem proving system competitions"}
{"name": "train_1872", "title": "TPTP, CASC and the development of a semantically guided theorem prover", "abstract": "The first-order theorem prover SCOTT has been through a series of versions over some ten years. The successive provers, while retaining the same underlying technology, have used radically different algorithms and shown wide differences of behaviour. The development process has depended heavily on experiments with problems from the TPTP library and has been sharpened by participation in CASC each year since 1997. We outline some of the difficulties inherent in designing and refining a theorem prover as complex as SCOTT, and explain our experimental methodology. While SCOTT is not one of the systems which have been highly optimised for CASC, it does help to illustrate the influence of both CASC and the TPTP library on contemporary theorem proving research", "fulltext": "", "keywords": "casc;first-order theorem prover;tptp library;semantically guided theorem prover;experimental methodology;proof searches;scott;semantically constrained otter"}
{"name": "train_1873", "title": "A phytography of WALDMEISTER", "abstract": "The architecture of the WALDMEISTER prover for unit equational deduction is based on a strict separation of active and passive facts. After an inspection of the system's proof procedure, the representation of each of the central data structures is outlined, namely indexing for the active facts, compression for the passive facts, successor sets for the hypotheses, and minimal recording of inference steps for the proof object. In order to cope with large search spaces, specialized redundancy criteria are employed, and the empirically gained control knowledge is integrated to ease the use of the system. The paper concludes with a quantitative comparison of the WALDMEISTER versions over the years, and a view of the future prospects", "fulltext": "", "keywords": "future prospects;passive facts;indexing;redundancy;cade atp system competition;hypotheses;phytography;unit equational deduction;inference;waldmeister;data structures;active facts;large search spaces;theorem prover"}
{"name": "train_1874", "title": "E - a brainiac theorem prover", "abstract": "We describe the superposition-based theorem prover E. E is a sound and complete prover for clausal first order logic with equality. Important properties of the prover include strong redundancy elimination criteria, the DISCOUNT loop proof procedure, a very flexible interface for specifying search control heuristics, and an efficient inference engine. We also discuss the strengths and weaknesses of the system", "fulltext": "", "keywords": "search control heuristics;casc;e automatic theorem prover;completeness;soundness;superposition-based theorem prover;discount;strong redundancy elimination criteria;clausal first order logic;loop proof procedure;cade atp system competitions;inference engine;rewriting;brainiac theorem prover;equality"}
{"name": "train_1875", "title": "The design and implementation of VAMPIRE", "abstract": "We describe VAMPIRE: a high-performance theorem prover for first-order logic. As our description is mostly targeted to the developers of such systems and specialists in automated reasoning, it focuses on the design of the system and some key implementation features. We also analyze the performance of the prover at CASC-JC", "fulltext": "", "keywords": "first-order logic;resolution theorem proving;performance evaluation;casc-jc;automated reasoning;high-performance theorem prover;vampire"}
{"name": "train_1876", "title": "The development of CASC [automated theorem proving]", "abstract": "Researchers who make theoretical advances also need some way to demonstrate that an advance really does have general, overall positive consequences for system performance. For this it is necessary to evaluate the system on a set of problems that is sufficiently large and diverse to be somehow representative of the intended application area as a whole. It is only a small step from system evaluation to a communal system competition. The CADE ATP System Competition (CASC) has been run annually since 1996. Any competition is difficult to design and organize in the first instance, and to then run over the years. In order to obtain the full benefits of a competition, a thoroughly organized event, with an unambiguous and motivated design, is necessary. For some issues relevant to the CASC design, inevitable constraints have emerged. For other issues there have been several choices, and decisions have had to be made. This paper describes the evolution of CASC, paying particular attention to its design, design changes, and organization", "fulltext": "", "keywords": "automated theorem proving;casc;ai;automated deduction;system performance;cade atp system competition;artificial intelligence;system evaluation;classical first order logic"}
{"name": "train_1877", "title": "Strong completeness of lattice-valued logic", "abstract": "This paper shows strong completeness of the system L for lattice valued logic given by S. Titani (1999), in which she formulates a lattice-valued set theory by introducing the logical implication which represents the order relation on the lattice. Syntax and semantics concerned are described and strong completeness is proved", "fulltext": "", "keywords": "order relation;strong completeness;semantics;lattice-valued set theory;lattice-valued logic;syntax"}
{"name": "train_1878", "title": "Max and min limiters", "abstract": "If A contained in omega , n>or=2, and the function max({x/sub 1/,...,x/sub n/} intersection A) is partial recursive, it is easily seen that A is recursive. In this paper, we weaken this hypothesis in various ways (and similarly for \"min\" in place of \"max\") and investigate what effect this has on the complexity of A. We discover a sharp contrast between retraceable and co-retraceable sets, and we characterize sets which are the union of a recursive set and a co-r.e., retraceable set. Most of our proofs are noneffective. Several open questions are raised", "fulltext": "", "keywords": "max limiters;recursive set;complexity;retraceable sets;min limiters"}
{"name": "train_1879", "title": "On the distribution of Lachlan nonsplitting bases", "abstract": "We say that a computably enumerable (c.e.) degree b is a Lachlan nonsplitting base (LNB), if there is a computably enumerable degree a such that a>b, and for any c.e. degrees w, v<or=a, if a<or=wVvV b then either a<or=wV b or a<or=vV b. In this paper we investigate the relationship between bounding and nonbounding of Lachlan nonsplitting bases and the high/low hierarchy. We prove that there is a non-Low/sub 2/ c.e. degree which bounds no Lachlan nonsplitting base", "fulltext": "", "keywords": "turing degrees;computably enumerable degree;lachlan nonsplitting bases distribution"}
{"name": "train_188", "title": "Sampled-data implementation of a gain scheduled controller", "abstract": "A continuous-time gain-scheduled controller must be transformed to a corresponding discrete-time controller for sampled-data implementation. We show that certain linearization properties of a continuous-time gain scheduled controller are inherited by its sampled-data implementation. We also show that a similar relationship exists for multi-rate gain scheduled controllers arising in flight control applications", "fulltext": "", "keywords": "discrete-time controller;linearization properties;gain scheduled controller;flight control applications;continuous-time gain-scheduled controller;sampled-data implementation;multi-rate gain scheduled controllers"}
{"name": "train_1880", "title": "Simulation and transient testing of numerical relays", "abstract": "A hybrid and practical solution for relay evaluation is presented. Two main issues are taken into account: power system simulation and relay simulation, both of which consist of different stages. System simulation is carried out by means of EMTP and is complemented by additional features, such as filtering for location and determination of fault parameters that allow comparing simulated and actual fault records to improve and guarantee a correct system simulation. Relay simulation includes filtering algorithms, all the relaying units, and the decision logic. Playing simulated or real faults over the actual relay and comparing simulated and real responses can check for correct relay simulation", "fulltext": "", "keywords": "filtering algorithms;decision logic;emtp;real faults;relay evaluation;numerical relays;relay simulation;filtering;simulated faults;fault location;relay testing;power system simulation"}
{"name": "train_1881", "title": "Stabilization of positive systems with first integrals", "abstract": "Positive systems possessing first integrals are considered. These systems frequently occur in applications. The paper is devoted to two stabilization problems. The first is concerned with the design of feedbacks to stabilize a given level set. Secondly, it is shown that the same feedback allows us to globally stabilize an equilibrium point if it is asymptotically stable with respect to initial conditions in its level set. Two examples are provided and the results are compared with those in the literature", "fulltext": "", "keywords": "feedbacks design;asymptotic stability;chemical reactors;global stabilization;first integrals;positive systems;equilibrium point"}
{"name": "train_1882", "title": "Bandwidth vs. gains design of H/sub infinity / tracking controllers for", "abstract": "current-fed induction motors Describes a systematic procedure for designing speed and rotor flux norm tracking H/sub infinity /. controllers with unknown load torque disturbances for current-fed induction motors. A new effective design tool is developed to allow selection of the control gains so as to adjust the disturbances' rejection capability of the controllers in the face of the bandwidth requirements of the closed-loop system. Application of the proposed design procedure is demonstrated in a case study, and the results of numerical simulations illustrate the satisfactory performance achievable even in presence of rotor resistance uncertainty", "fulltext": "", "keywords": "closed-loop system;current-fed induction motors;observers;unknown load torque disturbances;rotor flux norm controllers;h/sub infinity / tracking controllers;feedback linearization;design tool;disturbances rejection capability;bandwidth requirements;speed controllers"}
{"name": "train_1883", "title": "Analysis of exclusively kinetic two-link underactuated mechanical systems", "abstract": "Analysis of exclusively kinetic two-link underactuated mechanical systems is undertaken. It is first shown that such systems are not full-state feedback linearizable around any equilibrium point. Also, the equilibrium points for which the system is small-time locally controllable (STLC) is at most a one-dimensional submanifold. A concept less restrictive than STLC, termed the small-time local output controllability (STLOC) is introduced, the satisfaction of which guarantees that a chosen configuration output can be controlled at its desired value. It is shown that the class of systems considered is STLOC, if the inertial coupling between the input and output is nonzero. Also, in such a case, the system is nonminimum phase. An example section illustrates all the results presented", "fulltext": "", "keywords": "equilibrium points;small-time local output controllability;nonminimum phase;small-time locally controllable system;exclusively kinetic two-link underactuated mechanical systems;one-dimensional submanifold"}
{"name": "train_1884", "title": "Observer-based strict positive real (SPR) feedback control system design", "abstract": "Presents theory for stability analysis and design for a class of observer-based feedback control systems. Relaxation of the controllability and observability conditions imposed in the Yakubovich-Kalman-Popov lemma can be made for a class of nonlinear systems described by a linear time-invariant system with a feedback-connected cone-bounded nonlinear element. It is shown how a circle-criterion approach can be used to design an observer-based state feedback control which yields a closed-loop system with specified robustness characteristics. The approach is relevant for design with preservation of stability when a cone-bounded nonlinearity is introduced in the feedback loop. Important applications are to be found in nonlinear control with high robustness requirements", "fulltext": "", "keywords": "linear time-invariant system;closed-loop system;robustness characteristics;yakubovich-kalman-popov lemma;cone-bounded nonlinearity;control system design;state feedback control;circle-criterion approach;nonlinear systems;stability analysis;observer-based strict positive real feedback control system;feedback-connected cone-bounded nonlinear element"}
{"name": "train_1885", "title": "Analysis of nonlinear time-delay systems using modules over non-commutative", "abstract": "rings The theory of non-commutative rings is introduced to provide a basis for the study of nonlinear control systems with time delays. The left Ore ring of non-commutative polynomials defined over the field of a meromorphic function is suggested as the framework for such a study. This approach is then generalized to a broader class of nonlinear systems with delays that are called generalized Roesser systems. Finally, the theory is applied to analyze nonlinear time-delay systems. A weak observability is defined and characterized, generalizing the well-known linear result. Properties of closed submodules are then developed to obtain a result on the accessibility of such systems", "fulltext": "", "keywords": "modules;meromorphic function;left ore ring;noncommutative polynomials;noncommutative rings;nonlinear control systems;weak observability;nonlinear time-delay systems;generalized roesser systems"}
{"name": "train_1886", "title": "Non-asymptotic confidence ellipsoids for the least-squares estimate", "abstract": "We consider the finite sample properties of least-squares system identification, and derive non-asymptotic confidence ellipsoids for the estimate. The shape of the confidence ellipsoids is similar to the shape of the ellipsoids derived using asymptotic theory, but unlike asymptotic theory, they are valid for a finite number of data points. The probability that the estimate belongs to a certain ellipsoid has a natural dependence on the volume of the ellipsoid, the data generating mechanism, the model order and the number of data points available", "fulltext": "", "keywords": "least-squares system identification;data points;finite sample properties;least-squares estimate;nonasymptotic confidence ellipsoids;model order;data generating mechanism;probability"}
{"name": "train_1887", "title": "Doubly invariant equilibria of linear discrete-time games", "abstract": "The notion of doubly invariant (DI) equilibrium is introduced. The concept extends controlled and robustly controlled invariance notions to the context of two-person dynamic games. Each player tries to keep the state in a region of state space independently of the actions of the rival player. The paper gives existence conditions, criteria and algorithms for the determination of DI equilibria of linear dynamic games in discrete time. Two examples illustrate the results. The first one is in the area of fault-tolerant controller synthesis. The second is an application to macroeconomics", "fulltext": "", "keywords": "macroeconomics;two-person dynamic games;fault-tolerant controller synthesis;doubly invariant equilibria;state space;existence conditions;robustly controlled invariance;linear discrete-time games"}
{"name": "train_1888", "title": "L/sub 2/ model reduction and variance reduction", "abstract": "We examine certain variance properties of model reduction. The focus is on L/sub 2/ model reduction, but some general results are also presented. These general results can be used to analyze various other model reduction schemes. The models we study are finite impulse response (FIR) and output error (OE) models. We compare the variance of two estimated models. The first one is estimated directly from data and the other one is computed by reducing a high order model, by L/sub 2/ model reduction. In the FIR case we show that it is never better to estimate the model directly from data, compared to estimating it via L/sub 2/ model reduction of a high order FIR model. For OE models we show that the reduced model has the same variance as the directly estimated one if the reduced model class used contains the true system", "fulltext": "", "keywords": "variance reduction;identification;l/sub 2/ model reduction;fir models;output error models;finite impulse response models"}
{"name": "train_1889", "title": "Sliding mode dynamics in continuous feedback control for distributed", "abstract": "discrete-event scheduling A continuous feedback control approach for real-time scheduling of discrete events is presented motivated by the need for control theoretic techniques to analyze and design such systems in distributed manufacturing applications. These continuous feedback control systems exhibit highly nonlinear and discontinuous dynamics. Specifically, when the production demand in the manufacturing system exceeds the available resource capacity then the control system \"chatters\" and exhibits sliding modes. This sliding mode behavior is advantageously used in the scheduling application by allowing the system to visit different schedules within an infinitesimal region near the sliding surface. In the paper, an analytical model is developed to characterize the sliding mode dynamics. This model is then used to design controllers in the sliding mode domain to improve the effectiveness of the control system to \"search\" for schedules with good performance. Computational results indicate that the continuous feedback control approach can provide near-optimal schedules and that it is computationally efficient compared to existing scheduling techniques", "fulltext": "", "keywords": "control theoretic techniques;highly nonlinear discontinuous dynamics;resource capacity;distributed discrete-event scheduling;continuous feedback control;distributed manufacturing applications;production demand;real-time scheduling;sliding mode dynamics"}
{"name": "train_189", "title": "Identification of linear parameter varying models", "abstract": "We consider identification of a certain class of discrete-time nonlinear systems known as linear parameter varying system. We assume that inputs, outputs and the scheduling parameters are directly measured, and a form of the functional dependence of the system coefficients on the parameters is known. We show how this identification problem can be reduced to a linear regression, and provide compact formulae for the corresponding least mean square and recursive least-squares algorithms. We derive conditions on persistency of excitation in terms of the inputs and scheduling parameter trajectories when the functional dependence is of polynomial type. These conditions have a natural polynomial interpolation interpretation, and do not require the scheduling parameter trajectories to vary slowly. This method is illustrated with a simulation example using two different parameter trajectories", "fulltext": "", "keywords": "least mean square algorithms;identification;parameter trajectories;persistency of excitation conditions;discrete-time nonlinear systems;scheduling parameter trajectories;recursive least-squares algorithms;functional dependence;polynomial interpolation interpretation;system coefficients;scheduling parameters;linear regression;time-varying systems;linear parameter varying models"}
{"name": "train_1890", "title": "Robustness of trajectories with finite time extent", "abstract": "The problem of estimating perturbation bounds of finite trajectories is considered. The trajectory is assumed to be generated by a linear system with uncertainty characterized in terms of integral quadratic constraints. It is shown that such perturbation bounds can be obtained as the solution to a nonconvex quadratic optimization problem, which can be addressed using Lagrange relaxation. The result can be used in robustness analysis of hybrid systems and switched dynamical systems", "fulltext": "", "keywords": "robustness analysis;uncertainty;nonconvex quadratic optimization problem;trajectories robustness;perturbation bounds;switched dynamical systems;hybrid systems;integral quadratic constraints;lagrange relaxation;linear system;finite time extent"}
{"name": "train_1891", "title": "On trajectory and force tracking control of constrained mobile manipulators", "abstract": "with parameter uncertainty Studies the trajectory and force tracking control problem of mobile manipulators subject to holonomic and nonholonomic constraints with unknown inertia parameters. Adaptive controllers are proposed based on a suitable reduced dynamic model, the defined reference signals and the mixed tracking errors. The proposed controllers not only ensure the entire state of the system to asymptotically converge to the desired trajectory but also ensure the constraint force to asymptotically converge to the desired force. A detailed numerical example is presented to illustrate the developed methods", "fulltext": "", "keywords": "force tracking control;holonomic constraints;asymptotic convergence;mixed tracking errors;trajectory control;nonholonomic constraints;position control;constrained mobile manipulators;reduced dynamic model;mobile robots;adaptive controllers;parameter uncertainty"}
{"name": "train_1892", "title": "Closed-loop persistent identification of linear systems with unmodeled dynamics", "abstract": "and stochastic disturbances The essential issues of time complexity and probing signal selection are studied for persistent identification of linear time-invariant systems in a closed-loop setting. By establishing both upper and lower bounds on identification accuracy as functions of the length of observation, size of unmodeled dynamics, and stochastic disturbances, we demonstrate the inherent impact of unmodeled dynamics on identification accuracy, reduction of time complexity by stochastic averaging on disturbances, and probing capability of full rank periodic signals for closed-loop persistent identification. These findings indicate that the mixed formulation, in which deterministic uncertainty of system dynamics is blended with random disturbances, is beneficial to reduction of identification complexity", "fulltext": "", "keywords": "stochastic disturbances;closed-loop persistent identification;identification accuracy;upper bounds;time complexity;full rank periodic signals;unmodeled dynamics;lower bounds;linear time-invariant systems;probing signal selection"}
{"name": "train_1893", "title": "Closed-loop model set validation under a stochastic framework", "abstract": "Deals with probabilistic model set validation. It is assumed that the dynamics of a multi-input multi-output (MIMO) plant is described by a model set with unstructured uncertainties, and identification experiments are performed in closed loop. A necessary and sufficient condition has been derived for the consistency of the model set with both the stabilizing controller and closed-loop frequency domain experimental data (FDED). In this condition, only the Euclidean norm of a complex vector is involved, and this complex vector depends linearly on both the disturbances and the measurement errors. Based on this condition, an analytic formula has been derived for the sample unfalsified probability (SUP) of the model set. Some of the asymptotic statistical properties of the SUP have also been briefly discussed. A numerical example is included to illustrate the efficiency of the suggested method in model set quality evaluation", "fulltext": "", "keywords": "stabilizing controller;complex vector;unstructured uncertainties;stochastic framework;asymptotic statistical properties;euclidean norm;closed-loop model set validation;probabilistic model set validation;mimo plant;closed-loop frequency domain experimental data;robust control;multi-input multi-output plant;necessary and sufficient condition;unstructured uncertainty"}
{"name": "train_1894", "title": "Switching controller design via convex polyhedral Lyapunov functions", "abstract": "We propose a systematic switching control design method for a class of nonlinear discrete time hybrid systems. The novelty of the adopted approach is in the fact that unlike conventional control the control burden is shifted to a logical level thus creating the need for the development of new analysis/design methods", "fulltext": "", "keywords": "convex polyhedral lyapunov functions;nonlinear discrete time hybrid systems;switching controller design;systematic design method"}
{"name": "train_1895", "title": "An algorithm combining neural networks with fundamental parameters", "abstract": "An algorithm combining neural networks with the fundamental parameters equations (NNFP) is proposed for making corrections for non-linear matrix effects in x-ray fluorescence analysis. In the algorithm, neural networks were applied to relate the concentrations of components to both the measured intensities and the relative theoretical intensities calculated by the fundamental parameter equations. The NNFP algorithm is compared with the classical theoretical correction models, including the fundamental parameters approach, the Lachance-Traill model, a hyperbolic function model and the COLA algorithm. For an alloy system with 15 measured elements, in most cases, the prediction errors of the NNFP algorithm are lower than those of the fundamental parameters approach, the Lachance-Traill model, the hyperbolic function model and the COLA algorithm separately. If there are the serious matrix effects, such as matrix effects among Cr, Fe and Ni, the NNFP algorithm generally decreased predictive errors as compared with the classical models, except for the case of Cr by the fundamental parameters approach. The main reason why the NNFP algorithm has generally a better predictive ability than the classical theoretical correction models might be that neural networks can better calibrate the non-linear matrix effects in a complex multivariate system", "fulltext": "", "keywords": "algorithm;complex multivariate system;fe;ni;x-ray fluorescence analysis;fundamental parameters;lachance-traill model;intensities;alloy system;cr;cola algorithm;neural networks;nnfp algorithm;hyperbolic function model;theoretical correction models;fundamental parameters equations;nonlinear matrix effects"}
{"name": "train_1896", "title": "The dynamics of a railway freight wagon wheelset with dry friction damping", "abstract": "We investigate the dynamics of a simple model of a wheelset that supports one end of a railway freight wagon by springs with linear characteristics and dry friction dampers. The wagon runs on an ideal, straight and level track with constant speed. The lateral dynamics in dependence on the speed is examined. We have included stick-slip and hysteresis in our model of the dry friction and assume that Coulomb's law holds during the slip phase. It is found that the action of dry friction completely changes the bifurcation diagram, and that the longitudinal component of the dry friction damping forces destabilizes the wagon", "fulltext": "", "keywords": "lateral dynamics;hysteresis;stick-slip;linear characteristics;coulomb law;longitudinal component;dry friction damping;railway freight wagon wheelset;dynamics;bifurcation diagram"}
{"name": "train_1897", "title": "User-appropriate tyre-modelling for vehicle dynamics in standard and limit", "abstract": "situations When modelling vehicles for the vehicle dynamic simulation, special attention must be paid to the modelling of tyre forces and -torques, according to their dominant influence on the results. This task is not only about sufficiently exact representation of the effective forces but also about user-friendly and practical relevant applicability, especially when the experimental tyre-input-data is incomplete or missing. This text firstly describes the basics of the vehicle dynamic tyre model, conceived to be a physically based, semi-empirical model for application in connection with multi-body-systems (MBS). On the basis of tyres for a passenger car and a heavy truck the simulated steady state tyre characteristics are shown together and compared with the underlying experimental values. The possibility to link the tyre model TMeasy to any MBS-program is described, as far as it supports the 'Standard Tyre Interface'. As an example, the simulated and experimental data of a heavy truck doing a standardized driving manoeuvre are compared", "fulltext": "", "keywords": "semi-empirical model;multi-body-systems;simulated steady state tyre characteristics;tmeasy;standard situations;vehicle dynamics;standardized driving manoeuvre;tyre modelling;tyre torques;standard tyre interface;heavy truck;passenger car;limit situations"}
{"name": "train_1898", "title": "Design of a stroke dependent damper for the front axle suspension of a truck", "abstract": "using multibody system dynamics and numerical optimization A stroke dependent damper is designed for the front axle suspension of a truck. The damper supplies extra damping for inward deflections rising above 4 cm. In this way the damper should reduce extreme suspension deflections without deteriorating the comfort of the truck. But the question is which stroke dependent damping curve yields the best compromise between suspension deflection working space and comfort. Therefore an optimization problem is defined to minimize the maximum inward suspension deflection subject to constraints on the chassis acceleration for three typical road undulations. The optimization problem is solved using sequential linear programming (SLP) and multibody dynamics simulation software. Several optimization runs have been carried out for a small two degree of freedom vehicle model and a large full-scale model of the truck semi-trailer combination. The results show that the stroke dependent damping can reduce large deflections at incidental road disturbances, but that the optimum stroke dependent damping curve is related to the acceleration bound. By means of vehicle model simulation and numerical optimization we have been able to quantify this trade-off between suspension deflection working space and truck comfort", "fulltext": "", "keywords": "sequential linear programming;damping;acceleration bound;inward deflections;multibody system dynamics;full-scale model;truck comfort;numerical optimization;extreme suspension deflections;truck semi-trailer combination;front axle suspension;incidental road disturbances;chassis acceleration;vehicle model simulation;road undulations;stroke dependent damper"}
{"name": "train_1899", "title": "Human face detection in visual scenes using neural networks", "abstract": "This paper presents a neural network based face detection system. Our objective is to design a system that can detect human faces in visual scenes at high searching speed and accuracy. We used a neural network with a simple structure but trained using face and non-face samples preprocessed by several methods (position normalization, histogram equalization, etc.) to attain high accuracy, then pruned the size of the neural network so that it could run faster and reduced the total search area of a target visual scene using the skin color detector. Skin color detection assumes that faces reside only in skin color regions. The system design is made up of two parts: the face detecting system that detects the faces, and the searching speed improving system. Speed improvement is achieved by reducing the face locator network size using the structural learning with knowledge and by reducing the face search area using the skin color detection system. Faster training of the neural networks was also achieved using variable step sizes", "fulltext": "", "keywords": "neural network;visual scene;down-sampling;face detecting system;self organizing maps;merging overlapping detections;skin color detector;human face recognition;backpropagation"}
{"name": "train_19", "title": "Decentralized adaptive output feedback stabilization for a class of", "abstract": "interconnected systems with unknown bound of uncertainties The problem of adaptive decentralized stabilization for a class of linear time-invarying large-scale systems with nonlinear interconnectivity and uncertainties is discussed. The bounds of uncertainties are assumed to be unknown. For such uncertain dynamic systems, an adaptive decentralized controller is presented. The resulting closed-loop systems are asymptotically stable in theory. Moreover, an adaptive decentralized control scheme is given. The scheme ensures the closed-loop systems exponentially practically stable and can be used in practical engineering. Finally, simulations show that the control scheme is effective", "fulltext": "", "keywords": "closed-loop systems;large scale systems;uncertain dynamic systems;adaptive decentralized stabilization;robust control"}
{"name": "train_190", "title": "On the design of gain-scheduled trajectory tracking controllers [AUV", "abstract": "application] A new methodology is proposed for the design of trajectory tracking controllers for autonomous vehicles. The design technique builds on gain scheduling control theory. An application is made to the design of a trajectory tracking controller for a prototype autonomous underwater vehicle (AUV). The effectiveness and advantages of the new control laws derived are illustrated in simulation using a full set of non-linear equations of motion of the vehicle", "fulltext": "", "keywords": "nonlinear equations of motion;control laws;gain scheduling control theory;gain-scheduled trajectory tracking controller design;autonomous underwater vehicle;autonomous vehicles"}
{"name": "train_1900", "title": "Robust L/sub 2/ disturbance attenuation for nonlinear systems with input", "abstract": "dynamical uncertainty Deals with the problem of robust L/sub 2/ disturbance attenuation for nonlinear systems with input dynamical uncertainty. The input dynamical uncertainty is restricted to be minimum-phase and relative degree zero. A sufficient condition. is given such that the nonlinear system satisfies the L/sub 2/ gain performance and input-to-state stable property. Using this condition, a design approach is given for a smooth state feedback control law that solves the robust L/sub 2/ disturbance attenuation problem, and the approach is extended to a more general case where the nominal system has higher relative degree. Finally, a numerical example is given to demonstrate the proposed approach", "fulltext": "", "keywords": "nominal system;sufficient condition;smooth state feedback control law;robust l/sub 2/ disturbance attenuation;design approach;input-to-state stable property;robust control;nonlinear systems;input dynamical uncertainty;l/sub 2/ gain performance"}
{"name": "train_1901", "title": "FC++: Functional tools for object-oriented tasks", "abstract": "FC++ is a library for programming functionally in C++. Compared to other C++ functional programming libraries, FC++ is distinguished by its powerful type system which allows the manipulation of parametrically polymorphic functions (e.g., passing them as arguments to other functions and returning them as results). In this paper, we show how FC++ can be used in common object-oriented programming tasks. We demonstrate FC++ implementations of several common design patterns (Adapter, Builder, Command, and more). Compared to conventional C++ implementations of these patterns, our implementations are either simpler (in that fewer classes/dependencies are needed), more efficient, or more type-safe (thanks to parametric polymorphism and type inference)", "fulltext": "", "keywords": "functional programming;c++;parametric polymorphism;library;object-oriented programming;fc++"}
{"name": "train_1902", "title": "Engineering plug-in software components to support collaborative work", "abstract": "Many software applications require co-operative work support, including collaborative editing, group awareness, versioning, messaging and automated notification and co-ordination agents. Most approaches hard-code such facilities into applications, with fixed functionality and limited ability to reuse groupware implementations. We describe our recent work in seamlessly adding such capabilities to component-based applications via a set of collaborative work-supporting plug-in software components. We describe a variety of applications of this technique, along with descriptions of the novel architecture, user interface adaptation and implementation techniques for the collaborative work-supporting components that we have developed. We report on our experiences to date with this method of supporting collaborative work enhancement of component-based systems, and discuss the advantages of our approach over conventional techniques", "fulltext": "", "keywords": "co-operative work support;collaborative work tools;plug-in software components;collaborative editing;versioning;automated notification;groupware;software applications;group awareness;messaging"}
{"name": "train_1903", "title": "The BLISS programming language: a history", "abstract": "The BLISS programming language was invented by William A. Wulf and others at Carnegie-Mellon University in 1969, originally for the DEC PDP-10. BLISS-10 caught the interest of Ronald F. Brender of DEC (Digital Equipment Corporation). After several years of collaboration, including the creation of BLISS-11 for the PDP-11, BLISS was adopted as DEC's implementation language for use on its new line of VAX computers in 1975. DEC developed a completely new generation of BLISSs for the VAX, PDP-10 and PDP-11, which became widely used at DEC during the 1970s and 1980s. With the creation of the Alpha architecture in the early 1990s, BLISS was extended again, in both 32- and 64-bit flavors. BLISS support for the Intel IA-32 architecture was introduced in 1995 and IA-64 support is now in progress. BLISS has a number of unusual characteristics: it is typeless, requires use of an explicit contents of operator (written as a period or 'dot'), takes an algorithmic approach to data structure definition, has no goto, is an expression language, and has an unusually rich compile-time language. This paper reviews the evolution and use of BLISS over its three decade lifetime. Emphasis is on how the language evolved to facilitate portable programming while retaining its initial highly machine-specific character. Finally, the success of its characteristics are assessed", "fulltext": "", "keywords": "system implementation language;machine-oriented language;compile-time language;data structure definition;bliss programming language;portable programming"}
{"name": "train_1904", "title": "Component support in PLT scheme", "abstract": "PLT Scheme (DrScheme and MzScheme) supports the Component Object Model (COM) standard with two pieces of software. The first piece is MzCOM, a COM class that makes a Scheme evaluator available to COM clients. With MzCOM, programmers can embed Scheme code in programs written in mainstream languages such as C++ or Visual BASIC. Some applications can also be used as MzCOM clients. The other piece of component-support software is MysterX, which makes COM classes available to PLT Scheme programs. When needed, MysterX uses a programmable Web browser to display COM objects. We describe the technical issues encountered in building these two systems and sketch some applications", "fulltext": "", "keywords": "mzcom;web browser;reuse;plt scheme;component object model"}
{"name": "train_1905", "title": "Tool and process improvements from MFC control system technology", "abstract": "A new approach to MFC calibration links the physical parameters of nitrogen to the physical characteristics of various process gases. This precludes the conventional need for surrogate gases. What results is a physics-based tuning algorithm and enhanced digital control system that enables rearranging and gas change of digital MFCs. The end result should be better process control through more accurate gas flow. The new method also decreases the number of MFC spare parts required to back up a fab", "fulltext": "", "keywords": "process control;tuning algorithm;digital control;calibration;tool technology;mfc control system technology;process gas;semiconductor fab;n/sub 2/;gas flow;mass flow controller;surrogate gas"}
{"name": "train_1906", "title": "Integrated process control using an in situ sensor for etch", "abstract": "The migration to tighter geometries and more complex process sequence integration schemes requires having the ability to compensate for upstream deviations from target specifications. Doing so ensures that-downstream process sequences operate on work-in-progress that is well within control. Because point-of-use visibility of work-in-progress quality has become of paramount concern in the industry's drive to reduce scrap and improve yield, controlling trench depth has assumed greater importance. An integrated, interferometric based, rate monitor for etch-to-depth and spacer etch applications has been developed for controlling this parameter. This article demonstrates that the integrated rate monitor, using polarization and digital signal processing, enhances control etch-to-depth processes and can also be implemented as a predictive endpoint in a wafer manufacturing environment for dual damascene trench etch and spacer etch applications", "fulltext": "", "keywords": "complex process sequence integration schemes;upstream deviation compensation;point-of-use visibility;digital signal processing;interferometry;interferometric in situ etch sensor;downstream process sequences;wafer manufacturing environment;work-in-progress quality;yield improvement;scrap reduction;target specifications;integrated process control;ic geometry;spacer etch applications;dual damascene trench etch;process predictive endpoint;integrated etch rate monitor;polarization;trench depth control"}
{"name": "train_1907", "title": "Multiple comparison methods for means", "abstract": "Multiple comparison methods (MCMs) are used to investigate differences between pairs of population means or, more generally, between subsets of population means using sample data. Although several such methods are commonly available in statistical software packages, users may be poorly informed about the appropriate method(s) to use and/or the correct way to interpret the results. This paper classifies the MCMs and presents the important methods for each class. Both simulated and real data are used to compare the methods, and emphasis is placed on a correct application and interpretation. We include suggestions for choosing the best method. Mathematica programs developed by the authors are used to compare MCMs. By taking the advantage of Mathematica's notebook structure, all interested student can use these programs to explore the subject more deeply", "fulltext": "", "keywords": "error rate;single-step procedures;step-down procedures;sales management;population means;multiple comparison procedures;pack-age design"}
{"name": "train_1908", "title": "Explicit solutions for transcendental equations", "abstract": "A simple method to formulate an explicit expression for the roots of any analytic transcendental function is presented. The method is based on Cauchy's integral theorem and uses only basic concepts of complex integration. A convenient method for numerically evaluating the exact expression is presented. The application of both the formulation and evaluation of the exact expression is illustrated for several classical root finding problems", "fulltext": "", "keywords": "transcendental equations;complex integration;singularity;analytic functions;cauchy integral theorem;polynomial;fourier transform;root finding"}
{"name": "train_1909", "title": "Breast MR imaging with high spectral and spatial resolutions: preliminary", "abstract": "experience The authors evaluated magnetic resonance (MR) imaging with high spectral and spatial resolutions (HSSR) of water and fat in breasts of healthy volunteers (n=6) and women with suspicious lesions (n=6). Fat suppression, edge delineation, and image texture were improved on MR images derived from HSSR data compared with those on conventional MR images. HSSR MR imaging data acquired before and after contrast medium injection showed spectrally inhomogeneous changes in the water resonances in small voxels that were not detectable with conventional MR imaging", "fulltext": "", "keywords": "women;small voxels;image texture;magnetic resonance imaging data;suspicious lesions;high spectral spatial resolutions;edge delineation;magnetic resonance images;breast magnetic resonance imaging;contrast medium injection;fat suppression;healthy volunteers;water resonances"}
{"name": "train_191", "title": "Linear, parameter-varying control and its application to a turbofan engine", "abstract": "This paper describes application of parameter-dependent control design methods to a turbofan engine. Parameter-dependent systems are linear systems, whose state-space descriptions are known functions of time-varying parameters. The time variation of each of the parameters is not known in advance, but is assumed to be measurable in real-time. Three linear, parameter-varying (LPV) approaches to control design are discussed. The first method is based on linear fractional transformations which relies on the small gain theorem for bounds on performance and robustness. The other methods make use of either a single (SQLF) or parameter-dependent (PDQLF) quadratic Lyapunov function to bound the achievable level of performance. The latter two techniques are used to synthesize controllers for a high-performance turbofan engine. A LPV model of the turbofan engine is constructed from Jacobian linearizations at fixed power codes for control design. The control problem is formulated as a model matching problem in the H/sub infinity / and LPV framework. The objective is decoupled command response of the closed-loop system to pressure and rotor speed requests. The performance of linear, H/sub infinity / point designs are compared with the SQLF and PDQLF controllers. Nonlinear simulations indicate that the controller synthesized using the SQLF approach is slightly more conservative than the PDQLF controller. Nonlinear simulations with the SQLF and PDQLF controllers show very robust designs that achieve all desired performance objectives", "fulltext": "", "keywords": "h/sub infinity / framework;nonlinear simulations;closed-loop system;parameter-dependent quadratic lyapunov function;small gain theorem;decoupled command response;state-space descriptions;model matching problem;linear parameter-varying control;turbofan engine;robustness bounds;parameter-dependent control design methods;time-varying parameters;linear fractional transformations;single quadratic lyapunov function;jacobian linearizations;very robust designs;performance bounds"}
{"name": "train_1910", "title": "Breast cancer: effectiveness of computer-aided diagnosis-observer study with", "abstract": "independent database of mammograms Evaluates the effectiveness of a computerized classification method as an aid to radiologists reviewing clinical mammograms for which the diagnoses were unknown to both the radiologists and the computer. Six mammographers and six community radiologists participated in an observer study. These 12 radiologists interpreted, with and without the computer aid, 110 cases that were unknown to both the 12 radiologist observers and the trained computer classification scheme. The radiologists' performances in differentiating between benign and malignant masses without and with the computer aid were evaluated with receiver operating characteristic (ROC) analysis. Two-tailed P values were calculated for the Student t test to indicate the statistical significance of the differences in performances with and without the computer aid. When the computer aid was used, the average performance of the 12 radiologists improved, as indicated by an increase in the area under the ROC curve (A/sub z/) from 0.93 to 0.96 (P<.001), by an increase in partial area under the ROC curve (/sub 0.9/0A'/sub z/) from 0.56 to 0.72 (P<.001), and by an increase in sensitivity from 94% to 98% (P=.022). No statistically significant difference in specificity was found between readings with and those without computer aid ( Delta +-0.014; P=.46; 95% Cl: -0.054, 0.026), where Delta is difference in specificity. When we analyzed results from the mammographers and community radiologists as separate groups, a larger improvement was demonstrated for the community radiologists. Computer-aided diagnosis can potentially help radiologists improve their diagnostic accuracy in the task of differentiating between benign and malignant masses seen on mammograms", "fulltext": "", "keywords": "performances;community radiologists;statistical significance;two-tailed p values;student t test;mammographers;trained computer classification scheme;breast cancer;malignant masses;computer-aided diagnosis;diagnostic accuracy;radiologist observers;benign masses;average performance;clinical mammograms;receiver operating characteristic curve;receiver operating characteristic analysis;observer study;independent database;computerized classification method;computer aid"}
{"name": "train_1911", "title": "Pulmonary perfusion patterns and pulmonary arterial pressure", "abstract": "Uses artificial intelligence methods to determine whether quantitative parameters describing the perfusion image can be synthesized to make a reasonable estimate of the pulmonary arterial (PA) pressure measured at angiography. Radionuclide perfusion images were obtained in 120 patients with normal chest radiographs who also underwent angiographic PA pressure measurement within 3 days of the radionuclide study. An artificial neural network (ANN) was constructed from several image parameters describing statistical and boundary characteristics of the perfusion images. With use of a leave-one-out cross-validation technique, this method was used to predict the PA systolic pressure in cases on which the ANN had not been trained. A Pearson correlation coefficient was determined between the predicted and measured PA systolic pressures. ANN predictions correlated with measured pulmonary systolic pressures (r=0.846, P<.001). The accuracy of the predictions was not influenced by the presence of pulmonary embolism. None of the 51 patients with predicted PA pressures of less than 29 mm Hg had pulmonary hypertension at angiography. All 13 patients with predicted PA pressures greater than 48 mm Hg had pulmonary hypertension at angiography. Meaningful information regarding PA pressure can be derived from noninvasive radionuclide perfusion scanning. The use of image analysis in concert with artificial intelligence methods helps to reveal physiologic information not readily apparent at visual image inspection", "fulltext": "", "keywords": "48 pa;normal chest radiographs;quantitative parameters;statistical characteristics;boundary characteristics;physiologic information;29 pa;radionuclide perfusion images;pulmonary perfusion patterns;accuracy;leave-one-out cross-validation technique;visual image inspection;pearson correlation coefficient;image parameters;artificial intelligence methods;perfusion image;noninvasive radionuclide perfusion scanning;image analysis;angiography;pulmonary embolism;angiographic pulmonary arterial pressure measurement;artificial neural network predictions;pulmonary arterial systolic pressure;pulmonary hypertension;patients"}
{"name": "train_1912", "title": "A novel preterm respiratory mechanics active simulator to test the performances", "abstract": "of neonatal pulmonary ventilators A patient active simulator is proposed which is capable of reproducing values of the parameters of pulmonary mechanics of healthy newborns and preterm pathological infants. The implemented prototype is able to: (a) let the operator choose the respiratory pattern, times of apnea, episodes of cough, sobs, etc., (b) continuously regulate and control the parameters characterizing the pulmonary system; and, finally, (c) reproduce the attempt of breathing of a preterm infant. Taking into account both the limitation due to the chosen application field and the preliminary autocalibration phase automatically carried out by the proposed device, accuracy and reliability on the order of 1% is estimated. The previously indicated value has to be considered satisfactory in light of the field of application and the small values of the simulated parameters. Finally, the achieved metrological characteristics allow the described neonatal simulator to be adopted as a reference device to test performances of neonatal ventilators and, more specifically, to measure the time elapsed between the occurrence of a potentially dangerous condition to the patient and the activation of the corresponding alarm of the tested ventilator", "fulltext": "", "keywords": "pressure transducer;pneumatic/mechanical unit;accuracy;ventilatory support;healthy newborns;intensive care equipment;double compartment model;neonatal pulmonary ventilators;artificial trachea;preterm pathological infants;upper airway resistance;patient active simulator;electronic unit;apnea times;variable clamp resistance;respiratory diseases;compliance;software control;preterm respiratory mechanics active simulator;autocalibration phase;reliability"}
{"name": "train_1913", "title": "A six-degree-of-freedom precision motion stage", "abstract": "This article presents the design and performance evaluation of a six-degree-of-freedom piezoelectrically actuated fine motion stage that will be used for three dimensional error compensation of a long-range translation mechanism. Development of a single element, piezoelectric linear displacement actuator capable of translations of 1.67 mu m with 900 V potential across the electrodes and under a 27.4 N axial load and 0.5 mm lateral distortion is presented. Finite element methods have been developed and used to evaluate resonant frequencies of the stage platform and the complete assembly with and without a platform payload. In general, an error of approximately 10.0% between the finite element results and the experimentally measured values were observed. The complete fine motion stage provided approximately +or-0.93 mu m of translation and +or-38.0 mu rad of rotation in all three planes of motion using an excitation range of 1000 V. An impulse response indicating a fundamental mode resonance at 162 Hz was measured with a 0.650 kg payload rigidly mounted to the top of the stage", "fulltext": "", "keywords": "single element piezoelectric linear displacement actuator;platform payload;650.0 gm;finite element methods;162 hz;1.67 micron;0.93 to -0.93 micron;1000 v;3d error compensation;performance evaluation;long-range translation mechanism;fundamental mode resonance;impulse response;design;stage platform;resonant frequency;piezoelectrically actuated fine motion stage;six-degree-of-freedom precision motion stage;900 v"}
{"name": "train_1914", "title": "Vacuum-compatible vibration isolation stack for an interferometric", "abstract": "gravitational wave detector TAMA300 Interferometric gravitational wave detectors require a large degree of vibration isolation. For this purpose, a multilayer stack constructed of rubber and metal blocks is suitable, because it provides isolation in all degrees of freedom at once. In TAMA300, a 300 m interferometer in Japan, long-term dimensional stability and compatibility with an ultrahigh vacuum environment of about 10/sup -6/ Pa are also required. To keep the interferometer at its operating point despite ground strain and thermal drift of the isolation system, a thermal actuator was introduced. To prevent the high outgassing rate of the rubber from spoiling the vacuum, the rubber blocks were enclosed by gas-tight bellows. Using these techniques, we have successfully developed a three-layer stack which has a vibration isolation ratio of more than 10/sup 3/ at 300 Hz with control of drift and enough vacuum compatibility", "fulltext": "", "keywords": "gas-tight bellows;metal blocks;ground strain;interferometric gravitational wave detectors;vibration isolation stack;300 m;thermal actuator;ultrahigh vacuum environment;long-term dimensional stability;thermal drift;10/sup -6/ pa;rubber blocks;rubber outgassing;multilayer stack;300 hz;operating point;tama300 interferometer;vacuum compatibility"}
{"name": "train_1915", "title": "Multichannel scaler for general statistical analysis of dynamic light", "abstract": "scattering A four channel scaler for counting applications has been designed and built using a standard high transfer rate parallel computer interface bus parallel data card. The counter section is based on standard complex programmable logic device integrated circuits. With a 200 MHz Pentium based host PC a sustained counting and data transfer with channel widths as short as 200 ns for a single channel is realized. The use of the multichannel scaler is demonstrated in dynamic light scattering experiments. The recorded traces are analyzed with wavelet and other statistical techniques to obtain transient changes in the properties of the scattered light", "fulltext": "", "keywords": "dynamic light scattering;pentium based host pc;standard high transfer rate parallel computer interface;optical spectroscopic techniques;200 mhz;correlation spectroscopy;200 ns;interface bus parallel data card;photon signal statistical properties;complex programmable logic device;standard cpld ics;windowed fourier transform;general statistical analysis;four channel scaler;multichannel scaler"}
{"name": "train_1916", "title": "Changes in the entropy and the Tsallis difference information during", "abstract": "spontaneous decay and self-organization of nonextensive systems A theoretical-information description of self-organization processes during stimulated transitions between stationary states of open nonextensive systems is presented. S/sub q/- and I/sub q/-theorems on changes of the entropy and Tsallis difference information measures in the process of evolution in the space of control parameters are proved. The entropy and the Tsallis difference information are derived and their new extreme properties are discussed", "fulltext": "", "keywords": "tsallis difference information;control parameters;nonextensive statistical mechanics;stimulated transitions;information measures;spontaneous decay;entropy;nonextensive systems;self-organization"}
{"name": "train_1917", "title": "Design and modeling of an interval-based ABR flow control protocol", "abstract": "A novel flow control protocol is presented for availability bit rate (ABR) service in asynchronous transfer mode (ATM) networks. This scheme features periodic explicit rate feedback that enables precise allocation of link bandwidth and buffer space on a hop-by-hop basis to guarantee maximum throughput, minimum cell loss, and high resource efficiency. With the inclusion of resource management cell synchronization and consolidation algorithms, this protocol is capable of controlling point-to-multipoint ABR services within a unified framework. The authors illustrate the modeling of single ABR connection, the interaction between multiple ABR connections, and the constraints applicable to flow control decisions. A loss-free flow control mechanism is presented for high-speed ABR connections using a fluid traffic model. Supporting algorithms and ATM signaling procedures are specified, in company with linear system modeling, numerical analysis, and simulation results, which demonstrate its performance and cost benefits in high-speed backbone networking scenarios", "fulltext": "", "keywords": "linear system modeling;buffer space allocation;periodic explicit rate feedback;design;signaling;high-speed backbone networking scenarios;atm networks;maximum throughput;resource management cell consolidation algorithms;link bandwidth allocation;high-speed abr connections;point-to-multipoint services;resource management cell synchronization algorithms;availability bit rate service;interval-based abr flow control protocol;high resource efficiency;simulation;minimum cell loss;flow control decisions;numerical analysis;modeling;loss-free flow control mechanism;fluid traffic model"}
{"name": "train_1918", "title": "Negotiating the semantics of agent communication languages", "abstract": "This article presents a formal framework and outlines a method that autonomous agents can use to negotiate the semantics of their communication language at run-time. Such an ability is needed in open multi-agent systems so that agents can ensure they understand the implications of the utterances that are being made and so that they can tailor the meaning of the primitives to best fit their prevailing circumstances. To this end, the semantic space framework provides a systematic means of classifying the primitives along multiple relevant dimensions. This classification can then be used by the agents to structure their negotiation (or semantic fixing) process so that they converge to the mutually agreeable semantics that are necessary for coherent social interactions", "fulltext": "", "keywords": "multi-agent systems;semantic space;communication language;autonomous agents;semantic fixing;social interactions"}
{"name": "train_1919", "title": "Toward a formalism for conversation protocols using joint intention theory", "abstract": "Conversation protocols are used to achieve certain goals or to bring about certain states in the world. Therefore, one may identify the landmarks or the states that must be brought about during the goal-directed execution of a protocol. Accordingly, the landmarks, characterized by propositions that are true in the state represented by that landmark, are the most important aspect of a protocol. Families of conversation protocols can be expressed formally as partially ordered landmarks after the landmarks necessary to achieve a goal have been identified. Concrete protocols represented as joint action expressions can, then, be derived from the partially ordered landmarks and executed directly by joint intention interpreters. This approach of applying Joint Intention theory to protocols also supports flexibility in the actions used to get to landmarks, shortcutting protocol execution, automatic exception handling, and correctness criterion for protocols and protocol compositions", "fulltext": "", "keywords": "finite state machines;automatic exception handling;conversation protocols;protocol execution;multi-agent interactions;correctness criterion"}
{"name": "train_192", "title": "New Jersey African American women writers and their publications: a study of", "abstract": "identification from written and oral sources This study examines the use of written sources, and personal interviews and informal conversations with individuals from New Jersey's religious, political, and educational community to identify African American women writers in New Jersey and their intellectual output. The focus on recognizing the community as an oral repository of history and then tapping these oral sources for collection development and acquisition purposes is supported by empirical and qualitative evidence. Findings indicate that written sources are so limited that information professionals must rely on oral sources to uncover local writers and their publications", "fulltext": "", "keywords": "new jersey african american women writers;written sources;informal conversations;local writers;intellectual output;special collections;personal interviews;collection development;history;oral repository"}
{"name": "train_1920", "title": "To commit or not to commit: modeling agent conversations for action", "abstract": "Conversations are sequences of messages exchanged among interacting agents. For conversations to be meaningful, agents ought to follow commonly known specifications limiting the types of messages that can be exchanged at any point in the conversation. These specifications are usually implemented using conversation policies (which are rules of inference) or conversation protocols (which are predefined conversation templates). In this article we present a semantic model for specifying conversations using conversation policies. This model is based on the principles that the negotiation and uptake of shared social commitments entail the adoption of obligations to action, which indicate the actions that agents have agreed to perform. In the same way, obligations are retracted based on the negotiation to discharge their corresponding shared social commitments. Based on these principles, conversations are specified as interaction specifications that model the ideal sequencing of agent participations negotiating the execution of actions in a joint activity. These specifications not only specify the adoption and discharge of shared commitments and obligations during an activity, but also indicate the commitments and obligations that are required (as preconditions) or that outlive a joint activity (as postconditions). We model the Contract Net Protocol as an example of the specification of conversations in a joint activity", "fulltext": "", "keywords": "social commitments;rules of inference;speech acts;conversation protocols;conversation templates;autonomous agents;specifications;interacting agents;software agents"}
{"name": "train_1921", "title": "An ACL for a dynamic system of agents", "abstract": "In this article we present the design of an ACL for a dynamic system of agents. The ACL includes a set of conversation performatives extended with operations to register, create, and terminate agents. The main design goal at the agent-level is to provide only knowledge-level primitives that are well integrated with the dynamic nature of the system. This goal has been achieved by defining an anonymous interaction protocol which enables agents to request and supply knowledge without considering symbol-level issues concerning management of agent names, routing, and agent reachability. This anonymous interaction protocol exploits a distributed facilitator schema which is hidden at the agent-level and provides mechanisms for registering capabilities of agents and delivering requests according to the competence of agents. We present a formal specification of the ACL and of the underlying architecture, exploiting an algebra of actors, and illustrate it with the help of a graphical notation. This approach provides the basis for discussing dynamic primitives in ACL and for studying properties of dynamic multi agent systems, for example concerning the behavior of agents and the correctness of their conversation policies", "fulltext": "", "keywords": "agents;actors;anonymous interaction protocol;acl;dynamic system;agent communication languages;dynamic system of agents;distributed facilitator;system of agents"}
{"name": "train_1922", "title": "Trends in agent communication language", "abstract": "Agent technology is an exciting and important new way to create complex software systems. Agents blend many of the traditional properties of AI programs - knowledge-level reasoning, flexibility, proactiveness, goal-directedness, and so forth - with insights gained from distributed software engineering, machine learning, negotiation and teamwork theory, and the social sciences. An important part of the agent approach is the principle that agents (like humans) can function more effectively in groups that are characterized by cooperation and division of labor. Agent programs are designed to autonomously collaborate with each other in order to satisfy both their internal goals and the shared external demands generated by virtue of their participation in agent societies. This type of collaboration depends on a sophisticated system of inter-agent communication. The assumption that inter-agent communication is best handled through the explicit use of an agent communication language (ACL) underlies each of the articles in this special issue. In this introductory article, we will supply a brief background and introduction to the main topics in agent communication", "fulltext": "", "keywords": "teamwork;semantics;agent communication language;agent societies;conversations;distributed software engineering;negotiation;social sciences;machine learning;agent technology;ai programs;kqml;inter-agent communication"}
{"name": "train_1923", "title": "Predictive control of a high temperature-short time pasteurisation process", "abstract": "Modifications on the dynamic matrix control (DMC) algorithm are presented to deal with transfer functions with varying parameters in order to control a high temperature-short time pasteurisation process. To control processes with first order with pure time delay models whose parameters present an exogenous variable dependence, a new method of free response calculation, using multiple model information, is developed. Two methods, to cope with those nonlinear models that allow a generalised Hammerstein model description, are proposed. The proposed methods have been tested, both in simulation and in real cases, in comparison with PID and DMC classic controllers, showing important improvements on reference tracking and disturbance rejection", "fulltext": "", "keywords": "free response calculation;time delay models;disturbance rejection;nonlinear models;generalised hammerstein model description;predictive control;exogenous variable dependence;multiple model information;dynamic matrix control algorithm;high temperature-short time pasteurisation process;first order processes;reference tracking;transfer functions"}
{"name": "train_1924", "title": "Existence theorems for nonconvex problems of variational calculus", "abstract": "A solution to a variational calculus problem is studied under the conditions of integrant convexity. The existence theorem is proved. As an example, a function is given, which satisfies all the conditions of the theorem but is not convex", "fulltext": "", "keywords": "nonconvex problems;variational calculus;integrant convexity;existence theorems"}
{"name": "train_1925", "title": "On the accuracy of polynomial interpolation in Hilbert space with disturbed", "abstract": "nodal values of the operator The interpolation accuracy of polynomial operators in a Hilbert space with a measure is estimated when nodal values of these operators are given approximately", "fulltext": "", "keywords": "polynomial interpolation;hilbert space;polynomial operators;disturbed nodal values"}
{"name": "train_1926", "title": "Simulation of ecological and economical structural-type functions", "abstract": "An optimization approach to the simulation of ecological and economical structural-type functions is proposed. A methodology for construction of such functions is created in an explicit analytical form", "fulltext": "", "keywords": "simulation;optimisation approach;explicit analytical form;economical structural-type functions"}
{"name": "train_1927", "title": "Optimal strategies for a semi-Markovian inventory system", "abstract": "Control for a semi-Markovian inventory system is considered. Under general assumptions on system functioning, conditions for existence of an optimal nonrandomized Markovian strategy are found. It is shown that under some additional assumptions on storing conditions for the inventory, the optimal strategy has a threshold (s, S)-frame", "fulltext": "", "keywords": "semi-markovian inventory system;optimal nonrandomized markovian strategy;optimal strategy;optimal strategies;system functioning"}
{"name": "train_1928", "title": "Solution of a Euclidean combinatorial optimization problem by the", "abstract": "dynamic-programming method A class of Euclidean combinatorial optimization problems is selected that can be solved by the dynamic programming method. The problem of allocation of servicing enterprises is solved as an example", "fulltext": "", "keywords": "dynamic programming method;euclidean combinatorial optimization problem"}
{"name": "train_1929", "title": "Optimal time of switching between portfolios of securities", "abstract": "Optimal time of switching between several portfolios of securities are found for the purpose of profit maximization. Two methods of their determination are considered. The cases with three and n portfolios are studied in detail", "fulltext": "", "keywords": "profit maximization;portfolios of securities;optimal time"}
{"name": "train_538", "title": "Polarization of the RF field in a human head at high field: a study with a", "abstract": "quadrature surface coil at 7.0 T The RF field intensity distribution in the human brain becomes inhomogeneous due to wave behavior at high field. This is further complicated by the spatial distribution of RF field polarization that must be considered to predict image intensity distribution. An additional layer of complexity is involved when a quadrature coil is used for transmission and reception. To study such complicated RF field behavior, a computer modeling method was employed to investigate the RF field of a quadrature surface coil at 300 MHz. Theoretical and experimental results for a phantom and the human head at 7.0 T are presented. The results are theoretically important and practically useful for high-field quadrature coil design and application", "fulltext": "", "keywords": "human brain;whole-body mri;reception fields;quadrature surface coil;phantom samples;7.0 t;high field mri;finite difference time domain method;segmented images;spatial distribution;transmission fields;rf field intensity distribution;high-field coil design;computer modeling;gradient echo images;300 mhz;image intensity distribution;3d multitissue head model;rf field polarization;maxwell wave equations"}
{"name": "train_539", "title": "Perfusion quantification using Gaussian process deconvolution", "abstract": "The quantification of perfusion using dynamic susceptibility contrast MRI (DSC-MRI) requires deconvolution to obtain the residual impulse response function (IRF). In this work, a method using the Gaussian process for deconvolution (GPD) is proposed. The fact that the IRF is smooth is incorporated as a constraint in the method. The GPD method, which automatically estimates the noise level in each voxel, has the advantage that model parameters are optimized automatically. The GPD is compared to singular value decomposition (SVD) using a common threshold for the singular values, and to SVD using a threshold optimized according to the noise level in each voxel. The comparison is carried out using artificial data as well as data from healthy volunteers. It is shown that GPD is comparable to SVD with a variable optimized threshold when determining the maximum of the IRF, which is directly related to the perfusion. GPD provides a better estimate of the entire IRF. As the signal-to-noise ratio (SNR) increases or the time resolution of the measurements increases, GPD is shown to be superior to SVD. This is also found for large distribution volumes", "fulltext": "", "keywords": "perfusion quantification;gaussian process deconvolution;residual impulse response function;likelihood function;singular value decomposition;mean transit time;capillary blood flow;correlation length;dynamic susceptibility contrast mri;noise level;optimized joint gaussian distribution;optimized model parameters"}
{"name": "train_54", "title": "Controls help harmonic spray do OK removing residues", "abstract": "Looks at how innovative wafer-cleaning equipment hit the market in a timely fashion thanks in part to controls maker Rockwell Automation", "fulltext": "", "keywords": "rockwell automation;residues removal;allen-bradley 1336 plus ii variable frequency ac drives;wafer-cleaning equipment;harmonic spray;allen-bradley controllogix automation control platform;motion control;psi machine"}
{"name": "train_540", "title": "Ventilation-perfusion ratio of signal intensity in human lung using", "abstract": "oxygen-enhanced and arterial spin labeling techniques This study investigates the distribution of ventilation-perfusion (V/Q) signal intensity (SI) ratios using oxygen-enhanced and arterial spin labeling (ASL) techniques in the lungs of 10 healthy volunteers. Ventilation and perfusion images were simultaneously acquired using the flow-sensitive alternating inversion recovery (FAIR) method as volunteers alternately inhaled room air and 100% oxygen. Images of the T/sub 1/ distribution were calculated for five volunteers for both selective (T/sub 1f/) and nonselective (T/sub 1/) inversion. The average T/sub 1/ was 1360 ms+or-116 ms, and the average T/sub 1f/ was 1012 ms+or-112 ms, yielding a difference that is statistically significant (P<0.002). Excluding large pulmonary vessels, the average V/Q SI ratios were 0.355+or-0.073 for the left lung and 0.371+or-0.093 for the right lung, which are in agreement with the theoretical V/Q SI ratio. Plots of the WO SI ratio are similar to the logarithmic normal distribution obtained by multiple inert gas elimination techniques, with a range of ratios matching ventilation and perfusion. This MRI V/Q technique is completely noninvasive and does not involve ionized radiation. A limitation of this method is the nonsimultaneous acquisition of perfusion and ventilation data, with oxygen administered only for the ventilation data", "fulltext": "", "keywords": "multiple inert gas elimination;oxygen-enhanced techniques;ventilation-perfusion ratio;time delay;gas exchange efficiency;logarithmic normal distribution;mri;ventilation images;chronic obstructive pulmonary disease;pixel-by-pixel maps;pulmonary embolism;arterial spin labeling techniques;perfusion images;flow-sensitive alternating inversion recovery;nonsimultaneous acquisition;pathomechanisms;signal intensity;human lung"}
{"name": "train_541", "title": "Virtual-reality-based multidimensional therapy for the treatment of body image", "abstract": "disturbances in binge eating disorders: a preliminary controlled study The main goal of this paper is to preliminarily evaluate the efficacy of a virtual-reality (VR)-based multidimensional approach in the treatment of body image attitudes and related constructs. The female binge eating disorder (BED) patients (n=20), involved in a residential weight control treatment including low-calorie diet (1200 cal/day) and physical training, were randomly assigned either to the multidimensional VR treatment or to psychonutritional groups based on the cognitive-behavior approach. Patients were administered a battery of outcome measures assessing eating disorders symptomathology, attitudes toward food, body dissatisfaction, level of anxiety, motivation for change, level of assertiveness, and general psychiatric symptoms. In the short term, the VR treatment was more effective than the traditional cognitive-behavioral psychonutritional groups in improving the overall psychological state of the patients. In particular, the therapy was more effective in improving body satisfaction, self-efficacy, and motivation for change. No significant differences were found in the reduction of the binge eating behavior. The possibility of inducing a significant change in body image and its associated behaviors using a VR-based short-term therapy can be useful to improve the body satisfaction in traditional weight reduction programs. However, given the nature of this research that does not include a followup study, the obtained results are preliminary only", "fulltext": "", "keywords": "obesity;virtual reality;body image disturbances;multidimensional therapy;psychiatric symptoms;psychonutritional groups;anxiety;cognitive-behavior approach;residential weight control treatment;binge eating disorders;patient therapy"}
{"name": "train_542", "title": "The treatment of fear of flying: a controlled study of imaginal and virtual", "abstract": "reality graded exposure therapy The goal of this study was to determine if virtual reality graded exposure therapy (VRGET) was equally efficacious, more efficacious, or less efficacious, than imaginal exposure therapy in the treatment of fear of flying. Thirty participants (Age=39.8+or-9.7) with confirmed DSM-IV diagnosis of specific phobia fear of flying were randomly assigned to one of three groups: VRGET with no physiological feedback (VRGETno), VRGET with physiological feedback (VRGETpm), or systematic desensitization with imaginal exposure therapy (IET). Eight sessions were conducted once a week. During each session, physiology was measured to give an objective measurement of improvement over the course of exposure therapy. In addition, self-report questionnaires, subjective ratings of anxiety (SUDs), and behavioral observations (included here as flying behavior before beginning treatment and at a three-month posttreatment followup) were included. In the analysis of results, the Chi-square test of behavioral observations based on a three-month posttreatment followup revealed a statistically significant difference in flying behavior between the groups [ chi /sup 2/(4)=19.41, p<0.001]. Only one participant (10%) who received IET, eight of the ten participants (80%) who received VRGETno, and ten out of the ten participants (100%) who received VRGETpm reported an ability to fly without medication or alcohol at three-month followup. Although this study included small sample sizes for the three groups, the results showed VRGET was more effective than IET in the treatment of flying. It also suggests that physiological feedback may add to the efficacy of VR treatment", "fulltext": "", "keywords": "chi-square test;flying fear;phobia;virtual reality graded exposure therapy;physiological feedback;patient treatment;behavioral observations;imaginal exposure therapy;physiology;questionnaires;subjective ratings of anxiety"}
{"name": "train_543", "title": "The development of virtual reality therapy (VRT) system for the treatment of", "abstract": "acrophobia and therapeutic case Virtual reality therapy (VRT), based on this sophisticated technology, has been used in the treatment of subjects diagnosed with acrophobia, a disorder that is characterized by marked anxiety upon exposure to heights and avoidance of heights. Conventional VR systems for the treatment of acrophobia have limitations, over-costly devices or somewhat unrealistic graphic scenes. The goal of this study was to develop an inexpensive and more realistic virtual environment (VE) in which to perform exposure therapy for acrophobia. It is based on a personal computer, and a virtual scene of a bunge-jump tower in the middle of a large city. The virtual scenario includes an open lift surrounded by props beside a tower, which allows the patient to feel a sense of heights. The effectiveness of the VE was evaluated through the clinical treatment of a subject who was suffering from the fear of heights. As a result, it was proved that this VR environment was effective and realistic at overcoming acrophobia according not only to the comparison results of a variety of questionnaires before and after treatment but also to the subject's comments that the VE seemed to evoke more fearful feelings than the real situation", "fulltext": "", "keywords": "virtual scene;patient treatment;heights phobia;clinical treatment;exposure therapy;acrophobia treatment;psychotherapy;patient anxiety;therapeutic case;virtual reality therapy system;personal computer;realistic virtual environment"}
{"name": "train_544", "title": "Virtual reality treatment of flying phobia", "abstract": "Flying phobia (FP) might become a very incapacitating and disturbing problem in a person's social, working, and private areas. Psychological interventions based on exposure therapy have proved to be effective, but given the particular nature of this disorder they bear important limitations. Exposure therapy for FP might be excessively costly in terms of time, money, and efforts. Virtual reality (VR) overcomes these difficulties as different significant environments might be created, where the patient can interact with what he or she fears while in a totally safe and protected environment, the therapist's consulting room. This paper intends, on one hand, to show the different scenarios designed by our team for the VR treatment of FP, and on the other, to present the first results supporting the effectiveness of this new tool for the treatment of FP in a multiple baseline study", "fulltext": "", "keywords": "medical virtual reality;anxiety disorders;patient treatment;psychology;exposure therapy;flying phobia;psychological interventions;virtual exposure"}
{"name": "train_545", "title": "Interaction and presence in the clinical relationship: virtual reality (VR) as", "abstract": "communicative medium between patient and therapist The great potential offered by virtual reality (VR) to clinical psychologists derives prevalently from the central role, in psychotherapy, occupied by the imagination and by memory. These two elements, which are fundamental in our life, present absolute and relative limits to the individual potential. Using VR as an advanced imaginal system, an experience that is able to reduce the gap existing between imagination and reality, it is possible to transcend these limits. In this sense, VR can improve the efficacy of a psychological therapy for its capability of reducing the distinction between the computer's reality and the conventional reality. Two are the core characteristics of this synthetic imaginal experience: the perceptual illusion of nonmediation and the possibility of building and sharing a common ground. In this sense, experiencing presence in a clinical virtual environment (VE), such as a shared virtual hospital, requires more than reproduction of the physical features of external reality. It requires the creation and sharing of the cultural web that makes meaningful, and therefore visible, both people and objects populating the environment. The paper outlines a framework for supporting the development and tuning of clinically oriented VR systems", "fulltext": "", "keywords": "psychological therapy;shared virtual hospital;virtual reality;patient-therapist communication;presence;imagination;psychotherapy;clinical psychology;memory;clinical virtual environment"}
{"name": "train_546", "title": "Real-time quasi-2-D inversion of array resistivity logging data using neural", "abstract": "network We present a quasi-2-D real-time inversion algorithm for a modern galvanic array tool via dimensional reduction and neural network simulation. Using reciprocity and superposition, we apply a numerical focusing technique to the unfocused data. The numerically focused data are much less subject to 2-D and layering effects and can be approximated as from a cylindrical 1-D Earth. We then perform 1-D inversion on the focused data to provide approximate information about the 2-D resistivity structure. A neural network is used to perform forward modeling in the 1-D inversion, which is several hundred times faster than conventional numerical forward solutions. Testing our inversion algorithm on both synthetic and field data shows that this fast inversion algorithm is useful for providing formation resistivity information at a well site", "fulltext": "", "keywords": "forward modeling;array resistivity logging data;formation resistivity;unfocused data;superposition;real-time quasi-2-d inversion;neural network;well site;numerical focusing technique;focused data;galvanic array tool;1-d inversion;reciprocity;real-time inversion algorithm;dimensional reduction"}
{"name": "train_547", "title": "Excess energy [cooling system]", "abstract": "The designers retrofitting a comfort cooling system to offices in Hertfordshire have been able to make use of the waste heat rejected. what's more they're now making it a standard solution for much larger projects", "fulltext": "", "keywords": "waste heat;comfort cooling system;air conditioning;nationwide trust"}
{"name": "train_548", "title": "Cool and green [air conditioning]", "abstract": "In these days of global warming, air conditioning engineers need to specify not just for the needs of the occupants, but also to maximise energy efficiency. Julian Brunnock outlines the key areas to consider for energy efficient air conditioning systems", "fulltext": "", "keywords": "energy efficiency;air conditioning"}
{"name": "train_549", "title": "Taking it to the max [ventilation systems]", "abstract": "Raising the volumetric air supply rate is one way of increasing the cooling capacity of displacement ventilation systems. David Butler and Michael Swainson explore how different types of diffusers can help make this work", "fulltext": "", "keywords": "displacement ventilation systems;diffusers;cooling capacity;volumetric air supply rate"}
{"name": "train_55", "title": "Self-testing chips take a load off ATE", "abstract": "Looks at how chipmakers get more life out of automatic test equipment by embedding innovative circuits in silicon", "fulltext": "", "keywords": "innovative circuits;embedded deterministic testing technique;automatic test equipment;design-for-test techniques;ate;self-testing chips"}
{"name": "train_550", "title": "Market watch - air conditioning", "abstract": "After a boom period in the late nineties, the air conditioning market finds itself in something of a lull at present, but manufacturers aren't panicking", "fulltext": "", "keywords": "air conditioning;market"}
{"name": "train_551", "title": "Access privilege management in protection systems", "abstract": "We consider the problem of managing access privileges on protected objects. We associate one or more locks with each object, one lock for each access right defined by the object type. Possession of an access right on a given object is certified by possession of a key for this object, if this key matches one of the object locks. We introduce a number of variants to this basic key-lock technique. Polymorphic access rights make it possible to decrease the number of keys required to certify possession of complex access privileges that are defined in terms of several access rights. Multiple locks on the same access right allow us to exercise forms of selective revocation of access privileges. A lock conversion function can be used to reduce the number of locks associated with any given object to a single lock. The extent of the results obtained is evaluated in relation to alternative methodologies for access privilege management", "fulltext": "", "keywords": "protection systems;protected objects;key-lock technique;locks;selective revocation;lock conversion function;polymorphic access rights;complex access privilege possession certification;access privilege management"}
{"name": "train_552", "title": "Anatomy of the coupling query in a Web warehouse", "abstract": "To populate a data warehouse specifically designed for Web data, i.e. Web warehouse, it is imperative to harness relevant documents from the Web. In this paper, we describe a query mechanism called coupling query to glean relevant Web data in the context of our Web warehousing system called Warehouse Of Web Data (WHOWEDA). A coupling query may be used for querying both HTML and XML documents. Important features of our query mechanism are the ability to query metadata, content, internal and external (hyperlink) structure of Web documents based on partial knowledge, ability to express constraints on tag attributes and tagless segment of data, ability to express conjunctive as well as disjunctive query conditions compactly, ability to control execution of a Web query and preservation of the topological structure of hyperlinked documents in the query results. We also discuss how to formulate a query graphically and in textual form using a coupling graph and coupling text, respectively", "fulltext": "", "keywords": "content;internal structure;partial knowledge;html documents;coupling text;hyperlinked documents;graphical query formulation;web warehouse;execution control;metadata;textual query formulation;tag attributes;web documents;data warehouse;warehouse of web data;xml documents;topological structure;conjunctive query conditions;coupling query;tagless segment;disjunctive query conditions;external structure"}
{"name": "train_553", "title": "Application of traditional system design techniques to Web site design", "abstract": "After several decades of computer program construction there emerged a set of principles that provided guidance to produce more manageable programs. With the emergence of the plethora of Internet web sites one wonders if similar guidelines are followed in their construction. Since this is a new technology no apparent universally accepted methods have emerged to guide the designer in Web site construction. This paper reviews the traditional principles of structured programming and the preferred characteristics of Web sites. Finally a mapping of how the traditional guidelines may be applied to Web site construction is presented. The application of the traditional principles of structured programming to the design of a Web site can provide a more usable site for the visitors to the site. The additional benefit of using these time-honored techniques is the creation of a Web site that will be easier to maintain by the development staff", "fulltext": "", "keywords": "structured programming;system design techniques;internet web site design"}
{"name": "train_554", "title": "A scalable and lightweight QoS monitoring technique combining passive and", "abstract": "active approaches: on the mathematical formulation of CoMPACT monitor To make a scalable and lightweight QoS monitoring system, we (2002) have proposed a new QoS monitoring technique, called the change-of-measure based passive/active monitoring (CoMPACT Monitor), which is based on the change-of-measure framework and is an active measurement transformed by using passively monitored data. This technique enables us to measure detailed QoS information for individual users, applications and organizations, in a scalable and lightweight manner. In this paper, we present the mathematical foundation of CoMPACT Monitor. In addition, we show its characteristics through simulations in terms of typical implementation issues for inferring the delay distributions. The results show that CoMPACT Monitor gives accurate QoS estimations with only a small amount of extra traffic for active measurement", "fulltext": "", "keywords": "active monitoring;internet;network performance;quality of service;qos monitoring;delay distributions;passive monitoring;compact monitor;change-of-measure"}
{"name": "train_555", "title": "Computing transient gating charge movement of voltage-dependent ion channels", "abstract": "The opening of voltage-gated sodium, potassium, and calcium ion channels has a steep relationship with voltage. In response to changes in the transmembrane voltage, structural movements of an ion channel that precede channel opening generate a capacitative gating current. The net gating charge displacement due to membrane depolarization is an index of the voltage sensitivity of the ion channel activation process. Understanding the molecular basis of voltage-dependent gating of ion channels requires the measurement and computation of the gating charge, Q. We derive a simple and accurate semianalytic approach to computing the voltage dependence of transient gating charge movement (Q-V relationship) of discrete Markov state models of ion channels using matrix methods. This approach allows rapid computation of Q-V curves for finite and infinite length step depolarizations and is consistent with experimentally measured transient gating charge. This computational approach was applied to Shaker potassium channel gating, including the impact of inactivating particles on potassium channel gating currents", "fulltext": "", "keywords": "ion channels;markov state model;inactivation;charge movement;gating current;immobilization;action potentials;transmembrane voltage;transient gating charge movement"}
{"name": "train_556", "title": "Coarse-grained reduction and analysis of a network model of cortical response:", "abstract": "I. Drifting grating stimuli We present a reduction of a large-scale network model of visual cortex developed by McLaughlin, Shapley, Shelley, and Wielaard. The reduction is from many integrate-and-fire neurons to a spatially coarse-grained system for firing rates of neuronal subpopulations. It accounts explicitly for spatially varying architecture, ordered cortical maps (such as orientation preference) that vary regularly across the cortical layer, and disordered cortical maps (such as spatial phase preference or stochastic input conductances) that may vary widely from cortical neuron to cortical neuron. The result of the reduction is a set of nonlinear spatiotemporal integral equations for \"phase-averaged\" firing rates of neuronal subpopulations across the model cortex, derived asymptotically from the full model without the addition of any extra phenomological constants. This reduced system is used to study the response of the model to drifting grating stimuli - where it is shown to be useful for numerical investigations that reproduce, at far less computational cost, the salient features of the point-neuron network and for analytical investigations that unveil cortical mechanisms behind the responses observed in the simulations of the large-scale computational model. For example, the reduced equations clearly show (1) phase averaging as the source of the time-invariance of cortico-cortical conductances, (2) the mechanisms in the model for higher firing rates and better orientation selectivity of simple cells which are near pinwheel centers, (3) the effects of the length-scales of cortico-cortical coupling, and (4) the role of noise in improving the contrast invariance of orientation selectivity", "fulltext": "", "keywords": "phase-averaged firing rates;visual cortex;neuronal networks;point-neuron network;coarse-graining;large-scale network model;dynamics;orientation selectivity;nonlinear spatiotemporal integral equations"}
{"name": "train_557", "title": "Noise and the PSTH response to current transients: II. Integrate-and-fire model", "abstract": "with slow recovery and application to motoneuron data For pt.I see ibid., vol.11, no.2 , p.135-151( 2001). A generalized version of the integrate-and-fire model is presented that qualitatively reproduces firing rates and membrane trajectories of motoneurons. The description is based on the spike-response model and includes three different time constants: the passive membrane time constant, a recovery time of the input conductance after each spike, and a time constant of the spike afterpotential. The effect of stochastic background input on the peristimulus time histogram (PSTH) response to spike input is calculated analytically. Model results are compared with the experimental data of Poliakov et al. (1996). The linearized theory shows that the PSTH response to an input spike is proportional to a filtered version of the postsynaptic potential generated by the input spike. The shape of the filter depends on the background activity. The full nonlinear theory is in close agreement with simulated PSTH data", "fulltext": "", "keywords": "passive membrane time constant;spike-response model;spike afterpotential;recovery time;psth;membrane trajectories;integrate-and-fire model;motoneuron;firing rates"}
{"name": "train_558", "title": "OS porting and application development for SoC", "abstract": "To deliver improved usability in high-end portable consumer products, the use of an appropriate consumer operating system (OS) is becoming far more widespread. Using a commercially supported OS also vastly increases the availability of supported applications. For the device developer, this trend adds major complexity to the problem of system implementation. Porting a complete operating system to a new hardware design adds significantly to the development burden, increasing both time-to-market and expense. Even for those familiar with the integration of a real-time OS, the porting, validation and support of a complex platform OS is a formidable task", "fulltext": "", "keywords": "consumer operating system;application development;os porting;hardware design"}
{"name": "train_559", "title": "Is open source more or less secure?", "abstract": "Networks dominate today's computing landscape and commercial technical protection is lagging behind attack technology. As a result, protection programme success depends more on prudent management decisions than on the selection of technical safeguards. The paper takes a management view of protection and seeks to reconcile the need for security with the limitations of technology", "fulltext": "", "keywords": "open source software security;attack technology;management;computer networks;data security;commercial technical protection"}
{"name": "train_56", "title": "New thinking on rendering", "abstract": "Looks at how graphics hardware solves a range of rendering problems", "fulltext": "", "keywords": "color values;graphics hardware;rendering;gourand-shaded image;programmability"}
{"name": "train_560", "title": "Citizen centric identity management: chip tricks?", "abstract": "Accelerating and harmonizing the diffusion and acceptance of electronic services in Europe in a secure and practical way has become a priority of several initiatives in the past few years and a critical factor for citizen and business information society services. As identification and authentication is a critical element in accessing public services the combination of public key infrastructure (PKI) and smart cards emerges as the solution of choice for eGovernment in Europe. National governments and private initiatives alike vouch their support for this powerful combination to deliver an essential layer of reliable electronic services and address identity requirements in a broad range of application areas. A recent study suggests that several eGovernment implementations point to the direction of electronic citizen identity management as an up and coming challenge. The paper discusses the eGovernment needs for user identification applicability and the need for standardization", "fulltext": "", "keywords": "public key infrastructure;electronic services;legal framework;user identification;citizen centric identity management;business information services;standardization;government;smart cards;authentication;public information services"}
{"name": "train_561", "title": "SubSeven's Honey Pot program", "abstract": "A serious security threat today are malicious executables, especially new, unseen malicious executables often arriving as email attachments. These new malicious executables are created at the rate of thousands every year and pose a serious threat. Current anti-virus systems attempt to detect these new malicious programs with heuristics generated by hand. This approach is costly and often ineffective. We introduce the Trojan Horse SubSeven, its capabilities and influence over intrusion detection systems. A Honey Pot program is implemented, simulating the SubSeven Server. The Honey Pot Program provides feedback and stores data to and from the SubSeven's client", "fulltext": "", "keywords": "email attachments;malicious executables;trojan horse;security threat;subseven;intrusion detection systems;honey pot program;anti-virus systems"}
{"name": "train_562", "title": "The Advanced Encryption Standard - implementation and transition to a new", "abstract": "cryptographic benchmark Cryptography is the science of coding information to create unintelligible ciphers that conceal or hide messages. The process that achieves this goal is commonly referred to as encryption. Although encryption processes of various forms have been employed for centuries to protect the exchange of messages, the advent of the information age has underscored the importance of strong cryptography as a process to secure data exchanged through electronic means, and has accentuated the demand for products offering these services. This article describes the process that has led to the development of the latest cryptographic benchmark; the Advanced Encryption Standard (AES). The article briefly examines the requirements set forth for its development, defines how the new standard is implemented, and describes how government, business, and industry can transition to AES with minimum impact to operations", "fulltext": "", "keywords": "cryptographic benchmark;coding;business;industry;government;aes;advanced encryption standard;data exchange;unintelligible ciphers"}
{"name": "train_563", "title": "Getting the most out of intrusion detection systems", "abstract": "Intrusion detection systems (IDS) can play a very valuable role in the defence of a network. However, it is important to understand not just what it will do (and how it does it) - but what it won't do (and why). This article does not go into the technical working of IDS in too much detail, rather it limits itself to a discussion of some of the capabilities and failings of the technology", "fulltext": "", "keywords": "network attacks;intrusion detection systems;firewall;computer network security"}
{"name": "train_564", "title": "Development of a computer-aided manufacturing system for profiled edge", "abstract": "lamination tooling Profiled edge lamination (PEL) tooling is a promising rapid tooling (RT) method involving the assembly of an array of laminations whose top edges are simultaneously profiled and beveled based on a CAD model of the intended tool surface. To facilitate adoption of this RT method by industry, a comprehensive PEL tooling development system is proposed. The two main parts of this system are: (1) iterative tool design based on thermal and structural models; and (2) fabrication of the tool using a computer-aided manufacturing (CAM) software and abrasive water jet cutting. CAM software has been developed to take lamination slice data (profiles) from any proprietary RP software in the form of polylines and create smooth, kinematically desirable cutting trajectories for each tool lamination. Two cutting trajectory algorithms, called identical equidistant profile segmentation and adaptively vector profiles projection (AVPP), were created for this purpose. By comparing the performance of both algorithms with a benchmark part shape, the AVPP algorithm provided better cutting trajectories for complicated tool geometries. A 15-layer aluminum PEL tool was successfully fabricated using a 5-axis CNC AWJ cutter and NC code generated by the CAM software", "fulltext": "", "keywords": "cam software;profiled edge lamination tooling;computer aided manufacturing;abrasive water jet cutting;cutting trajectory algorithms;identical equidistant profile segmentation;rapid tooling;adaptively vector profiles projection"}
{"name": "train_565", "title": "Control of thin film growth in chemical vapor deposition manufacturing systems:", "abstract": "a feasibility study A study is carried out to design and optimize chemical vapor deposition (CVD) systems for material fabrication. Design and optimization of the CVD process is necessary to satisfying strong global demand and ever increasing quality requirements for thin film production. Advantages of computer aided optimization include high design turnaround time, flexibility to explore a larger design space and the development and adaptation of automation techniques for design and optimization. A CVD reactor consisting of a vertical impinging jet at atmospheric pressure, for growing titanium nitride films, is studied for thin film deposition. Numerical modeling and simulation are used to determine the rate of deposition and film uniformity over a wide range of design variables and operating conditions. These results are used for system design and optimization. The optimization procedure employs an objective function characterizing film quality, productivity and operational costs based on reactor gas flow rate, susceptor temperature and precursor concentration. Parameter space mappings are used to determine the design space, while a minimization algorithm, such as the steepest descent method, is used to determine optimal operating conditions for the system. The main features of computer aided design and optimization using these techniques are discussed in detail", "fulltext": "", "keywords": "material fabrication;operational costs;titanium nitride films;optimization;tin;precursor concentration;susceptor temperature;thin film growth;film quality;reactor gas flow rate;parameter space mappings;chemical vapor deposition"}
{"name": "train_566", "title": "Sensing and control of double-sided arc welding process", "abstract": "The welding industry is driven to improve productivity without sacrificing quality. For thick material welding, the current practice is to use backing or multiple passes. The laser welding process, capable of achieving deep narrow penetration, can significantly improve welding productivity for such applications by reducing the number of passes. However, its competitiveness in comparison with traditional arc welding is weakened by its high cost, strict fit-up requirement, and difficulty in welding large structures. In this work, a different method, referred to as double-sided arc welding (DSAW) is developed to improve the arc concentration for arc welding. A sensing and control system is developed to achieve deep narrow penetration under variations in welding conditions. Experiments verified that the pulsed keyhole DSAW system developed is capable of achieving deep narrow penetration on a 1/2 inch thick square butt joint in a single pass", "fulltext": "", "keywords": "process control;laser welding process;control system;controlled pulse keyhole;energy density;thick material welding;double-sided arc welding"}
{"name": "train_567", "title": "Hidden Markov model-based tool wear monitoring in turning", "abstract": "This paper presents a new modeling framework for tool wear monitoring in machining processes using hidden Markov models (HMMs). Feature vectors are extracted from vibration signals measured during turning. A codebook is designed and used for vector quantization to convert the feature vectors into a symbol sequence for the hidden Markov model. A series of experiments are conducted to evaluate the effectiveness of the approach for different lengths of training data and observation sequence. Experimental results show that successful tool state detection rates as high as 97% can be achieved by using this approach", "fulltext": "", "keywords": "tool wear monitoring;tool state detection;hidden markov models;machining processes;hmm training;feature extraction;turning process;codebook;discrete wavelet transform;vector quantization;vibration signals"}
{"name": "train_568", "title": "Modeling cutting temperatures for turning inserts with various tool geometries", "abstract": "and materials Temperatures are of interest in machining because cutting tools often fail by thermal softening or temperature-activated wear. Many models for cutting temperatures have been developed, but these models consider only simple tool geometries such as a rectangular slab with a sharp corner. This report describes a finite element study of tool temperatures in cutting that accounts for tool nose radius and included angle effects. A temperature correction factor model that can be used in the design and selection of inserts is developed to account for these effects. A parametric mesh generator is used to generate the finite element models of tool and inserts of varying geometries. The steady-state temperature response is calculated using NASTRAN solver. Several finite element analysis (FEA) runs are performed to quantify the effects of inserts included angle, nose radius, and materials for the insert and the tool holder on the cutting temperature at the insert rake face. The FEA results are then utilized to develop a temperature correction factor model that accounts for these effects. The temperature correction factor model is integrated with an analytical temperature model for rectangular inserts to predict cutting temperatures for contour turning with inserts of various shapes and nose radii. Finally, experimental measurements of cutting temperature using the tool-work thermocouple technique are performed and compared with the predictions of the new temperature model. The comparisons show good agreement", "fulltext": "", "keywords": "cutting temperature model;turning inserts;insert shape effects;parametric mesh generator;tool nose radius;temperature correction factor;tool geometries;machining;finite element models"}
{"name": "train_569", "title": "Application of an internally consistent material model to determine the effect", "abstract": "of tool edge geometry in orthogonal machining It is well known that the edge geometry of a cutting tool affects the forces measured in metal cutting. Two experimental methods have been suggested in the past to extract the ploughing (non-cutting) component from the total measured force: (1) the extrapolation approach, and (2) the dwell force technique. This study reports the behavior of zinc during orthogonal machining using tools of controlled edge radius. Applications of both the extrapolation and dwell approaches show that neither produces an analysis that yields a material response consistent with the known behavior of zinc. Further analysis shows that the edge geometry modifies the shear zone of the material and thereby modifies the forces. When analyzed this way, the measured force data yield the expected material response without requiring recourse to an additional ploughing component", "fulltext": "", "keywords": "edge geometry;metal cutting;zinc;dwell force;cutting tool;tool edge geometry;ploughing component;orthogonal machining;extrapolation"}
{"name": "train_57", "title": "Speaker adaptive modeling by vocal tract normalization", "abstract": "This paper presents methods for speaker adaptive modeling using vocal tract normalization (VTN) along with experimental tests on three databases. We propose a new training method for VTN: By using single-density acoustic models per HMM state for selecting the scale factor of the frequency axis, we avoid the problem that a mixture-density tends to learn the scale factors of the training speakers and thus cannot be used for selecting the scale factor. We show that using single Gaussian densities for selecting the scale factor in training results in lower error rates than using mixture densities. For the recognition phase, we propose an improvement of the well-known two-pass strategy: by using a non-normalized acoustic model for the first recognition pass instead of a normalized model, lower error rates are obtained. In recognition tests, this method is compared with a fast variant of VTN. The two-pass strategy is an efficient method, but it is suboptimal because the scale factor and the word sequence are determined sequentially. We found that for telephone digit string recognition this suboptimality reduces the VTN gain in recognition performance by 30% relative. In summary, on the German spontaneous speech task Verbmobil, the WSJ task and the German telephone digit string corpus SieTill, the proposed methods for VTN reduce the error rates significantly", "fulltext": "", "keywords": "two-pass strategy;training method;verlimobil;german spontaneous speech task;error rate reduction;sietill;training speakers;wsj task;single-density acoustic models;telephone digit string recognition;speaker adaptive modeling;hmm state;databases;vocal tract normalization;training results;single gaussian densities;frequency scale factor;nonnormalized acoustic model;word sequence;german telephone digit string corpus"}
{"name": "train_570", "title": "Prediction and compensation of dynamic errors for coordinate measuring machines", "abstract": "Coordinate measuring machines (CMMs) are already widely utilized as measuring tools in the modem manufacturing industry. Rapidly approaching now is the trend for next-generation CMMs. However, the increases in measuring velocity of CMM applications are limited by dynamic errors that occur in CMMs. In this paper a systematic approach for modeling the dynamic errors of a touch-trigger probe CMM is developed through theoretical analysis and experimental study. An overall analysis of the dynamic errors of CMMs is conducted, with weak components of the CMM identified by a laser interferometer. The probing process, as conducted with a touch-trigger probe, is analyzed. The dynamic errors are measured, modeled, and predicted using neural networks. The results indicate that, using this mode, it is possible to compensate for the dynamic errors of CMMs", "fulltext": "", "keywords": "compensation;dynamic errors;inertial forces;neural networks;touch-trigger probe;laser interferometer;manufacturing industry;coordinate measuring machines"}
{"name": "train_571", "title": "Control of transient thermal response during sequential open-die forging: a", "abstract": "trajectory optimization approach A trajectory optimization approach is applied to the design of a sequence of open-die forging operations in order to control the transient thermal response of a large titanium alloy billet. The amount of time the billet is soaked in furnace prior to each successive forging operation is optimized to minimize the total process time while simultaneously satisfying constraints on the maximum and minimum values of the billet temperature distribution to avoid microstructural defects during forging. The results indicate that a \"differential\" heating profile is the most effective at meeting these design goals", "fulltext": "", "keywords": "open-die forging;microstructural defects;temperature distribution;transient thermal response control;titanium alloy billet;heating profile;trajectory optimization"}
{"name": "train_572", "title": "Characterization of sheet buckling subjected to controlled boundary constraints", "abstract": "A wedge strip test is designed to study the onset and post-buckling behavior of a sheet under various boundary constraints. The device can be easily incorporated into a conventional tensile test machine, and material resistance to buckling is measured as the buckling height versus the in-plane strain state. The design yields different but consistent buckling modes with easy changes of boundary conditions (either clamped or freed) and sample geometry. Experimental results are then used to verify a hybrid approach to buckling prediction, i.e., the combination of the FEM analysis and an energy-based analytical wrinkling criterion. The FEM analysis is used to obtain the stress field and deformed geometry in a complex forming condition, while the analytical solution is to provide the predictions less sensitive to artificial numerical parameters. A good agreement between experimental data and numerical predictions is obtained", "fulltext": "", "keywords": "boundary constraints;forming processes;wedge strip test;energy-based analytical wrinkling criterion;strain state;finite element analysis;stress field;sheet buckling;deformed geometry;tensile test machine"}
{"name": "train_573", "title": "ECG-gated /sup 18/F-FDG positron emission tomography. Single test evaluation of", "abstract": "segmental metabolism, function and contractile reserve in patients with coronary artery disease and regional dysfunction /sup 18/F-fluorodeoxyglucose (/sup 18/F-FDG)-positron emission tomography (PET) provides information about myocardial glucose metabolism to diagnose myocardial viability. Additional information about the functional status is necessary. Comparison of tomographic metabolic PET with data from other imaging techniques is always hampered by some transfer uncertainty and scatter. We wanted to evaluate a new Fourier-based ECG-gated PET technique using a high resolution scanner providing both metabolic and functional data with respect to feasibility in patients with diseased left ventricles. Forty-five patients with coronary artery disease and at least one left ventricular segment with severe hypokinesis or akinesis at biplane cineventriculography were included. A new Fourier-based ECG-gated metabolic /sup 18/F-FDG-PET was performed in these patients. Function at rest and /sup 18/F-FDG uptake were examined in the PET study using a 36-segment model. Segmental comparison with ventriculography revealed a high reliability in identifying dysfunctional segments (>96%). /sup 18/F-FDG uptake of normokinetic/hypokinetic/akinetic segments was 75.4+or-7.5, 65.3+or-10.5, and 35.9+or-15.2% (p<0.001). In segments >or=70% /sup 18/F-FDG uptake no akinesia was observed. No residual function was found below 40% /sup 18/F-FDG uptake. An additional dobutamine test was performed and revealed inotropic reserve (viability) in 42 akinetic segments and 45 hypokinetic segments. ECG-gated metabolic PET with pixel-based Fourier smoothing provides reliable data on regional function. Assessment of metabolism and function makes complete judgement of segmental status feasible within a single study without any transfer artefacts or test-to-test variability. The results indicate the presence of considerable amounts of viable myocardium in regions with an uptake of 40-50% /sup 18/F-FDG", "fulltext": "", "keywords": "normokinetic/hypokinetic/akinetic segments;left ventricular segment;myocardial glucose metabolism;fourier-based ecg-gated metabolic /sup 18/f-fluorodeoxyglucose-positron emission tomography;severe hypokinesis;/sup 18/f-fluorodeoxyglucose uptake;diseased left ventricles;myocardial viability;regional dysfunction;functional;regional function;high resolution scanner;inotropic reserve;transfer uncertainty;residual function;ventriculography;hypokinetic segments;akinesis;transfer artefacts;dysfunctional segments;coronary artery disease;segmental status;biplane cineventriculography;dobutamine test;pixel-based fourier smoothing;patients;akinetic segments;fourier-based ecg-gated pet technique;thirty six-segment model;viable myocardium"}
{"name": "train_574", "title": "A novel approach for the detection of pathlines in X-ray angiograms: the", "abstract": "wavefront propagation algorithm Presents a new pathline approach, based on the wavefront propagation principle, and developed in order to reduce the variability in the outcomes of the quantitative coronary artery analysis. This novel approach, called wavepath, reduces the influence of the user-defined start- and endpoints of the vessel segment and is therefore more robust and improves the reproducibility of the lesion quantification substantially. The validation study shows that the wavepath method is totally constant in the middle part of the pathline, even when using the method for constructing a bifurcation or sidebranch pathline. Furthermore, the number of corrections needed to guide the wavepath through the correct vessel is decreased from an average of 0.44 corrections per pathline to an average of 0.12 per pathline. Therefore, it can be concluded that the wavepath algorithm improves the overall analysis substantially", "fulltext": "", "keywords": "sidebranch pathline;bifurcation;lesion quantification;x-ray angiograms;correct vessel;wavefront propagation algorithm;wavefront propagation principle;quantitative coronary artery analysis;user-defined endpoints;corrections;user-defined startpoints;vessel segment;wavepath method"}
{"name": "train_575", "title": "A new voltage-vector selection algorithm in direct torque control of induction", "abstract": "motor drives AC drives based on direct torque control of induction machines allow high dynamic performance to be obtained with very simple control schemes. The drive behavior, in terms of current, flux and torque ripple, is dependent on the utilised voltage vector selection strategy and the operating conditions. In this paper a new voltage vector selection algorithm, which allows a sensible reduction of the RMS value of the stator current ripple without increasing the average value of the inverter switching frequency and without the need of a PWM pulse generator block is presented Numerical simulations have been carried out to validate the proposed method", "fulltext": "", "keywords": "high dynamic performance;torque variations;flux variations;rms value;stator current ripple;induction motor drives;operating conditions;direct torque control;50 hz;voltage-vector selection algorithm;ac drives;4-poles induction motor;inverter switching frequency;torque ripple;steady-state operation;torque step response;voltage vector selection strategy;dynamic behavior;4 kw;220 v"}
{"name": "train_576", "title": "Application of Sugeno fuzzy-logic controller to the stator field-oriented", "abstract": "doubly-fed asynchronous motor drive This study deals with the application of the fuzzy-control theory to wound-rotor asynchronous motor with both its stator and rotor fed by two PWM voltage-source inverters, in which the system operates in stator field-oriented control. Thus, after determining the model of the machine, we present two types of fuzzy controller: Mamdani and Sugeno controllers. The training of the last one is carried out starting from the first. Simulation study is conducted to show the effectiveness of the proposed method", "fulltext": "", "keywords": "stator field-oriented control;training;mamdani controller;pwm voltage-source inverters;stator field-oriented doubly-fed asynchronous motor drive;sugeno fuzzy-logic controller;speed regulation;wound-rotor asynchronous motor;fuzzy-control;machine modelling"}
{"name": "train_577", "title": "A robust H/sub infinity / control approach for induction motors", "abstract": "This paper deals with the robustness and stability of an induction motor control structure against internal and external disturbances. In the proposed control scheme, we have used an H/sub infinity / controller with field orientation and input-output linearization to achieve the above-specified features. Simulation results are included to illustrate the control approach performances", "fulltext": "", "keywords": "input-output linearization;external disturbances;robustness;field orientation;internal disturbances;robust h/sub infinity / control;stability;induction motors control"}
{"name": "train_578", "title": "New approach to standing phase angle reduction for power system restoration", "abstract": "During power system restoration, it is necessary to check the phase angle between two buses before closing circuit breakers to connect a line between them. These angles may occur across a tie line between two systems or between two connected subsystems within a system. In case of large standing phase angle (SPA) difference the synchro-check relay does not allow closing of the breaker for this line. Therefore, this excessive SPA has to be reduced before attempting to connect the line. In this paper, a new and fast method for reducing SPA is presented. For this purpose, the standing phase angle difference between two specific buses is represented in terms of sensitivity factors associated with the change in active power generations and consumption at the buses. Then, the proposed method reschedule generation of selected units or shed load of selected buses to reduce excessive SPA difference between two buses based on sensitivity factors", "fulltext": "", "keywords": "power line connection;synchrocheck relay;sensitivity factors;standing phase angle reduction approach;power system restoration;circuit breaker closing"}
{"name": "train_579", "title": "Steinmetz system design under unbalanced conditions", "abstract": "This paper studies and develops general analytical expressions to obtain three-phase current symmetrization under unbalanced voltage conditions. It proposes two procedures for this symmetrization: the application of the traditional expressions assuming symmetry conditions and the use of optimization methods based on the general analytical equations. Specifically, the paper applies and evaluates these methods to analyze the Steinmetz system design. Several graphics evaluating the error introduced by assumption of balanced voltage in the design are plotted and an example is studied to compare both procedures. In the example the necessity to apply the optimization techniques in highly unbalanced conditions is demonstrated", "fulltext": "", "keywords": "optimization methods;balanced voltage assumption;power system control design;steinmetz system design;general analytical equations;three-phase current symmetrization;unbalanced voltage conditions"}
{"name": "train_58", "title": "Robust speech recognition using probabilistic union models", "abstract": "This paper introduces a new statistical approach, namely the probabilistic union model, for speech recognition involving partial, unknown frequency-band corruption. Partial frequency-band corruption accounts for the effect of a family of real-world noises. Previous methods based on the missing feature theory usually require the identity of the noisy bands. This identification can be difficult for unexpected noise with unknown, time-varying band characteristics. The new model combines the local frequency-band information based on the union of random events, to reduce the dependence of the model on information about the noise. This model partially accomplishes the target: offering robustness to partial frequency-band corruption, while requiring no information about the noise. This paper introduces the theory and implementation of the union model, and is focused on several important advances. These new developments include a new algorithm for automatic order selection, a generalization of the modeling principle to accommodate partial feature stream corruption, and a combination of the union model with conventional noise reduction techniques to deal with a mixture of stationary noise and unknown, nonstationary noise. For the evaluation, we used the TIDIGITS database for speaker-independent connected digit recognition. The utterances were corrupted by various types of additive noise, stationary or time-varying, assuming no knowledge about the noise characteristics. The results indicate that the new model offers significantly improved robustness in comparison to other models", "fulltext": "", "keywords": "tidigits database;speaker-independent connected digit recognition;noisy bands;partial frequency-band corruption;partial feature stream corruption;noise characteristics;noise reduction techniques;missing feature theory;probabilistic union models;local frequency-band information;partial real-world noise;stationary noise;automatic order selection;additive noise;modeling;robust speech recognition;time-varying band characteristics;nonstationary noise"}
{"name": "train_580", "title": "A genetic approach to the optimization of automatic generation control", "abstract": "parameters for power systems This paper presents a method based on genetic algorithm for the automatic generation control of power systems. The technique is applied to control a system, which includes two areas tied together through a power line. As a consequence of continuous load variation, the frequency of the power system changes with time. In conventional studies, frequency transients are minimized by using integral controllers and thus zero steady-state error is obtained. In this paper, integral controller gains and frequency bias factors are determined by using the genetic algorithm. The results of simulation reveal the application of the genetic algorithm having easy implementation to find the global optimum values of the control parameters", "fulltext": "", "keywords": "control simulation;frequency transients;continuous load variation;power systems automatic generation control parameters optimization;control design;frequency bias factors;genetic algorithm;interconnected power networks;integral controller gains;power line"}
{"name": "train_581", "title": "Successive expansion method of network planning applying symbolic analysis", "abstract": "method The conventional power system network successive expansion planning method is discussed in the context of the new paradigm of competitive electric power, energy and service market. In sequel, the paper presents an application of the conceptually new computer program, based on the symbolic analysis of load flows in power system networks. The network parameters and variables are defined as symbols. The symbolic analyzer, which models analytically the power system DC load flows, enables the sensitivity analysis of the power system to parameter and variable variations (costs, transfers, injections), a valuable tool for the expansion planning analysis. That virtue could not be found within the conventional approach, relying on compensation methods, precalculated distribution factors, and so on. This novel application sheds some light on the traditional power system network expansion planning method, as well as on its possible application within the system network expansion planning in the new environment assuming the competitive electric power market", "fulltext": "", "keywords": "competitive electric power market;computer program;precalculated distribution factors;power system dc load flows;competitive electric energy market;symbolic analyzer;sensitivity analysis;symbolic analysis;competitive electric service market;compensation methods;load flows;power system network expansion planning method;power system network successive expansion planning"}
{"name": "train_582", "title": "Optimal estimation of a finite sample of a discrete chaotic process", "abstract": "The synthesis of optimal algorithms for estimating discrete chaotic processes specified by a finite sample is considered; various possible approaches are discussed. Expressions determining the potential accuracy in estimating a single value of the chaotic process are derived. An example of the application of the general equations obtained is given", "fulltext": "", "keywords": "optimal algorithm synthesis;finite sample;space-time filtering;discrete chaotic process;optimal estimation"}
{"name": "train_583", "title": "Neural networks in optimal filtration", "abstract": "The combined use and mutual influence of neural networks and optimal filtering is considered; the neural-network and filtering approaches are compared by solving two simple optimal-filtering problems: linear filtering and the filtering of a binary telegraph signal corresponding to observations in discrete white noise", "fulltext": "", "keywords": "binary telegraph signal;linear filtering;observations;optimal filtering;neural networks;discrete white noise"}
{"name": "train_584", "title": "Hybrid fuzzy modeling of chemical processes", "abstract": "Fuzzy models have been proved to have the ability of modeling all plants without any priori information. However, the performance of conventional fuzzy models can be very poor in the case of insufficient training data due to their poor extrapolation capacity. In order to overcome this problem, a hybrid grey-box fuzzy modeling approach is proposed in this paper to combine expert experience, local linear models and historical data into a uniform framework. It consists of two layers. The expert fuzzy model constructed from linguistic information, the local linear model and the T-S type fuzzy model constructed from data are all put in the first layer. Layer 2 is a fuzzy decision module that is used to decide which model in the first layer should be employed to make the final prediction. The output of the second layer is the output of the hybrid fuzzy model. With the help of the linguistic information, the poor extrapolation capacity problem caused by sparse training data for conventional fuzzy models can be overcome. Simulation result for pH neutralization process demonstrates its modeling ability over the linear models, the expert fuzzy model and the conventional fuzzy model", "fulltext": "", "keywords": "expert fuzzy model;fuzzy decision module;chemical processes;process modeling;fuzzy modeling"}
{"name": "train_585", "title": "Fuzzy system modeling in pharmacology: an improved algorithm", "abstract": "In this paper, we propose an improved fuzzy system modeling algorithm to address some of the limitations of the existing approaches identified during our modeling with pharmacological data. This algorithm differs from the existing ones in its approach to the cluster validity problem (i.e., number of clusters), the projection schema (i.e., input membership assignment and rule determination), and significant input determination. The new algorithm is compared with the Bazoon-Turksen model, which is based on the well-known Sugeno-Yasukawa approach. The comparison was made in terms of predictive performance using two different data sets. The first comparison was with a two variable nonlinear function prediction problem and the second comparison was with a clinical pharmacokinetic modeling problem. It is shown that the proposed algorithm provides more precise predictions. Determining the degree of significance for each input variable, allows the user to distinguish their relative importance", "fulltext": "", "keywords": "pharmacokinetic modeling;fuzzy sets;significant input determination;cluster validity problem;pharmacology;projection schema;predictive performance;fuzzy system modeling;fuzzy logic"}
{"name": "train_586", "title": "A strategy for a payoff-switching differential game based on fuzzy reasoning", "abstract": "In this paper, a new concept of a payoff-switching differential game is introduced. In this new game, any one player at any time may have several choices of payoffs for the future. Moreover, the payoff-switching process, including the time of payoff switching and the outcome payoff, of any one player is unknown to the other. Indeed, the overall payoff, which is a sequence of several payoffs, is unknown until the game ends. An algorithm for determining a reasoning strategy based on fuzzy reasoning is proposed. In this algorithm, the fuzzy theory is used to estimate the behavior of one player during a past time interval. By deriving two fuzzy matrices GSM, game similarity matrix, and VGSM, variation of GSM, the behavior of the player can be quantified. Two weighting vectors are selected to weight the relative importance of the player's behavior at each past time instant. Finally a simple fuzzy inference rule is adopted to generate a linear reasoning strategy. The advantage of this algorithm is that it provides a flexible way for differential game specialists to convert their knowledge into a \"reasonable\" strategy. A practical example of guarding three territories is given to illustrate our main ideas", "fulltext": "", "keywords": "differential game;payoff switching;fuzzy reasoning;outcome payoff;reasoning strategy;game similarity matrix;fuzzy inference;weighting vectors;payoff-switching differential game;fuzzy matrices"}
{"name": "train_587", "title": "An improved self-organizing CPN-based fuzzy system with adaptive", "abstract": "back-propagation algorithm This paper describes an improved self-organizing CPN-based (Counter-Propagation Network) fuzzy system. Two self-organizing algorithms IUSOCPN and ISSOCPN, being unsupervised and supervised respectively, are introduced. The idea is to construct the neural-fuzzy system with a two-phase hybrid learning algorithm, which utilizes a CPN-based nearest-neighbor clustering scheme for both structure learning and initial parameters setting, and a gradient descent method with adaptive learning rate for fine tuning the parameters. The obtained network can be used in the same way as a CPN to model and control dynamic systems, while it has a faster learning speed than the original back-propagation algorithm. The comparative results on the examples suggest that the method is fairly efficient in terms of simple structure, fast learning speed, and relatively high modeling accuracy", "fulltext": "", "keywords": "structure learning;counter-propagation network;initial parameters setting;neural-fuzzy system;self-organizing fuzzy system;gradient descent;back-propagation learning scheme;hybrid learning"}
{"name": "train_588", "title": "An accurate COG defuzzifier design using Lamarckian co-adaptation of learning", "abstract": "and evolution This paper proposes a design technique of optimal center of gravity (COG) defuzzifier using the Lamarckian co-adaptation of learning and evolution. The proposed COG defuzzifier is specified by various design parameters such as the centers, widths, and modifiers of MFs. The design parameters are adjusted with the Lamarckian co-adaptation of learning and evolution, where the learning performs a local search of design parameters in an individual COG defuzzifier, but the evolution performs a global search of design parameters among a population of various COG defuzzifiers. This co-adaptation scheme allows to evolve much faster than the non-learning case and gives a higher possibility of finding an optimal solution due to its wider searching capability. An application to the truck backer-upper control problem of the proposed co-adaptive design method of COG defuzzifier is presented. The approximation ability and control performance are compared with those of the conventionally simplified COG defuzzifier in terms of the fuzzy logic controller's approximation error and the average tracing distance, respectively", "fulltext": "", "keywords": "learning;local search;fuzzy logic controller;evolution;optimal center of gravity defuzzifier"}
{"name": "train_589", "title": "Hierarchical neuro-fuzzy quadtree models", "abstract": "Hybrid neuro-fuzzy systems have been in evidence during the past few years, due to its attractive combination of the learning capacity of artificial neural networks with the interpretability of the fuzzy systems. This article proposes a new hybrid neuro-fuzzy model, named hierarchical neuro-fuzzy quadtree (HNFQ), which is based on a recursive partitioning method of the input space named quadtree. The article describes the architecture of this new model, presenting its basic cell and its learning algorithm. The HNFQ system is evaluated in three well known benchmark applications: the sinc(x, y) function approximation, the Mackey Glass chaotic series forecast and the two spirals problem. When compared to other neuro-fuzzy systems, the HNFQ exhibits competing results, with two major advantages it automatically creates its own structure and it is not limited to few input variables", "fulltext": "", "keywords": "neuro-fuzzy systems;mackey glass chaotic series;recursive partitioning;learning algorithm;quadtree;hierarchical neuro-fuzzy quadtree;fuzzy systems"}
{"name": "train_59", "title": "Efficient tracking of the cross-correlation coefficient", "abstract": "In many (audio) processing algorithms, involving manipulation of discrete-time signals, the performance can vary strongly over the repertoire that is used. This may be the case when the signals from the various channels are allowed to be strongly positively or negatively correlated. We propose and analyze a general formula for tracking the (time-dependent) correlation between two signals. Some special cases of this formula lead to classical results known from the literature, others are new. This formula is recursive in nature, and uses only the instantaneous values of the two signals, in a low-cost and low-complexity manner; in particular, there is no need to take square roots or to carry out divisions. Furthermore, this formula can be modified with respect to the occurrence of the two signals so as to further decrease the complexity, and increase ease of implementation. The latter modification comes at the expense that not the actual correlation is tracked, but, rather, a somewhat deformed version of it. To overcome this problem, we propose, for a number of instances of the tracking formula, a simple warping operation on the deformed correlation. Now we obtain, at least for sinusoidal signals, the correct value of the correlation coefficient. Special attention is paid to the convergence behavior of the algorithm for stationary signals and the dynamic behavior if there is a transition to another stationary state; the latter is considered to be important to study the tracking abilities to nonstationary signals. We illustrate tracking algorithm by using it for stereo music fragments, obtained from a number of digital audio recordings", "fulltext": "", "keywords": "time-dependent correlation;cross-correlation coefficient;audio processing algorithms;recursive formula;discrete-time signals;nonstationary signals;efficient tracking;stationary state;warping operation;tracking algorithm;stereo music fragments;convergence behavior;stationary signals;dynamic behavior;deformed correlation;sinusoidal signals;digital audio recording"}
{"name": "train_590", "title": "Universal approximation by hierarchical fuzzy system with constraints on the", "abstract": "fuzzy rule This paper presents a special hierarchical fuzzy system where the outputs of the previous layer are not used in the IF-parts, but used only in the THEN-parts of the fuzzy rules of the current layer. The proposed scheme can be shown to be a universal approximator to any continuous function on a compact set if complete fuzzy sets are used in the IF-parts of the fuzzy rules with singleton fuzzifier and center average defuzzifier. From the simulation of ball and beam control system, it is demonstrated that the proposed scheme approximates with good accuracy the model nonlinear controller with fewer fuzzy rules than the centralized fuzzy system and its control performance is comparable to that of the nonlinear controller", "fulltext": "", "keywords": "hierarchical fuzzy logic;universal approximator;hierarchical fuzzy system;stone-weierstrass theorem;ball and beam control system;fuzzy rules;continuous function"}
{"name": "train_591", "title": "Approximation theory of fuzzy systems based upon genuine many-valued", "abstract": "implications - MIMO cases It is constructively proved that the multi-input-multi-output fuzzy systems based upon genuine many-valued implications are universal approximators (they are called Boolean type fuzzy systems in this paper). The general approach to construct such fuzzy systems is given, that is, through the partition of the output region (by the given accuracy). Two examples are provided to demonstrate the way in which fuzzy systems are designed to approximate given functions with a given required approximation accuracy", "fulltext": "", "keywords": "boolean type fuzzy systems;universal approximator;multi-input-multi-output fuzzy systems;many-valued implication;fuzzy systems"}
{"name": "train_592", "title": "Approximation theory of fuzzy systems based upon genuine many-valued", "abstract": "implications - SISO cases It is proved that the single input and single output (SISO) fuzzy systems based upon genuine many-valued implications are universal approximators. It is shown theoretically that fuzzy control systems based upon genuine many-valued implications are equivalent to those based upon t-norm implications, the general approach to construct fuzzy systems is given. It is also shown that defuzzifier based upon center of areas is not appropriate to the fuzzy systems based upon genuine many-valued implications", "fulltext": "", "keywords": "universal approximator;many-valued implications;boolean implication;siso;single input and single output fuzzy systems;fuzzy systems"}
{"name": "train_593", "title": "Fuzzy systems with overlapping Gaussian concepts: Approximation properties in", "abstract": "Sobolev norms In this paper the approximating capabilities of fuzzy systems with overlapping Gaussian concepts are considered. The target function is assumed to be sampled either on a regular gird or according to a uniform probability density. By exploiting a connection with Radial Basis Functions approximators, a new method for the computation of the system coefficients is provided, showing that it guarantees uniform approximation of the derivatives of the target function", "fulltext": "", "keywords": "overlapping gaussian concepts;fuzzy system models;learning;radial basis functions;reproducing kernel hilbert spaces;fuzzy systems"}
{"name": "train_594", "title": "Improved analysis for the nonlinear performance of CMOS current mirrors with", "abstract": "device mismatch The nonlinear performance of the simple and complementary MOSFET current mirrors are analyzed. Closed-form expressions are obtained for the harmonic and intermodulation components resulting from a multisinusoidal input current. These expressions can be used for predicting the limiting values of the input current under prespecified conditions of threshold-voltage mismatches and/or transconductance mismatches. The case of a single input sinusoid is discussed in detail and the results are compared with SPICE simulations", "fulltext": "", "keywords": "threshold-voltage mismatch;input current;nonlinear performance;device mismatch;multisinusoidal input current;harmonic components;cmos current mirrors;spice simulations;intermodulation components;complementary mosfet current mirrors;simulation results;transconductance mismatch;closed-form expressions"}
{"name": "train_595", "title": "Six common enterprise programming mistakes", "abstract": "Instead of giving you tips to use in your programming (at least directly), I want to look at some common mistakes made in enterprise programming. Instead of focusing on what to do, I want to look at what you should not do. Most programmers take books like mine and add in the good things, but they leave their mistakes in the very same programs! So I touch on several common errors I see in enterprise programming, and then briefly mention how to avoid those mistakes", "fulltext": "", "keywords": "common errors;enterprise javabeans;database;xml;enterprise programming mistakes;data store;vendor-specific programming"}
{"name": "train_596", "title": "Copyright management in the digital age", "abstract": "Listening to and buying music online is becoming increasingly popular with consumers. So much so that Merrill Lynch forecasts the value of the online music market will explode from $8 million in 2001 to $1,409 million in 2005. But online delivery is not without problems; the issue of copyright management in particular has become a serious thorn in the side for digital content creators. Martin Brass, ex- music producer and senior industry consultant at Syntegra, explains", "fulltext": "", "keywords": "internet;online music delivery;napster;digital age;music industry;digital content creators"}
{"name": "train_597", "title": "Quick media response averts PR disaster", "abstract": "Sometimes it's not what you do, but how you do it. After hackers broke the blocking code on the home version of its popular Cyber Patrol Internet filtering software and posted it on the Internet, marketers at Microsystems Software pulled out a playbook of standard crisis management and PR techniques. But the Cyber Patrol PR team including outside PR counsel and the company's outside law firm, used those tools aggressively in order to turn the tide of public and media opinion away from the hackers, who initially were hailed as folk heroes, and in favor of the company's interests, to save the product's and the company's reputations and inherent value. And the entire team managed to move at Internet speed: The crisis was essentially over in about three weeks", "fulltext": "", "keywords": "public relations;cyber patrol internet filtering software;crisis management;microsystems software;media response"}
{"name": "train_598", "title": "From FREE to FEE [online advertising market]", "abstract": "As the online advertising market continues to struggle, many online content marketers are wrestling with the issue of how to add at least some level of paid subscription income to their revenue mix in order to reach or improve profitability. Since the business of selling content online is still in its infancy, and many consumers clearly still think of Web content as simply and rightfully free, few roadmaps are available to show the way to effective marketing strategies, but some guiding principles have emerged", "fulltext": "", "keywords": "online advertising market;paid subscription income;marketing strategies;selling content online"}
{"name": "train_599", "title": "Keen but confused [workflow & content management]", "abstract": "IT users find workflow, content and business process management software appealing but by no means straightforward to implement. Pat Sweet reports on our latest research", "fulltext": "", "keywords": "content management;survey;market overview;business process management software;research;workflow"}
{"name": "train_6", "title": "SBC gets more serious on regulatory compliance", "abstract": "With one eye on the past and the other on its future, SBC Communications last week created a unit it hopes will bring a cohesiveness and efficiency to its regulatory compliance efforts that previously had been lacking. The carrier also hopes the new regulatory compliance unit will help it accomplish its short-term goal of landing FCC approval. to provide long-distance service throughout its region, and its longer-term, goal of reducing the regulatory burdens under which it and currently operate", "fulltext": "", "keywords": "regulatory compliance;telecom carrier;sbc communications"}
{"name": "train_60", "title": "Perceptual audio coding using adaptive pre- and post-filters and lossless", "abstract": "compression This paper proposes a versatile perceptual audio coding method that achieves high compression ratios and is capable of low encoding/decoding delay. It accommodates a variety of source signals (including both music and speech) with different sampling rates. It is based on separating irrelevance and redundancy reductions into independent functional units. This contrasts traditional audio coding where both are integrated within the same subband decomposition. The separation allows for the independent optimization of the irrelevance and redundancy reduction units. For both reductions, we rely on adaptive filtering and predictive coding as much as possible to minimize the delay. A psycho-acoustically controlled adaptive linear filter is used for the irrelevance reduction, and the redundancy reduction is carried out by a predictive lossless coding scheme, which is termed weighted cascaded least mean squared (WCLMS) method. Experiments are carried out on a database of moderate size which contains mono-signals of different sampling rates and varying nature (music, speech, or mixed). They show that the proposed WCLMS lossless coder outperforms other competing lossless coders in terms of compression ratios and delay, as applied to the pre-filtered signal. Moreover, a subjective listening test of the combined pre-filter/lossless coder and a state-of-the-art perceptual audio coder (PAC) shows that the new method achieves a comparable compression ratio and audio quality with a lower delay", "fulltext": "", "keywords": "low encoding/decoding delay;adaptive pre-filters;perceptual audio coding;psycho-acoustically controlled adaptive linear filter;weighted cascaded least mean squared;pre-filter/lossless coder;high compression ratio;source signals;adaptive post-filters;adaptive filtering;predictive lossless coding;wclms lossless coder;audio quality;predictive coding;subjective listening test;sampling rates;lossless compression;irrelevance reduction;redundancy reduction;music"}
{"name": "train_600", "title": "Development of railway VR safety simulation system", "abstract": "Abnormal conditions occur in railway transportation due to trouble or accidents and it affects a number of passengers. It is very important, therefore, to quickly recover and return to normal train operation. For this purpose we developed a system, \"Computer VR Simulation System for the Safety of Railway Transportation.\" It is a new type simulation system to evaluate measures to be taken under abnormal conditions. Users of this simulation system cooperate with one another to correct the abnormal conditions that have occurred in virtual reality. This paper reports the newly developed simulation system", "fulltext": "", "keywords": "virtual reality simulation system;accidents;computer vr simulation system;railway transportation;abnormal conditions correction;normal train operation"}
{"name": "train_601", "title": "Recent researches of human science on railway systems", "abstract": "This paper presents research of human science on railway systems at RTRI. They are roughly divided into two categories: research to improve safety and those to improve comfort. On the former subject, for the safeguard against accidents caused by human errors, we have promoted studies of psychological aptitude test, various research to evaluate train drivers' working conditions and environments, and new investigations to minimize the risk of passenger casualties at train accidents. On the latter subject, we have developed new methods to evaluate the riding comfort including that of tilt train, and started research on the improvement of railway facilities for the aged and the disabled from the viewpoint of universal design", "fulltext": "", "keywords": "human science;wakefulness level;safety improvement;accidents;railway facilities;tilt train;train drivers' working conditions;rtri;human errors;riding comfort;ergonomics;aged persons;train accidents;comfort improvement;psychological aptitude test;sight impaired;railway systems;disabled persons;passenger casualties risk minimisation;train drivers' working environments"}
{"name": "train_602", "title": "Image fusion between /sup 18/FDG-PET and MRI/CT for radiotherapy planning of", "abstract": "oropharyngeal and nasopharyngeal carcinomas Accurate diagnosis of tumor extent is important in three-dimensional conformal radiotherapy. This study reports the use of image fusion between (18)F-fluoro-2-deoxy-D-glucose positron emission tomography (/sup 18/FDG-PET) and magnetic resonance imaging/computed tomography (MRI/CT) for better targets delineation in radiotherapy planning of head-and-neck cancers. The subjects consisted of 12 patients with oropharyngeal carcinoma and 9 patients with nasopharyngeal carcinoma (NPC) who were treated with radical radiotherapy between July 1999 and February 2001. Image fusion between /sup 18/FDG-PET and MRI/CT was performed using an automatic multimodality image registration algorithm, which used the brain as an internal reference for registration. Gross tumor volume (GTV) was determined based on clinical examination and /sup 18/FDG uptake on the fusion images. Clinical target volume (CTV) was determined following the usual pattern of lymph node spread for each disease entity along with the clinical presentation of each patient. Except for 3 cases with superficial tumors, all the other primary tumors were detected by /sup 18/FDG-PET. The GTV volumes for primary tumors were not changed by image fusion in 19 cases (89%), increased by 49% in one NPC, and decreased by 45% in another NPC. Normal tissue sparing was more easily performed based on clearer GTV and CTV determination on the fusion images. In particular, parotid sparing became possible in 15 patients (71%) whose upper neck areas near the parotid glands were tumor-free by /sup 18/FDG-PET. Within a mean follow-up period of 18 months, no recurrence occurred in the areas defined as CTV, which was treated prophylactically, except for 1 patient who experienced nodal recurrence in the CTV and simultaneous primary site recurrence. In conclusion, this preliminary study showed that image fusion between /sup 18/FDG-PET and MRI/CT was useful in GTV and CTV determination in conformal RT, thus sparing normal tissues", "fulltext": "", "keywords": "nasopharyngeal carcinomas;superficial tumors;f;image fusion;simultaneous primary site recurrence;parotid glands;mri/ct;radiotherapy planning;/sup 18/fdg-pet;normal tissues sparing;primary tumors;oropharyngeal carcinomas"}
{"name": "train_603", "title": "PGE helps customers reduce energy costs", "abstract": "A new service from Portland General Electric (PGE, Portland, Oregon, US) is saving customers tens of thousands of dollars in energy costs. PGE created E-Manager to allow facility managers to analyze their energy consumption online at 15-minute intervals. Customers can go to the Web for complete data, powerful analysis tools and charts, helping them detect abnormal energy use and focus on costly problem areas", "fulltext": "", "keywords": "online energy consumption analysis;oregon;energy costs reduction;e-manager;abnormal energy use detection;portland general electric"}
{"name": "train_604", "title": "SRP rolls out reliability and asset management initiative", "abstract": "Reliability planning analysis at the Salt River Project (SRP, Tempe, Arizona, US) prioritizes geographic areas for preventive inspections based on a cost benefit model. However, SRP wanted a new application system to prioritize inspections and to predict when direct buried cable would fail using the same cost benefit model. In the business cases, the represented type of kilowatt load-residential, commercial or critical circuit-determines the cost benefit per circuit. The preferred solution was to develop a geographical information system (GIS) application allowing for a circuit query for the specific geographic areas it crosses and the density of load points of a given type within those areas. The query returns results based on the type of equipment analysis execution: wood pole, preventive maintenance for a line or cable replacement. This differentiation insures that all the facilities relevant to a specific analysis type influence prioritization of the geographic areas", "fulltext": "", "keywords": "condition monitoring;salt river project;usa;direct buried cable;cable replacement;tempe;arizona;gis;reliability planning analysis;cost benefit model;preventive inspections;wood pole;geographical information system;geographic areas;equipment analysis execution"}
{"name": "train_605", "title": "HEW selects network management software", "abstract": "For more than 100 years, Hamburgische Electricitats-Werke AG (HEW) has provided a reliable electricity service to the city of Hamburg, Germany. Today, the company supplies electricity to some 1.7 million inhabitants via 285000 connections. During 1999, the year the energy market was started in Germany, HEW needed to operate and maintain a safe and reliable network cheaply. The development and implementation of a distribution management system (DMS) is key to the success of HEW. HEW's strategy was to obtain efficient new software for network management that also offered a good platform for future applications. Following a pilot and prequalification phase, HEW invited several companies to process the requirements catalog and to submit a detailed tender. The network information management system, Xpower, developed by Tekla Oyj, successfully passed HEW's test program and satisfied all the performance and system capacity requirements. The system met all HEW's conditions by presenting the reality of a network with the attributes of the operating resources. Xpower platform provides the ability to integrate future applications", "fulltext": "", "keywords": "distribution management system;hamburg;xpower;hamburgische electricitats-werke;germany;tekla oyj;network management software"}
{"name": "train_606", "title": "Taiwan power company phases into AM/FM", "abstract": "To face the challenges and impact of the inevitable trend toward privatization and deregulation, the Taiwan Power Co. (TPC) devised short- and long-term strategic computerization development plans. These development efforts created a master plan that included building an Automated Mapping and Facilities Management (AM/ FM) system for Taipei City District Office (TCDO). This project included a pilot project followed by evaluation before the roll out to the complete service territory of TCDO. The pilot project took three years to install, commission and-via the evaluation process-reach the conclusion that AM/FM was technologically feasible", "fulltext": "", "keywords": "pilot project;am/fm;complete service territory;automated mapping and facilities management;taipei city district office;privatization;taiwan power company;deregulation"}
{"name": "train_607", "title": "A building block approach to automated engineering", "abstract": "Shenandoah Valley Electric Cooperative (SVEC, Mt. Crawford, Virginia, US) recognized the need to automate engineering functions and create an interactive model of its distribution system in the early 1990s. It had used Milsoft's DA software for more than 10 years to make engineering studies, and had a Landis and Gyr SCADA system and a hybrid load management system for controlling water heater switches. With the development of GIS and facilities management (FM) applications, SVEC decided this should be the basis for an information system that would model its physical plant and interface with its accounting and billing systems. It could add applications such as outage management, staking, line design and metering to use this information and interface with these databases. However, based on SVEC's size it was not feasible to implement a sophisticated and expensive GIS/FM system. Over the past nine years, SVEC has had success with a building block approach, and its customers and employees are realizing the benefits of the automated applications. This building block approach is discussed in this article including the GIS, outage management system, MapViewer and a staking package. The lessons learned and future expansion are discussed", "fulltext": "", "keywords": "staking;mapviewer;metering;gis;building block approach;interactive model;databases;distribution system;engineering functions automation;shenandoah valley electric cooperative;outage management;billing systems;line design"}
{"name": "train_608", "title": "How closely can a personal computer clock track the UTC timescale via the", "abstract": "Internet? Nowadays many software packages allow you to keep the clock of your personal computer synchronized to time servers spread over the internet. We present how a didactic laboratory can evaluate, in a statistical sense, the minimum synch error of this process (the other extreme, the maximum, is guaranteed by the code itself). The measurement set-up utilizes the global positioning system satellite constellation in 'common view' between two similar timing stations: one acts as a time server for the other, so the final timing difference at the second station represents the total synch error through the internet. Data recorded over batches of 10000 samples show a typical RMS value of 35 ms. This measurement configuration allows students to obtain a much better understanding of the synch task and pushes them, at all times, to look for an experimental verification of data results, even when they come from the most sophisticated 'black boxes' now readily available off the shelf", "fulltext": "", "keywords": "black boxes;didactic laboratory;internet;synch error;global positioning system satellite constellation;software packages;personal computer clock;time servers;utc timescale;statistical sense;final timing difference"}
{"name": "train_609", "title": "Chemical production in the superlative [formaldehyde plant process control", "abstract": "system and remote I/O system] BASF commissioned the largest formaldehyde production plant in the world, in December 2000, with an annual capacity of 180000 t. The new plant, built to meet the growing demand for formaldehyde, sets new standards. Its size, technology and above all its cost-effectiveness give it a leading position internationally. To maintain such high standards by the automation technology, in addition to the trail-blazing Simatic PCS 7 process control system from Siemens, BASF selected the innovative remote I/O system I.S.1 from R. STAHL Schaltgerate GmbH to record and to output field signals in hazardous areas Zone 1 and 2. This combination completely satisfied all technical requirements and also had the best price-performance ratio of all the solutions. 25 remote I/O field stations were designed and matched to the needs of the formaldehyde plant", "fulltext": "", "keywords": "automation technology;zone 2 hazardous area;r. stahl schaltgerate gmbh;trail-blazing simatic pcs 7;price-performance ratio;remote i/o field station design;superlative;formaldehyde production plant construction;zone 1 hazardous area;remote i/o system i.s.1;signal recording;basf;chemical production;siemens;cost-effective plant;process control system"}
{"name": "train_61", "title": "Application of time-frequency principal component analysis to text-independent", "abstract": "speaker identification We propose a formalism, called vector filtering of spectral trajectories, that allows the integration of a number of speech parameterization approaches (cepstral analysis, Delta and Delta Delta parameterizations, auto-regressive vector modeling, ...) under a common formalism. We then propose a new filtering, called contextual principal components (CPC) or time-frequency principal components (TFPC). This filtering consists in extracting the principal components of the contextual covariance matrix, which is the covariance matrix of a sequence of vectors expanded by their context. We apply this new filtering in the framework of closed-set speaker identification, using a subset of the POLYCOST database. When using speaker-dependent TFPC filters, our results show a relative improvement of approximately 20% compared to the use of the classical cepstral coefficients augmented by their Delta -coefficients, which is significantly better with a 90% confidence level", "fulltext": "", "keywords": "contextual principal components;text-independent speaker identification;polycost database;vector filtering;delta -coefficients;contextual covariance matrix;spectral trajectories;delta delta parameterization;closed-set speaker identification;delta parameterization;cepstral analysis;time-frequency principal component analysis;cepstral coefficients;speech parameterization;auto-regressive vector modeling;confidence level"}
{"name": "train_610", "title": "AGC for autonomous power system using combined intelligent techniques", "abstract": "In the present work two intelligent load frequency controllers have been developed to regulate the power output and system frequency by controlling the speed of the generator with the help of fuel rack position control. The first controller is obtained using fuzzy logic (FL) only, whereas the second one by using a combination of FL, genetic algorithms and neural networks. The aim of the proposed controller(s) is to restore in a very smooth way the frequency to its nominal value in the shortest time possible whenever there is any change in the load demand etc. The action of these controller(s) provides a satisfactory balance between frequency overshoot and transient oscillations with zero steady-state error. The design and performance evaluation of the proposed controller(s) structure are illustrated with the help of case studies applied (without loss of generality) to a typical single-area power system. It is found that the proposed controllers exhibit satisfactory overall dynamic performance and overcome the possible drawbacks associated with other competing techniques", "fulltext": "", "keywords": "power output regulation;combined intelligent techniques;single-area power system;transient oscillations;frequency overshoot;competing techniques;autonomous power system;fuel rack position control;frequency control;performance evaluation;genetic algorithms;zero steady-state error;neural networks;generator speed control;controller design;overall dynamic performance;load demand;fuzzy logic"}
{"name": "train_611", "title": "Intelligent optimal sieving method for FACTS device control in multi-machine", "abstract": "systems A multi-target oriented optimal control strategy for FACTS devices installed in multi-machine power systems is presented in this paper, which is named the intelligent optimal sieving control (IOSC) method. This new method divides the FACTS device output region into several parts and selects one typical value from each part, which is called output candidate. Then, an intelligent optimal sieve is constructed, which predicts the impacts of each output candidate on a power system and sieves out an optimal output from all of the candidates. The artificial neural network technologies and fuzzy methods are applied to build the intelligent sieve. Finally, the real control signal of FACTS devices is calculated according to the selected optimal output through inverse system method. Simulation has been done on a three-machine power system and the results show that the proposed IOSC controller can effectively attenuate system oscillations and enhance the power system transient stability", "fulltext": "", "keywords": "intelligent optimal sieve;inverse system method;system oscillations attenuation;fuzzy methods;three-machine power system;facts;intelligent optimal sieving method;power system transient stability enhancement;multi-target oriented optimal control strategy;artificial neural network technologies;selected optimal output;facts device control;multi-machine systems;control signal;intelligent control"}
{"name": "train_612", "title": "Analysis and operation of hybrid active filter for harmonic elimination", "abstract": "This paper presents a hybrid active filter topology and its control to suppress the harmonic currents from entering the power source. The adopted hybrid active filter consists of one active filter and one passive filter connected in series. By controlling the equivalent output voltage of active filter, the harmonic currents generated by the nonlinear load are blocked and flowed into the passive filter. The power rating of the converter is reduced compared with the pure active filters to filter the harmonic currents. The harmonic current detecting approach and DC-link voltage regulation are proposed to obtain equivalent voltage of active filter. The effectiveness of the adopted topology and control scheme has been verified by the computer simulation and experimental results in a scaled-down laboratory prototype", "fulltext": "", "keywords": "equivalent output voltage;harmonic currents suppression;harmonic elimination;computer simulation;active filter;dc-link voltage regulation;harmonic currents;converter power rating reduction;voltage source inverter;nonlinear load;active filter equivalent voltage;passive filter;scaled-down laboratory prototype;hybrid active filter"}
{"name": "train_613", "title": "Comparison between discrete STFT and wavelets for the analysis of power quality", "abstract": "events This paper deals with the comparison of signal processing tools for power quality analysis. Two signal processing techniques are considered: the wavelet filters and the discrete short-time Fourier transforms (STFT). Then, examples of the two most frequent disturbances met in the power system are chosen. An adjustable speed drive with a six-pulse converter using EMTP/ATP is designed and normal energizing of utility capacitors is presented . The analysis is tested on a system consisting of 13 buses and is representative of a medium-sized industrial plant. Finally, each kind of electrical disturbance is analyzed with examples representing each tool. A qualitative comparison of results shows the advantages and drawbacks of each signal processing technique applied to power quality analysis", "fulltext": "", "keywords": "six-pulse converter;signal processing techniques;adjustable speed drive;medium-sized industrial plant;wavelet filters;power quality events;signal processing tools;wavelets;short-time fourier transforms;discrete short-time fourier transforms;discrete stft;electrical disturbance;utility capacitors;emtp/atp"}
{"name": "train_614", "title": "An on-line distributed intelligent fault section estimation system for", "abstract": "large-scale power networks In this paper, a novel distributed intelligent system is suggested for on-line fault section estimation (FSE) of large-scale power networks. As the first step, a multi-way graph partitioning method based on weighted minimum degree reordering is proposed for effectively partitioning the original large-scale power network into the desired number of connected sub-networks with quasi-balanced FSE burdens and minimum frontier elements. After partitioning, a distributed intelligent system based on radial basis function neural network (RBF NN) and companion fuzzy system is suggested for FSE. The relevant theoretical analysis and procedure are presented in the paper. The proposed distributed intelligent FSE method has been implemented with sparse storage technique and tested on the IEEE 14, 30 and 118-bus systems, respectively. Computer simulation results show that the proposed FSE method works successfully for large-scale power networks", "fulltext": "", "keywords": "ieee 30-bus systems;large-scale power networks;on-line distributed intelligent fault section estimation system;computer simulation;fuzzy system;multi-way graph partitioning method based;minimum frontier elements;radial basis function neural network;weighted minimum degree reordering;ieee 14-bus systems;ieee 118-bus systems;connected sub-networks;sparse storage technique;quasi-balanced fse burdens;distributed intelligent system;on-line fault section estimation"}
{"name": "train_615", "title": "An intelligent tutoring system for a power plant simulator", "abstract": "In this paper, an intelligent tutoring system (ITS) is proposed for a power plant simulator. With a well designed ITS, the need for an instructor is minimized and the operator may readily and efficiently take, in real-time, the control of simulator with appropriate messages he(she) gets from the tutoring system. Using SIMULINK and based on object oriented programming (OOP) and C programming language, a fossil-fuelled power plant simulator with an ITS is proposed. Promising results are demonstrated for a typical power plant", "fulltext": "", "keywords": "control simulation;cai;object oriented programming;simulink;intelligent tutoring system;c programming language;fossil-fuelled power plant simulator"}
{"name": "train_616", "title": "An overview of modems", "abstract": "This paper describes cursory glance of different types of modems classified for application, range, line type, operating mode, synchronizing mode, modulation, etc., highly useful for all engineering students of communication, electrical, computer science and information technology students. This paper also describes the standards and protocols used and the future trend", "fulltext": "", "keywords": "computer science students;operating mode;communication students;synchronizing mode;line type;modulation;information technology students;modems;standards;protocols;engineering students;electrical students"}
{"name": "train_617", "title": "Estimation of trifocal tensor using GMM", "abstract": "A novel estimation of a trifocal tensor based on the Gaussian mixture model (GMM) is presented. The mixture model is built assuming that the residuals of inliers and outliers belong to different Gaussian distributions. The Bayesian rule is then employed to detect the inliers for re-estimation. Experiments show that the presented method is more precise and relatively unaffected by outliers", "fulltext": "", "keywords": "gaussian distributions;motion analysis;gmm;inliers;trifocal tensor estimation;gaussian mixture model;image data;outliers;bayesian rule;image analysis"}
{"name": "train_618", "title": "Blind source separation applied to image cryptosystems with dual encryption", "abstract": "Blind source separation (BSS) is explored to add another encryption level besides the existing encryption methods for image cryptosystems. The transmitted images are covered with a noise image by specific mixing before encryption and then recovered through BSS after decryption. Simulation results illustrate the validity of the proposed method", "fulltext": "", "keywords": "noise image;image cryptosystems;transmitted images;dual encryption;blind source separation"}
{"name": "train_619", "title": "Wavelet-based image segment representation", "abstract": "An efficient representation method for arbitrarily shaped image segments is proposed. This method includes a smart way to select a wavelet basis to approximate the given image segment, with improved image quality and reduced computational load", "fulltext": "", "keywords": "image segment representation;wavelet basis;dwt;reduced computational load;improved image quality;discrete wavelet transform;arbitrarily shaped image segments"}
{"name": "train_62", "title": "Text-independent speaker verification using utterance level scoring and", "abstract": "covariance modeling This paper describes a computationally simple method to perform text independent speaker verification using second order statistics. The suggested method, called utterance level scoring (ULS), allows one to obtain a normalized score using a single pass through the frames of the tested utterance. The utterance sample covariance is first calculated and then compared to the speaker covariance using a distortion measure. Subsequently, a distortion measure between the utterance covariance and the sample covariance of data taken from different speakers is used to normalize the score. Experimental results from the 2000 NIST speaker recognition evaluation are presented for ULS, used with different distortion measures, and for a Gaussian mixture model (GMM) system. The results indicate that ULS as a viable alternative to GMM whenever the computational complexity and verification accuracy needs to be traded", "fulltext": "", "keywords": "computationally simple method;utterance level scoring;normalized score;speaker covariance;distortion measure;gmm;nist speaker recognition evaluation;gaussian mixture model;text-independent speaker verification;covariance modeling;computational complexity;sample covariance;second order statistics;distortion measures;verification accuracy"}
{"name": "train_620", "title": "Adaptive image enhancement for retinal blood vessel segmentation", "abstract": "Retinal blood vessel images are enhanced by removing the nonstationary background, which is adaptively estimated based on local neighbourhood information. The result is a much better segmentation of the blood vessels with a simple algorithm and without the need to obtain a priori illumination knowledge of the imaging system", "fulltext": "", "keywords": "retinal blood vessel images;image segmentation;adaptive image enhancement;local neighbourhood information;personal identification;nonstationary background removal;security applications"}
{"name": "train_621", "title": "MPEG-4 video object-based rate allocation with variable temporal rates", "abstract": "In object-based coding, bit allocation is performed at the object level and temporal rates of different objects may vary. The proposed algorithm deals with these two issues when coding multiple video objects (MVOs). The proposed algorithm is able to successfully achieve the target bit rate, effectively code arbitrarily shaped MVOs with different temporal rates, and maintain a stable buffer level", "fulltext": "", "keywords": "multiple video objects;bit allocation;mpeg-4 video coding;variable temporal rates;object-based rate allocation;rate-distortion encoding"}
{"name": "train_622", "title": "Source/channel coding of still images using lapped transforms and block", "abstract": "classification A novel scheme for joint source/channel coding of still images is proposed. By using efficient lapped transforms, channel-optimised robust quantisers and classification methods it is shown that significant improvements over traditional source/channel coding of images can be obtained while keeping the complexity low", "fulltext": "", "keywords": "still images;block classification;channel-optimised robust quantisers;low complexity;image coding;joint source-channel coding;lapped transforms"}
{"name": "train_623", "title": "Stochastic recurrences of Jackpot Keno", "abstract": "We describe a mathematical model and simulation study for Jackpot Keno, as implemented by Jupiters Network Gaming (JNG) in the Australian state of Queensland, and as controlled by the Queensland Office of Gaming Regulation (QOGR) (http://www.qogr.qld.gov.au/keno.shtml). The recurrences for the house net hold are derived and it is seen that these are piecewise linear with a ternary domain split, and further, the split points are stochastic in nature. Since this structure is intractable (Brockett and Levine, Statistics & Probability & their Applications, CBS College Publishing, 1984), estimation of house net hold obtained through an appropriately designed simulator using a random number generator with desirable properties is described. Since the model and simulation naturally derives hold given payscale, but JNG and QOGR require payscale given hold, an inverse problem was required to be solved. This required development of a special algorithm, which may be described as a stochastic binary search. Experimental results are presented, in which the simulator is used to determine jackpot pay-scales so as to satisfy legal requirements of approximately 75% of net revenue returned to the players, i.e., 25% net hold for the house (JNG). Details of the algorithm used to solve this problem are presented, and notwithstanding the stochastic nature of the simulation, convergence to a specified hold for the inverse problem has been achieved to within 0.1% in all cases of interest to date", "fulltext": "", "keywords": "stochastic binary search;experimental results;stochastic recurrences;mathematical model;jackpot keno;jupiters network gaming;piecewise linear;simulation;probability;chinese lottery game;house net hold;legal requirement;ternary domain split;random number generator;inverse problem"}
{"name": "train_624", "title": "A hybrid ML-EM algorithm for calculation of maximum likelihood estimates in", "abstract": "semiparametric shared frailty models This paper describes a generalised hybrid ML-EM algorithm for the calculation of maximum likelihood estimates in semiparametric shared frailty models, the Cox proportional hazard models with hazard functions multiplied by a (parametric) frailty random variable. This hybrid method is much faster than the standard EM method and faster than the standard direct maximum likelihood method (ML, Newton-Raphson) for large samples. We have previously applied this method to semiparametric shared gamma frailty models, and verified by simulations the asymptotic and small sample statistical properties of the frailty variance estimates. Let theta /sub 0/ be the true value of the frailty variance parameter. Then the asymptotic distribution is normal for theta /sub 0/>0 while it is a 50-50 mixture between a point mass at zero and a normal random variable on the positive axis for theta /sub 0/=0. For small samples, simulations suggest that the frailty variance estimates are approximately distributed as an x-(100-x)% mixture, 0<or=x<or=50, between a point mass at zero and a normal random variable on the positive axis even for theta /sub 0/>0. We apply this method and verify by simulations these statistical results for semiparametric shared log-normal frailty models. We also apply the semiparametric shared gamma and log-normal frailty models to Busselton Health Study coronary heart disease data", "fulltext": "", "keywords": "normal random variable;cox proportional hazard models;coronary heart disease data;frailty variance estimates;asymptotic distribution;normal distribution;data analysis;maximum likelihood estimates;simulations;semiparametric shared log-normal frailty models;hazard functions;busselton health study;hybrid ml-em algorithm"}
{"name": "train_625", "title": "Identifying multivariate discordant observations: a computer-intensive approach", "abstract": "The problem of identifying multiple outliers in a multivariate normal sample is approached via successive testing using P-values rather than tabled critical values. Caroni and Prescott (Appl. Statist. 41, p.355, 1992) proposed a generalization of the EDR-ESD procedure of Rosner (Technometrics, 25, 1983)). Venter and Viljoen (Comput. Statist. Data Anal. 29, p.261, 1999) introduced a computer intensive method to identify outliers in a univariate outlier situation. We now generalize this method to the multivariate outlier situation and compare this new procedure with that of Caroni and Prescott (Appl. Statist. 4, p.355, 1992)", "fulltext": "", "keywords": "multiple outliers;p-values;computer-intensive approach;multivariate normal sample;tabled critical values;data analysis;multivariate outlier;stepwise testing approach;multivariate discordant observations;univariate outlier;edr-ehd procedure"}
{"name": "train_626", "title": "Approximate confidence intervals for one proportion and difference of two", "abstract": "proportions Constructing a confidence interval for a binomial proportion or the difference of two proportions is a routine exercise in daily data analysis. The best-known method is the Wald interval based on the asymptotic normal approximation to the distribution of the observed sample proportion, though it is known to have bad performance for small to medium sample sizes. Agresti et al. (1998, 2000) proposed an Adding-4 method: 4 pseudo-observations are added with 2 successes and 2 failures and then the resulting (pseudo-)sample proportion is used. The method is simple and performs extremely well. Here we propose an approximate method based on a t-approximation that takes account of the uncertainty in estimating the variance of the observed (pseudo-)sample proportion. It follows the same line of using a t-test, rather than z-test, in testing the mean of a normal distribution with an unknown variance. For some circumstances our proposed method has a higher coverage probability than the Adding-4 method", "fulltext": "", "keywords": "uncertainty;pseudo-sample proportion;normal distribution;approximate confidence intervals;data analysis;variance estimation;coverage probability;binomial proportion;difference of two proportions;t-approximation;t-test"}
{"name": "train_627", "title": "Comparison of non-stationary time series in the frequency domain", "abstract": "In this paper we compare two nonstationary time series using nonparametric procedures. Evolutionary spectra are estimated for the two series. Randomization tests are performed on groups of spectral estimates for both related and independent time series. Simulation studies show that in certain cases the tests perform reasonably well. The tests are applied to observed geological and financial time series", "fulltext": "", "keywords": "lag window;independent time series;spectral estimates;time window;simulation;financial time series;randomization tests;related time series;nonstationary time series;evolutionary spectra estimation;geological time series;nonparametric procedures"}
{"name": "train_628", "title": "Rank tests of association for exchangeable paired data", "abstract": "We describe two rank tests of association for paired exchangeable data motivated by the study of lifespans in twins. The pooled sample is ranked. The nonparametric test of association is based on R/sup +/, the sum of the smaller within-pair ranks. A second measure L/sup +/ is the sum of within-pair rank products. Under the null hypothesis of within-pair independence, the two test statistics are approximately normally distributed. Expressions for the exact means and variances of R/sup +/ and L/sup +/ are given. We describe the power of these two statistics under a close alternative hypothesis to that of independence. Both the R/sup +/ and L/sup +/ tests indicate nonparametric statistical evidence of positive association of longevity in identical twins and a negligible relationship between the lifespans of fraternal twins listed in the Danish twin registry. The statistics are also applied to the analysis of a clinical trial studying the time to failure of ventilation tubes in children with bilateral otitis media", "fulltext": "", "keywords": "association;rank tests;twin lifespans;ventilation tube failure time;identical twins;fraternal twins;test statistics;bilateral otitis media;longevity;within-pair rank products;paired exchangeable data;danish twin registry;exact variances;exact means;nonparametric test;within-pair ranks;null hypothesis;within-pair independence;nonparametric statistical evidence;clinical trial;pooled sample"}
{"name": "train_629", "title": "Calibrated initials for an EM applied to recursive models of categorical", "abstract": "variables The estimates from an EM, when it is applied to a large causal model of 10 or more categorical variables, are often subject to the initial values for the estimates. This phenomenon becomes more serious as the model structure becomes more complicated involving more variables. As a measure of compensation for this, it has been recommended in literature that EMs are implemented several times with different sets of initial values to obtain more appropriate estimates. We propose an improved approach for initial values. The main idea is that we use initials that are calibrated to data. A simulation result strongly indicates that the calibrated initials give rise to the estimates that are far closer to the true values than the initials that are not calibrated", "fulltext": "", "keywords": "initial values;em;calibrated initials;simulation;recursive models;categorical variables;large causal model"}
{"name": "train_63", "title": "Geometric source separation: merging convolutive source separation with", "abstract": "geometric beamforming Convolutive blind source separation and adaptive beamforming have a similar goal-extracting a source of interest (or multiple sources) while reducing undesired interferences. A benefit of source separation is that it overcomes the conventional cross-talk or leakage problem of adaptive beamforming. Beamforming on the other hand exploits geometric information which is often readily available but not utilized in blind algorithms. We propose to join these benefits by combining cross-power minimization of second-order source separation with geometric linear constraints used in adaptive beamforming. We find that the geometric constraints resolve some of the ambiguities inherent in the independence criterion such as frequency permutations and degrees of freedom provided by additional sensors. We demonstrate the new method in performance comparisons for actual room recordings of two and three simultaneous acoustic sources", "fulltext": "", "keywords": "geometric source separation;leakage problem;adaptive beamforming;geometric linear constraints;frequency permutations;blind algorithms;room recordings;sensors;degrees of freedom;cross-talk;second-order source separation;cross-power minimization;convolutive blind source separation;acoustic sources;geometric beamforming"}
{"name": "train_630", "title": "Score tests for zero-inflated Poisson models", "abstract": "In many situations count data have a large proportion of zeros and the zero-inflated Poisson regression (ZIP) model may be appropriate. A simple score test for zero-inflation, comparing the ZIP model with a constant proportion of excess zeros to a standard Poisson regression model, was given by van den Broek (1995). We extend this test to the more general situation where the zero probability is allowed to depend on covariates. The performance of this test is evaluated using a simulation study. To identify potentially important covariates in the zero-inflation model a composite test is proposed. The use of the general score test and the composite procedure is illustrated on two examples from the literature. The composite score test is found to suggest appropriate models", "fulltext": "", "keywords": "composite test;score tests;zero-inflated poisson regression model;count data;excess zeros;simulation;covariates;zero probability"}
{"name": "train_631", "title": "A modified Fieller interval for the interval estimation of effective doses for", "abstract": "a logistic dose-response curve Interval estimation of the gamma % effective dose ( mu /sub gamma / say) is often based on the asymptotic variance of the maximum likelihood estimator (delta interval) or Fieller's theorem (Fieller interval). Sitter and Wu (1993) compared the delta and Fieller intervals for the median effective dose ( mu /sub 50/) assuming a logistic dose-response curve. Their results indicated that although Fieller intervals are generally superior to delta intervals, they appear to be conservative. Here an adjusted form of the Fieller interval for mu /sub gamma / termed an adjusted Fieller (AF) interval is introduced. A comparison of the AF interval with the delta and Fieller intervals is provided and the properties of these three interval estimation methods are investigated", "fulltext": "", "keywords": "effective doses;logistic dose-response curve;median effective dose;asymptotic variance;modified fieller interval;maximum likelihood estimator;interval estimation;delta interval;fieller's theorem"}
{"name": "train_632", "title": "Modelling dependencies in paired comparison data a log-linear approach", "abstract": "In many Bradley-Terry models a more or less explicit assumption is that all decisions of the judges are independent. An assumption which might be questionable at least for the decisions of a given judge. In paired comparison studies, a judge chooses among objects several times, and in such cases, judgements made by the same judge are likely to be dependent. A log-linear representation for the Bradley-Terry model is developed, which takes into account dependencies between judgements. The modelling of the dependencies is embedded in the analysis of multiple binomial responses, which has the advantage of interpretability in terms of conditional odds ratios. Furthermore, the modelling is done in the framework of generalized linear models, thus parameter estimation and the assessment of goodness of fit can be obtained in the standard way by using e.g. GLIM or another standard software", "fulltext": "", "keywords": "bradley-terry model;multiple binomial responses;paired comparison data dependency modelling;generalized linear models;glim;goodness of fit;conditional odds ratios;log-linear approach;parameter estimation;judge decisions"}
{"name": "train_633", "title": "Using k-nearest-neighbor classification in the leaves of a tree", "abstract": "We construct a hybrid (composite) classifier by combining two classifiers in common use - classification trees and k-nearest-neighbor (k-NN). In our scheme we divide the feature space up by a classification tree, and then classify test set items using the k-NN rule just among those training items in the same leaf as the test item. This reduces somewhat the computational load associated with k-NN, and it produces a classification rule that performs better than either trees or the usual k-NN in a number of well-known data sets", "fulltext": "", "keywords": "data sets;feature space division;classification trees;k-nn rule;tree leaves;computational load;hybrid composite classifier;k-nearest-neighbor classification"}
{"name": "train_634", "title": "An approximation to the F distribution using the chi-square distribution", "abstract": "For the cumulative distribution function (c.d.f.) of the F distribution, F(x; k, n), with associated degrees of freedom, k and n, a shrinking factor approximation (SFA), G( lambda kx; k), is proposed for large n and any fixed k, where G(x; k) is the chi-square c.d.f. with degrees of freedom, k, and lambda = lambda (kx; n) is the shrinking factor. Numerical analysis indicates that for n/k >or= 3, approximation accuracy of the SFA is to the fourth decimal place for most small values of k. This is a substantial improvement on the accuracy that is achievable using the normal, ordinary chi-square, and Scheffe-Tukey approximations. In addition, it is shown that the theoretical approximation error of the SFA, |F(x; k,n)-G( lambda kx; k)|, is O(1/n/sup 2/) uniformly over x", "fulltext": "", "keywords": "cumulative distribution function;f distribution;chi-square distribution;degrees of freedom;numerical analysis;shrinking factor approximation"}
{"name": "train_635", "title": "Detection and estimation of abrupt changes in the variability of a process", "abstract": "Detection of change-points in normal means is a well-studied problem. The parallel problem of detecting changes in variance has had less attention. The form of the generalized likelihood ratio test statistic has long been known, but its null distribution resisted exact analysis. In this paper, we formulate the change-point problem for a sequence of chi-square random variables. We describe a procedure that is exact for the distribution of the likelihood ratio statistic for all even degrees of freedom, and gives upper and lower bounds for odd (and also for non-integer) degrees of freedom. Both the liberal and conservative bounds for chi /sub 1//sup 2/ degrees of freedom are shown through simulation to be reasonably tight. The important problem of testing for change in the normal variance of individual observations corresponds to the chi /sub 1//sup 2/ case. The non-null case is also covered, and confidence intervals for the true change point are derived. The methodology is illustrated with an application to quality control in a deep level gold mine. Other applications include ambulatory monitoring of medical data and econometrics", "fulltext": "", "keywords": "process variability;distribution;generalized likelihood ratio test statistic;lower bounds;noninteger degrees of freedom;sequence;deep level gold mine;non null case;individual observations;abrupt change detection;quality control;upper bounds;medical data;conservative bounds;confidence intervals;ambulatory monitoring;odd degrees of freedom;even degrees of freedom;econometrics;simulation;chi-square random variables;abrupt change estimation;liberal bounds"}
{"name": "train_636", "title": "FLID-DL: congestion control for layered multicast", "abstract": "We describe fair layered increase/decrease with dynamic layering (FLID-DL): a new multirate congestion control algorithm for layered multicast sessions. FLID-DL generalizes the receiver-driven layered congestion control protocol (RLC) introduced by Vicisano et al. (Proc. IEEE INFOCOM, San Francisco, CA, , p.996-1003, Mar. 1998)ameliorating the problems associated with large Internet group management protocol (IGMP) leave latencies and abrupt rate increases. Like RLC, FLID-DL, is a scalable, receiver-driven congestion control mechanism in which receivers add layers at sender-initiated synchronization points and leave layers when they experience congestion. FLID-DL congestion control coexists with transmission control protocol (TCP) flows as well as other FLID-DL sessions and supports general rates on the different multicast layers. We demonstrate via simulations that our congestion control scheme exhibits better fairness properties and provides better throughput than previous methods. A key contribution that enables FLID-DL and may be useful elsewhere is dynamic layering (DL), which mitigates the negative impact of long IGMP leave latencies and eliminates the need for probe intervals present in RLC. We use DL to respond to congestion much faster than IGMP leave operations, which have proven to be a bottleneck in practice for prior work", "fulltext": "", "keywords": "multicast layers;flid-dl;fair layered increase/decrease with dynamic layering;internet protocol multicast;layered multicast sessions;congestion control;dynamic layering;simulations;throughput;multirate congestion control algorithm;transmission control protocol;sender-initiated synchronization;tcp fairness;internet group management protocol;scalable congestion control;receiver-driven layered congestion control protocol;igmp"}
{"name": "train_637", "title": "A digital fountain approach to asynchronous reliable multicast", "abstract": "The proliferation of applications that must reliably distribute large, rich content to a vast number of autonomous receivers motivates the design of new multicast and broadcast protocols. We describe an ideal, fully scalable protocol for these applications that we call a digital fountain. A digital fountain allows any number of heterogeneous receivers to acquire content with optimal efficiency at times of their choosing. Moreover, no feedback channels are needed to ensure reliable delivery, even in the face of high loss rates. We develop a protocol that closely approximates a digital fountain using two new classes of erasure codes that for large block sizes are orders of magnitude faster than standard erasure codes. We provide performance measurements that demonstrate the feasibility of our approach and discuss the design, implementation, and performance of an experimental system", "fulltext": "", "keywords": "bulk data distribution;high loss rates;erasure codes;rs codes;multicast protocol;experimental system performance;tornado codes;scalable protocol;forward error correction;optimal efficiency;asynchronous reliable multicast;content distribution methods;internet;interoperability;ip multicast;autonomous receivers;large block size;simulation results;performance measurements;digital fountain;heterogeneous receivers;luby transform codes;fec codes;decoder;broadcast protocols;reed-solomon codes"}
{"name": "train_638", "title": "Scalable secure group communication over IP multicast", "abstract": "We introduce and analyze a scalable rekeying scheme for implementing secure group communications Internet protocol multicast. We show that our scheme incurs constant processing, message, and storage overhead for a rekey operation when a single member joins or leaves the group, and logarithmic overhead for bulk simultaneous changes to the group membership. These bounds hold even when group dynamics are not known a priori. Our rekeying algorithm requires a particular clustering of the members of the secure multicast group. We describe a protocol to achieve such clustering and show that it is feasible to efficiently cluster members over realistic Internet-like topologies. We evaluate the overhead of our own rekeying scheme and also of previously published schemes via simulation over an Internet topology map containing over 280 000 routers. Through analysis and detailed simulations, we show that this rekeying scheme performs better than previous schemes for a single change to group membership. Further, for bulk group changes, our algorithm outperforms all previously known schemes by several orders of magnitude in terms of actual bandwidth usage, processing costs, and storage requirements", "fulltext": "", "keywords": "storage requirements;scalable secure group communication;internet topology map;ip multicast;secure multicast group;network routers;authentication;overhead;group dynamics;simulation;internet protocol multicast;cryptography;storage overhead;bandwidth usage;logarithmic overhead;processing costs;rekeying algorithm;group membership;internet-like topologies;access control server"}
{"name": "train_639", "title": "Distributed servers approach for large-scale secure multicast", "abstract": "In order to offer backward and forward secrecy for multicast applications (i.e., a new member cannot decrypt the multicast data sent before its joining and a former member cannot decrypt the data sent after its leaving), the data encryption key has to be changed whenever a user joins or leaves the system. Such a change has to be made known to all the current users. The bandwidth used for such re-key messaging can be high when the user pool is large. We propose a distributed servers approach to minimize the overall system bandwidth (and complexity) by splitting the user pool into multiple groups each served by a (logical) server. After presenting an analytic model for the system based on a hierarchical key tree, we show that there is an optimal number of servers to achieve minimum system bandwidth. As the underlying user traffic fluctuates, we propose a simple dynamic scheme with low overhead where a physical server adaptively splits and merges its traffic into multiple groups each served by a logical server so as to minimize its total bandwidth. Our results show that a distributed servers approach is able to substantially reduce the total bandwidth required as compared with the traditional single-server approach, especially for those applications with a large user pool, short holding time, and relatively low bandwidth of a data stream, as in the Internet stock quote applications", "fulltext": "", "keywords": "key management;data encryption key;forward secrecy;short holding time;backward secrecy;hierarchical key tree;distributed servers;large-scale secure multicast;user traffic;system bandwidth;system complexity;multicast applications;internet stock quote applications;re-key messaging;dynamic split-and-merge scheme;traffic merging"}
{"name": "train_64", "title": "Speech enhancement using a mixture-maximum model", "abstract": "We present a spectral domain, speech enhancement algorithm. The new algorithm is based on a mixture model for the short time spectrum of the clean speech signal, and on a maximum assumption in the production of the noisy speech spectrum. In the past this model was used in the context of noise robust speech recognition. In this paper we show that this model is also effective for improving the quality of speech signals corrupted by additive noise. The computational requirements of the algorithm can be significantly reduced, essentially without paying performance penalties, by incorporating a dual codebook scheme with tied variances. Experiments, using recorded speech signals and actual noise sources, show that in spite of its low computational requirements, the algorithm shows improved performance compared to alternative speech enhancement algorithms", "fulltext": "", "keywords": "dual codebook;tied variances;recorded speech signals;mixmax model;speech intelligibility;clean speech signal;speech enhancement algorithm;noise robust speech recognition;speech signal quality;gaussian mixture model;mixture-maximum model;spectral domain;noisy speech spectrum;additive noise;mixture model;short time spectrum;noise sources;low computational requirements;performance penalties"}
{"name": "train_640", "title": "Scribe: a large-scale and decentralized application-level multicast", "abstract": "infrastructure This paper presents Scribe, a scalable application-level multicast infrastructure. Scribe supports large numbers of groups, with a potentially large number of members per group. Scribe is built on top of Pastry, a generic peer-to-peer object location and routing substrate overlayed on the Internet, and leverages Pastry's reliability, self-organization, and locality properties. Pastry is used to create and manage groups and to build efficient multicast trees for the dissemination of messages to each group. Scribe provides best-effort reliability guarantees, and we outline how an application can extend Scribe to provide stronger reliability. Simulation results, based on a realistic network topology model, show that Scribe scales across a wide range of groups and group sizes. Also, it balances the load on the nodes while achieving acceptable delay and link stress when compared with Internet protocol multicast", "fulltext": "", "keywords": "locality properties;network nodes;internet;scalable application-level multicast infrastructure;decentralized application-level multicast infrastructure;self-organization;internet protocol multicast;simulation results;generic peer-to-peer object location;pastry;scribe;discrete event simulator;group size;best-effort reliability guarantees;network topology model;link stress;delay;generic routing substrate"}
{"name": "train_641", "title": "Multiecho segmented EPI with z-shimmed background gradient compensation", "abstract": "(MESBAC) pulse sequence for fMRI A MultiEcho Segmented EPI with z-shimmed BAckground gradient Compensation (MESBAC) pulse sequence is proposed and validated for functional MRI (fMRI) study in regions suffering from severe susceptibility artifacts. This sequence provides an effective tradeoff between spatial and temporal resolution and reduces image distortion and signal dropout. The blood oxygenation level-dependent (BOLD)-weighted fMRI signal can be reliably obtained in the region of the orbitofrontal cortex (OFC). To overcome physiological motion artifacts during prolonged multisegment EPI acquisition, two sets of navigator echoes were acquired in both the readout and phase-encoding directions. Ghost artifacts generally produced by single-shot EPI acquisition were eliminated by separately placing the even and odd echoes in different k-space trajectories. Unlike most z-shim methods that focus on increasing temporal resolution for event-related functional brain mapping, the MESBAC sequence simultaneously addresses problems of image distortion and signal dropout while maintaining sufficient temporal resolution. The MESBAC sequence will be particularly useful for pharmacological and affective fMRI studies in brain regions such as the OFC, nucleus accumbens, amygdala, para-hippocampus, etc", "fulltext": "", "keywords": "severe susceptibility artifacts;z-shimmed background gradient compensation;image distortion;bold-weighted signal;multiecho segmented epi;event-related functional brain mapping;fmri;gradient compensation pulse sequence;ghost artifacts;signal dropout;navigator echoes;spatial resolution;temporal resolution;orbitofrontal cortex"}
{"name": "train_642", "title": "Reconstruction of MR images from data acquired on an arbitrary k-space", "abstract": "trajectory using the same-image weight A sampling density compensation function denoted \"same-image (SI) weight\" is proposed to reconstruct MR images from the data acquired on an arbitrary k-space trajectory. An equation for the SI weight is established on the SI criterion and an iterative scheme is developed to find the weight. The SI weight is then used to reconstruct images from the data calculated on a random trajectory in a numerical phantom case and from the data acquired on interleaved spirals in an in vivo experiment, respectively. In addition, Pipe and Menon's weight (MRM 1999;41:179-186) is also used in the reconstructions to make a comparison. The images obtained with the SI weight were found to be slightly more accurate than those obtained with Pipe's weight", "fulltext": "", "keywords": "nyquist sampling conditions;same-image weight;arbitrary k-space trajectory;iterative algorithm;random trajectory;weighting function;sampling density compensation;mri image reconstruction;numerical phantom;spiral trajectory;convolution function"}
{"name": "train_643", "title": "Time-resolved contrast-enhanced imaging with isotropic resolution and broad", "abstract": "coverage using an undersampled 3D projection trajectory Time-resolved contrast-enhanced 3D MR angiography (MRA) methods have gained in popularity but are still limited by the tradeoff between spatial and temporal resolution. A method is presented that greatly reduces this tradeoff by employing undersampled 3D projection reconstruction trajectories. The variable density k-space sampling intrinsic to this sequence is combined with temporal k-space interpolation to provide time frames as short as 4 s. This time resolution reduces the need for exact contrast timing while also providing dynamic information. Spatial resolution is determined primarily by the projection readout resolution and is thus isotropic across the FOV, which is also isotropic. Although undersampling the outer regions of k-space introduces aliased energy into the image, which may compromise resolution, this is not a limiting factor in high-contrast applications such as MRA. Results from phantom and volunteer studies are presented demonstrating isotropic resolution, broad coverage with an isotropic field of view (FOV), minimal projection reconstruction artifacts, and temporal information. In one application, a single breath-hold exam covering the entire pulmonary vasculature generates high-resolution, isotropic imaging volumes depicting the bolus passage", "fulltext": "", "keywords": "image artifacts;isotropic field of view;pulmonary vasculature;3d mri angiography;isotropic resolution;breath-hold imaging;broad coverage;variable density k-space sampling;thorax;undersampled 3d projection trajectory;abdomen;time-resolved contrast-enhanced imaging;temporal k-space interpolation;bolus passage"}
{"name": "train_644", "title": "Three-dimensional spiral MR imaging: application to renal multiphase", "abstract": "contrast-enhanced angiography A fast MR pulse sequence with spiral in-plane readout and conventional 3D partition encoding was developed for multiphase contrast-enhanced magnetic resonance angiography (CE-MRA) of the renal vasculature. Compared to a standard multiphase 3D CE-MRA with FLASH readout, an isotropic in-plane spatial resolution of 1.4*1.4 mm/sup 2/ over 2.0*1.4 mm/sup 2/ could be achieved with a temporal resolution of 6 sec. The theoretical gain of spatial resolution by using the spiral pulse sequence and the performance in the presence of turbulent flow was evaluated in phantom measurements. Multiphase 3D CE-MRA of the renal arteries was performed in five healthy volunteers using both techniques. A deblurring technique was used to correct the spiral raw data. Thereby, the off-resonance frequencies were determined by minimizing the imaginary part of the data in image space. The chosen correction algorithm was able to reduce image blurring substantially in all MRA phases. The image quality of the spiral CE-MRA pulse sequence was comparable to that of the FLASH CE-MRA with increased spatial resolution and a 25% reduced contrast-to-noise ratio. Additionally, artifacts specific to spiral MRI could be observed which had no impact on the assessment of the renal arteries", "fulltext": "", "keywords": "renal multiphase contrast-enhanced angiography;flash sequence;spiral in-plane readout;3d partition encoding;fast pulse sequence;flow artifacts;image reconstruction;image quality;deblurring;3d spiral mri;spatial resolution;off-resonance frequencies;reduced contrast-to-noise ratio;renal vasculature"}
{"name": "train_645", "title": "Oxygen-enhanced MRI of the brain", "abstract": "Blood oxygenation level-dependent (BOLD) contrast MRI is a potential method for a physiological characterization of tissue beyond mere morphological representation. The purpose of this study was to develop evaluation techniques for such examinations using a hyperoxia challenge. Administration of pure oxygen was applied to test these techniques, as pure oxygen can be expected to induce relatively small signal intensity (SI) changes compared to CO/sub 2/-containing gases and thus requires very sensitive evaluation methods. Fourteen volunteers were investigated by alternating between breathing 100% O/sub 2/ and normal air, using two different paradigms of administration. Changes ranged from >30% in large veins to 1.71%+or-0.14% in basal ganglia and 0.82%+or-0.08% in white matter. To account for a slow physiological response function, a reference for correlation analysis was derived from the venous reaction. An objective method is presented that allows the adaptation of the significance threshold to the complexity of the paradigm used. Reference signal characteristics in representative brain tissue regions were established. As the presented evaluation scheme proved its applicability to small SI changes induced by pure oxygen, it can readily be used for similar experiments with other gases", "fulltext": "", "keywords": "venous reaction;correlation analysis;normal air breathing;significance threshold;functional imaging;physiological response function;fourier transform analysis;mri contrast agent;oxygen-enhanced mri;oxygen breathing;paradigm complexity;bold contrast mri;brain;hyperoxia"}
{"name": "train_646", "title": "Vibration control of structure by using tuned mass damper (development of", "abstract": "system which suppress displacement of auxiliary mass) In vibration control of a structure by using an active tuned mass damper (ATMD), stroke of the auxiliary mass is so limited that it is difficult to control the vibration in the case of large disturbance input. In this paper, two methods are proposed for the problem. One of the methods is a switching control system by two types of controllers. One of the controllers is a normal controller under small relative displacement of the auxiliary mass, and the other is not effective only for first mode of vibration under large relative displacement of the auxiliary mass. New variable gain control system is constructed by switching these two controllers. The other method is the brake system. In active vibration control, it is necessary to use actuator for active control. By using the actuator, the proposed system puts on the brake to suppress displacement increase of the auxiliary mass under large disturbance input. Finally, the systems are designed and the effectiveness of the systems is confirmed by the simulation", "fulltext": "", "keywords": "auxiliary mass displacement suppression;vibration control;actuator;active control;brake system;controllers;variable gain control system;tuned mass damper"}
{"name": "train_647", "title": "Experimental design methodology and data analysis technique applied to optimise", "abstract": "an organic synthesis The study was aimed at maximising the yield of a Michaelis-Becker dibromoalkane monophosphorylation reaction. In order to save time and money, we first applied a full factorial experimental design to search for the optimum conditions while performing a small number of experiments. We then used the principal component analysis (PCA) technique to evidence two uncontrolled factors. Lastly, a special experimental design that took into account all the influential factors allowed us to determine the maximum-yield experimental conditions. This study also evidenced the complementary nature of experimental design methodology and data analysis techniques", "fulltext": "", "keywords": "maximum-yield experimental conditions;principal component analysis;full factorial experimental design;uncontrolled factors;organic synthesis;optimum conditions;michaelis-becker dibromoalkane monophosphorylation reaction;data analysis technique"}
{"name": "train_648", "title": "Study of ambiguities inherent to the spectral analysis of Voigt profiles-a", "abstract": "modified Simplex approach In pulsed spectrometries, temporal transients are often analyzed directly in the temporal domain, assuming they consist only of purely exponentially decaying sinusoids. When experimental spectra actually consist of Gaussian or Voigt profiles (Gauss-Lorentz profiles), we show that the direct methods may erroneously interpret such lines as the sum of two or more Lorentzian profiles. Using a Nelder and Mead Simplex method, modified by introducing new means to avoid degeneracies and quenchings in secondary minima, we demonstrate that a large number of different solutions can be obtained with equivalent accuracy over the limited acquisition time interval, with final peak parameters devoid of physical or chemical meaning", "fulltext": "", "keywords": "nelder and mead simplex method;gauss-lorentz profiles;voigt profiles;gaussian profiles;accuracy;pulsed spectrometries;temporal transients;final peak parameters;limited acquisition time interval;spectral analysis"}
{"name": "train_649", "title": "Methods for outlier detection in prediction", "abstract": "If a prediction sample is different from the calibration samples, it can be considered as an outlier in prediction. In this work, two techniques, the use of uncertainty estimation and the convex hull method are studied to detect such prediction outliers. Classical techniques (Mahalanobis distance and X-residuals), potential functions and robust techniques are used for comparison. It is concluded that the combination of the convex hull method and uncertainty estimation offers a practical way for detecting outliers in prediction. By adding the potential function method, inliers can also be detected", "fulltext": "", "keywords": "outlier detection;uncertainty estimation;inliers;mahalanobis distance;calibration samples;robust techniques;convex hull method;x-residuals;prediction sample;potential functions"}
{"name": "train_65", "title": "The use of subtypes and stereotypes in the UML model", "abstract": "Based on users' experiences of Version 1.3 of the Unified Modeling Language (UML) of the Object Management Group (OMG), a Request For Information in 1999 elicited several responses which were asked to identify \"problems\" but not to offer any solutions. One of these responses is examined for \"problems\" relating to the UML metamodel and here some solutions to the problems identified there are proposed. Specifically, we evaluate the metamodel relating to stereotypes versus subtypes; the various kinds of Classifier (particularly Types, Interfaces and Classes); the introduction of a new subtype for the whole part relationship; as well as identifying areas in the metamodel where the UML seems to have been used inappropriately in the very definition of the UML's metamodel", "fulltext": "", "keywords": "stereotypes;whole part relationship;classifier;uml model;object management group;unified modeling language;subtypes;request for information"}
{"name": "train_650", "title": "Molecular descriptor selection combining genetic algorithms and fuzzy logic:", "abstract": "application to database mining procedures A new algorithm, devoted to molecular descriptor selection in the context of data mining problems, has been developed. This algorithm is based on the concepts of genetic algorithms (GA) for descriptor hyperspace exploration and combined with a stepwise approach to get local convergence. Its selection power was evaluated by a fitness function derived from a fuzzy clustering method. Different training and test sets were randomly generated at each GA generation. The fitness score was derived by combining the scores of the training and test sets. The ability of the proposed algorithm to select relevant subsets of descriptors was tested on two data sets. The first one, an academic example, corresponded to the artificial problem of Bullseye, the second was a real data set including 114 olfactory compounds divided into three odor categories. In both cases, the proposed method allowed to improve the separation between the different data set classes", "fulltext": "", "keywords": "data mining;molecular descriptor selection;local convergence;fuzzy clustering method;bullseye;database mining;olfactory compounds;fitness function;genetic algorithms;fitness score;training sets;descriptor hyperspace exploration;test sets;odor categories;fuzzy logic;stepwise approach"}
{"name": "train_651", "title": "Application-layer multicasting with Delaunay triangulation overlays", "abstract": "Application-layer multicast supports group applications without the need for a network-layer multicast protocol. Here, applications arrange themselves in a logical overlay network and transfer data within the overlay. We present an application-layer multicast solution that uses a Delaunay triangulation as an overlay network topology. An advantage of using a Delaunay triangulation is that it allows each application to locally derive next-hop routing information without requiring a routing protocol in the overlay. A disadvantage of using a Delaunay triangulation is that the mapping of the overlay to the network topology at the network and data link layer may be suboptimal. We present a protocol, called Delaunay triangulation (DT protocol), which constructs Delaunay triangulation overlay networks. We present measurement experiments of the DT protocol for overlay networks with up to 10 000 members, that are running on a local PC cluster with 100 Linux PCs. The results show that the protocol stabilizes quickly, e.g., an overlay network with 10 000 nodes can be built in just over 30 s. The traffic measurements indicate that the average overhead of a node is only a few kilobits per second if the overlay network is in a steady state. Results of throughput experiments of multicast transmissions (using TCP unicast connections between neighbors in the overlay network) show an achievable throughput of approximately 15 Mb/s in an overlay with 100 nodes and 2 Mb/s in an overlay with 1000 nodes", "fulltext": "", "keywords": "network nodes;application-layer multicasting;overlay networks;average overhead;2 mbit/s;delaunay triangulation overlays;group applications;traffic measurements;data transfer;local pc cluster;15 mbit/s;network-layer multicast protocol;data link layer;logical overlay network;next-hop routing information;multicast transmissions;delaunay triangulation protocol;overlay network topology;throughput experiments;tcp unicast connections;measurement experiments;dt protocol;linux pc"}
{"name": "train_652", "title": "A case for end system multicast", "abstract": "The conventional wisdom has been that Internet protocol (IP) is the natural protocol layer for implementing multicast related functionality. However, more than a decade after its initial proposal, IP multicast is still plagued with concerns pertaining to scalability, network management, deployment, and support for higher layer functionality such as error, flow, and congestion control. We explore an alternative architecture that we term end system multicast, where end systems implement all multicast related functionality including membership management and packet replication. This shifting of multicast support from routers to end systems has the potential to address most problems associated with IP multicast. However, the key concern is the performance penalty associated with such a model. In particular, end system multicast introduces duplicate packets on physical links and incurs larger end-to-end delays than IP multicast. We study these performance concerns in the context of the Narada protocol. In Narada, end systems self-organize into an overlay structure using a fully distributed protocol. Further, end systems attempt to optimize the efficiency of the overlay by adapting to network dynamics and by considering application level performance. We present details of Narada and evaluate it using both simulation and Internet experiments. Our results indicate that the performance penalties are low both from the application and the network perspectives. We believe the potential benefits of transferring multicast functionality from end systems to routers significantly outweigh the performance penalty incurred", "fulltext": "", "keywords": "protocol layer;internet protocol;end system multicast;distributed protocol;higher layer functionality;overlay structure;network dynamics;end-to-end delays;internet experiments;congestion control;packet replication;performance penalties;ip multicast;narada protocol;network management;application level performance;network scalability;membership management;network routers;simulation;self-organizing protocol"}
{"name": "train_653", "title": "Indexing-neglected and poorly understood", "abstract": "The growth of the Internet has highlighted the use of machine indexing. The difficulties in using the Internet as a searching device can be frustrating. The use of the term \"python\" is given as an example. Machine indexing is noted as \"rotten\" and human indexing as \"capricious.\" The problem seems to be a lack of a theoretical foundation for the art of indexing. What librarians have learned over the last hundred years has yet to yield a consistent approach to what really works best in preparing index terms and in the ability of our customers to search the various indexes. An attempt is made to consider the elements of indexing, their pros and cons. The argument is made that machine indexing is far too prolific in its production of index terms. Neither librarians nor computer programmers have made much progress to improve Internet indexing. Human indexing has had the same problems for over fifty years", "fulltext": "", "keywords": "index terms;machine indexing;internet;searching;human indexing"}
{"name": "train_654", "title": "A question of perspective: assigning Library of Congress subject headings to", "abstract": "classical literature and ancient history This article explains the concept of world view and shows how the world view of cataloguers influences the development and assignment of subject headings to works about other cultures and civilizations, using works from classical literature and ancient history as examples. Cataloguers are encouraged to evaluate the headings they assign to works in classical literature and ancient history in terms of the world views of Ancient Greece and Rome so that headings reflect the contents of the works they describe and give fuller expression to the diversity of thoughts and themes that characterize these ancient civilizations", "fulltext": "", "keywords": "library of congress subject heading assignment;world view;cultures;ancient greece;civilizations;ancient history;classical literature;ancient rome"}
{"name": "train_655", "title": "Mapping CCF to MARC21: an experimental approach", "abstract": "The purpose of this article is to raise and address a number of issues pertaining to the conversion of Common Communication Format (CCF) into MARC21. In this era of global resource sharing, exchange of bibliographic records from one system to another is imperative in today's library communities. Instead of using a single standard to create machine-readable catalogue records, more than 20 standards have emerged and are being used by different institutions. Because of these variations in standards, sharing of resources and transfer of data from one system to another among the institutions locally and globally has become a significant problem. Addressing this problem requires keeping in mind that countries such as India and others in southeast Asia are using the CCF as a standard for creating bibliographic cataloguing records. This paper describes a way to map the bibliographic catalogue records from CCF to MARC21, although 100% mapping is not possible. In addition, the paper describes an experimental approach that enumerates problems that may occur during the mapping of records/exchanging of records and how these problems can be overcome", "fulltext": "", "keywords": "india;southeast asia;common communication format conversion;global resource sharing;library communities;marc21;bibliographic records exchange;data transfer;ccf to marc21 mapping;machine-readable catalogue records;standards"}
{"name": "train_656", "title": "The cataloger's workstation revisited: utilizing Cataloger's Desktop", "abstract": "A few years into the development of Cataloger's Desktop, an electronic cataloging tool aggregator available through the Library of Congress, is an opportune time to assess its impact on cataloging operations. A search for online cataloging tools on the Internet indicates a proliferation of cataloging tool aggregators; which provide access to online documentation related to cataloging practices and procedures. Cataloger's Desktop stands out as a leader among these aggregators. Results of a survey to assess 159 academic ARL and large public libraries' reasons for use or non-use of Cataloger's Desktop highlight the necessity of developing strategies for its successful implementation including training staff, providing documentation, and managing technical issues", "fulltext": "", "keywords": "internet;cataloging tool aggregators;online documentation;online cataloging tools;staff training;large public libraries;documentation;cataloger's workstation;managing technical issues;cataloger's desktop;academic arl;electronic cataloging tool"}
{"name": "train_657", "title": "The web services agenda", "abstract": "Even the most battle-scarred of CIOs have become excited at the prospect of what web services can do for their businesses. But there are still some shortcomings to be addressed", "fulltext": "", "keywords": "transaction support;security;web services"}
{"name": "train_658", "title": "Process pioneers [agile business]", "abstract": "By managing IT infrastructures along so-called 'top down' lines, organisations can streamline their business processes, eliminate redundant tasks and increase automation", "fulltext": "", "keywords": "managing it infrastructures;increase automation;business processes;agile business"}
{"name": "train_659", "title": "Integration - no longer a barrier? [agile business]", "abstract": "Web services will be a critical technology for enabling the 'agile business'", "fulltext": "", "keywords": "agile business;amr research;iona;integration middleware;web services"}
{"name": "train_66", "title": "Regression testing of database applications", "abstract": "Database applications features such as Structured Query Language or SQL, exception programming, integrity constraints, and table triggers pose difficulties for maintenance activities; especially for regression testing that follows modifications to database applications. In this work, we address these difficulties and propose a two phase regression testing methodology. In phase 1, we explore control flow and data flow analysis issues of database applications. Then, we propose an impact analysis technique that is based on dependencies that exist among the components of database applications. This analysis leads to selecting test cases from the initial test suite for regression testing the modified application. In phase 2, further reduction in the regression test cases is performed by using reduction algorithms. We present two such algorithms. The Graph Walk algorithm walks through the control flow graph of database modules and selects a safe set of test cases to retest. The Call Graph Firewall algorithm uses a firewall for the inter procedural level. Finally, a maintenance environment for database applications is described. Our experience with this regression testing methodology shows that the impact analysis technique is adequate for selecting regression tests and that phase 2 techniques can be used for further reduction in the number of theses tests", "fulltext": "", "keywords": "call graph firewall algorithm;data flow analysis;impact analysis;integrity constraints;database applications;table triggers;sql;structured query language;reduction algorithms;control flow graph;exception programming;control flow analysis;two phase regression testing methodology;graph walk algorithm"}
{"name": "train_660", "title": "At your service [agile businesses]", "abstract": "Senior software executives from three of the world's leading software companies, and one smaller, entrepreneurial software developer, explain the impact that web services, business process management and integrated application architectures are having on their product development plans, and share their vision of the roles these products will play in creating agile businesses", "fulltext": "", "keywords": "integrated application architectures;agile businesses;business process management;software companies;web services"}
{"name": "train_661", "title": "All change [agile business]", "abstract": "What does it take for an organisation to become an agile business? Its employees probably need to adhere to new procurement policies, work more closely with colleagues in other departments, meet more exacting sales targets, and offer higher standards of customer service and support. In short, they need to change the way they work. Implementing technologies to support agile business models and underpin new practices is a complex task in itself. But getting employees to adopt new practices is far harder, and one that requires careful handling, says Barry O'Connell, general manager of business-to-employee (B2E) solutions at systems vendor Hewlett-Packard (HP)", "fulltext": "", "keywords": "corporate transformation;agile business;organisational change"}
{"name": "train_663", "title": "The road ahead [supply chains]", "abstract": "Executive supply chain managers, says David Metcalfe of Forrester Research, need the skills and precision of Mongolian archers on horseback. They must be able to hit their target, in this case customer demand, while moving at great speed. But what is wrong with the supply chains companies have in place already? According to Metcalfe, current manufacturing models are too inflexible. A recent survey conducted by Forrester Research supports this claim. It found that 42% of respondents could not transfer production from one plant to another in the event of a glitch in the supply chain. A further 32% said it would be possible, but extremely costly", "fulltext": "", "keywords": "business networks;forrester research;supply chains;survey;manufacturing"}
{"name": "train_664", "title": "The agile revolution [business agility]", "abstract": "There is a new business revolution in the air. The theory is there, the technology is evolving, fast. It is all about agility", "fulltext": "", "keywords": "software deployment;supply chains;software design;organisational structures;business agility"}
{"name": "train_67", "title": "Metaschemas for ER, ORM and UML data models: a comparison", "abstract": "This paper provides metaschemas for some of the main database modeling notations used in industry. Two Entity Relationship (ER) notations (Information Engineering and Barker) are examined in detail, as well as Object Role Modeling (ORM) conceptual schema diagrams. The discussion of optionality, cardinality and multiplicity is widened to include Unified Modeling Language (UML) class diagrams. Issues addressed in the metamodel analysis include the normalization impact of non-derived constraints on derived associations, the influence of orthogonality on language transparency, and trade-offs between simplicity and expressibility. To facilitate comparison, the same modeling notation is used to display each metaschema. For this purpose, ORM is used because of its greater expressibility and clarity", "fulltext": "", "keywords": "barker notation;optionality;data models;information engineering;language transparency;class diagrams;metaschemas;entity relationship modeling;uml;orthogonality;cardinality;database modeling notations;normalization;object role modeling;unified modeling language;conceptual schema diagrams;multiplicity;orm"}
{"name": "train_671", "title": "Expert advice - how can my organisation take advantage of reverse auctions", "abstract": "without jeopardising existing supplier relationships? In a recent survey, AMR Research found that companies that use reverse auctions to negotiate prices with suppliers typically achieve savings of between 10% and 15% on direct goods and between 20% and 25% on indirect goods, and can slash sourcing cycle times from months to weeks. Suppliers, however, are less enthusiastic. They believe that these savings are achieved only by stripping the human element out of negotiations and evaluating bids on price alone, which drives down their profit margins. As a result, reverse auctions carry the risk of jeopardising long-term and trusted relationships. Suppliers that have not been involved in a reverse auction before typically fear the bidding event itself - arguably the most theatrical and, therefore, most hyped-up part of the process. Although it may only last one hour, weeks of preparation go into setting up a successful bidding event", "fulltext": "", "keywords": "reverse auctions;preparation;request for quotation;supplier relationships"}
{"name": "train_673", "title": "The Information Age interview - Capital One", "abstract": "Credit card company Capital One attributes its rapid customer growth to the innovative use of cutting-edge technology. European CIO Catherine Doran talks about the systems that have fuelled that runaway success", "fulltext": "", "keywords": "cutting-edge technology;customer growth;capital one;credit card company"}
{"name": "train_674", "title": "Portal payback", "abstract": "The benefits of deploying a corporate portal are well-documented: access to applications and content is centralised, so users do not spend hours searching for information; the management of disparate applications is also centralised, and by allowing users to access 'self-service' applications in areas such as human resources and procurement, organisations spend less time on manual processing tasks. But how far can prospective customers rely on the ROI figures presented to them by portal technology vendors? In particular, how reliable are the 'ROI calculators' these vendors supply on their web sites?", "fulltext": "", "keywords": "web sites;metrics;return on investment;roi calculator;corporate portal"}
{"name": "train_675", "title": "Application foundations [application servers]", "abstract": "The changing role of application servers means choosing the right platform has become a complex challenge", "fulltext": "", "keywords": "microsoft .net;java 2 enterprise edition;security;load balancing;availability;application servers;transaction processing"}
{"name": "train_676", "title": "Impossible choice [web hosting service provider]", "abstract": "Selecting a telecoms and web hosting service provider has become a high-stakes game of chance", "fulltext": "", "keywords": "customer service;web hosting service provider;it managers;selection"}
{"name": "train_677", "title": "Acts to facts catalogue", "abstract": "The paper shows a way to satisfy users' changing and specific information needs by providing the modified format-author-collaborators-title-series-subject (FACTS). catalogue instead of the traditional author-collaborator-title-series-subjects (ACTS) catalogue", "fulltext": "", "keywords": "author-collaborator-title-series-subjects catalogue;information needs;format-author-collaborators-title-series-subject catalogue"}
{"name": "train_678", "title": "Marketing in CSIR libraries and information centres: a study on promotional", "abstract": "efforts This paper examines the attitudes of librarians towards the promotional aspects in several CSIR libraries and information centres of India. The issues related to promotional activities of these libraries have been evaluated to determine the extent to which they are being practised. Librarians hold positive attitudes about promotional aspects of libraries and often practise them without knowing they are practising marketing concepts. Suggestions and strategies for improving the promotional activities in libraries and information services are put forth so as to meet the information needs and demands of clientele", "fulltext": "", "keywords": "india;csir libraries;marketing;promotional activities;information needs;information centres"}
{"name": "train_679", "title": "Himalayan information system: a proposed model", "abstract": "The information explosion and the development in information technology force us to develop information systems in various fields. The research on Himalaya has achieved phenomenal growth in recent years in India. The information requirements of Himalayan researchers are divergent in nature. In order to meet these divergent needs, all information generated in various Himalayan research institutions has to be collected and organized to facilitate free flow of information. This paper describes the need for a system for Himalayan information. It also presents the objectives of Himalayan information system (HIMIS). It discusses in brief the idea of setting up a HIMIS and explains its utility to the users. It appeals to the government for supporting the development of such system", "fulltext": "", "keywords": "himalayan information system model;india;information technology;himis;government;information explosion;information network;information requirements"}
{"name": "train_68", "title": "Human factors research on data modeling: a review of prior research, an", "abstract": "extended framework and future research directions This study reviews and synthesizes human factors research on conceptual data modeling. In addition to analyzing the variables used in earlier studies and summarizing the results of this stream of research, we propose a new framework to help with future efforts in this area. The study finds that prior research has focused on issues that are relevant when conceptual models are used for communication between systems analysts and developers (Analyst Developer models) whereas the issues important for models that are used to facilitate communication between analysts and users (User-Analyst models) have received little attention and, hence, require a significantly stronger role in future research. In addition, we emphasize the importance of building a strong theoretical foundation and using it to guide future empirical work in this area", "fulltext": "", "keywords": "conceptual data modeling;analyst developer models;database;user-analyst models;future efforts;human factors"}
{"name": "train_680", "title": "Information needs of the working journalists in Orissa: a study", "abstract": "Provides an insight into the various information needs of working journalists in Orissa. Analyses data received from 226 working journalists representing 40 newspaper organisations. Also depicts the specialisation of working journalists, their frequency of information requirement, mode of dissemination preferred, information sources explored, mode of services opted, and their information privations. The study asserts that subjects primarily concerned with the professional work and image of the working journalists are rated utmost significant", "fulltext": "", "keywords": "information requirement;working journalists;information sources;data analysis;professional work;information dissemination;newspaper organisations;information needs"}
{"name": "train_681", "title": "Construction of information retrieval thesaurus for family planning terms using", "abstract": "CDS/ISIS The thesaurus as a tool for information retrieval and as an alternative to the existing scheme of classifications in information retrieval is discussed. The paper considers the emergence of the information retrieval thesaurus and its definition. Family planning is a multidisciplinary subject covering socio economic, cultural, psychological and medical fields. This necessitated the construction of a thesaurus for the Family Planning discipline. The construction is based on UNISIST, ISO 2788 and BS 5723 guidelines by using CDS/ISIS software", "fulltext": "", "keywords": "culture;classification;medicine;thesaurus;family planning;socio economic field;bs 5723;bibliographic databases;psychology;iso 2788;family planning terms;cds/isis software;information retrieval;unisist"}
{"name": "train_682", "title": "Information and information technology", "abstract": "This paper reveals the concepts of information and information technology. It also describes the close relationship between information and information technology. It explains a basic mechanism of different devices of information technology and connotes how they are useful to store, process and retrieve the information. In addition of this, the paper shows the present status of information technology and Indian universities", "fulltext": "", "keywords": "information technology;information processing;indian universities;information retrieval;information;information storage"}
{"name": "train_683", "title": "Knowledge management", "abstract": "The article defines knowledge management, discusses its role, and describes its functions. It also explains the principles of knowledge management, enumerates the strategies involved in knowledge management, and traces its history in brief. The focus is on its interdisciplinary nature. The steps involved in knowledge management i.e. identifying, collecting and capturing, selecting, organizing and storing, sharing, applying, and creating, are explained. The pattern of knowledge management initiatives is also considered", "fulltext": "", "keywords": "knowledge management"}
{"name": "train_684", "title": "Individual decision making using fuzzy set theory", "abstract": "The paper shows the importance of decision making by an individual and highlights the prime domain of decision making where fuzzy set theory can be used as a tool. Fuzzy set theory has been used on rational model of decision making to arrive at the desired conclusion", "fulltext": "", "keywords": "individual decision making;fuzzy set theory;rational decision making model"}
{"name": "train_685", "title": "Robotically enhanced placement of left ventricular epicardial electrodes during", "abstract": "implantation of a biventricular implantable cardioverter defibrillator system Biventricular pacing has gained increasing acceptance in advanced heart failure patients. One major limitation of this therapy is positioning the left ventricular stimulation lead via the coronary sinus. This report demonstrates the feasibility of totally endoscopic direct placement of an epicardial stimulation lead on the left ventricle using the daVinci surgical system", "fulltext": "", "keywords": "davinci surgical system;left ventricular epicardial electrodes;advanced heart failure patients;biventricular implantable cardioverter defibrillator system implantation;left ventricular stimulation lead positioning;coronary sinus;epicardial leads;totally endoscopic direct placement;left ventricular pacing"}
{"name": "train_686", "title": "Technology CAD of SiGe-heterojunction field effect transistors", "abstract": "A 2D virtual wafer fabrication simulation suite has been employed for the technology CAD of SiGe channel heterojunction field effect transistors (HFETs). Complete fabrication process of SiGe p-HFETs has been simulated. The SiGe material parameters and mobility model were incorporated to simulate Si/SiGe p-HFETs with a uniform germanium channel having an L/sub eff/ of 0.5 mu m. A significant improvement in linear transconductance is observed when compared to control-silicon p-MOSFETs", "fulltext": "", "keywords": "uniform channel;mobility model;material parameters;technology cad;fabrication process;0.5 micron;sige;linear transconductance;heterojunction field effect transistors"}
{"name": "train_687", "title": "Image reconstruction of simulated specimens using convolution back projection", "abstract": "This paper reports the reconstruction of cross-sections of composite structures. The convolution back projection (CBP) algorithm has been used to capture the attenuation field over the specimen. Five different test cases have been taken up for evaluation. These cases represent varying degrees of complexity. In addition, the role of filters on the nature of the reconstruction errors has also been discussed. Numerical results obtained in the study reveal that CBP algorithm is a useful tool for qualitative as well as quantitative assessment of composite regions encountered in engineering applications", "fulltext": "", "keywords": "reconstruction errors;simulated specimens;composite structures;engineering applications;convolution back projection;image reconstruction;filters;attenuation field;computerised tomography;composite regions;cbp algorithm"}
{"name": "train_688", "title": "Active vibration control of piezolaminated smart beams", "abstract": "This paper deals with the active vibration control of beam like structures with distributed piezoelectric sensor and actuator layers bonded on top and bottom surfaces of the beam. A finite element model based on Euler-Bernoulli beam theory has been developed. The contribution of the piezoelectric sensor and actuator layers on the mass and stiffness of the beam is considered. Three types of classical control strategies, namely direct proportional feedback, constant-gain negative velocity feedback and Lyapunov feedback and an optimal control strategy, linear quadratic regulator (LQR) scheme are applied to study their control effectiveness. Also, the control performance with different types of loading, such as impulse loading, step loading, harmonic and random loading is studied", "fulltext": "", "keywords": "stiffness;top surfaces;lyapunov feedback;impulse loading;constant-gain negative velocity feedback;optimal control strategy;random loading;distributed piezoelectric actuator layers;control effectiveness;bottom surfaces;step loading;piezolaminated smart beams;euler-bernoulli beam theory;mass;beam like structures;active vibration control;direct proportional feedback;finite element model;linear quadratic regulator;distributed piezoelectric sensor layers;harmonic loading"}
{"name": "train_689", "title": "Continuous-time linear systems: folklore and fact", "abstract": "We consider a family of continuous input-output maps representing linear time-invariant systems that take a set of signals into itself. It is shown that this family contains maps whose impulse response is the zero function, but which take certain inputs into nonzero outputs. It is shown also that this family contains members whose input-output properties are not described by their frequency domain response functions, and that the maps considered need not even commute", "fulltext": "", "keywords": "continuous input-output maps;commutation;frequency domain response;time-invariant systems;impulse response;linear systems;continuous-time systems;signal processing;zero function"}
{"name": "train_69", "title": "Sensitivity calibration of ultrasonic detectors based using ADD diagrams", "abstract": "The paper considers basic problems related to utilization of ADD diagrams in calibrating sensitivity of ultrasonic detectors. We suggest that a convenient tool for solving such problems can be the software package ADD Universal. Version 2.1 designed for plotting individual ADD diagrams for normal and slanted transducers. The software is compatible with the contemporary operational system Windows-95(98). Reference signals for calibration are generated in a sample with cylindrical holes", "fulltext": "", "keywords": "sensitivity calibration;calibration;software package;add diagrams;contemporary operational system windows-95(98;ultrasonic testing;normal transducers;ultrasonic detectors;slanted transducers;reference signals;cylindrical holes"}
{"name": "train_690", "title": "Robust Kalman filter design for discrete time-delay systems", "abstract": "The problem of finite- and infinite-horizon robust Kalman filtering for uncertain discrete-time systems with state delay is addressed. The system under consideration is subject to time-varying norm-bounded parameter uncertainty in both the state and output matrices. We develop a new methodology for designing a linear filter such that the error variance of the filter is guaranteed to be within a certain upper bound for any allowed uncertainty and time delay. The solution is given in terms of two Riccati equations. Multiple time-delay systems are also investigated", "fulltext": "", "keywords": "robust kalman filter;norm-bounded parameter uncertainty;riccati equations;time-varying parameter uncertainty;state matrices;linear filter;discrete time-delay systems;output matrices;state delay;uncertain systems;robust state estimation"}
{"name": "train_691", "title": "Robust output-feedback control for linear continuous uncertain state delayed", "abstract": "systems with unknown time delay The state-delayed time often is unknown and independent of other variables in most real physical systems. A new stability criterion for uncertain systems with a state time-varying delay is proposed. Then, a robust observer-based control law based on this criterion is constructed via the sequential quadratic programming method. We also develop a separation property so that the state feedback control law and observer can be independently designed and maintain closed-loop system stability. An example illustrates the availability of the proposed design method", "fulltext": "", "keywords": "time delay;closed-loop system stability;state feedback control law;output-feedback control;linear continuous systems;observer-based control law;sequential quadratic programming;robust control;uncertain systems;state time-varying delay;state delayed systems"}
{"name": "train_692", "title": "A partial converse to Hadamard's theorem on homeomorphisms", "abstract": "A theorem by Hadamard gives a two-part condition under which a map from one Banach space to another is a homeomorphism. The theorem, while often very useful, is incomplete in the sense that it does not explicitly specify the family of maps for which the condition is met. Here, under a typically weak additional assumption on the map, we show that Hadamard's condition is met if, and only if, the map is a homeomorphism with a Lipschitz continuous inverse. An application is given concerning the relation between the stability of a nonlinear system and the stability of related linear systems", "fulltext": "", "keywords": "banach space;lipschitz continuous inverse;nonlinear networks;partial converse;homeomorphisms;hadamard theorem;linear system stability;linearization;nonlinear feedback systems;nonlinear system stability"}
{"name": "train_693", "title": "Lifting factorization of discrete W transform", "abstract": "A general method is proposed to factor the type-IV discrete W transform (DWT-IV) into lifting steps and additions. Then, based on the relationships among various types of DWTs, four types of DWTs are factored into lifting steps and additions. After approximating the lifting matrices, we get four types of new integer DWTs (IntDWT-I, IntDWT-II, IntDWT-III, and IntDWT-IV) which are floating-point multiplication free. Integer-to-integer transforms (II-DWT), which approximate to DWT, are also proposed. Fast algorithms are given for the new transforms and their computational complexities are analyzed", "fulltext": "", "keywords": "lifting factorization;lossless coding schemes;dwt;lifting matrices;mobile computing;filter bank;feature extraction;integer arithmetic;multiframe detection;mobile devices;data compression;computational complexity;discrete wavelet transform;integer transforms"}
{"name": "train_694", "title": "A novel genetic algorithm for the design of a signed power-of-two coefficient", "abstract": "quadrature mirror filter lattice filter bank A novel genetic algorithm (GA) for the design of a canonical signed power-of-two (SPT) coefficient lattice structure quadrature mirror filter bank is presented. Genetic operations may render the SPT representation of a value noncanonical. A new encoding scheme is introduced to encode the SPT values. In this new scheme, the canonical property of the SPT values is preserved under genetic operations. Additionally, two new features that drastically improve the performance of our GA are introduced. (1) An additional level of natural selection is introduced to simulate the effect of natural selection when sperm cells compete to fertilize an ovule; this dramatically improves the offspring survival rate. A conventional GA is analogous to intracytoplasmic sperm injection and has an extremely low offspring survival rate, resulting in very slow convergence. (2) The probability of mutation for each codon of a chromosome is weighted by the reciprocal of its effect. Because of these new features, the performance of our new GA outperforms conventional GAs", "fulltext": "", "keywords": "chromosome codon;lattice filter bank;natural selection;quadrature mirror filter;offspring survival rate;genetic algorithm;qmf;perfect reconstruction;signed power-of-two coefficient lattice structure;signal processing;encoding scheme"}
{"name": "train_695", "title": "Design of high-performance wavelets for image coding using a perceptual time", "abstract": "domain criterion This paper presents a new biorthogonal linear-phase wavelet design for image compression. Instead of calculating the prototype filters as spectral factors of a half-band filter, the design is based on the direct optimization of the low pass analysis filter using an objective function directly related to a perceptual criterion for image compression. This function is defined as the product of the theoretical coding gain and an index called the peak-to-peak ratio, which was shown to have high correlation with perceptual quality. A distinctive feature of the proposed technique is a procedure by which, given a \"good\" starting filter, \"good\" filters of longer lengths are generated. The results are excellent, showing a clear improvement in perceptual image quality. Also, we devised a criterion for constraining the coefficients of the filters in order to design wavelets with minimum ringing", "fulltext": "", "keywords": "high-performance wavelets;prototype filters;image compression;objective function;perceptual time domain criterion;peak-to-peak ratio;filter banks;biorthogonal linear-phase wavelet design;low pass filter;half-band filter;image coding;perceptual image quality;coding gain;analysis filter"}
{"name": "train_696", "title": "Design and implementation of a new sliding-mode observer for speed-sensorless", "abstract": "control of induction machine In this letter, a new sliding-mode-sensorless control algorithm is proposed for the field-oriented induction machine drive. In the proposed algorithm, the terms containing flux, speed, and rotor time constant, which are common in both current and flux equations, in the current model of the induction machine are estimated by a sliding function. The flux and speed estimation accuracy is guaranteed when the error between the actual current and observed current converges to zero. Hence, the fourth-order system is reduced to two second-order systems, and the speed estimation becomes very simple and robust to the parameter uncertainties. The new approach is verified by simulation and experimental results", "fulltext": "", "keywords": "induction motor drive;flux;speed-sensorless control;induction machine;sliding-mode observer;sensorless control;rotor time constant;current equations;flux equations;fourth-order system reduction;parameter uncertainties;speed estimation accuracy;sliding function;current model;speed"}
{"name": "train_697", "title": "Schedulability analysis of real-time traffic in WorldFIP networks: an", "abstract": "integrated approach The WorldFIP protocol is one of the profiles that constitute the European fieldbus standard EN-50170. It is particularly well suited to be used in distributed computer-controlled systems where a set of process variables must be shared among network devices. To cope with the real-time requirements of such systems, the protocol provides communication services based on the exchange of periodic and aperiodic identified variables. The periodic exchanges have the highest priority and are executed at run time according to a cyclic schedule. Therefore, the respective schedulability can be determined at pre-run-time when building the schedule table. Concerning the aperiodic exchanges, the situation is different since their priority is lower and they are bandied according to a first-come-first-served policy. In this paper, a response-time-based schedulability analysis for the real-time traffic is presented. Such analysis considers both types of traffic in an integrated way, according to their priorities. Furthermore, a fixed-priorities-based policy is also used to schedule the periodic traffic. The proposed analysis represents an improvement relative to previous work and it can be evaluated online as part of a traffic online admission control. This feature is of particular importance when a planning scheduler is used, instead of the typical offline static scheduler, to allow online changes to the set of periodic process variables", "fulltext": "", "keywords": "communication services;distributed computer-controlled systems;aperiodic exchanges;real-time traffic schedulability analysis;periodic process variables;first-come-first-served policy;response time;en-50170 european fieldbus standard;traffic online admission control;scheduling algorithms;worldfip networks;real-time communication"}
{"name": "train_698", "title": "Robust stability analysis for current-programmed regulators", "abstract": "Uncertainty models for the three basic switch-mode converters: buck, boost, and buck-boost are given in this paper. The resulting models are represented by linear fractional transformations with structured dynamic uncertainties. Uncertainties are assumed for the load resistance R=R/sub O/(1+ delta /sub R/), inductance L=L/sub O/(1+ delta /sub L/), and capacitance C=C/sub O/(1+ delta /sub C/). The interest in these models is clearly motivated by the need to have models for switch-mode DC-DC converters that are compatible with robust control analysis, which require a model structure consisting of a nominal model and a norm-bounded modeling uncertainty. Therefore, robust stability analysis can be realized using standard mu -tools. At the end of the paper, an illustrative example is given which shows the simplicity of the procedure", "fulltext": "", "keywords": "buck-boost converters;capacitance;load resistance;switch-mode dc-dc converters;boost converters;buck converters;current-programmed regulators;uncertainty models;linear fractional transformations;robust stability analysis;nominal model;inductance;control analysis;structured dynamic uncertainties;norm-bounded modeling uncertainty"}
{"name": "train_699", "title": "Novel line conditioner with voltage up/down capability", "abstract": "In this paper, a novel pulsewidth-modulated line conditioner with fast output voltage control is proposed. The line conditioner is made up of an AC chopper with reversible voltage control and a transformer for series voltage compensation. In the AC chopper, a proper switching operation is achieved without the commutation problem. To absorb energy stored in line stray inductance, a regenerative DC snubber can be utilized which has only one capacitor without discharging resistors or complicated regenerative circuit for snubber energy. Therefore, the proposed AC chopper gives high efficiency and reliability. The output voltage of the line conditioner is controlled using a fast sensing technique of the output voltage. It is also shown via some experimental results that the presented line conditioner gives good dynamic and steady-state performance for high quality of the output voltage", "fulltext": "", "keywords": "output voltage control;ac chopper;switching operation;commutation;regenerative dc snubber;pulsewidth-modulated line conditioner;dynamic performance;steady-state performance;reversible voltage control;series voltage compensation transformer;line stray inductance"}
{"name": "train_7", "title": "Anti-spam suit attempts to hold carriers accountable", "abstract": "A lawsuit alleges that Sprint has violated Utah's new anti-spam act. The action could open the door to new regulations on telecom service providers", "fulltext": "", "keywords": "lawsuit;anti-spam act;regulations;telecom service providers;sprint"}
{"name": "train_70", "title": "IT security issues: the need for end user oriented research", "abstract": "Considerable attention has been given to the technical and policy issues involved with IT security issues in recent years. The growth of e-commerce and the Internet, as well as widely publicized hacker attacks, have brought IT security into prominent focus and routine corporate attention. Yet, much more research is needed from the end user (EU) perspective. This position paper is a call for such research and outlines some possible directions of interest", "fulltext": "", "keywords": "internet;information technology research;hacker attacks;it security;end user oriented research;end user computing;e-commerce"}
{"name": "train_700", "title": "Digital stochastic realization of complex analog controllers", "abstract": "Stochastic logic is based on digital processing of a random pulse stream, where the information is codified as the probability of a high level in a finite sequence. This binary pulse sequence can be digitally processed exploiting the similarity between Boolean algebra and statistical algebra. Given a random pulse sequence, any Boolean operation among individual pulses will correspond to an algebraic expression among the variables represented by their respective average pulse rates. Subsequently, this pulse stream can be digitally processed to perform analog operations. In this paper, we propose a stochastic approach to the digital implementation of complex controllers using programmable devices as an alternative to traditional digital signal processors. As an example, a practical realization of nonlinear dissipative controllers for a series resonant converter is presented", "fulltext": "", "keywords": "statistical algebra;random pulse stream;series resonant dc-to-dc converters;digital stochastic realization;boolean operation;random pulse sequence;pulse stream;stochastic logic;stochastic approach;finite sequence;programmable devices;complex analog controllers;series resonant converter;binary pulse sequence;nonlinear dissipative controllers;average pulse rates;boolean algebra;parallel resonant dc-to-dc converters"}
{"name": "train_701", "title": "High dynamic control of a three-level voltage-source-converter drive for a main", "abstract": "strip mill A high dynamic control system for the Alspa VDM 7000 medium-voltage drive was implemented, which provides fast torque response times of a few milliseconds despite the typically low switching frequency of gate-turn-off thyristors which is necessary to achieve high efficiency. The drive system consists of a three-level voltage-source converter with active front end and a synchronous motor. The drive has most recently been applied to a main strip mill. It provides a maximum of 8.3-MW mechanical power with a rated motor voltage of 3 kV. Besides motor torque as the main control objective, the control system has to comply with a number of additional objectives and constraints like DC-link voltage regulation and balancing, current and torque harmonics, motor flux, and excitation", "fulltext": "", "keywords": "excitation;3 kv;motor voltage;torque harmonics;medium-voltage drive;dc-link voltage regulation;efficiency;8.3 mw;motor flux;synchronous motor;dc-link voltage balancing;control objective;gate-turn-off thyristors;mechanical power;current harmonics;switching frequency;strip mill;high dynamic control system;three-level voltage-source converter"}
{"name": "train_702", "title": "A comparison of high-power converter topologies for the implementation of FACTS", "abstract": "controllers This paper compares four power converter topologies for the implementation of flexible AC transmission system (FACTS) controllers: three multilevel topologies (multipoint clamped (MPC), chain, and nested cell) and the well-established multipulse topology. In keeping with the need to implement very-high-power inverters, switching frequency is restricted to line frequency. The study addresses device count, DC filter ratings, restrictions on voltage control, active power transfer through the DC link, and balancing of DC-link voltages. Emphasis is placed on capacitor sizing because of its impact on the cost and size of the FACTS controller. A method for the dimensioning the DC capacitor filter is presented. It is found that the chain converter is attractive for the implementation of a static compensator or a static synchronous series compensator. The MPC converter is attractive for the implementation of a unified power flow controller or an interline power flow controller, but a special arrangement is required to overcome the limitations on voltage control", "fulltext": "", "keywords": "static compensator;statcom;inverters;upfc;multipulse topology;high-power converter topologies comparison;multipoint clamped topology;unified power flow controller;multilevel topologies;facts controllers;dc filter ratings;switching frequency;device count;static synchronous series compensator"}
{"name": "train_703", "title": "Direct self control with minimum torque ripple and high dynamics for a double", "abstract": "three-level GTO inverter drive A highly dynamic control scheme with very low torque ripple-direct self control (DSC) with torque hysteresis control-for very high-power medium-voltage induction motor drives fed by a double three-level inverter (D3LI) is presented. In this arrangement, two three-level inverters that are connected in parallel at their DC sides are feeding the open motor windings. The DSC, well known from two- and three-level inverters, is adapted to the D3LI and optimized for a minimum torque ripple. An 18-corner trajectory is chosen for the stator flux of the induction machine since it is approaching the ideal circle much better than the hexagon known from DSC for two-level inverters, without any detriment to the torque ripple. The machine and inverter control are explained and the proposed torque quality and dynamics are verified by measurements on a 180-kW laboratory drive", "fulltext": "", "keywords": "parallel connected inverters;highly dynamic control scheme;stator flux;180 kw;open motor windings;multilevel converters;variable-speed drives;double three-level inverter;medium-voltage induction motor drives;torque hysteresis control;torque quality;very low torque ripple;machine observer;direct self control"}
{"name": "train_704", "title": "Multicell converters: active control and observation of flying-capacitor", "abstract": "voltages The multicell converters introduced more than ten years ago make it possible to distribute the voltage constraints among series-connected switches and to improve the output waveforms (increased number of levels and apparent frequency). The balance of the constraints requires an appropriate distribution of the flying voltages. This paper presents some solutions for the active control of the voltages across the flying capacitors in the presence of rapid variation of the input voltage. The latter part of this paper is dedicated to the observation of these voltages using an original modeling of the converter", "fulltext": "", "keywords": "output waveforms improvement;input voltage;active control;multicell converters;series-connected switches;kalman filtering;flying-capacitor voltages;power systems harmonics;nonlinear systems;multilevel systems;power electronics"}
{"name": "train_705", "title": "Use of extra degrees of freedom in multilevel drives", "abstract": "Multilevel converters with series connection of semiconductors allow power electronics to reach medium voltages (1-10 kV) with relatively standard components. The increase of the number of semiconductors provides extra degrees of freedom, which can be used to improve different characteristics. This paper is focused on variable-speed drives and it is shown that with the proposed multilevel direct torque control strategy (DiCoIF) the tradeoff between the performances of the drive (harmonic distortions, torque dynamics, voltage step gradients, etc.) and the switching frequency of the semiconductors is improved. Then, a slightly modified strategy reducing common-mode voltage and bearing currents is presented", "fulltext": "", "keywords": "power electronics;state estimation;multilevel drives;medium voltages;fixed-frequency dynamic control;variable-speed drives;delay estimation;series connection;degrees of freedom;torque dynamics;industrial power systems;insulated gate bipolar transistors;multilevel direct torque control strategy;1 to 10 kv;semiconductors;bearing currents;voltage step gradients;common-mode voltage reduction;switching frequency;harmonic distortions"}
{"name": "train_706", "title": "Enhancing the reliability of modular medium-voltage drives", "abstract": "A method to increase the reliability of modular medium-voltage induction motor drives is discussed, by providing means to bypass a failed module. The impact on reliability is shown. A control, which maximizes the output voltage available after bypass, is described, and experimental results are given", "fulltext": "", "keywords": "reliability enhancement;modular medium-voltage induction motor drives;available output voltage control;failed module bypass"}
{"name": "train_707", "title": "Vector algebra proofs for geometry theorems", "abstract": "Vector mathematics can generate simple and powerful proofs of theorems in plane geometry. These proofs can also be used to generalize plane geometry theorems to higher dimensions. We present three vector proofs that show the power of this technique. 1. For any quadrilateral, the sum of the squares of the diagonals is less than or equal to the sum of the squares of the sides. 2. The area of a quadrilateral is half the product of the diagonals multiplied by the sine of an included angle. 3. One quarter of all triangles are acute (Based upon the options detailed below, with respect to the relative lengths of the sides). This paper presents a set of examples of vector mathematics applied to geometry problems. Some of the most beautiful and sophisticated proofs in mathematics involve using multiple representations of the same data. By leveraging the advantages of each representation one finds new and useful mathematical facts", "fulltext": "", "keywords": "multiple representations;plane geometry;vector mathematics;quadrilateral;proofs;vector algebra proofs"}
{"name": "train_708", "title": "Sufficient conditions on nonemptiness and boundedness of the solution set of", "abstract": "the P/sub 0/ function nonlinear complementarity problem The P/sub 0/ function nonlinear complementarity, problem (NCP) has attracted a lot of attention among researchers. Various assumed conditions, which ensure that the NCP has a solution have been proposed. In this paper, by using the notion of an exceptional family of elements we develop a sufficient condition which ensures that the solution set of the P/sub 0/ function NCP is nonempty and bounded. In particular, we prove that many existing assumed conditions imply this sufficient condition. Thus, these conditions imply that the solution set of the P/sub 0/ function NCP is nonempty and bounded. In addition, we also prove directly that a few existence conditions imply that the solution set of the P/sub 0/ function NCP is bounded", "fulltext": "", "keywords": "boundedness;nonemptiness;p/sub 0/ function nonlinear complementarity problem;solution set;sufficient conditions"}
{"name": "train_709", "title": "Cooperative mutation based evolutionary programming for continuous function", "abstract": "optimization An evolutionary programming (EP) algorithm adapting a new mutation operator is presented. Unlike most previous EPs, in which each individual is mutated on its own, each individual in the proposed algorithm is mutated in cooperation with the other individuals. This not only enhances convergence speed but also gives more chance to escape from local minima", "fulltext": "", "keywords": "convergence speed;cooperative mutation based evolutionary programming;continuous function optimization;local minima"}
{"name": "train_71", "title": "A study of computer attitudes of non-computing students of technical colleges", "abstract": "in Brunei Darussalam The study surveyed 268 non-computing students among three technical colleges in Brunei Darussalam. The study validated an existing instrument to measure computer attitudes of non-computing students, and identified factors that contributed to the formation of their attitudes. The findings show that computer experience and educational qualification are associated with students' computer attitudes. In contrast, variables such as gender, age, ownership of a personal computer (PC), geographical location of institution, and prior computer training appeared to have no impact on computer attitudes", "fulltext": "", "keywords": "age;educational computing;noncomputing students;computer attitudes;educational qualification;survey;computer training;gender;computer experience;end user computing;personal computer ownership;technical colleges"}
{"name": "train_710", "title": "Optimal allocation of runs in a simulation metamodel with several independent", "abstract": "variables Cheng and Kleijnen (1999) propose a very general regression metamodel for modelling the output of a queuing system. Its main limitations are that the regression function is based on a polynomial and that it can use only one independent variable. These limitations are removed here. We derive an explicit formula for the optimal way of assigning simulation runs to the different design points", "fulltext": "", "keywords": "general regression metamodel;independent variables;simulation metamodel;queuing system;optimal runs allocation;regression function"}
{"name": "train_711", "title": "On bivariate dependence and the convex order", "abstract": "We investigate the interplay between variability (in the sense of the convex order) and dependence in a bivariate framework, extending some previous results in this area. We exploit the fact that discrete uniform distributions are dense in the space of probability measures in the topology of weak convergence to prove our central result. We also obtain a partial result in the general multivariate case. Our findings can be interpreted in terms of the impact of component variability on the mean life of correlated serial and parallel systems", "fulltext": "", "keywords": "component variability;probability measures;parallel systems;bivariate probability distributions;mean life;discrete uniform distributions;weak convergence;serial systems;convex order;bivariate dependence;topology"}
{"name": "train_712", "title": "Waiting-time distribution of a discrete-time multiserver queue with correlated", "abstract": "arrivals and deterministic service times: D-MAP/D/k system We derive the waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic (or constant) service times. We show that the procedure for obtaining the waiting-time distribution of a multiserver queue is reduced to that of a single-server queue. We present a complete solution to the waiting-time distribution of D-MAP/D/k queue together with some computational results", "fulltext": "", "keywords": "discrete-time multiserver queue;d-map/d/k system;waiting-time distribution;deterministic service times;markovian arrival process;correlated arrivals"}
{"name": "train_713", "title": "Efficient feasibility testing for dial-a-ride problems", "abstract": "Dial-a-ride systems involve dispatching a vehicle to satisfy demands from a set of customers who call a vehicle-operating agency requesting that an item tie picked up from a specific location and delivered to a specific destination. Dial-a-ride problems differ from other routing and scheduling problems, in that they typically involve service-related constraints. It is common to have maximum wait time constraints and maximum ride time constraints. In the presence of maximum wait time and maximum ride time restrictions, it is not clear how to efficiently determine, given a sequence of pickups and deliveries, whether a feasible schedule exists. We demonstrate that this, in fact, can be done in linear time", "fulltext": "", "keywords": "routing;service-related constraints;maximum ride time constraints;dispatching;vehicle-operating agency;dial-a-ride problems;feasibility testing;scheduling;maximum wait time constraints"}
{"name": "train_714", "title": "Embeddings of planar graphs that minimize the number of long-face cycles", "abstract": "We consider the problem of finding embeddings of planar graphs that minimize the number of long-face cycles. We prove that for any k >or= 4, it is NP-complete to find an embedding that minimizes the number of face cycles of length at least k", "fulltext": "", "keywords": "np-complete problem;long-face cycles;planar graphs;embeddings;graph drawing"}
{"name": "train_715", "title": "The quadratic 0-1 knapsack problem with series-parallel support", "abstract": "We consider various special cases of the quadratic 0-1 knapsack problem (QKP) for which the underlying graph structure is fairly simple. For the variant with edge series-parallel graphs, we give a dynamic programming algorithm with pseudo-polynomial time complexity, and a fully polynomial time approximation scheme. In strong contrast to this, the variant with vertex series-parallel graphs is shown to be strongly NP-complete", "fulltext": "", "keywords": "np-complete problem;pseudo-polynomial time complexity;quadratic 0-1 knapsack problem;fully polynomial time approximation scheme;series-parallel support;underlying graph structure;dynamic programming algorithm"}
{"name": "train_716", "title": "Algorithmic results for ordered median problems", "abstract": "In a series of papers a new type of objective function in location theory, called ordered median function, has been introduced and analyzed. This objective function unifies and generalizes most common objective functions used in location theory. In this paper we identify finite dominating sets for these models and develop polynomial time algorithms together with a detailed complexity analysis", "fulltext": "", "keywords": "detailed complexity analysis;polynomial time algorithms;location theory;objective function;finite dominating sets;algorithmic results;ordered median problems;ordered median function"}
{"name": "train_717", "title": "A network simplex algorithm with O(n) consecutive degenerate pivots", "abstract": "We suggest a pivot rule for the primal simplex algorithm for the minimum cost flow problem, known as the network simplex algorithm. Due to degeneracy, cycling may occur in the network simplex algorithm. The cycling can be prevented by maintaining strongly feasible bases proposed by Cunningham (1976); however, if we do not impose any restrictions on the entering variables, the algorithm can still perform an exponentially long sequence of degenerate pivots. This phenomenon is known as stalling. Researchers have suggested several pivot rules with the following bounds on the number of consecutive degenerate pivots: m, n/sup 2/, k(k + 1)/2, where n is the number of nodes in the network, m is the number of arcs in the network, and k is the number of degenerate arcs in the basis. (Observe that k <or= n.) In this paper, we describe an anti-stalling pivot rule that ensures that the network simplex algorithm performs at most k consecutive degenerate pivots. This rule uses a negative cost augmenting cycle to identify a sequence of entering variables", "fulltext": "", "keywords": "negative cost augmenting cycle;cycling;degenerate pivots;network simplex algorithm;degeneracy;minimum cost flow problem;anti-stalling pivot rule;stalling"}
{"name": "train_718", "title": "New water management system begins operation at US projects", "abstract": "The US Army Corps of Engineers has developed a new automated information system to support its water control management mission. The new system provides a variety of decision support tools, enabling water control managers to acquire, transform, verify, store, display, analyse, and disseminate data and information efficiently and around the clock", "fulltext": "", "keywords": "data verification;data display;us projects;corps water management system;decision support tools;data acquisition;data analysis;us army corps of engineers;data storage;water control managers;water management system;water control management mission;automated information system;data visualization;decision support system;watershed modelling;data dissemination"}
{"name": "train_719", "title": "War games: The truth [network security]", "abstract": "With al Qaeda on the tip of tongues around the world, find out how terror groups could target your network. What are the dangers and how do you fight them?", "fulltext": "", "keywords": "security;networks;employees;malicious attacks"}
{"name": "train_72", "title": "A three-tier technology training strategy in a dynamic business environment", "abstract": "As end-user training becomes increasingly important in today's technology-intensive business environment, progressive companies remain alert to find ways to provide their end users with timely training and resources. This paper describes an innovative training strategy adopted by one midsize organization to provide its end users with adequate, flexible, and responsive training. The paper then compares the three-tier strategy with other models described in technology training literature. Managers who supervise technology end users in organizations comparable to the one in the study may find the three-tier strategy workable and may want to use it in their own training programs to facilitate training and improve end-user skills. Researchers and scholars may find that the idea of three-tier training generates new opportunities for research", "fulltext": "", "keywords": "organizations;dynamic business environment;companies;innovative training strategy;three-tier technology training strategy;technology-intensive business environment;end-user training;midsize organization"}
{"name": "train_720", "title": "19in monitors [CRT survey]", "abstract": "Upgrade your monitor from as little as Pounds 135. With displays on test and ranging up to Pounds 400, whether you're after the last word in quality or simply looking for again, this Labs holds the answer. Looks at ADI MicroScan M900, CTX PR960F, Eizo FlexScan T766, Hansol 920D, Hansol920P, Hitachi CM715ET, Hitachi CM721FET, liyama Vision Master Pro 454, LG Flatron 915FT Plus, Mitsubishi Diamond Pro 920, NEC MultiSync FE950+, Philips 109S40, Samsung SyncMaster 959NF, Sony Multiscan CPD-G420, and ViewSonic G90f", "fulltext": "", "keywords": "crt survey;hitachi cm721fet;samsung syncmaster 959nf;ctx pr960f;hansol 920d;adi microscan m900;nec multisync fe950;eizo flexscan t766;mitsubishi diamond pro 920;philips 109s40;hitachi cm715et;19in monitors;hansol920p;viewsonic g90f;liyama vision master pro 454;lg flatron 915ft plus;sony multiscan cpd-g420;19 in"}
{"name": "train_721", "title": "The results of experimental studies of the reflooding of fuel-rod assemblies", "abstract": "from above and problems for future investigations Problems in studying the reflooding of assemblies from above conducted at foreign and Russian experimental installations are considered. The efficiency of cooling and flow reversal under countercurrent flow of steam and water, as well as the scale effect are analyzed. The tasks for future experiments that are necessary for the development of modern correlations for the loss-of-coolant accident (LOCA) computer codes are stated", "fulltext": "", "keywords": "flow reversal;countercurrent flow;fuel-rod assemblies reflooding;steam;water;loca computer codes;loss-of-coolant accident computer codes;cooling efficiency;russian experimental installations"}
{"name": "train_722", "title": "Updating systems for monitoring and controlling power equipment on the basis of", "abstract": "the firmware system SARGON The economic difficulties experienced by the power industry of Russia has considerably retarded the speed of commissioning new capacities and reconstructing equipment in service. The increasing deterioration of the equipment at power stations makes the problem of its updating very acute. The main efforts of organizations working in the power industry are now focused on updating all kinds of equipment installed at power installations. The necessary condition for the efficient operation of power equipment is to carry out serious modernization of systems for monitoring and control (SMC) of technological processes. The specialists at ZAO NVT-Avtomatika have developed efficient technology for updating the SMC on the basis of the firmware system SARGON which ensures the fast introduction of high-quality systems of automation with a minimal payback time of the capital outlay. This paper discusses the updating of equipment using SARGON", "fulltext": "", "keywords": "control systems;russia;zao nvt-avtomatika;sargon firmware system;monitoring systems;power equipment control;power equipment monitoring;power industry"}
{"name": "train_723", "title": "Simulation of physicochemical processes of erosion-corrosion of metals in", "abstract": "two-phase flows A computational model for the erosion-corrosion of the metals used in power equipment in two-phase flows (RAMEK-2) was developed. The results of calculations of the dependency of the intensity of the erosion-corrosion of structural steels as a function of the thermodynamic, hydrodynamic and water chemistry parameters of these flows in the working paths of thermal power stations and nuclear power stations are presented in a three-dimensional space. On the basis of mathematical models, application software was created for forecasting the erosion-corrosion resource and for optimizing the rules on diagnosis and protective maintenance of erosion-corrosion of the elements of the wet-steam path in power stations", "fulltext": "", "keywords": "fault diagnosis;nuclear power plants;thermal power plants;hydrodynamic parameters;computer simulation;protective maintenance;thermodynamic parameters;application software;three-dimensional space;wet-steam path;water-chemistry parameters;ramek-2;erosion-corrosion computational model;two-phase flows;structural steels"}
{"name": "train_724", "title": "Banking on SMA funds [separately managed accounts]", "abstract": "From investment management to technology to back-office services, outsourcers are elbowing their way into the SMA business. Small banks are paying attention-and hoping to reap the rewards", "fulltext": "", "keywords": "outsourcers;technology;small banks;back-office services;investment management;separately managed accounts"}
{"name": "train_725", "title": "Banks pin their back-office hopes on successors to screen scrapers", "abstract": "The big name in account aggregation has been Yodlee, based in Redwood Shores, CA. It pioneered the art of screen scraping, or pulling data off Web sites and aggregating it into a single statement. That data, however, is a snapshot and does not include a customer's investment history. Also, because Web sites update data at different times, scraping them can provide an inaccurate picture of a customer's financial situation, making it difficult for reps seeking to provide timely and accurate advice. The objective is to access both fresh and historical data across a client's financial spectrum, from investments to checking accounts and loans to insurance policies, a Complete Customer balance sheet. At least two technology vendors are progressing in that direction, each coming from different directions. One is Advent, based in San Francisco, another is Fincentric, out of Vancouver", "fulltext": "", "keywords": "checking;account aggregation;loans;insurance;bankers;yodlee;screen scraping;web sites;investment;advent;fincentric"}
{"name": "train_726", "title": "New wrinkle on the Web? Hmm. [banking]", "abstract": "The financial sector produced its share of technology hype during the new economy years. You. can't blame folks if the next next thing, a wave of Internet-related innovation called Web services, is being met with healthy skepticism. Many gurus are placing their bets on Web services to drive the next chapter of finance technology, dramatically upgrading disappointing automated customer management strategies by electronically breaking down barriers between products, firms and customers, and perhaps creating a whole new line of business in the process. But it's not a magic wand. It doesn't change the need for a bank to reorganize and streamline its operations", "fulltext": "", "keywords": "bank;web services"}
{"name": "train_727", "title": "Life after bankruptcy [telecom carriers]", "abstract": "How comeback telecom carriers are changing industry economics, and why others may have no choice but to follow their lead", "fulltext": "", "keywords": "debt levels;telecom carriers;bankruptcy;restructured companies;industry economics"}
{"name": "train_728", "title": "Questioning the RFP process [telecom]", "abstract": "In the current climate, the most serious concern about the purchasing habits of telecom carriers is obviously the lack of spending. Even against a backdrop of economic constraints and financial struggles, however, genuine concerns about the purchasing process itself are being raised by some of those closest to it", "fulltext": "", "keywords": "telecom carriers;request for proposal;purchasing process;sales cycle;request for information"}
{"name": "train_73", "title": "How does attitude impact IT implementation: a study of small business owners", "abstract": "According to previous studies, attitude towards information technology (IT) among small business owners appears to be a key factor in achieving high quality IT implementations. In an effort to extend this stream of research, we conducted case studies with small business owners and learned that high quality IT implementations resulted with owners who had positive or negative attitudes toward IT, but not with owners who had uncertain attitudes. Owners with apolar attitude, either positive or negative, all took action to temper the uncertainty and risk surrounding the use of new IT in their organization. In contrast, owners with uncertain attitudes did not make mitigating attempts to reduce uncertainty and risk. A consistent finding among those with high quality IT implementations was an entrepreneurial, or shared, management style. It is proposed, based on case study data, that small business owners with an uncertain attitude towards IT might experience higher quality IT results in their organizations through practicing a more entrepreneurial, or shared, management style. The study provides insights for both computer specialists and small business owners planning IT implementations", "fulltext": "", "keywords": "small business owners;organization;information technology implementation;positive attitudes;planning;management style;risk;negative attitudes;computer specialists;uncertain attitude"}
{"name": "train_730", "title": "Multi-hour design of survivable classical IP networks", "abstract": "Most of Internet intra-domain routing protocols (OSPF, RIP, and IS-IS) are based on shortest path routing. The path length is defined as the sum of metrics associated with the path links. These metrics are often managed by the network administrator. In this context, the design of an Internet backbone network consists in dimensioning the network (routers and transmission links) and establishing the metric. Many requirements have to be satisfied. First, Internet traffic is not static as significant variations can be observed during the day. Second, many failures can occur (cable cuts, hardware failures, software failures, etc.). We present algorithms (meta-heuristics and greedy heuristic) to design Internet backbone networks, taking into account the multi-hour behaviour of traffic and some survivability requirements. Many multi-hour and protection strategies are studied and numerically compared. Our algorithms can be extended to integrate other quality of service constraints", "fulltext": "", "keywords": "transmission links;internet backbone network;network protection;is-is;path links;path length;survivable classical ip networks;internet intra-domain routing protocols;survivability requirements;quality of service constraints;greedy heuristic algorithm;network dimensioning;meta-heuristics algorithm;shortest path routing;network administrator;multi-hour design;ospf;internet traffic;rip;network routers;network failures;qos constraints"}
{"name": "train_731", "title": "Aggregate bandwidth estimation in stored video distribution systems", "abstract": "Multimedia applications like video on demand, distance learning, Internet video broadcast, etc. will play a fundamental role in future broadband networks. A common aspect of such applications is the transmission of video streams that require a sustained relatively high bandwidth with stringent requirements of quality of service. In this paper various original algorithms for evaluating, in a video distribution system, a statistical estimation of aggregate bandwidth needed by a given number of smoothed video streams are proposed and discussed. The variable bit rate traffic generated by each video stream is characterized by its marginal distribution and by conditional probabilities between rates of temporary closed streams. The developed iterative algorithms evaluate an upper and lower bound of needed bandwidth for guaranteeing a given loss probability. The obtained results are compared with simulations and with other results, based on similar assumptions, already presented in the literature. Some considerations on the developed algorithms are made, in order to evaluate the effectiveness of the proposed methods", "fulltext": "", "keywords": "upper bound;distance learning;quality of service;simulations;multimedia applications;video streams transmission;lower bound;video coding;temporary closed streams;stored video distribution systems;conditional probabilities;vod;internet video broadcast;loss probability;aggregate bandwidth estimation;video on demand;iterative algorithms;statistical estimation;broadband networks;marginal distribution;qos;variable bit rate traffic"}
{"name": "train_732", "title": "A unifying co-operative Web caching architecture", "abstract": "Network caching of objects has become a standard way of reducing network traffic and latency in the Web. However, Web caches exhibit poor performance with a hit rate of about 30%. A solution to improve this hit rate is to have a group of proxies form co-operation where objects can be cached for later retrieval. A cooperative cache system includes protocols for hierarchical and transversal caching. The drawback of such a system lies in the resulting network load due to the number of messages that need to be exchanged to locate an object. This paper proposes a new co-operative Web caching architecture, which unifies previous methods of Web caching. Performance results shows that the architecture achieve up to 70% co-operative hit rate and accesses the cached object in at most two hops. Moreover, the architecture is scalable with low traffic and database overhead", "fulltext": "", "keywords": "protocols;network caching;hierarchical caching;co-operative hit rate;network latency reduction;web browser;co-operative web caching architecture;network load;transversal caching;low database overhead;network traffic reduction;world wide web;low traffic overhead;scalable architecture;cooperative cache system"}
{"name": "train_733", "title": "VoIP makeover transforms ugly duckling network", "abstract": "Surrey County Council's Swan project is Europe's biggest implementation of voice over IP. Six Wans and countless Lans are are being consolidated into a single network covering 6,000 users at 200 sites. The contract was signed in October 2001 for Pounds 13m over five years and rollout will be completed in May 2003", "fulltext": "", "keywords": "voice over ip;swan;lan;wan;surrey county council"}
{"name": "train_734", "title": "Web services boost integration", "abstract": "Microsoft and IBM have announced products to help their database software co-exist with competitors' offerings. The products use web services technology allowing users to improve integration between databases and application software from rival vendors", "fulltext": "", "keywords": "database software;ibm;microsoft;web services technology"}
{"name": "train_735", "title": "IT at the heart of joined-up policing", "abstract": "Police IT is to shift from application-focused to component-based technology. The change of strategy, part of the Valiant Programme, will make information held by individual forces available on a national basis", "fulltext": "", "keywords": "uk;police it;valiant programme"}
{"name": "train_736", "title": "The year of the racehorse [China Telecom]", "abstract": "Does China really offer the telecoms industry a route out of the telecoms slump? According to the Chinese government it has yet to receive a single application from foreign companies looking to invest in the country's domestic telecoms sector since the country joined the World Trade Organisation", "fulltext": "", "keywords": "foreign investment;telecoms industry;china netcom;china unicorn;china;china telecom"}
{"name": "train_737", "title": "What's in a name? [mobile telephony branding]", "abstract": "Mobile operators are frantically consolidating businesses into single international brands", "fulltext": "", "keywords": "branding;mobile telephony;consolidating businesses"}
{"name": "train_738", "title": "Playing for time [3G networks]", "abstract": "The delays in rolling out 3G networks across Europe should not always be seen with a negative slant", "fulltext": "", "keywords": "europe;mobile operators;delays;3g networks"}
{"name": "train_739", "title": "Disposable mobiles", "abstract": "After many delays, the reusable, recyclable, disposable mobile phone is finally going on sale in the US. But with a business model largely dependent on niche markets, Elizabeth Biddlecombe asks if these simplified handsets will be good enough to survive a brutal market", "fulltext": "", "keywords": "simplified handsets;disposable mobile phone;recyclable;reusable"}
{"name": "train_74", "title": "End-user perspectives on the uptake of computer supported cooperative working", "abstract": "Researchers in information systems have produced a rich collection of meta-analyses and models to further understanding of factors influencing the uptake of information technologies. In the domain of CSCW, however, these models have largely been neglected, and while there are many case studies, no systematic account of uptake has been produced. We use findings from information systems research to structure a meta-analysis of uptake issues as reported in CSCW case studies, supplemented by a detailed re-examination of one of our own case studies from this perspective. This shows that while there are some factors which seem to be largely specific to CSCW introductions, many of the case study results are very similar to standard IS findings. We conclude by suggesting how the two communities of researchers might build on each other's work, and finally propose activity theory as a means of integrating the two perspectives", "fulltext": "", "keywords": "end-user perspectives;information technology;cscw;computer supported cooperative work;meta-analyses;information systems;activity theory"}
{"name": "train_740", "title": "The Malaysian model", "abstract": "Japan's first third generation service, Foma, is unlikely to be truly attractive to consumers until 2005. That still falls well within the financial planning of its operator Docomo. But where does that leave European 3G operators looking for reassurance? Malaysia, says Simon Marshall", "fulltext": "", "keywords": "malaysia;maxis communications;3g operators;telekom malaysia"}
{"name": "train_741", "title": "Mothball mania [3G licences]", "abstract": "Telefonica Moviles has frozen its 3G operations in Germany, Austria, Italy and Switzerland. With other 3G licence holders questioning the logic of entering already saturated markets with unproven technology, Emma McClune asks if the mothball effect is set to snowball any further", "fulltext": "", "keywords": "saturated markets;mobile telephony;mothball;3g licence holders"}
{"name": "train_742", "title": "Second term [International Telecommunication Union]", "abstract": "Later this month Yoshio Utsumi is expected to be re-elected for a second four year term as secretary general of the International Telecommunication Union. Here he talks to Matthew May about getting involved in internet addressing, the prospects for 3g, the need for further reform of his organisation... and the translating telephone", "fulltext": "", "keywords": "3g;translating telephone;internet addressing;international telecommunication union"}
{"name": "train_743", "title": "Local satellite", "abstract": "Consumer based mobile satellite phone services went from boom to burn up in twelve months despite original forecasts predicting 10 million to 40 million users by 2005. Julian Bright wonders what prospects the technology has now and if going regional might be one answer", "fulltext": "", "keywords": "mobile satellite phone services"}
{"name": "train_744", "title": "A virtual victory [virtual networks]", "abstract": "Newly fashionable virtual network operators look all set to clean up in the corporate sector", "fulltext": "", "keywords": "corporate sector;virtual network operators"}
{"name": "train_745", "title": "Intensity based affine registration including feature similarity for spatial", "abstract": "normalization This paper presents a new spatial normalization with affine transformation. The quantitative comparison of brain architecture across different subjects requires a common coordinate system. For the analysis of a specific brain area, it is necessary to normalize and compare a region of interest and the global brain. The intensity based registration method matches the global brain well, but a region of interest may not be locally normalized compared to the feature based method. The method in this paper uses feature similarities of local regions as well as intensity similarities. The lateral ventricle and central gray nuclei of the brain, including the corpus callosum, which is used for features in schizophrenia detection, is appropriately normalized. Our method reduces the difference of feature areas such as the corpus callosum (7.7%, 2.4%) and lateral ventricle (8.2%, 13.5%) compared with mutual information and Talairach methods", "fulltext": "", "keywords": "intensity based affine registration;global brain;corpus callosum;lateral ventricle;talairach method;central gray nuclei;affine transformation;schizophrenia detection;common coordinate system;brain architecture;feature similarities;spatial normalization;feature similarity;region of interest;mutual information method"}
{"name": "train_746", "title": "Real-time transmission of pediatric echocardiograms using a single ISDN line", "abstract": "We tested the adequacy of a videoconferencing system using a single integrated systems digital network (ISDN) line (128 kilobits per second) for the remote diagnosis of children with suspected congenital heart disease (CHD). Real-time echocardiogram interpretation was compared to subsequent videotape review in 401 studies with concordance in 383 (95.5%) studies. A new diagnosis of CHD was made in 98 studies. Immediate patient transfer was arranged based upon a real-time diagnosis in five studies. In 300 studies, a normal diagnosis obviated further evaluation. A single ISDN line is adequate for transmission of pediatric echocardiograms and it allows for remote management of patients with CHD", "fulltext": "", "keywords": "single isdn line;real-time echocardiogram interpretation;remote patient management;real-time pediatric echocardiogram transmission;remote diagnosis;videoconferencing system;videotape review;immediate patient transfer;children;suspected congenital heart disease"}
{"name": "train_747", "title": "Simulation of cardiovascular physiology: the diastolic function(s) of the heart", "abstract": "The cardiovascular system was simulated by using an equivalent electronic circuit. Four sets of simulations were performed. The basic variables investigated were cardiac output and stroke volume. They were studied as functions (i) of right ventricular capacitance and negative intrathoracic pressure; (ii) of left ventricular relaxation and of heart rate; and (iii) of left ventricle failure. It seems that a satisfactory simulation of systolic and diastolic functions of the heart is possible. Presented simulations improve our understanding of the role of the capacitance of both ventricles and of the diastolic relaxation in cardiovascular physiology", "fulltext": "", "keywords": "cardiac output;heart;left ventricular relaxation;right ventricular capacitance;stroke volume;simulation;diastolic relaxation;systolic functions;cardiovascular physiology;negative intrathoracic pressure;diastolic function;left ventricle failure;heart rate;equivalent electronic circuit"}
{"name": "train_748", "title": "Simulation study of the cardiovascular functional status in hypertensive", "abstract": "situation An extended cardiovascular model was established based on our previous work to study the consequences of physiological or pathological changes to the homeostatic functions of the cardiovascular system. To study hemodynamic changes in hypertensive situations, the impacts of cardiovascular parameter variations (peripheral vascular resistance, arterial vessel wall stiffness and baroreflex gain) upon hemodynamics and the short-term regulation of the cardiovascular system were investigated. For the purpose of analyzing baroregulation function, the short-term regulation of arterial pressure in response to moderate dynamic exercise for normotensive and hypertensive cases was studied through computer simulation and clinical experiments. The simulation results agree well with clinical data. The results of this work suggest that the model presented in this paper provides a useful tool to investigate the functional status of the cardiovascular system in normal or pathological conditions", "fulltext": "", "keywords": "arterial pressure;arterial vessel wall stiffness;moderate dynamic exercise;computer simulation;normotensive cases;peripheral vascular resistance;baroreflex gain;extended cardiovascular model;pathological changes;physiological changes;hemodynamics;homeostatic functions;clinical experiments;short-term regulation;hypertensive situation;cardiovascular parameter variations;cardiovascular functional status"}
{"name": "train_749", "title": "Numerical modeling of the flow in stenosed coronary artery. The relationship", "abstract": "between main hemodynamic parameters The severity of coronary arterial stenosis is usually measured by either simple geometrical parameters, such as percent diameter stenosis, or hemodynamically based parameters, such as the fractional flow reserve (FFR) or coronary flow reserve (CFR). The present study aimed to establish a relationship between actual hemodynamic conditions and the parameters that define stenosis severity in the clinical setting. We used a computational model of the blood flow in a vessel with a blunt stenosis and an autoregulated vascular bed to simulate a stenosed blood vessel. A key point in creating realistic simulations is to properly model arterial autoregulation. A constant flow regulation mechanism resulted in CFR and FFR values that were within the physiological range, while a constant wall-shear stress model yielded unrealistic values. The simulation tools developed in the present study may be useful in the clinical assessment of single and multiple stenoses by means of minimally invasive methods", "fulltext": "", "keywords": "arterial autoregulation;stenosis severity;stenosed blood vessel;constant flow regulation mechanism;physiological range;numerical modeling;constant wall shear stress model;simulation;computational model;blunt stenosis;minimally invasive methods;clinical setting;blood flow;hemodynamic parameters;coronary arterial stenosis;autoregulated vascular bed"}
{"name": "train_75", "title": "A portable Auto Attendant System with sophisticated dialog structure", "abstract": "An attendant system connects the caller to the party he/she wants to talk to. Traditional systems require the caller to know the full name of the party. If the caller forgets the name, the system fails to provide service for the caller. In this paper we propose a portable Auto Attendant System (AAS) with sophisticated dialog structure that gives a caller more flexibility while calling. The caller may interact with the system to request a phone number by providing just a work area, specialty, surname, or title, etc. If the party is absent, the system may provide extra information such as where he went, when he will be back, and what he is doing. The system is built modularly, with components such as speech recognizer, language model, dialog manager and text-to-speech that can be replaced if necessary. By simply changing the personnel record database, the system can easily be ported to other companies. The sophisticated dialog manager applies many strategies to allow natural interaction between user and system. Functions such as fuzzy request, user repairing, and extra information query, which are not provided by other systems, are integrated into our system. Experimental results and comparisons to other systems show that our approach provides a more user friendly and natural interaction for auto attendant system", "fulltext": "", "keywords": "clear request;telephone;telephone-based system;fuzzy request;semantic frame;spoken dialog systems;dialog manager;auto attendant system;attendant system;speech recognizer"}
{"name": "train_750", "title": "Automated cerebrum segmentation from three-dimensional sagittal brain MR images", "abstract": "We present a fully automated cerebrum segmentation algorithm for full three-dimensional sagittal brain MR images. First, cerebrum segmentation from a midsagittal brain MR image is performed utilizing landmarks, anatomical information, and a connectivity-based threshold segmentation algorithm as previously reported. Recognizing that the cerebrum in laterally adjacent slices tends to have similar size and shape, we use the cerebrum segmentation result from the midsagittal brain MR image as a mask to guide cerebrum segmentation in adjacent lateral slices in an iterative fashion. This masking operation yields a masked image (preliminary cerebrum segmentation) for the next lateral slice, which may truncate brain region(s). Truncated regions are restored by first finding end points of their boundaries, by comparing the mask image and masked image boundaries, and then applying a connectivity-based algorithm. The resulting final extracted cerebrum image for this slice is then used as a mask for the next lateral slice. The algorithm yielded satisfactory fully automated cerebrum segmentations in three-dimensional sagittal brain MR images, and had performance superior to conventional edge detection algorithms for segmentation of cerebrum from 3D sagittal brain MR images", "fulltext": "", "keywords": "connectivity-based threshold segmentation algorithm;masked image boundaries;full 3d sagittal brain mr images;midsagittal brain mr image;brain region truncation;laterally adjacent slices;boundary end points;connectivity-based algorithm;fully automated cerebrum segmentation algorithm;masking operation;anatomical information;landmarks"}
{"name": "train_751", "title": "A new method of regression on latent variables. Application to spectral data", "abstract": "Several applications are based on the assessment of a linear model linking a set of variables Y to a set of predictors X. In the presence of strong colinearity among predictors, as in the case with spectral data, several alternative procedures to ordinary least squares (OLS) are proposed, We discuss a new alternative approach which we refer to as regression models through constrained principal components analysis (RM-CPCA). This method basically shares certain common characteristics with PLS regression as the dependent variables play a central role in determining the latent variables to be used as predictors. Unlike PLS, however, the approach discussed leads to straightforward models. This method also bears some similarity to latent root regression analysis (LRR) that was discussed by several authors. Moreover, a tuning parameter that ranges between 0 and 1 is introduced and the family of models thus formed includes several other methods as particular cases", "fulltext": "", "keywords": "strong colinearity;latent variables;regression models through constrained principal components analysis;latent root regression analysis;dependent variables;tuning parameter;spectral data;predictors;linear model;near-ir spectroscopy"}
{"name": "train_752", "title": "Presenting-a better mousetrap [Leeza outboard video signal processor]", "abstract": "Scaling interlaced video to match high-resolution plasma, LCD, and DLP displays is a tough job, but Key Digital's Leeza is zip to the tack. And it's digitally bilingual, too. There's no question that outboard video signal processors like Leeza help overcome the inherent limitations of fixed-pixel displays. Being able to match a native display rate with heavily processed video makes the viewing experience much more enjoyable. But it seemed that 70% of the improvement in image quality came from using a digital interface to the DVD player, as most noise and picture artifacts are introduced in the analog video encoding process", "fulltext": "", "keywords": "heavily processed video;plasma displays;leeza;fixed-pixel displays;lcd displays;dlp displays;outboard video signal processors"}
{"name": "train_753", "title": "In medias res [DVD formats]", "abstract": "Four years in the making, the DVD format war rages on, no winner insight. meanwhile, the spoils of war abound, and DVD media manufacturers stand poised to profit", "fulltext": "", "keywords": "compatibility;dvd-r;dvd+rw;dvd-rw;dvd media manufacturers;dvd-ram;dvd+r;dvd format war;writable dvd"}
{"name": "train_754", "title": "Record makers [UK health records]", "abstract": "Plans for a massive cradle-to-grave electronic records project have been revealed by the government. Is the scheme really viable?", "fulltext": "", "keywords": "social care;integrated care records services;electronic records project;health care;uk health records"}
{"name": "train_755", "title": "Hardware and software platform for real-time processing and visualization of", "abstract": "echographic radiofrequency signals In this paper the architecture of a hardware and software platform, for ultrasonic investigation is presented. The platform, used in conjunction with an analog front-end hardware for driving the ultrasonic transducers of any commercial echograph, having the radiofrequency echo signal access, make it possible to dispose of a powerful echographic system for experimenting any processing technique, also in a clinical environment in which real-time operation mode is an essential prerequisite. The platform transforms any echograph into a test-system for evaluating the diagnostic effectiveness of new investigation techniques. A particular user interface was designed in order to allow a real-time and simultaneous visualization of the results produced in the different stages of the chosen processing procedure. This is aimed at obtaining a better optimization of the processing algorithm. The most important platform aspect, which also constitutes the basic differentiation with respect to similar systems, is the direct processing of the radiofrequency echo signal, which is essential for a complete analysis of the particular ultrasound-media interaction phenomenon. The platform completely integrates the architecture of a personal computer (PC) giving rise to several benefits, such as the quick technological evolution in the PC field and an extreme degree of programmability for different applications. The PC also constitutes the user interface, as a flexible and intuitive visualization support, and performs some software signal processing, by custom algorithms and commercial libraries. The realized close synergy between hardware and software allows the acquisition and real-time processing of the echographic radiofrequency (RF) signal with fast data representation", "fulltext": "", "keywords": "real-time processing;hardware platform;clinical diagnosis;software platform;ultrasonic imaging;user interface;data visualization;personal computer;echographic radiofrequency signal"}
{"name": "train_756", "title": "A new high resolution color flow system using an eigendecomposition-based", "abstract": "adaptive filter for clutter rejection We present a new signal processing strategy for high frequency color flow mapping in moving tissue environments. A new application of an eigendecomposition-based clutter rejection filter is presented with modifications to deal with high blood-to-clutter ratios (BCR). Additionally, a new method for correcting blood velocity estimates with an estimated tissue motion profile is detailed. The performance of the clutter filter and velocity estimation strategies is quantified using a new swept-scan signal model. In vivo color flow images are presented to illustrate the potential of the system for mapping blood flow in the microcirculation with external tissue motion", "fulltext": "", "keywords": "hf colour flow mapping;echoes;blood velocity estimates correction;estimated tissue motion profile;signal processing strategy;clutter suppression performance;high resolution colour flow system;in vivo color flow images;swept-scan signal model;microcirculation;high blood-to-clutter ratios;high frequency color flow mapping;eigendecomposition-based adaptive filter;clutter rejection filter;blood flow mapping;moving tissue environments"}
{"name": "train_757", "title": "Ultrafast compound imaging for 2-D motion vector estimation: application to", "abstract": "transient elastography This paper describes a new technique for two-dimensional (2-D) imaging of the motion vector at a very high frame rate with ultrasound. Its potential is experimentally demonstrated for transient elastography. But, beyond this application, it also could be promising for color flow and reflectivity imaging. To date, only axial displacements induced in human tissues by low-frequency vibrators were measured during transient elastography. The proposed technique allows us to follow both axial and lateral displacements during the shear wave propagation and thus should improve Young's modulus image reconstruction. The process is a combination of several ideas well-known in ultrasonic imaging: ultra-fast imaging, multisynthetic aperture beamforming, 1-D speckle tracking, and compound imaging. Classical beamforming in the transmit mode is replaced here by a single plane wave insonification increasing the frame rate by at least a factor of 128. The beamforming is achieved only in the receive mode on two independent subapertures. Comparison of successive frames by a classical 1-D speckle tracking algorithm allows estimation of displacements along two different directions linked to the subapertures beams. The variance of the estimates is finally improved by tilting the emitting plane wave at each insonification, thus allowing reception of successive decorrelated speckle patterns", "fulltext": "", "keywords": "young's modulus image reconstruction;2d imaging;two-dimensional imaging;human tissues;decorrelated speckle patterns;multisynthetic aperture beamforming;1d speckle tracking algorithm;lateral displacements;high frame rate;ultrafast compound imaging;colour flow imaging;single plane wave insonification;reflectivity imaging;ultrasonic imaging;2d motion vector estimation;shear wave propagation;ultrasound;axial displacements;transient elastography"}
{"name": "train_758", "title": "Four-terminal quantum resistor network for electron-wave computing", "abstract": "Interconnected ultrathin conducting wires or, equivalently, interconnected quasi-one-dimensional electron waveguides, which form a quantum resistor network, are presented here in four-terminal configurations. The transmission behaviors through such four-terminal networks are evaluated and classified. In addition, we show that such networks can be used as the basic building blocks for a possible massive wave computing machine in the future. In a network, each interconnection, a node point, is an elastic scatterer that routes the electron wave. Routing and rerouting of electron waves in a network is described in the framework of quantum transport from Landauer-Buttiker theory in the presence of multiple elastic scatterers. Transmissions through various types of four-terminal generalized clean Aharonov-Bohm rings are investigated at zero temperature. Useful logic functions are gathered based on the transmission probability to each terminal with the use of the Buttiker symmetry rule. In the generalized rings, even and odd numbers of terminals can possess some distinctly different transmission characteristics as we have shown here and earlier. Just as an even or odd number of atoms in a ring is an important quantity for classifying the transmission behavior, we show here that whether the number of terminals is an even or an odd number is just as important in understanding the physics of transmission through such a ring. Furthermore, we show that there are three basic classes of four-terminal rings and the scaling relation for each class is provided. In particular, the existence of equitransmission among all four terminals is shown here. This particular physical phenomena cannot exist in any three-terminal ring. Comparisons and discussions of transmission characteristics between three-terminal and four-terminal rings are also presented. The node-equation approach by considering the Kirchhoff current conservation law at each node point is used for this analysis. Many useful logic functions for electron-wave computing are shown here. In particular, we show that a full adder can be constructed very simply using the equitransmission property of the four-terminal ring. This is in sharp contrast with circuits based on transistor logic", "fulltext": "", "keywords": "equitransmission property;multiple elastic scatterers;four-terminal quantum resistor network;rerouting;transmission behavior;landauer-buttiker theory;quasi1d electron waveguides;buttiker symmetry rule;aharonov-bohm rings;electron-wave computing;kirchhoff current conservation law;transmission probability;interconnected ultrathin conducting wires;logic functions"}
{"name": "train_759", "title": "Mathematical properties of dominant AHP and concurrent convergence method", "abstract": "This study discusses the mathematical structure of the dominant AHP and the concurrent convergence method which were originally developed by Kinoshita and Nakanishi. They introduced a new concept of a regulating alternative into an analyzing tool for a simple evaluation problem with a criterion set and an alternative set. Although the original idea of the dominant AHP and the concurrent convergence method is unique, the dominant AHP and the concurrent convergence method are not sufficiently analyzed in mathematical theory. This study shows that the dominant AHP consists of a pair of evaluation rules satisfying a certain property of overall evaluation vectors. This study also shows that the convergence of concurrent convergence method is guaranteed theoretically", "fulltext": "", "keywords": "overall evaluation vectors;dominant ahp;concurrent convergence method"}
{"name": "train_76", "title": "Reaching strong consensus in a general network", "abstract": "The strong consensus (SC) problem is a variant of the conventional distributed consensus problem (also known as the Byzantine agreement problem). The SC problem requires that the agreed value among fault-free processors be one of the fault-free processor's initial values. Originally, the problem was studied in a fully connected network with malicious faulty processors. In this paper, the SC problem is re-examined in a general network, in which the components (processors and communication links) may be subjected to different faulty types simultaneously (also called the hybrid fault model or mixed faulty types) and the network topology does not have to be fully connected. The proposed protocol can tolerate the maximum number of tolerable faulty components such that each fault-free processor obtains a common value for the SC problem in a general network", "fulltext": "", "keywords": "hybrid fault model;strong consensus;byzantine agreement;fully connected network;strong consensus problem;distributed consensus problem;fault-tolerant distributed system;fault-free processors"}
{"name": "train_760", "title": "An improved fuzzy MCDM model based on ideal and anti-ideal concepts", "abstract": "Liang presented (1999) a fuzzy multiple criteria decision making (MCDM) method based on the concepts of ideal and anti-ideal points. Despite its merits, Liang method has the following limitations: (i) the objective criteria are converted into dimensionless indices and the subjective criteria are not converted, which may prevent compatibility for these criteria, (ii) the formulas for converting objective criteria are not reliable, and (iii) an unreliable ranking method, i.e. maximizing set and minimizing set, is applied to rank the fuzzy numbers. This paper applies the Hsu and Chen method and suggests a fuzzy number ranking method to propose an improved fuzzy MCDM model based on ideal and anti-ideal concepts to overcome the shortcomings of the Liang method. Numerical examples demonstrate the effectiveness and feasibility of the proposed ranking method and the improved model, respectively", "fulltext": "", "keywords": "ideal concepts;anti-ideal concepts;fuzzy number ranking;fuzzy mcdm model;dimensionless indices;multicriterion decision-making"}
{"name": "train_761", "title": "Towards a NMR implementation of a quantum lattice gas algorithm", "abstract": "Recent theoretical results suggest that an array of quantum information processors communicating via classical channels can be used to solve fluid dynamics problems. Quantum lattice-gas algorithms (QLGA) running on such architectures have been shown to solve the diffusion equation and the nonlinear Burgers equations. In this report, we describe progress towards an ensemble nuclear magnetic resonance (NMR) implementation of a QLGA that solves the diffusion equation. The methods rely on NMR techniques to encode an initial mass density into an ensemble of two-qubit quantum information processors. Using standard pulse techniques, the mass density can then manipulated and evolved through the steps of the algorithm. We provide the experimental results of our first attempt to realize the NMR implementation. The results qualitatively follow the ideal simulation, but the observed implementation errors highlight the need for improved control", "fulltext": "", "keywords": "quantum lattice gas algorithm;two-qubit quantum information.processors;fluid dynamics problems;nuclear magnetic resonance;diffusion equation;quantum information processors;nmr implementation;nonlinear burgers equations"}
{"name": "train_762", "title": "Quantum computing with spin qubits in semiconductor structures", "abstract": "We survey recent work on designing and evaluating quantum computing implementations based on nuclear or bound-electron spins in semiconductor heterostructures at low temperatures and in high magnetic fields. General overview is followed by a summary of results of our theoretical calculations of decoherence time scales and spin-spin interactions. The latter were carried out for systems for which the two-dimensional electron gas provides the dominant carrier for spin dynamics via exchange of spin-excitons in the integer quantum Hall regime", "fulltext": "", "keywords": "spin-spin interactions;low temperatures;semiconductor heterostructures;spin dynamics;2deg;spin qubits;quantum computing;spin-excitons exchange;2d electron gas;high magnetic fields;dominant carrier;semiconductor structures;integer quantum hall regime;integer qhe"}
{"name": "train_763", "title": "A quantum full adder for a scalable nuclear spin quantum computer", "abstract": "We demonstrate a strategy for implementation a quantum full adder in a spin chain quantum computer. As an example, we simulate a quantum full adder in a chain containing 201 spins. Our simulations also demonstrate how one can minimize errors generated by non-resonant effects", "fulltext": "", "keywords": "scalable nuclear spin quantum computer;error minimization;nonresonant effects;quantum full adder"}
{"name": "train_764", "title": "Lattice Boltzmann schemes for quantum applications", "abstract": "We review the basic ideas behind the quantum lattice Boltzmann equation (LBE), and present a few thoughts on the possible use of such an equation for simulating quantum many-body problems on both (parallel) electronic and quantum computers", "fulltext": "", "keywords": "quantum applications;quantum many-body problems;quantum computers;lattice boltzmann schemes;parallel computing"}
{"name": "train_765", "title": "Simulating fermions on a quantum computer", "abstract": "The real-time probabilistic simulation of quantum systems in classical computers is known to be limited by the so-called dynamical sign problem, a problem leading to exponential complexity. In 1981 Richard Feynman raised some provocative questions in connection to the \"exact imitation\" of such systems using a special device named a \"quantum computer\". Feynman hesitated about the possibility of imitating fermion systems using such a device. Here we address some of his concerns and, in particular, investigate the simulation of fermionic systems. We show how quantum computers avoid the sign problem in some cases by reducing the complexity from exponential to polynomial. Our demonstration is based upon the use of isomorphisms of algebras. We present specific quantum algorithms that illustrate the main points of our algebraic approach", "fulltext": "", "keywords": "fermions simulation;sign problem;quantum computer;exponential complexity;real-time probabilistic simulation;isomorphisms;algebras;classical computers;dynamical sign problem;fermion systems"}
{"name": "train_766", "title": "Physical quantum algorithms", "abstract": "I review the differences between classical and quantum systems, emphasizing the connection between no-hidden variable theorems and superior computational power of quantum computers. Using quantum lattice gas automata as examples, I describe possibilities for efficient simulation of quantum and classical systems with a quantum computer. I conclude with a list of research directions", "fulltext": "", "keywords": "quantum lattice gas automata;quantum computers;classical systems;physical quantum algorithms;no-hidden variable theorems"}
{"name": "train_767", "title": "Quantum computation for physical modeling", "abstract": "One of the most famous American physicists of the twentieth century, Richard Feynman, in 1982 was the first to propose using a quantum mechanical computing device to efficiently simulate quantum mechanical many-body dynamics, a task that is exponentially complex in the number of particles treated and is completely intractable by any classical computing means for large systems of many particles. In the two decades following his work, remarkable progress has been made both theoretically and experimentally in the new field of quantum computation", "fulltext": "", "keywords": "quantum mechanical many-body dynamics;quantum computation;quantum mechanical computing;physical modeling"}
{"name": "train_768", "title": "Critical lines identification on voltage collapse analysis", "abstract": "This paper deals with critical lines identification on voltage collapse analysis. It is known, from the literature, that voltage collapse is a local phenomenon that spreads around an initial neighborhood Therefore, identifying the system critical bus plays an important role on voltage collapse prevention. For this purpose, the system critical transmission lines should also be identified In this paper, these issues are addressed, yielding reliable results in a short computational time. Tests are done with the help of the IEEE-118 bus and the Southeastern Brazilian systems", "fulltext": "", "keywords": "brazil;computer simulation;power system voltage collapse analysis;local phenomenon;critical transmission lines identification;system critical bus identification;ieee-118 bus"}
{"name": "train_769", "title": "Permission grids: practical, error-bounded simplification", "abstract": "We introduce the permission grid, a spatial occupancy grid which can be used to guide almost any standard polygonal surface simplification algorithm into generating an approximation with a guaranteed geometric error bound. In particular, all points on the approximation are guaranteed to be within some user-specified distance from the original surface. Such bounds are notably absent from many current simplification methods, and are becoming increasingly important for applications in scientific computing and adaptive level of detail control. Conceptually simple, the permission grid defines a volume in which the approximation must lie, and does not permit the underlying simplification algorithm to generate approximations outside the volume. The permission grid makes three important, practical improvements over current error-bounded simplification methods. First, it works on arbitrary triangular models, handling all manners of mesh degeneracies gracefully. Further, the error tolerance may be easily expanded as simplification proceeds, allowing the construction of an error-bounded level of detail hierarchy with vertex correspondences among all levels of detail. And finally, the permission grid has a representation complexity independent of the size of the input model, and a small running time overhead, making it more practical and efficient than current methods with similar guarantees", "fulltext": "", "keywords": "spatial occupancy grid;approximation;mesh degeneracies;error-bounded simplification;vertex correspondences;error tolerance;arbitrary triangular models;adaptive level of detail control;representation complexity;user-specified distance;running time overhead;scientific computing;permission grid;polygonal surface simplification algorithm;guaranteed geometric error bound"}
{"name": "train_77", "title": "Modeling frequently accessed wireless data with weak consistency", "abstract": "To reduce the response times of wireless data access in a mobile network, caches are utilized in wireless handheld devices. If the original data entry has been updated, the cached data in the handheld device becomes stale. Thus, a mechanism is required to predict when the cached copy will expire. This paper studies a weakly consistent data access mechanism that computes the time-to-live (TTL) interval to predict the expiration time. We propose an analytic model to investigate this TTL-based algorithm for frequently accessed data. The analytic model is validated against simulation experiments. Our study quantitatively indicates how the TTL-based algorithm reduces the wireless communication cost by increasing the probability of stale accesses. Depending on the requirements of the application, appropriate parameter values can be selected based on the guidelines provided", "fulltext": "", "keywords": "time-to-live interval;mobile network;data entry;weak consistency;stale access probability;expiration time prediction;wireless data access;caches;simulation experiments;frequently accessed wireless data modeling;response time reduction;wireless communication cost;wireless handheld devices;analytic model"}
{"name": "train_770", "title": "The 3D visibility complex", "abstract": "Visibility problems are central to many computer graphics applications. The most common examples include hidden-part removal for view computation, shadow boundaries, mutual visibility of objects for lighting simulation. In this paper, we present a theoretical study of 3D visibility properties for scenes of smooth convex objects. We work in the space of light rays, or more precisely, of maximal free segments. We group segments that \"see\" the same object; this defines the 3D visibility complex. The boundaries of these groups of segments correspond to the visual events of the scene (limits of shadows, disappearance of an object when the viewpoint is moved, etc.). We provide a worst case analysis of the complexity of the visibility complex of 3D scenes, as well as a probabilistic study under a simple assumption for \"normal\" scenes. We extend the visibility complex to handle temporal visibility. We give an output-sensitive construction algorithm and present applications of our approach", "fulltext": "", "keywords": "visual events;computer graphics;light rays;3d visibility complex;hidden-part removal;probabilistic study;output-sensitive construction algorithm;temporal visibility;view computation;maximal free segments;normal scenes;mutual object visibility;shadow boundaries;smooth convex objects;lighting simulation;worst case complexity analysis"}
{"name": "train_771", "title": "Pareto-optimal formulations for cost versus colorimetric accuracy trade-offs in", "abstract": "printer color management Color management for the printing of digital images is a challenging task, due primarily to nonlinear ink-mixing behavior and the presence of redundant solutions for print devices with more than three inks. Algorithms for the conversion of image data to printer-specific format are typically designed to achieve a single predetermined rendering intent, such as colorimetric accuracy. We present two CIELAB to CMYK color conversion schemes based on a general Pareto-optimal formulation for printer color management. The schemes operate using a 149-color characterization data set selected to efficiently capture the entire CMYK gamut. The first scheme uses artificial neural networks as transfer functions between the CIELAB and CMYK spaces. The second scheme is based on a reformulation of tetrahedral interpolation as an optimization problem. Characterization data are divided into tetrahedra for the interpolation-based approach using the program Qhull, which removes the common restriction that characterization data be well organized. Both schemes offer user control over trade-off problems such as cost versus reproduction accuracy, allowing for user-specified print objectives and the use of constraints such as maximum allowable ink and maximum allowable AE*/sub ab/. A formulation for minimization of ink is shown to be particularly favorable, integrating both a clipping and gamut compression features into a single methodology", "fulltext": "", "keywords": "cost versus colorimetric accuracy trade-offs;qhull program;clipping;color characterization data set;image data conversion;nonlinear ink-mixing behavior;gamut compression features;optimization;rendering intent;user-specified print objectives;interpolation-based approach;cost versus reproduction accuracy;digital image printing;printer color management;macbeth colorchecker chart;pareto-optimal formulations;transfer functions;redundant solutions;constraints;grey component replacement;tetrahedra;artificial neural networks;maximum allowable ink;tetrahedral interpolation;cielab to cmyk color conversion schemes;user control"}
{"name": "train_772", "title": "Meshed atlases for real-time procedural solid texturing", "abstract": "We describe an implementation of procedural solid texturing that uses the texture atlas, a one-to-one mapping from an object's surface into its texture space. The method uses the graphics hardware to rasterize the solid texture coordinates as colors directly into the atlas. A texturing procedure is applied per-pixel to the texture map, replacing each solid texture coordinate with its corresponding procedural solid texture result. The procedural solid texture is then mapped back onto the object surface using standard texture mapping. The implementation renders procedural solid textures in real time, and the user can design them interactively. The quality of this technique depends greatly on the layout of the texture atlas. A broad survey of texture atlas schemes is used to develop a set of general purpose mesh atlases and tools for measuring their effectiveness at distributing as many available texture samples as evenly across the surface as possible. The main contribution of this paper is a new multiresolution texture atlas. It distributes all available texture samples in a nearly uniform distribution. This multiresolution texture atlas also supports MIP-mapped minification antialiasing and linear magnification filtering", "fulltext": "", "keywords": "object surface;texture atlas;graphics hardware;one-to-one mapping;real-time procedural solid texturing;rendering;texture space;meshed atlases;solid texture coordinates;linear magnification filtering;colors;mip-mapped minification antialiasing;multiresolution texture atlas;rasterization"}
{"name": "train_773", "title": "Topology-reducing surface simplification using a discrete solid representation", "abstract": "This paper presents a new approach for generating coarse-level approximations of topologically complex models. Dramatic topology reduction is achieved by converting a 3D model to and from a volumetric representation. Our approach produces valid, error-bounded models and supports the creation of approximations that do not interpenetrate the original model, either being completely contained in the input solid or bounding it. Several simple to implement versions of our approach are presented and discussed. We show that these methods perform significantly better than other surface-based approaches when simplifying topologically-rich models such as scene parts and complex mechanical assemblies", "fulltext": "", "keywords": "topology-reducing surface simplification;topologically complex models;scene parts;discrete solid representation;3d model;complex mechanical assemblies;coarse-level approximations;volumetric representation;error-bounded models"}
{"name": "train_774", "title": "Keeping Web accessibility in mind: I&R services for all", "abstract": "After presenting three compelling reasons for making Web sites accessible to persons with a broad range of disabilities (it's the morally right thing to do, it's the smart thing to do from an economic perspective, and it's required by law), the author discusses design issues that impact persons with particular types of disabilities. She presents practical advice for assessing and addressing accessibility problems. An extensive list of resources for further information is appended, as is a list of sites which simulate the impact of specific accessibility problems on persons with disabilities", "fulltext": "", "keywords": "disabilities;web site accessibility;information and referral services"}
{"name": "train_775", "title": "Disability-related special libraries", "abstract": "One of the ways that the federal government works to improve services to people with disabilities is to fund disability-related information centers and clearinghouses that provide information resources and referrals to disabled individuals, their family members, service providers, and the general public. The Teaching Research Division of Western Oregon University operates two federally funded information centers for people with disabilities: OBIRN (the Oregon Brain Injury Resource Network) and DB-LINK (the National Information Clearinghouse on Children who are Deaf-Blind). Both have developed in-depth library collections and services in addition to typical clearinghouse services. The authors describe how OBIRN and DB-LINK were designed and developed, and how they are currently structured and maintained. Both information centers use many of the same strategies and tools in day-to-day operations, but differ in a number of ways, including materials and clientele", "fulltext": "", "keywords": "library collections;disability-related clearinghouses;disability-related special libraries;information resources;disability-related information centers;national information clearinghouse on children who are deaf-blind;db-link;oregon brain injury resource network;obirn;federal government;western oregon university;information referrals"}
{"name": "train_776", "title": "Information access for all: meeting the needs of deaf and hard of hearing", "abstract": "people Discusses the nature of deafness and hearing impairments, with particular reference to the impact which the onset of hearing loss presents at various ages. The author goes on to present practical tips for interacting with deaf and hard of hearing clients in various communication contexts, including sightreading, TTY communications, and ASL interpreters. An annotated list of suggested readings is appended", "fulltext": "", "keywords": "information access;deaf clients;asl interpreters;deafness;communication contexts;hard of hearing clients;sightreading;hearing impairments;tty communications"}
{"name": "train_777", "title": "Access to information for blind and visually impaired clients", "abstract": "This article guides I&R providers in establishing effective communication techniques for working with visually impaired consumers. The authors discuss common causes of vision impairment and the functional implications of each and offer information on disability etiquette and effective voice, accessible media and in-person communication. There is an overview of assistive technologies used by people who are visually impaired-to facilitate written and electronic communications as well as low-tech solutions for producing large-print and Braille materials in-house. Providers who implement these communication techniques will be well equipped to serve visually-impaired consumers, and consumers will be more likely to avail themselves of these services when providers make them easily accessible", "fulltext": "", "keywords": "information and referral systems;information access;written communications;effective voice;accessible media;large-print materials;assistive technologies;communication techniques;disability etiquette;braille materials;visually impaired clients;electronic communications;in-person communication;blind clients"}
{"name": "train_778", "title": "Access matters", "abstract": "Discusses accessibility needs of people with disabilities, both from the perspective of getting the information from I&R programs (including accessible Web sites, TTY access, Braille, and other mechanisms) and from the perspective of being aware of accessibility needs when referring clients to resources. Includes information on ADA legislation requiring accessibility to public places and recommends several organizations and Web sites for additional information", "fulltext": "", "keywords": "information and referral programs;public places;braille;accessibility needs;disabled people;ada legislation;accessible web sites;tty access"}
{"name": "train_779", "title": "Domesticating computers and the Internet", "abstract": "The people who use computers and the ways they use them have changed substantially over the past 25 years. In the beginning highly educated people, mostly men, in technical professions used computers for work, but over time a much broader range of people are using computers for personal and domestic purposes. This trend is still continuing, and over a shorter time scale has been replicated with the use of the Internet. The paper uses data from four national surveys to document how personal computers and the Internet have become increasingly domesticated since 1995 and to explore the mechanisms for this shift. Now people log on more often from home than from places of employment and do so for pleasure and for personal purposes rather than for their jobs. Analyses comparing veteran Internet users to novices in 1998 and 2000 and analyses comparing the change in use within a single sample between 1995 and 1996 support two complementary explanations for how these technologies have become domesticated. Women, children, and less well-educated individuals are increasingly using computers and the Internet and have a more personal set of motives than well-educated men. In addition, the widespread diffusion of the PC and the Internet and the response of the computing industry to the diversity in consumers has led to a rich set of personal and domestic services", "fulltext": "", "keywords": "demographics;novices;personal motives;internet;women;veteran internet users;domestic purposes;national surveys;online behavior;highly educated people;personal usage;domestic services;pc diffusion;computer domestication;computing industry;technical professions;personal computers;children"}
{"name": "train_78", "title": "Applying genetic algorithms to solve the fuzzy optimal profit problem", "abstract": "This study investigated the application of genetic algorithms in solving a fuzzy optimization problem that arises in business and economics. In this problem, a fuzzy price is determined using a linear or a quadratic fuzzy demand function as well as a linear cost function. The objective is to find the optimal fuzzy profit, which is derived from the fuzzy price and fuzzy cost. Traditional methods for solving this problem are (1) the extension principle, and (2) using interval arithmetic and alpha -cuts. However, we argue that traditional methods for solving this problem are too restrictive to produce an optimal solution, and that an alternative approach is possibly needed. We use genetic algorithms to obtain an approximate solution for this fuzzy optimal profit problem without using membership functions. We not only give empirical examples to show the effectiveness of this approach, but also give theoretical proofs to validate correctness of the algorithm. We conclude that genetic algorithms can produce good approximate solutions when applied to solve fuzzy optimization problems", "fulltext": "", "keywords": "linear cost function;fuzzy price;economics;theoretical proofs;business;fuzzy optimal profit problem;genetic algorithms;linear fuzzy demand function;algorithm correctness validation;fuzzy optimization problem;approximate solution;quadratic fuzzy demand function"}
{"name": "train_780", "title": "Failures and successes: notes on the development of electronic cash", "abstract": "Between 1997 and 2001, two mid-sized communities in Canada hosted North America's most comprehensive experiment to introduce electronic cash and, in the process, replace physical cash for casual, low-value payments. The technology used was Mondex, and its implementation was supported by all the country's major banks. It was launched with an extensive publicity campaign to promote Mondex not only in the domestic but also in the global market, for which the Canadian implementation was to serve as a \"showcase.\" However, soon after the start of the first field test it became apparent that the new technology did not work smoothly. On the contrary, it created a host of controversies, in areas as varied as computer security, consumer privacy, and monetary policy. In the following years, few of these controversies could be resolved and Mondex could not be established as a widely used payment mechanism. In 2001, the experiment was finally terminated. Using the concepts developed in recent science and technology studies (STS), the article analyzes these controversies as resulting from the difficulties of fitting electronic cash, a new sociotechnical system, into the complex setting of the existing payment system. The story of Mondex not only offers lessons on why technologies fail, but also offers insight into how short-term failures can contribute to long-term transformations. This suggests the need to rethink the dichotomy of success and failure", "fulltext": "", "keywords": "long-term transformations;short-term failures;global market;low-value payments;payment mechanism;mondex;canadian implementation;publicity campaign;major banks;canada;electronic cash;computer security;science and technology studies;consumer privacy;sociotechnical system;monetary policy"}
{"name": "train_781", "title": "ICANN and Internet governance: leveraging technical coordination to realize", "abstract": "global public policy The Internet Corporation for Assigned Names and Numbers (ICANN) was created in 1998 to perform technical coordination of the Internet. ICANN also lays the foundations for governance, creating capabilities for promulgating and enforcing global regulations on Internet use. ICANN leverages the capabilities in the Internet domain name system (DNS) to implement four mechanisms of governance: authority, law, sanctions, and jurisdictions. These governance-related features are embodied in seemingly technical features of ICANN's institutional design. Recognition of ICANN's governance mechanisms allows us to better understand the Internet's emerging regulatory regime", "fulltext": "", "keywords": "global regulations;institutional design;governance-related features;internet governance;internet dns;global public policy;regulatory regime;internet domain name system;technical coordination;icann;internet use;internet corporation for assigned names and numbers"}
{"name": "train_782", "title": "Community technology and democratic rationalization", "abstract": "The objective of the paper is to explore questions of human agency and democratic process in the technical sphere through the example of \"virtual community.\" The formation of relatively stable long-term group associations (community in the broad sense of the term), is the scene on which a large share of human development occurs. As such it is a fundamental human value mobilizing diverse ideologies and sensitivities. The promise of realizing this value in a new domain naturally stirs up much excitement among optimistic observers of the Internet. At the same time, the eagerness to place hopes for community in a technical system flies in the face of an influential intellectual tradition of technology criticism. This eagerness seems even more naive in the light of the recent commercialization of so much Internet activity. Despite the widespread skepticism, we believe the growth of virtual community is significant for an inquiry into the democratization of technology. We show that conflicting answers to the central question of the present theoretical debate - Is community possible on computer networks? epsilon neralize from particular features of systems and software prevalent at different stages in the development of computer networking. We conclude that research should focus instead on how to design computer networks to better support community activities and values", "fulltext": "", "keywords": "human development;human value;intellectual tradition;computer networking;stable long-term group associations;conflicting answers;democratic process;optimistic observers;technical system;democratic rationalization;internet activity;community activities;virtual community;technical sphere;computer networks;human agency;diverse ideologies;technology criticism;community technology"}
{"name": "train_783", "title": "The network society as seen from Italy", "abstract": "Italy was behind the European average in Internet development for many years, but a new trend, which has brought considerable change, emerged at the end of 1998 and showed its effects in 2000 and the following years. Now Italy is one of the top ten countries worldwide in Internet hostcount and the fourth largest in Europe. The density of Internet activity in Italy in proportion to the population is still below the average in the European Union, but is growing faster than Germany, the UK and France, and faster than the worldwide or European average. From the point of view of media control there are several problems. Italy has democratic institutions and freedom of speech, but there is an alarming concentration in the control of mainstream media (especially broadcast). There are no officially declared restrictions in the use of the Internet, but several legal and regulatory decisions reveal a desire to limit freedom of opinion and dialogue and/or gain centralized control of the Net", "fulltext": "", "keywords": "network society;internet development;uk;europe;media control;freedom of speech;france;worldwide average;regulatory decisions;european union;internet activity;italy;legal decisions;broadcast media;centralized control;european average;democratic institutions;internet hostcount;germany;mainstream media"}
{"name": "train_784", "title": "Where tech is cheap [servers]", "abstract": "Talk, consultancy, support, not tech is the expensive part of network installations. It's a good job that small-scale servers can either be remotely managed, or require little actual management", "fulltext": "", "keywords": "small-scale servers;network installations;management"}
{"name": "train_785", "title": "Networking without wires", "abstract": "Several types of devices use radio transmitters to send data over thin air. Are WLANs, wireless local area networks, the end to all cables? Will Dalrymple weighs up the costs and benefits", "fulltext": "", "keywords": "costs;benefits;wireless local area networks"}
{"name": "train_787", "title": "New kit on the block [IT upgrades]", "abstract": "As time passes, new hardware and software replace the old. The hows are straightforward: IT resellers and consultants can help with upgrade practicalities. Will Dalrymple examines the business issues and costs involved in IT upgrades", "fulltext": "", "keywords": "microsoft;costs;business issues;it upgrades;it resellers;consultants"}
{"name": "train_788", "title": "Rise of the supercompany [CRM]", "abstract": "All the thoughts, conversations and notes of employees help the firm create a wider picture of business. Customer relationship management (CRM) feeds on data, and it is hungry", "fulltext": "", "keywords": "customer relationship management;staff trained;database;central data repository"}
{"name": "train_79", "title": "An efficient and stable ray tracing algorithm for parametric surfaces", "abstract": "In this paper, we propose an efficient and stable algorithm for finding ray-surface intersections. Newton's method and Bezier clipping are adapted to form the core of our algorithm. Ray coherence is used to find starting points for Newton iteration. We introduce an obstruction detection technique to verify whether an intersection point found using Newton's method is the closest. When Newton's method fails to achieve convergence, we use Bezier clipping substitution to find the intersection points. This combination achieves a significant improvement in tracing primary rays. A similar approach successfully improves the performance of tracing secondary rays", "fulltext": "", "keywords": "newton iteration;ray-surface intersections;primary ray tracing;ray coherence;efficient stable ray tracing algorithm;convergence;obstruction detection technique;bezier clipping;parametric surfaces;newton method;secondary ray tracing"}
{"name": "train_790", "title": "Data assimilation of local model error forecasts in a deterministic model", "abstract": "One of the most popular data assimilation techniques in use today are of the Kalman filter type, which provide an improved estimate of the state of a system up to the current time level, based on actual measurements. From a forecasting viewpoint, this corresponds to an updating of the initial conditions. The standard forecasting procedure is to then run the model uncorrected into the future, driven by predicted boundary and forcing conditions. The problem with this methodology is that the updated initial conditions quickly 'wash-out', thus, after a certain forecast horizon the model predictions are no better than from an initially uncorrected model. This study demonstrates that through the assimilation of error forecasts (in the present case made using so-called local models) entire model domains can be corrected for extended forecast horizons (i.e. long after updated initial conditions have become washed-out), thus demonstrating significant improvements over the conventional methodology. Some alternate uses of local models are also explored for the re-distribution of error forecasts over the entire model domain, which are then compared with more conventional Kalman filter type schemes", "fulltext": "", "keywords": "forcing conditions;error prediction;kalman filter;hydrodynamic modelling;deterministic model;local model error forecasts;forecast horizon;data assimilation"}
{"name": "train_791", "title": "The rise and fall and rise again of customer care", "abstract": "Taking care of customers has never gone out of style, but as the recession fades, interest is picking up in a significant retooling of the CRM solutions banks have been using. The goal: usable knowledge to help improve service", "fulltext": "", "keywords": "banks;customer relationship management;usable knowledge"}
{"name": "train_792", "title": "Remember e-commerce? Yeah, well, it's still here", "abstract": "Sandy Kemper, the always outspoken CEO of successful e-commerce company eScout, offers his views on the purported demise of \"commerce\" in e-commerce, and what opportunities lie ahead for those bankers bold enough to act in a market turned tentative by early excesses", "fulltext": "", "keywords": "e-commerce;escout;bankers"}
{"name": "train_793", "title": "Advancements during the past quarter century in on-line monitoring of motor and", "abstract": "generator winding insulation Electrical insulation plays a critical role in the operation of motor and generator rotor and stator windings. Premature failure of the insulation can cost millions of dollars per day. With advancements in electronics, sensors, computers and software, tremendous progress has been made in the past 25 yr which has transformed on-line insulation monitoring from a rarely used and expensive tool, to the point where 50% of large utility generators in North America are now equipped for such monitoring. This review paper outlines the motivation for online monitoring, discusses the transition to today's technology, and describes the variety of methods now in use for rotor winding and stator winding monitoring", "fulltext": "", "keywords": "motor generator winding insulation;stator windings;ozone monitoring;sensors;endwinding vibration monitoring;electronics;rotor windings;winding insulation on-line monitoring;software;magnetic flux monitoring;partial discharge monitoring;temperature monitoring;pd monitoring;generator winding insulation;premature insulation failure;computers;tagging compounds;condition monitors;electrical insulation"}
{"name": "train_794", "title": "On the discretization of double-bracket flows", "abstract": "This paper extends the method of Magnus series to Lie-algebraic equations originating in double-bracket flows. We show that the solution of the isospectral flow Y' = [[Y,N],Y], Y(O) = Y/sub 0/ in Sym(n), can be represented in the form Y(t) = e/sup Omega (t)/Y/sub 0/e/sup - Omega (1)/, where the Taylor expansion of Omega can be constructed explicitly, term-by-term, identifying individual expansion terms with certain rooted trees with bicolor leaves. This approach is extended to other Lie-algebraic equations that can be appropriately expressed in terms of a finite \"alphabet\"", "fulltext": "", "keywords": "bicolor leaves;double-bracket flows discretization;isospectral flow;taylor expansion;lie-algebraic equations;magnus series"}
{"name": "train_795", "title": "Approximation and complexity. II. Iterated integration", "abstract": "For pt. I. see ibid., no. 1, p. 289-95 (2001). We introduce two classes of real analytic functions W contained in/implied by U on an interval. Starting with rational functions to construct functions in W we allow the application of three types of operations: addition, integration, and multiplication by a polynomial with rational coefficients. In a similar way, to construct functions in U we allow integration, addition, and multiplication of functions already constructed in U and multiplication by rational numbers. Thus, U is a subring of the ring of Pfaffian functions. Two lower bounds on the L/sub infinity /-norm are proved on a function f from W (or from U, respectively) in terms of the complexity of constructing f", "fulltext": "", "keywords": "integration;l/sub infinity /-norm;pfaffian functions;multiplication;lower bounds;polynomial;rational functions;real analytic functions;addition"}
{"name": "train_796", "title": "Quadratic Newton iteration for systems with multiplicity", "abstract": "Newton's iterator is one of the most popular components of polynomial equation system solvers, either from the numeric or symbolic point of view. This iterator usually handles smooth situations only (when the Jacobian matrix associated to the system is invertible). This is often a restrictive factor. Generalizing Newton's iterator is still an open problem: How to design an efficient iterator with a quadratic convergence even in degenerate cases? We propose an answer for an m-adic topology when the ideal m can be chosen generic enough: compared to a smooth case we prove quadratic convergence with a small overhead that grows with the square of the multiplicity of the root", "fulltext": "", "keywords": "newton's iterator;jacobian matrix;polynomial equation system solvers;systems with multiplicity;m-adic topology;quadratic newton iteration;quadratic convergence"}
{"name": "train_797", "title": "Adaptive wavelet methods. II. Beyond the elliptic case", "abstract": "This paper is concerned with the design and analysis of adaptive wavelet methods for systems of operator equations. Its main accomplishment is to extend the range of applicability of the adaptive wavelet-based method developed previously for symmetric positive definite problems to indefinite or unsymmetric systems of operator equations. This is accomplished by first introducing techniques (such as the least squares formulation developed previously) that transform the original (continuous) problem into an equivalent infinite system of equations which is now well-posed in the Euclidean metric. It is then shown how to utilize adaptive techniques to solve the resulting infinite system of equations. It is shown that for a wide range of problems, this new adaptive method performs with asymptotically optimal complexity, i.e., it recovers an approximate solution with desired accuracy at a computational expense that stays proportional to the number of terms in a corresponding wavelet-best N-term approximation. An important advantage of this adaptive approach is that it automatically stabilizes the numerical procedure so that, for instance, compatibility constraints on the choice of trial spaces, like the LBB condition, no longer arise", "fulltext": "", "keywords": "asymptotically optimal complexity;operator equations;adaptive wavelet methods;elliptic case;euclidean metric;n-term approximation;least squares formulation"}
{"name": "train_798", "title": "ClioWeb, ClioRequest, and Clio database: enhancing patron and staff", "abstract": "satisfaction Faced with increased demand from students and faculty for a speedier and more user-friendly method of obtaining materials from other institutions, the interlibrary loan (ILL) department sought to implement a management system which would accomplish the task. Students wanted remote interconnectivity to the system and staff wanted increased workflow efficiency, reduced paper work, and better data management. This paper focuses on Washington College's experience in selecting and implementing an interlibrary loan system, which would enhance student satisfaction as well as that of the library staff", "fulltext": "", "keywords": "clio database;user-friendly method;patron satisfaction;faculty;interlibrary loan department;washington college;data management;cliorequest;staff satisfaction;remote interconnectivity;clioweb;management system;workflow efficiency;students"}
{"name": "train_799", "title": "Electronic reserves at University College London: understanding the needs of", "abstract": "academic departments This article describes a recent project at University College London to explore the feasibility of providing a service to improve access to electronic course materials. Funded by the Higher Education Funding Council for England (HEFCE), the project was not simply to set up an electronic reserve. By undertaking a needs analysis of academic departments, the project was able to tailor the design of the new service appropriately. While new initiatives in libraries are often established using project funding, this work was unique in being research-led. It also involved collaboration between library and computing staff and learning technologists", "fulltext": "", "keywords": "higher education funding council for england;electronic course materials;university college london;learning technologists;academic department needs;computing staff;electronic reserves"}
{"name": "train_8", "title": "New investors get steal of a deal [Global Crossing]", "abstract": "Hutchison Telecommunications and Singapore Technologies take control of Global Crossing for a lot less money than they originally offered. The deal leaves the bankrupt carrier intact, but doesn't put it in the clear just yet", "fulltext": "", "keywords": "global crossing;hutchison telecommunications;bankrupt;singapore technologies"}
{"name": "train_80", "title": "Evaluating the performance of a distributed database of repetitive elements in", "abstract": "complete genomes The original version of the Repeat Sequence Database (RSDB) was created based on centralized database systems (CDBSs). RSDB presently includes an enormous amount of data, with the amount of biological data increasing rapidly. Distributed RSDB (DRSDB) is developed to yield better performance. This study proposed many approaches to data distribution and experimentally determines the best approach to obtain good performance of our database. Experimental results indicate that DRSDB performs well for particular types of query", "fulltext": "", "keywords": "distributed repeat sequence database;complete genomes;repetitive elements;data distribution;performance evaluation;biological data;queries"}
{"name": "train_800", "title": "A model for choosing an electronic reserves system: a pre-implementation study", "abstract": "at the library of Long Island University's Brooklyn campus This study explores the nature of electronic reserves (e-reserves) and investigates the possibilities of implementing the e-reserves at the Long Island University/Brooklyn Campus Library (LIU/BCL)", "fulltext": "", "keywords": "long island university brooklyn campus library;electronic reserves system"}
{"name": "train_801", "title": "International customers, suppliers, and document delivery in a fee-based", "abstract": "information service The Purdue University Libraries library fee-based information service, the Technical Information Service (TIS), works with both international customers and international suppliers to meet its customers' needs for difficult and esoteric document requests. Successful completion of these orders requires the ability to verify fragmentary citations; ascertain documents' availability; obtain pricing information; calculate inclusive cost quotes; meet customers' deadlines; accept international payments; and ship across borders. While international orders make tip a small percent of the total workload, these challenging and rewarding orders meet customers' needs and offer continuous improvement opportunities to the staff", "fulltext": "", "keywords": "fragmentary citation verification;inclusive cost quotes;pricing information;document requests;international customers;document availability;document delivery;continuous staff improvement;customer deadline meeting;purdue university libraries fee-based information service;technical information service;international payments;international suppliers"}
{"name": "train_802", "title": "A brief history of electronic reserves", "abstract": "Electronic reserves has existed as a library service for barely ten years, yet its history, however brief, is important as an indicator of the direction being taken by the profession of Librarianship as a whole. Recent improvements in technology and a desire to provide better service to students and faculty have resulted in the implementation of e-reserves by ever greater numbers of academic libraries. Yet a great deal of confusion still surrounds the issue of copyright compliance. Negotiation, litigation, and legislation in particular have framed the debate over the application of fair use to an e-reserves environment, and the question of whether or not permission fees should be paid to rights holders, but as of yet no definitive answers or standards have emerged", "fulltext": "", "keywords": "library service;faculty;permission fees;copyright compliance;e-reserves environment;legislation;negotiation;librarianship;litigation;students;academic libraries;electronic reserves"}
{"name": "train_803", "title": "The mutual effects of grid and wind turbine voltage stability control", "abstract": "This note considers the results of wind turbine modelling and power system stability investigations. Voltage stability of the power grid with grid-connected wind turbines will be improved by using blade angle control for a temporary reduction of the wind turbine power during and shortly after a short circuit fault in the grid", "fulltext": "", "keywords": "wind turbine modelling;power system stability;grid voltage stability control;wind turbine power reduction;wind turbine voltage stability control;short circuit fault;blade angle control;power grid;offshore wind turbines;grid-connected wind turbines"}
{"name": "train_804", "title": "Voltage control methods with grid connected wind turbines: a tutorial review", "abstract": "Within electricity grid networks it is conventional for large-scale central generators to both provide power and control grid node voltage. Therefore when wind turbines replace conventional power stations on a substantial scale, they must not only generate power, but also control grid node voltages. This paper reviews the basic principles of voltage control for tutorial benefit and then considers application of grid-connected wind turbines for voltage control. The most widely used contemporary wind turbine types are considered and further detail is given for determining the range of variables that allow control", "fulltext": "", "keywords": "electricity grid networks;reactive power;direct drive synchronous generator;voltage control;direct drive;offshore wind park;converter rating;grid connected wind turbines;weak grid;squirrel cage induction generator;large-scale central generators;grid node voltages control;variable speed;doubly fed induction generator"}
{"name": "train_805", "title": "Active pitch control in larger scale fixed speed horizontal axis wind turbine", "abstract": "systems. I. linear controller design This paper reviews and addresses the principles of linear controller design of the fixed speed wind turbine system in above rated wind speed, using pitch angle control of the blades and applying modern control theory. First, the nonlinear equations of the system are built in under some reasonable suppositions. Then, the nonlinear equations are linearised at set operating point and digital simulation results are shown in this paper. Finally, a linear quadratic optimal feedback controller is designed and the dynamics of the closed circle system are simulated with digital calculation. The advantages and disadvantages of the assumptions and design method are also discussed. Because of the inherent characteristics of the linear system control theory, the performance of the linear controller is not sufficient for operating wind turbines, as is discussed", "fulltext": "", "keywords": "linear quadratic optimal feedback controller;aerodynamics;drive train dynamics;nonlinear equations;wind turbines;fixed speed wind turbine system;active pitch control;pitch angle control;horizontal axis wind turbine systems;linear system control theory;linear controller design;control theory;closed circle system;digital simulation"}
{"name": "train_806", "title": "Flow measurement - future directions", "abstract": "Interest in the flow of liquids and its measurement can be traced back to early studies by the Egyptians, the Chinese and the Romans. Since these early times the science of flow measurement has undergone a massive change but during the last 25 years or so (1977-2002) it has matured enormously. One of the principal reasons for this is that higher accuracies and reliabilities have been demanded by industry in the measurement of fiscal transfers and today there is vigorous interest in the subject from both the flowmeter manufacturer and user viewpoints. This interest is coupled with the development of advanced computer techniques in fluid mechanics together with the application of increasingly sophisticated electronics", "fulltext": "", "keywords": "fiscal transfers;flow metering;liquid flow;egyptians;flowmeter manufacturer;advanced computer techniques;chinese;fluid mechanics;flow measurement;electronics application;signal processing;romans"}
{"name": "train_807", "title": "Integrated optical metrology controls post etch CDs", "abstract": "Control of the transistor gate critical dimension (CD) on the order of a few nanometers is a top priority in many advanced IC fabs. Each nanometer deviation from the target gate length translates directly into the operational speed of these devices. However, using in-line process control by linking the lithography and etch tools can improve CD performance beyond what each individual tool can achieve. The integration of optical CD metrology tools to etch mainframes can result in excellent etcher stability and better control of post-etch CDs", "fulltext": "", "keywords": "operational speed;etcher stability;in-line process control;etch mainframes;optical cd metrology tools;cd performance;post etch cd control;target gate length;integrated optical metrology;lithography tools;transistor gate critical dimension;ic fabs;photolithography"}
{"name": "train_808", "title": "A novel control logic for fast valving operations", "abstract": "This letter proposes new control logic for operating parallel valves in fast valving schemes in order to improve the transient stability performance of power systems. A fast valving scheme using parallel valves overcomes many of the limitations of the conventional scheme. The proposed control logic for operating these valves has been applied to a typical single machine infinite bus system. Single as well as multiple stroke operations for controlling the turbine power output have been studied with the new control sequences. Encouraging results have been shown over the conventional schemes of fast valving", "fulltext": "", "keywords": "multiple stroke operations;single machine infinite bus system;turbine power output control;transient stability performance;control logic;parallel valves operation;single stroke operations;transient stability"}
{"name": "train_809", "title": "Edison's direct current influenced \"Broadway\" show lighting", "abstract": "During the early decades of the 20 th century, midtown Manhattan in New York City developed an extensive underground direct current (DC) power distribution system. This was a result of the original introduction of direct current by Thomas Edison's pioneering Pearl Street Station in 1882. The availability of DC power in the theater district, led to the perpetuation of an archaic form of stage lighting control through nearly three-quarters of the 20 th century. This control device was known as a \"resistance dimmer.\" It was essentially a series-connected rheostat, but it was wound with a special resistance \"taper\" so as to provide a uniform change in the apparent light output of typical incandescent lamps throughout the travel of its manually operated arm. The development and use of DC powered stage lighting is discussed in this article", "fulltext": "", "keywords": "series-connected rheostat;manhattan;dc powered stage lighting;resistance dimmer;theater district;apparent light output;broadway show lighting;thomas edison's pearl street station;new york city;stage lighting control;incandescent lamps;underground direct current power distribution system;resistance taper"}
{"name": "train_81", "title": "A scalable and efficient systolic algorithm for the longest common subsequence", "abstract": "problem A longest common subsequence (LCS) of two strings is a common subsequence of two strings of maximal length. The LCS problem is that of finding an LCS of two given strings and the length of the LCS. This problem has been the subject of much research because its solution can be applied in many areas. In this paper, a scalable and efficient systolic algorithm is presented. For two given strings of length m and n, where m>or=n, the algorithm can solve the LCS problem in m+2r-1 (respectively n+2r-1) time steps with r<n/2 (respectively r<m/2) processors. Experimental results show that the algorithm can be faster on multicomputers than all the previous systolic algorithms for the same problem", "fulltext": "", "keywords": "longest common subsequence problem;parallel algorithms;scalable algorithm;systolic algorithm"}
{"name": "train_810", "title": "Oracle's Suite grows up", "abstract": "Once a low-cost Web offering, Oracle's Small Business Suite now carries a price tag to justify VAR interest", "fulltext": "", "keywords": "resellers;netledger;accounting;oracle small business suite"}
{"name": "train_811", "title": "Integration, the Web are key this season [tax]", "abstract": "Integration and the Web are driving many of the enhancements planned by tax preparation software vendors for this coming season", "fulltext": "", "keywords": "accounting packages;software integration;internet;tax packages;gosystem tax rs;netconnection;cch;people's choice;intuit;taxworks;drake;ria;petz;taxsimple;visual tax;atx;cpasoftware"}
{"name": "train_812", "title": "eLeaders make the Web work", "abstract": "Some companies are making the most of back-office/Web integration. Here are some winners", "fulltext": "", "keywords": "back-office/web integration;accpac etransact;visual integrator;e-commerce"}
{"name": "train_813", "title": "On generalized Gaussian quadratures for exponentials and their applications", "abstract": "We introduce new families of Gaussian-type quadratures for weighted integrals of exponential functions and consider their applications to integration and interpolation of bandlimited functions. We use a generalization of a representation theorem due to Caratheodory to derive these quadratures. For each positive measure, the quadratures are parameterized by eigenvalues of the Toeplitz matrix constructed from the trigonometric moments of the measure. For a given accuracy epsilon , selecting an eigenvalue close to epsilon yields an approximate quadrature with that accuracy. To compute its weights and nodes, we present a new fast algorithm. These new quadratures can be used to approximate and integrate bandlimited functions, such as prolate spheroidal wave functions, and essentially bandlimited functions, such as Bessel functions. We also develop, for a given precision, an interpolating basis for bandlimited functions on an interval", "fulltext": "", "keywords": "bandlimited functions;toeplitz matrix;approximation;integration;generalized gaussian quadratures;bessel functions;weighted integrals;trigonometric moments;prolate spheroidal wave functions;exponential functions;caratheodory representation theorem;interpolation;eigenvalues"}
{"name": "train_814", "title": "A framework for image deblurring using wavelet packet bases", "abstract": "We show that the average over translations of an operator diagonal in a wavelet packet basis is a convolution. We also show that an operator diagonal in a wavelet packet basis can be decomposed into several operators of the same kind, each of them being better conditioned. We investigate the possibility of using such a convolution to approximate a given convolution (in practice an image blur). Then we use these approximations to deblur images. First, we show that this framework permits us to redefine existing deblurring methods. Then, we show that it permits us to define a new variational method which combines the wavelet packet and the total variation approaches. We argue and show by experiments that this permits us to avoid the drawbacks of both approaches which are, respectively, ringing and staircasing", "fulltext": "", "keywords": "staircasing;operator diagonal;deconvolution;ringing;convolution;total variation approach;wavelet packet bases;image deblurring"}
{"name": "train_815", "title": "The canonical dual frame of a wavelet frame", "abstract": "We show that there exist wavelet frames that have nice dual wavelet frames, but for which the canonical dual frame does not consist of wavelets, i.e., cannot be generated by the translates and dilates of a single function", "fulltext": "", "keywords": "gabor frames;compact support;canonical dual frame;wavelet frame;multiresolution hierarchy"}
{"name": "train_816", "title": "Accelerating filtering techniques for numeric CSPs", "abstract": "Search algorithms for solving Numeric CSPs (Constraint Satisfaction Problems) make an extensive use of filtering techniques. In this paper we show how those filtering techniques can be accelerated by discovering and exploiting some regularities during the filtering process. Two kinds of regularities are discussed, cyclic phenomena in the propagation queue and numeric regularities of the domains of the variables. We also present in this paper an attempt to unify numeric CSPs solving methods from two distinct communities, that of CSP in artificial intelligence, and that of interval analysis", "fulltext": "", "keywords": "numeric csps;csps-solving;extrapolation methods;propagation;interval analysis;artificial intelligence;filtering techniques;search algorithms;constraint satisfaction problems;pruning"}
{"name": "train_817", "title": "Summarization beyond sentence extraction: A probabilistic approach to sentence", "abstract": "compression When humans produce summaries of documents, they do not simply extract sentences and concatenate them. Rather, they create new sentences that are grammatical, that cohere with one another, and that capture the most salient pieces of information in the original document. Given that large collections of text/abstract pairs are available online, it is now possible to envision algorithms that are trained to mimic this process. In this paper, we focus on sentence compression, a simpler version of this larger challenge. We aim to achieve two goals simultaneously: our compressions should be grammatical, and they should retain the most important pieces of information. These two goals can conflict. We devise both a noisy-channel and a decision-tree approach to the problem, and we evaluate results against manual compressions and a simple baseline", "fulltext": "", "keywords": "sentence compression;grammatical;document summarization;noisy-channel;decision-tree"}
{"name": "train_818", "title": "Clausal resolution in a logic of rational agency", "abstract": "A resolution based proof system for a Temporal Logic of Possible Belief is presented. This logic is the combination of the branching-time temporal logic CTL (representing change over time) with the modal logic KD45 (representing belief). Such combinations of temporal or dynamic logics and modal logics are useful for specifying complex properties of multi-agent systems. Proof methods are important for developing verification techniques for these complex multi-modal logics. Soundness, completeness and termination of the proof method are shown and simple examples illustrating its use are given", "fulltext": "", "keywords": "dynamic logics;kd45;modal logic;branching-time temporal logic;multi-agent systems;resolution based proof system;belief;rational agents;multi-modal logics;temporal logic;ctl"}
{"name": "train_819", "title": "Local search with constraint propagation and conflict-based heuristics", "abstract": "Search algorithms for solving CSP (Constraint Satisfaction Problems) usually fall into one of two main families: local search algorithms and systematic algorithms. Both families have their advantages. Designing hybrid approaches seems promising since those advantages may be combined into a single approach. In this paper, we present a new hybrid technique. It performs a local search over partial assignments instead of complete assignments, and uses filtering techniques and conflict-based techniques to efficiently guide the search. This new technique benefits from both classical approaches: a priori pruning of the search space from filtering-based search and possible repair of early mistakes from local search. We focus on a specific version of this technique: tabu decision-repair. Experiments done on open-shop scheduling problems show that our approach competes well with the best highly specialized algorithms", "fulltext": "", "keywords": "csp;filtering techniques;search algorithms;local search algorithms;constraint satisfaction problems;partial assignments;tabu decision-repair;systematic algorithms"}
{"name": "train_82", "title": "Bit-serial AB/sup 2/ multiplier using modified inner product", "abstract": "This paper presents a new multiplication algorithm and, based on this algorithm, proposes a hardware architecture, called modified inner-product multiplier (MIPM), which computes AB/sup 2/ multiplication based on a linear feedback shift register (LFSR). The algorithm is based on the property of the irreducible all one polynomial (AOP) over the finite field GF(2/sup m/). The proposed architecture reduces the time and space complexity for computing AB/sup 2/. The proposed architecture has a potential application to implementing exponentiation architecture for a public-key cryptosystem", "fulltext": "", "keywords": "modified inner-product multiplier;bit-serial ab/sup 2/ multiplier;space complexity;multiplication algorithm;modified inner product;public-key cryptosystem;time complexity;irreducible all one polynomial;linear feedback shift register;hardware architecture"}
{"name": "train_820", "title": "Yet some more complexity results for default logic", "abstract": "We identify several new tractable subsets and several new intractable simple cases for reasoning in the propositional version of Reiter's default logic. The majority of our findings are related to brave reasoning. By making some intuitive observations, most classes that we identify can be derived quite easily from some subsets of default logic already known in the literature. Some of the subsets we discuss are subclasses of the so-called \"extended logic programs\". All the tractable subsets presented in this paper can be recognized in linear time", "fulltext": "", "keywords": "complexity results;tractable subsets;extended logic programs;default logic;reasoning;complexity classes;nonmonotonic reasoning"}
{"name": "train_821", "title": "Digital rights (and wrongs)", "abstract": "Attempting to grasp the many conflicts and proposed safeguards for intellectual property is extremely difficult. Legal, political, economic, and cultural issues-both domestic and international-loom large, almost dwarfing the daunting technological challenges. Solutions devised by courts and legislatures and regulatory agencies are always late out of the blocks and fall ever farther behind. Recently proposed legislation only illustrates the depth and complexity of the problem", "fulltext": "", "keywords": "legal issues;economic issues;political issues;intellectual property;cultural issues"}
{"name": "train_822", "title": "Reinventing broadband", "abstract": "Many believe that broadband providers need to change their whole approach. The future, then, is in reinventing broadband. That means tiered pricing to make broadband more competitive with dial-up access and livelier, more distinct content: video on demand, MP3, and other features exclusive to the fat-pipe superhighway", "fulltext": "", "keywords": "tiered pricing;broadband;video on demand;mp3;business plans"}
{"name": "train_823", "title": "Estimation of thermal coefficients of magneto-optical media", "abstract": "Previously we described a method for estimating the thermal conductivity of magneto-optic recording media. The method relies on identifying the laser power that brings the maximum temperature of the TbFeCo layer to as high as the Curie temperature. We extensively use a similar method to estimate the heat capacity of a dielectric layer, a TbFeCo layer, and an aluminum alloy layer of magneto-optic recording media. Measurements are conducted on static disks with a beam of light focused on a TbFeCo layer. The method has the advantage of thermal diffusion depending on a multilayer structure and irradiation time", "fulltext": "", "keywords": "curie temperature;maximum temperature;laser power;multilayer structure;light focusing;magneto-optic recording media;thermal conductivity;thermal diffusion;tbfeco layer;aluminum alloy layer;static disks;magneto-optical media;dielectric layer;thermal coefficients;tbfeco;irradiation time;heat capacity"}
{"name": "train_824", "title": "The Internet, knowledge and the academy", "abstract": "As knowledge is released from the bounds of libraries, as research becomes no longer confined to the academy, and education/certification is available, any time/any place, the university and the faculty must redefine themselves. Liberal studies, once the core, and currently eschewed in favor of science and technology, will be reborn in those institutions that can rise above the mundane and embrace an emerging \"third culture\"", "fulltext": "", "keywords": "academy;faculty;internet;university;certification;knowledge;liberal studies;education"}
{"name": "train_825", "title": "Genetic algorithm-neural network estimation of Cobb angle from torso asymmetry", "abstract": "in scoliosis Scoliosis severity, measured by the Cobb angle, was estimated by artificial neural network from indices of torso surface asymmetry using a genetic algorithm to select the optimal set of input torso indices. Estimates of the Cobb angle were accurate within 5 degrees in two-thirds, and within 10 degrees in six-sevenths, of a test set of 115 scans of 48 scoliosis patients, showing promise for future longitudinal studies to detect scoliosis progression without use of X-rays", "fulltext": "", "keywords": "scoliosis patients;scoliosis progression;input torso indices;genetic algorithm;torso surface asymmetry;artificial neural network;cobb angle"}
{"name": "train_826", "title": "A round of cash, a pound of flesh [telecom]", "abstract": "Despite the upheaval across telecom, venture capital firms are still investing in start-ups. But while a promising idea and a catchy name were enough to guarantee millions in funding at the peak of the dotcom frenzy, now start-ups must prove-their long-term viability, and be willing to concede control of their business to their VC suitors", "fulltext": "", "keywords": "venture capital firms;telecom;viability"}
{"name": "train_827", "title": "Williams nears end of Chapter 11 [telecom]", "abstract": "Leucadia National Corp. comes through with a $330 million boost for Williams Communications, which should keep the carrier afloat through the remainder of its bankruptcy", "fulltext": "", "keywords": "bankruptcy;leucadia national corp;williams communications"}
{"name": "train_828", "title": "Verizon leapfrogs Sprint PCS with Q2 subscriber numbers", "abstract": "The wireless carrier industry's second-quarter results showed a surprising shift in market share as Sprint PCS fell from grace after a nearly four-year lead in subscriber additions and Verizon Wireless added considerably more customers than analysts expected", "fulltext": "", "keywords": "sprint pcs;verizon wireless;wireless carrier industry"}
{"name": "train_829", "title": "Santera targets independents in major strategy overhaul [telecom]", "abstract": "With big carriers slashing capital expense budgets, Santera Systems is broadening the reach of its next-generation switching platform to include independent telcos. This week, the vendor will announce that it has signed a deal with Kerman, Calif-based Kerman Telephone Co. Furthermore, the company is angling for inclusion in the Rural Utilities Service's approved equipment list, hoping to sell its Class 5 replacement boxes to the smallest carriers. The move is almost a complete reversal for the Plano, Texas-based vendor, which previously focused solely on large carriers, including the RBOCs", "fulltext": "", "keywords": "switching;rural utilities service;santera systems;kerman telephone"}
{"name": "train_83", "title": "A distributed mobile agent framework for maintaining persistent distance", "abstract": "education Mobile agent techniques involve distributed control if communication is required among different types of agents, especially when mobile agents can migrate from station to station. This technique can be implemented in a distributed distance learning environment, which allows students or instructors to login from anywhere to a central server in an education center while still retaining the look-and-feel of personal setups. In this research paper, we propose a distributed agent framework along with its communication messages to facilitate mobile personal agents, which serve three different groups of distance education users: instructors, students, and system administrators. We propose an agent communication framework as well as agent evolution states of mobile agents. The communication architecture and message transmission protocols are illustrated. The system is implemented on the Windows platform to support nomadic accessibility of remote distance learning users. Personal data also migrate with the mobile agents, allowing users to maintain accessibility to some extent even when the Internet connection is temperately disconnected. Using user-friendly personal agents, a distance education platform can include different tools to meet different needs for users", "fulltext": "", "keywords": "central server;message transmission protocols;persistent distance education;distributed agent framework;distributed control;user-friendly personal agents;distributed mobile agent framework"}
{"name": "train_830", "title": "The real story behind Calpoint [telecom]", "abstract": "A former Qwest executive sheds light on the carrier's controversial deal with Calpoint. Discusses why Calpoint gets a monthly check from Quest, regardless of whether it provides services", "fulltext": "", "keywords": "telecom carrier;qwest;calpoint"}
{"name": "train_831", "title": "Software vendors' failure fuels consolidation theories [telecom interconnection", "abstract": "and billing] As independent software vendors like AP Engines fall by the wayside as independent entities, attrition could accelerate consolidation in the OSS space", "fulltext": "", "keywords": "operations supports systems;telecom billing;consolidation;telecom interconnection;quintessent;ap engines"}
{"name": "train_832", "title": "Senate to Powell: regulate more [FCC]", "abstract": "FCC Chairman Michael Powell pitched a six-step market-based recovery plan to the Senate last week, but two members of the Commerce Committee told him telecom's revival requires more reliance on regulation", "fulltext": "", "keywords": "telecom industry;recovery plan;fcc;us senate commerce committee"}
{"name": "train_833", "title": "Packet promises past & present [IP switching]", "abstract": "With the death of the competitive carrier market and the significant slashing of RBOC capex budgets, softswitch vendors have been forced to retrench. Now instead of focusing primarily on limited Internet off-load applications, packet-based softswitches are set to gel around real user needs for services such as voice over IP and IP Centrex", "fulltext": "", "keywords": "voice over ip;softswitch vendors;ip centrex"}
{"name": "train_834", "title": "Commerce Department plan eases 3G spectrum crunch", "abstract": "The federal government made its first move last week toward cleaning up a spectrum allocation system that was in shambles just a year ago and had some, spectrum-starved wireless carriers fearing they wouldn't be able to compete in third-generation services. The move, however, is far from complete and leaves numerous details unsettled", "fulltext": "", "keywords": "spectrum allocation system;federal government;wireless carriers;3g spectrum"}
{"name": "train_835", "title": "Pioneering women in computer science", "abstract": "Although their contributions are not well documented, women have played an important role in the development of computer science. A survey of women pioneers demonstrates their influence in designing and programming the first electronic computers and languages, while laying the groundwork for women's expanding involvement in science", "fulltext": "", "keywords": "pioneering women;electronic computers;programming languages;computer science development;history"}
{"name": "train_836", "title": "Recruitment and retention of women graduate students in computer science and", "abstract": "engineering: results of a workshop organized by the Computing Research Association This document is the report of a workshop that convened a group of experts to discuss the recruitment and retention of women in computer science and engineering (CSE) graduate programs. Participants included long-time members of the CSE academic and research communities, social scientists engaged in relevant research, and directors of successful retention efforts. The report is a compendium of the experience and expertise of workshop participants, rather than the result of a full-scale, scholarly study into the range of issues. Its goal is to provide departments with practical advice on recruitment and retention in the form of a set of specific recommendations", "fulltext": "", "keywords": "social scientists;academic communities;engineering;research communities;computer science;directors;recruitment;retention;computing research association;workshop participants;women graduate students"}
{"name": "train_837", "title": "Ten suggestions for a gender-equitable CS classroom", "abstract": "Though considerable attention has been paid to the creation of a nurturing environment for women in the field of computer science, proposed solutions have primarily focused on activities outside of the classroom. This paper presents a list of suggestions for modifications to both the pedagogy and content of CS courses designed to make the CS classroom environment more inviting for women students", "fulltext": "", "keywords": "nurturing environment;cs classroom environment;gender-equitable classroom;women students;computer science;pedagogy;cs course content"}
{"name": "train_838", "title": "Pool halls, chips, and war games: women in the culture of computing", "abstract": "Computers are becoming ubiquitous in our society and they offer superb opportunities for people in jobs and everyday life. But there is a noticeable sex difference in use of computers among children. This article asks why computers are more attractive to boys than to girls and offers a cultural framework for explaining the apparent sex differences. Although the data are fragmentary, the world of computing seems to be more consistent with male adolescent culture than with feminine values and goals. Furthermore, both arcade and educational software is designed with boys in mind. These observations lead us to speculate that computing is neither inherently difficult nor uninteresting to girls, but rather that computer games and other software might have to be designed differently for girls. Programs to help teachers instill computer efficacy in all children also need to be developed", "fulltext": "", "keywords": "women;computer games;culture of computing;male adolescent culture;teachers;sex difference;educational software;children"}
{"name": "train_839", "title": "Women in computing: what brings them to it, what keeps them in it?", "abstract": "Career stereotyping and misperceptions about the nature of computing are substantive reasons for the under representation of women in professional computing careers. In this study, 15 women who have work experience in several aspects of computing were asked about their reasons for entering computing, what they liked about working in computing, and what they disliked. While there are many common threads, there are also individual differences. Common reasons for choosing computing as a career included: exposure to computing in a setting which enabled them to see the versatility of computers; the influence of someone close to them; personal abilities which they perceived to be appropriate for a career in computing; and characteristics of such careers which appealed to them. Generally, women working in the field enjoy the work they are doing. Dislikes arising from their work experiences are more likely to be associated with people and politics than with the work they do-and they would like to have more female colleagues", "fulltext": "", "keywords": "women;personal abilities;politics;career stereotyping;professional computing careers;misperceptions"}
{"name": "train_84", "title": "Efficient cellular automata based versatile multiplier for GF(2/sup m/)", "abstract": "In this paper, a low-complexity programmable cellular automata (PCA) based versatile modular multiplier in GF(2/sup m/) is presented. The proposed versatile multiplier increases flexibility by using the same multiplier in different security environments, and it reduces the user's cost. Moreover, the multiplier can be easily extended to high order of m for more security, and low-cost serial implementation is feasible in restricted computing environments, such as smart cards and wireless devices", "fulltext": "", "keywords": "cellular automata based versatile multiplier;smart cards;security environments;low-complexity programmable cellular automata;wireless devices;restricted computing environments"}
{"name": "train_840", "title": "Gender benders [women in computing profession]", "abstract": "As a minority in the upper levels of the computing profession, women are sometimes mistreated through ignorance or malice. Some women have learned to respond with wit and panache", "fulltext": "", "keywords": "women;computing profession"}
{"name": "train_841", "title": "Becoming a computer scientist", "abstract": "The focus of this report is pipeline shrinkage for women in computer science. We describe the situation for women at all stages of training in computer science, from the precollege level through graduate school. Because many of the problems discussed are related to the lack of role models for women who are in the process of becoming computer scientists, we also concern ourselves with the status of women faculty members. We not only describe the problems, but also make specific recommendations for change and encourage further study of those problems whose solutions are not yet well understood", "fulltext": "", "keywords": "women;pipeline shrinkage;women faculty members;computer science;role models"}
{"name": "train_842", "title": "The incredible shrinking pipeline", "abstract": "We look at the harsh facts concerning the percentage of degrees awarded in CS to women. We study the trend of degrees awarded in CS since 1980, and compare the trend in CS to other science and engineering disciplines. We consider the relationship between the percentage of degrees awarded to women by a CS department and the college the CS department is within. We find that CS departments in engineering colleges graduate, on average, proportionately fewer women than CS departments in non-engineering colleges. We request that the community respond to the facts and speculations presented in this article", "fulltext": "", "keywords": "women;science;engineering;pipeline shrinkage problem;computer science degrees"}
{"name": "train_843", "title": "An ACM-W literature review on women in computing", "abstract": "The pipeline shrinkage problem for women in computer science is a well-known and documented phenomenon where the ratio of women to men involved in computing shrinks dramatically from early student years to working years. During the last decade, considerable research ensued to understand the reasons behind the existence of the shrinking pipeline and in some cases to take action to increase the numbers of women in computing. Through the work of a National Science Foundation funded project, ACM's Committee on Women in Computing (ACM-W) has taken a first step towards pulling this research together. A large number of articles was gathered and processed on the topic of women in computing and the shrinking pipeline. The committee created a publicly available online database to organize the references of this body of work by topic, author, and reference information. The database, constantly being updated, is accessible through ACM-W's website <http://www.acm.org/women>. A final report is also available via the ACM-W Web site which covers current statistics on women in computing, summaries of the literature in the database, and a set of recommendations. The article is a brief synopsis of a subset of the literature review as of August 2001", "fulltext": "", "keywords": "acm-w literature review;pipeline shrinkage problem;acm committee on women in computing"}
{"name": "train_844", "title": "Women in computing history", "abstract": "Exciting inventions, innovative technology, human interaction, and intriguing politics fill computing history. However, the recorded history is mainly composed of male achievements and involvements, even though women have played substantial roles. This situation is not unusual. Most science fields are notorious for excluding, undervaluing, or overlooking the accomplishments of their female scientists. As Lee points out, it is up to the historians and others to remedy this imbalance. Steps have been taken towards this goal through publishing biographies on women in technology, and through honoring the pioneers with various awards such as the GHC'97 Pioneering Awards, the WITI Hall of Fame, and the AWC Lovelace Award. A few online sites contain biographies of women in technology. However, even with these resources, many women who have contributed significantly to computer science are still to be discovered", "fulltext": "", "keywords": "women;computing history"}
{"name": "train_845", "title": "Gender, software design, and occupational equity", "abstract": "After reviewing the work on gender bias in software design, a model of gender-role influenced achievement choice taken from Eccles (1994) is presented. The paper concludes that (1) though laudable, reduction of gender bias in software design is not the most straightforward way to reduce gender inequity in the choice of computing as a career, (2) the model itself makes more clear some of the ethical issues involved in attempting to achieve gender equity on computing, and (3) efforts to reduce gender inequity in the choice of computing as a career need to be evaluated in the light of this model", "fulltext": "", "keywords": "gender bias;software design;gender-role influenced achievement choice model;occupational equity;ethical issues;computing career"}
{"name": "train_846", "title": "Female computer science doctorates: what does the survey of earned doctorates", "abstract": "reveal? Based on the National Center for Education Statistics (2000), in the 1997-1998 academic year 26.7% of earned bachelors' degrees, 29.0% of earned masters' degrees and 16.3% of earned doctorates' degrees in computer science were awarded to women. As these percentages suggest, women are underrepresented at all academic levels in computer science (Camp, 1997). The most severe shortage occurs at the top level-the doctorate in computer science. We know very little about the women who persist to the top level of academic achievement in computer science. This paper examines a subset of data collected through the Survey of Earned Doctorates (SED). The specific focus of this paper is to identify trends that have emerged from the SED with respect to females completing doctorates in computer science between the academic years 1990-1991 and 1999-2000. Although computer science doctorates include doctorates in information science, prior research (Camp, 1997) suggests that the percentage of women completing doctorates in information science as compared to computer science is low. The specific research questions are: 1. How does the percentage of women who complete doctorates in computer science compare to those that complete doctorates in other fields? 2. How does the length of time in school and the sources of funding differ for females as compared to males who complete doctorates in computer science? 3. Where do women go after completing doctorates in computer science and what positions do they acquire? How do these experiences differ from their male peers?", "fulltext": "", "keywords": "survey of earned doctorates;female computer science doctorates;information science"}
{"name": "train_847", "title": "A gendered view of computer professionals: preliminary results of a survey", "abstract": "The under-representation of women in the computing profession in many parts the western world has received our attention through numerous publications, the noticeable low representation of women at computer science conferences and in the lecture halls. Over the past two decades, the situation had become worse. This paper seeks to add to the dialogue by presenting preliminary findings from a research project conducted in four countries. The aim of this research was to gain an insight into the perceptions future computer professionals hold on the category of employment loosely defined under the term of \"a computer professional.\" One goal was to get insight into whether or not there is a difference between female and mate students regarding their view of computer professionals. Other goals were to determine if there was any difference between female and male students in different parts of the world, as well as who or what most influences the students to undertake their courses in computing", "fulltext": "", "keywords": "computing profession;employment;female students;women under-representation;computing courses;mate students;future computer professional perceptions"}
{"name": "train_848", "title": "Women in computing around the world", "abstract": "This paper describes the participation of women in computing in more than 30 countries, by focussing on participation at undergraduate level. A brief discussion covers how societal and cultural factors may affect women's participation. Statistics from many different sources are presented for comparison. Generally, participation is low - most countries fall in the 10-40% range with a few below 10% and a few above 40%", "fulltext": "", "keywords": "women;societal factors;undergraduate computing;statistics;cultural factors"}
{"name": "train_849", "title": "Ten years of strategies to increase participation of women in computing", "abstract": "programs. The Central Queensland University experience: 1999-2001 In the late eighties, the participation rate of women in information technology courses in most Australian Universities was around 25%. This low level of women's participation in computing courses occurs not only in Australia but also overseas. More studies indicate that the participation rates have not improved and in fact may be even further in decline. Participation rates in the workforce also appear to be in decline. Concerned at the imbalance within Australia, the Federal government directed all Australian Universities to increase the number of women in courses leading to a professional computing qualification (i.e., information technology courses) to 40% of students by 1995. This paper details one Australian university's approach, over a 10 year period (1991-2001), to redress this imbalance. We provide examples of intervention strategies developed and the outcomes for these strategies. We present the outcomes against a background frame of the Australian Higher Education scene of that decade which was influenced by funding levels to universities in general and to equity programs in particular. We present data related to the participation of women in computing programs along with snapshots of the overall changing student demographics over this period", "fulltext": "", "keywords": "demographics;women;central queensland university;computing programs;australian higher education"}
{"name": "train_85", "title": "Strategic implementation of IT/IS projects in construction: a case study", "abstract": "The need for improved implementation of Information Technology (IT) and Information Systems (IS) has been emphasised in both empirical and prescriptive research studies. This problem is magnified in the construction industry, which has been slow to embrace and utilise new technologies with negative consequences on productivity and innovation. This paper presents a strategic implementation framework for IT/IS projects in construction. The framework builds upon recent published works and encompasses well-documented predictors for effective IT/IS implementation. A case study with a large multi-national construction organisation is used to demonstrate the strategic implementation of a Project Management Information System (PMIS) used for the construction of a mobile phone telecommunications network in the South East of Queensland, Australia", "fulltext": "", "keywords": "swot analysis;information technology;construction industry;analytical hierarchy process;project management information system;strategic implementation;mobile phone telecommunications network;large multi-national construction organisation;predictors;strategic implementation framework;information systems"}
{"name": "train_850", "title": "Encouraging women in computer science", "abstract": "At a cost to both their own opportunities and society's ability to produce people with much-needed technical skills, women continue to be underrepresented in computer science degree programs at both the undergraduate and graduate level. Although some of the barriers that women face have their foundations in cultural expectations established well before the college level, we believe that departments can take effective steps to increase recruitment and retention of women students. This paper describes several strategies we have adopted at Stanford over the past decade", "fulltext": "", "keywords": "graduate level;women student retention;technical skills;women student recruitment;undergraduate level;computer science degree programs;cultural expectations"}
{"name": "train_851", "title": "Unlocking the clubhouse: the Carnegie Mellon experience", "abstract": "In the fall of 1995, just seven of 95 students entering the undergraduate program in computer science at Carnegie Mellon University were women. In 2000, 54 of 130, or 42%, were women. What happened? This article presents a brief history of the transformation at Carnegie Mellon's School of Computer Science, and the research project that lay behind it", "fulltext": "", "keywords": "women;research project;carnegie mellon university;gender issues;history;undergraduate program;students;computer science education"}
{"name": "train_852", "title": "Building an effective computer science student organization: the Carnegie", "abstract": "Mellon Women@SCS action plan This paper aims to provide a practical guide for building a student organization and designing activities and events that can encourage and support a community of women in computer science. This guide is based on our experience in building Women@SCS, a community of women in the School of Computer Science (SCS) at Carnegie Mellon University. Rather than provide an abstract \"to-do\" or \"must-do\" list, we present a sampling of concrete activities and events in the hope that these might suggest possibilities for a likeminded student organization. However, since we have found it essential to have a core group of activist students at the helm, we provide a \"to-do\" list of features that we feel are essential for forming, supporting and sustaining creative and effective student leadership", "fulltext": "", "keywords": "women;carnegie mellon university;gender issues;computer science student organization;women@scs action plan;student leadership;computer science education"}
{"name": "train_853", "title": "Virtual Development Center", "abstract": "The Virtual Development Center of the Institute for Women and Technology seeks to significantly enhance the impact of women on technology. It addresses this goal by increasing the number of women who have input on created technology, enhancing the ways people teach and develop technology, and developing need-based technology that serves the community. Through activities of the Virtual Development Center, a pattern is emerging regarding how computing technologies do or do not satisfy the needs of community groups, particularly those communities serving women. This paper describes the Virtual Development Center program and offers observations on the impact of computing technology on non-technical communities", "fulltext": "", "keywords": "women;information technology;gender issues;community groups;virtual development center;computer science education;teaching"}
{"name": "train_854", "title": "A conference's impact on undergraduate female students", "abstract": "In September of 2000, the 3rd Grace Hopper Celebration of Women in Computing was held in Cape Cod, Massachusetts. Along with a colleague from a nearby university, we accompanied seven of our female undergraduate students to this conference. This paper reports on how the conference experience immediately affected these students - what impressed them, what scared them, what it clarified for them. It also reports on how the context in which these students currently evaluate their ability, potential and opportunity in computer science is different now from what it was before the conference. Hopefully, by understanding their experience, we can gain some insight into things we can do for all of our undergraduate female students to better support their computer science and engineering education", "fulltext": "", "keywords": "undergraduate female students;conference;gender issues;computer science education;engineering education"}
{"name": "train_855", "title": "Support communities for women in computing", "abstract": "This article highlights the many activities provided by the support communities available for women in computing. Thousands of women actively participate in these programs and they receive many benefits including networking and professional support. In addition, the organizations and associations help promote the accomplishments of women computer scientists and disseminate valuable information. This article surveys some of these organizations and concludes with a list of suggestions for how faculty members can incorporate the benefits of these organizations in their own institutions", "fulltext": "", "keywords": "women;support communities;professional support;faculty members;networking;computing;information dissemination"}
{"name": "train_856", "title": "People who make a difference: mentors and role models", "abstract": "The literature of gender issues in computing steadfastly and uniformly has advocated the use of mentors and role models (M&RM) for recruiting and retaining women in computer science. This paper, therefore, accepts the results of research studies and avoids reiterating details of the projects but offers instead a practical guide for using M&RM to recruit and retain women in computer science. The guide provides pragmatic advice, describing several different facets of the M&RM concept", "fulltext": "", "keywords": "women retention;women recruitment;gender issues;computer science;computing;role models;mentors"}
{"name": "train_857", "title": "Leveraging an alternative source of computer scientists: reentry programs", "abstract": "Much has been written about the leaky pipeline of women in computer science (CS), with the percentage of women decreasing as one moves from lower levels, such as college, to higher levels, culminating in full professorship. While significant attention focused on keeping women from leaving the pipeline, there is also an opportunity to bring women into the pipeline through non-traditional programs, instead of requiring that everyone enter at the undergraduate level. Both Mills College, a small liberal arts institution for women, and UC Berkeley, a large research university, established programs in the 80's to increase the number of women in computer science by tapping non-traditional students. Both programs share the core value of accommodating older students lacking technical backgrounds. The two programs have produced similar results: graduate degrees earned in computer science by students who would not have qualified without these programs, professional employment in the computer science field by women and minorities, and a recognition that this population represents a rich source of talent for our nation", "fulltext": "", "keywords": "minorities;women;reentry programs;uc berkeley;professional employment;computer science;graduate degrees;students;mills college"}
{"name": "train_858", "title": "Recruiting and retaining women in undergraduate computing majors", "abstract": "This paper recommends methods for increasing female participation in undergraduate computer science. The recommendations are based on recent and on-going research into the gender gap in computer science and related disciplines. They are intended to work in tandem with the Computing Research Association's recommendations for graduate programs to promote a general increase in women's participation in computing professions. Most of the suggestions offered could improve the educational environment for both male and female students. However, general improvements are likely to be of particular benefit to women because women in our society do not generally receive the same level of support that men receive for entering and persisting in this field", "fulltext": "", "keywords": "women recruitment;computer science;female participation;undergraduate computing majors;women retention;gender gap"}
{"name": "train_859", "title": "Developing a hardware and programming curriculum for middle school girls", "abstract": "Techbridge provides experiences and resources that would teach girls technology skills as well as excite their curiosity and build their confidence. Funded by the National Science Foundation and sponsored by Chabot Space and Science Center in Oakland, California, Techbridge is a three-year program that serves approximately 200 girls annually. Techbridge is hosted at 8 middle and high schools in Oakland and at the California School for the Blind in Fremont, California generally as an after-school program meeting once a week. Techbridge comes at a critical time in girls' development when girls have many important decisions to make regarding classes and careers, but often lack the confidence and guidance to make the best choices. Techbridge helps girls plan for the next steps to high school and college with its role models and guidance. Techbridge also provides training and resources for teachers, counselors, and families", "fulltext": "", "keywords": "hardware and programming curriculum;techbridge;technology skills teaching;middle school girls"}
{"name": "train_86", "title": "Laser-based internal profile measurement system", "abstract": "An automatic laser-based system to measure the internal profiles of various structures has been developed. The system uses a point laser source through a rotating optical device fixed on to a laser measurement meter. A notebook computer with custom software is used to control the laser meter and rotating device to estimate the scanned profile shape and to determine the resulting cross-section area. The information provided by this system is essential to construction industry, including window and door builders; the glass, panel, board, and floor tile manufacturers; carpet venders; and building contractors for cost estimation and production control. As a result, the lead time for delivering the customized windowpanes, woodwork, floor tiles, and ceilings can be reduced. Applications of this system for measuring the shapes of window frames and floor plans are described and demonstrated. The measurement accuracy is evaluated and analyzed. Results have indicated that the measurement accuracy can be achieved within 4% of the measurement distance, for typical window designs and floor patterns required by major window manufacturers. Recommendations to improve the system are also included", "fulltext": "", "keywords": "point laser source;cost estimation;internal profiles;carpet venders;laser meter;laser-based internal profile measurement system;floor tile manufacturers;building contractors;rotating optical device;rotating device;window frames;production control;customized windowpanes"}
{"name": "train_860", "title": "'Virtual Family': an approach to introducing Java programming", "abstract": "This paper introduces and discusses Virtual Family (VF): a gender-neutral game-based software that introduces Java programming. VF provides a completely functioning game that students extend and enhance via programming. We discuss the background and context within which Virtual Family was developed and other available multimedia resources for teaching programming. The paper then goes on to describe Virtual Family's concept and design. Finally, feedback received from Virtual Family teaching workshops is related, as well as preliminary results from using VF in high-school teaching units. Virtual Family is under development in a research lab at the University of British Columbia and is an initiative of Supporting Women in Information Technology (SWIFT). SWIFT is a five-year research action and implementation project to increase the participation of women in information technology", "fulltext": "", "keywords": "virtual family;supporting women in information technology;high-school teaching units;teaching workshops;java programming teaching;gender-neutral game-based software;multimedia resources"}
{"name": "train_861", "title": "The decision procedure for profitability of investment projects using the", "abstract": "internal rate of return of single-period projects The internal rate of return (IRR) criterion is often used to evaluate profitability of investment projects. In this paper, we focus on a single-period project which consists of two types of cash flows; an investment at one period and a return at a succeeding period, and a financing at one period and a repayment at a succeeding period. We decompose the given investment project into a series of the single-period projects. From the viewpoint of the single-period project, we point out the applicability issue of the IRR criterion, namely the IRR criterion cannot be applied in which a project is composed of both investment type and financing type. Investigating the properties of a series of the single-period projects, we resolve the applicability issue of the IRR criterion and propose the decision procedure for profitability judgment toward any type of investment project based on the comparison between the IRR and the capital cost. We develop a new algorithm to obtain the value of the project investment rate (PIR) for the given project, which is a function of the capital cost, only using the standard IRR computing routine. This outcome is a theoretical breakthrough to widen the utilization of IRR in practical applications", "fulltext": "", "keywords": "decision procedure;project investment rate;irr criterion;investment project profitability;single-period projects;pir;cash flows;profitability;internal rate of return;investment project decomposition"}
{"name": "train_862", "title": "Two efficient algorithms for the generalized maximum balanced flow problem", "abstract": "Minoux (1976) considered the maximum balanced flow problem, i.e. the problem of finding a maximum flow in a two-terminal network N = (V,A) with source s and sink t satisfying the constraint that any arc-flow of N is bounded by a fixed proportion of the total flow value from s to t, where V is vertex set and A is arc set. As a generalization, we focus on the problem of maximizing the total flow value of a generalized flow in N with gains gamma (a) > 0 (a in A) where any arc-flow is bounded by a fixed proportion of the total flow value, where gamma (a)f(a) units arrive at the vertex w for each arc-flow f(a) (a identical to ( upsilon , w) in A) entering vertex upsilon in a generalized flow. Our main results are to propose two polynomial algorithms for this problem. The first algorithm runs in O(mM(n, m, B') log B) time, where B is the maximum absolute value among integral values used by an instance of the problem, and M(n, m, B') denotes the complexity of solving a generalized maximum flow problem in a network with n vertices, and m arcs, and a rational instance expressed with integers between 1 and B'. In the second algorithm, using a parameterized technique, runs in O({M(n, m, B')}/sup 2/) time", "fulltext": "", "keywords": "polynomial algorithms;two-terminal network;generalized maximum balanced flow problem;parameterized technique"}
{"name": "train_863", "title": "A scanline-based algorithm for the 2D free-form bin packing problem", "abstract": "This paper describes a heuristic algorithm for the 2D free-form bin packing (2D-FBP) problem. Given a set of 2D free-form bins and a set of 2D free-form items, the 2D-FBP problem is to lay out items inside one or more bins in such a way that the number of bins used is minimized, and for each bin, the yield is maximized. The proposed algorithm handles the problem as a variant of the 1D problem; i.e., items and bins are approximated as sets of scanlines, and scanlines are packed. The details of the algorithm are given, and its application to a nesting problem in a shipbuilding company is reported. The proposed algorithm consists of the basic and the group placement algorithms. The basic placement algorithm is a variant of the first-fit decreasing algorithm which is simply extended from the 1D case to the 2D case by a novel scanline approximation. A numerical study with real instances shows that the basic placement algorithm has sufficient performance for most of the instances, however, the group placement algorithm is required when items must be aligned in columns. The qualities of the resulting layouts are good enough for practical use, and the processing times are good", "fulltext": "", "keywords": "heuristic algorithm;group placement algorithm;shipbuilding company;2d-fbp problem;irregular packing;scanline-based algorithm;yield maximization;2d free-form bin packing problem;minimization;first-fit decreasing algorithm;irregular cutting;nesting problem"}
{"name": "train_864", "title": "Valuing corporate debt: the effect of cross-holdings of stock and debt", "abstract": "We have developed a simple approach to valuing risky corporate debt when corporations own securities issued by other corporations. We assume that corporate debt can be valued as an option on corporate business asset value, and derive payoff functions when there exist cross-holdings of stock or debt between two firms. Next we show that payoff functions with multiple cross-holdings can be solved by the contraction principle. The payoff functions which we derive provide a number of insights about the risk structure of company cross-holdings. First, the Modigliani-Miller theorem can obtain when there exist cross-holdings between firms. Second, by establishing cross-shareholdings each of stock holders distributes a part of its payoff values to the bond holder of the other's firm, so that both firms can decrease credit risks by cross-shareholdings. In the numerical examples, we show that the correlation in firms can be a critical condition for reducing credit risk by cross-holdings of stock using Monte Carlo simulation. Moreover, we show we can calculate the default spread easily when complicated cross-holdings exist, and find which shares are beneficial or disadvantageous", "fulltext": "", "keywords": "cross-shareholdings;credit risks;risky corporate debt valuation;option;payoff functions;stock holdings;multiple cross-holdings;debt holdings;monte carlo simulation;corporate business asset value;securities;correlation;bond holder;modigliani-miller theorem"}
{"name": "train_865", "title": "Setup cost and lead time reductions on stochastic inventory models with a", "abstract": "service level constraint The stochastic inventory models analyzed in this paper explore the problem of lead time associated with setup cost reductions for the continuous review and periodic review inventory models. For these two models with a mixture of backorders and lost sales, we respectively assume that their mean and variance of the lead time demand and protection interval (i.e., lead time plus review period) demand are known, but their probability distributions are unknown. We develop a minimax distribution free procedure to find the optimal solution-for each case", "fulltext": "", "keywords": "minimax distribution free procedure;lead time demand;lead time reductions;continuous review inventory models;service level constraint;probability distributions;lost sales;backorders;periodic review inventory models;stochastic inventory models;setup cost reductions;protection interval"}
{"name": "train_866", "title": "Adjoint-based optimization of steady suction for disturbance control in", "abstract": "incompressible flows The optimal distribution of steady suction needed to control the growth of single or multiple disturbances in quasi-three-dimensional incompressible boundary layers on a flat plate is investigated. The evolution of disturbances is analysed in the framework of the parabolized stability equations (PSE). A gradient-based optimization procedure is used and the gradients are evaluated using the adjoint of the parabolized stability equations (APSE) and the adjoint of the boundary layer equations (ABLE). The accuracy of the gradient is increased by introducing a stabilization procedure for the PSE. Results show that a suction peak appears in the upstream part of the suction region for optimal control of Tollmien-Schlichting (T-S) waves, steady streamwise streaks in a two-dimensional boundary layer and oblique waves in a quasi-three-dimensional boundary layer subject to an adverse pressure gradient. The mean flow modifications due to suction are shown to have a stabilizing effect similar to that of a favourable pressure gradient. It is also shown that the optimal suction distribution for the disturbance of interest reduces the growth rate of other perturbations. Results for control of a steady cross-flow mode in a three-dimensional boundary layer subject to a favourable pressure gradient show that not even large amounts of suction can completely stabilize the disturbance", "fulltext": "", "keywords": "incompressible flows;adjoint-based optimization;gradient-based optimization procedure;laminar-turbulent transition;tollmien-schlichting waves;parabolized stability equations;stabilization procedure;mean flow;oblique waves;steady cross-flow mode;quasithree-dimensional incompressible boundary layers;steady streamwise streaks;adverse pressure gradient;disturbance control;steady suction;flat plate"}
{"name": "train_867", "title": "Tracking control of the flexible slider-crank mechanism system under impact", "abstract": "The variable structure control (VSC) and the stabilizer design by using the pole placement technique are applied to the tracking control of the flexible slider-crank mechanism under impact. The VSC strategy is employed to track the crank angular position and speed, while the stabilizer design is involved to suppress the flexible vibrations simultaneously. From the theoretical impact consideration, three approaches including the generalized momentum balance (GMB), the continuous force model (CFM), and the CFM associated with the effective mass compensation EMC are adopted, and are derived on the basis of the energy and impulse-momentum conservations. Simulation results are provided to demonstrate the performance of the motor-controller flexible slider-crank mechanism not only accomplishing good tracking trajectory of the crank angle, but also eliminating vibrations of the flexible connecting rod", "fulltext": "", "keywords": "conservation laws;continuous force model;flexible vibrations;generalized momentum balance;tracking trajectory;impact;tracking control;effective mass compensation;crank angular position;pole placement technique;flexible connecting rod;multibody dynamics;variable structure control;stabilizer design;flexible slider-crank mechanism system"}
{"name": "train_868", "title": "Two quantum analogues of Fisher information from a large deviation viewpoint of", "abstract": "quantum estimation We discuss two quantum analogues of the Fisher information, the symmetric logarithmic derivative Fisher information and Kubo-Mori-Bogoljubov Fisher information from a large deviation viewpoint of quantum estimation and prove that the former gives the true bound and the latter gives the bound of consistent superefficient estimators. As another comparison, it is shown that the difference between them is characterized by the change of the order of limits", "fulltext": "", "keywords": "kubo-mori-bogoljubov fisher information;consistent superefficient estimators;symmetric logarithmic derivative fisher information;quantum analogues;quantum estimation;statistical inference;large deviation viewpoint"}
{"name": "train_869", "title": "An exactly solvable random satisfiability problem", "abstract": "We introduce a new model for the generation of random satisfiability problems. It is an extension of the hyper-SAT model of Ricci-Tersenghi, Weigt and Zecchina (2001), which is a variant of the famous K-SAT model: it is extended to q-state variables and relates to a different choice of the statistical ensemble. The model has an exactly solvable statistic: the critical exponents and scaling functions of the SAT/UNSAT transition are calculable at zero temperature, with no need of replicas, also with exact finite-size corrections. We also introduce an exact duality of the model, and show an analogy of thermodynamic properties with the random energy model of disordered spin system theory. Relations with error correcting codes are also discussed", "fulltext": "", "keywords": "statistical ensemble;exact duality;thermodynamic properties;hyper-sat model;q-state variables;error correcting codes;exactly solvable random satisfiability problem;exact finite-size corrections;random energy model;disordered spin system theory"}
{"name": "train_87", "title": "Positional control of pneumatic manipulators for construction tasks", "abstract": "This paper describes solutions that can be applied to pneumatic manipulator problems in positioning, both for angle trajectories and for long linear trajectories, used in construction tasks. Optimal positioning of a pneumatic manipulator along angle trajectories with minimum control energy consumption is given. The implementation of the control system is presented. Control algorithms for a long linear trajectory manipulator based on two-phase and three-phase motion modes of the end-effector are investigated. Conventional and fuzzy logic controls of a pneumatic manipulator were applied and experimental testing was carried out. The obtained results allow widening the application range of pneumatic manipulators in construction, particularly in gantry type machines", "fulltext": "", "keywords": "three-phase motion modes;angle trajectories;gantry type machines;fuzzy logic controls;positioning;construction tasks;positional control;long linear trajectory manipulator;two-phase motion modes;pneumatic manipulators"}
{"name": "train_870", "title": "Speaker identification from voice using neural networks", "abstract": "The paper provides three different schemes for speaker identification of personnel from their voice using artificial neural networks. The first scheme recognizes speakers by employing the classical backpropagation algorithm pre-trained with known voice samples of the persons. The second scheme provides a framework for classifying the known training samples of the voice features using a hierarchical architecture realized with a self-organizing feature map neural net. The first scheme is highly robust as it is capable of identifying the personnel from their noisy voice samples, but because of its excessive training time it has limited applications for a large voice database. The second scheme though not so robust as the former, however, can classify an unknown voice sample to its nearest class. The time needed for classification by the first scheme is always unique irrespective of the voice sample. It is proportional to the number of feedforward layers in the network. The time-requirement of the second classification scheme, however, is not free from the voice features and is proportional to the number of 2D arrays traversed by the algorithm on the hierarchical structure. The third scheme is highly robust and mis-classification is as low as 0.2 per cent. The third scheme combines the composite benefits of a radial basis function neural net and backpropagation trained neural net", "fulltext": "", "keywords": "classification;hierarchical architecture;personnel;radial basis function neural net;self-organizing feature map;known voice samples;pre-training;artificial neural networks;speaker identification;2d arrays;feedforward layers;backpropagation algorithm"}
{"name": "train_871", "title": "Priming the pipeline [women in computer science careers]", "abstract": "In 1997 The Backyard Project, a pilot program of the Garnett Foundation, was instituted to encourage high school girls to explore careers in the computer industry. At that time, the Garnett Foundation commissioned the Global Strategy Group to execute a survey of 652 college-bound high school students (grades 9 through 12), to help discover directions that The Backyard Project might take to try to move toward the mission of the pilot program. It conducted the study by telephone between March 25 and April 8, 1997 in the Silicon Valley, Boston, and Austin metropolitan areas. It conducted all interviews using a random digit dialing methodology, derived from a file of American households with high incidences of adolescent children. The top six answers from girls to the survey question \"why are girls less likely to pursue computer science careers?\" in order of perceived importance by the girls were: not enough role models; women have other interests; didn't know about the industry; limited opportunity; negative media; and too nerdy. These responses are discussed", "fulltext": "", "keywords": "college-bound high school students;computer industry careers;high school girls;the backyard project"}
{"name": "train_872", "title": "Shortchanging the future of information technology: the untapped resource", "abstract": "Building on ideas from a virtual workshop and additional input from the scientific community, the CISE Directorate at the National Science Foundation established the Information Technology Workforce Program (ITWF) in March 2000 to support a broad set of scientific research studies focused on the under-representation of women and minorities in the information technology workforce. In this paper, we explore various approaches that the funded researchers are taking to address the problem of women in information technology. We begin with a brief history of the ITWF, and then focus on some of the research projects in terms of their goals, approaches, and expected outcomes", "fulltext": "", "keywords": "itwf;information technology workforce program;women under-representation;scientific research studies;untapped resources;cise directorate;information technology future;virtual workshop;history;national science foundation"}
{"name": "train_873", "title": "Programmatic efforts encouraging women to enter the information technology", "abstract": "workforce For over a decade the National Science Foundation (NSF) has been supporting projects designed to improve opportunities for women in computing. From an initial emphasis on increasing the number of women in graduate school studying computer science and engineering, NSF's current emphasis has broadened to include research studies examining the underlying reasons why women are underrepresented in the information technology (IT) workforce. This paper describes the recent history of NSF's activities in this area and the subsequent emergence of a research portfolio addressing the underrepresentation issue", "fulltext": "", "keywords": "it workforce;graduate school;women;engineering;computing;history;national science foundation"}
{"name": "train_874", "title": "The curious ways of professional cultures and the \"two-body opportunity\"", "abstract": "When two professionals are a couple, we sometimes refer to them as having a \"two-body problem.\" However, when each partner of a couple exists in the same cultures, they also have an opportunity for deeply shared understanding and empathy, simply because each understands at a deep level the culture in which the other works. I explore this notion. A couple has what we call the \"two-body problem\" when both are professionals who are qualified for a kind of position that is relatively rare and who are very selective about the positions that they accept. For example, there are relatively scant numbers of jobs as a computer science professor-at any level. An individual considering an academic job may only be interested in research universities, or in teaching universities, restricting the choice of open positions substantially. The classic two-body \"problem\" arises when one partner wants to accept a new position that requires geographical relocation. Then, the other partner also needs to find a new position. Moreover, it can be very difficult to find a suitable position when they are naturally scarce", "fulltext": "", "keywords": "computer science;academics;professional cultures;two-body opportunity"}
{"name": "train_875", "title": "Women of color in computing", "abstract": "It is well known that there is a need to increase the number of women in the area of computing, that is in computer science and computer engineering. If we consider women of color, that is women of under-represented ethnicities, we find the numbers are very dismal. The goal of this article is to bring to light the unique issues of women of color based upon the personal experience of one African-American woman who has been in the field of computing for over 20 years (including the years of higher education)", "fulltext": "", "keywords": "computer engineering;gender issues;women of color;higher education;computer science;society;ethnic minority"}
{"name": "train_876", "title": "Perspectives on academic vs. industry environments for women in computer", "abstract": "science The authors were tenure track faculty members at the Colorado School of Mines and later moved into senior positions at software companies. Both are part of two-career couples as well, and both have two children. In this article, they discuss their impressions and share anecdotes regarding the differing experiences of women and families in these two environments", "fulltext": "", "keywords": "women;career;industry environment;faculty members;academic environments;computer science;software companies;children;gender gap"}
{"name": "train_877", "title": "What do you say? Open letters to women considering a computer science major", "abstract": "In the last decade we have both monitored with great interest the ratio of female to male computer science majors at our respective institutions. With each entering class, we think: \"Surely, now is the time when the numbers will become more balanced.\" Logic tells us that this must eventually happen, because the opportunities in computing are simply too attractive for an entire segment of our population to routinely pass up. But each year we are again disappointed in the number of women students, as they continue to be woefully under-represented among computer science majors. So, what do you say to a young woman who is considering a college choice and a choice of major in order to make computer science a more attractive option? We have organized some thoughts on that subject into open letters", "fulltext": "", "keywords": "women;gender issues;computer science majors;female;computer science education;male"}
{"name": "train_878", "title": "Girls, boys, and computers", "abstract": "Today North American girls, boys, teachers, and parents frequently regard computer science and programming as something boys are better at. The author considers how many of the factors that contribute to the low participation of women in computing occur first, and perhaps most forcefully, in childhood. She presents four recommendations to address the situation", "fulltext": "", "keywords": "women;girls;gender issues;computer science;teachers;childhood;programming;boys"}
{"name": "train_879", "title": "Well behaved women rarely make history!", "abstract": "The author considers women in the history of computer science. Prior to the ENIAC, women were extremely important to the computing business as \"computers\". Just as women had taken over the tasks as secretaries in the late 1800s with the advent of the typewriter, and in the early 1900s staffing telephone exchanges, so computing relied on women as the \"workhorses\" of the business", "fulltext": "", "keywords": "women;gender issues;business;eniac;computer science;history"}
{"name": "train_88", "title": "Planning linear construction projects: automated method for the generation of", "abstract": "earthwork activities Earthworks planning for road construction projects is a complex operation and the planning rules used are usually intuitive and not well defined. An approach to automate the earthworks planning process is described and the basic techniques that are used are outlined. A computer-based system has been developed, initially to help planners use existing techniques more efficiently. With their input, the system has been extended to incorporate a knowledge base and a simulation of the earthworks processes. As well as creating activity sets in a much shorter time, the system has shown that for a real project, the model is able to generate activity sets that are comparable to those generated by a project planner", "fulltext": "", "keywords": "knowledge base;earthworks planning process;road construction projects;planning rules;earthwork activities;computer-based system;linear construction projects"}
{"name": "train_880", "title": "Computing 2002: democracy, education, and the future", "abstract": "Computer scientists, computer engineers, information technologists, and their collective products have grown and changed in quantity, quality, and nature. In the first decade of this new century, it should become apparent to everyone that the computing and information fields, broadly defined, will have a profound impact on every element of every person's life. The author considers how women and girls of the world have been neither educated for computing nor served by computing. Globally, women's participation in computer science grew for a while, then dropped precipitously. Computing, science, engineering, and society will suffer if this decline continues, because women have different perspectives on technology, what it is important for, how it should be built, which projects should be funded, and so on. To create a positive future, to assure that women equally influence the future, computing education must change", "fulltext": "", "keywords": "women;girls;future;gender issues;democracy;society;computer science education"}
{"name": "train_881", "title": "Is diversity in computing a moral matter?", "abstract": "We have presented an ethical argument that takes into consideration the subtleties of the issue surrounding under-representation in computing. We should emphasize that there is nothing subtle about overt, unfair discrimination. Where such injustice occurs, we condemn it. Our concern is that discrimination need not be explicit or overt. It need not be individual-to-individual. Rather, it can be subtly built into social practices and social institutions. Our analysis raises ethical questions about aspects of computing that drive women away, aspects that can be changed in ways that improve the profession and access to the profession. We hope that computing will move towards these improvements", "fulltext": "", "keywords": "women;unfair discrimination;ethical argument;social institutions;computing under-representation;social practices"}
{"name": "train_882", "title": "On M/D/1 queue with deterministic server vacations", "abstract": "We study a single server vacation queue with Poisson arrivals, deterministic service of constant duration b (> 0) and deterministic vacations of constant duration d (> 0) and designate this model as M/D/D/1. After completion of each service, the server may take a vacation with probability p or may continue working in the system with probability 1 - p. We obtain time-dependent as well as steady state probability generation functions for the number in the system. For the steady state we obtain explicitly the mean number and the mean waiting time for the system and for the queue. All known results of the M/D/1 queue are derived as a special case. Finally, a numerical illustration is discussed", "fulltext": "", "keywords": "m/d/1 queue;mean waiting time;deterministic vacations;steady state probability generation functions;mean number;deterministic server vacations;poisson arrivals;m/d/d/1 model;time-dependent probability generation functions;deterministic service"}
{"name": "train_883", "title": "On conflict-free executions of elementary nets", "abstract": "Deals with analysis of elementary Petri nets with respect to possibilities of avoiding conflicts during their executions. There are two main aims of the paper. The first is to find a method of checking if a net is conflict-avoidable (i.e., if it possesses a conflict-free fair run). The second is to find a method of rebuilding any net to a totally conflict-avoidable net (i.e., a net possessing a conflict-free fair run in every one process) with the same behaviour. The main results are the following: 1. The proof of decidability, for elementary nets, of the problem of existence of a conflict-avoidable fair process (and an algorithm producing all fair runs). 2. Construction, for an arbitrary given elementary net, of a totally conflict-avoidable net with the same behaviour. The net, completed this way, has the same behaviour as the original one. Moreover, it is totally conflict-avoidable, and its execution may be supervised (in order to ensure conflict-freeness) by the reduced case graph built by the algorithm of the former section", "fulltext": "", "keywords": "elementary petri nets;conflict-free executions;decidability;conflict-free fair run;reduced case graph;totally conflict-avoidable net"}
{"name": "train_884", "title": "A hybrid-neural network and population learning algorithm approach to solving", "abstract": "reliability optimization problem Proposes a hybrid approach integrating a dedicated artificial neural network and population learning algorithm applied to maximising system reliability under cost and technical feasibility constraints. The paper includes a formulation of the system reliability optimisation (SRO) problem and a description of the dedicated neural network trained by applying the population learning algorithm. A solution to the example SRO problem is shown and results of the computational experiment are presented and discussed", "fulltext": "", "keywords": "cost constraints;reliability optimization problem;technical feasibility constraints;population learning algorithm;system reliability;dedicated artificial neural network;hybrid approach"}
{"name": "train_885", "title": "Assignment of periods and priorities of messages and tasks in distributed", "abstract": "control systems Presents a task and message-based scheduling method to guarantee the given end-to-end constraints including precedence constraints, time constraints, and period and priority of task and message. The method is an integrated one considering both tasks executed in each node and messages transmitted via the network and is designed to apply to a general distributed control system that has multiple loops and a single loop has sensor nodes with multiple sensors, actuator nodes with multiple actuators, controller nodes with multiple tasks, and several types of constraints. The assigning method of the optimal period and priority of task and message is proposed, using the presented task and message-based scheduling method", "fulltext": "", "keywords": "end-to-end constraints;task-based scheduling method;time constraints;message-based scheduling method;precedence constraints;distributed control systems;periods assignment;priorities assignment"}
{"name": "train_886", "title": "A fractional-flow model of serial manufacturing systems with rework and its", "abstract": "reachability and controllability properties A dynamic fractional-flow model of a serial manufacturing system incorporating rework is considered. Using some results on reachability and controllability of positive linear systems the ability of serial manufacturing systems with rework to \"move in space\", that is their reachability and controllability properties, are studied. These properties are important not only for optimising the performance of the manufacturing system, possibly off-line, but also to improve its functioning by using feedback control online", "fulltext": "", "keywords": "rework;controllability;serial manufacturing systems;performance optimisation;positive linear systems;reachability;feedback control;dynamic fractional-flow model"}
{"name": "train_887", "title": "Towards strong stability of concurrent repetitive processes sharing resources", "abstract": "The paper presents a method for design of stability conditions of concurrent, repetitive processes sharing common resources. Steady-state behaviour of the system with m cyclic processes utilising a resource with the mutual exclusion is considered. Based on a recurrent equations framework necessary and sufficient conditions for the existence of maximal performance steady-state are presented. It was shown that if the conditions hold then the m-process system is marginally stable, i.e., a steady-state of the system depends on the perturbations. The problem of finding the relative positions of the processes leading to waiting-free (maximal efficiency) steady-states of the system is formulated as a constraint logic programming problem. An example illustrating the solving of the problem for a 3-process system using object-oriented, constraint logic programming language Oz is presented. A condition sufficient for strong stability of the m-process system is given. When the condition holds then for any initial phases of the processes a waiting-free steady-state will be reached", "fulltext": "", "keywords": "necessary and sufficient conditions;strong stability;maximal performance steady-state;concurrent repetitive processes;mutual exclusion;steady-state behaviour;cyclic processes;3-process system;waiting-free steady-states;constraint logic programming;oz language;recurrent equations framework;common resources"}
{"name": "train_888", "title": "Storage functionals and Lyapunov functions for passive dynamical systems", "abstract": "For nonlinear time-invariant input-output dynamical systems the passivity conditions are obtained under some restrictions. The conditions imply storage functions satisfying a dissipation inequality. A class of storage functions allowing unique reconstruction of a passive dynamical system is defined. These results are illustrated by an example of a linear system with fading memory. An important, for practical application, class of the linear relaxation systems without direct input-output interaction is considered. A necessary condition for dynamical systems to be of the relaxation type is obtained for this class. The condition is connected with the existence of a unique quadratic Lyapunov function satisfying the complete monotonicity condition. This unique Lyapunov function corresponds to a \"standard\" thermodynamic potential in a compact family of potentials in the nonequilibrium thermodynamics. The results obtained can be useful in automatic control, mechanics of viscoelastic materials, and various applications in physics and the system theory", "fulltext": "", "keywords": "nonequilibrium thermodynamics;viscoelastic materials;necessary condition;passive dynamical systems;dissipation inequality;automatic control;fading memory;mechanics;storage functionals;thermodynamic potential;linear system;passivity conditions;nonlinear time-invariant input-output dynamical systems;complete monotonicity condition;unique quadratic lyapunov function"}
{"name": "train_889", "title": "Synthesis of the control systems via reflection onto auxiliary surfaces", "abstract": "An approach to robust control systems synthesis, both linear and nonlinear, and nonstationary is offered. The control is carried out, providing the given phase constraints varied in acceptable limits, in view of constraints on its value and incompleteness of the information about functioning disturbances. The approach is based on the introduction of auxiliary integral surfaces, on which the initial moving is projected. As a result the reduced equivalent moving is formed, being described by the scalar equation which in many important cases can be integrated directly. On the basis of the equation obtained solving a synthesis task is carried out and can be reduced to algebraic or integral inequalities. The final relations defined for linear equivalent moving are presented", "fulltext": "", "keywords": "auxiliary surfaces;linear equivalent moving;robust control systems;control systems synthesis;integral inequalities;linear systems;nonlinear systems;algebraic inequalities"}
{"name": "train_89", "title": "A framework for rapid local area modeling for construction automation", "abstract": "Rapid 3D positioning and modeling in construction can be used to more effectively plan, visualize, and communicate operations before execution. It can also help to optimize equipment operations, significantly improve safety, and enhance a remote operator's spatial perception of the workspace. A new framework for rapid local area sensing and 3D modeling for better planning and control of construction equipment operation is described and demonstrated. By combining human-assisted graphical workspace modeling with pre-stored Computer-Aided Design (CAD) models and simple sensors (such as single-axis laser rangefinders and remote video cameras), modeling time can be significantly reduced while potentially increasing modeling accuracy", "fulltext": "", "keywords": "pre-stored computer-aided design models;equipment operations;rapid local area modeling;single-axis laser rangefinders;remote video cameras;3d modeling;construction automation;spatial perception;rapid local area sensing;human-assisted graphical workspace modeling;rapid 3d positioning"}
{"name": "train_890", "title": "Multiple criteria decision making without optimization", "abstract": "We present a development intended to make interactive decision making schemes accessible for a wider spectrum of decision makers. To this aim we propose to eliminate the need to solve optimization problems at successive iterations of interactive decision processes. We show that the need for optimization can be eliminated by the ability of establishing sufficiently tight bounds on criteria values for efficient decisions prior to explicit identification of such decisions. We present a technique, fully operational and numerically simple, for establishing such bounds. Bounds are dynamic, i.e., they become stronger with the growing number of decisions explicitly identified. They are also parametric with respect to weighting coefficients. We also point out how this technique can enhance the existing interactive decision making methods", "fulltext": "", "keywords": "multiple criteria decision making;criteria values bounds;efficient decisions;decision makers;interactive decision making schemes"}
{"name": "train_891", "title": "Establishing the discipline of physics-based CMP modeling", "abstract": "For the past decade, a physically based comprehensive process model for chemical mechanical polishing has eluded the semiconductor industry. However, a long-term collaborative effort has now resulted in a workable version of that approach. The highly fundamental model is based on advanced finite element analysis and is beginning to show promise in CMP process development", "fulltext": "", "keywords": "cmp;chemical mechanical polishing;finite element analysis;cmp process development;physically based process model"}
{"name": "train_892", "title": "Dementing disorders: volumetric measurement of cerebrospinal fluid to", "abstract": "distinguish normal from pathologic finding - feasibility study We have demonstrated that automated methods to describe the severity and distribution of cerebral atrophy are capable of providing diagnostic information in the classification of neurodegenerative diseases", "fulltext": "", "keywords": "dementing disorders;neurodegenerative diseases classification;cerebral atrophy distribution;diagnostic information;cerebral atrophy severity;normal-pathologic findings distinguishing;automated methods;healthy subjects;medical diagnostic imaging;cerebrospinal fluid volumetric measurement;magnetic resonance imaging technique"}
{"name": "train_893", "title": "Use of natural language processing to translate clinical information from a", "abstract": "database of 889,921 chest radiographic reports The aim was to evaluate translation of chest radiographic reports using natural language processing and to compare the findings with those in the literature. A natural language processor coded 10 years of narrative chest radiographic reports from an urban academic medical center. Coding for 150 reports was compared with manual coding. Frequencies and cooccurrences of 24 clinical conditions (diseases, abnormalities, and clinical states) were estimated. The ratio of right to left lung mass, association of pleural effusion with other conditions, and frequency of bullet and stab wounds were compared with independent observations. The sensitivity and specificity of the system's pneumothorax coding were compared with those of manual financial coding. Internal and external validation in this study confirmed the accuracy of natural language processing for translating chest radiographic narrative reports into a large database of information", "fulltext": "", "keywords": "stab wounds;clinical condition cooccurrence;pleural effusion;pneumothorax coding;bullet wounds;chest radiographic report database;urban academic medical center;natural language processing;clinical information translation;right to left lung mass ratio;clinical condition frequency"}
{"name": "train_894", "title": "Improved detection of lung nodules by using a temporal subtraction technique", "abstract": "The authors evaluated the effect of a temporal subtraction technique for digital chest radiography with regard to the accuracy of detection of lung nodules. Twenty solitary lung nodules smaller than 30 mm in diameter, including 10 lung cancers and 10 benign nodules, were used. The nodules were grouped subjectively according to their subtlety. For nonnodular cases, 20 nodules without perceptible interval changes were selected. All chest radiographs were obtained by using a computed radiographic system, and temporal subtraction images were produced by using a program developed at the University of Chicago. The effect of the temporal subtraction image was evaluated by using an observer performance study, with use of receiver operating characteristic analysis. Observer performance with temporal subtraction images was substantially improved (A/sub z/ = 0.980 and 0.958), as compared with that without temporal subtraction images (A/sub z/ = 0.920 and 0.825) for the certified radiologists and radiology residents, respectively. The temporal subtraction technique clearly improved diagnostic accuracy for detecting lung nodules, especially subtle cases. In conclusion, the temporal subtraction technique is useful for improving detection accuracy for peripheral lung nodules on digital chest radiographs", "fulltext": "", "keywords": "temporal subtraction technique;subtle cases;radiology residents;improved lung nodules detection;digital chest radiography;30 mm;observer performance;certified radiologists;computed radiographic system;peripheral lung nodules;medical diagnostic imaging;university of chicago;perceptible interval changes"}
{"name": "train_895", "title": "Algorithms for improving the quality of R-trees", "abstract": "A novel approach to operation with a structure for spatial indexing of extended objects shaped as R-trees is considered. It consists of the initial global construction of an efficient R-tree structure and the subsequent operation with it using conventional dynamic algorithms. A global strategy for constructing an R-tree reduced to a problem of dividing a set of rectangular objects into K parts with minimum mutual overlay is suggested. Base, box, and \"Divide and Conquer\" algorithms are suggested. The results of experimental modeling of the execution of various algorithms are discussed", "fulltext": "", "keywords": "rectangular objects;computational geometry;graphical search;extended objects;minimum mutual overlay;r-trees;spatial indexing;dynamic algorithms"}
{"name": "train_896", "title": "Calculation of the probability of survival of an insurance company with", "abstract": "allowance for the rate of return for a Poisson stream of premiums The probability of survival of an insurance company with the working capital is calculated for a Poisson stream of premiums", "fulltext": "", "keywords": "poisson premium stream;survival probability;insurance company;probability density function;return rate"}
{"name": "train_897", "title": "Optimization of advertising expenses in the functioning of an insurance company", "abstract": "With the use of Pontryagin's maximum principle, a problem of optimal time distribution of advertising expenses in the functioning of an insurance company is solved", "fulltext": "", "keywords": "insurance company;optimal time distribution;optimization;pontryagin maximum principle;advertising expenses;differential equations"}
{"name": "train_898", "title": "Influence of advertising expenses on the characteristics of functioning of an", "abstract": "insurance company The basic characteristics of the functioning of an insurance company, including the average capital, ruin and survival probabilities, and the conditional time before ruin, are examined with allowance for advertising expenses", "fulltext": "", "keywords": "survival probabilities;conditional time;ruin probabilities;insurance company functioning characteristics;average capital;advertising expenses influence"}
{"name": "train_899", "title": "Mathematical model of functioning of an insurance company with allowance for", "abstract": "advertising expenses A mathematical model of the functioning of an insurance company with allowance for advertising expenses is suggested. The basic characteristics of the capital of the company and the advertising efficiency are examined in the case in which the advertising expenses are proportional to the capital", "fulltext": "", "keywords": "advertising expenses allowance;capital;mathematical model;insurance company functioning"}
{"name": "train_9", "title": "Achieving competitive capabilities in e-services", "abstract": "What implications does the Internet have for service operations strategy? How can business performance of e-service companies be improved in today's knowledge-based economy? These research questions are the subject of the paper. We propose a model that links the e-service company's knowledge-based competencies with their competitive capabilities. Drawing from the current literature, our analysis suggests that services that strategically build a portfolio of knowledge-based competencies, namely human capital, structural capital, and absorptive capacity have more operations-based options, than their counterparts who are less apt to invest. We assume that the combinative capabilities of service quality, delivery, flexibility, and cost are determined by the investment in intellectual capital. Arguably, with the advent of the Internet, different operating models (e.g., bricks-and-mortar, clicks-and-mortar, or pure dot-com) have different strategic imperatives in terms of knowledge-based competencies. Thus, the new e-operations paradigm can be viewed as a configuration of knowledge-based competencies and capabilities", "fulltext": "", "keywords": "business performance;delivery;structural capital;bricks-and-mortar;clicks-and-mortar;knowledge-based competencies;investment;intellectual capital;flexibility;combinative capabilities;absorptive capacity;knowledge-based economy;service operations strategy;service quality;internet;human capital;strategic imperatives;cost;operations-based options;e-services;dot-com;competitive capabilities"}
{"name": "train_90", "title": "LAN-based building maintenance and surveillance robot", "abstract": "The building and construction industry is the major industry of Hong Kong as in many developed countries around the world. After the commissioning of a high-rise building or a large estate, substantial manpower, both inside the management centre under a standby manner, as well as surveillance for security purposes around the whole building, is required for daily operation to ensure a quality environment for the occupants. If the surveillance job can be done by robots, the efficiency can be highly enhanced, resulting in a great saving of manpower and the improved safety of the management staff as a by-product. Furthermore, if the robot can retrieve commands from the building management system via a local area network (LAN), further savings in manpower can be achieved in terms of first-line fault attendance by human management staff. This paper describes the development of a robot prototype here in Hong Kong, which can handle some daily routine maintenance works and surveillance responsibilities. The hardware structure of the robot and its on-board devices are described. Real-time images captured by a camera on the robot with pan/tilt/zoom functions can be transmitted back to the central management office via a local area network. The interface between the robot and the building automation system (BAS) of the building is discussed. This is the first key achievement of this project with a strong implication on reducing the number of human staff to manage a modem building. Teleoperation of the robot via the Internet or intranet is also possible, which is the second achievement of this project. Finally, the robot can identify its physical position inside the building by a landmark recognition method based on standard CAD drawings, which is the third achievement of this project. The main goal of this paper is not the description of some groundbreaking technology in robotic development. It is mainly intended to convince building designers and managers to incorporate robotic systems when they are managing modem buildings to save manpower and improve efficiency", "fulltext": "", "keywords": "pan/tilt/zoom functions;hardware structure;high-rise building;local area network;lan-based building maintenance and surveillance robot;building management system;first-line fault attendance;landmark recognition method;teleoperation;security purposes"}
{"name": "train_900", "title": "Mathematical models of functioning of an insurance company with allowance for", "abstract": "the rate of return Models of the functioning of insurance companies are suggested, when the free capital increases from interest at a certain rate. The basic characteristics of the capital of a company are studied in the stationary regime", "fulltext": "", "keywords": "free capital increase;return rate allowance;stationary regime;interest;insurance company functioning;mathematical models"}
{"name": "train_901", "title": "Estimation of the Poisson stream intensity in a multilinear queue with an", "abstract": "exponential job queue decay Times the busy queue periods start are found for a multilinear queue with an exponential job queue decay and uniform resource allocation to individual servers. The stream intensity and the average job are estimated from observations of the times the queue busy periods start", "fulltext": "", "keywords": "individual servers;stream intensity;uniform resource allocation;poisson stream intensity;multilinear queue;exponential job queue decay;busy queue periods start"}
{"name": "train_902", "title": "TCP explicit congestion notification over ATM-UBR: a simulation study", "abstract": "The enhancement of transmission control protocol's (TCP's) congestion control mechanisms using explicit congestion notification (ECN) over asynchronous transfer mode (ATM) networks is overviewed. TCP's congestion control is enhanced so that congestion is indicated by not only packet losses as is currently the case but an agent implemented at the ATM network's edge as well. The novel idea uses EFCI (explicit forward congestion indication) bits (available in every ATM cell header) to generalize the ECN response to the UBR (unspecified bit rate) service, notify congestion, and adjust the credit-based window size of the TCR. The authors' simulation experiments show that TCP ECN achieves significantly lower cell loss, packet retransmissions, and buffer utilization, and exhibits better throughput than (non-ECN) TCP Reno", "fulltext": "", "keywords": "tcp explicit congestion notification;packet losses;cell loss;atm networks;agent;simulation;throughput;packet retransmissions;congestion control mechanisms;unspecified bit rate service;credit-based window size;buffer utilization;explicit forward congestion indication bits;atm-ubr"}
{"name": "train_903", "title": "Modeling and simulation of an ABR flow control algorithm using a virtual", "abstract": "source/virtual destination switch The available bit rate (ABR) service class of asynchronous transfer mode networks uses a feedback control mechanism to adapt to varying link capacities. The virtual source/virtual destination (VS/VD) technique offers the possibility of segmenting the otherwise end-to-end ABR control loop into separate loops. The improved feedback delay and control of ABR traffic inside closed segments provide a better performance for ABR connections. This article presents the use of classical linear control theory to model and develop an ABR VS/VD flow control algorithm. Discrete event simulations are used to analyze the behavior of the algorithm with respect to transient behavior and correctness of the control model. Linear control theory offers the means to derive correct choices of parameters and to assess performance issues, such as stability of the system, during the design phase. The performance goals are high link utilization, fair bandwidth distribution, and robust operation in various environments, which are verified by discrete event simulations. The major contribution of this work is the use of analytic methods (linear control theory) to model and design an ABR flow control algorithm tailored for the special layout of a VS/VD switch, and the use of simulation techniques to verify the result", "fulltext": "", "keywords": "closed segments;control model;link capacities;transient behavior;virtual source/virtual destination switch;feedback delay;fair bandwidth distribution;atm networks;available bit rate service class;performance issues;high link utilization;classical linear control theory;feedback control mechanism;robust operation;traffic control;modeling;stability;discrete event simulations;control loop;abr flow control algorithm"}
{"name": "train_904", "title": "Modeling and simulation of adaptive available bit rate voice over asynchronous", "abstract": "transfer mode networks This article presents a modeling and simulation methodology to analyze the performance of voice quality when sent over the available bit rate service in asynchronous transfer mode networks. Sources can modify the rate at which they send traffic to the network based on the feedback carried in the resource management cells. This is achieved by changing the encoding level. As the contention increases to network resources-bandwidth in this case-sources start reducing the rate at which they generate and send traffic. The efficiency of the scheme under different scheduling/drop policies and other operating conditions and environments is evaluated using simulation modeling. Furthermore, sensitivity analysis is applied to different parameters, such as queue size and averaging interval length, to investigate their impact on the performance metrics. Results show that limiting the load to 41% of the link capacity results in an acceptable quality", "fulltext": "", "keywords": "feedback;queue size;performance analysis;averaging interval length;voice quality;traffic;bandwidth contention;scheduling/drop policies;atm networks;performance metrics;simulation;resource management cells;encoding level;adaptive available bit rate voice;link capacity;modeling"}
{"name": "train_905", "title": "Ultra-high speed positioning control of a gravure engraving unit using a", "abstract": "discrete-time two-degree-of-freedom H/sub infinity / control The piezoelectric actuator has high-speed response in comparison with the electro-magnetic actuator. However, it is not easy to achieve both high-speed and high-precision response by feedforward control only because the piezoelectric element has nonlinear properties such as the hysteresis effect. Thus, feedback control is required to achieve good performance. We develop a control design method to achieve both high-speed and high-precision response for piezoelectric actuators using the discrete-time H/sub infinity / control method and the two-degree-of-freedom control scheme. The effectiveness of our proposed method has been shown by simulation and experimental results. The most important contribution of our study is that our method can be directly applied to commercial machines", "fulltext": "", "keywords": "discrete-time two-degree-of-freedom h/sub infinity / control;high-precision response;digital control system;hysteresis;control design method;ultra-high speed positioning control;piezoelectric actuator;feedback control;feedforward;gravure engraving unit;nonlinear properties"}
{"name": "train_906", "title": "High-performance servo systems based on multirate sampling control", "abstract": "In this paper, novel multirate two-degree-of-freedom controllers are proposed for digital control systems, in which the sampling period of plant output is restricted to be relatively longer than the control period of plant input. The proposed feedforward controller assures perfect tracking at M inter-sampling points. On the other hand, the proposed feedback controller assures perfect disturbance rejection at M inter-sample points in the steady state. Illustrative examples of position control for hard disk drive are presented, and advantages of these approaches are demonstrated", "fulltext": "", "keywords": "feedback;hard disk drive;disturbance rejection;position control;tracking;digital control systems;feedforward;multirate sampling control;servo system"}
{"name": "train_907", "title": "Development of an integrated and open-architecture precision motion control", "abstract": "system In this paper, the development of an integrated and open-architecture precision motion control system is presented. The control system is generally applicable, but it is developed with a particular focus on direct drive servo systems based on linear motors. The overall control system is comprehensive, comprising of various selected control and instrumentation components, integrated within a configuration of hardware architecture centred around a dSPACE DS1004 DSP processor board. These components include a precision composite controller (comprising of feedforward and feedback control), a disturbance observer, an adaptive notch filter, and a geometrical error compensator. The hardware architecture, software development platform, user interface, and all constituent control components are described", "fulltext": "", "keywords": "feedback;geometrical error compensation;adaptive notch filter;dspace ds1004 processor;open-architecture;precision;direct drive servo systems;composite controller;motion control;feedforward;linear motors"}
{"name": "train_908", "title": "Multivariable H/sub infinity // mu feedback control design for high-precision", "abstract": "wafer stage motion Conventional PID-like SISO controllers are still the most common in industry, but with performance requirements becoming tighter there is a growing need for advanced controllers. For the positioning devices in IC-manufacturing, plant interaction is a major performance-limiting factor. MIMO control can be invoked to tackle this problem. A practically feasible procedure is presented to design MIMO feedback controllers for electromechanical positioning devices, using H/sub infinity // mu techniques. Weighting filters are proposed to straightforwardly and effectively impose performance and uncertainty specifications. Experiments show that MIMO control can considerably improve upon the performance with multiloop SISO control. Some problems are highlighted that are important for industrial practice, but lacking a workable solution", "fulltext": "", "keywords": "feedback;weighting filters;servo systems;mimo systems;mechatronics;model uncertainty;motion control;ic manufacture;h/sub infinity / control;mu synthesis;multivariable control systems"}
{"name": "train_909", "title": "Influence of the process design on the control strategy: application in", "abstract": "electropneumatic field This article proposes an example of electropneumatic system where the architecture of the process is modified with respect to both the specifications for position and velocity tracking and a criterion concerning the energy consumption. Experimental results are compared and analyzed using an industrial bench test. For this, a complete model of the system is presented, and two kinds of nonlinear control laws are developed, a monovariable and multivariable type based on the flatness theory", "fulltext": "", "keywords": "positioning systems;monovariable control;energy consumption;flatness theory;electropneumatic systems;position control;tracking;multivariable control;nonlinear control;velocity control"}
{"name": "train_91", "title": "IT challenge: cross selling [finance]", "abstract": "Like most financial institutions, FleetBoston, Fidelity and Berkshire Group of Companies are being charged with developing a strong technology platform that will allow them to cross sell their products and services. They discuss their solutions, advice and technology choices", "fulltext": "", "keywords": "berkshire group;financial institutions;fidelity;fleetboston;cross selling"}
{"name": "train_910", "title": "Control of a heavy-duty robotic excavator using time delay control with", "abstract": "integral sliding surface The control of a robotic excavator is difficult from the standpoint of the following problems: parameter variations in mechanical structures, various nonlinearities in hydraulic actuators and disturbance due to the contact with the ground. In addition, the more the size of robotic excavators increases, the more the length and mass of the excavator links; the more the parameters of a heavy-duty excavator vary. A time-delay control with switching action (TDCSA) using an integral sliding surface is proposed in this paper for the control of a 21-ton robotic excavator. Through analysis and experiments, we show that using an integral sliding surface for the switching action of TDCSA is better than using a PD-type sliding surface. The proposed controller is applied to straight-line motions of a 21-ton robotic excavator with a speed level at which skillful operators work. Experiments, which were designed for surfaces with various inclinations and over broad ranges of joint motions, show that the proposed controller exhibits good performance", "fulltext": "", "keywords": "trajectory control;integral sliding surface;tracking;time-delay control;pressure control;dynamics;motion control;robust control;robotic excavator"}
{"name": "train_911", "title": "Scheduling schemes for an integrated flight and propulsion control system", "abstract": "We describe two schemes for scheduling an integrated flight and propulsion control system for an experimental vertical/short take-off and landing (V/STOL) aircraft concept in the acceleration from hover (0-120 kn) flight phase. Multivariable integrated flight and propulsion controllers are designed at several points over the V/STOL envelope and implemented as exact plant observers with state feedback. In the first scheduling scheme, the values of the state feedback and observer gain matrices are interpolated between the fixed-point designs as a function of aircraft speed. In the second approach, the control signals produced by the different fixed-point controllers are blended, allowing a significant reduction in the order of the scheduled controllers. Both scheduling schemes are shown in nonlinear simulation to provide excellent handling qualities as the aircraft accelerates from the hover", "fulltext": "", "keywords": "vertical short take-off landing aircraft;state feedback;observers;vstol aircraft;propulsion control;scheduling;fixed-point controllers;flight control;multivariable control systems"}
{"name": "train_912", "title": "Grey-box model identification via evolutionary computing", "abstract": "This paper presents an evolutionary grey-box model identification methodology that makes the best use of a priori knowledge on a clear-box model with a global structural representation of the physical system under study, whilst incorporating accurate blackbox models for immeasurable and local nonlinearities of a practical system. The evolutionary technique is applied to building dominant structural identification with local parametric tuning without the need of a differentiable performance index in the presence of noisy data. It is shown that the evolutionary technique provides an excellent fitting performance and is capable of accommodating multiple objectives such as to examine the relationships between model complexity and fitting accuracy during the model building process. Validation results show that the proposed method offers robust, uncluttered and accurate models for two practical systems. It is expected that this type of grey-box models will accommodate many practical engineering systems for a better modelling accuracy", "fulltext": "", "keywords": "nonlinear system;grey-box models;system identification;genetic evolution;multiobjective optimisation;hydraulic system;evolutionary algorithms"}
{"name": "train_913", "title": "Control of a coupled map lattice model for vortex shedding in the wake of a", "abstract": "cylinder The flow behind a vibrating flexible cable at low Reynolds numbers can exhibit complex wake structures such as lace-like patterns, vortex dislocations and frequency cells. These structures have been observed in experiments and numerical simulations, and are predicted by a previously developed low-order coupled map lattice (CML). The discrete (in time and space) CML models consist of a series of diffusively coupled circle map oscillators along the cable span. Motivated by a desire to modify the complex wake patterns behind flexible vibrating cables, we have studied the addition of control terms into the highly efficient CML models and explored the resulting dynamics. Proportional, adaptive proportional and discontinuous non-linear (DNL) control methods were used to derive the control laws. The first method employed occasional proportional feedback. The adaptive method used spatio-temporal feedback control. The DNL method used a discontinuous feedback linearization procedure, and the controller was designed for the resulting linearized system using eigenvalue assignment. These techniques were applied to a modeled vortex dislocation structure in the wake of a vibrating cable in uniform freestream flow. Parallel shedding patterns were achieved for a range of forcing frequency-forcing amplitude combinations studied to validate the control theory. The adaptive proportional and DNL methods were found to be more effective than the proportional control method due to the incorporation of a spatially varying feedback gain across the cylinder span. The DNL method was found to be the most efficient controller of the low-order CML model. The required control level across the cable span was correlated to the 1/1 lock-on behavior of the temporal circle map", "fulltext": "", "keywords": "cylinder;spatio-temporal feedback control;1/1 lock-on;vibrating flexible cable;temporal circle map;vortex shedding;vortex dislocations;vortex dislocation;coupled circle map oscillators;low reynolds numbers;proportional feedback;wake;discontinuous nonlinear control;coupled map lattice"}
{"name": "train_914", "title": "A knowledge management framework for the support of decision making in", "abstract": "humanitarian assistance/disaster relief The major challenge in current humanitarian assistance/disaster relief (HA/DR) efforts is that diverse information and knowledge are widely distributed and owned by different organizations. These resources are not efficiently organized and utilized during HA/DR operations. We present a knowledge management framework that integrates multiple information technologies to collect, analyze, and manage information and knowledge for supporting decision making in HA/DR. The framework will help identify the information needs, be aware of a disaster situation, and provide decision-makers with useful relief recommendations based on past experience. A comprehensive, consistent and authoritative knowledge base within the framework will facilitate knowledge sharing and reuse. This framework can also be applied to other similar real-time decision-making environments, such as crisis management and emergency medical assistance", "fulltext": "", "keywords": "crisis management;organizations;real-time decision-making environments;knowledge reuse;knowledge management framework;information technology;emergency medical assistance;disaster relief;knowledge sharing;decision support system;humanitarian assistance;case-based reasoning;information needs"}
{"name": "train_915", "title": "A meteorological fuzzy expert system incorporating subjective user input", "abstract": "We present a fuzzy expert system, MEDEX, for forecasting gale-force winds in the Mediterranean basin. The most successful local wind forecasting in this region is achieved by an expert human forecaster with access to numerical weather prediction products. That forecaster's knowledge is expressed as a set of 'rules-of-thumb'. Fuzzy set methodologies have proved well suited for encoding the forecaster's knowledge, and for accommodating the uncertainty inherent in the specification of rules, as well as in subjective and objective input. MEDEX uses fuzzy set theory in two ways: as a fuzzy rule base in the expert system, and for fuzzy pattern matching to select dominant wind circulation patterns as one input to the expert system. The system was developed, tuned, and verified over a two-year period, during which the weather conditions from 539 days were individually analyzed. Evaluations of MEDEX performance for both the onset and cessation of winter and summer winds are presented, and demonstrate that MEDEX has forecasting skill competitive with the US Navy's regional forecasting center in Rota, Spain", "fulltext": "", "keywords": "uncertainty;rules-of-thumb;fuzzy set theory;fuzzy pattern matching;mediterranean basin;meteorological fuzzy expert system;numerical weather prediction products;subjective user input;fuzzy rule base;medex;wind circulation patterns;gale-force wind forecasting;subjective variables;rule specification"}
{"name": "train_916", "title": "Attribute generation based on association rules", "abstract": "A decision tree is considered to be appropriate (1) if the tree can classify the unseen data accurately, and (2) if the size of the tree is small. One of the approaches to induce such a good decision tree is to add new attributes and their values to enhance the expressiveness of the training data at the data pre-processing stage. There are many existing methods for attribute extraction and construction, but constructing new attributes is still an art. These methods are very time consuming, and some of them need a priori knowledge of the data domain. They are not suitable for data mining dealing with large volumes of data. We propose a novel approach that the knowledge on attributes relevant to the class is extracted as association rules from the training data. The new attributes and the values are generated from the association rules among the originally given attributes. We elaborate on the method and investigate its feature. The effectiveness of our approach is demonstrated through some experiments", "fulltext": "", "keywords": "attribute extraction;data mining;decision tree;training data;association rules;large database;experiments;attribute generation"}
{"name": "train_917", "title": "Efficient transitive closure reasoning in a combined class/part/containment", "abstract": "hierarchy Class hierarchies form the backbone of many implemented knowledge representation and reasoning systems. They are used for inheritance, classification and transitive closure reasoning. Part hierarchies are also important in artificial intelligence. Other hierarchies, e.g. containment hierarchies, have received less attention in artificial intelligence. This paper presents an architecture and an implementation of a hierarchy reasoner that integrates a class hierarchy, a part hierarchy, and a containment hierarchy into one structure. In order to make an implemented reasoner useful, it needs to operate at least at speeds comparable to human reasoning. As real-world hierarchies are always large, special techniques need to be used to achieve this. We have developed a set of parallel algorithms and a data representation called maximally reduced tree cover for that purpose. The maximally reduced tree cover is an improvement of a materialized transitive closure representation which has appeared in the literature. Our experiments with a medical vocabulary show that transitive closure reasoning for combined class/part/containment hierarchies in near constant time is possible for a fixed hardware configuration", "fulltext": "", "keywords": "parallel reasoning;inheritance;containment hierarchy;classification;parallel algorithms;data representation;medical vocabulary;class hierarchy;artificial intelligence;materialized transitive closure representation;part hierarchy;maximally reduced tree cover;knowledge representation;fixed hardware configuration;part hierarchies;experiments;transitive closure reasoning"}
{"name": "train_918", "title": "Schema evolution in data warehouses", "abstract": "We address the issues related to the evolution and maintenance of data warehousing systems, when underlying data sources change their schema capabilities. These changes can invalidate views at the data warehousing system. We present an approach for dynamically adapting views according to schema changes arising on source relations. This type of maintenance concerns both the schema and the data of the data warehouse. The main issue is to avoid the view recomputation from scratch especially when views are defined from multiple sources. The data of the data warehouse is used primarily in organizational decision-making and may be strategic. Therefore, the schema of the data warehouse can evolve for modeling new requirements resulting from analysis or data-mining processing. Our approach provides means to support schema evolution of the data warehouse independently of the data sources", "fulltext": "", "keywords": "system maintenance;structural view maintenance;containment;schema evolution;source relations;view adaptation;data analysis;sql query;data sources;data warehouses;organizational decision-making"}
{"name": "train_919", "title": "Agents in e-commerce: state of the art", "abstract": "This paper surveys the state of the art of agent-mediated electronic commerce (e-commerce), especially in business-to-consumer (B2C) e-commerce and business-to-business (B2B) e-commerce. From the consumer buying behaviour perspective, the roles of agents in B2C e-commerce are: product brokering, merchant brokering, and negotiation. The applications of agents in B2B e-commerce are mainly in supply chain management. Mobile agents, evolutionary agents, and data-mining agents are some special techniques which can be applied in agent-mediated e-commerce. In addition, some technologies for implementation are briefly reviewed. Finally, we conclude this paper by discussions on the future directions of agent-mediated e-commerce", "fulltext": "", "keywords": "supply chain management;state of the art;data-mining agents;multi-agent systems;agent-mediated electronic commerce;mobile agents;evolutionary agents;business-to-business e-commerce;consumer buying behaviour;negotiation;product brokering;merchant brokering;business-to-consumer e-commerce"}
{"name": "train_92", "title": "Wireless-retail financial services: adoption can't justify the cost", "abstract": "Slow adoption by retail investors, costly services and bankrupt vendors has prompted banks and brokerage firms to turn off their wireless applications", "fulltext": "", "keywords": "wireless applications;banks;brokerage firms"}
{"name": "train_920", "title": "Three-dimensional periodic Voronoi grain models and micromechanical", "abstract": "FE-simulations of a two-phase steel A three-dimensional model is proposed for modeling of microstructures. The model is based on the finite element method with periodic boundary conditions. The Voronoi algorithm is used to generate the geometrical model, which has a periodic grain structure that follows the original boundaries of the Voronoi cells. As an application, the model is used to model a two-phase ferrite/pearlite steel. It is shown that periodic cells with only five grains generate representative stress-strain curves", "fulltext": "", "keywords": "two-phase steel;kinematic constraints;voronoi algorithm;periodic voronoi grain models;adaptive mesh generator;voronoi tessellation;microstructures modeling;micromechanical fem simulations;ferrite-pearlite steel;stress-strain curves;quadtree/octree-based algorithm;computational time;geometrical model;periodic boundary conditions;three-dimensional model"}
{"name": "train_921", "title": "Processing of complexly shaped multiply connected domains in finite element", "abstract": "mesh generation Large number of finite element models in modern materials science and engineering is defined on complexly shaped domains, quite often multiply connected. Generation of quality finite element meshes on such domains, especially in cases when the mesh must be 100% quadrilateral, is highly problematic. This paper describes mathematical fundamentals and practical -implementation of a powerful method and algorithm allowing transformation of multiply connected domains of arbitrary geometrical complexity into a set of simple domains; the latter can then be processed by broadly available finite element mesh generators. The developed method was applied to a number of complex geometries, including those arising in analysis of parasitic inductances and capacitances in printed circuit boards. The quality of practical results produced by the method and its programming implementation provide evidence that the algorithm can be applied to other finite element models with various physical backgrounds", "fulltext": "", "keywords": "metal forming processes;automatic step calculation;quadrilateral mesh;parasitic capacitances;iterative basis;printed circuit boards;parasitic inductances;programming implementation;finite element mesh generation;complexly shaped multiply connected domains;structural engineering models;general domain subdivision algorithm;artificial cut;arbitrary geometrical complexity;set of simple domains;domains transformation;finite element models"}
{"name": "train_922", "title": "Smart collision information processing sensors for fast moving objects", "abstract": "In this technical note we survey the area of smart collision information processing sensors. We review the existing technologies to detect collision or overlap between fast moving physical objects or objects in virtual environments, physical environments or a combination of physical and virtual objects. We report developments in the collision detection of fast moving objects at discrete time steps such as two consecutive time frames, as well as continuous time intervals such as in an interframe collision detection system. Our discussion of computational techniques in this paper is limited to convex objects. Techniques exist however to efficiently decompose non-convex objects into convex objects. We also discuss the tracking technologies for objects from the standpoint of collision detection or avoidance", "fulltext": "", "keywords": "nonconvex objects;air traffic control;continuous time intervals;collision information processing;physical environments;consecutive time frames;high speed machining;tracking;virtual environments;interframe collision detection;collision detection;convex objects;smart sensors;discrete time steps;fast moving objects;military training"}
{"name": "train_923", "title": "Design and manufacture of a lightweight piezo-composite curved actuator", "abstract": "In this paper we are concerned with the design, manufacture and performance test of a lightweight piezo-composite curved actuator (called LIPCA) using a top carbon fiber composite layer with near-zero coefficient of thermal expansion (CTE), a middle PZT ceramic wafer, and a bottom glass/epoxy layer with a high CTE. The main point of the design for LIPCA is to replace the heavy metal layers of THUNDER TM by lightweight fiber reinforced plastic layers without losing the capabilities for generating high force and large displacement. It is possible to save up to about 40% of the weight if we replace the metallic backing material by the light fiber composite layer. We can also have design flexibility by selecting the fiber direction and the size of prepreg layers. In addition to the lightweight advantage and design flexibility, the proposed device can be manufactured without adhesive layers when we use an epoxy resin prepreg system. Glass/epoxy prepregs, a ceramic wafer with electrode surfaces, and a carbon prepreg were simply stacked and cured at an elevated temperature (177 degrees C) after following an autoclave bagging process. We found that the manufactured composite laminate device had a sufficient curvature after being detached from a flat mould. An analysis method using the classical lamination theory is presented to predict the curvature of LIPCA after curing at an elevated temperature. The predicted curvatures are in quite good agreement with the experimental values. In order to investigate the merits of LIPCA, performance tests of both LIPCA and THUNDER TM have been conducted under the same boundary conditions. From the experimental actuation tests, it was observed that the developed actuator could generate larger actuation displacement than THUNDER TM", "fulltext": "", "keywords": "carbon fiber composite layer;glass/epoxy layer;predicted curvatures;lipca;boundary conditions;performance tests;thunder;fiber reinforced plastic layers;near-zero coefficient of thermal expansion;performance test;lightweight piezo-composite curved actuator;177 degc;pzt ceramic wafer;177 degrees c"}
{"name": "train_924", "title": "Dynamic testing of inflatable structures using smart materials", "abstract": "In this paper we present experimental investigations of the vibration testing of an inflated, thin-film torus using smart materials. Lightweight, inflatable structures are very attractive in satellite applications. However, the lightweight, flexible and highly damped nature of inflated structures poses difficulties in ground vibration testing. In this study, we show that polyvinylidene fluoride (PVDF) patches and recently developed macro-fiber composite actuators may be used as sensors and actuators in identifying modal parameters. Both smart materials can be integrated unobtrusively into the skin of a torus or space device forming an attractive testing arrangement. The addition of actuators and PVDF sensors to the torus does not significantly interfere with the suspension modes of a free-free boundary condition, and can be considered an integral part of the inflated structure. The results indicate the potential of using smart materials to measure and control the dynamic response of inflated structures", "fulltext": "", "keywords": "satellite applications;thin-film torus;inflated structures;polyvinylidene fluoride patches;boundary condition;dynamic response;pvdf sensors;modal parameters;kapton torus;smart materials;space device;ground vibration testing;macro-fiber composite actuators"}
{"name": "train_925", "title": "A fundamental investigation into large strain recovery of one-way shape memory alloy wires embedded in flexible polyurethanes", "abstract": "Shape memory alloys (SMAs) are being embedded in or externally attached to smart structures because of the large amount of actuation deformation and force that these materials are capable of producing when they are heated. Previous investigations have focused primarily on using single or opposing SMA wires exhibiting the two-way shape memory effect (SME) because of the simplicity with which the repeatable actuation behavior of the structure can be predicted. This repeatable actuation behavior is achieved at the expense of reduced levels of recoverable deformation. Alternatively, many potential smart structure applications will employ multiple SMA wires exhibiting a permanent one-way SME to simplify fabrication and increase the recoverable strains in the structure. To employ the one-way wires, it is necessary to investigate how they affect the recovery of large strains when they are embedded in a structure. In this investigation, the large strain recovery of a one-way SMA wire embedded in a flexible polyurethane is characterized using the novel deformation measurement technique known as digital image correlation. These results are compared with a simple actuation model and a three-dimensional finite element analysis of the structure using the Brinson model for describing the thermomechanical behavior of the SMA. Results indicate that the level of actuation strain in the structure is substantially reduced by the inelastic behavior of the one-way SMA wires, and there are significant differences between the deformations of the matrix material adjacent to the SMA wires and in the region surrounding it. The transformation behavior of the SMA wires was also determined to be volume preserving, which had a significant effect on the transverse strain fields", "fulltext": "", "keywords": "three-dimensional finite element analysis;flexible polyurethanes;embedded sensor;alloy wires;actuation deformation;actuation strain;recoverable strains;smart structures;deformations;strain recovery;transverse strain fields;sma wires;two-way shape memory effect;flexible polyurethane;one-way shape memory;matrix material"}
{"name": "train_926", "title": "Experimental investigation of active vibration control using neural networks", "abstract": "and piezoelectric actuators The use of neural networks for identification and control of smart structures is investigated experimentally. Piezoelectric actuators are employed to suppress the vibrations of a cantilevered plate subject to impulse, sine wave and band-limited white noise disturbances. The neural networks used are multilayer perceptrons trained with error backpropagation. Validation studies show that the identifier predicts the system dynamics accurately. The controller is trained adaptively with the help of the neural identifier. Experimental results demonstrate excellent closed-loop performance and robustness of the neurocontroller", "fulltext": "", "keywords": "piezoelectric actuators;multilayer perceptrons;identification;robustness;error backpropagation;smart structures;cantilevered plate;closed-loop performance;neural networks;white noise disturbances;control;vibration suppression;neurocontroller;active vibration control"}
{"name": "train_927", "title": "Autonomous detection of crack initiation using surface-mounted piezotransducers", "abstract": "In this paper we report on the application of an in situ health monitoring system, comprising an array of piezoceramic wafer elements, to the detection of fatigue degradation in metallic specimens exposed to cyclic loading. Lamb waves, transmitted through a beam test coupon, are sensed using small surface-mounted piezotransducer elements, and the signals are then autonomously analysed for indications relating to the onset of structural degradation. The experimental results confirm the efficacy of the approach and provide a demonstration of good robustness under realistic loading conditions, emphasizing the great potential for developing an automated in situ structural health monitoring system for application to fatigue-prone operational structures, such as aircraft", "fulltext": "", "keywords": "loading conditions;aircraft;robustness;metallic specimens;in situ health monitoring;piezoceramic wafer elements;cyclic loading;lamb waves;automated in situ structural health monitoring;fatigue operational structures;structural degradation;fatigue degradation;surface-mounted piezotransducer elements"}
{"name": "train_928", "title": "Weighted energy linear quadratic regulator vibration control of piezoelectric", "abstract": "composite plates In this paper on finite element linear quadratic regulator (LQR) vibration control of smart piezoelectric composite plates, we propose the use of the total weighted energy method to select the weighting matrices. By constructing the optimal performance function as a relative measure of the total kinetic energy, strain energy and input energy of the system, only three design variables need to be considered to achieve a balance between the desired higher damping effect and lower input cost. Modal control analysis is used to interpret the effects of three energy weight factors on the damping ratios and modal voltages and it is shown that the modal damping effect will increase with the kinetic energy weight factor, approaching square root (2/2) as the strain energy weight factor increases and decrease with the input energy weight factor. Numerical results agree well with those from the modal control analysis. Since the control problem is simplified to three design variables only, the computational cost will be greatly reduced and a more accurate structural control analysis becomes more attractive for large systems", "fulltext": "", "keywords": "total weighted energy;total kinetic energy;weighting matrices;damping effect;numerical results;vibration control;optimal performance function;strain energy weight factor;damping ratios;smart piezoelectric composite plates;modal control analysis;computational cost;strain energy;structural control analysis;finite element linear quadratic regulator"}
{"name": "train_929", "title": "Closed loop finite-element modeling of active constrained layer damping in the", "abstract": "time domain analysis A three-dimensional finite-element closed-loop model has been developed to predict the effects of active-passive damping on a vibrating structure. The Golla-Hughes-McTavish method is employed to capture the viscoelastic material behavior in a time domain analysis. The parametric study includes the different control gains as well as geometric parameters related to the active constrained layer damping (ACLD) treatment. Comparisons are made among several ACLD models, the passive constrained model and the active damping model. The results obtained here reiterate that ACLD is somewhat better for vibration suppression than either the purely passive or the active system and provides higher structural damping with less control gain when compared to the purely active system. Since the ACLD performance can be reduced by the viscoelastic layer, the design of the ACLD model must be given a careful consideration in order to optimize the effect of passive damping", "fulltext": "", "keywords": "active constrained layer damping;golla-hughes-mctavish method;acld models;viscoelastic layer;structural damping;viscoelastic material;time domain analysis;passive constrained model;active damping model;vibration suppression;passive damping;three-dimensional finite-element closed-loop model"}
{"name": "train_93", "title": "Help-desk support is key to wireless success [finance]", "abstract": "A well thought out help desk can make or break an institution's mobile play. Schwab, Ameritrade and RBC are taking their support function seriously", "fulltext": "", "keywords": "ameritrade;schwab;finance;wireless;rbc;help desk"}
{"name": "train_930", "title": "NARX-based technique for the modelling of magneto-rheological damping devices", "abstract": "This paper presents a methodology for identifying variable-structure nonlinear models of magneto-rheological dampers (MRD) and similar devices. Its peculiarity with respect to the mainstream literature is to be especially conceived for obtaining models that are structurally simple, easy to estimate and well suited for model-based control. This goal is pursued by adopting linear-in-the-parameters NARX models, for which an identification method is developed based on the minimization of the simulation error. This method is capable of selecting the model structure together with the parameters, thus it does not require a priori structural information. A set of validation tests is reported, with the aim of demonstrating the technique's efficiency by comparing it to a widely accepted MRD modelling approach", "fulltext": "", "keywords": "identification;narx models;magnetorheological damping;modelling;minimization;validation;simulation error;model-based control;mrd modelling"}
{"name": "train_931", "title": "Active vibration control of composite sandwich beams with piezoelectric", "abstract": "extension-bending and shear actuators We have used quasi-static equations of piezoelectricity to derive a finite element formulation capable of modelling two different kinds of piezoelastically induced actuation in an adaptive composite sandwich beam. This formulation is made to couple certain piezoelectric constants to a transverse electric field to develop extension-bending actuation and shear-induced actuation. As an illustration, we present a sandwich model of three sublaminates: face/core/face. We develop a control scheme based on the linear quadratic regulator/independent modal space control (LQR/IMSC) method and use this to estimate the active stiffness and the active damping introduced by shear and extension-bending actuators. To assess the performance of each type of actuator, a dynamic response study is carried out in the modal domain. We observe that the shear actuator is more efficient in actively controlling the vibration than the extension-bending actuator for the same control effort", "fulltext": "", "keywords": "quasi-static equations;dynamic response;shear actuators;finite element formulation;shear-induced actuation;piezoelastically;transverse electric field;active stiffness;piezoelectric constants;adaptive composite sandwich beam;linear quadratic regulator;modal domain;finite element procedure;sandwich model;piezoelectricity;sublaminates;extension-bending actuation;modal space control;active damping;extension-bending actuators"}
{"name": "train_932", "title": "Modeling of torsional vibration induced by extension-twisting coupling of", "abstract": "anisotropic composite laminates with piezoelectric actuators In this paper we present a dynamic analytical model for the torsional vibration of an anisotropic piezoelectric laminate induced by the extension-twisting coupling effect. In the present approach, we use the Hamilton principle and a reduced bending stiffness method for the derivation of equations of motion. As a result, the in-plane displacements are not involved and the out-of-plane displacement of the laminate is the only quantity to be calculated. Therefore, the proposed method turns the twisting of a laminate with structural coupling into a simplified problem without losing its features. We give analytical solutions of the present model with harmonic excitation. A parametric study is performed to demonstrate the present approach", "fulltext": "", "keywords": "reduced bending stiffness;piezoelectric actuators;hamilton principle;pzt;out-of-plane displacement;structural coupling;twisting;equations of motion;torsional vibration;material anisotropy;in-plane displacements;harmonic excitation;anisotropic piezoelectric laminate;anisotropic composite laminates;extension -twisting coupling;extension-twisting coupling effect;composite laminate;dynamic analytical model;parametric study"}
{"name": "train_933", "title": "Real-time estimations of multi-modal frequencies for smart structures", "abstract": "In this paper, various methods for the real-time estimation of multi-modal frequencies are realized in real time and compared through numerical and experimental tests. These parameter-based frequency estimation methods can be applied to various engineering fields such as communications, radar and adaptive vibration and noise control. Well-known frequency estimation methods are introduced and explained. The Bairstow method is introduced to find the roots of a characteristic equation for estimations of multi-modal frequencies, and the computational efficiency of the Bairstow method is shown quantitatively. For a simple numerical test, we consider two sinusoids of the same amplitudes mixed with various amounts of white noise. The test results show that the auto regressive (AR) and auto regressive and moving average (ARMA) methods are unsuitable in noisy environments. The other methods apart from the AR method have fast tracking capability. From the point of view of computational efficiency, the results reveal that the ARMA method is inefficient, while the cascade notch filter method is very effective. The linearized adaptive notch filter and recursive maximum likelihood methods have average performances. Experimental tests are devised to confirm the feasibility of real-time computations and to impose the severe conditions of drastically different amplitudes and of considerable changes of natural frequencies. We have performed experiments to extract the natural frequencies from the vibration signal of wing-like composite plates in real time. The natural frequencies of the specimen are changed by added masses. Especially, the AR method exhibits a remarkable performance in spite of the severe conditions. This study will be helpful to anyone who needs a frequency estimation algorithm for real-time applications", "fulltext": "", "keywords": "multi-modal frequencies;characteristic equation;real-time estimation;real-time computations;frequency estimation;linearized adaptive notch filter;arma;wing-like composite plates;smart structures;auto regressive and moving average methods;bairstow method;frequency estimation algorithm;cascade notch filter;noise control;real-time applications;vibration signal;adaptive vibration control;recursive maximum likelihood methods"}
{"name": "train_934", "title": "Induced-shear piezoelectric actuators for rotor blade trailing edge flaps", "abstract": "Much of the current rotorcraft research is focused on improving performance by reducing unwanted helicopter noise and vibration. One of the most promising active rotorcraft vibration control systems is an active trailing edge flap. In this paper, an induced-shear piezoelectric tube actuator is used in conjunction with a simple lever-cusp hinge amplification device to generate a useful combination of trailing edge flap deflections and hinge moments. A finite-element model of the actuator tube and trailing edge flap (including aerodynamic and inertial loading) was used to guide the design of the actuator-flap system. A full-scale induced shear tube actuator flap system was fabricated and bench top testing was conducted to validate the analysis. Hinge moments corresponding to various rotor speeds were applied to the actuator using mechanical springs. The testing demonstrated that for an applied electric field of 3 kV cm/sup -1/ the tube actuator deflected a representative full-scale 12 inch flap +or-2.8 degrees at 0 rpm and +or-1.4 degrees for a hinge moment simulating a 400 rpm condition. The per cent error between the predicted and experimental full-scale flap deflections ranged from 4% (low rpm) to 12.5% (large rpm). Increasing the electric field to 4 kV cm/sup -1/ results in +or-2.5 degrees flap deflection at a rotation speed of 400 rpm, according to the design analysis. A trade study was conducted to compare the performance of the piezoelectric tube actuator to the state of the art in trailing edge flap actuators and indicated that the induced-shear tube actuator shows promise as a trailing edge flap actuator", "fulltext": "", "keywords": "finite-element model;vibration control;shear tube actuator flap;aerodynamic loading;inertial loading;12 inch flap;piezoelectric tube actuator;helicopter vibration;helicopter noise;design;active trailing edge flap;12 inch;bench top testing;induced-shear tube actuator;lever-cusp hinge amplification device;rotorcraft"}
{"name": "train_935", "title": "Experimental feedforward and feedback control of a one-dimensional SMA", "abstract": "composite The control of embedded shape memory alloy (SMA) actuators has recently become a topic of interest in the field of smart structures. The inherent difficulties associated with SMA actuators has resulted in a variety of approaches. Homogenization provides a simplified, yet mathematically rigorous, method of determining average stress and strain fields in a composite. A modified constitutive model is presented based on experimental results demonstrating the inability of most simple phenomenological models to capture the effective behavior of SMAs during thermal activation. A feedforward controller is presented for a SMA composite based on the homogenization of a modified phenomenological model for SMAs in a linear matrix", "fulltext": "", "keywords": "homogenization;sma actuators;smart structures;embedded shape memory alloy;linear matrix;sma;thermal activation;models"}
{"name": "train_936", "title": "Resonant controllers for smart structures", "abstract": "In this paper we propose a special type of colocated feedback controller for smart structures. The controller is a parallel combination of high-Q resonant circuits. Each of the resonant circuits is tuned to a pole (or the resonant frequency) of the smart structure. It is proven that the parallel combination of resonant controllers is stable with an infinite gain margin. Only one set of actuator-sensor can damp multiple resonant modes with the resonant controllers. Experimental results are presented to show the robustness of the proposed controller in damping multimode resonances", "fulltext": "", "keywords": "damping;actuator-sensor;multiple resonant modes;feedback controller;smart structure;smart structures;resonant frequency;multimode resonances;laminate beam;high-q resonant circuits"}
{"name": "train_937", "title": "Use of neural networks in the analysis of particle size distribution by laser", "abstract": "diffraction: tests with different particle systems The application of forward light scattering methods for estimating the particle size distribution (PSD) is usually limited by the occurrence of multiple scattering, which affects the angular distribution of light in highly concentrated suspensions, thus resulting in false calculations by the conventionally adopted algorithms. In this paper, a previously proposed neural network-based method is tested with different particle systems, in order to evaluate its applicability. In the first step of the study, experiments were carried out with solid-liquid suspensions having different characteristics of particle shape and size distribution, under varying solid concentrations. The experimental results, consisting of the angular distribution of light intensity, particle shape and suspension concentration, were used as input data in the fitting of neural network models (NN) that replaced the optical model to provide the PSD. The reference values of particle shape and PSD for the NN fitting were based on image analysis. Comparisons between the PSD values computed by the NN model and the reference values indicate that the method can be used in monitoring the PSD of particles with different shapes in highly concentrated suspensions, thus extending the range of application of forward laser diffraction to a number of systems with industrial interest", "fulltext": "", "keywords": "angular distribution of light;fraunhofer optical model;particle shape distribution;solid-liquid suspensions;fluidized catalytic cracking;particle size distribution;laser diffraction;multiple scattering;pattern recognition;powdered materials;forward light scattering;neural network modeling;backpropagation algorithm;image analysis"}
{"name": "train_938", "title": "Fast accurate MEG source localization using a multilayer perceptron trained", "abstract": "with real brain noise Iterative gradient methods such as Levenberg-Marquardt (LM) are in widespread use for source localization from electroencephalographic (EEG) and magnetoencephalographic (MEG) signals. Unfortunately, LM depends sensitively on the initial guess, necessitating repeated runs. This, combined with LM's high per-step cost, makes its computational burden quite high. To reduce this burden, we trained a multilayer perceptron (MLP) as a realtime localizer. We used an analytical model of quasistatic electromagnetic propagation through a spherical head to map randomly chosen dipoles to sensor activities according to the sensor geometry of a 4D Neuroimaging Neuromag-122 MEG system, and trained a MLP to invert this mapping in the absence of noise or in the presence of various sorts of noise such as white Gaussian noise, correlated noise, or real brain noise. A MLP structure was chosen to trade off computation and accuracy. This MLP was trained four times, with each type of noise. We measured the effects of initial guesses on LM performance, which motivated a hybrid MLP-start-LM method, in which the trained MLP initializes LM. We also compared the localization performance of LM, MLPs, and hybrid MLP-start-LMs for realistic brain signals. Trained MLPs are much faster than other methods, while the hybrid MLP-start-LMs are faster and more accurate than fixed-4-start-LM. In particular, the hybrid MLP-start-LM initialized by a MLP trained with the real brain noise dataset is 60 times faster and is comparable in accuracy to random-20-start-LM, and this hybrid system (localization error: 0.28 cm, computation time: 36 ms) shows almost as good performance as optimal-1-start-LM (localization error: 0.23 cm, computation time: 22 ms), which initializes LM with the correct dipole location. MLPs trained with noise perform better than the MLP trained without noise, and the MLP trained with real brain noise is almost as good an initial guesser for LM as the correct dipole location", "fulltext": "", "keywords": "real brain noise;iterative gradient methods;meg source localization;multilayer perceptron;forward model;levenberg-marquardt method;quasistatic electromagnetic propagation;spherical head;correlated noise;fast accurate localization;computation accuracy;analytical model;real-time localizer;white gaussian noise"}
{"name": "train_939", "title": "Image reconstruction from fan-beam projections on less than a short scan", "abstract": "This work is concerned with 2D image reconstruction from fan-beam projections. It is shown that exact and stable reconstruction of a given region-of-interest in the object does not require all lines passing through the object to be measured. Complete (non-truncated) fan-beam projections provide sufficient information for reconstruction when 'every line passing through the region-of-interest intersects the vertex path in a non-tangential way'. The practical implications of this condition are discussed and a new filtered-backprojection algorithm is derived for reconstruction. Experiments with computer-simulated data are performed to support the mathematical results", "fulltext": "", "keywords": "region-of-interest;x-ray computed tomography;exact stable reconstruction;fan-beam projections;vertex path;3d head phantom;2d image reconstruction;convolution;short-scan condition;radon transform;linear interpolation;rebinning formula;hilbert transform;filtered-backprojection algorithm"}
{"name": "train_94", "title": "Gearing up for CLS bank", "abstract": "Continuous-Linked Settlement, a dream of the foreign-exchange community for years, may finally become a reality by the end of 2002", "fulltext": "", "keywords": "foreign-exchange;continuous-linked settlement"}
{"name": "train_940", "title": "Tools for the analysis of dose optimization. I. Effect-volume histogram", "abstract": "With the advent of dose optimization algorithms, predominantly for intensity-modulated radiotherapy (IMRT), computer software has progressed beyond the point of being merely a tool at the hands of an expert and has become an active, independent mediator of the dosimetric conflicts between treatment goals and risks. To understand and control the internal decision finding as well as to provide means to influence it, a tool for the analysis of the dose distribution is presented which reveals the decision-making process performed by the algorithm. The internal trade-offs between partial volumes receiving high or low doses are driven by functions which attribute a weight to each volume element. The statistics of the distribution of these weights is cast into an effect-volume histogram (EVH) in analogy to dose-volume histograms. The analysis of the EVH reveals which traits of the optimum dose distribution result from the defined objectives, and which are a random consequence of under- or misspecification of treatment goals. The EVH can further assist in the process of finding suitable objectives and balancing conflicting objectives. If biologically inspired objectives are used, the EVH shows the distribution of local dose effect relative to the prescribed level", "fulltext": "", "keywords": "insufficient target coverage;exponential law;treatment goals;one-sided quadratic penalties;low doses;objective function;dose optimization algorithms;treatment risks;treatment planning;quadratic overdose penalty;decision-making process;effect-volume histogram;cell survival;computer software;partial volumes;volume element weights;intensity-modulated radiotherapy;high doses;dosimetric conflicts"}
{"name": "train_941", "title": "Option pricing formulas based on a non-Gaussian stock price model", "abstract": "Options are financial instruments that depend on the underlying stock. We explain their non-Gaussian fluctuations using the nonextensive thermodynamics parameter q. A generalized form of the Black-Scholes (BS) partial differential equation (1973) and some closed-form solutions are obtained. The standard BS equation (q = 1) which is used by economists to calculate option prices requires multiple values of the stock volatility (known as the volatility smile). Using q = 1.5 which well models the empirical distribution of returns, we get a good description of option prices using a single volatility", "fulltext": "", "keywords": "stock volatility;nongaussian stock price model;black-scholes partial differential equation;closed-form solutions;volatility smile;option pricing formulas;financial instruments;empirical distribution;nonextensive thermodynamics parameter"}
{"name": "train_942", "title": "Micro-optical realization of arrays of selectively addressable dipole traps: a", "abstract": "scalable configuration for quantum computation with atomic qubits We experimentally demonstrate novel structures for the realization of registers of atomic qubits: We trap neutral atoms in one- and two-dimensional arrays of far-detuned dipole traps obtained by focusing a red-detuned laser beam with a microfabricated array of microlenses. We are able to selectively address individual trap sites due to their large lateral separation of 125 mu m. We initialize and read out different internal states for the individual sites. We also create two interleaved sets of trap arrays with adjustable separation, as required for many proposed implementations of quantum gate operations", "fulltext": "", "keywords": "neutral atoms;quantum computation;scalable configuration;far-detuned dipole traps;internal states;microfabricated array;atomic qubits;registers;red-detuned laser beam;microlenses;quantum gate operations"}
{"name": "train_943", "title": "Implementation of universal quantum gates based on nonadiabatic geometric", "abstract": "phases We propose an experimentally feasible scheme to achieve quantum computation based on nonadiabatic geometric phase shifts, in which a cyclic geometric phase is used to realize a set of universal quantum gates. Physical implementation of this set of gates is designed for Josephson junctions and for NMR systems. Interestingly, we find that the nonadiabatic phase shift may be independent of the operation time under appropriate controllable conditions. A remarkable feature of the present nonadiabatic geometric gates is that there is no intrinsic limitation on the operation time", "fulltext": "", "keywords": "nonadiabatic geometric phase shifts;quantum computation;josephson junctions;nmr systems;nonadiabatic geometric gates;operation time;universal quantum gates;cyclic geometric phase;nonadiabatic phase shift"}
{"name": "train_944", "title": "Conditions for the local manipulation of Gaussian states", "abstract": "We present a general necessary and sufficient criterion for the possibility of a state transformation from one mixed Gaussian state to another of a bipartite continuous-variable system with two modes. The class of operations that will be considered is the set of local Gaussian completely positive trace-preserving maps", "fulltext": "", "keywords": "bipartite continuous-variable system;quantum information theory;local manipulation;trace-preserving maps;gaussian states;state transformation"}
{"name": "train_945", "title": "Testing statistical bounds on entanglement using quantum chaos", "abstract": "Previous results indicate that while chaos can lead to substantial entropy production, thereby maximizing dynamical entanglement, this still falls short of maximality. Random matrix theory modeling of composite quantum systems, investigated recently, entails a universal distribution of the eigenvalues of the reduced density matrices. We demonstrate that these distributions are realized in quantized chaotic systems by using a model of two coupled and kicked tops. We derive an explicit statistical universal bound on entanglement, which is also valid for the case of unequal dimensionality of the Hilbert spaces involved, and show that this describes well the bounds observed using composite quantized chaotic systems such as coupled tops", "fulltext": "", "keywords": "statistical bounds;entropy production;hilbert spaces;kicked tops;random matrix theory;maximality;quantized chaotic systems;universal distribution;entanglement;reduced density matrices;composite quantum systems;quantum chaos"}
{"name": "train_946", "title": "Entanglement measures with asymptotic weak-monotonicity as lower (upper) bound", "abstract": "for the entanglement of cost (distillation) We propose entanglement measures with asymptotic weak-monotonicity. We show that a normalized form of entanglement measures with the asymptotic weak-monotonicity are lower (upper) bound for the entanglement of cost (distillation)", "fulltext": "", "keywords": "entanglement of cost;asymptotic weak-monotonicity;distillation;entanglement measures"}
{"name": "train_947", "title": "The fully entangled fraction as an inclusive measure of entanglement", "abstract": "applications Characterizing entanglement in all but the simplest case of a two qubit pure state is a hard problem, even understanding the relevant experimental quantities that are related to entanglement is difficult. It may not be necessary, however, to quantify the entanglement of a state in order to quantify the quantum information processing significance of a state. It is known that the fully entangled fraction has a direct relationship to the fidelity of teleportation maximized under the actions of local unitary operations. In the case of two qubits we point out that the fully entangled fraction can also be related to the fidelities, maximized under the actions of local unitary operations, of other important quantum information tasks such as dense coding, entanglement swapping and quantum cryptography in such a way as to provide an inclusive measure of these entanglement applications. For two qubit systems the fully entangled fraction has a simple known closed-form expression and we establish lower and upper bounds of this quantity with the concurrence. This approach is readily extendable to more complicated systems", "fulltext": "", "keywords": "teleportation;fully entangled fraction;two qubit pure state;fidelity;quantum cryptography;entanglement;quantum information processing;entanglement swapping"}
{"name": "train_948", "title": "Pairwise thermal entanglement in the n-qubit (n <or= 5) Heisenberg XX chain", "abstract": "We have calculated the concurrence of the pairwise thermal entanglement for the four-qubit and five-qubit Heisenberg XX chain. It is found that there is a great difference between the even-qubit and the odd-qubit chain in the aspect of the critical temperature and of the existence of the entanglement for the case of the qubit number n no more than 5", "fulltext": "", "keywords": "five-qubit heisenberg xx chain;four-qubit heisenberg xx chain;pairwise thermal entanglement;even-qubit chain;critical temperature;odd-qubit chain"}
{"name": "train_949", "title": "Reply to \"Comment on: Teleportation of an unknown state by W state\" [Phys.", "abstract": "Lett. A 300 (2002) 324] In our letter (see ibid., vol. 296, p. 161 (2002)), the main question we consider is whether a general three-particle W state can be used to realize the teleportation of an unknown qubit state. We give the positive answer to this question in our letter, and show that W state can be used to realize to do that probabilistically. We also discuss how to do it in detail in our letter. In the previous comment (see ibid., vol. 300, p. 324 (2002)), authors check carefully the mathematics calculation of our letter, find and point out a simple mathematics error about normalization coefficient of Eq. (1). This mathematics error induces the incorrect probability calculation of Eq. (6), and also an incorrect claim in first part of our letter", "fulltext": "", "keywords": "teleportation;three-particle w state;qubit state;unknown state;probability calculation;normalization coefficient"}
{"name": "train_95", "title": "SIA shelves T+1 decision till 2004", "abstract": "The Securities Industry Association has decided that a move to T+1 is more than the industry can handle right now. STP, however, will remain a focus", "fulltext": "", "keywords": "t+1;securities industry association;straight-through-processing"}
{"name": "train_950", "title": "Quantum sensitive dependence", "abstract": "Wave functions of bounded quantum systems with time-independent potentials, being almost periodic functions, cannot have time asymptotics as in classical chaos. However, bounded quantum systems with time-dependent interactions, as used in quantum control, may have continuous spectrum and the rate of growth of observables is an issue of both theoretical and practical concern. Rates of growth in quantum mechanics are discussed by constructing quantities with the same physical meaning as those involved in the classical Lyapunov exponent. A generalized notion of quantum sensitive dependence is introduced and the mathematical structure of the operator matrix elements that correspond to different types of growth is characterized", "fulltext": "", "keywords": "classical chaos;quantum complexity;classical lyapunov exponent;time-independent potentials;time-dependent interactions;operator matrix elements;periodic functions;quantum control;quantum sensitive dependence;wave functions;bounded quantum systems;time asymptotics"}
{"name": "train_951", "title": "How to drive strategic innovation [law firms]", "abstract": "Innovation. It has everything to do with organization and attitude. Marginal improvement isn't enough anymore. Convert your problem-solving skills into a new value for the entire firm. 10 initiatives", "fulltext": "", "keywords": "change;strategic innovation;law firms;management;clients;experiments"}
{"name": "train_953", "title": "Take it to the next level [law firm innovation]", "abstract": "It's called innovating. Our clients do it. Our culture worships it. Our future hinges on it. Why is it so difficult in law firms? How can we make it easier? Viva la difference!", "fulltext": "", "keywords": "law firms;innovation"}
{"name": "train_954", "title": "Caring for your new lawyers", "abstract": "In any given year, a striking number of lawyers are in a state of flux, from newly minted law school graduates looking for their first job, to senior litigators migrating to new challenges with new firms. The one certainty is that lawyers new to any firm need care and feeding in myriad ways. All of them need to know and understand three things: (1) the firm's culture; (2) the resources available to help them develop their practices; and (3) where to get help and guidance for research and practice purposes. Obtaining a thorough understanding of a new firm's workings may be the greatest research project lawyers face. How can a firm help its new lawyers learn what they need to know? To offer an example, here are programs in place at my firm", "fulltext": "", "keywords": "resources;firm's culture;new lawyers"}
{"name": "train_955", "title": "From the DOS dog days to e-filing [law firms]", "abstract": "The poster child for a successful e-filing venture is the Case Management and Electronic Case File system now rolling through the district and bankruptcy courts. A project of the Administrative Office of the United States Courts, CM/ECF is a loud proponent of the benefits of the PDF approach and it has a full head of steam. Present plans are for all federal courts to implement CM/ECF by 2005. That means a radical shift in methodology and tools for a lot of lawyers. It also means that you should get cozy with Acrobat real soon", "fulltext": "", "keywords": "pdf;adobe acrobat;united states courts;case management and electronic case file system;e-filing"}
{"name": "train_956", "title": "Do you see what I see? [visual technology in law firms]", "abstract": "Think of how well-done computer presentations can aid in the learning experience. They are, however, less common in client meetings, settlement conferences and the courtroom. And you have to wonder why, when the same benefits of attention focus and visual learning apply in those legal communication settings. The software and hardware components are easy to use, and they're increasingly affordable to boot. The next time you need to convey a point to an audience (be it one person or many), think of how you might benefit from the visual impact available through presentation software like PowerPoint. Anyone will understand you more easily when assisted by visual input, and it may make all the difference in reaching visual-focused learners", "fulltext": "", "keywords": "law firms;computer presentations;visual technology;powerpoint"}
{"name": "train_957", "title": "A Blog in every law firm?", "abstract": "You don't know today what you'll want to know next year. Rather than trying to solve that problem, focus on providing simple tools to users that create valuable content across the firm. Individual contributions will be more visible, and you will have a searchable archive of your institutional memory and a simplified process for ensuring everyone is up to speed. Whether you embrace weblogs for their individual or institutional benefits, one thing is certain: They will become powerful tools for those who seek ways to more efficiently and intelligently manage information", "fulltext": "", "keywords": "web site;law firm;institutional memory;weblogs"}
{"name": "train_958", "title": "Efficient combinational verification using overlapping local BDDs and a hash", "abstract": "table We propose a novel methodology that combines local BDDs (binary decision diagrams) with a hash table for very efficient verification of combinational circuits. The main purpose of this technique is to remove the considerable overhead associated with case-by-case verification of internal node pairs in typical internal correspondence based verification methods. Two heuristics based on the number of structural levels of circuitry looked at and the total number of nodes in the BDD manager are used to control the BDD sizes and introduce new cutsets based on already found equivalent nodes. We verify the ISCAS85 benchmark circuits and demonstrate significant speedup over existing methods. We also verify several hard industrial circuits and show our superiority in extracting internal equivalences", "fulltext": "", "keywords": "internal node pairs;bdd sizes;formal verification;cutsets;overlapping local bdds;internal equivalences;bdd manager;hash table;combinational verification;iscas85 benchmark circuits;binary decision diagrams;structural levels;combinational circuit verification;hard industrial circuits;heuristics;internal correspondence-based verification;internal correspondence based verification;case-by-case verification"}
{"name": "train_959", "title": "Silicon debug of a PowerPC TM microprocessor using model checking", "abstract": "When silicon is available, newly designed microprocessors are tested in specially equipped hardware laboratories, where real applications can be run at hardware speeds. However, the large volumes of code being run, plus the limited access to the internal nodes of the chip, make it very difficult to characterize the nature of any failures that occur. We describe how temporal logic model checking was used to quickly characterize a design error exhibited during hardware testing of a PowerPC microprocessor. We outline the conditions under which model checking can efficiently characterize such failures, and show how the particular error we detected could have been revealed early in the design cycle, by model checking a short and simple correctness specification. We discuss the implications of this for verification methodologies over the full design cycle", "fulltext": "", "keywords": "model checking;circuit design error;hardware testing;verification methodologies;correctness specification;computation tree logic;powerpc microprocessor;circuit debugging;temporal logic"}
{"name": "train_96", "title": "OMS battle heating up as Chicago Equity ousts LongView for Macgregor", "abstract": "Chicago Equity Partners LLC has gone into full production with Macgregor's Financial Trading Platform. This marks a concentrated effort to achieve straight-through processing", "fulltext": "", "keywords": "straight-through processing;longview;macgregor;financial trading platform;chicago equity partners"}
{"name": "train_960", "title": "Bisimulation minimization and symbolic model checking", "abstract": "State space minimization techniques are crucial for combating state explosion. A variety of explicit-state verification tools use bisimulation minimization to check equivalence between systems, to minimize components before composition, or to reduce a state space prior to model checking. Experimental results on bisimulation minimization in symbolic model checking contexts, however, are mixed. We explore bisimulation minimization as an optimization in symbolic model checking of invariance properties. We consider three bisimulation minimization algorithms. From each, we produce a BDD-based model checker for invariant properties and compare this model checker to a conventional one based on backwards reachability. Our comparisons, both theoretical and experimental, suggest that bisimulation minimization is not viable in the context of invariance verification, because performing the minimization requires as many, if not more, computational resources as model checking the unminimized system through backwards reachability", "fulltext": "", "keywords": "experimental results;state space minimization techniques;binary decision diagram;invariance properties;invariance verification;optimization;explicit-state verification tools;bisimulation minimization;state explosion;backwards reachability;symbolic model checking;bdd"}
{"name": "train_961", "title": "Modular and visual specification of hybrid systems: an introduction to HyCharts", "abstract": "Visual description techniques are particularly important for the design of hybrid systems, because specifications of such systems usually have to be discussed between engineers from a number of different disciplines. Modularity is vital for hybrid systems not only because it allows to handle large systems, but also because it permits to think in terms of components, which is familiar to engineers. Based on two different interpretations for hierarchic graphs and on a clear hybrid computation model, we develop HyCharts. HyCharts consist of two modular visual formalisms, one for the specification of the architecture and one for the specification of the behavior of hybrid systems. The operators on hierarchic graphs enable us to give a surprisingly simple denotational semantics for many concepts known from statechart-like formalisms. Due to a very general composition operator, HyCharts can easily be composed with description techniques from other engineering disciplines. Such heterogeneous system specifications seem to be particularly appropriate for hybrid systems because of their interdisciplinary character", "fulltext": "", "keywords": "visual description techniques;visual specification;hycharts;hierarchic graphs;hybrid computation model;modular specification;hybrid systems;heterogeneous system specifications;statechart;formal specification;denotational semantics;components"}
{"name": "train_962", "title": "Optimal control using the transport equation: the Liouville machine", "abstract": "Transport theory describes the scattering behavior of physical particles such as photons. Here we show how to connect this theory to optimal control theory and to adaptive behavior of agents embedded in an environment. Environments and tasks are defined by physical boundary conditions. Given some task, we compute a set of probability densities on continuous state and action and time. From these densities we derive an optimal policy such that for all states the most likely action maximizes the probability of reaching a predefined goal state. Liouville's conservation theorem tells us that the conditional density at time t, state s, and action a must equal the density at t + dt, s + ds, a + da. Discretization yields a linear system that can be solved directly and whose solution corresponds to an optimal policy. Discounted reward schemes are incorporated naturally by taking the Laplace transform of the equations. The Liouville machine quickly solves rather complex maze problems", "fulltext": "", "keywords": "optimal control;liouville machine;transport equation;physical particles;embedded agents;scattering behavior;adaptive behavior"}
{"name": "train_963", "title": "A computational model of learned avoidance behavior in a one-way avoidance", "abstract": "experiment We present a computational model of learned avoidance behavior in a one-way avoidance experiment. Our model employs the reinforcement learning paradigm and a temporal-difference algorithm to implement both classically conditioned and instrumentally conditioned components. The role of the classically conditioned component is to develop an expectation of future benefit that is a function of the learning system's state and action. Competition among the instrumentally conditioned components determines the overt behavior generated by the learning system. Our model displays, in simulation, the reduced latency of the avoidance behavior during learning with continuing trials and the resistance to extinction of the avoidance response. These results are consistent with experimentally observed animal behavior. Our model extends the traditional two-process learning mechanism of Mowrer (1947) by explicitly defining the mechanisms of proprioceptive feedback, an internal clock, and generalization over the action space", "fulltext": "", "keywords": "reinforcement learning;reduced latency;internal clock;animal behavior;computational model;traditional two-process learning mechanism;proprioceptive feedback;temporal-difference algorithm;instrumentally conditioned components;classically conditioned components;one-way avoidance experiment;learned avoidance behavior"}
{"name": "train_964", "title": "Modeling group foraging: individual suboptimality, interference, and a kind of", "abstract": "matching A series of agent-based models support the hypothesis that behaviors adapted to a group situation may be suboptimal (or \"irrational\") when expressed by an isolated individual. These models focus on two areas of current concern in behavioral ecology and experimental psychology: the \"interference function\" (which relates the intake rate of a focal forager to the density of conspecifics) and the \"matching law\" (which formalizes the observation that many animals match the frequency of their response to different stimuli in proportion to the reward obtained from each stimulus type). Each model employs genetic algorithms to evolve foraging behaviors for multiple agents in spatially explicit environments, structured at the level of situated perception and action. A second concern of the article is to extend the understanding of both matching and interference per se by modeling at this level", "fulltext": "", "keywords": "group foraging;group situation;individual suboptimality;suboptimal behavior;interference function;multiple agents;focal forager;genetic algorithms;situated action;behavioral ecology;matching law;agent-based models;experimental psychology;spatially explicit environments;situated perception;isolated individual"}
{"name": "train_965", "title": "Sliding mode control of chaos in the cubic Chua's circuit system", "abstract": "In this paper, a sliding mode controller is applied to control the cubic Chua's circuit system. The sliding surface of this paper used is one dimension higher than the traditional surface and guarantees its passage through the initial states of the controlled system. Therefore, using the characteristic of this sliding mode we aim to design a controller that can meet the desired specification and use less control energy by comparing with the result in the current existing literature. The results show that the proposed controller can steer Chua's circuit system to the desired state without the chattering phenomenon and abrupt state change", "fulltext": "", "keywords": "cubic chua circuit system;chaos;state change;chattering;sliding mode control;mismatch disturbance;sliding surface;match disturbance"}
{"name": "train_966", "title": "Controlling in between the Lorenz and the Chen systems", "abstract": "This letter investigates a new chaotic system and its role as a joint function between two complex chaotic systems, the Lorenz and the Chen systems, using a simple variable constant controller. With the gradual tuning of the controller, the controlled system evolves from the canonical Lorenz attractor to the Chen attractor through the new transition chaotic attractor. This evolving procedure reveals the forming mechanisms of all similar and closely related chaotic systems, and demonstrates that a simple control technique can be very useful in generating and analyzing some complex chaotic dynamical phenomena", "fulltext": "", "keywords": "chen attractors;chen system;transition chaotic attractor;lorenz system;tuning;lorenz attractor"}
{"name": "train_967", "title": "On the relationship between parametric variation and state feedback in chaos", "abstract": "control In this Letter, we study the popular parametric variation chaos control and state-feedback methodologies in chaos control, and point out for the first time that they are actually equivalent in the sense that there exist diffeomorphisms that can convert one to the other for most smooth chaotic systems. Detailed conversions are worked out for typical discrete chaotic maps (logistic, Henon) and continuous flows (Rossler, Lorenz) for illustration. This unifies the two seemingly different approaches from the physics and the engineering communities on chaos control. This new perspective reveals some new potential applications such as chaos synchronization and normal form analysis from a unified mathematical point of view", "fulltext": "", "keywords": "rossler system;state-feedback;continuous flows;diffeomorphisms;logistic;henon map;lorenz system;parametric variation;chaos control"}
{"name": "train_968", "title": "Stabilization of global invariant sets for chaotic systems: an energy based", "abstract": "control approach This paper presents a new control approach for steering trajectories of three-dimensional nonlinear chaotic systems towards stable stationary states or time-periodic orbits. The proposed method mainly consists in a sliding mode-based control design that is extended by an explicit consideration of system energy as basis for both controller design and system stabilization. The control objective is then to regulate the energy with respect to a shaped nominal representation implicitly related to system trajectories. In this paper, we establish some theoretical results to introduce the control design approach referred to as energy based sliding mode control. Then, some capabilities of the proposed approach are illustrated through examples related to the chaotic circuit of Chua", "fulltext": "", "keywords": "time-periodic orbits;sliding mode-based control;stable stationary states;three-dimensional nonlinear chaotic systems;chua's circuit;global invariant sets;energy based sliding mode control"}
{"name": "train_969", "title": "Controlled projective synchronization in nonpartially-linear chaotic systems", "abstract": "Projective synchronization (PS), in which the state vectors synchronize up to a scaling factor, is usually observable only in partially linear systems. We show that PS could, by means of control, be extended to general classes of chaotic systems with nonpartial linearity. Performance of PS may also be manipulated by controlling the scaling factor to any desired value. In numerical experiments, we illustrate the applications to a Rossler system and a Chua's circuit. The feasibility of the control for high dimensional systems is demonstrated in a hyperchaotic system", "fulltext": "", "keywords": "rossler system;projective synchronization;hyperchaotic system;chua's circuit;scaling factor;nonpartially-linear chaotic systems;control"}
{"name": "train_97", "title": "Philadelphia stock exchange taps TimesTen for database technology", "abstract": "PHLX rolls out Equity Options AutoQuote System to traders as the first application to leverage its enhanced data architecture", "fulltext": "", "keywords": "data architecture;timesten;philadelphia stock exchange;equity options autoquote system"}
{"name": "train_970", "title": "Complex dynamics in nearly symmetric three-cell cellular neural networks", "abstract": "The paper introduces a class of third-order nonsymmetric Cellular Neural Networks (CNNs), and shows through computer simulations that they undergo a cascade of period doubling bifurcations which leads to the birth of a large-size complex attractor. A major point is that these bifurcations and complex dynamics happen in a small neighborhood of a particular CNN with a symmetric interconnection matrix", "fulltext": "", "keywords": "neuron interconnection matrix;stable limit cycles;nearly symmetric three-cell cellular neural networks;robustness;period doubling bifurcations;symmetric interconnection matrix;perturbations;complete stability;complex dynamics;large-size complex attractor;differential equations;cnn"}
{"name": "train_971", "title": "Homogenization in L/sup infinity /", "abstract": "Homogenization of deterministic control problems with L/sup infinity / running cost is studied by viscosity solutions techniques. It is proved that the value function of an L/sup infinity / problem in a medium with a periodic micro-structure converges uniformly on the compact sets to the value function of the homogenized problem as the period shrinks to 0. Our main convergence result extends that of Ishii (Stochastic Analysis, control, optimization and applications, pp. 305-324, Birkhauser Boston, Boston, MA, 1999.) to the case of a discontinuous Hamiltonian. The cell problem is solved, but, as nonuniqueness occurs, the effective Hamiltonian must be selected in a careful way. The paper also provides a representation formula for the effective Hamiltonian and gives illustrations to calculus of variations, averaging and one-dimensional problems", "fulltext": "", "keywords": "optimal control;homogenization;value function;calculus of variations;cell problem;deterministic control;convergence;averaging;l/sup infinity / running cost"}
{"name": "train_972", "title": "VoIP: leveraging existing cable architecture", "abstract": "As operators prepare to enter the voice-over-IP fray, they are searching for ways to leverage their existing two-way, interactive infrastructure. There are several approaches for supporting VoIP on top of the core IP transport network. The one garnering the most interest, especially in the United States, is based on the PacketCable 1.x architecture. This article discusses the PacketCable-based approach", "fulltext": "", "keywords": "voip;packetcable 1.x architecture;core ip transport network;two-way interactive infrastructure;cable architecture;voice-over-ip;united states;packetcable-based approach"}
{"name": "train_973", "title": "Time-integration of multiphase chemistry in size-resolved cloud models", "abstract": "The existence of cloud drops leads to a transfer of chemical species between the gas and aqueous phases. Species concentrations in both phases are modified by chemical reactions and by this phase transfer. The model equations resulting from such multiphase chemical systems are nonlinear, highly coupled and extremely stiff. In the paper we investigate several numerical approaches for treating such processes. The droplets are subdivided into several classes. This decomposition of the droplet spectrum into classes is based on their droplet size and the amount of scavenged material inside the drops, respectively. The very fast dissociations in the aqueous phase chemistry are treated as forward and backward reactions. The aqueous phase and gas phase chemistry, the mass transfer between the different droplet classes among themselves and with the gas phase are integrated in an implicit and coupled manner by the second order BDF method. For this part we apply a modification of the code LSODE with special linear system solvers. These direct sparse techniques exploit the special block structure of the corresponding Jacobian. Furthermore we investigate an approximate matrix factorization which is related to operator splitting at the linear algebra level. The sparse Jacobians are generated explicitly and stored in a sparse form. The efficiency and accuracy of our time-integration schemes is discussed for four multiphase chemistry systems of different complexity and for a different number of droplet classes", "fulltext": "", "keywords": "multiphase chemical systems;chemical species;approximate matrix factorization;sparse jacobians;cloud drops;time-integration schemes;aqueous phase chemistry;multiphase chemistry;size-resolved cloud models;gas phase chemistry;air pollution modelling;linear algebra;operator splitting;chemical reactions"}
{"name": "train_974", "title": "Extrapolation in Lie groups with approximated BCH-formula", "abstract": "We present an extrapolation algorithm for the integration of differential equations in Lie groups which is a suitable generalization of the well-known GBS-algorithm for ODEs. Sufficiently accurate approximations to the BCH-formula are required to reach a given order. We give such approximations with a minimized number of commutators", "fulltext": "", "keywords": "geometric integration;extrapolation methods;approximated bch-formula;differential equations;lie groups;gbs-algorithm"}
{"name": "train_975", "title": "Algebraic conditions for high-order convergent deferred correction schemes", "abstract": "based on Runge-Kutta-Nystrom methods for second order boundary value problems In [T. Van Hecke, M. Van Daele, J. Comp. Appl. Math., vol. 132, p. 107-125, (2001)] the investigation of high-order convergence of deferred correction schemes for the numerical solution of second order nonlinear two-point boundary value problems not containing the first derivative, is made. The derivation of the algebraic conditions to raise the increase of order by the deferred correction scheme was based on Taylor series expansions. In this paper we describe a more elegant way by means of P-series to obtain this necessary conditions and generalize this idea to equations of the form y\" = f (t, y, y')", "fulltext": "", "keywords": "second order boundary value problems;high-order convergent deferred correction schemes;second order nonlinear two-point boundary value problems;runge-kutta-nystrom methods;algebraic conditions;deferred correction schemes;taylor series expansions"}
{"name": "train_976", "title": "Completion to involution and semidiscretisations", "abstract": "We discuss the relation between the completion to involution of linear over-determined systems of partial differential equations with constant coefficients and the properties of differential algebraic equations obtained by their semidiscretisation. For a certain class of \"weakly over-determined\" systems, we show that the differential algebraic equations do not contain hidden constraints, if and only if the original partial differential system is involutive. We also demonstrate how the formal theory can be used to obtain an existence and uniqueness theorem for smooth solutions of strongly hyperbolic systems and to estimate the drift off the constraints, if an underlying equation is numerically solved. Finally, we show for general linear systems how the index of differential algebraic equations obtained by semidiscretisations can be predicted from the result of a completion of the partial differential system", "fulltext": "", "keywords": "constant coefficients;differential algebraic equations;strongly hyperbolic systems;matrices;partial differential equations;semidiscretisations;involution;linear over-determined systems;index;uniqueness theorem;completion"}
{"name": "train_977", "title": "Behavior of Runge-Kutta discretizations near equilibria of index 2 differential", "abstract": "algebraic systems We analyze Runge-Kutta discretizations applied to index 2 differential algebraic equations (DAE's) near equilibria. We compare the geometric properties of the numerical and the exact solutions. It is shown that projected and half-explicit Runge-Kutta methods reproduce the qualitative features of the continuous system in the vicinity of an equilibrium correctly. The proof combines cut-off and scaling techniques for index 2 differential algebraic equations with some invariant manifold results of Schropp (Geometric properties of Runge-Kutta discretizations for index 2 differential algebraic equations, Konstanzer Schriften in Mathematik und Informatik 128) and classical results for discretized ordinary differential equations", "fulltext": "", "keywords": "cut-off techniques;geometric properties;equilibria;index 2 differential algebraic systems;half-explicit runge-kutta methods;discretized ordinary differential equations;continuous system;invariant manifold;scaling techniques;runge-kutta discretizations"}
{"name": "train_978", "title": "On Implicit Euler for high-order high-index DAEs", "abstract": "The Implicit Euler method is seldom used to solve differential-algebraic equations (DAEs) of differential index r >or= 3, since the method in general fails to converge in the first r - 2 steps after a change of stepsize. However, if the differential equation is of order d = r - 1 >or= 1, an alternative variable-step version of the Euler method can be shown uniformly convergent. For d = r - 1, this variable-step method is equivalent to the Implicit Euler except for the first r - 2 steps after a change of stepsize. Generalization to DAEs with differential equations of order d > r - 1 >or= 1, and to variable-order formulas is discussed", "fulltext": "", "keywords": "variable-order formulas;variable-step method;backward differentiation formula;initial value problem;linear multistep method;convergence;differential index;differential-algebraic equations;stepsize change;implicit euler method"}
{"name": "train_979", "title": "Design, analysis and testing of some parallel two-step W-methods for stiff", "abstract": "systems Parallel two-step W-methods are linearly-implicit integration methods where the s stage values can be computed in parallel. We construct methods of stage order q = s and order p = s with favourable stability properties. Generalizations for the concepts of A- and L-stability are proposed and conditions for stiff accuracy are given. Numerical comparisons on a shared memory computer show the efficiency of the methods, especially in combination with Krylov-techniques for large stiff systems", "fulltext": "", "keywords": "stage order;krylov-techniques;linearly-implicit integration methods;shared memory computer;parallel two-step w-methods;convergence analysis;differential equations;stability;large stiff systems"}
{"name": "train_98", "title": "Automating the compliance and supervision process", "abstract": "New technology enables large broker/dealers to supervise and ensure compliance across multiple branches and managers", "fulltext": "", "keywords": "supervision;compliance;brokers;risk management"}
{"name": "train_980", "title": "Convergence of Runge-Kutta methods for nonlinear parabolic equations", "abstract": "We study time discretizations of fully nonlinear parabolic differential equations. Our analysis uses the fact that the linearization along the exact solution is a uniformly sectorial operator. We derive smooth and nonsmooth-data error estimates for the backward Euler method, and we prove convergence for strongly A (v)-stable Runge-Kutta methods. For the latter, the order of convergence for smooth solutions is essentially determined by the stage order of the method. Numerical examples illustrating the convergence estimates are presented", "fulltext": "", "keywords": "nonlinear parabolic differential equations;runge-kutta method convergence;nonsmooth-data error estimates;data error estimates;backward euler method;linearization;time discretizations;uniformly sectorial operator"}
{"name": "train_981", "title": "Basin configuration of a six-dimensional model of an electric power system", "abstract": "As part of an ongoing project on the stability of massively complex electrical power systems, we discuss the global geometric structure of contacts among the basins of attraction of a six-dimensional dynamical system. This system represents a simple model of an electrical power system involving three machines and an infinite bus. Apart from the possible occurrence of attractors representing pathological states, the contacts between the basins have a practical importance, from the point of view of the operation of a real electrical power system. With the aid of a global map of basins, one could hope to design an intervention strategy to boot the power system back into its normal state. Our method involves taking two-dimensional sections of the six-dimensional state space, and then determining the basins directly by numerical simulation from a dense grid of initial conditions. The relations among all the basins are given for a specific numerical example, that is, choosing particular values for the parameters in our model", "fulltext": "", "keywords": "six-dimensional model;attractors;power system stability;global map;state space;infinite bus;pathological states;basin configuration;electric power system;global geometric structure;massively complex electrical power systems"}
{"name": "train_982", "title": "Abundance of mosaic patterns for CNN with spatially variant templates", "abstract": "This work investigates the complexity of one-dimensional cellular neural network mosaic patterns with spatially variant templates on finite and infinite lattices. Various boundary conditions are considered for finite lattices and the exact number of mosaic patterns is computed precisely. The entropy of mosaic patterns with periodic templates can also be calculated for infinite lattices. Furthermore, we show the abundance of mosaic patterns with respect to template periods and, which differ greatly from cases with spatially invariant templates", "fulltext": "", "keywords": "spatial entropy;finite lattices;cnn;one-dimensional cellular neural network;infinite lattices;mosaic patterns;boundary conditions;spatially variant templates;transition matrix"}
{"name": "train_983", "title": "Limitations of delayed state feedback: a numerical study", "abstract": "Stabilization of a class of linear time-delay systems can be achieved by a numerical procedure, called the continuous pole placement method [Michiels et al., 2000]. This method can be seen as an extension of the classical pole placement algorithm for ordinary differential equations to a class of delay differential equations. In [Michiels et al., 2000] it was applied to the stabilization of a linear time-invariant system with an input delay using static state feedback. In this paper we study the limitations of such delayed state feedback laws. More precisely we completely characterize the class of stabilizable plants in the 2D-case. For that purpose we make use of numerical continuation techniques. The use of delayed state feedback in various control applications and the effect of its limitations are briefly discussed", "fulltext": "", "keywords": "delay differential equations;static state feedback;linear time-delay systems;delayed state feedback;numerical continuation;continuous pole placement method"}
{"name": "train_984", "title": "Bistability of harmonically forced relaxation oscillations", "abstract": "Relaxation oscillations appear in processes which involve transitions between two states characterized by fast and slow time scales. When a relaxation oscillator is coupled to an external periodic force its entrainment by the force results in a response which can include multiple periodicities and bistability. The prototype of these behaviors is the harmonically driven van der Pol equation which displays regions in the parameter space of the driving force amplitude where stable orbits of periods 2n+or-1 coexist, flanked by regions of periods 2n+1 and 2n-1. The parameter regions of such bistable orbits are derived analytically for the closely related harmonically driven Stoker-Haag piecewise discontinuous equation. The results are valid over most of the control parameter space of the system. Also considered are the reasons for the more complicated dynamics featuring regions of high multiple periodicity which appear like noise between ordered periodic regions. Since this system mimics in detail the less analytically tractable forced van der Pol equation, the results suggest extensions to situations where forced relaxation oscillations are a component of the operating mechanisms", "fulltext": "", "keywords": "harmonically driven stoker-haag piecewise discontinuous equation;external periodic force;harmonically forced relaxation oscillations;bistability;control parameter space;entrainment;nonlinear dynamics;van der pol equation"}
{"name": "train_985", "title": "Local activity criteria for discrete-map CNN", "abstract": "Discrete-time CNN systems are studied in this paper by the application of Chua's local activity principle. These systems are locally active everywhere except for one isolated parameter value. As a result, nonhomogeneous spatiotemporal patterns may be induced by any initial setting of the CNN system when the strength of the system diffusion coupling exceeds a critical threshold. The critical coupling coefficient can be derived from the loaded cell impedance of the CNN system. Three well-known 1D map CNN's (namely, the logistic map CNN, the magnetic vortex pinning map CNN, and the spiral wave reproducing map CNN) are introduced to illustrate the applications of the local activity principle. In addition, we use the cell impedance to demonstrate the period-doubling scenario in the logistic and the magnetic vortex pinning maps", "fulltext": "", "keywords": "chua's local activity principle;spiral wave reproducing map cnn;local activity criteria;nonhomogeneous spatiotemporal patterns;period-doubling;logistic map cnn;difference equation;magnetic vortex pinning map cnn;critical coupling coefficient;discrete-time cnn systems;loaded cell impedance;discrete-map cnn"}
{"name": "train_986", "title": "Wavelet-based level-of-detail representation of 3D objects", "abstract": "In this paper, we propose a 3D object LOD (Level of Detail) modeling system that constructs a mesh from range images and generates the mesh of various LOD using the wavelet transform. In the initial mesh generation, we use the marching cube algorithm. We modify the original algorithm to apply it to construct the mesh from multiple range images efficiently. To get the base mesh we use the decimation algorithm which simplifies a mesh with preserving the topology. Finally, when reconstructing new mesh which is similar to initial mesh we calculate the wavelet coefficients by using the wavelet transform. We solve the critical problem of wavelet-based methods - the surface crease problem - by using the mesh simplification as the base mesh generation method", "fulltext": "", "keywords": "range images;wavelet coefficients;hierarchy transformation;marching cube algorithm;surface crease problem;decimation algorithm;wavelet transform;3d object level of detail modeling system;critical problem;mesh simplification;wavelet-based level-of-detail representation;base mesh"}
{"name": "train_987", "title": "Proof that the election problem belongs to NF-completeness problems in", "abstract": "asynchronous distributed systems This paper is about the hardness of the election problem in asynchronous distributed systems in which processes can crash but links are reliable. The hardness of the problem is defined with respect to the difficulty to solve it despite failures. It is shown that problems encountered in the system are classified as three classes of problems: F (fault-tolerant), NF (Not fault-tolerant) and NFC (NF-completeness). Among those, the class NFC are the hardest problems to solve. In this paper, we prove that the Election problem is the most difficult problem which belongs to the class NFC", "fulltext": "", "keywords": "not-fault-tolerant problems;distributed computing;nf-completeness problems;fault-tolerant problems;failure detectors;asynchronous distributed systems;leader election;election problem"}
{"name": "train_988", "title": "A new merging algorithm for constructing suffix trees for integer alphabets", "abstract": "A new approach for constructing a suffix tree T/sub s/ for a given string S is to construct recursively a suffix tree T/sub o/ for odd positions, construct a suffix, tree T/sub e/ for even positions from T/sub o/ and then merge T/sub o/ and T/sub e/ into T/sub s/. To construct suffix trees for integer alphabets in linear time had been a major open problem on index data structures. Farach used this approach and gave the first linear-time algorithm for integer alphabets. The hardest part of Farach's algorithm is the merging step. In this paper we present a new and simpler merging algorithm based on a coupled BFS (breadth-first search). Our merging algorithm is more intuitive than Farach's coupled DFS (depth-first search) merging, and thus it can be easily extended to other applications", "fulltext": "", "keywords": "linear time;integer alphabets;recursive construction;coupled bfs;index data structures;suffix trees;breadth-first search;merging algorithm"}
{"name": "train_989", "title": "A dynamic checkpoint scheduling scheme for fault tolerant distributed computing", "abstract": "systems The selection of the optimal checkpointing interval has been a very critical issue in implementing checkpointing-recovery schemes for fault tolerant distributed systems. This paper presents a new scheme that allows a process to select the proper checkpointing interval dynamically. A process in the system evaluates the cost of checkpointing and possible rollback for each checkpointing interval and selects the proper time interval for the next checkpointing. Unlike the other schemes, the overhead incurred by both the checkpointing and rollback activities are considered for the cost evaluation, and the current communication pattern is reflected in the selection of the checkpointing interval. Moreover, the proposed scheme requires no extra message communication for the checkpointing interval selection and can easily be incorporated into the existing checkpointing coordination schemes", "fulltext": "", "keywords": "optimal checkpointing interval;communication pattern;distributed computing systems;rollback recovery;dynamic checkpoint scheduling scheme;cost evaluation;fault tolerant computing"}
{"name": "train_99", "title": "Radianz and Savvis look to expand service in wake of telecom scandals [finance]", "abstract": "With confidence in network providers waning, Radianz and Savvis try to prove their stability. Savvis and Radianz, which both specialize in providing the data-extranet components of telecommunication infrastructures, may see more networking doors open at investment banks, brokerage houses, exchanges and alternative-trading systems", "fulltext": "", "keywords": "network providers;radianz;data-extranet;alternative-trading systems;telecommunication infrastructures;brokerage houses;investment banks;savvis;exchanges"}
{"name": "train_990", "title": "Pipelined broadcast with enhanced wormhole routers", "abstract": "This paper proposes a pipelined broadcast that broadcasts a message of size m in O(m+n-1) time in an n-dimensional hypercube. It is based on the replication tree, which is derived from reachable sets. It has greatly improved performance compared to Ho-Kao's (1995) algorithm with the time of O(m[n/log(n+1)]). The communication in the broadcast uses an all-port wormhole router with message replication capability. This paper includes the algorithm together with performance comparisons to previous schemes in a practical implementation", "fulltext": "", "keywords": "pipelined broadcast;replication tree;performance;enhanced wormhole routers;message broadcast;intermediate reception;all-port wormhole router;reachable sets;n-dimensional hypercube;communication complexity;message replication capability"}
{"name": "train_991", "title": "Estimation of blocking probabilities in cellular networks with dynamic channel", "abstract": "assignment Blocking probabilities in cellular mobile communication networks using dynamic channel assignment are hard to compute for realistic sized systems. This computational difficulty is due to the structure of the state space, which imposes strong coupling constraints amongst components of the occupancy vector. Approximate tractable models have been proposed, which have product form stationary state distributions. However, for real channel assignment schemes, the product form is a poor approximation and it is necessary to simulate the actual occupancy process in order to estimate the blocking probabilities. Meaningful estimates of the blocking probability typically require an enormous amount of CPU time for simulation, since blocking events are usually rare. Advanced simulation approaches use importance sampling (IS) to overcome this problem. We study two regimes under which blocking is a rare event: low-load and high cell capacity. Our simulations use the standard clock (SC) method. For low load, we propose a change of measure that we call static ISSC, which has bounded relative error. For high capacity, we use a change of measure that depends on the current state of the network occupancy. This is the dynamic ISSC method. We prove that this method yields zero variance estimators for single clique models, and we empirically show the advantages of this method over naive simulation for networks of moderate size and traffic loads", "fulltext": "", "keywords": "importance sampling;standard clock method;quality of service;dynamic channel assignment;strong coupling constraints;blocking probability estimation;approximate tractable models;simulation;bounded relative error;dynamic issc method;single clique models;low-load;high cell capacity;product form stationary state distributions;occupancy vector;zero variance estimators;cellular mobile communication networks;cpu time;network traffic load;static issc method"}
{"name": "train_992", "title": "Cross-entropy and rare events for maximal cut and partition problems", "abstract": "We show how to solve the maximal cut and partition problems using a randomized algorithm based on the cross-entropy method. For the maximal cut problem, the proposed algorithm employs an auxiliary Bernoulli distribution, which transforms the original deterministic network into an associated stochastic one, called the associated stochastic network (ASN). Each iteration of the randomized algorithm for the ASN involves the following two phases: (1) generation of random cuts using a multidimensional Ber(p) distribution and calculation of the associated cut lengths (objective functions) and some related quantities, such as rare-event probabilities; (2) updating the parameter vector p on the basis of the data collected in the first phase. We show that the Ber(p) distribution converges in distribution to a degenerated one, Ber(p/sub d/*), p/sub d/* = (p/sub d/,/sub 1/, p/sub d,n/) in the sense that some elements of p/sub d/*, will be unities and the rest zeros. The unity elements of p/sub d/* uniquely define a cut which will be taken as the estimate of the maximal cut. A similar approach is used for the partition problem. Supporting numerical results are given as well. Our numerical studies suggest that for the maximal cut and partition problems the proposed algorithm typically has polynomial complexity in the size of the network", "fulltext": "", "keywords": "rare event simulation;importance sampling;numerical results;randomized algorithm;combinatorial optimization;deterministic network;polynomial complexity;cross entropy method;maximal cut problems;random cuts;partition problems;probability;bernoulli distribution;associated stochastic network"}
{"name": "train_993", "title": "A large deviations analysis of the transient of a queue with many Markov fluid", "abstract": "inputs: approximations and fast simulation This article analyzes the transient buffer content distribution of a queue fed by a large number of Markov fluid sources. We characterize the probability of overflow at time t, given the current buffer level and the number of sources in the on-state. After scaling buffer and bandwidth resources by the number of sources n, we can apply large deviations techniques. The transient overflow probability decays exponentially in n. In the case of exponential on/off sources, we derive an expression for the decay rate of the rare event probability under consideration. For general Markov fluid sources, we present a plausible conjecture. We also provide the \"most likely path\" from the initial state to overflow (at time t). Knowledge of the decay rate and the most likely path to overflow leads to (i) approximations of the transient overflow probability and (ii) efficient simulation methods of the rare event of buffer overflow. The simulation methods, based on importance sampling, give a huge speed-up compared to straightforward simulations. The approximations are of low computational complexity and are accurate, as verified by means of simulation experiments", "fulltext": "", "keywords": "transient buffer content distribution;approximations;importance sampling;buffer resources;simulation methods;bandwidth resources;markov fluid inputs;queuing theory;computational complexity;transient overflow probability;large deviations analysis;atm multiplexers;ip routers"}
{"name": "train_994", "title": "Design and implementation of a flexible manufacturing control system using", "abstract": "neural network Design and implementation of a sequential controller based on the concept of artificial neural networks for a flexible manufacturing system are presented. The recurrent neural network (RNN) type is used for such a purpose. Contrary to the programmable controller, an RNN-based sequential controller is based on a definite mathematical model rather than depending on the experience and trial and error techniques. The proposed controller is also more flexible because it is not limited by the restrictions of the finite state automata theory. Adequate guidelines of how to construct an RNN-based sequential controller are presented. These guidelines are applied to different case studies. The proposed controller is tested by simulations and real-time experiments. These tests prove the successfulness of the proposed controller performances. Theoretical as well as experimental results are presented and discussed indicating that the proposed design procedure using Elman's RNN can be effective in designing a sequential controller for event-based type manufacturing systems. In addition, the simulation results assure the effectiveness of the proposed controller to overcome the effect of noisy inputs", "fulltext": "", "keywords": "recurrent neural network;sequential control;learning;pneumatic system;noisy inputs;fms;flexible manufacturing systems;elman network;programmable controller;ladder language;finite state automata"}
{"name": "train_995", "title": "Vehicle travel time models for AGV systems under various dispatching rules", "abstract": "The design and evaluation of AGV-based material handling systems are highly complex because of the randomness and the large number of variables involved. Vehicle travel time is a fundamental parameter for solving various flexible manufacturing system (FMS) design problems. This article presents stochastic vehicle travel time models for AGV-based material handling systems with emphasis on the empty travel times of vehicles. Various vehicle dispatching rules examined here include the nearest vehicle selection rule and longest idle vehicle selection rule. A simulation experiment is used to evaluate and demonstrate the presented models", "fulltext": "", "keywords": "vehicle dispatching rules;longest idle vehicle selection rule;material handling systems;automatic guided vehicle;fms;agv;nearest vehicle selection rule;vehicle travel time;flexible manufacturing system"}
{"name": "train_996", "title": "Flexible air-jet tooling for vibratory bowl feeder systems", "abstract": "Vibratory bowl feeders (VBFs) are machines that feed various small parts in large volume automatic assembly systems. Their shortcomings, like inflexibility and the propensity to jam, stem from the use of mechanical orienting devices. Air jet based orienting devices can be implemented to overcome these limitations. Applications of passive and active air jet based orienting devices that replace conventional devices for the VBF are discussed. Passive devices, which reject incorrectly oriented parts, are discussed first. Active air jet based orienting devices are then introduced to further improve the flexibility of VBFs. Since active devices reorient parts into a desired orientation, the part motion under their influence is analyzed. A number of tests demonstrate the feasibility and advantages of these new orienting devices", "fulltext": "", "keywords": "passive air jet;active air jet;parts feeding;orienting devices;automatic assembly systems;vibratory bowl feeders"}
{"name": "train_997", "title": "Production capacity of flexible manufacturing systems with fixed production", "abstract": "ratios Determining the production capacity of flexible manufacturing systems is a very important issue in the design of such systems. We propose an approach for determining the production capacity (i.e. the maximum production rate) of a flexible manufacturing system with several part types, dedicated pallets, and fixed production ratios among the different part types. We show that the problem reduces to the determination of a single parameter for which we propose an iterative procedure. Simulation or approximate analytical techniques can be used as the building block performance evaluation technique in the iterative procedure", "fulltext": "", "keywords": "iterative procedure;approximate analytical techniques;single parameter determination;fixed production ratios;dedicated pallets;simulation;multiple part type;building block performance evaluation technique;maximum production rate;numerical experiments;flexible manufacturing systems;stability condition;production capacity"}
{"name": "train_998", "title": "Discreteness and relevance: a reply to Roman Poznanski", "abstract": "In reply to Poznanski (see ibid., p.435, 2002) on discreteness and relevance, Eliasmith claims that all of the concerns voiced by Poznanski in his reply fail to offer a serious challenge to the idea that continuity is irrelevant to a good understanding of cognitive systems. Eliasmith hopes that it is evident that he does not claim that the process in neural systems is discrete, but rather that a complete characterization of the process can be discrete; these of course are significantly different claims", "fulltext": "", "keywords": "neural systems;relevance;discreteness;cognitive systems;continuity"}
{"name": "train_999", "title": "The importance of continuity: a reply to Chris Eliasmith", "abstract": "In his reply to Eliasmith (see ibid., vol.11, p.417-26, 2001) Poznanski considers how the notion of continuity of dynamic representations serves as a beacon for an integrative neuroscience to emerge. He considers how the importance of continuity has come under attack from Eliasmith (2001) who claims: (i) continuous nature of neurons is not relevant to the information they process, and (ii) continuity is not important for understanding cognition because the various sources of noise introduce uncertainty into spike arrival times, so encoding and decoding spike trains must be discrete at some level", "fulltext": "", "keywords": "uncertainty;integrative neuroscience;spike trains;dynamic representations;neurons;cognition;neural nets;cognitive systems;continuity;spike arrival times"}