{"id": "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", "keyphrases": ["NMR implementation", "quantum lattice gas algorithm", "quantum information processors", "fluid dynamics problems", "diffusion equation", "nonlinear Burgers equations", "nuclear magnetic resonance", "two-qubit quantum information.processors"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["separately managed accounts", "investment management", "technology", "back-office services", "outsourcers", "small banks"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["design methodology", "modularity", "local diagnostic algorithms", "diagnostic strategies", "industrial systems"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["graph invariant", "induced odd cycles", "minimum clique-partition", "minimum clique-cover", "cardinality", "maximum stable set"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["PacketVideo", "multimedia content streaming", "wireless devices", "MPEG-4", "wireless device manufacturers", "content providers", "semiconductor vendors", "handheld wireless terminals"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "P"]}
{"id": "1070", "title": "Universal simulation of Hamiltonian dynamics for quantum systems with finite-dimensional state spaces", "abstract": "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", "keyphrases": ["universal simulation", "Hamiltonian dynamics", "quantum systems", "finite- dimensional state spaces", "quantum dynamics", "composite quantum system", "two-body Hamiltonian evolution", "fixed two-body entangling N-qubit Hamiltonian", "local unitaries", "D-dimensional component systems", "universal quantum computation", "fixed two-body entangling N-qudit Hamiltonian"], "prmu": ["P", "P", "P", "M", "P", "P", "P", "P", "P", "M", "P", "P"]}
{"id": "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", "keyphrases": ["H/sub 2/ optimization", "passive vibration control", "power spectrum response", "Voigt type dynamic vibration absorber", "three-element type dynamic vibration absorbers"], "prmu": ["P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["finite-state zero-sum discounted stochastic game", "semi-algebraic set theory", "asymptotic behavior", "min-max value", "discount rate", "uniform polynomial convergence rate", "N-stage game", "two-player zero-sum finite-state stochastic games"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "M"]}
{"id": "538", "title": "Polarization of the RF field in a human head at high field: a study with a quadrature surface coil at 7.0 T", "abstract": "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", "keyphrases": ["RF field intensity distribution", "human brain", "high field MRI", "RF field polarization", "quadrature surface coil", "spatial distribution", "image intensity distribution", "computer modeling", "high-field coil design", "whole-body MRI", "phantom samples", "segmented images", "3D multitissue head model", "gradient echo images", "finite difference time domain method", "Maxwell wave equations", "reception fields", "transmission fields", "7.0 T", "300 MHz"], "prmu": ["P", "P", "M", "P", "P", "P", "P", "P", "R", "U", "M", "M", "M", "M", "M", "M", "R", "R", "P", "P"]}
{"id": "681", "title": "Construction of information retrieval thesaurus for family planning terms using CDS/ISIS", "abstract": "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", "keyphrases": ["information retrieval", "thesaurus", "family planning terms", "CDS/ISIS software", "bibliographic databases", "classification", "socio economic field", "culture", "psychology", "medicine", "Family Planning", "ISO 2788", "UNISIST", "BS 5723"], "prmu": ["P", "P", "P", "P", "U", "P", "R", "P", "P", "U", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["SCADA", "supervisory control", "data acquisition", "in-house integration", "compatibility", "programmable logic controllers"], "prmu": ["P", "M", "U", "M", "U", "M"]}
{"id": "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", "keyphrases": ["Windows .Net Enterprise Server", "security", "Active Directory", "scalability"], "prmu": ["P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["distributed servers", "large-scale secure multicast", "backward secrecy", "forward secrecy", "multicast applications", "data encryption key", "re-key messaging", "system bandwidth", "system complexity", "hierarchical key tree", "user traffic", "traffic merging", "short holding time", "Internet stock quote applications", "dynamic split-and-merge scheme", "key management"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "P", "R", "P", "P", "R", "P", "P", "M", "M"]}
{"id": "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", "keyphrases": ["cooperative three-player quantum games", "quantum entanglement", "initial state", "cooperative four-player quantum games", "quantum superposed operator", "nonzero sum difficulty"], "prmu": ["M", "P", "P", "R", "P", "M"]}
{"id": "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", "keyphrases": ["law firm", "weblogs", "institutional memory", "Web site"], "prmu": ["P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["system identification", "grey-box models", "evolutionary algorithms", "genetic evolution", "multiobjective optimisation", "hydraulic system", "nonlinear system"], "prmu": ["R", "P", "M", "U", "U", "M", "R"]}
{"id": "580", "title": "A genetic approach to the optimization of automatic generation control parameters for power systems", "abstract": "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", "keyphrases": ["power systems automatic generation control parameters optimization", "genetic algorithm", "power line", "control design", "interconnected power networks", "continuous load variation", "frequency transients", "integral controller gains", "frequency bias factors", "control simulation"], "prmu": ["R", "P", "P", "M", "M", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["business software", "vendor relationship", "management", "functionality", "software evaluation"], "prmu": ["P", "R", "U", "P", "M"]}
{"id": "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", "keyphrases": ["multi-agent collaboration", "B2B workflow monitoring", "Internet", "business-to-business applications", "changing process requirements", "time constraints", "workflow management", "electronic commerce", "transaction risk", "business rules"], "prmu": ["P", "P", "U", "R", "P", "P", "P", "M", "P", "P"]}
{"id": "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", "keyphrases": ["Enterprise Resource Planning", "e-business", "ERP", "customer relationship management", "synergic analysis", "Web-based enterprise resources planning"], "prmu": ["P", "P", "P", "M", "P", "P"]}
{"id": "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", "keyphrases": ["Salt River Project", "Tempe", "Arizona", "USA", "geographic areas", "preventive inspections", "reliability planning analysis", "cost benefit model", "direct buried cable", "geographical information system", "GIS", "equipment analysis execution", "wood pole", "cable replacement", "condition monitoring"], "prmu": ["P", "P", "P", "U", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "U"]}
{"id": "641", "title": "Multiecho segmented EPI with z-shimmed background gradient compensation (MESBAC) pulse sequence for fMRI", "abstract": "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", "keyphrases": ["fMRI", "multiecho segmented EPI", "z-shimmed background gradient compensation", "gradient compensation pulse sequence", "severe susceptibility artifacts", "BOLD-weighted signal", "orbitofrontal cortex", "navigator echoes", "ghost artifacts", "event-related functional brain mapping", "signal dropout", "spatial resolution", "temporal resolution", "image distortion"], "prmu": ["P", "P", "P", "R", "P", "M", "P", "P", "P", "P", "P", "R", "P", "P"]}
{"id": "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", "keyphrases": ["phase conditions", "Schur polynomial", "real coefficients", "rate of change of phase", "Tchebyshev representation", "phase monotonicity", "robust stability", "discrete-time control systems", "stabilization"], "prmu": ["P", "P", "P", "P", "P", "M", "U", "U", "U"]}
{"id": "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", "keyphrases": ["four-point wavelets", "multiresolution analysis", "wavelet representations", "image compression", "physical simulation", "numerical analysis", "interpolatory four-point subdivision scheme", "linear time complexity", "weight parameters", "scaling functions", "B-spline wavelets"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1150", "title": "Effect of multileaf collimator leaf width on physical dose distributions in the treatment of CNS and head and neck neoplasms with intensity modulated radiation therapy", "abstract": "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", "keyphrases": ["multileaf collimator leaf width", "physical dose distributions", "head and neck neoplasms", "intensity modulated radiation therapy", "CNS neoplasms", "CNS tumors", "treatment planning", "parotid preservation", "optimization parameters", "conformal radiotherapy", "single fraction radiosurgery", "acceptable tumor coverage", "minimal toxicity", "collimator rotation", "beamlet size", "5 mm", "10 mm", "21.04 Gy", "22.36 Gy"], "prmu": ["P", "P", "P", "P", "R", "P", "P", "P", "R", "P", "P", "M", "U", "M", "P", "P", "P", "P", "P"]}
{"id": "997", "title": "Production capacity of flexible manufacturing systems with fixed production ratios", "abstract": "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", "keyphrases": ["flexible manufacturing systems", "fixed production ratios", "production capacity", "maximum production rate", "multiple part type", "dedicated pallets", "single parameter determination", "iterative procedure", "simulation", "approximate analytical techniques", "building block performance evaluation technique", "stability condition", "numerical experiments"], "prmu": ["P", "P", "P", "P", "M", "P", "R", "P", "P", "P", "P", "U", "U"]}
{"id": "540", "title": "Ventilation-perfusion ratio of signal intensity in human lung using oxygen-enhanced and arterial spin labeling techniques", "abstract": "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", "keyphrases": ["human lung", "ventilation-perfusion ratio", "signal intensity", "oxygen-enhanced techniques", "arterial spin labeling techniques", "ventilation images", "perfusion images", "flow-sensitive alternating inversion recovery", "logarithmic normal distribution", "nonsimultaneous acquisition", "gas exchange efficiency", "pathomechanisms", "MRI", "time delay", "pixel-by-pixel maps", "multiple inert gas elimination", "pulmonary embolism", "chronic obstructive pulmonary disease"], "prmu": ["P", "P", "P", "R", "P", "R", "P", "P", "P", "P", "M", "U", "P", "U", "U", "P", "M", "M"]}
{"id": "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", "keyphrases": ["laser-based internal profile measurement system", "internal profiles", "point laser source", "rotating optical device", "laser meter", "rotating device", "floor tile manufacturers", "carpet venders", "building contractors", "cost estimation", "production control", "customized windowpanes", "window frames"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["large-scale model predictive control", "quadratic programming algorithms", "QPSchur", "cross directional control problems", "paper machines", "object oriented implementation", "dual space Schur complement algorithm", "simulations", "flexible object oriented construction", "constraint handling", "warm starts", "partial solution"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P", "R", "P", "P", "P"]}
{"id": "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?", "keyphrases": ["networks", "malicious attacks", "security", "employees"], "prmu": ["P", "U", "P", "U"]}
{"id": "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", "keyphrases": ["transcripts", "law reporting", "judge-made law", "judgments"], "prmu": ["P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Financialcontent.com", "financial information", "Web sites", "aggregator", "partner sites"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["FCC", "recovery plan", "US Senate Commerce Committee", "telecom industry"], "prmu": ["P", "P", "M", "M"]}
{"id": "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", "keyphrases": ["women", "computer science education", "female", "male", "computer science majors", "gender issues"], "prmu": ["P", "M", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["current-programmed regulators", "robust stability analysis", "uncertainty models", "buck converters", "boost converters", "buck-boost converters", "linear fractional transformations", "structured dynamic uncertainties", "load resistance", "capacitance", "inductance", "switch-mode DC-DC converters", "control analysis", "nominal model", "norm-bounded modeling uncertainty"], "prmu": ["P", "P", "P", "R", "R", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["modal logic", "indiscernibility", "complementarity", "information systems", "first-order characterization", "duality result", "relational type", "first-order conditions"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["feedback vertex sets", "min-max theorem", "necessary sufficient condition", "linear system", "bipartite tournament", "totally dual integral system", "cycle-vertex incidence matrix", "all-one vector", "covering cycles", "strongly polynomial time algorithms", "cycle packing problem", "feedback vertex set problem", "NP-complete problem", "graphs", "combinatorial optimization problems", "linear programming duality theory"], "prmu": ["P", "P", "R", "P", "P", "R", "P", "P", "P", "P", "P", "P", "R", "U", "M", "M"]}
{"id": "1174", "title": "Optimization of cutting conditions for single pass turning operations using a deterministic approach", "abstract": "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", "keyphrases": ["cutting conditions optimization", "single pass turning operations", "deterministic approach", "CAM software", "economic cutting conditions", "maximum production rate", "mathematical analyses", "constrained economic trends", "process planning"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P", "U"]}
{"id": "564", "title": "Development of a computer-aided manufacturing system for profiled edge lamination tooling", "abstract": "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", "keyphrases": ["computer aided manufacturing", "profiled edge lamination tooling", "rapid tooling", "abrasive water jet cutting", "CAM software", "cutting trajectory algorithms", "identical equidistant profile segmentation", "adaptively vector profiles projection"], "prmu": ["M", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["workflow", "content management", "business process management software", "research", "survey", "market overview"], "prmu": ["P", "P", "P", "P", "U", "U"]}
{"id": "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", "keyphrases": ["manufacturers", "customer relationship management", "CRM", "manufacturing"], "prmu": ["P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["tax consultancy", "IE Taxguard", "failover server", "Neverfail", "backup"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["dynamic objects modelling", "distributed systems", "nested Petri nets", "multi-agent systems", "recursive-parallel systems", "process algebras", "decidability", "object-oriented Petri net"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["adaptive image enhancement", "retinal blood vessel images", "local neighbourhood information", "nonstationary background removal", "image segmentation", "personal identification", "security applications"], "prmu": ["P", "P", "P", "R", "R", "U", "U"]}
{"id": "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", "keyphrases": ["distributed business structures", "efficient knowledge allocation", "accelerated business processes", "information systems", "knowledge databases", "collaborative information space", "information objects", "business process steps", "heterogeneous distributed data", "Web-based user interface", "multidimensionally hierarchical composition", "interactive system"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "P", "R", "P", "P", "M"]}
{"id": "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", "keyphrases": ["Boost libraries", "C++", "threads", "smart pointers", "Boost Graph Library", "graph-theoretic concepts", "directed graph", "file dependencies", "computational geometry", "BGL graph", "generic programming approach"], "prmu": ["R", "U", "U", "U", "P", "U", "M", "U", "P", "R", "P"]}
{"id": "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", "keyphrases": ["search algorithms", "Numeric CSPs", "Constraint Satisfaction Problems", "filtering techniques", "CSPs-solving", "artificial intelligence", "interval analysis", "extrapolation methods", "propagation", "pruning"], "prmu": ["P", "P", "P", "P", "U", "P", "P", "M", "P", "U"]}
{"id": "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", "keyphrases": ["Virtual Development Center", "women", "information technology", "teaching", "community groups", "gender issues", "computer science education"], "prmu": ["P", "P", "M", "P", "P", "U", "M"]}
{"id": "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", "keyphrases": ["accessibility needs", "disabled people", "information and referral programs", "accessible Web sites", "TTY access", "Braille", "ADA legislation", "public places"], "prmu": ["P", "R", "M", "P", "P", "P", "P", "P"]}
{"id": "1368", "title": "Exploratory study of the adoption of manufacturing technology innovations in the USA and the UK", "abstract": "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", "keyphrases": ["manufacturing technology innovations", "USA", "UK", "competitive advantage", "foreign direct investment", "labour productivity", "macro-economic data", "soft technologies", "just-in-time", "total quality manufacturing", "manufacturing cells"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1395", "title": "Work in progress: Developing policies for access to government information in the New South Africa", "abstract": "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", "keyphrases": ["government information", "South Africa", "freedom of expression", "freedom of access to information", "Bill of Rights", "constitutional right of access", "government printing", "government publishing", "public information services", "Internet", "official publications depositories", "public bodies", "libraries"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["wireless local area networks", "costs", "benefits"], "prmu": ["P", "P", "P"]}
{"id": "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", "keyphrases": ["atom entanglement", "entangled spin squeezed states", "optical cavity", "bichromatic light illumination", "coupling", "pairwise exchange", "excitations", "cavity QED", "strong coupling regime", "cavity decay rate", "atom cavity coupling strength", "bad cavities"], "prmu": ["R", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "893", "title": "Use of natural language processing to translate clinical information from a database of 889,921 chest radiographic reports", "abstract": "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", "keyphrases": ["natural language processing", "chest radiographic report database", "clinical information translation", "urban academic medical center", "clinical condition frequency", "clinical condition cooccurrence", "right to left lung mass ratio", "pleural effusion", "bullet wounds", "stab wounds", "pneumothorax coding"], "prmu": ["P", "R", "R", "P", "R", "R", "R", "P", "R", "P", "P"]}
{"id": "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", "keyphrases": ["subconscious priming", "risk attitudes", "risk-seeking preferences", "risk-averse preferences", "decision scenarios", "preconscious processing", "affective primacy hypothesis", "deliberative mental operations", "choice preferences"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "P", "P"]}
{"id": "1011", "title": "A self-organizing context-based approach to the tracking of multiple robot trajectories", "abstract": "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", "keyphrases": ["self-organizing context-based approach", "trajectories tracking", "competitive learning", "Hebbian learning", "complex spatiotemporal sequences", "synaptic weights", "competitive interlayer connections", "Hebbian intralayer connections", "shared states", "context units", "sequence states", "robot trajectories", "unsupervised learning", "storage abilities", "retrieval abilities", "sequence sampling effects", "fault tolerance"], "prmu": ["P", "R", "R", "P", "P", "P", "R", "P", "P", "P", "P", "P", "M", "R", "P", "P", "R"]}
{"id": "745", "title": "Intensity based affine registration including feature similarity for spatial normalization", "abstract": "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", "keyphrases": ["intensity based affine registration", "feature similarity", "spatial normalization", "affine transformation", "brain architecture", "common coordinate system", "global brain", "region of interest", "feature similarities", "lateral ventricle", "central gray nuclei", "corpus callosum", "schizophrenia detection", "mutual information method", "Talairach method"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["digital stochastic realization", "complex analog controllers", "stochastic logic", "random pulse stream", "finite sequence", "binary pulse sequence", "Boolean algebra", "statistical algebra", "random pulse sequence", "Boolean operation", "average pulse rates", "pulse stream", "stochastic approach", "programmable devices", "nonlinear dissipative controllers", "series resonant converter", "parallel resonant DC-to-DC converters", "series resonant DC-to-DC converters"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "M"]}
{"id": "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", "keyphrases": ["transporters", "push systems", "pull systems", "metamodelling approach", "multiproduct multiline multistage production system", "processing time variation", "demand variation", "batch size", "throughput rate", "average waiting time", "machine utilization", "performance measures"], "prmu": ["P", "R", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1310", "title": "Cat and class: what use are these skills to the new legal information professional?", "abstract": "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", "keyphrases": ["legal information professional", "cataloguing", "classification", "information studies courses", "law firm libraries", "academic libraries"], "prmu": ["P", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["current-mode ADC", "algorithmic ADC", "analog-to-digital converters", "resolution", "A/D converters", "circuit techniques", "statistical analysis", "CMOS technology", "error analysis", "tolerance analysis", "circuit analysis", "0.35 micron", "4 bit"], "prmu": ["R", "R", "P", "P", "M", "P", "P", "P", "R", "R", "R", "U", "U"]}
{"id": "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", "keyphrases": ["multiphase chemistry", "size-resolved cloud models", "cloud drops", "chemical species", "chemical reactions", "multiphase chemical systems", "aqueous phase chemistry", "gas phase chemistry", "approximate matrix factorization", "operator splitting", "linear algebra", "sparse Jacobians", "time-integration schemes", "air pollution modelling"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["feedback controller", "smart structures", "high-Q resonant circuits", "resonant frequency", "smart structure", "actuator-sensor", "multiple resonant modes", "damping", "multimode resonances", "laminate beam"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "U"]}
{"id": "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)", "keyphrases": ["history", "public business libraries", "Leeds Public Libraries", "Internet", "Public Commercial and Technical Library", "business information services", "company information", "market research", "British Standards information", "press cuttings", "trade journal articles", "scientific journal articles", "patents information", "government", "SINTO", "information network", "Sheffield universities", "steel companies", "priority redefinition", "marketing", "budgets", "resources", "IT use"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "R", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["agile business", "managing IT infrastructures", "business processes", "increase automation"], "prmu": ["P", "P", "P", "P"]}
{"id": "62", "title": "Text-independent speaker verification using utterance level scoring and covariance modeling", "abstract": "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", "keyphrases": ["text-independent speaker verification", "utterance level scoring", "covariance modeling", "computationally simple method", "second order statistics", "normalized score", "sample covariance", "speaker covariance", "distortion measure", "NIST speaker recognition evaluation", "distortion measures", "Gaussian mixture model", "GMM", "computational complexity", "verification accuracy"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["photon energy spectra", "deterministic calculations", "clinical electron accelerator targets", "Boltzmann equation", "coupled electron-photon transport", "one-dimensional slab geometry", "angular range of interest", "therapy applications", "relative energy spectra", "3-D Monte Carlo methods", "linear accelerator", "therapy planning", "integrodifferential equation", "pencil beam source representations"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "M", "M", "M", "M"]}
{"id": "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", "keyphrases": ["open source software security", "computer networks", "commercial technical protection", "attack technology", "management", "data security"], "prmu": ["M", "R", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["cardiovascular physiology", "simulation", "diastolic function", "heart", "equivalent electronic circuit", "cardiac output", "stroke volume", "right ventricular capacitance", "negative intrathoracic pressure", "left ventricular relaxation", "heart rate", "left ventricle failure", "systolic functions", "diastolic relaxation"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P"]}
{"id": "702", "title": "A comparison of high-power converter topologies for the implementation of FACTS controllers", "abstract": "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", "keyphrases": ["FACTS controllers", "high-power converter topologies comparison", "multilevel topologies", "multipulse topology", "inverters", "switching frequency", "device count", "DC filter ratings", "multipoint clamped topology", "unified power flow controller", "static compensator", "static synchronous series compensator", "STATCOM", "UPFC"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "U", "U"]}
{"id": "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", "keyphrases": ["work sequencing", "manufacturing cell", "limited labour constraints", "group scheduling heuristics", "dual-constrained automated manufacturing cell", "automated manufacturing cells", "labour allocation policies", "efficiency oriented exhaustive group scheduling heuristics", "nonexhaustive heuristics", "production planning", "job scheduling"], "prmu": ["P", "P", "P", "P", "R", "P", "R", "R", "M", "P", "P"]}
{"id": "1312", "title": "Stability in the numerical solution of the heat equation with nonlocal boundary conditions", "abstract": "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", "keyphrases": ["numerical solution", "heat equation", "nonlocal boundary conditions", "stability", "integral boundary conditions", "finite differences", "space discretization", "matrices", "semidiscrete problem", "sectorial resolvent condition", "fully discrete numerical process", "one-step methods", "maximum norm"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Santera Systems", "switching", "Kerman Telephone", "Rural Utilities Service"], "prmu": ["P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["chemical mechanical polishing", "CMP", "physically based process model", "finite element analysis", "CMP process development"], "prmu": ["P", "P", "R", "P", "P"]}
{"id": "1056", "title": "Eliminating recency with self-review: the case of auditors' 'going concern' judgments", "abstract": "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", "keyphrases": ["auditor going concern judgments", "recency debiasing", "self-review", "staff auditors", "audit report choices", "documentation", "audit workpapers", "senior auditors", "extended audit procedures", "legal liability", "diminished reputation", "judgment debiasing", "applied professional settings", "accountability", "probability judgments"], "prmu": ["R", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "U", "M"]}
{"id": "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", "keyphrases": ["scalable intelligent takeoff controller", "simulated running jointed leg", "neural controllers", "changing environmental conditions", "scalability", "scalable neurofuzzy controller", "takeoff phase", "running stride", "intelligent robotic control"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "60", "title": "Perceptual audio coding using adaptive pre- and post-filters and lossless compression", "abstract": "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", "keyphrases": ["perceptual audio coding", "adaptive pre-filters", "adaptive post-filters", "lossless compression", "high compression ratio", "low encoding/decoding delay", "source signals", "music", "sampling rates", "redundancy reduction", "adaptive filtering", "predictive coding", "psycho-acoustically controlled adaptive linear filter", "irrelevance reduction", "predictive lossless coding", "weighted cascaded least mean squared", "WCLMS lossless coder", "subjective listening test", "pre-filter/lossless coder", "audio quality"], "prmu": ["P", "R", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "132", "title": "A unified view for vector rotational CORDIC algorithms and architectures based on angle quantization approach", "abstract": "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", "keyphrases": ["vector rotational CORDIC algorithms", "digital signal processing applications", "DSP applications", "angle quantization", "design index", "vector rotational operation", "unified design framework", "low-latency rotational algorithms", "greedy searching algorithm", "low-latency rotational architectures", "searching algorithms", "optimization problem", "scaling operations", "high-speed rotational VLSI circuits", "low-complexity rotational VLSI circuits", "fixed-point implementations", "trellis-based searching algorithm"], "prmu": ["P", "P", "M", "P", "P", "P", "P", "P", "M", "R", "P", "P", "P", "R", "P", "P", "M"]}
{"id": "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", "keyphrases": ["deterministic control", "L/sup infinity / running cost", "homogenization", "value function", "averaging", "calculus of variations", "convergence", "optimal control", "cell problem"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["rotorcraft", "helicopter noise", "helicopter vibration", "vibration control", "active trailing edge flap", "lever-cusp hinge amplification device", "finite-element model", "aerodynamic loading", "12 inch flap", "inertial loading", "design", "shear tube actuator flap", "bench top testing", "piezoelectric tube actuator", "induced-shear tube actuator", "12 inch"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["NAS parallel benchmarks", "high-performance machines", "compiler", "distributed-memory parallel supercomputers", "HPF compiler"], "prmu": ["P", "P", "P", "M", "P"]}
{"id": "1277", "title": "Dynamic modification of object Petri nets. An application to modelling protocols with fork-join structures", "abstract": "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", "keyphrases": ["dynamic modification", "object Petri nets", "protocols", "fork-join structures", "token objects", "mathematically rigorous foundations", "object net formalisms"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "622", "title": "Source/channel coding of still images using lapped transforms and block classification", "abstract": "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", "keyphrases": ["joint source-channel coding", "still images", "lapped transforms", "block classification", "image coding", "channel-optimised robust quantisers", "low complexity"], "prmu": ["M", "P", "P", "P", "R", "P", "R"]}
{"id": "909", "title": "Influence of the process design on the control strategy: application in electropneumatic field", "abstract": "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", "keyphrases": ["electropneumatic systems", "positioning systems", "position control", "monovariable control", "multivariable control", "velocity control", "tracking", "energy consumption", "nonlinear control", "flatness theory"], "prmu": ["P", "R", "R", "R", "R", "R", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["semidefinite feasibility problems", "analytic center cutting plane method", "operations research", "nonempty bounded convex body", "symmetric positive semidefinite matrices", "oracle", "iteration", "approximate analytic center", "working set", "worst-case complexity", "maximum ball radius"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["tool condition monitoring", "drilling", "monitoring methods", "signal analysis", "diagnostic techniques", "tool wear", "failure monitoring", "indirect monitoring methods", "force measurements", "vibration measurements", "current measurements", "statistical parameters", "fast Fourier transform", "wavelet transform", "automatic diagnostic tools"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "R", "R", "P", "P", "R", "P", "P"]}
{"id": "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", "keyphrases": ["double-sided arc welding", "laser welding process", "control system", "process control", "thick material welding", "energy density", "controlled pulse keyhole"], "prmu": ["P", "P", "P", "R", "P", "U", "R"]}
{"id": "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", "keyphrases": ["SBC Communications", "regulatory compliance", "telecom carrier"], "prmu": ["P", "P", "M"]}
{"id": "1397", "title": "Computer program for calculating the p-value in testing process capability index C/sub pmk/", "abstract": "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", "keyphrases": ["testing process capability index", "computer program", "process potential", "process performance", "testing hypothesis", "natural estimator", "Maple", "in-plant applications", "preset capability requirement", "reliable decisions", "p-value calculation"], "prmu": ["P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["IT upgrades", "business issues", "costs", "IT resellers", "consultants", "Microsoft"], "prmu": ["P", "P", "P", "P", "P", "U"]}
{"id": "1096", "title": "Evaluating alternative manufacturing control strategies using a benchmark system", "abstract": "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", "keyphrases": ["alternative manufacturing control strategies", "benchmark system", "dynamic job routing", "job sequencing decisions", "distributed control system", "disturbance adaptability", "agent-based control system", "discrete-event simulation model", "experimental test-bed", "benchmark manufacturing system", "production volumes", "disturbance frequencies", "hybrid strategies", "reactive agent mechanisms", "allocation strategies", "contract net", "job congestion"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Java", "GUI library", "Swing library", "travel dictionaries", "translation programs", "user-interface language", "locale switching", "MLMetalLookandFeel"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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?", "keyphrases": ["website", "web chat", "collaborative browsing", "customer service representative", "call centre"], "prmu": ["U", "M", "U", "M", "U"]}
{"id": "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", "keyphrases": ["image deblurring", "wavelet packet bases", "convolution", "operator diagonal", "total variation approach", "ringing", "staircasing", "deconvolution"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["students", "undergraduate program", "computer science education", "Carnegie Mellon University", "women", "history", "research project", "gender issues"], "prmu": ["P", "P", "M", "P", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["cellular automata based versatile multiplier", "low-complexity programmable cellular automata", "security environments", "restricted computing environments", "smart cards", "wireless devices"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["attack-finding algorithm", "security protocols", "dynamic strand space model", "strand space model", "state space explosion", "asynchronous composition", "strand-added on demand", "check subterms", "data subterms", "Dolve-Yao protocol"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1152", "title": "Incorporating multi-leaf collimator leaf sequencing into iterative IMRT optimization", "abstract": "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", "keyphrases": ["intensity modulated radiation therapy", "treatment planning", "iterative optimization", "multileaf collimator leaf sequencing", "beam delivery", "beam optimization", "fluence patterns", "objective function parameters", "deliverable dose distribution", "empirical adjustment", "tumor dose", "optimized intensity", "gradient-based search algorithm", "beamlet ray intensities", "Newton method", "dose-volume objective values"], "prmu": ["P", "P", "R", "M", "P", "P", "P", "P", "P", "P", "M", "R", "U", "M", "M", "M"]}
{"id": "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", "keyphrases": ["automatic guided vehicle", "AGV", "material handling systems", "vehicle travel time", "flexible manufacturing system", "FMS", "vehicle dispatching rules", "nearest vehicle selection rule", "longest idle vehicle selection rule"], "prmu": ["M", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "542", "title": "The treatment of fear of flying: a controlled study of imaginal and virtual reality graded exposure therapy", "abstract": "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", "keyphrases": ["flying fear", "virtual reality graded exposure therapy", "imaginal exposure therapy", "phobia", "physiological feedback", "physiology", "questionnaires", "subjective ratings of anxiety", "behavioral observations", "Chi-square test", "patient treatment"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "968", "title": "Stabilization of global invariant sets for chaotic systems: an energy based control approach", "abstract": "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", "keyphrases": ["three-dimensional nonlinear chaotic systems", "stable stationary states", "time-periodic orbits", "sliding mode-based control", "energy based sliding mode control", "Chua's circuit", "global invariant sets"], "prmu": ["P", "P", "P", "P", "P", "M", "P"]}
{"id": "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", "keyphrases": ["knowledge flow management", "distributed team software development", "cognitive cooperation", "knowledge flow representation", "ordered knowledge sharing", "workflow process", "knowledge grid platform", "Internet", "software development management", "cooperative work"], "prmu": ["P", "P", "P", "M", "P", "P", "P", "P", "R", "M"]}
{"id": "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", "keyphrases": ["XML", "neural network exchange", "neural network markup language", "data dictionary", "preprocessing methods", "network structure", "network output interpretation"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Taiwan Power Company", "AM/FM", "Taipei City District Office", "Automated Mapping and Facilities Management", "pilot project", "complete service territory", "deregulation", "privatization"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["efficient stable ray tracing algorithm", "parametric surfaces", "ray-surface intersections", "Newton method", "Bezier clipping", "ray coherence", "Newton iteration", "obstruction detection technique", "convergence", "primary ray tracing", "secondary ray tracing"], "prmu": ["R", "P", "P", "R", "P", "P", "P", "P", "P", "R", "R"]}
{"id": "643", "title": "Time-resolved contrast-enhanced imaging with isotropic resolution and broad coverage using an undersampled 3D projection trajectory", "abstract": "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", "keyphrases": ["time-resolved contrast-enhanced imaging", "isotropic resolution", "broad coverage", "undersampled 3D projection trajectory", "3D MRI angiography", "variable density k-space sampling", "temporal k-space interpolation", "isotropic field of view", "pulmonary vasculature", "bolus passage", "abdomen", "thorax", "image artifacts", "breath-hold imaging"], "prmu": ["P", "P", "P", "P", "M", "P", "P", "P", "P", "P", "U", "U", "R", "R"]}
{"id": "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.\"", "keyphrases": ["businesses", "online connections", "server products", "Groove Networks", "organizational perspective", "personal perspective", "online collaboration", "knowledge work", "collaborative technologies", "inking technology"], "prmu": ["P", "P", "U", "P", "U", "U", "R", "U", "R", "M"]}
{"id": "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", "keyphrases": ["Qwest", "Calpoint", "telecom carrier"], "prmu": ["P", "P", "R"]}
{"id": "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)", "keyphrases": ["women of color", "computer science", "computer engineering", "ethnic minority", "higher education", "society", "gender issues"], "prmu": ["P", "P", "P", "M", "P", "U", "M"]}
{"id": "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", "keyphrases": ["storage functionals", "passive dynamical systems", "nonlinear time-invariant input-output dynamical systems", "passivity conditions", "dissipation inequality", "linear system", "fading memory", "necessary condition", "unique quadratic Lyapunov function", "complete monotonicity condition", "thermodynamic potential", "nonequilibrium thermodynamics", "automatic control", "mechanics", "viscoelastic materials"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["quantum-state information retrieval", "Rydberg-atom data register", "quantum search protocol", "phase information", "subpicosecond half-cycle electric field pulse", "phase retrieval", "peak field values", "constituent orbitals", "Rydberg wave packet register", "coherent control", "initial wave packet", "search method", "single energy eigenstates", "half-cycle pulse"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1037", "title": "A stochastic averaging approach for feedback control design of nonlinear systems under random excitations", "abstract": "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", "keyphrases": ["stochastic averaging", "feedback control", "nonlinear systems", "steady state", "transient response", "random excitations", "feedback stochastic controls", "Ito stochastic differential equation", "Rayleigh approximation"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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%", "keyphrases": ["women", "undergraduate computing", "societal factors", "cultural factors", "statistics"], "prmu": ["P", "R", "R", "P", "P"]}
{"id": "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", "keyphrases": ["quantum full adder", "scalable nuclear spin quantum computer", "nonresonant effects", "error minimization"], "prmu": ["P", "P", "M", "R"]}
{"id": "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", "keyphrases": ["Web services", "bank"], "prmu": ["P", "P"]}
{"id": "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", "keyphrases": ["agent-based product-support logistics system", "XML", "RDF", "service parts", "industrial systems", "maintenance services", "Resource Description Framework schema", "information modelling", "eXtensible Markup Language", "software agents"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Abelian branched coverings", "enumeration formula", "weak equivalence classes", "finite abelian groups", "explicit formula", "pseudofree spherical"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["separability", "quantum entanglement", "many spin system", "separable states", "matrix operator", "unity matrix", "entangled state", "random spin", "charge conjugation", "Einstein-Podolsky-Rosen state", "Werner density matrices", "critical point", "partial transposition method", "nonextensive entropy criterion", "quantum computing", "teleportation", "cryptography"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["e-filing", "Case Management and Electronic Case File system", "United States Courts", "Adobe Acrobat", "PDF"], "prmu": ["P", "P", "P", "M", "P"]}
{"id": "910", "title": "Control of a heavy-duty robotic excavator using time delay control with integral sliding surface", "abstract": "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", "keyphrases": ["time-delay control", "robust control", "robotic excavator", "integral sliding surface", "motion control", "trajectory control", "dynamics", "tracking", "pressure control"], "prmu": ["P", "M", "P", "P", "R", "M", "U", "U", "M"]}
{"id": "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", "keyphrases": ["optimal estimation", "finite sample", "discrete chaotic process", "optimal algorithm synthesis", "space-time filtering"], "prmu": ["P", "P", "P", "R", "U"]}
{"id": "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", "keyphrases": ["two-sided bounds", "initial-boundary value problems", "bounding operator approach", "bounding operators", "partial differential equations", "parabolic problems"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["knowledge management"], "prmu": ["P"]}
{"id": "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", "keyphrases": ["stochastic search procedure", "modified genetic algorithm", "near-optimal topologies", "load-bearing truss structures", "truss topology optimization", "triangles"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["taxonomy software", "taxonomy applications", "enterprise customers", "content management", "corporate portals", "internal information", "effective knowledge discovery"], "prmu": ["P", "R", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["3G spectrum", "federal government", "spectrum allocation system", "wireless carriers"], "prmu": ["P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["The Backyard Project", "high school girls", "computer industry careers", "college-bound high school students"], "prmu": ["P", "P", "R", "P"]}
{"id": "929", "title": "Closed loop finite-element modeling of active constrained layer damping in the time domain analysis", "abstract": "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", "keyphrases": ["three-dimensional finite-element closed-loop model", "Golla-Hughes-McTavish method", "viscoelastic material", "time domain analysis", "active constrained layer damping", "ACLD models", "passive constrained model", "active damping model", "passive damping", "vibration suppression", "structural damping", "viscoelastic layer"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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%", "keyphrases": ["TCRM", "tuple inconsistency", "granulized datasets", "granularization", "knowledge discovery", "tuple consistency recognition model", "relational database", "large database", "processing time", "equal width interval technique", "S-plus histogram binning algorithm", "largest binning size algorithm", "SQL"], "prmu": ["P", "P", "P", "P", "P", "P", "U", "U", "P", "P", "P", "P", "U"]}
{"id": "1257", "title": "Definition of a similarity measure between cases based on auto/cross-fuzzy thesauri", "abstract": "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", "keyphrases": ["case similarity measure", "relationship indices", "corresponding indices", "mutually distinct indices", "case-based retrieval", "decision making support system", "problem solving", "similar case retrieval", "auto-fuzzy thesaurus", "cross-fuzzy thesaurus"], "prmu": ["R", "R", "P", "P", "P", "M", "M", "P", "P", "P"]}
{"id": "602", "title": "Image fusion between /sup 18/FDG-PET and MRI/CT for radiotherapy planning of oropharyngeal and nasopharyngeal carcinomas", "abstract": "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", "keyphrases": ["image fusion", "/sup 18/FDG-PET", "MRI/CT", "radiotherapy planning", "nasopharyngeal carcinomas", "oropharyngeal carcinomas", "parotid glands", "simultaneous primary site recurrence", "normal tissues sparing", "superficial tumors", "primary tumors", "F"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "U"]}
{"id": "647", "title": "Experimental design methodology and data analysis technique applied to optimise an organic synthesis", "abstract": "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", "keyphrases": ["Michaelis-Becker dibromoalkane monophosphorylation reaction", "full factorial experimental design", "optimum conditions", "data analysis technique", "organic synthesis", "principal component analysis", "uncontrolled factors", "maximum-yield experimental conditions"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "80", "title": "Evaluating the performance of a distributed database of repetitive elements in complete genomes", "abstract": "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", "keyphrases": ["distributed Repeat Sequence Database", "biological data", "data distribution", "queries", "complete genomes", "repetitive elements", "performance evaluation"], "prmu": ["R", "P", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["word spotting", "a posterior measure", "keyword confidence", "acoustic layer scores", "syllable-based statistical language model scores", "a posteriori confidence measure", "forward-backward calculating algorithm", "zero false alarm assumption", "relative confidence measures", "word spotting task", "syllable lattice hidden Markov model", "confidence estimation", "optimal path search", "N-best syllable re-scoring", "speech recognition systems"], "prmu": ["P", "P", "P", "P", "R", "R", "P", "R", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1156", "title": "Favorable noise uniformity properties of Fourier-based interpolation and reconstruction approaches in single-slice helical computed tomography", "abstract": "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", "keyphrases": ["Fourier-based interpolation", "single-slice helical computed tomography", "reconstruction approaches", "noise uniformity properties", "medical diagnostic imaging", "conventional CT", "Fourier-based fan-to-parallel rebinning algorithm", "more uniform noise ratios", "low-contrast object detectability", "zebra artifacts", "maximum intensity projection images", "helical span geometry"], "prmu": ["P", "P", "P", "P", "M", "P", "P", "P", "P", "P", "R", "M"]}
{"id": "991", "title": "Estimation of blocking probabilities in cellular networks with dynamic channel assignment", "abstract": "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", "keyphrases": ["blocking probability estimation", "dynamic channel assignment", "cellular mobile communication networks", "strong coupling constraints", "occupancy vector", "approximate tractable models", "product form stationary state distributions", "CPU time", "simulation", "importance sampling", "low-load", "high cell capacity", "standard clock method", "static ISSC method", "bounded relative error", "quality of service", "dynamic ISSC method", "zero variance estimators", "single clique models", "network traffic load"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "R", "P", "M", "P", "P", "P", "R"]}
{"id": "546", "title": "Real-time quasi-2-D inversion of array resistivity logging data using neural network", "abstract": "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", "keyphrases": ["real-time quasi-2-D inversion", "array resistivity logging data", "neural network", "real-time inversion algorithm", "galvanic array tool", "dimensional reduction", "reciprocity", "superposition", "numerical focusing technique", "unfocused data", "1-D inversion", "focused data", "forward modeling", "formation resistivity", "well site"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["image reconstruction", "simulated specimens", "convolution back projection", "composite structures", "attenuation field", "filters", "reconstruction errors", "CBP algorithm", "composite regions", "engineering applications", "computerised tomography"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "U"]}
{"id": "1297", "title": "Stochastic optimization of acoustic response - a numerical and experimental comparison", "abstract": "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)", "keyphrases": ["numerical optimization", "acoustic emission minimization", "structure", "closed cylinder", "acoustic response", "forced vibration", "simulated annealing", "stochastic optimization", "gradient-based method"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "112", "title": "Revisiting Hardy's paradox: Counterfactual statements, real measurements, entanglement and weak values", "abstract": "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", "keyphrases": ["Hardy paradox", "counterfactual statements", "real measurements", "entanglement", "gedanken-experiments", "weak values", "paradoxical effects", "quantum mechanics"], "prmu": ["R", "P", "P", "P", "U", "P", "P", "P"]}
{"id": "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", "keyphrases": ["law firms", "strategic innovation", "management", "change", "clients", "experiments"], "prmu": ["P", "P", "U", "U", "U", "U"]}
{"id": "914", "title": "A knowledge management framework for the support of decision making in humanitarian assistance/disaster relief", "abstract": "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", "keyphrases": ["knowledge management framework", "decision support system", "humanitarian assistance", "disaster relief", "organizations", "information technology", "information needs", "knowledge sharing", "knowledge reuse", "real-time decision-making environments", "crisis management", "emergency medical assistance", "case-based reasoning"], "prmu": ["P", "M", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["payoff-switching differential game", "payoff switching", "outcome payoff", "reasoning strategy", "fuzzy reasoning", "fuzzy matrices", "game similarity matrix", "weighting vectors", "fuzzy inference", "differential game"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1196", "title": "Multiple shooting using a dichotomically stable integrator for solving differential-algebraic equations", "abstract": "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", "keyphrases": ["multiple shooting", "stiff boundary-value problem", "ordinary differential equations", "implicit Runge-Kutta method", "Lobatto IIIA formulae", "initial-value integrator", "dichotomically stable integrator", "differential-algebraic equations"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Broadway show lighting", "Manhattan", "New York City", "underground direct current power distribution system", "Thomas Edison's Pearl Street Station", "theater district", "stage lighting control", "resistance dimmer", "series-connected rheostat", "resistance taper", "apparent light output", "incandescent lamps", "DC powered stage lighting"], "prmu": ["R", "P", "P", "R", "R", "P", "P", "P", "P", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["quantum computation", "physical modeling", "quantum mechanical computing", "quantum mechanical many-body dynamics"], "prmu": ["P", "P", "P", "P"]}
{"id": "722", "title": "Updating systems for monitoring and controlling power equipment on the basis of the firmware system SARGON", "abstract": "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", "keyphrases": ["power industry", "Russia", "SARGON firmware system", "ZAO NVT-Avtomatika", "monitoring systems", "control systems", "power equipment monitoring", "power equipment control"], "prmu": ["P", "P", "R", "P", "R", "R", "R", "R"]}
{"id": "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", "keyphrases": ["open hypermedia", "maintenance", "operating information", "information resources", "just-in-time support", "product support"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["4YourSoul.com", "CardintheBox.com", "personalized printing", "personal cards", "online purchases"], "prmu": ["P", "P", "M", "P", "M"]}
{"id": "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)]", "keyphrases": ["delayed-choice entanglement", "quantum-information", "nonlocal quantum mechanical retrodiction effect", "quantum optical method", "singlet entangled state", "two-dimensional subspace", "state entanglement", "Fock states", "electromagnetic field mode", "vacuum-one-photon quantum states", "one-photon state", "vacuum state"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P", "R", "P", "P", "R"]}
{"id": "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", "keyphrases": ["optical two-step modified signed-digit addition", "binary logic gates", "modified signed-digit addition algorithm", "parallel computing", "input MSD digits", "flag digits", "binary bits", "addition steps", "low order pair", "carry propagation suppression", "two-step addition", "binary coded MSD", "optical shadow-casting logic system"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["mixture-maximum model", "spectral domain", "speech enhancement algorithm", "mixture model", "short time spectrum", "clean speech signal", "noisy speech spectrum", "noise robust speech recognition", "speech signal quality", "additive noise", "performance penalties", "dual codebook", "tied variances", "recorded speech signals", "noise sources", "low computational requirements", "Gaussian mixture model", "MIXMAX model", "speech intelligibility"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "M", "M", "M"]}
{"id": "136", "title": "Design of 1-D and 2-D variable fractional delay allpass filters using weighted least-squares method", "abstract": "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", "keyphrases": ["weighted least-squares method", "variable fractional delay allpass filters", "1D allpass filters", "2D allpass filters", "fractional delay parameter", "nonlinear phase error approximation", "weighted equation error", "cost function", "optimal polynomial coefficients", "linear simultaneous equations"], "prmu": ["P", "P", "M", "M", "P", "R", "P", "P", "P", "P"]}
{"id": "975", "title": "Algebraic conditions for high-order convergent deferred correction schemes based on Runge-Kutta-Nystrom methods for second order boundary value problems", "abstract": "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')", "keyphrases": ["high-order convergent deferred correction schemes", "Runge-Kutta-Nystrom methods", "second order boundary value problems", "deferred correction schemes", "second order nonlinear two-point boundary value problems", "algebraic conditions", "Taylor series expansions"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["modelling", "magnetorheological damping", "model-based control", "NARX models", "identification", "minimization", "simulation error", "validation", "MRD modelling"], "prmu": ["P", "M", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["merging algorithm", "recursive construction", "index data structures", "coupled BFS", "breadth-first search", "suffix trees", "integer alphabets", "linear time"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["network providers", "Savvis", "Radianz", "data-extranet", "telecommunication infrastructures", "investment banks", "brokerage houses", "exchanges", "alternative-trading systems"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["R-trees", "spatial indexing", "extended objects", "dynamic algorithms", "rectangular objects", "minimum mutual overlay", "graphical search", "computational geometry"], "prmu": ["P", "P", "P", "P", "P", "P", "U", "U"]}
{"id": "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", "keyphrases": ["high-performance Web server", "Concurrent Haskell", "network-based server applications", "lightweight concurrency", "high I/O throughput", "fault tolerance", "conforming server", "time-critical components"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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?", "keyphrases": ["scalable approach", "cerebellar based control", "nervous system", "computational cerebellar models", "light-weight robots", "robot control"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["mobile satellite phone services"], "prmu": ["P"]}
{"id": "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", "keyphrases": ["modular medium-voltage induction motor drives", "reliability enhancement", "failed module bypass", "available output voltage control"], "prmu": ["P", "R", "R", "R"]}
{"id": "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", "keyphrases": ["generalized spatio-chromatic diffusion", "color images", "diffusion", "thermodynamics", "irreversible transformations", "color channels", "color evolution", "spatial diffusive term", "nonlinear term", "vector-valued diffusion", "scale-space", "RGB", "CIELAB", "Opponent colors", "IHS"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "U", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Internet traffic streams", "dragonflies", "tortoises", "network traffic streams", "Internet stream size measurement", "Internet stream lifetime measurement", "traffic distributions", "mice", "elephants", "ISP", "forwarding cache mechanisms", "Internet routers", "long-running streams", "packet volume", "byte volume", "traffic provisioning", "traffic engineering"], "prmu": ["P", "P", "P", "P", "R", "R", "P", "P", "P", "P", "P", "P", "P", "R", "R", "R", "R"]}
{"id": "868", "title": "Two quantum analogues of Fisher information from a large deviation viewpoint of quantum estimation", "abstract": "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", "keyphrases": ["quantum analogues", "quantum estimation", "Kubo-Mori-Bogoljubov Fisher information", "consistent superefficient estimators", "statistical inference", "large deviation viewpoint", "symmetric logarithmic derivative Fisher information"], "prmu": ["P", "P", "P", "P", "U", "P", "P"]}
{"id": "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", "keyphrases": ["actively-controlled stretcher", "ambulance", "ride quality evaluation", "subjective evaluation", "ambulance transportation", "conventional stretcher", "assistant driver seat", "braking", "negative foot-to-head acceleration", "blood pressure variation", "patient head", "stretcher angle", "motion sickness", "nausea", "rapid acceleration", "rapid deceleration", "posture differences", "transported subject", "semantic differential method", "factor analysis", "head forward", "head backward", "comfortable transportation", "vibration"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "R", "R", "P", "P", "P", "R", "R", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["C++ language", "C language", "incompatibilities", "object-oriented programming", "class hierarchies", "low-level programming", "C++ libraries"], "prmu": ["P", "R", "P", "M", "U", "M", "M"]}
{"id": "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", "keyphrases": ["Bluetooth", "communications strategy", "wireless connection", "mobile"], "prmu": ["P", "P", "U", "U"]}
{"id": "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", "keyphrases": ["Oracle Small Business Suite", "NetLedger", "accounting", "resellers"], "prmu": ["R", "U", "U", "U"]}
{"id": "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", "keyphrases": ["support communities", "women", "computing", "networking", "professional support", "information dissemination", "faculty members"], "prmu": ["P", "P", "P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["ERP systems implementation", "Canadian government organizations", "best practices", "enterprise resource planning", "integrated real-time information", "administration", "result-based management", "social obligations", "higher legislative accountability", "public accountability", "innovation process theory framework"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P"]}
{"id": "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", "keyphrases": ["network society", "Italy", "European average", "Internet development", "Internet hostcount", "Europe", "Internet activity", "European Union", "Germany", "UK", "France", "worldwide average", "media control", "democratic institutions", "freedom of speech", "mainstream media", "broadcast media", "legal decisions", "regulatory decisions", "centralized control"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "R", "R", "P", "P"]}
{"id": "1137", "title": "On deciding stability of constrained homogeneous random walks and queueing systems", "abstract": "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", "keyphrases": ["queueing systems", "scheduling policy stability", "constrained homogeneous random walks", "generalized priority policy", "homogeneous random walk stability", "fluid limit computation", "undecidability results", "first-in-first-out policy", "priority policy", "undecidable problem"], "prmu": ["P", "R", "P", "P", "R", "R", "P", "R", "P", "P"]}
{"id": "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", "keyphrases": ["marble cutting", "single point cutting tool", "diamond segments", "frame sawing", "kinematic behaviour", "cutting tests", "indenting-cutting tests", "residual plastic deformation", "fracture chipping", "removal processes", "fracture theory", "brittle material indentation"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P"]}
{"id": "562", "title": "The Advanced Encryption Standard - implementation and transition to a new cryptographic benchmark", "abstract": "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", "keyphrases": ["Advanced Encryption Standard", "cryptographic benchmark", "coding", "unintelligible ciphers", "data exchange", "AES", "government", "business", "industry"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1236", "title": "Compatibility comparison and performance evaluation for Japanese HPF compilers using scientific applications", "abstract": "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", "keyphrases": ["High-Performance Fortran", "HPF", "source compatability", "portable programs", "parallel programming", "compilers", "parallel performance"], "prmu": ["P", "P", "R", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["ontology", "approximate reason", "information granules", "parameterized approximation spaces", "granules", "decision rules", "reflective judgment", "pattern recognition", "rough sets"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "M", "M"]}
{"id": "626", "title": "Approximate confidence intervals for one proportion and difference of two proportions", "abstract": "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", "keyphrases": ["approximate confidence intervals", "binomial proportion", "difference of two proportions", "data analysis", "t-approximation", "uncertainty", "variance estimation", "t-test", "normal distribution", "coverage probability", "pseudo-sample proportion"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["efficient tracking", "cross-correlation coefficient", "audio processing algorithms", "discrete-time signals", "time-dependent correlation", "recursive formula", "warping operation", "deformed correlation", "sinusoidal signals", "convergence behavior", "stationary signals", "dynamic behavior", "stationary state", "nonstationary signals", "tracking algorithm", "stereo music fragments", "digital audio recording"], "prmu": ["P", "P", "R", "P", "R", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["supply chains", "Forrester Research", "survey", "manufacturing", "business networks"], "prmu": ["P", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["pairwise thermal entanglement", "four-qubit Heisenberg XX chain", "five-qubit Heisenberg XX chain", "even-qubit chain", "odd-qubit chain", "critical temperature"], "prmu": ["P", "R", "P", "R", "P", "P"]}
{"id": "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", "keyphrases": ["Government budget", "accounting information policy", "Taiwan", "government managers", "rational decisions", "national resource allocation", "national resource evaluation", "Generally Accepted Accounting Principles"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "M"]}
{"id": "781", "title": "ICANN and Internet governance: leveraging technical coordination to realize global public policy", "abstract": "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", "keyphrases": ["ICANN", "Internet governance", "technical coordination", "global public policy", "Internet Corporation for Assigned Names and Numbers", "global regulations", "Internet use", "Internet domain name system", "Internet DNS", "governance-related features", "institutional design", "regulatory regime"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["super-resolution pits readout", "super-resolution reflective film", "Sb super-resolution reflective layer", "SiN dielectric layer", "numerical aperture", "Sb thin film thickness", "readout signal", "maximum CNR", "380 nm", "632.8 nm", "28 to 30 nm", "Sb-SiN"], "prmu": ["P", "P", "R", "R", "P", "P", "P", "P", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["implicit-explicit linear multistep methods", "contractivity", "numerical solution", "initial value problems", "ordinary differential equations", "linear autonomous systems", "Euclidean norm", "stability result"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["handles", "assignment operator", "self-assignment", "aliasing problems", "exception", "C++ program", "inheritance hierarchy"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["mail", "post room", "MCS", "consultant"], "prmu": ["P", "P", "P", "P"]}
{"id": "812", "title": "eLeaders make the Web work", "abstract": "Some companies are making the most of back-office/Web integration. Here are some winners", "keyphrases": ["back-office/Web integration", "e-commerce", "Visual Integrator", "Accpac eTransact"], "prmu": ["P", "U", "M", "U"]}
{"id": "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", "keyphrases": ["reentry programs", "computer science", "women", "Mills College", "UC Berkeley", "graduate degrees", "students", "professional employment", "minorities"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["disposable mobile phone", "simplified handsets", "reusable", "recyclable"], "prmu": ["P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["graphics", "layout", "PageFlex", "MediaRich", "PageRich", "composition", "software houses"], "prmu": ["P", "P", "P", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["entanglement measure", "dense coding capacity", "asymptotic entanglement measure", "bipartite states", "local quantum operations", "classical communications", "optimization"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "1234", "title": "Achieving performance under OpenMP on ccNUMA and software distributed shared memory systems", "abstract": "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", "keyphrases": ["cache-coherent Non-Uniform Memory Access", "OpenMP", "programming model", "shared memory parallel systems", "HPF", "Single Program Multiple Data", "parallel programming"], "prmu": ["P", "P", "P", "P", "P", "P", "R"]}
{"id": "1271", "title": "Verification of non-functional properties of a composable architecture with Petri nets", "abstract": "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", "keyphrases": ["non-functional properties verification", "MSS architecture", "timing properties", "composable architecture", "Petri nets", "proof of composability"], "prmu": ["R", "P", "P", "P", "P", "P"]}
{"id": "624", "title": "A hybrid ML-EM algorithm for calculation of maximum likelihood estimates in semiparametric shared frailty models", "abstract": "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", "keyphrases": ["hybrid ML-EM algorithm", "maximum likelihood estimates", "Cox proportional hazard models", "Busselton Health Study", "coronary heart disease data", "data analysis", "hazard functions", "simulations", "frailty variance estimates", "asymptotic distribution", "normal distribution", "normal random variable", "semiparametric shared log-normal frailty models"], "prmu": ["P", "P", "P", "P", "P", "M", "P", "P", "P", "P", "R", "P", "P"]}
{"id": "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)", "keyphrases": ["agile business", "corporate transformation", "organisational change"], "prmu": ["P", "U", "R"]}
{"id": "1135", "title": "A combinatorial, graph-based solution method for a class of continuous-time optimal control problems", "abstract": "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", "keyphrases": ["continuous-time optimal control problems", "combinatorial graph-based solution", "bang-bang control regimes", "singular control regimes", "numerical computation", "combinatorial search", "shortest path algorithm", "single-state problems", "multiple control functions", "production planning problem", "train operation problem", "weighted graph nodes", "sequence-dependent manner"], "prmu": ["P", "R", "R", "R", "P", "P", "R", "P", "P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["upper bound analysis", "oblique cutting", "nose radius tools", "chip flow angle", "uncut chip area", "shear surface", "shear velocity", "chip velocity", "friction area"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["citizen centric identity management", "electronic services", "business information services", "user identification", "authentication", "public key infrastructure", "smart cards", "legal framework", "government", "standardization", "public information services"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "U", "P", "P", "R"]}
{"id": "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", "keyphrases": ["X-ray microtomography", "3D representations", "microstructure", "voxel size", "European Synchrotron Radiation Facility", "hydrating portland cement pastes", "Plaster of Paris", "building brick", "cement hydration", "two-dimensional images", "microstructural images", "ESRF"], "prmu": ["P", "M", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["modeling", "periodic oscillations", "gene-protein systems", "nonlinear model", "time delay", "oscillations stability", "genetic regulation", "two-gene system", "autoregulatory feedback loop", "hysteretic properties", "jumping dynamics", "singular perturbation theory", "nonlinearly negative feedback loops", "nonlinearly positive feedback loops", "genetic regulatory system", "biochemical reactions", "stability region", "bifurcation", "circadian rhythm", "relaxation oscillator"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "R", "R", "P", "P", "P", "U", "U", "M"]}
{"id": "977", "title": "Behavior of Runge-Kutta discretizations near equilibria of index 2 differential algebraic systems", "abstract": "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", "keyphrases": ["Runge-Kutta discretizations", "index 2 differential algebraic systems", "equilibria", "geometric properties", "half-explicit Runge-Kutta methods", "continuous system", "cut-off techniques", "scaling techniques", "invariant manifold", "discretized ordinary differential equations"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P", "P", "P"]}
{"id": "932", "title": "Modeling of torsional vibration induced by extension-twisting coupling of anisotropic composite laminates with piezoelectric actuators", "abstract": "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", "keyphrases": ["torsional vibration", "extension -twisting coupling", "anisotropic composite laminates", "piezoelectric actuators", "dynamic analytical model", "anisotropic piezoelectric laminate", "extension-twisting coupling effect", "Hamilton principle", "reduced bending stiffness", "equations of motion", "in-plane displacements", "out-of-plane displacement", "twisting", "structural coupling", "harmonic excitation", "parametric study", "composite laminate", "material anisotropy", "PZT"], "prmu": ["P", "M", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "U", "U"]}
{"id": "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", "keyphrases": ["parallel supercomputers", "clusters of workstations", "reductions", "parallel programming", "scientific computing", "language construct"], "prmu": ["P", "P", "P", "M", "M", "P"]}
{"id": "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", "keyphrases": ["database applications", "control flow analysis", "data flow analysis", "reduction algorithms", "Graph Walk algorithm", "control flow graph", "Call Graph Firewall algorithm", "impact analysis", "Structured Query Language", "SQL", "exception programming", "integrity constraints", "table triggers", "two phase regression testing methodology"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["image segment representation", "arbitrarily shaped image segments", "wavelet basis", "improved image quality", "reduced computational load", "discrete wavelet transform", "DWT"], "prmu": ["P", "P", "P", "P", "P", "M", "U"]}
{"id": "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", "keyphrases": ["on-line robust processing techniques", "measurement dropout elimination", "normally distributed measurement noise", "classical least-squares procedures", "Fourier spectra", "frequency response function", "measurement outliers", "computation speed", "speckle dropout", "optical vibration measurements", "laser Doppler vibrometer", "laser interferometer", "modal analysis", "vibration velocity", "iterative technique", "low-pass filtering", "median filtering", "robust regression", "signal sampling", "order statistics", "sinusoidal excitation", "broadband excitation", "frequency spectra"], "prmu": ["P", "M", "P", "P", "P", "P", "P", "P", "M", "P", "P", "M", "U", "M", "M", "M", "M", "P", "U", "U", "U", "U", "R"]}
{"id": "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", "keyphrases": ["3G licence holders", "saturated markets", "mothball", "mobile telephony"], "prmu": ["P", "P", "P", "U"]}
{"id": "704", "title": "Multicell converters: active control and observation of flying-capacitor voltages", "abstract": "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", "keyphrases": ["multicell converters", "active control", "flying-capacitor voltages", "Kalman filtering", "multilevel systems", "nonlinear systems", "power electronics", "power systems harmonics", "series-connected switches", "output waveforms improvement", "input voltage"], "prmu": ["P", "P", "P", "U", "U", "U", "U", "U", "P", "R", "P"]}
{"id": "1351", "title": "Analytic PCA construction for theoretical analysis of lighting variability in images of a Lambertian object", "abstract": "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", "keyphrases": ["analytic principal component analysis", "spherical harmonics", "lighting variability", "five-dimensional subspace", "convex Lambertian object", "surface normal vectors", "principal eigenmodes", "principal eigenvalues", "radiance", "irradiance"], "prmu": ["R", "P", "P", "M", "P", "P", "P", "R", "U", "P"]}
{"id": "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", "keyphrases": ["multi-timescale Internet traffic engineering", "packet-based hop-by-hop routed networks", "TCP congestion control", "packet marking disciplines", "resource allocation", "control timescale", "operator services", "Internet management", "admission control", "ECN proxy", "BGP routing protocol"], "prmu": ["P", "P", "R", "P", "R", "R", "R", "P", "M", "U", "M"]}
{"id": "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", "keyphrases": ["optimization", "advertising expenses", "insurance company", "Pontryagin maximum principle", "optimal time distribution", "differential equations"], "prmu": ["P", "P", "P", "R", "P", "U"]}
{"id": "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", "keyphrases": ["Glasgow Haskell compiler inliner", "higher-order languages", "functional programming", "abstractions", "executable program", "performance", "algorithmic aspects", "functional language", "optimising compiler"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "R", "M"]}
{"id": "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", "keyphrases": ["scalable techniques", "nonparametric statistics", "real time robot learning", "locally weighted learning", "training algorithms", "complex phenomena", "autonomous adaptive control", "memory-based learning", "purely incremental learning", "devil-sticking", "pole-balancing", "humanoid robot arm", "inverse-dynamics learning", "statistical neural networks techniques", "nonparametric regression"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "R", "R", "P", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["contextual nets reachability", "Petri nets", "concurrent systems", "context dependent actions", "finite prefix", "goal marking", "linear programming"], "prmu": ["R", "P", "P", "P", "P", "P", "P"]}
{"id": "678", "title": "Marketing in CSIR libraries and information centres: a study on promotional efforts", "abstract": "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", "keyphrases": ["CSIR libraries", "information centres", "India", "promotional activities", "marketing", "information needs"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["switching synchronization scheme", "chaotic systems", "piecewise-linear dynamics", "robustness", "state observers"], "prmu": ["P", "P", "P", "P", "M"]}
{"id": "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!", "keyphrases": ["innovation", "law firms"], "prmu": ["P", "P"]}
{"id": "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", "keyphrases": ["attribute generation", "association rules", "decision tree", "training data", "attribute extraction", "data mining", "large database", "experiments"], "prmu": ["P", "P", "P", "P", "P", "P", "M", "P"]}
{"id": "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", "keyphrases": ["fuzzy modeling", "chemical processes", "expert fuzzy model", "fuzzy decision module", "process modeling"], "prmu": ["P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["oscillatory problems", "classical codes", "numerical integration", "differential equations", "oscillatory solutions", "perturbed oscillators"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "1169", "title": "An efficient algorithm for sequential generation of failure states in a network with multi-mode components", "abstract": "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", "keyphrases": ["multi-mode components reliability", "sequential failure states generation algorithm", "network failure states", "state enumeration problem", "K-shortest paths problem", "CPU time"], "prmu": ["R", "R", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["three-phase current symmetrization", "unbalanced voltage conditions", "Steinmetz system design", "power system control design", "optimization methods", "general analytical equations", "balanced voltage assumption"], "prmu": ["P", "P", "P", "M", "P", "P", "R"]}
{"id": "685", "title": "Robotically enhanced placement of left ventricular epicardial electrodes during implantation of a biventricular implantable cardioverter defibrillator system", "abstract": "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", "keyphrases": ["epicardial leads", "left ventricular pacing", "left ventricular epicardial electrodes", "biventricular implantable cardioverter defibrillator system implantation", "coronary sinus", "daVinci surgical system", "totally endoscopic direct placement", "advanced heart failure patients", "left ventricular stimulation lead positioning"], "prmu": ["R", "R", "P", "R", "P", "P", "P", "P", "R"]}
{"id": "1295", "title": "Development of visual design steering as an aid in large-scale multidisciplinary design optimization. II. Method validation", "abstract": "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", "keyphrases": ["visual design steering", "large-scale multidisciplinary design optimization", "method validation", "graph morphing", "optimal design problems", "reliability", "accuracy", "cycle time", "design variable impact", "constraint redundancy", "constraint allowable limits", "function smoothness"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["decoherence inhibition", "ancilla processes", "decoherence", "single two-state quantum system", "qubit", "thermal bath", "auxiliary systems", "extra qubits", "extra classical fields", "quantum information processing", "general condition", "decoherence-free quantum memories", "quantum operations", "sphere surface"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["noise-constrained hyperspectral data compression", "storage requirements", "transmission requirements", "hyperspectral data sets", "hardware costs", "information content", "compression ratios", "lossless compression techniques", "data integrity", "slightly lossy compression algorithm", "noise statistics", "adaptive principal components analysis algorithm", "noise level", "airborne visible/infrared spectrometer hyperspectral digital imagery collection experiment", "AVIRIS HYDICE", "hyperspectral mapper", "HYMAP", "Hyperion datasets", "Gaussian statistics"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "R", "R", "P", "P", "P", "M"]}
{"id": "798", "title": "ClioWeb, ClioRequest, and Clio database: enhancing patron and staff satisfaction", "abstract": "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", "keyphrases": ["Clio database", "ClioRequest", "ClioWeb", "staff satisfaction", "patron satisfaction", "faculty", "students", "interlibrary loan department", "user-friendly method", "management system", "remote interconnectivity", "workflow efficiency", "data management", "Washington College"], "prmu": ["P", "P", "P", "P", "R", "P", "P", "R", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["quantum computer", "fermions simulation", "real-time probabilistic simulation", "classical computers", "dynamical sign problem", "exponential complexity", "fermion systems", "sign problem", "isomorphisms", "algebras"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["19in monitors", "CRT survey", "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", "ViewSonic G90f", "19 in"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1375", "title": "Evaluation of the usability of digital maintenance manuals developed without either user input or a task analysis", "abstract": "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", "keyphrases": ["digital maintenance manuals usability", "navigational aid", "usability trials", "information retrieval", "generic task model", "user interaction", "task analysis"], "prmu": ["R", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Strobbe Graphics", "Punch International", "Agfa", "commercial printing", "Polaris", "platesetters", "workflow"], "prmu": ["P", "U", "P", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["direct gear tooth contact analysis", "hypoid bevel gears", "mathematical model", "generating process", "first order singularity", "operator equation", "second order conditions", "first order conditions", "generated gear tooth flanks", "contact paths", "nonlinear equation system", "exact bound determination", "transmission error", "curvature properties", "contact ellipses", "bearing area", "automatic differentiation", "geometric quantities", "machine accuracy", "computer"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "R", "P", "R", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["stability", "convergence analysis", "stabilizing corrections", "splitting scheme", "initial-boundary value problems", "convection-diffusion-reaction equations"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["four-terminal quantum resistor network", "electron-wave computing", "interconnected ultrathin conducting wires", "quasi1D electron waveguides", "rerouting", "Landauer-Buttiker theory", "multiple elastic scatterers", "Aharonov-Bohm rings", "logic functions", "transmission probability", "Buttiker symmetry rule", "transmission behavior", "Kirchhoff current conservation law", "equitransmission property"], "prmu": ["P", "P", "P", "M", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1348", "title": "Reconstructing surfaces by volumetric regularization using radial basis functions", "abstract": "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", "keyphrases": ["surfaces reconstruction", "volumetric regularization", "radial basis functions", "sparse range data", "noisy data", "nonuniform data", "low resolution range data", "data acquisition techniques", "computer vision", "stereo range images", "space carving", "3D point sets", "vision-based data sets", "3D implicit surface", "weighted radial basis functions"], "prmu": ["P", "P", "P", "R", "R", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["PDF subscriptions", "SD Times", "Adobe Acrobat PDF files", "newspaper", "electronic issue", "digital versions", "magazines"], "prmu": ["P", "P", "P", "P", "R", "P", "P"]}
{"id": "836", "title": "Recruitment and retention of women graduate students in computer science and engineering: results of a workshop organized by the Computing Research Association", "abstract": "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", "keyphrases": ["recruitment", "retention", "women graduate students", "computer science", "engineering", "Computing Research Association", "social scientists", "academic communities", "research communities", "directors", "workshop participants"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P"]}
{"id": "873", "title": "Programmatic efforts encouraging women to enter the information technology workforce", "abstract": "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", "keyphrases": ["National Science Foundation", "women", "computing", "graduate school", "engineering", "IT workforce", "history"], "prmu": ["P", "P", "P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["typed representation", "HTML documents", "combinator library", "software libraries", "meta language", "parameterized documents", "conditional content", "Web sites", "element-transforming style", "functional programming", "syntax", "XML documents", "Haskell", "embedded domain specific languages"], "prmu": ["P", "R", "P", "M", "P", "P", "P", "P", "P", "M", "P", "P", "P", "P"]}
{"id": "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)]", "keyphrases": ["contiguity", "Turing degree", "recursively enumerable set", "upper semilattice", "nonzero element", "recursion theory"], "prmu": ["P", "M", "M", "P", "P", "U"]}
{"id": "1154", "title": "The effect of voxel size on the accuracy of dose-volume histograms of prostate /sup 125/I seed implants", "abstract": "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)", "keyphrases": ["cumulative dose-volume histograms", "prostate /sup 125/I seed implants", "radioactive seed prostate implants", "voxel size", "computational speed", "in-house computer program", "hand-calculated dose-volume histograms", "single-seed dose-volume histograms", "/sup 125/I model", "/sup 125/I prostate implant patients", "VariSeed treatment planning software's dose-volume histogram algorithm", "I"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "R", "R", "R", "R", "P"]}
{"id": "993", "title": "A large deviations analysis of the transient of a queue with many Markov fluid inputs: approximations and fast simulation", "abstract": "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", "keyphrases": ["large deviations analysis", "Markov fluid inputs", "transient buffer content distribution", "buffer resources", "bandwidth resources", "approximations", "transient overflow probability", "simulation methods", "importance sampling", "computational complexity", "ATM multiplexers", "IP routers", "queuing theory"], "prmu": ["P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "U", "U", "U"]}
{"id": "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", "keyphrases": ["medical virtual reality", "psychology", "flying phobia", "patient treatment", "psychological interventions", "anxiety disorders", "virtual exposure", "exposure therapy"], "prmu": ["M", "P", "P", "R", "P", "M", "R", "P"]}
{"id": "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", "keyphrases": ["bit-serial AB/sup 2/ multiplier", "modified inner product", "multiplication algorithm", "hardware architecture", "modified inner-product multiplier", "linear feedback shift register", "irreducible all one polynomial", "space complexity", "time complexity", "public-key cryptosystem"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["compilers", "optimizations", "compilation sequence", "adaptive compiler", "optimizing compilers", "biased random search", "configurable compilers"], "prmu": ["P", "P", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["XML", "SGML", "standardization", "grafting process", "Type I succession", "Extensible Markup Language", "Standard Generalized Markup Language"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["railway transportation", "accidents", "normal train operation", "Computer VR Simulation System", "virtual reality simulation system", "abnormal conditions correction"], "prmu": ["P", "P", "P", "P", "R", "R"]}
{"id": "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", "keyphrases": ["BOLD contrast MRI", "oxygen-enhanced MRI", "hyperoxia", "brain", "oxygen breathing", "normal air breathing", "physiological response function", "correlation analysis", "venous reaction", "significance threshold", "paradigm complexity", "MRI contrast agent", "functional imaging", "Fourier transform Analysis"], "prmu": ["R", "P", "P", "P", "R", "R", "P", "P", "P", "P", "R", "M", "M", "M"]}
{"id": "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", "keyphrases": ["double sampling s-control charts", "agile manufacturing", "double sampling X-control charts", "process mean shift detection", "process standard deviation", "statistical process control", "genetic algorithm"], "prmu": ["P", "P", "R", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Sprint", "telecom service providers", "regulations", "anti-spam act", "lawsuit"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "1403", "title": "IT: Utilities", "abstract": "A look at five utilities to make your PCs more, efficient, effective, and efficacious", "keyphrases": ["utilities", "PCs", "MobileMessenger", "Post-it software", "EasyNotes", "Print Shop Pro", "Download Accelerator Plus"], "prmu": ["P", "P", "U", "U", "U", "U", "U"]}
{"id": "1097", "title": "A study on an automatic seam tracking system by using an electromagnetic sensor for sheet metal arc welding of butt joints", "abstract": "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", "keyphrases": ["sheet metal arc welding", "butt joints", "automatic seam tracking system", "electromagnetic sensor", "eddy current generation", "weld line detection", "root gap size", "seam tracking accuracy"], "prmu": ["P", "P", "P", "P", "R", "R", "P", "P"]}
{"id": "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", "keyphrases": ["Java", "critical resources", "mutexes", "database connections", "transactions", "file handles", "garbage collector", "resource-releasing code", "Tattletale technique", "resources leaking"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["technical skills", "computer science degree programs", "undergraduate level", "graduate level", "cultural expectations", "women student recruitment", "women student retention"], "prmu": ["P", "P", "R", "P", "P", "R", "R"]}
{"id": "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", "keyphrases": ["canonical dual frame", "wavelet frame", "Gabor frames", "multiresolution hierarchy", "compact support"], "prmu": ["P", "P", "M", "U", "U"]}
{"id": "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", "keyphrases": ["generalized rough approximations", "classical indiscernibility relation", "binary reflexive relation", "generalized rough approximation mappings", "elementary granules"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Mgh-Performance Fortran", "legacy Fortran codes", "parallel performance", "HPF compilers", "compiler analysis", "compiler optimization", "Rice dHPF compiler", "multipartitioning", "automatic parallelization"], "prmu": ["M", "P", "P", "P", "P", "R", "P", "P", "M"]}
{"id": "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", "keyphrases": ["stochastic recurrences", "Jackpot Keno", "mathematical model", "simulation", "Jupiters Network Gaming", "house net hold", "piecewise linear", "ternary domain split", "random number generator", "inverse problem", "stochastic binary search", "probability", "experimental results", "legal requirement", "Chinese lottery game"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "908", "title": "Multivariable H/sub infinity // mu feedback control design for high-precision wafer stage motion", "abstract": "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", "keyphrases": ["IC manufacture", "multivariable control systems", "weighting filters", "MIMO systems", "H/sub infinity / control", "feedback", "servo systems", "model uncertainty", "motion control", "mechatronics", "mu synthesis"], "prmu": ["U", "M", "P", "M", "R", "P", "U", "M", "R", "U", "M"]}
{"id": "1177", "title": "Comparative statistical analysis of hole taper and circularity in laser percussion drilling", "abstract": "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", "keyphrases": ["comparative statistical analysis", "hole taper", "circularity", "laser percussion drilling", "stainless steel workpieces", "mild steel", "laser peak power", "laser pulse width", "pulse frequency", "assist gas pressure", "focal plane position", "central composite design", "process performance", "equivalent entrance diameter", "Ferets diameter", "linear multiple regression technique", "least squares procedure", "stepwise regression method", "analysis of variance", "ANOVA", "complete residual analysis"], "prmu": ["P", "P", "P", "P", "P", "P", "M", "M", "P", "U", "U", "P", "P", "M", "R", "P", "U", "M", "P", "P", "P"]}
{"id": "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", "keyphrases": ["polynomial programming", "semidefinite programming relaxations", "LP relaxations", "global minimization", "multivariate polynomial", "polynomial inequalities", "real algebraic geometry", "reformulation linearization technique", "semi-algebraic set", "constraint products", "RLT procedure"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "U", "P", "R", "P"]}
{"id": "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", "keyphrases": ["tool wear monitoring", "machining processes", "hidden Markov models", "vibration signals", "codebook", "vector quantization", "feature extraction", "tool state detection", "turning process", "HMM training", "discrete wavelet transform"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P", "R", "R", "U"]}
{"id": "61", "title": "Application of time-frequency principal component analysis to text-independent speaker identification", "abstract": "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", "keyphrases": ["time-frequency principal component analysis", "text-independent speaker identification", "vector filtering", "spectral trajectories", "speech parameterization", "cepstral analysis", "Delta Delta parameterization", "Delta parameterization", "auto-regressive vector modeling", "contextual principal components", "contextual covariance matrix", "closed-set speaker identification", "POLYCOST database", "cepstral coefficients", "confidence level", "Delta -coefficients"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "935", "title": "Experimental feedforward and feedback control of a one-dimensional SMA composite", "abstract": "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", "keyphrases": ["thermal activation", "embedded shape memory alloy", "SMA", "smart structures", "SMA actuators", "homogenization", "linear matrix", "models"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["complex dynamics", "nearly symmetric three-cell cellular neural networks", "CNN", "period doubling bifurcations", "large-size complex attractor", "symmetric interconnection matrix", "robustness", "complete stability", "perturbations", "stable limit cycles", "differential equations", "neuron interconnection matrix"], "prmu": ["P", "P", "P", "P", "P", "P", "U", "U", "U", "U", "U", "M"]}
{"id": "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", "keyphrases": ["Banach space", "Hadamard's condition", "Lipschitz continuous inverse", "L/sub p/ stability", "nonlinear system", "linear systems", "feedback systems"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "703", "title": "Direct self control with minimum torque ripple and high dynamics for a double three-level GTO inverter drive", "abstract": "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", "keyphrases": ["highly dynamic control scheme", "very low torque ripple", "direct self control", "torque hysteresis control", "medium-voltage induction motor drives", "double three-level inverter", "parallel connected inverters", "open motor windings", "stator flux", "torque quality", "variable-speed drives", "multilevel converters", "machine observer", "180 kW"], "prmu": ["P", "R", "P", "R", "P", "P", "R", "P", "P", "P", "M", "U", "M", "U"]}
{"id": "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", "keyphrases": ["real-time pediatric echocardiogram transmission", "single ISDN line", "videoconferencing system", "remote diagnosis", "children", "suspected congenital heart disease", "real-time echocardiogram interpretation", "videotape review", "immediate patient transfer", "remote patient management"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "1313", "title": "A collocation formulation of multistep methods for variable step-size extensions", "abstract": "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", "keyphrases": ["multistep methods", "variable step-size extensions", "collocation formulation", "difference operators", "equidistant time grid", "error-control algorithm", "piecewise polynomials", "k-step method", "variable step-size polynomial collocation formulation"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["five-axis NC milling", "ruled surfaces", "optimal geometry", "conical", "side milling", "conical milling cutter", "positioning", "cutter dimensions", "tolerance interval"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["wireless carrier industry", "Sprint PCS", "Verizon Wireless"], "prmu": ["P", "P", "P"]}
{"id": "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", "keyphrases": ["multiple criteria decision making", "interactive decision making schemes", "decision makers", "criteria values bounds", "efficient decisions"], "prmu": ["P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["receptive-field controllers", "mobile robots", "evolutionary methods", "real-world autonomous agents", "evolution strategies", "simple Braitenberg vehicles", "nonlinear interactions", "complex behavior", "radial basis functions", "scalability"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "M", "U"]}
{"id": "1057", "title": "Acceptance of a price discount: the role of the semantic relatedness between purchases and the comparative price format", "abstract": "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", "keyphrases": ["price discount acceptance", "preference reversal", "semantic relatedness hypothesis", "mental accounting shifts", "high relative saving version", "low relative saving version", "planned purchases", "comparative price format", "low-priced product"], "prmu": ["R", "P", "M", "P", "R", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["vertical short take-off landing aircraft", "VSTOL aircraft", "propulsion control", "flight control", "scheduling", "multivariable control systems", "observers", "state feedback", "fixed-point controllers"], "prmu": ["R", "M", "P", "R", "P", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["optimal filtering", "neural networks", "linear filtering", "binary telegraph signal", "observations", "discrete white noise"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["new lawyers", "firm's culture", "resources"], "prmu": ["P", "P", "P"]}
{"id": "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", "keyphrases": ["multiresolution Markov models", "statistical multiresolution modeling", "wavelets", "multigrid methods", "pyramidally organized trees", "self-similar processes", "1/f processes"], "prmu": ["P", "R", "P", "P", "P", "R", "P"]}
{"id": "1193", "title": "Operator splitting and approximate factorization for taxis-diffusion-reaction models", "abstract": "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", "keyphrases": ["operator splitting", "numerical solution", "mathematical biology", "spatial discretization", "PDE systems", "nonlinear ODEs", "numerical integration", "approximate matrix factorization", "Runge-Kutta methods", "linearly implicit Runge-Kutta-Rosenbrock methods", "approximate factorization", "taxis-diffusion-reaction models"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["information technology", "information", "information storage", "information processing", "information retrieval", "Indian universities"], "prmu": ["P", "P", "M", "R", "R", "P"]}
{"id": "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", "keyphrases": ["building automation systems", "HVAC", "heating", "ventilation", "air conditioning", "remote monitoring", "interoperability", "Internet", "real-time data"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["shape memory alloy", "manipulator", "open loop", "closed loop", "variable structure control", "control gain switching", "nonlinear control", "feedback", "stabilization", "tracking", "positioning", "nonlinear dynamics"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["quantum retrodiction", "probabilities", "preparation events", "measurement event", "time asymmetry", "quantum mechanics", "quantum communications", "cryptography", "retrodictive master equation", "backward time evolution", "preparation probabilities", "driven two level atom-electromagnetic field coupling", "open systems"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "M", "P"]}
{"id": "849", "title": "Ten years of strategies to increase participation of women in computing programs. The Central Queensland University experience: 1999-2001", "abstract": "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", "keyphrases": ["Central Queensland University", "women", "computing programs", "demographics", "Australian Higher Education"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["telecom carriers", "industry economics", "restructured companies", "debt levels", "bankruptcy"], "prmu": ["P", "P", "U", "U", "P"]}
{"id": "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", "keyphrases": ["quantum computing", "semiconductor heterostructures", "low temperatures", "high magnetic fields", "spin-spin interactions", "2D electron gas", "2DEG", "spin dynamics", "dominant carrier", "spin-excitons exchange", "integer quantum Hall regime", "integer QHE", "spin qubits", "semiconductor structures"], "prmu": ["P", "P", "P", "P", "P", "M", "U", "P", "P", "R", "P", "M", "P", "P"]}
{"id": "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", "keyphrases": ["Hadamard matrices", "dihedral groups"], "prmu": ["P", "P"]}
{"id": "1372", "title": "Knowledge acquisition and ontology modelling for construction of a control and monitoring expert system", "abstract": "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", "keyphrases": ["knowledge acquisition", "knowledge base", "intelligent system", "ontological engineering", "artificial intelligence", "knowledge reuse", "inferential modelling technique", "petroleum-production facility", "ontology modelling", "control and monitoring expert system"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["digitized video integration", "networked knowledge base", "Accident Response Group", "Sandia National Labs", "national security laboratory", "U.S. nuclear weapons programs", "searchable video database", "Screening Room package", "rich media content", "public-sector clients"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P", "M", "P"]}
{"id": "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", "keyphrases": ["professional cultures", "computer science", "two-body opportunity", "academics"], "prmu": ["P", "P", "P", "P"]}
{"id": "831", "title": "Software vendors' failure fuels consolidation theories [telecom interconnection and billing]", "abstract": "As independent software vendors like AP Engines fall by the wayside as independent entities, attrition could accelerate consolidation in the OSS space", "keyphrases": ["telecom interconnection", "telecom billing", "operations supports systems", "Quintessent", "consolidation", "AP Engines"], "prmu": ["P", "R", "U", "U", "P", "P"]}
{"id": "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", "keyphrases": ["control systems synthesis", "auxiliary surfaces", "robust control systems", "linear systems", "nonlinear systems", "algebraic inequalities", "integral inequalities", "linear equivalent moving"], "prmu": ["P", "P", "P", "R", "R", "R", "P", "P"]}
{"id": "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", "keyphrases": ["strategic implementation", "construction industry", "strategic implementation framework", "predictors", "large multi-national construction organisation", "SWOT analysis", "information technology", "information systems", "Project Management Information System", "mobile phone telecommunications network", "analytical hierarchy process"], "prmu": ["P", "P", "P", "P", "P", "U", "P", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["direct aperture optimization", "turnkey solution", "step-and-shoot IMRT", "IMRT treatment plans", "intensity distributions", "maps", "beam angle", "optimization step", "leaf-sequencing algorithm", "intensity map", "deliverable aperture shapes", "automated planning system", "aperture weights", "aperture shapes", "treatment delivery complexity", "machine dependent delivery constraints", "MLC", "aperture optimization algorithm", "leaf settings", "aperture intensities", "simulated annealing algorithm", "patient cases", "EGS4/BEAM Monte Carlo package", "dose calculation engine", "highly conformal step-and-shoot treatment plans", "beam segments", "monitor units", "highly efficient treatment deliveries", "full dosimetric benefits"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["interlingua-based Chinese-English machine translation system", "information processing", "natural language translation system", "syntactic parsing", "semantic analyzing"], "prmu": ["R", "P", "P", "P", "P"]}
{"id": "543", "title": "The development of virtual reality therapy (VRT) system for the treatment of acrophobia and therapeutic case", "abstract": "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", "keyphrases": ["virtual reality therapy system", "acrophobia treatment", "therapeutic case", "patient anxiety", "patient treatment", "realistic virtual environment", "exposure therapy", "personal computer", "virtual scene", "clinical treatment", "psychotherapy", "heights phobia"], "prmu": ["R", "R", "P", "R", "R", "P", "P", "P", "P", "P", "U", "M"]}
{"id": "994", "title": "Design and implementation of a flexible manufacturing control system using neural network", "abstract": "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", "keyphrases": ["Elman network", "finite state automata", "flexible manufacturing systems", "ladder language", "noisy inputs", "pneumatic system", "programmable controller", "recurrent neural network", "sequential control", "learning", "FMS"], "prmu": ["R", "P", "P", "U", "P", "M", "P", "P", "P", "U", "U"]}
{"id": "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", "keyphrases": ["projective synchronization", "nonpartially-linear chaotic systems", "scaling factor", "Rossler system", "Chua's circuit", "control", "hyperchaotic system"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "1252", "title": "An agent-oriented and service-oriented environment for deploying dynamic distributed systems", "abstract": "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", "keyphrases": ["agent-oriented environment", "service-oriented environment", "dynamic distributed systems", "JASE", "Java-based agent-oriented and service-oriented environment", "remote programming", "mobile agents", "performance evaluation"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["knowledge-based approach", "urban infrastructure management", "regulation", "dynamic monitoring", "municipal activities", "cooperative system", "SIGIU", "integrated operating systems", "SYDEX", "global planning system", "coordination system", "SYGEC", "video", "real-time management", "alarm control agent", "mobile agent", "intelligent decision support system", "urban planning", "multi-agent systems"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "M", "R", "M"]}
{"id": "642", "title": "Reconstruction of MR images from data acquired on an arbitrary k-space trajectory using the same-image weight", "abstract": "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", "keyphrases": ["sampling density compensation", "MRI image reconstruction", "arbitrary k-space trajectory", "spiral trajectory", "same-image weight", "random trajectory", "convolution function", "numerical phantom", "Nyquist sampling conditions", "iterative algorithm", "weighting function"], "prmu": ["P", "M", "P", "R", "P", "P", "M", "P", "M", "M", "R"]}
{"id": "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", "keyphrases": ["Shenandoah Valley Electric Cooperative", "engineering functions automation", "interactive model", "distribution system", "building block approach", "billing systems", "outage management", "staking", "line design", "metering", "databases", "MapViewer", "GIS"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["genetic algorithms", "fuzzy optimization problem", "fuzzy optimal profit problem", "economics", "business", "fuzzy price", "quadratic fuzzy demand function", "linear fuzzy demand function", "linear cost function", "approximate solution", "theoretical proofs", "algorithm correctness validation"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "R"]}
{"id": "1009", "title": "Robust output feedback model predictive control using off-line linear matrix inequalities", "abstract": "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", "keyphrases": ["robust output feedback model predictive control", "off-line linear matrix inequalities", "model uncertainty robustness", "robust constrained output feedback MPC algorithm", "polytopic uncertainty", "norm-bound uncertainty", "controller design procedure", "robust constrained state feedback MPC law", "state estimator", "explicit control law sequence", "closed-loop system", "asymptotically stable invariant ellipsoid"], "prmu": ["P", "P", "R", "P", "P", "P", "R", "P", "P", "R", "P", "U"]}
{"id": "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", "keyphrases": ["watershed modelling", "water management system", "US projects", "US Army Corps of Engineers", "automated information system", "water control management mission", "decision support tools", "water control managers", "data dissemination", "data acquisition", "data storage", "data verification", "data display", "data analysis", "data visualization", "decision support system", "Corps Water Management System"], "prmu": ["U", "P", "P", "P", "P", "P", "P", "P", "R", "M", "M", "M", "R", "M", "M", "R", "R"]}
{"id": "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", "keyphrases": ["SPTL/BIALL", "academic law libraries", "funding", "UK", "Ireland", "postal questionnaire", "information services", "Cardiff University", "survey"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["electronic files", "Kontiki", "P2P-like bandwidth harvesting technology", "centralized servers", "enduser machines", "redundant file requests", "underutilized bandwidth"], "prmu": ["P", "P", "R", "P", "P", "P", "P"]}
{"id": "1460", "title": "Detection of flaws in composites from scattered elastic-wave field using an improved mu GA and a local optimizer", "abstract": "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", "keyphrases": ["flaw detection", "composites", "scattered elastic-wave field", "improved mu GA", "local optimizer", "optimization problem", "surface displacement response", "flaw configurations", "objective function", "error norms", "convergence", "noise effect suppression"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "876", "title": "Perspectives on academic vs. industry environments for women in computer science", "abstract": "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", "keyphrases": ["industry environment", "academic environments", "women", "computer science", "faculty members", "software companies", "career", "children", "gender gap"], "prmu": ["P", "R", "P", "P", "P", "P", "U", "P", "U"]}
{"id": "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", "keyphrases": ["softswitch vendors", "voice over IP", "IP Centrex"], "prmu": ["P", "P", "P"]}
{"id": "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", "keyphrases": ["Extensible Markup Language", "XML", "Business to Customer", "BizTalk", "XML schema builder", "Business to Business", "electronic commerce", "Electronic Data Interchange", "Enterprise Resources Planning"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "M", "U"]}
{"id": "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", "keyphrases": ["knowledge-based approach", "business process reengineering", "SHAMASH", "process modelling tool", "organisation standards", "functional structure", "automatic model simulation", "optimisation", "knowledge-based system", "knowledge acquisition", "conceptual model"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "640", "title": "Scribe: a large-scale and decentralized application-level multicast infrastructure", "abstract": "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", "keyphrases": ["Scribe", "decentralized application-level multicast infrastructure", "scalable application-level multicast infrastructure", "Pastry", "generic peer-to-peer object location", "generic routing substrate", "Internet", "self-organization", "discrete event simulator", "locality properties", "best-effort reliability guarantees", "simulation results", "network topology model", "group size", "network nodes", "delay", "link stress", "Internet protocol multicast"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "P", "M", "P", "P", "P", "P", "P", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Hamburgische Electricitats-Werke", "Hamburg", "Germany", "distribution management system", "network management software", "Xpower", "Tekla Oyj"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Hopfield neural networks", "global stability", "sufficient conditions", "globally exponentially stable networks"], "prmu": ["P", "P", "P", "R"]}
{"id": "1151", "title": "A method for geometrical verification of dynamic intensity modulated radiotherapy using a scanning electronic portal imaging device", "abstract": "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", "keyphrases": ["dynamic intensity modulated radiotherapy", "geometrical verification method", "dynamic multileaf collimator", "safe delivery", "leaf trajectories", "on-line verification", "scanning read-out", "liquid-filled ionization chambers", "leaf positions", "diaphragm positions", "motion distortion effects", "reference field edge", "distorted field edges", "control system", "dose distributions", "treatment planning"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "U", "M"]}
{"id": "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", "keyphrases": ["algebraic modelling approach", "distributed problem-solving", "multi-agent systems", "unified framework", "social behaviors", "social dynamics", "social intelligence", "distributed task allocations", "resource assignments"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "541", "title": "Virtual-reality-based multidimensional therapy for the treatment of body image disturbances in binge eating disorders: a preliminary controlled study", "abstract": "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", "keyphrases": ["virtual reality", "multidimensional therapy", "body image disturbances", "binge eating disorders", "obesity", "patient therapy", "residential weight control treatment", "psychonutritional groups", "cognitive-behavior approach", "anxiety", "psychiatric symptoms"], "prmu": ["U", "P", "P", "P", "U", "R", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["vibratory bowl feeders", "automatic assembly systems", "passive air jet", "active air jet", "orienting devices", "parts feeding"], "prmu": ["P", "P", "R", "P", "P", "R"]}
{"id": "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", "keyphrases": ["pneumatic manipulators", "construction tasks", "positioning", "positional control", "angle trajectories", "long linear trajectory manipulator", "two-phase motion modes", "three-phase motion modes", "fuzzy logic controls", "gantry type machines"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P", "P", "P"]}
{"id": "1129", "title": "Computing stationary Nash equilibria of undiscounted single-controller stochastic games", "abstract": "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", "keyphrases": ["undiscounted single-controller stochastic games", "stationary Nash equilibria", "two-person nonzero-sum stochastic game", "linear complementarity problem", "stationary strategies", "limiting average payoff criterion", "copositive class matrix", "Lemke algorithm", "N-person stochastic games", "polymatrix stochastic games"], "prmu": ["P", "P", "R", "P", "P", "P", "R", "R", "P", "P"]}
{"id": "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", "keyphrases": ["perfusion quantification", "Gaussian process deconvolution", "dynamic susceptibility contrast MRI", "residual impulse response function", "optimized model parameters", "singular value decomposition", "noise level", "capillary blood flow", "mean transit time", "optimized joint Gaussian distribution", "correlation length", "likelihood function"], "prmu": ["P", "P", "P", "P", "R", "P", "P", "U", "M", "M", "U", "M"]}
{"id": "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", "keyphrases": ["information needs", "working journalists", "data analysis", "newspaper organisations", "information requirement", "information dissemination", "information sources", "professional work"], "prmu": ["P", "P", "M", "P", "P", "R", "P", "P"]}
{"id": "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", "keyphrases": ["management information systems", "scalable information systems", "lean manufacturing process", "client server hardware", "network infrastructure", "human resources", "legacy software", "information flow"], "prmu": ["M", "P", "P", "R", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["data backup", "The Gadget Shop", "e-business", "outsourced"], "prmu": ["P", "P", "U", "P"]}
{"id": "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", "keyphrases": ["scalable secure group communication", "IP multicast", "Internet protocol multicast", "storage overhead", "logarithmic overhead", "cryptography", "access control server", "authentication", "group membership", "group dynamics", "rekeying algorithm", "secure multicast group", "Internet-like topologies", "overhead", "simulation", "Internet topology map", "network routers", "bandwidth usage", "processing costs", "storage requirements"], "prmu": ["P", "P", "P", "P", "P", "U", "U", "U", "P", "P", "P", "P", "P", "P", "P", "P", "M", "P", "P", "P"]}
{"id": "913", "title": "Control of a coupled map lattice model for vortex shedding in the wake of a cylinder", "abstract": "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", "keyphrases": ["coupled map lattice", "vortex shedding", "wake", "proportional feedback", "coupled circle map oscillators", "spatio-temporal feedback control", "temporal circle map", "vortex dislocation", "1/1 lock-on", "discontinuous nonlinear control", "cylinder", "low Reynolds numbers", "vortex dislocations", "vibrating flexible cable"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "P", "P", "P", "P"]}
{"id": "581", "title": "Successive expansion method of network planning applying symbolic analysis method", "abstract": "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", "keyphrases": ["power system network successive expansion planning", "competitive electric power market", "competitive electric energy market", "competitive electric service market", "computer program", "symbolic analysis", "load flows", "symbolic analyzer", "power system DC load flows", "sensitivity analysis", "compensation methods", "precalculated distribution factors", "power system network expansion planning method"], "prmu": ["P", "P", "R", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["computer presentations", "visual technology", "law firms", "PowerPoint"], "prmu": ["P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["nonoptimal universal quantum deleting machine", "fidelity", "NUQDM", "universal quantum cloning machine"], "prmu": ["M", "P", "U", "P"]}
{"id": "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", "keyphrases": ["monotonicity conservation", "numerical solutions", "heat equation", "characteristic properties", "qualitative property", "one-step vector-iterations", "necessary and sufficient condition"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["account aggregation", "Yodlee", "screen scraping", "investment", "Web sites", "checking", "loans", "insurance", "Advent", "Fincentric", "bankers"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["fuzzy MCDM model", "ideal concepts", "anti-ideal concepts", "dimensionless indices", "fuzzy number ranking", "multicriterion decision-making"], "prmu": ["P", "R", "P", "P", "P", "U"]}
{"id": "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/", "keyphrases": ["solid balls", "finite graph", "adjacent vertices", "finite sequence", "graph representation"], "prmu": ["P", "P", "P", "P", "M"]}
{"id": "1370", "title": "Integrated support based on task models for the design, evaluation, and documentation of interactive safety-critical systems: a case study in the air-traffic control domain", "abstract": "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", "keyphrases": ["integrated support", "user interfaces", "inspection-based usability assessment", "technical documentation", "graphical user interfaces", "data-link communications", "task models", "interactive safety-critical systems", "air-traffic control domain"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["clinical trials", "drug companies", "FDA", "Documentum", "clinical trial content", "training services", "consulting services"], "prmu": ["P", "P", "P", "P", "P", "P", "R"]}
{"id": "1034", "title": "Vibration control of the rotating flexible-shaft/multi-flexible-disk system with the eddy-current damper", "abstract": "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", "keyphrases": ["rotating flexible-shaft/multi-flexible-disk system", "eddy-current damper", "rotating flexible-Timoshenko-shaft/flexible-disk coupling system", "assumed-mode method", "virtual work", "Lagrange's equations", "discretized equations of motion", "bilinear system", "quadratic feedback control laws", "nonlinear feedback control laws", "optimal feedback control laws", "shear vibrations", "flexible vibrations"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "R", "R", "P", "P", "R"]}
{"id": "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", "keyphrases": ["dense coding", "entangled states", "pairwise entangled qubits", "Alice", "Bob", "classical information gain efficiency", "maximally entangled qubits", "quantum information processing", "quantum communication"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "M", "R"]}
{"id": "937", "title": "Use of neural networks in the analysis of particle size distribution by laser diffraction: tests with different particle systems", "abstract": "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", "keyphrases": ["particle size distribution", "laser diffraction", "neural network modeling", "forward light scattering", "multiple scattering", "angular distribution of light", "solid-liquid suspensions", "particle shape distribution", "image analysis", "pattern recognition", "powdered materials", "backpropagation algorithm", "Fraunhofer optical model", "fluidized catalytic cracking"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "R", "P", "U", "U", "M", "M", "U"]}
{"id": "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", "keyphrases": ["cable architecture", "VoIP", "voice-over-IP", "two-way interactive infrastructure", "core IP transport network", "United States", "PacketCable 1.x architecture", "PacketCable-based approach"], "prmu": ["P", "P", "P", "R", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["biorthogonal nonuniform filter banks", "tree structured filter bank", "biorthogonal pairs", "dyadic filter banks", "dyadic trees", "stability preserving", "FIR preserving", "rational transfer functions"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "P"]}
{"id": "1249", "title": "Aggregators versus disintermediators: battling it out in the information superhighstreet", "abstract": "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", "keyphrases": ["large-scale content aggregators", "online information service", "information supply chain", "disintermediators"], "prmu": ["P", "P", "P", "P"]}
{"id": "63", "title": "Geometric source separation: merging convolutive source separation with geometric beamforming", "abstract": "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", "keyphrases": ["geometric source separation", "geometric beamforming", "convolutive blind source separation", "adaptive beamforming", "cross-talk", "leakage problem", "blind algorithms", "cross-power minimization", "second-order source separation", "geometric linear constraints", "frequency permutations", "degrees of freedom", "sensors", "room recordings", "acoustic sources"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "659", "title": "Integration - no longer a barrier? [agile business]", "abstract": "Web services will be a critical technology for enabling the 'agile business'", "keyphrases": ["agile business", "Web services", "integration middleware", "Iona", "AMR Research"], "prmu": ["P", "P", "M", "U", "U"]}
{"id": "1148", "title": "Benchmarking of the Dose Planning Method (DPM) Monte Carlo code using electron beams from a racetrack microtron", "abstract": "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", "keyphrases": ["dose planning method Monte Carlo code", "scanned electron beams", "racetrack microtron", "benchmarking", "central axis depth dose measurements", "profile scans", "water phantom", "ion chamber", "source spatial distributions", "two-dimensional beam profile", "in-air spatial distributions", "MCNP4B", "electron beam dose calculations", "radiotherapy treatment planning", "electron transport", "scoring parameters", "10 MeV", "50 MeV"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "U", "P", "M", "M", "U", "R", "P"]}
{"id": "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", "keyphrases": ["OS porting", "application development", "consumer operating system", "hardware design"], "prmu": ["P", "P", "P", "P"]}
{"id": "892", "title": "Dementing disorders: volumetric measurement of cerebrospinal fluid to distinguish normal from pathologic finding - feasibility study", "abstract": "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", "keyphrases": ["cerebrospinal fluid volumetric measurement", "magnetic resonance imaging technique", "medical diagnostic imaging", "healthy subjects", "dementing disorders", "normal-pathologic findings distinguishing", "diagnostic information", "neurodegenerative diseases classification", "automated methods", "cerebral atrophy distribution", "cerebral atrophy severity"], "prmu": ["R", "U", "M", "U", "P", "M", "P", "R", "P", "R", "R"]}
{"id": "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", "keyphrases": ["nonlinear systems", "robust self-tuning PID controller", "preload relay", "robust performance", "chattering phenomenon", "naturally occurring signal", "controller tuning", "controller re-tuning", "relay disabling", "operating regime", "time-varying systems", "continuous tuning", "stability properties", "simulation results", "fluid level control", "spherical tank"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "R", "R", "P", "P", "R", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["probability learning task", "rational choice theory", "probability matching", "payoff probability", "response probabilities", "choice anomaly", "large financial incentives", "meaningful regular feedback", "extensive training", "optimal response strategy", "feedback", "rationality"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P"]}
{"id": "701", "title": "High dynamic control of a three-level voltage-source-converter drive for a main strip mill", "abstract": "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", "keyphrases": ["medium-voltage drive", "high dynamic control system", "gate-turn-off thyristors", "switching frequency", "efficiency", "three-level voltage-source converter", "synchronous motor", "strip mill", "mechanical power", "motor voltage", "control objective", "DC-link voltage regulation", "DC-link voltage balancing", "current harmonics", "torque harmonics", "motor flux", "excitation", "8.3 MW", "3 kV"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "R", "P", "P", "P", "U", "M"]}
{"id": "744", "title": "A virtual victory [virtual networks]", "abstract": "Newly fashionable virtual network operators look all set to clean up in the corporate sector", "keyphrases": ["virtual network operators", "corporate sector"], "prmu": ["P", "P"]}
{"id": "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", "keyphrases": ["nonlinear splittings", "block implicit methods", "blended implementation", "ODEs", "numerical method", "diagonal splitting", "parallel computers", "numerical tests"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1354", "title": "Design and analysis of optimal material distribution policies in flexible manufacturing systems using a single AGV", "abstract": "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", "keyphrases": ["optimal material distribution policies", "flexible manufacturing systems", "AGV", "automated guided vehicle", "material handling", "machine centres", "waiting time", "manufacturing lead time", "optimal scheduling", "idle time minimization", "material delivery"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "M", "P", "R", "P"]}
{"id": "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", "keyphrases": ["real-time monitoring system", "LVQ", "pattern recognition technique", "learning vector quantization", "condition monitoring", "fault diagnosis", "fault signatures", "health monitoring", "deterioration identification", "real-time failure cause identification", "fault database", "pattern vectors", "pattern correlation", "large sampling time", "fast learning model", "neural networks", "competitive learning model", "enforcement training", "fault diagnostic capability", "CNC machine centre", "coolant system"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "P", "R", "R", "P", "P", "R", "P", "P", "P", "P", "P", "P", "U", "M"]}
{"id": "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", "keyphrases": ["dialog boxes", "cross-platform resources", "dialog size changes", "localization", "XML", "automatic layout", "run-time dialog creation", "platform-specific resources", "Mac OS 9.1", "Mac OS X", "Microsoft Windows", "cross-platform programming", "adaptable dialog boxes"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "852", "title": "Building an effective computer science student organization: the Carnegie Mellon Women@SCS action plan", "abstract": "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", "keyphrases": ["computer science student organization", "Women@SCS action plan", "gender issues", "women", "computer science education", "Carnegie Mellon University", "student leadership"], "prmu": ["P", "P", "U", "P", "M", "P", "P"]}
{"id": "817", "title": "Summarization beyond sentence extraction: A probabilistic approach to sentence compression", "abstract": "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", "keyphrases": ["sentence compression", "grammatical", "noisy-channel", "decision-tree", "document summarization"], "prmu": ["P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["computer domestication", "Internet", "highly educated people", "technical professions", "domestic purposes", "personal usage", "national surveys", "personal computers", "veteran Internet users", "novices", "women", "children", "personal motives", "PC diffusion", "computing industry", "domestic services", "demographics", "online behavior"], "prmu": ["R", "P", "P", "P", "P", "M", "P", "P", "P", "P", "P", "P", "R", "R", "P", "P", "U", "U"]}
{"id": "1369", "title": "Use of Bayesian Belief Networks when combining disparate sources of information in the safety assessment of software-based systems", "abstract": "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", "keyphrases": ["Bayesian belief networks", "intelligent product-support systems", "software safety standard", "safety assessment", "software-based systems"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "1394", "title": "Subject access to government documents in an era of globalization: intellectual bundling of entities affected by the decisions of supranational organizations", "abstract": "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", "keyphrases": ["government documents", "globalization", "intellectual bundling", "supranational organizations", "academic libraries", "World Trade Organization", "transnational economic agreements", "North American Free Trade Agreement", "municipal legislation", "national legislation", "provincial legislation", "state legislation"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "R", "R"]}
{"id": "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", "keyphrases": ["small-scale servers", "network installations", "management"], "prmu": ["P", "P", "P"]}
{"id": "1068", "title": "Quantum phase gate for photonic qubits using only beam splitters and postselection", "abstract": "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", "keyphrases": ["quantum phase gate", "photonic qubits", "postselection", "multiqubit networks", "postselected quantum gate", "optical quantum gate operations", "reflectivity", "quantum phase gate operation", "outputs", "photon number conservation", "postselected photon number conserving outputs", "quantum computation", "quantum information processing", "postselected quantum phase gate", "polarization beam splitters"], "prmu": ["P", "P", "P", "U", "R", "M", "P", "P", "P", "R", "R", "M", "M", "R", "M"]}
{"id": "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", "keyphrases": ["pulsewidth-modulated line conditioner", "output voltage control", "AC chopper", "reversible voltage control", "series voltage compensation transformer", "switching operation", "commutation", "line stray inductance", "regenerative DC snubber", "dynamic performance", "steady-state performance"], "prmu": ["P", "P", "P", "P", "R", "P", "P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["PC-based control system", "application programming interfaces", "PC interfaces", "human machine interface", "shop floor system", "programmable logic controller"], "prmu": ["P", "P", "P", "P", "M", "P"]}
{"id": "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", "keyphrases": ["tool temperature prediction", "chip temperature prediction", "continuous machining", "interrupted machining", "numerical model", "finite difference method", "time varying milling processes", "orthogonal cutting", "heat transfer", "tool-rake face contact zone", "shear energy", "primary zone", "friction energy", "temperature distribution", "first-order dynamic system", "thermal properties"], "prmu": ["R", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "U", "U"]}
{"id": "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", "keyphrases": ["node-capacitated routing problem", "node-capacitated ring routing", "undirected ring network", "fractional relaxation", "node-capacitated multicommodity flow problem", "feasibility problem", "Farkas lemma", "undirected graphs", "distance inequality", "distance functions", "nonnegative node weights", "node capacity integrality", "double-cut condition", "integer-valued node capacities", "half-integral multicommodity flow", "integer-valued multicommodity flow", "combinatorial strongly polynomial algorithm", "violating double-cut", "edge-cut criterion"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "R", "P", "P", "P", "P", "R", "P", "U"]}
{"id": "565", "title": "Control of thin film growth in chemical vapor deposition manufacturing systems: a feasibility study", "abstract": "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", "keyphrases": ["chemical vapor deposition", "material fabrication", "optimization", "operational costs", "film quality", "titanium nitride films", "thin film growth", "reactor gas flow rate", "susceptor temperature", "precursor concentration", "parameter space mappings", "TiN"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["online advertising market", "paid subscription income", "selling content online", "marketing strategies"], "prmu": ["P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["negotiation", "unexpected costs", "exit strategy", "shared risk", "vendor", "suppliers", "money squeeze", "buyers market", "bargaining power"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "U", "U"]}
{"id": "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", "keyphrases": ["bounded model checking", "universal fragment", "verification method", "reactive systems", "SAT methods", "propositional formula", "model checking", "linear time temporal logic", "elementary net systems", "bounded semantics"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "1231", "title": "Efficient parallel programming on scalable shared memory systems with High Performance Fortran", "abstract": "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", "keyphrases": ["parallel programming", "scalable shared memory", "High Performance Fortran", "multiprocessor architectures", "scalable hardware", "shared memory multiprocessor"], "prmu": ["P", "P", "P", "M", "M", "M"]}
{"id": "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", "keyphrases": ["business agility", "software design", "software deployment", "organisational structures", "supply chains"], "prmu": ["P", "U", "U", "U", "U"]}
{"id": "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", "keyphrases": ["MPEG-4 video coding", "bit allocation", "multiple video objects", "rate-distortion encoding", "object-based rate allocation", "variable temporal rates"], "prmu": ["R", "P", "P", "U", "P", "P"]}
{"id": "1438", "title": "Three-dimensional particle image tracking for dilute particle-liquid flows in a pipe", "abstract": "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", "keyphrases": ["three-dimensional particle image tracking", "dilute particle-liquid flows", "two-phase flow", "pipe flow", "stereo-imaging technique", "phase distribution", "CCD camera", "3D position", "spherical expanded polystyrene particle", "particle clusters", "spherical bubble", "Wiener filter", "image segmentation", "region growing technique", "image recognition", "image matching", "Hough transform"], "prmu": ["P", "P", "M", "R", "M", "M", "P", "P", "R", "P", "P", "U", "R", "M", "M", "R", "P"]}
{"id": "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", "keyphrases": ["degrees of freedom", "series connection", "semiconductors", "power electronics", "medium voltages", "variable-speed drives", "multilevel direct torque control strategy", "harmonic distortions", "torque dynamics", "voltage step gradients", "switching frequency", "common-mode voltage reduction", "bearing currents", "delay estimation", "industrial power systems", "insulated gate bipolar transistors", "state estimation", "multilevel drives", "fixed-frequency dynamic control", "1 to 10 kV"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "P", "U", "M", "U", "U", "P", "M", "R"]}
{"id": "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", "keyphrases": ["3G operators", "Malaysia", "Maxis Communications", "Telekom Malaysia"], "prmu": ["P", "P", "U", "M"]}
{"id": "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", "keyphrases": ["IP routing protocols", "interior gateway protocols", "link weights configuration", "traffic routing", "network conditions", "user performance", "network resources", "intradomain traffic engineering", "network topology", "OSPF/IS-IS weights", "shortest path routing protocols", "IP networks", "TCP", "transmission control protocol", "Open Shortest Path First protocol", "Intermediate System-Intermediate System protocol"], "prmu": ["P", "P", "R", "R", "P", "P", "P", "P", "R", "P", "P", "P", "U", "M", "R", "R"]}
{"id": "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", "keyphrases": ["generalized mosaicing", "wide field of view multispectral imaging", "spatially varying spectral bands", "spatially varying density filter", "image acquisition", "scene sampling rate", "registration method", "scene rendering", "simulated illumination spectra", "scene illumination", "hyperspectral imaging", "color balance", "image fusion", "physics-based vision", "image-based rendering"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "U", "M", "U", "M"]}
{"id": "896", "title": "Calculation of the probability of survival of an insurance company with allowance for the rate of return for a Poisson stream of premiums", "abstract": "The probability of survival of an insurance company with the working capital is calculated for a Poisson stream of premiums", "keyphrases": ["survival probability", "insurance company", "return rate", "Poisson premium stream", "probability density function"], "prmu": ["R", "P", "R", "R", "M"]}
{"id": "1014", "title": "Modelling of complete robot dynamics based on a multi-dimensional, RBF-like neural architecture", "abstract": "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", "keyphrases": ["complete robot dynamics", "multi-dimensional RBF-like neural architecture", "manipulator dynamics", "static neural networks", "neural architecture", "general system analysis", "fixed grid based neuron placement", "B-spline polynomial basis functions", "recursive implementation", "online identification", "dynamic model", "complete 6 joint industrial robot", "online learning"], "prmu": ["P", "R", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["dependent types", "Haskell", "data validity", "precise type system", "type class mechanism", "dependent typing", "counterfeit type-level copies", "type constructors", "data constructors", "datatypes", "functional programming"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "1109", "title": "The existence condition of gamma -acyclic database schemes with MVDs constraints", "abstract": "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", "keyphrases": ["existence condition", "database technology", "large-scale system", "connected join expression", "query performance", "sufficient and necessary condition", "gamma -acyclic database schemes", "MVDs constraints"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["multi-modal frequencies", "smart structures", "real-time estimation", "frequency estimation", "adaptive vibration control", "noise control", "Bairstow method", "characteristic equation", "auto regressive and moving average methods", "ARMA", "cascade notch filter", "linearized adaptive notch filter", "recursive maximum likelihood methods", "real-time computations", "vibration signal", "wing-like composite plates", "frequency estimation algorithm", "real-time applications"], "prmu": ["P", "P", "P", "P", "R", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["completion", "involution", "linear over-determined systems", "partial differential equations", "matrices", "semidiscretisations", "constant coefficients", "index", "differential algebraic equations", "uniqueness theorem", "strongly hyperbolic systems"], "prmu": ["P", "P", "P", "P", "U", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["hysteretic linear-threshold logic functions", "state-holding Boolean functions", "HLT logic", "quasi-delay insensitive style", "asynchronous circuit design", "logic design", "digital logic", "CMOS implementation"], "prmu": ["R", "P", "P", "P", "P", "P", "M", "U"]}
{"id": "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", "keyphrases": ["virtual shock physics facility", "Virtual Test Facility", "high explosives", "shock wave propagation", "solid material response", "pressure loading", "compressible turbulence", "parallel fluid solver", "parallel solid mechanics", "shock physics simulation", "data visualization", "Pyre", "problem solving environment", "Python scripting language"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["metaschemas", "data models", "UML", "database modeling notations", "Entity Relationship modeling", "Information Engineering", "Barker notation", "Object Role Modeling", "conceptual schema diagrams", "optionality", "cardinality", "multiplicity", "Unified Modeling Language", "class diagrams", "normalization", "orthogonality", "language transparency", "ORM"], "prmu": ["P", "P", "P", "P", "R", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["blind source separation", "transmitted images", "noise image", "image cryptosystems", "dual encryption"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["quantum information processing", "randomness", "decoherence control", "quantum algorithms", "two-level system", "random switching", "noise", "stochastic control"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1270", "title": "A comparison of different decision algorithms used in volumetric storm cells classification", "abstract": "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", "keyphrases": ["decision algorithms", "volumetric storm cells classification", "meteorological volumetric radar data", "radar decision support system", "summer storms", "classification accuracy", "support vector machine", "rough set algorithms", "object oriented reducts"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["High-Performance Fortran", "portable performance", "distributed memory machines", "HPF compilers", "performance portability", "benchmark suite", "parallel compilers", "compiler optimizations"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "M"]}
{"id": "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", "keyphrases": ["agile businesses", "integrated application architectures", "business process management", "web services", "software companies"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "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)", "keyphrases": ["multivariate discordant observations", "computer-intensive approach", "multiple outliers", "multivariate normal sample", "P-values", "tabled critical values", "data analysis", "EDR-EHD procedure", "univariate outlier", "stepwise testing approach", "multivariate outlier"], "prmu": ["P", "P", "P", "P", "P", "P", "M", "M", "P", "M", "P"]}
{"id": "1171", "title": "Manufacturing data analysis of machine tool errors within a contemporary small manufacturing enterprise", "abstract": "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", "keyphrases": ["manufacturing data analysis", "machine tool errors", "contemporary small manufacturing enterprise", "fixturing errors", "programming errors", "2 1/2D components", "3-axis vertical machining centre", "inspection", "milling type operations", "knowledge acquisition", "knowledge representation", "conceptual structure", "operating procedure", "co-ordinate measuring machine", "feature-based approach", "forward chaining expert system", "product data analysis distributed diagnostic expert system"], "prmu": ["P", "P", "P", "M", "M", "M", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P"]}
{"id": "1134", "title": "Relationship between strong monotonicity property, P/sub 2/-property, and the GUS-property in semidefinite linear complementarity problems", "abstract": "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", "keyphrases": ["semidefinite linear complementarity problems", "strong monotonicity property", "P/sub 2/-property", "GUS-property", "linear transformation", "symmetric real matrices", "Lyapunov transformations"], "prmu": ["P", "P", "P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["Honey Pot program", "security threat", "malicious executables", "email attachments", "anti-virus systems", "Trojan Horse", "SubSeven", "intrusion detection systems"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["customer databases", "data management", "customer relationships", "CRM", "return on investment"], "prmu": ["P", "P", "M", "P", "U"]}
{"id": "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", "keyphrases": ["electronic cash", "Canada", "low-value payments", "Mondex", "major banks", "publicity campaign", "global market", "Canadian implementation", "computer security", "consumer privacy", "monetary policy", "payment mechanism", "science and technology studies", "sociotechnical system", "short-term failures", "long-term transformations"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1029", "title": "Effect of insulation layer on transcribability and birefringence distribution in optical disk substrate", "abstract": "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", "keyphrases": ["optical disk substrate", "transcribability", "birefringence distribution", "insulation layer", "information storage media", "high storage density", "digital video disks", "smaller recording marks", "thinner optical disk substrates", "replication quality", "land-groove", "pit structure", "fabrication", "stamper", "injection-compression molding", "DVD RAM substrates", "geometrical properties", "optical properties", "gapwise birefringence distribution", "mold wall", "solidified layer growth retardation", "polyimide thermal insulation layer"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "R", "M"]}
{"id": "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", "keyphrases": ["mail", "Pitney Bowes", "strategies", "franking machines", "folders", "inserters", "direct mail shots"], "prmu": ["P", "P", "P", "U", "U", "U", "M"]}
{"id": "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", "keyphrases": ["car-caravan snaking", "pintle pin friction", "mathematical model", "car-trailer system", "linear system", "amplitude-dependent behaviour", "critical snaking speed", "Coulomb friction damping"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["ultrasonic sensors application", "process industry", "continuous process monitoring", "process control", "process quality", "food industries", "chemical industries", "pharmaceutical industries", "acoustic microsensors", "ultrasonic measurements", "ultrasonic attenuation", "acoustic impedance", "temperature measurement", "pressure measurement", "level measurement", "distance measurement", "flow measurement"], "prmu": ["R", "P", "P", "P", "P", "R", "R", "P", "U", "M", "M", "U", "M", "M", "M", "U", "M"]}
{"id": "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", "keyphrases": ["mentors", "role models", "gender issues", "computing", "women retention", "women recruitment", "computer science"], "prmu": ["P", "P", "P", "P", "M", "R", "P"]}
{"id": "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", "keyphrases": ["generalized Gaussian quadratures", "weighted integrals", "exponential functions", "integration", "interpolation", "bandlimited functions", "Caratheodory representation theorem", "eigenvalues", "Toeplitz matrix", "trigonometric moments", "approximation", "prolate spheroidal wave functions", "Bessel functions"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["3G networks", "delays", "Europe", "mobile operators"], "prmu": ["P", "P", "P", "U"]}
{"id": "1328", "title": "Tablet PCs on the way [publishing markets]", "abstract": "Previews of hardware and software look promising for publishing markets", "keyphrases": ["publishing markets", "Tablet PC"], "prmu": ["P", "P"]}
{"id": "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", "keyphrases": ["leaf sequencing algorithm", "usable intensity modulated radiation therapy field length", "overtravel distances", "multileaf-based collimators intensity modulated radiation therapy", "conformal radiation therapy", "multileaf collimators jaws", "multileaf collimators leaves", "upper jaw overtravel limit", "intensity pattern", "jaw position constraints", "step and shoot delivery method", "commercial treatment planning system", "random patterns", "deliverable segments", "single isocenter", "commercial linear accelerator", "treatment field length", "intensity elements", "jaw overtravel limits", "areal algorithm", "leaf-sequencing direction", "segment field size", "random intensity patterns", "segmentation method"], "prmu": ["P", "M", "P", "M", "U", "M", "M", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["hybrid model", "smoke simulation", "density functions", "continuous density field", "rendering", "look-up tables"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "545", "title": "Interaction and presence in the clinical relationship: virtual reality (VR) as communicative medium between patient and therapist", "abstract": "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", "keyphrases": ["virtual reality", "patient-therapist communication", "clinical psychology", "psychotherapy", "imagination", "memory", "presence", "psychological therapy", "clinical virtual environment", "shared virtual hospital"], "prmu": ["P", "M", "R", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["cross entropy method", "Bernoulli distribution", "deterministic network", "rare event simulation", "associated stochastic network", "random cuts", "probability", "numerical results", "polynomial complexity", "combinatorial optimization", "importance sampling", "maximal cut problems", "partition problems", "randomized algorithm"], "prmu": ["M", "P", "P", "M", "P", "P", "P", "P", "P", "U", "U", "P", "P", "P"]}
{"id": "83", "title": "A distributed mobile agent framework for maintaining persistent distance education", "abstract": "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", "keyphrases": ["distributed mobile agent framework", "persistent distance education", "distributed control", "central server", "distributed agent framework", "message transmission protocols", "user-friendly personal agents"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "1254", "title": "Supporting unified interface to wrapper generator in integrated information retrieval", "abstract": "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", "keyphrases": ["unified interface", "wrapper generator", "integrated information retrieval", "Internet", "automatic eXtensible Markup Language", "CORBA", "meta-search engine"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["hybrid decision tree", "hybrid learning approach", "reasoning", "symbolic learning", "qualitative analysis", "neural learning", "quantitative analysis", "binary information gain ratio criterion", "feedforward neural network", "FANNC", "incremental learning", "storage requirements", "data sets", "hypothesis-driven constructive induction"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "644", "title": "Three-dimensional spiral MR imaging: application to renal multiphase contrast-enhanced angiography", "abstract": "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", "keyphrases": ["3D spiral MRI", "renal multiphase contrast-enhanced angiography", "flow artifacts", "deblurring", "fast pulse sequence", "spiral in-plane readout", "3D partition encoding", "renal vasculature", "off-resonance frequencies", "image quality", "reduced contrast-to-noise ratio", "image reconstruction", "FLASH sequence", "spatial resolution"], "prmu": ["R", "P", "R", "P", "R", "P", "P", "P", "P", "P", "P", "M", "R", "P"]}
{"id": "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", "keyphrases": ["human science", "RTRI", "safety improvement", "comfort improvement", "railway systems", "accidents", "human errors", "psychological aptitude test", "train drivers' working conditions", "train drivers' working environments", "passenger casualties risk minimisation", "train accidents", "riding comfort", "tilt train", "railway facilities", "aged persons", "disabled persons", "sight impaired", "wakefulness level", "ergonomics"], "prmu": ["P", "P", "R", "R", "P", "P", "P", "P", "P", "R", "M", "P", "P", "P", "P", "M", "M", "U", "U", "U"]}
{"id": "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", "keyphrases": ["dominant AHP", "concurrent convergence method", "overall evaluation vectors"], "prmu": ["P", "P", "P"]}
{"id": "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", "keyphrases": ["simplicial reconstructions", "manifold learning", "finite-dimensional differentiable manifold", "learned manifold", "true manifold", "simplicial complex", "sampling density"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "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.\"", "keyphrases": ["United Press International", "UPI", "electronic archive", "wire service stories", "Computer-Aided Indexing", "NStein Technologies"], "prmu": ["P", "P", "U", "M", "P", "P"]}
{"id": "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", "keyphrases": ["information technology future", "untapped resources", "virtual workshop", "CISE Directorate", "National Science Foundation", "Information Technology Workforce Program", "ITWF", "scientific research studies", "women under-representation", "history"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["gender-equitable classroom", "CS classroom environment", "computer science", "nurturing environment", "pedagogy", "CS course content", "women students"], "prmu": ["R", "P", "P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["distributed Haskell", "parallel Haskell", "distributed languages", "parallel languages", "multiple processors", "coordination language", "functional programming", "lazy language", "functional computation language"], "prmu": ["P", "R", "P", "R", "P", "P", "R", "P", "P"]}
{"id": "1030", "title": "Comparison of automated digital elevation model extraction results using along-track ASTER and across-track SPOT stereo images", "abstract": "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", "keyphrases": ["automated digital elevation model extraction", "along-track ASTER data", "across-track SPOT stereo images", "stereo satellite images", "ASTER stereo pair", "SPOT stereo image pair", "radiometric variations", "simultaneous along-track acquisition"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "P"]}
{"id": "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", "keyphrases": ["numerical simulation", "information recovery", "quantum computers", "decoherence control", "error correction methods", "noisy quantum computation processes", "fault-tolerant recovering methods", "ancilla network", "ancilla fidelity", "qubits", "noisy error correction methods", "noisy quantum channel"], "prmu": ["P", "P", "P", "R", "P", "P", "P", "P", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["activity based costing", "best-of-breed ABM", "Armstrong Laing Group", "activity based management"], "prmu": ["R", "R", "P", "P"]}
{"id": "799", "title": "Electronic reserves at University College London: understanding the needs of academic departments", "abstract": "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", "keyphrases": ["University College London", "electronic course materials", "electronic reserves", "academic department needs", "Higher Education Funding Council for England", "computing staff", "learning technologists"], "prmu": ["P", "P", "P", "R", "P", "P", "P"]}
{"id": "721", "title": "The results of experimental studies of the reflooding of fuel-rod assemblies from above and problems for future investigations", "abstract": "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", "keyphrases": ["fuel-rod assemblies reflooding", "Russian experimental installations", "cooling efficiency", "flow reversal", "countercurrent flow", "steam", "water", "loss-of-coolant accident computer codes", "LOCA computer codes"], "prmu": ["R", "P", "R", "P", "P", "P", "P", "R", "R"]}
{"id": "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", "keyphrases": ["lattice Boltzmann schemes", "quantum applications", "quantum many-body problems", "quantum computers", "parallel computing"], "prmu": ["P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["Agari Mediaware Media Star", "enterprise content integration", "middleware"], "prmu": ["R", "P", "P"]}
{"id": "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", "keyphrases": ["product information", "Internet", "computer software", "computer hardware", "auditory warnings", "warning presentation"], "prmu": ["P", "P", "P", "R", "P", "P"]}
{"id": "1459", "title": "Wave propagation related to high-speed train. A scaled boundary FE-approach for unbounded domains", "abstract": "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", "keyphrases": ["wave propagation", "solid materials", "railway engineering", "3D modelling", "high-speed train related ground vibrations", "unbounded media", "modelling", "railway structural components", "scaled boundary finite element method", "element matrices", "solution procedures", "nonlinear finite element iteration scheme", "Lagrange multipliers", "dynamical response", "railroad section"], "prmu": ["P", "P", "P", "M", "P", "P", "P", "P", "P", "P", "P", "M", "P", "P", "P"]}
{"id": "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", "keyphrases": ["parallel implicit predictor corrector methods", "initial value problems", "numerically zero-stable formulas", "zero-stability condition", "roundoff errors", "finite precision arithmetic"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["stubborn set method", "combinatorial explosion", "weighted vertices", "low-degree polynomial time", "CSP-equivalence"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Himalayan information system model", "information explosion", "information technology", "India", "information requirements", "HIMIS", "government", "information network"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "917", "title": "Efficient transitive closure reasoning in a combined class/part/containment hierarchy", "abstract": "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", "keyphrases": ["transitive closure reasoning", "knowledge representation", "class hierarchy", "part hierarchy", "containment hierarchy", "parallel algorithms", "data representation", "maximally reduced tree cover", "materialized transitive closure representation", "experiments", "medical vocabulary", "fixed hardware configuration", "parallel reasoning", "inheritance", "part hierarchies", "artificial intelligence", "classification"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["fuzzy system modeling", "pharmacology", "cluster validity problem", "projection schema", "significant input determination", "predictive performance", "fuzzy sets", "fuzzy logic", "pharmacokinetic modeling"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "M", "P"]}
{"id": "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", "keyphrases": ["synchronization", "Rossler chaotic systems", "Chen chaotic systems", "active control", "response systems", "Lyapunov stability theory", "adaptive synchronization controller", "global asymptotic synchronization"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "P"]}
{"id": "1195", "title": "Sharpening the estimate of the stability constant in the maximum-norm of the Crank-Nicolson scheme for the one-dimensional heat equation", "abstract": "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", "keyphrases": ["stability constant", "Crank-Nicolson scheme", "one-dimensional heat equation", "sharp resolvent estimate", "discrete Laplacian", "Cauchy formula", "Neumann boundary conditions", "Dirichlet boundary conditions"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["failure probabilities computation", "reliability analysis applications", "n-dimensional uniform random variable", "unit hypercube", "limit condition", "recursive method", "Gauss-Legendre quadrature formulae", "multiple integrals calculation", "tail approximation"], "prmu": ["R", "R", "P", "P", "P", "P", "P", "R", "U"]}
{"id": "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", "keyphrases": ["power system restoration", "standing phase angle reduction approach", "circuit breaker closing", "synchrocheck relay", "power line connection", "sensitivity factors"], "prmu": ["P", "R", "R", "M", "R", "P"]}
{"id": "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", "keyphrases": ["individual decision making", "fuzzy set theory", "rational decision making model"], "prmu": ["P", "P", "R"]}
{"id": "1294", "title": "Multicriterion optimization of composite laminates for maximum failure margins with an interactive descent algorithm", "abstract": "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", "keyphrases": ["interactive multicriterion optimization", "composite laminates", "maximum failure margins", "multiple loading conditions", "interactive descent algorithm", "first ply failure", "bicriterion problem", "discrete procedure", "convergence", "Pareto optimum"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["control logic", "parallel valves operation", "transient stability performance", "single machine infinite bus system", "multiple stroke operations", "single stroke operations", "turbine power output control", "transient stability"], "prmu": ["P", "R", "P", "P", "P", "R", "R", "P"]}
{"id": "723", "title": "Simulation of physicochemical processes of erosion-corrosion of metals in two-phase flows", "abstract": "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", "keyphrases": ["erosion-corrosion computational model", "two-phase flows", "RAMEK-2", "computer simulation", "structural steels", "thermodynamic parameters", "hydrodynamic parameters", "water-chemistry parameters", "three-dimensional space", "thermal power plants", "nuclear power plants", "application software", "protective maintenance", "fault diagnosis", "wet-steam path"], "prmu": ["R", "P", "P", "R", "P", "R", "R", "M", "P", "M", "M", "P", "P", "M", "P"]}
{"id": "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", "keyphrases": ["physical quantum algorithms", "classical systems", "no-hidden variable theorems", "quantum computers", "quantum lattice gas automata"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["crossing number", "generalized Petersen graph"], "prmu": ["P", "P"]}
{"id": "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", "keyphrases": ["intelligent product support", "intelligent product manuals", "product manuals", "ProARTWeb", "concurrent engineering", "product knowledge", "technical information"], "prmu": ["P", "P", "P", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["satellite image collection optimization", "imaging satellite systems", "multivariable time dynamic optimization system", "graphical user interface", "image collection plan", "long range planning", "daily collection scheduling", "Space Imaging IKONOS satellite", "satellite control tasking software", "collection commands"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "R", "R", "P"]}
{"id": "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", "keyphrases": ["quantum learning", "universal quantum matching machine", "pattern class", "pattern matching problem", "quantum domain", "qubit systems", "matching strategies", "semiclassical strategy", "two-stage procedure", "quantum strategy", "Bayes optimal solutions", "quantum matching procedure", "semiclassical extension", "matching strategy", "learning process"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["technology CAD", "heterojunction field effect transistors", "SiGe", "fabrication process", "material parameters", "mobility model", "uniform channel", "linear transconductance", "0.5 micron"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P", "M"]}
{"id": "1296", "title": "Development of visual design steering as an aid in large-scale multidisciplinary design optimization. I. Method development", "abstract": "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", "keyphrases": ["visual design steering", "large-scale multidisciplinary design optimization", "computational steering", "optimal design problems", "designer decision making", "visual representations", "complex systems", "graph morphing visualization method", "3D visualizations", "2D visualizations", "n-dimensional optimization", "computational time", "complexity", "design variable changes", "constraint redundancies", "constraint tolerances", "objective function contour smoothness"], "prmu": ["P", "P", "P", "P", "R", "P", "P", "P", "M", "M", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["meteorological fuzzy expert system", "subjective user input", "MEDEX", "gale-force wind forecasting", "Mediterranean basin", "numerical weather prediction products", "rules-of-thumb", "fuzzy set theory", "subjective variables", "uncertainty", "rule specification", "fuzzy rule base", "fuzzy pattern matching", "wind circulation patterns"], "prmu": ["P", "P", "P", "R", "P", "P", "P", "P", "M", "P", "R", "P", "P", "P"]}
{"id": "587", "title": "An improved self-organizing CPN-based fuzzy system with adaptive back-propagation algorithm", "abstract": "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", "keyphrases": ["self-organizing fuzzy system", "Counter-Propagation Network", "neural-fuzzy system", "hybrid learning", "gradient descent", "structure learning", "initial parameters setting", "back-propagation learning scheme"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["quantum sensitive dependence", "wave functions", "bounded quantum systems", "time-independent potentials", "periodic functions", "time asymptotics", "classical chaos", "time-dependent interactions", "quantum control", "classical Lyapunov exponent", "operator matrix elements", "quantum complexity"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["quantum limit", "computational time", "computational speed", "quantum computer", "fundamental interactions"], "prmu": ["P", "P", "R", "P", "P"]}
{"id": "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", "keyphrases": ["numerical behaviour", "unstable solitary waves", "numerical approximations", "generalized Benjamin-Bona-Mahony equation", "error propagation mechanisms", "numerical methods", "stable solitary waves"], "prmu": ["P", "P", "P", "P", "P", "P", "R"]}
{"id": "928", "title": "Weighted energy linear quadratic regulator vibration control of piezoelectric composite plates", "abstract": "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", "keyphrases": ["finite element linear quadratic regulator", "vibration control", "smart piezoelectric composite plates", "total weighted energy", "weighting matrices", "optimal performance function", "total kinetic energy", "strain energy", "damping effect", "modal control analysis", "damping ratios", "strain energy weight factor", "numerical results", "computational cost", "structural control analysis"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1256", "title": "High-speed consistency checking for hypothetical reasoning systems using inference path network", "abstract": "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", "keyphrases": ["hypothetical reasoning", "fault diagnostics", "high-speed consistency checking", "inference path network", "reasoning speed", "inconsistencies", "hypothesis composition", "speed up"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1213", "title": "A knowledge intensive multi-agent framework for cooperative/collaborative design modeling and decision support of assemblies", "abstract": "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", "keyphrases": ["knowledge intensive multi-agent framework", "collaborative design modeling", "decision support", "distributed information system applications", "distributed design", "virtual consortium", "cooperative framework", "concurrent intelligent design", "assembly planning", "product design", "design for assembly", "assembly simulation", "AI protocol", "knowledge intensive Petri nets", "agent negotiation", "knowledge object cooperation"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "R", "P"]}
{"id": "646", "title": "Vibration control of structure by using tuned mass damper (development of system which suppress displacement of auxiliary mass)", "abstract": "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", "keyphrases": ["tuned mass damper", "vibration control", "variable gain control system", "brake system", "actuator", "active control", "auxiliary mass displacement suppression", "controllers"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["energy costs reduction", "Portland General Electric", "Oregon", "E-Manager", "online energy consumption analysis", "abnormal energy use detection"], "prmu": ["M", "P", "P", "P", "R", "R"]}
{"id": "81", "title": "A scalable and efficient systolic algorithm for the longest common subsequence problem", "abstract": "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", "keyphrases": ["systolic algorithm", "longest common subsequence problem", "scalable algorithm", "parallel algorithms"], "prmu": ["P", "P", "R", "M"]}
{"id": "1157", "title": "Portal dose image prediction for dosimetric treatment verification in radiotherapy. II. An algorithm for wedged beams", "abstract": "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", "keyphrases": ["portal dose image prediction", "dosimetric treatment verification", "radiotherapy", "transmission dosimetry", "wedged beams algorithm", "two-dimensional function", "wedged photon beam", "planning CT scan", "irradiation geometry", "low energy photon beams", "high energy photon beams", "slab phantom", "thorax phantom", "in vivo dosimetry", "electronic portal imaging devices", "fluoroscopic CCD camera", "pencil beam algorithm", "CadPlan planning system", "open beams", "virtual wedges", "6 MV", "23 MV"], "prmu": ["P", "P", "P", "M", "R", "P", "P", "P", "P", "R", "P", "R", "P", "M", "P", "M", "M", "M", "P", "M", "R", "P"]}
{"id": "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", "keyphrases": ["subdivision surfaces", "parametric surfaces blending", "subdivision patches", "piecewise-smooth subdivision surfaces", "quadrilaterals", "parametric bicubic B-spline surfaces", "piecewise smooth subdivision surfaces"], "prmu": ["P", "R", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["comfort cooling system", "waste heat", "Nationwide Trust", "air conditioning"], "prmu": ["P", "P", "U", "U"]}
{"id": "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", "keyphrases": ["enhanced wormhole routers", "message broadcast", "n-dimensional hypercube", "replication tree", "reachable sets", "performance", "communication complexity", "all-port wormhole router", "message replication capability", "intermediate reception", "pipelined broadcast"], "prmu": ["P", "R", "P", "P", "P", "P", "M", "P", "P", "U", "P"]}
{"id": "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", "keyphrases": ["P2P technology", "digital content", "businesses", "Groove Networks", "Avaki", "WorldStreet", "NextPage", "Kontiki", "Yaga", "content owners"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["speaker identification", "artificial neural networks", "personnel", "hierarchical architecture", "self-organizing feature map", "backpropagation algorithm", "classification", "feedforward layers", "2D arrays", "radial basis function neural net", "pre-training", "known voice samples"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["pioneering women", "computer science development", "electronic computers", "programming languages", "history"], "prmu": ["P", "R", "P", "R", "U"]}
{"id": "1173", "title": "A comprehensive chatter prediction model for face turning operation including tool wear effect", "abstract": "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", "keyphrases": ["chatter prediction model", "face turning operation", "tool wear effect", "three-dimensional mechanistic frequency domain chatter model", "process damping", "axial directions", "radial directions", "stability boundaries", "flank wear"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["finite Markov chains", "risk-sensitive control", "Q-learning algorithm", "classical Markov decision processes", "algorithm convergence", "reinforcement learning algorithms", "proof technique", "stochastic approximation algorithms", "dynamic programming", "ordinary differential equations"], "prmu": ["P", "P", "P", "P", "R", "M", "P", "P", "U", "U"]}
{"id": "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", "keyphrases": ["intrusion detection systems", "computer network security", "network attacks", "firewall"], "prmu": ["P", "M", "M", "U"]}
{"id": "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", "keyphrases": ["global action rules", "query answering system", "action rules", "attributes", "e-commerce", "distributed knowledge mining"], "prmu": ["P", "P", "P", "P", "U", "P"]}
{"id": "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", "keyphrases": ["finance", "financial management", "Aurora Financial Management System", "pricing", "stochastic processes", "Monte Carlo simulation", "Backward Induction methods", "numerical pricing kernel", "derivative pricing", "investment strategies"], "prmu": ["P", "P", "P", "P", "R", "P", "P", "P", "R", "M"]}
{"id": "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", "keyphrases": ["nonstationary time series", "nonparametric procedures", "evolutionary spectra estimation", "randomization tests", "spectral estimates", "related time series", "lag window", "time window", "independent time series", "simulation", "geological time series", "financial time series"], "prmu": ["P", "P", "R", "P", "P", "R", "U", "M", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["robust speech recognition", "probabilistic union models", "partial real-world noise", "automatic order selection", "modeling", "partial feature stream corruption", "noise reduction techniques", "stationary noise", "nonstationary noise", "TIDIGITS database", "speaker-independent connected digit recognition", "additive noise", "noise characteristics", "missing feature theory", "noisy bands", "time-varying band characteristics", "local frequency-band information", "partial frequency-band corruption"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "949", "title": "Reply to \"Comment on: Teleportation of an unknown state by W state\" [Phys. Lett. A 300 (2002) 324]", "abstract": "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", "keyphrases": ["teleportation", "unknown state", "three-particle W state", "qubit state", "normalization coefficient", "probability calculation"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["software installation", "software upgrades", "Microsoft Windows", "operating systems migration"], "prmu": ["R", "P", "U", "R"]}
{"id": "1093", "title": "A fuzzy logic approach to accommodate thermal stress and improve the start-up phase in combined cycle power plants", "abstract": "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", "keyphrases": ["combined cycle power plants", "supervisory control", "fuzzy logic approach", "dynamic model", "PID control", "fuzzy PID schemes", "steam turbine plant start-up time minimization", "maximum thermal stress limits", "start-up schedule"], "prmu": ["P", "P", "P", "P", "R", "P", "R", "P", "P"]}
{"id": "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", "keyphrases": ["C++ Standard", "union type", "constructors", "destructors", "union members", "scripting language", "placement new"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["undergraduate female students", "computer science education", "engineering education", "gender issues", "conference"], "prmu": ["P", "R", "P", "U", "P"]}
{"id": "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", "keyphrases": ["accounting packages", "tax packages", "software integration", "Internet", "CCH", "TaxWorks", "People's Choice", "Visual Tax", "GoSystem Tax RS", "Drake", "NetConnection", "ATX", "CPASoftware", "Intuit", "Petz", "TaxSimple", "RIA"], "prmu": ["U", "M", "R", "U", "U", "U", "U", "M", "M", "U", "U", "U", "U", "U", "U", "U", "U"]}
{"id": "1392", "title": "Enlisting on-line residents: Expanding the boundaries of e-government in a Japanese rural township", "abstract": "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", "keyphrases": ["on-line residents", "e-government", "Japanese rural township", "local bureaucrats", "Internet", "decision-making", "power sharing", "office management", "Towa-cho", "rural municipality"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["community technology", "democratic rationalization", "human agency", "democratic process", "technical sphere", "virtual community", "stable long-term group associations", "human development", "human value", "diverse ideologies", "optimistic observers", "technical system", "intellectual tradition", "technology criticism", "Internet activity", "conflicting answers", "computer networks", "computer networking", "community activities"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["improved lung nodules detection", "temporal subtraction technique", "digital chest radiography", "perceptible interval changes", "observer performance", "peripheral lung nodules", "radiology residents", "certified radiologists", "subtle cases", "University of Chicago", "computed radiographic system", "medical diagnostic imaging", "30 mm"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "P"]}
{"id": "1016", "title": "A scalable model of cerebellar adaptive timing and sequencing: the recurrent slide and latch (RSL) model", "abstract": "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", "keyphrases": ["scalable model", "cerebellar adaptive timing", "cerebellar sequencing", "recurrent slide and latch model", "neural network theory", "mammalian cerebellum", "granule cell stage", "sparse expansive recoding", "time-varying input vector", "distributed representation", "recurrent network"], "prmu": ["P", "P", "R", "R", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["static semantics", "Haskell 98", "nonstrict purely functional programming language", "formal specification", "type system", "overloading", "kind inference", "polymorphic recursion", "explicit dictionary passing", "polymorphic lambda calculus", "higher order polymorphism", "explicit type abstraction", "term language", "type checking", "monomorphism restriction", "inference rules"], "prmu": ["P", "P", "M", "M", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["vector mathematics", "plane geometry", "multiple representations", "quadrilateral", "proofs", "vector algebra proofs"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["International Telecommunication Union", "internet addressing", "translating telephone", "3G"], "prmu": ["P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["DSL systems performance", "DSL system design", "electromagnetic coupling", "data transmission", "twisted pairs", "phone cable", "dynamic spectrum management", "transceivers", "distributed optimization", "static spectrum management", "iterative water-filling", "autonomous distributed power control method", "software options", "VDSL systems", "ADSL systems", "vectored-DMT", "coordinated transmission/reception", "crosstalk-free communication", "universal Internet access", "broadband networks", "100 Mbit/s", "500 m"], "prmu": ["R", "P", "P", "M", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "M", "M", "P"]}
{"id": "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", "keyphrases": ["elastically adaptive deformable models", "automatic adaptation", "elastic parameters", "Kalman filter framework", "shape estimation", "physics-based modeling techniques", "geometric degrees of freedom", "elastic degrees of freedom", "state equations", "extended Kalman filter"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["exactly solvable random satisfiability problem", "hyper-SAT model", "q-state variables", "statistical ensemble", "exact finite-size corrections", "exact duality", "thermodynamic properties", "random energy model", "disordered spin system theory", "error correcting codes"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["subtypes", "stereotypes", "UML model", "Unified Modeling Language", "Object Management Group", "Request For Information", "Classifier", "whole part relationship"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "931", "title": "Active vibration control of composite sandwich beams with piezoelectric extension-bending and shear actuators", "abstract": "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", "keyphrases": ["quasi-static equations", "piezoelectricity", "finite element formulation", "piezoelastically", "adaptive composite sandwich beam", "piezoelectric constants", "transverse electric field", "extension-bending actuation", "finite element procedure", "shear-induced actuation", "sandwich model", "sublaminates", "linear quadratic regulator", "modal space control", "active stiffness", "active damping", "shear actuators", "extension-bending actuators", "dynamic response", "modal domain"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "M", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Lie groups", "approximated BCH-formula", "differential equations", "GBS-algorithm", "geometric integration", "extrapolation methods"], "prmu": ["P", "P", "P", "P", "M", "M"]}
{"id": "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", "keyphrases": ["DIPIE algorithm", "MOEMS CAD packages", "electrostatically actuated MEMS devices", "pull-in parameters", "electrostatic actuators", "design geometries", "convergence rate", "displacement iteration pull-in extraction scheme", "mechanical field solver", "electrostatic field solver", "computer-aided design", "displacement iteration"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "R", "R", "P", "M", "P"]}
{"id": "989", "title": "A dynamic checkpoint scheduling scheme for fault tolerant distributed computing systems", "abstract": "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", "keyphrases": ["dynamic checkpoint scheduling scheme", "fault tolerant computing", "distributed computing systems", "optimal checkpointing interval", "rollback recovery", "cost evaluation", "communication pattern"], "prmu": ["P", "R", "P", "P", "M", "P", "P"]}
{"id": "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", "keyphrases": ["compliance", "supervision", "brokers", "risk management"], "prmu": ["P", "P", "P", "M"]}
{"id": "898", "title": "Influence of advertising expenses on the characteristics of functioning of an insurance company", "abstract": "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", "keyphrases": ["advertising expenses influence", "insurance company functioning characteristics", "average capital", "ruin probabilities", "survival probabilities", "conditional time"], "prmu": ["R", "R", "P", "R", "P", "P"]}
{"id": "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", "keyphrases": ["reasoning", "default logic", "complexity results", "complexity classes", "nonmonotonic reasoning", "extended logic programs", "tractable subsets"], "prmu": ["P", "P", "P", "R", "M", "P", "P"]}
{"id": "865", "title": "Setup cost and lead time reductions on stochastic inventory models with a service level constraint", "abstract": "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", "keyphrases": ["setup cost reductions", "lead time reductions", "stochastic inventory models", "service level constraint", "continuous review inventory models", "periodic review inventory models", "backorders", "lost sales", "lead time demand", "protection interval", "probability distributions", "minimax distribution free procedure"], "prmu": ["P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["tomographic cone-beam projection data", "polyhedral phantom", "reconstruction accuracy", "computed axial tomography", "cone-beam transmission tomography", "alternative scanning loci", "geometrically defined polyhedra", "linear attenuation coefficient", "microtomographic reconstruction", "walrus tusk", "reconstruction software accuracy", "X-ray attenuation", "cumulative pixel array", "interpolation", "geometry file"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "M", "M", "U", "U"]}
{"id": "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", "keyphrases": ["Implicit Euler method", "differential-algebraic equations", "convergence", "stepsize change", "variable-step method", "variable-order formulas", "linear multistep method", "backward differentiation formula", "initial value problem", "differential index"], "prmu": ["P", "P", "P", "R", "P", "P", "M", "M", "U", "P"]}
{"id": "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", "keyphrases": ["modems", "line type", "operating mode", "synchronizing mode", "modulation", "engineering students", "communication students", "electrical students", "computer science students", "information technology students", "standards", "protocols"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "R", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["ADD diagrams", "ultrasonic detectors", "software package", "slanted transducers", "normal transducers", "contemporary operational system Windows-95(98", "calibration", "cylindrical holes", "reference signals", "sensitivity calibration", "ultrasonic testing"], "prmu": ["P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["Internet", "machine indexing", "searching", "index terms", "human indexing"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["high-performance computing systems", "Internet", "Monitor for Application-Generated Network Traffic toolkit", "optimized networks", "interconnects", "high-performance computing", "network protocol", "traffic characterization", "MAGNeT", "virtual supercomputing", "computational grids"], "prmu": ["P", "P", "P", "P", "P", "P", "M", "M", "P", "U", "M"]}
{"id": "1243", "title": "HPF/JA: extensions of High Performance Fortran for accelerating real-world applications", "abstract": "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", "keyphrases": ["High Performance Fortran", "HPF", "parallel processing", "compiler", "data parallel language", "supercomputer", "parallelization of loops", "parallel programming"], "prmu": ["P", "P", "M", "P", "M", "U", "P", "R"]}
{"id": "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", "keyphrases": ["continuous-linked settlement", "foreign-exchange"], "prmu": ["P", "P"]}
{"id": "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", "keyphrases": ["discrete-time CNN systems", "local activity criteria", "difference equation", "discrete-map CNN", "loaded cell impedance", "Chua's local activity principle", "nonhomogeneous spatiotemporal patterns", "critical coupling coefficient", "logistic map CNN", "magnetic vortex pinning map CNN", "spiral wave reproducing map CNN", "period-doubling"], "prmu": ["P", "P", "U", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["coupling query", "Web warehouse", "data warehouse", "Warehouse Of Web Data", "HTML documents", "XML documents", "metadata", "content", "internal structure", "external structure", "Web documents", "partial knowledge", "tag attributes", "tagless segment", "disjunctive query conditions", "conjunctive query conditions", "execution control", "topological structure", "hyperlinked documents", "graphical query formulation", "textual query formulation", "coupling text"], "prmu": ["P", "P", "P", "P", "R", "P", "P", "P", "R", "R", "P", "P", "P", "P", "P", "R", "R", "P", "P", "R", "R", "P"]}
{"id": "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", "keyphrases": ["geometric dimensioning", "tolerancing", "dimensional metrology", "visualization", "knowledge navigation", "manufacturing training", "VRML", "interoperability standards", "inspection", "Web"], "prmu": ["P", "P", "P", "P", "R", "U", "U", "P", "P", "U"]}
{"id": "1142", "title": "Fast and accurate leaf verification for dynamic multileaf collimation using an electronic portal imaging device", "abstract": "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", "keyphrases": ["accurate leaf verification", "dynamic multileaf collimation", "electronic portal imaging device", "accurate dose delivery", "intensity modulated radiation therapy profiles", "ionization chamber", "two-dimensional method", "CCD-camera based electronic portal imaging device", "sliding gap", "leaf pair", "gap widths", "gray scale value profiles", "electronic portal imaging device images", "noise level", "signal images", "leaf position errors", "modulated beam profiles", "leaf positioning", "gantry angles"], "prmu": ["P", "P", "P", "P", "M", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["UPSILON", "universal programming system", "object-oriented flavor", "programming system", "usable type theory", "data synchronization primitive", "incomplete lazy object notation"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["lifting factorization", "discrete wavelet transform", "DWT", "lifting matrices", "integer transforms", "computational complexity", "data compression", "feature extraction", "multiframe detection", "filter bank", "lossless coding schemes", "mobile devices", "integer arithmetic", "mobile computing"], "prmu": ["P", "M", "P", "P", "R", "P", "U", "U", "U", "U", "U", "U", "M", "M"]}
{"id": "1182", "title": "Optimization of the memory weighting function in stochastic functional self-organized sorting performed by a team of autonomous mobile agents", "abstract": "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", "keyphrases": ["autonomous mobile agents", "random walk", "memory weighting function", "sorting", "clustering", "algorithm optimization"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["quantum Zeno subspaces", "adiabatic theorem", "dynamical coupling", "measurement", "decoherence-free subspaces"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["statistical bounds", "entanglement", "quantum chaos", "entropy production", "maximality", "random matrix theory", "composite quantum systems", "universal distribution", "reduced density matrices", "quantized chaotic systems", "kicked tops", "Hilbert spaces"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["automated irradiation device", "cyclotrons", "CV-28", "protons", "Cyclone 30", "radioisotope production", "nuclear medicine", "general research", "radiation exposition dose"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "900", "title": "Mathematical models of functioning of an insurance company with allowance for the rate of return", "abstract": "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", "keyphrases": ["mathematical models", "insurance company functioning", "return rate allowance", "free capital increase", "interest", "stationary regime"], "prmu": ["P", "R", "R", "P", "P", "P"]}
{"id": "592", "title": "Approximation theory of fuzzy systems based upon genuine many-valued implications - SISO cases", "abstract": "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", "keyphrases": ["single input and single output fuzzy systems", "SISO", "many-valued implications", "fuzzy systems", "Boolean implication", "universal approximator"], "prmu": ["R", "P", "P", "P", "M", "P"]}
{"id": "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", "keyphrases": ["innovation", "manufacturing firms", "business network assets", "information network assets", "research network assets", "participation assets", "relational assets", "cognitive social capital", "structural social capital", "reciprocal trust", "two-stage decision-making process", "degree of radicalness"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "U", "M"]}
{"id": "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", "keyphrases": ["harmonic spray", "residues removal", "wafer-cleaning equipment", "Rockwell Automation", "PSI machine", "Allen-Bradley ControlLogix automation control platform", "motion control", "Allen-Bradley 1336 Plus II variable frequency ac drives"], "prmu": ["P", "R", "P", "P", "U", "M", "M", "U"]}
{"id": "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", "keyphrases": ["undergraduate computing majors", "women retention", "women recruitment", "female participation", "gender gap", "computer science"], "prmu": ["P", "M", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["single-pass welding task sequencing", "constructive heuristics", "offline programming", "robot arc welding", "modified travelling salesman problem", "local search heuristics", "computational speed", "automated process-planning procedure", "productivity", "welding distortion", "nearest neighbour concept", "tabu search heuristics", "random problems", "welded structure problems"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Verona Lastre", "Vela", "CTP plates"], "prmu": ["P", "P", "P"]}
{"id": "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", "keyphrases": ["coarse-level approximations", "topologically complex models", "discrete solid representation", "topology-reducing surface simplification", "3D model", "volumetric representation", "error-bounded models", "scene parts", "complex mechanical assemblies"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["China", "telecoms industry", "foreign investment", "China Telecom", "China Netcom", "China Unicorn"], "prmu": ["P", "P", "R", "P", "M", "M"]}
{"id": "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", "keyphrases": ["fidelity", "quantum teleportation", "noisy quantum channels", "analytical solution", "numerical solution", "quantum channels", "classical communication", "Lindblad operator", "Alice", "Bob", "sender", "recipient", "dual classical channels", "eigenstate", "isotropic noise"], "prmu": ["P", "P", "P", "M", "M", "P", "P", "P", "U", "U", "U", "U", "M", "U", "P"]}
{"id": "1027", "title": "Extracting straight road structure in urban environments using IKONOS satellite imagery", "abstract": "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", "keyphrases": ["straight road structure", "urban environments", "IKONOS satellite imagery", "fully automatic technique", "vegetation mask", "texture", "panchromatic IKONOS data", "road pixels", "object-based representation", "higher level reasoning", "individual segment recognition", "road network components", "San Diego", "object-based processing component", "straight-line structured topology", "high-resolution imagery", "large-scale feature extraction", "vectorized road network"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "R", "P", "P", "P", "P", "M", "M", "M"]}
{"id": "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", "keyphrases": ["IT security", "end user oriented research", "e-commerce", "Internet", "hacker attacks", "information technology research", "end user computing"], "prmu": ["P", "P", "P", "P", "P", "M", "M"]}
{"id": "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", "keyphrases": ["multiple viewpoint models", "formal framework", "viewpoint consistency", "system development", "open distributed processing", "ODP", "ISO/ITU standardisation framework", "consistency checking", "formal description technique", "LOTOS", "development models", "process algebra"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "M"]}
{"id": "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", "keyphrases": ["visual specification", "modular specification", "hybrid systems", "HyCharts", "visual description techniques", "components", "hierarchic graphs", "hybrid computation model", "denotational semantics", "statechart", "heterogeneous system specifications", "formal specification"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "P", "P", "U", "P", "R"]}
{"id": "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", "keyphrases": ["thin-film torus", "smart materials", "satellite applications", "inflated structures", "ground vibration testing", "polyvinylidene fluoride patches", "PVDF sensors", "macro-fiber composite actuators", "modal parameters", "space device", "boundary condition", "dynamic response", "Kapton torus"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "1046", "title": "A suggestion of fractional-order controller for flexible spacecraft attitude control", "abstract": "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", "keyphrases": ["fractional-order controller", "flexible spacecraft attitude control", "partial differential equation", "internal damping", "frequency response", "phase stabilization control", "amplitude stabilization", "damping ratio"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Lob Theorem", "limitation on mechanism", "epistemic authority", "belief-set", "formal system", "theorem-set", "human-like epistemic agents"], "prmu": ["R", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["ethical argument", "computing under-representation", "unfair discrimination", "social practices", "social institutions", "women"], "prmu": ["P", "R", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["maximum-likelihood surface estimator", "dense range data", "3D surface models", "noisy range data", "sensor model", "unbiased estimator", "heuristic", "biased solutions", "complex scenes", "noisy range measurements", "simulated ladar data", "real ladar data", "sonar", "synthetic aperture radar", "surface reconstruction", "surface fitting", "optimal estimation", "parameter estimation", "Bayesian estimation", "registration", "calibration"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "R", "P", "P", "P", "M", "M", "R", "R", "M", "U", "U"]}
{"id": "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", "keyphrases": ["firing probability", "noisy integrate-and-fire neurons", "cortical neurons", "synaptic activity", "noise filtering", "white noise", "colored noise", "Fokker-Planck equation", "synaptic time constant", "membrane time constant", "phase lag", "synaptic receptors", "numerical simulation"], "prmu": ["P", "P", "P", "P", "P", "R", "R", "P", "P", "P", "P", "P", "P"]}
{"id": "757", "title": "Ultrafast compound imaging for 2-D motion vector estimation: application to transient elastography", "abstract": "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", "keyphrases": ["ultrafast compound imaging", "2D motion vector estimation", "two-dimensional imaging", "transient elastography", "2D imaging", "high frame rate", "ultrasound", "colour flow imaging", "reflectivity imaging", "human tissues", "axial displacements", "lateral displacements", "shear wave propagation", "Young's modulus image reconstruction", "ultrasonic imaging", "multisynthetic aperture beamforming", "1D speckle tracking algorithm", "decorrelated speckle patterns", "single plane wave insonification"], "prmu": ["P", "M", "R", "P", "M", "P", "P", "M", "P", "P", "P", "P", "P", "P", "P", "P", "M", "P", "P"]}
{"id": "712", "title": "Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: D-MAP/D/k system", "abstract": "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", "keyphrases": ["waiting-time distribution", "discrete-time multiserver queue", "correlated arrivals", "deterministic service times", "D-MAP/D/k system", "Markovian arrival process"], "prmu": ["P", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["career stereotyping", "personal abilities", "politics", "misperceptions", "women", "professional computing careers"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["electricity grid networks", "large-scale central generators", "grid connected wind turbines", "grid node voltages control", "voltage control", "reactive power", "direct drive", "variable speed", "offshore wind park", "squirrel cage induction generator", "doubly fed induction generator", "direct drive synchronous generator", "weak grid", "converter rating"], "prmu": ["P", "P", "P", "R", "P", "M", "U", "M", "M", "M", "M", "M", "M", "U"]}
{"id": "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", "keyphrases": ["pipeline shrinkage", "women", "computer science", "role models", "women faculty members"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["validated methods", "initial value problems", "ordinary differential equations", "interval methods", "interval Taylor series", "interval Hermite-Obreschkoff scheme", "wrapping effect", "QR algorithm"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "U"]}
{"id": "1457", "title": "A discontinuous Galerkin method for transient analysis of wave propagation in unbounded domains", "abstract": "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", "keyphrases": ["discontinuous Galerkin finite element method", "transient analysis", "transient wave propagation", "absorbing boundary condition", "unbounded domains", "discretization error", "computational cost", "time-stepping scheme", "implicit method", "unconditional stability"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["document format", "next-generation devices", "Arbortext", "multichannel publishing", "content assets"], "prmu": ["R", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["adaptive wavelet methods", "elliptic case", "operator equations", "least squares formulation", "Euclidean metric", "asymptotically optimal complexity", "N-term approximation"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "576", "title": "Application of Sugeno fuzzy-logic controller to the stator field-oriented doubly-fed asynchronous motor drive", "abstract": "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", "keyphrases": ["machine modelling", "Sugeno fuzzy-logic controller", "stator field-oriented doubly-fed asynchronous motor drive", "fuzzy-control", "wound-rotor asynchronous motor", "PWM voltage-source inverters", "stator field-oriented control", "Mamdani controller", "training", "speed regulation"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "R", "P", "U"]}
{"id": "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", "keyphrases": ["mobile database", "data replication", "distributed database", "multidatabase", "mobile database replication", "Transaction-Level Result-Set Propagation", "mobile computing", "conflict reconciliation", "transaction"], "prmu": ["P", "P", "R", "P", "P", "P", "M", "M", "P"]}
{"id": "1166", "title": "Embedding the outer automorphism group Out(F/sub n/) of a free group of rank n in the group Out(F/sub m/) for m > n", "abstract": "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", "keyphrases": ["outer automorphism group embedding", "free group", "arbitrary natural number coprime"], "prmu": ["R", "P", "P"]}
{"id": "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", "keyphrases": ["paired comparison data dependency modelling", "log-linear approach", "Bradley-Terry model", "judge decisions", "multiple binomial responses", "conditional odds ratios", "generalized linear models", "parameter estimation", "goodness of fit", "GLIM"], "prmu": ["R", "P", "P", "R", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["information needs", "format-author-collaborators-title-series-subject catalogue", "author-collaborator-title-series-subjects catalogue"], "prmu": ["P", "R", "R"]}
{"id": "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", "keyphrases": ["optimal class association rule set mining", "minimum rule set", "predictive power", "redundant computation", "predictive association rules", "relational database", "upward closure property", "data mining", "weak rule pruning", "experimental results", "dense databases"], "prmu": ["R", "P", "P", "P", "P", "M", "P", "M", "R", "P", "P"]}
{"id": "1267", "title": "3D reconstruction from uncalibrated-camera optical flow and its reliability evaluation", "abstract": "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", "keyphrases": ["3D reconstruction", "uncalibrated-camera optical flow", "reliability evaluation", "flow fundamental matrices", "motion parameters", "epipolar equation", "covariance matrices", "real-image experiments", "normalization"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["state of the art", "agent-mediated electronic commerce", "business-to-consumer e-commerce", "consumer buying behaviour", "product brokering", "merchant brokering", "negotiation", "supply chain management", "multi-agent systems", "mobile agents", "evolutionary agents", "data-mining agents", "business-to-business e-commerce"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "P", "U", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["real analytic functions", "rational functions", "addition", "integration", "multiplication", "polynomial", "Pfaffian functions", "lower bounds", "L/sub infinity /-norm"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1385", "title": "Cache invalidation and replacement strategies for location-dependent data in mobile environments", "abstract": "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", "keyphrases": ["mobile computing", "location-dependent information", "cache replacement", "cache invalidation", "semantic caching", "performance evaluation", "mobile location-dependent information services", "data caching"], "prmu": ["M", "P", "P", "P", "M", "M", "P", "P"]}
{"id": "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", "keyphrases": ["embedded shape memory alloy actuators", "lifelike motions", "anthropomorphic grasping", "fine manipulations", "active finger", "resistance feedback", "flexible rod", "active robot hand"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["flow measurement", "flow metering", "signal processing", "liquid flow", "Egyptians", "Chinese", "Romans", "fiscal transfers", "flowmeter manufacturer", "advanced computer techniques", "fluid mechanics", "electronics application"], "prmu": ["P", "M", "U", "R", "P", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["ACM-W literature review", "ACM Committee on Women in Computing", "pipeline shrinkage problem"], "prmu": ["P", "R", "P"]}
{"id": "1084", "title": "On quasi-linear PDAEs with convection: applications, indices, numerical solution", "abstract": "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", "keyphrases": ["quasi-linear partial differential algebraic equations", "spatial index", "plasma physics", "initial boundary value problems", "finite difference splitting procedure", "fractional step method", "matrix factorization", "convection", "indices", "numerical solution"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["brokers", "Internet", "finance"], "prmu": ["P", "P", "P"]}
{"id": "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.\"", "keyphrases": ["United States military", "Wide-Area Media network", "U.S. Navy", "record labels", "publishing companies", "healthcare providers", "advertising agencies", "intelligent workflow", "WAM!Net", "content creators", "electronic media", "high-speed private network", "ATM technology", "content information", "publishing information", "client-server format", "ASP format", "digital platform"], "prmu": ["P", "P", "M", "P", "P", "P", "P", "P", "P", "M", "P", "M", "M", "U", "M", "U", "U", "P"]}
{"id": "1378", "title": "Development of an Internet-based intelligent design support system for rolling element bearings", "abstract": "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", "keyphrases": ["Internet-based intelligent design support system", "rolling element bearings", "intelligent agile design system", "artificial intelligence", "Web technologies", "Internet technologies", "smart tools", "network programming", "client-server technology", "manufacturing requirements", "bearing design"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["power system voltage collapse analysis", "critical transmission lines identification", "local phenomenon", "system critical bus identification", "IEEE-118 bus", "computer simulation", "Brazil"], "prmu": ["M", "R", "P", "R", "P", "M", "U"]}
{"id": "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", "keyphrases": ["quasi stage order conditions", "diagonally implicit Runge-Kutta method", "embedded error estimator", "numerical tests", "differential-algebraic systems", "SDIRK methods"], "prmu": ["P", "R", "P", "P", "U", "P"]}
{"id": "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", "keyphrases": ["neuro-fuzzy systems", "fuzzy systems", "hierarchical neuro-fuzzy quadtree", "quadtree", "recursive partitioning", "learning algorithm", "Mackey Glass chaotic series"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["count data", "score tests", "zero-inflated Poisson regression model", "zero probability", "covariates", "excess zeros", "simulation", "composite test"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "P"]}
{"id": "675", "title": "Application foundations [application servers]", "abstract": "The changing role of application servers means choosing the right platform has become a complex challenge", "keyphrases": ["application servers", "Microsoft .Net", "transaction processing", "security", "availability", "load balancing", "Java 2 Enterprise Edition"], "prmu": ["P", "U", "U", "U", "U", "U", "U"]}
{"id": "1220", "title": "Modeling discourse in collaborative work support systems: a knowledge representation and configuration perspective", "abstract": "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", "keyphrases": ["discourse modeling", "collaborative work support systems", "knowledge representation", "conflicts of interest", "consensus", "compromise", "knowledge communication", "HERMES", "human-computer interaction"], "prmu": ["R", "P", "P", "P", "P", "P", "R", "P", "P"]}
{"id": "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", "keyphrases": ["requantization parameter optimization", "low-bit-rate MPEG stream", "transcoding error", "macroblock", "compression ratio", "error propagation effect", "interframe prediction", "rate-distortion curve", "PSNR", "simulation", "twofold recompression", "rate conversion", "rate control", "6 Mbit/s"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "U", "U", "P"]}
{"id": "1298", "title": "An analytical model for a composite adaptive rectangular structure using the Heaviside function", "abstract": "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", "keyphrases": ["composite adaptive rectangular structure", "mathematical model", "Heaviside function", "delta-Dirac distribution", "embedded actuators", "embedded sensors", "bonded actuators", "bonded sensors", "piezoelectric actuators", "piezoelectric sensors", "piezoelectric patches", "nonpiezoelectric patches", "equations of motion", "boundary conditions", "electromechanical coupling", "Mindlin displacement field", "Hamilton principle", "closed-form solution", "Lagrangian functions", "linear piezoelectricity", "constitutive relations", "virtual kinetic energy", "rectangular composite plate", "finite-element method"], "prmu": ["P", "P", "P", "M", "R", "R", "R", "R", "P", "R", "P", "R", "P", "P", "P", "P", "P", "U", "M", "R", "U", "U", "M", "U"]}
{"id": "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", "keyphrases": ["active vibration control", "piezolaminated smart beams", "beam like structures", "distributed piezoelectric sensor layers", "distributed piezoelectric actuator layers", "top surfaces", "bottom surfaces", "finite element model", "Euler-Bernoulli beam theory", "mass", "stiffness", "direct proportional feedback", "constant-gain negative velocity feedback", "Lyapunov feedback", "optimal control strategy", "linear quadratic regulator", "control effectiveness", "impulse loading", "step loading", "harmonic loading", "random loading"], "prmu": ["P", "P", "P", "R", "R", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P"]}
{"id": "574", "title": "A novel approach for the detection of pathlines in X-ray angiograms: the wavefront propagation algorithm", "abstract": "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", "keyphrases": ["wavefront propagation principle", "quantitative coronary artery analysis", "user-defined startpoints", "user-defined endpoints", "vessel segment", "lesion quantification", "wavepath method", "bifurcation", "sidebranch pathline", "corrections", "correct vessel", "wavefront propagation algorithm", "X-ray angiograms"], "prmu": ["P", "P", "M", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["all-optical routing", "communication paths", "all-optical network", "wavelength assignment", "wavelength translation", "wavelength converter", "all-optical ring"], "prmu": ["P", "P", "R", "R", "M", "P", "P"]}
{"id": "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)", "keyphrases": ["Friedberg numberings", "infinite family", "computability theory", "families of n-computably enumerable sets"], "prmu": ["P", "P", "U", "P"]}
{"id": "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", "keyphrases": ["volumetric air supply rate", "cooling capacity", "displacement ventilation systems", "diffusers"], "prmu": ["P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Sigma -admissible families", "linear orders", "HYP(M)", "recursively saturated system", "fundamental subsets", "dense linear orderings"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["self-organized critical traffic", "traffic flow dynamics", "phase transition", "free phase", "congested phase", "transition point", "optimal information transfer", "wide fluctuations", "scale-free properties", "generalization", "packet emission", "packet release", "statistical features", "Internet traffic", "square lattice architecture", "parallel computer networks"], "prmu": ["P", "R", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "963", "title": "A computational model of learned avoidance behavior in a one-way avoidance experiment", "abstract": "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", "keyphrases": ["computational model", "learned avoidance behavior", "one-way avoidance experiment", "reinforcement learning", "temporal-difference algorithm", "classically conditioned components", "instrumentally conditioned components", "reduced latency", "animal behavior", "traditional two-process learning mechanism", "proprioceptive feedback", "internal clock"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "926", "title": "Experimental investigation of active vibration control using neural networks and piezoelectric actuators", "abstract": "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", "keyphrases": ["active vibration control", "neural networks", "piezoelectric actuators", "identification", "control", "smart structures", "cantilevered plate", "white noise disturbances", "multilayer perceptrons", "error backpropagation", "closed-loop performance", "robustness", "neurocontroller", "vibration suppression"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "648", "title": "Study of ambiguities inherent to the spectral analysis of Voigt profiles-a modified Simplex approach", "abstract": "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", "keyphrases": ["pulsed spectrometries", "temporal transients", "spectral analysis", "Voigt profiles", "Gaussian profiles", "Gauss-Lorentz profiles", "Nelder and Mead Simplex method", "accuracy", "limited acquisition time interval", "final peak parameters"], "prmu": ["P", "P", "P", "P", "R", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["three-tier technology training strategy", "dynamic business environment", "end-user training", "technology-intensive business environment", "companies", "innovative training strategy", "midsize organization", "organizations"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1258", "title": "Implementation and performance evaluation of a FIFO queue class library for time warp", "abstract": "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", "keyphrases": ["FIFO queue", "class library", "time warp simulation", "performance evaluation", "easy-to-use interface", "queuing simulations", "parallel discrete simulations", "general-purpose simulation libraries", "simulation languages", "state vectors", "dynamic data structures", "embedded data structures", "operational history", "first-in-first-out characteristics", "garbage collection", "object oriented method", "state management"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "M", "M"]}
{"id": "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", "keyphrases": ["IR image classification", "infrared-image classification", "hidden Markov trees", "3D target image", "target-sensor orientation", "target pose", "contiguous target-sensor orientations", "Wiener filters", "Karhunen-Loeve representation", "minimization", "HMT", "forward-looking-infrared imagery", "FLIR imagery", "vehicles"], "prmu": ["M", "P", "P", "M", "P", "P", "P", "P", "P", "P", "P", "R", "R", "P"]}
{"id": "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", "keyphrases": ["CPXe", "photofinishing market", "Common Picture Exchange environment", "Kodak", "Fujifilm", "HP", "Web-services standards"], "prmu": ["P", "P", "P", "U", "U", "U", "U"]}
{"id": "755", "title": "Hardware and software platform for real-time processing and visualization of echographic radiofrequency signals", "abstract": "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", "keyphrases": ["echographic radiofrequency signal", "real-time processing", "data visualization", "hardware platform", "software platform", "ultrasonic imaging", "clinical diagnosis", "user interface", "personal computer"], "prmu": ["P", "P", "R", "R", "P", "M", "M", "P", "P"]}
{"id": "710", "title": "Optimal allocation of runs in a simulation metamodel with several independent variables", "abstract": "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", "keyphrases": ["optimal runs allocation", "simulation metamodel", "independent variables", "general regression metamodel", "queuing system", "regression function"], "prmu": ["R", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["analogue realizations", "fractional-order controllers", "continued fraction expansions", "negative coefficients", "fraction expansion", "negative impedance converters", "rational approximations", "fast processes", "digital controllers", "fractional differentiation", "fractional integration"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "M"]}
{"id": "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", "keyphrases": ["philosophy of mind", "Information-Based Semantics", "Content Atomism", "IBS", "Language of Thought", "LOT", "cognitive states", "beliefs", "desires"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["conflict-free executions", "elementary Petri nets", "conflict-free fair run", "totally conflict-avoidable net", "decidability", "reduced case graph"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "13", "title": "Stability analysis of the characteristic polynomials whose coefficients are polynomials of interval parameters using monotonicity", "abstract": "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", "keyphrases": ["stability analysis", "characteristic polynomials", "interval parameters", "monotonicity", "Frazer-Duncan theorem", "endpoint values", "necessary and sufficient conditions", "interval division method", "transformation algorithm"], "prmu": ["P", "P", "P", "P", "R", "P", "R", "P", "P"]}
{"id": "56", "title": "New thinking on rendering", "abstract": "Looks at how graphics hardware solves a range of rendering problems", "keyphrases": ["rendering", "graphics hardware", "programmability", "Gourand-shaded image", "color values"], "prmu": ["P", "P", "U", "U", "U"]}
{"id": "629", "title": "Calibrated initials for an EM applied to recursive models of categorical variables", "abstract": "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", "keyphrases": ["EM", "recursive models", "categorical variables", "calibrated initials", "large causal model", "initial values", "simulation"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "1239", "title": "Three-dimensional global MHD simulation code for the Earth's magnetosphere using HPF/JA", "abstract": "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", "keyphrases": ["magnetohydrodynamic simulation", "vector-parallel supercomputer", "Fujitsu VPP5000/56", "HPF MHD code", "MHD simulation", "parallel computation"], "prmu": ["R", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["cellular automata", "finite cellular automaton", "transition diagram", "endomorphisms", "computational complexity"], "prmu": ["P", "R", "P", "P", "U"]}
{"id": "947", "title": "The fully entangled fraction as an inclusive measure of entanglement applications", "abstract": "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", "keyphrases": ["entanglement", "two qubit pure state", "quantum information processing", "fully entangled fraction", "fidelity", "teleportation", "entanglement swapping", "quantum cryptography"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "141", "title": "A high-resolution high-frequency monolithic top-shooting microinjector free of satellite drops - part I: concept, design, and model", "abstract": "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", "keyphrases": ["monolithic top-shooting microinjector", "bubble valve", "droplet ejection characteristics", "asymmetric bubbles", "crosstalk", "liquid refilling", "frequency response", "satellite droplets", "virtual valve", "inkjet printing", "thermal bubble jet", "flow restriction", "chamber designs"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "U", "M", "P", "P"]}
{"id": "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", "keyphrases": ["TCP explicit congestion notification", "ATM-UBR", "simulation", "congestion control mechanisms", "ATM networks", "packet losses", "agent", "explicit forward congestion indication bits", "unspecified bit rate service", "credit-based window size", "cell loss", "packet retransmissions", "buffer utilization", "throughput"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "R", "R", "P", "P", "P", "P", "P"]}
{"id": "590", "title": "Universal approximation by hierarchical fuzzy system with constraints on the fuzzy rule", "abstract": "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", "keyphrases": ["hierarchical fuzzy system", "fuzzy rules", "universal approximator", "continuous function", "ball and beam control system", "hierarchical fuzzy logic", "Stone-Weierstrass theorem"], "prmu": ["P", "P", "P", "P", "P", "M", "U"]}
{"id": "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", "keyphrases": ["Markov process simulation", "variance reduction", "approximating martingale-process method", "martingales", "performance measures", "internal control variate", "complex stochastic processes", "single-server queue"], "prmu": ["P", "P", "M", "P", "P", "P", "M", "U"]}
{"id": "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", "keyphrases": ["timed automata", "noninterference notion", "concurrent systems", "security property", "real-time systems", "time-critical system"], "prmu": ["P", "M", "P", "P", "P", "P"]}
{"id": "691", "title": "Robust output-feedback control for linear continuous uncertain state delayed systems with unknown time delay", "abstract": "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", "keyphrases": ["robust control", "output-feedback control", "linear continuous systems", "uncertain systems", "state delayed systems", "time delay", "state time-varying delay", "observer-based control law", "sequential quadratic programming", "state feedback control law", "closed-loop system stability"], "prmu": ["R", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1060", "title": "Variety identification of wheat using mass spectrometry with neural networks and the influence of mass spectra processing prior to neural network analysis", "abstract": "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", "keyphrases": ["matrix-assisted laser desorption/ionisation time-of-flight mass spectrometry", "wheat variety classification", "mass spectrometric data", "pre-processing- method", "Gaussian smoothing", "normalisation procedures", "multiplicative scatter correction", "correctly classified mass spectra", "correlation coefficient", "variety identification", "mass spectra processing", "neural network analysis"], "prmu": ["P", "P", "P", "M", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["remote sensing images", "electronic delivery", "watermarking techniques", "Earth observation missions", "copyright protection", "digital watermarking", "near-lossless watermarking", "digital image distribution", "unsupervised image classification"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["adaptive scheduling", "batch servers", "flow shops", "batch servicing", "manufacturing operations", "production systems", "ovens", "aircraft industry", "semiconductor manufacturing", "dynamic scheduling", "multi-stage flow shops", "control strategies", "integral scheduling approach", "shop optimization", "look-ahead strategy", "near-future arrivals", "two-stage flow shop", "single machine", "parallel machines", "simulation study"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["MonacoProfiler 4", "color-correction", "Pantone Hexachrome", "commercial printers"], "prmu": ["P", "U", "U", "U"]}
{"id": "771", "title": "Pareto-optimal formulations for cost versus colorimetric accuracy trade-offs in printer color management", "abstract": "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", "keyphrases": ["printer color management", "digital image printing", "nonlinear ink-mixing behavior", "redundant solutions", "Pareto-optimal formulations", "cost versus colorimetric accuracy trade-offs", "image data conversion", "CIELAB to CMYK color conversion schemes", "color characterization data set", "artificial neural networks", "transfer functions", "tetrahedral interpolation", "optimization", "tetrahedra", "interpolation-based approach", "Qhull program", "user control", "cost versus reproduction accuracy", "user-specified print objectives", "maximum allowable ink", "constraints", "gamut compression features", "clipping", "MacBeth ColorChecker chart", "grey component replacement", "rendering intent"], "prmu": ["P", "R", "P", "P", "P", "P", "R", "P", "R", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "U", "U", "P"]}
{"id": "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", "keyphrases": ["web services technology", "Microsoft", "IBM", "database software"], "prmu": ["P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["North American carrier survey", "private lines", "frame relay", "ATM", "VPNs", "dedicated Internet access", "Ethernet services", "Web hosting", "service providers", "customer service", "reliability", "price"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["routing security", "wireless ad hoc networks", "mobile ad hoc network", "wireless mobile nodes", "wireless MANET", "open medium", "dynamic topology", "distributed cooperation", "on-demand distance vector routing protocol", "satellite transmission", "home wireless personal area networks"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "U", "M"]}
{"id": "709", "title": "Cooperative mutation based evolutionary programming for continuous function optimization", "abstract": "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", "keyphrases": ["cooperative mutation based evolutionary programming", "continuous function optimization", "convergence speed", "local minima"], "prmu": ["P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["MP3", "business plans", "video on demand", "tiered pricing", "broadband"], "prmu": ["P", "U", "P", "P", "P"]}
{"id": "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", "keyphrases": ["tracking control", "flexible slider-crank mechanism system", "impact", "variable structure control", "stabilizer design", "crank angular position", "flexible vibrations", "generalized momentum balance", "continuous force model", "effective mass compensation", "conservation laws", "tracking trajectory", "flexible connecting rod", "multibody dynamics", "pole placement technique"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "P", "P", "U", "P"]}
{"id": "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/", "keyphrases": ["etalon-stabilized laser diode", "visible laser diode", "constant current bias", "constant operating temperature", "heating correction", "monitor photodiode", "fractional wavelength stability", "single-transverse-mode", "single-longitudinal-mode", "index-guided multi-quantum-well", "closed-loop operation", "feedback loop"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P", "P", "U", "M", "U"]}
{"id": "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", "keyphrases": ["polymeric microlens fabrication", "micromolding", "hemispherical shape microlens", "size", "weight", "cost", "optical data storage", "optical communication systems", "polymeric microlenses", "microcompression molding process", "fabrication procedures", "design procedures", "mold insertion", "silicon", "PMMA powder", "molding material", "process parameters", "temperature", "pressure", "micromolding process", "magnification ratio", "300 micron"], "prmu": ["R", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "U"]}
{"id": "987", "title": "Proof that the election problem belongs to NF-completeness problems in asynchronous distributed systems", "abstract": "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", "keyphrases": ["election problem", "NF-completeness problems", "asynchronous distributed systems", "distributed computing", "leader election", "failure detectors", "fault-tolerant problems", "not-fault-tolerant problems"], "prmu": ["P", "P", "P", "M", "M", "M", "R", "M"]}
{"id": "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", "keyphrases": ["air conditioning", "market"], "prmu": ["P", "P"]}
{"id": "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", "keyphrases": ["Halden Reactor Project", "PEANO", "calibration", "artificial intelligence", "fuzzy logic", "steam generators", "feedwater flow", "PWR", "TEMPO", "thermal performance monitoring", "BWR", "steam turbine cycles"], "prmu": ["P", "P", "P", "P", "M", "M", "U", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["ultrasonic mammography", "breast masses", "computer aided classification", "frequency compounding", "ultrasonic B-mode images", "benign", "malignant", "normalized parameters", "Nakagami distribution", "single region of interest", "normalized Nakagami parameters", "receiver operating characteristic", "ROC curve", "weighted summation", "specificity", "sensitivity", "minimal clinical intervention"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Chicago Equity Partners", "Macgregor", "Financial Trading Platform", "straight-through processing", "LongView"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "614", "title": "An on-line distributed intelligent fault section estimation system for large-scale power networks", "abstract": "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", "keyphrases": ["on-line distributed intelligent fault section estimation system", "large-scale power networks", "on-line fault section estimation", "multi-way graph partitioning method based", "weighted minimum degree reordering", "connected sub-networks", "quasi-balanced FSE burdens", "minimum frontier elements", "distributed intelligent system", "radial basis function neural network", "fuzzy system", "sparse storage technique", "IEEE 14-bus systems", "IEEE 30-bus systems", "IEEE 118-bus systems", "computer simulation"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "M", "R", "P"]}
{"id": "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", "keyphrases": ["application-layer multicasting", "Delaunay triangulation overlays", "group applications", "network-layer multicast protocol", "logical overlay network", "data transfer", "Delaunay triangulation protocol", "measurement experiments", "overlay networks", "local PC cluster", "Linux PC", "overlay network topology", "next-hop routing information", "data link layer", "DT protocol", "network nodes", "traffic measurements", "average overhead", "throughput experiments", "multicast transmissions", "TCP unicast connections", "15 Mbit/s", "2 Mbit/s"], "prmu": ["P", "P", "P", "P", "P", "R", "R", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "M", "M"]}
{"id": "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", "keyphrases": ["performance tool interface", "MPI profiling interface", "API", "source-level instrumentation approach", "OpenMP directive rewriting", "directive semantics", "arbitrary code regions", "performance libraries", "EXPERT automatic event trace analyzer", "TAU performance analysis framework", "source-to-source translation tool", "OPARI", "parallel programming"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["HPF", "High Performance Fortran", "HPF Library", "generic functions", "data types", "library generator", "library functions", "parallel computing", "parallel languages", "code generation", "parameterized templates", "matrix multiplication"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "U", "M", "P", "P", "P"]}
{"id": "139", "title": "Equilibrium swelling and kinetics of pH-responsive hydrogels: models, experiments, and simulations", "abstract": "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", "keyphrases": ["pH-responsive hydrogels", "ionic hydrogels", "microfluidic flow", "muscle-like actuators", "filtration/separation", "drug delivery", "gel size", "swelling/deswelling", "buffered pH solutions", "equilibrium model", "mechanical properties"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["flexible manufacturing systems", "deadlock-free scheduling", "Petri nets", "systems of sequential systems with shared resources", "partial reachability graph", "optimal deadlock-free schedule", "near-optimal deadlock-free schedule", "Petri net model transitions firing sequence", "mean flow time minimization", "siphon truncation technique", "optimality condition relaxation", "user control factor", "CPU time", "randomly generated examples"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "R", "R", "P", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Internet routing infrastructure security", "networked systems", "networking technology", "integrated communication infrastructure", "networking infrastructure", "false routing information", "network performance", "routing protocols", "countermeasures", "routing infrastructure", "secure routing schemes", "research", "preventive security mechanisms", "link state protocols"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "M"]}
{"id": "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", "keyphrases": ["disability-related special libraries", "federal government", "disability-related information centers", "disability-related clearinghouses", "information resources", "information referrals", "Western Oregon University", "OBIRN", "Oregon Brain Injury Resource Network", "DB-LINK", "National Information Clearinghouse on Children who are Deaf-Blind", "library collections"], "prmu": ["P", "P", "P", "R", "P", "R", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["multi-hour design", "survivable classical IP networks", "Internet intra-domain routing protocols", "OSPF", "RIP", "IS-IS", "shortest path routing", "path length", "path links", "network administrator", "Internet backbone network", "network dimensioning", "network routers", "Internet traffic", "transmission links", "network failures", "meta-heuristics algorithm", "greedy heuristic algorithm", "survivability requirements", "network protection", "quality of service constraints", "QoS constraints"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "R", "P", "P", "R", "R", "R", "P", "R", "P", "M"]}
{"id": "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", "keyphrases": ["Java", "equals contract", "transitivity requirement", "mixed-type comparison", "superclass"], "prmu": ["U", "P", "M", "P", "P"]}
{"id": "1099", "title": "WebCAD: A computer aided design tool constrained with explicit 'design for manufacturability' rules for computer numerical control milling", "abstract": "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", "keyphrases": ["WebCAD", "computer aided design tool", "design for manufacturability rules", "computer numerical control milling", "manufacturing enterprise efficiency", "process-aware CAD system", "three-axis CNC milling machine", "CAD/CAM systems", "manufacturability rules", "design tools", "Internet-based CAD/CAM"], "prmu": ["P", "P", "R", "P", "R", "R", "M", "R", "P", "P", "M"]}
{"id": "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", "keyphrases": ["quantum-controlled measurement device", "quantum-state discrimination", "programmable quantum device", "quantum state", "program register", "nonorthogonal states", "program qubit"], "prmu": ["P", "P", "R", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["error probabilities", "optical fiber data buses", "modulation schemes", "Manchester bi-phase coding", "receiver sensitivities"], "prmu": ["P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["customer relationship management", "central data repository", "database", "staff trained"], "prmu": ["P", "M", "U", "U"]}
{"id": "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", "keyphrases": ["cost of storage", "IT personnel", "resource management", "disk capacity management", "disk optimisation", "file system automation", "storage virtualisation", "storage area networks", "network attached storage"], "prmu": ["P", "U", "U", "U", "U", "U", "M", "M", "M"]}
{"id": "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", "keyphrases": ["competitive capabilities", "e-services", "Internet", "service operations strategy", "business performance", "knowledge-based economy", "knowledge-based competencies", "human capital", "structural capital", "absorptive capacity", "operations-based options", "combinative capabilities", "service quality", "delivery", "flexibility", "cost", "investment", "intellectual capital", "bricks-and-mortar", "clicks-and-mortar", "dot-com", "strategic imperatives"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "569", "title": "Application of an internally consistent material model to determine the effect of tool edge geometry in orthogonal machining", "abstract": "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", "keyphrases": ["tool edge geometry", "cutting tool", "metal cutting", "ploughing component", "extrapolation", "dwell force", "zinc", "edge geometry", "orthogonal machining"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["cellular automata", "symbolic dynamical theory", "formal languages", "complexity", "evolution complexity", "elementary cellular automaton"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "1285", "title": "On fractal dimension in information systems. Toward exact sets in infinite information systems", "abstract": "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", "keyphrases": ["fractal dimension", "information systems", "exact sets", "infinite information systems", "rough set", "topological properties", "closure operators", "equivalence classes", "knowledge discovery", "data mining", "qualitative measures", "complexity"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "695", "title": "Design of high-performance wavelets for image coding using a perceptual time domain criterion", "abstract": "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", "keyphrases": ["high-performance wavelets", "image coding", "perceptual time domain criterion", "biorthogonal linear-phase wavelet design", "image compression", "prototype filters", "half-band filter", "low pass filter", "analysis filter", "objective function", "coding gain", "peak-to-peak ratio", "perceptual image quality", "filter banks"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["timed automata verification", "partitioning technique", "abstract state spaces", "bisimilarity", "universal fragments", "branching time temporal logics", "observational simulation relations"], "prmu": ["R", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["technology purchases", "return-on-investment", "ROI", "key metrics", "automation investment"], "prmu": ["U", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["separate-account industry", "Web-based platforms", "independent money managers", "investment", "financial advisors"], "prmu": ["P", "P", "P", "P", "U"]}
{"id": "943", "title": "Implementation of universal quantum gates based on nonadiabatic geometric phases", "abstract": "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", "keyphrases": ["quantum computation", "nonadiabatic geometric phase shifts", "cyclic geometric phase", "universal quantum gates", "Josephson junctions", "NMR systems", "nonadiabatic phase shift", "operation time", "nonadiabatic geometric gates"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["RedBoot", "open-source ROM monitor", "embedded systems", "flash-resident software program", "scripting", "processor register access", "memory dumps", "debugging tool", "bootstrapping", "eCos", "real-time operating system", "embedded Linux"], "prmu": ["P", "P", "R", "P", "P", "R", "P", "P", "U", "P", "P", "P"]}
{"id": "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", "keyphrases": ["multirate sampling control", "servo system", "digital control systems", "tracking", "feedback", "feedforward", "position control", "hard disk drive", "disturbance rejection"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "594", "title": "Improved analysis for the nonlinear performance of CMOS current mirrors with device mismatch", "abstract": "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", "keyphrases": ["nonlinear performance", "CMOS current mirrors", "device mismatch", "complementary MOSFET current mirrors", "closed-form expressions", "harmonic components", "intermodulation components", "multisinusoidal input current", "input current", "threshold-voltage mismatch", "SPICE simulations", "simulation results", "transconductance mismatch"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["autonomous power system", "combined intelligent techniques", "power output regulation", "generator speed control", "fuel rack position control", "fuzzy logic", "genetic algorithms", "neural networks", "load demand", "frequency overshoot", "transient oscillations", "zero steady-state error", "performance evaluation", "single-area power system", "overall dynamic performance", "competing techniques", "frequency control", "controller design"], "prmu": ["P", "P", "R", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["Common Communication Format conversion", "MARC21", "global resource sharing", "bibliographic records exchange", "library communities", "machine-readable catalogue records", "standards", "data transfer", "India", "southeast Asia", "CCF to MARC21 mapping"], "prmu": ["R", "P", "P", "R", "P", "P", "P", "R", "P", "P", "R"]}
{"id": "1200", "title": "From continuous recovery to discrete filtering in numerical approximations of conservation laws", "abstract": "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", "keyphrases": ["continuous recovery", "discrete filtering", "numerical approximations", "conservation laws", "numerical dissipation", "central differencing", "artificial dissipation", "finite volume schemes", "image processing", "highly nonlinear artificial dissipation terms", "discrete filter operation"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1245", "title": "A brief guide to competitive intelligence: how to gather and use information on competitors", "abstract": "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", "keyphrases": ["competitive intelligence", "competitor information", "Barbie doll", "business environment", "intelligence collection", "intelligence analysis", "intelligence communication", "intelligence utilization"], "prmu": ["P", "R", "P", "P", "R", "M", "R", "R"]}
{"id": "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", "keyphrases": ["linear time-delay systems", "continuous pole placement method", "delay differential equations", "static state feedback", "delayed state feedback", "numerical continuation"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "554", "title": "A scalable and lightweight QoS monitoring technique combining passive and active approaches: on the mathematical formulation of CoMPACT monitor", "abstract": "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", "keyphrases": ["quality of service", "change-of-measure", "passive monitoring", "active monitoring", "CoMPACT Monitor", "delay distributions", "Internet", "QoS monitoring", "network performance"], "prmu": ["M", "P", "P", "P", "P", "P", "U", "P", "U"]}
{"id": "1101", "title": "Evaluation of existing and new feature recognition algorithms. 1. Theory and implementation", "abstract": "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", "keyphrases": ["feature recognition algorithms", "geometric models", "general-purpose feature detection techniques", "sets of faces", "depression faces", "protrusion faces", "National Design Repository", "single-face inner-loop technique", "concavity technique", "two-dimensional convex hull method", "curved faces", "three-dimensional convex hull", "CAD/CAM software", "geometric reasoning algorithms", "minimum concave", "visible inner-loop face sets", "multiple-face inner-loop face sets"], "prmu": ["P", "P", "P", "P", "R", "P", "P", "R", "P", "P", "P", "P", "U", "M", "P", "R", "P"]}
{"id": "1144", "title": "Simultaneous iterative reconstruction of emission and attenuation images in positron emission tomography from emission data only", "abstract": "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", "keyphrases": ["image reconstruction", "positron emission tomography attenuation correction", "attenuation correction factors", "log likelihood distribution", "thorax phantom", "activity pixel values", "crosstalk", "iterative image reconstruction", "one-dimensional Newton-type algorithm", "maximum likelihood estimator", "activity distribution", "attenuation coefficients", "statistical noise", "smoothing", "attenuation information"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["banks", "brokerage firms", "wireless applications"], "prmu": ["P", "P", "P"]}
{"id": "1059", "title": "Mustering motivation to enact decisions: how decision process characteristics influence goal realization", "abstract": "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", "keyphrases": ["decision enactment", "motivation", "goal realization", "decision process characteristics", "action psychologists", "post-decision issues", "motivation-mustering potential", "decision process investment", "decision process importance", "decision process confidence", "goal intention", "research opportunities", "decision scientists"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "R", "R", "R", "P", "P", "P"]}
{"id": "1358", "title": "Analysis of the surface roughness and dimensional accuracy capability of fused deposition modelling processes", "abstract": "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", "keyphrases": ["fused deposition modelling processes", "surface roughness", "dimensional accuracy capability", "dimensional precision", "layered manufacturing processes", "prototype parts", "roughness average", "rms roughness", "rapid prototyping", "three-dimensional solid objects", "CAD model", "CNC-controlled robot", "extrusion head"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "M", "U", "M", "U", "U"]}
{"id": "748", "title": "Simulation study of the cardiovascular functional status in hypertensive situation", "abstract": "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", "keyphrases": ["extended cardiovascular model", "pathological changes", "physiological changes", "homeostatic functions", "cardiovascular functional status", "hypertensive situation", "cardiovascular parameter variations", "peripheral vascular resistance", "arterial vessel wall stiffness", "baroreflex gain", "hemodynamics", "short-term regulation", "arterial pressure", "moderate dynamic exercise", "normotensive cases", "computer simulation", "clinical experiments"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P"]}
{"id": "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", "keyphrases": ["telecom", "venture capital firms", "viability"], "prmu": ["P", "P", "P"]}
{"id": "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", "keyphrases": ["scanline-based algorithm", "2D free-form bin packing problem", "heuristic algorithm", "2D-FBP problem", "irregular cutting", "irregular packing", "nesting problem", "minimization", "yield maximization", "shipbuilding company", "group placement algorithm", "first-fit decreasing algorithm"], "prmu": ["P", "P", "P", "P", "U", "M", "P", "P", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["online content subscriptions", "content retooling", "content targeting", "pay-to-play business models"], "prmu": ["P", "R", "R", "U"]}
{"id": "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", "keyphrases": ["coordinate measuring machines", "dynamic errors", "inertial forces", "touch-trigger probe", "laser interferometer", "neural networks", "manufacturing industry", "compensation"], "prmu": ["P", "P", "U", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["finite automata", "semi-input-memory", "invertibility", "semi-input-memory finite automata", "weakly invertible", "delay 1", "state graph", "feedforward inverse finite automata"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1160", "title": "Monoids all polygons over which are omega -stable: proof of the Mustafin-Poizat conjecture", "abstract": "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", "keyphrases": ["monoids all polygons", "omega -stabilizer", "S-polygon", "regular monoid", "Mustafin-Poizat conjecture"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["JPEG2000", "interactive imaging", "image compression", "Joint Photographic Experts Group", "International Standards Organization", "scalable compression", "interoperable compression", "review", "client-server systems"], "prmu": ["P", "P", "P", "P", "P", "R", "R", "P", "P"]}
{"id": "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", "keyphrases": ["F distribution", "cumulative distribution function", "degrees of freedom", "shrinking factor approximation", "chi-square distribution", "numerical analysis"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "671", "title": "Expert advice - how can my organisation take advantage of reverse auctions without jeopardising existing supplier relationships?", "abstract": "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", "keyphrases": ["reverse auctions", "supplier relationships", "preparation", "Request For Quotation"], "prmu": ["P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["weighted factors analysis", "knowledge elicitation", "knowledge representation", "knowledge manipulation", "significance", "WeFA graph", "directed arc", "profitability", "organization", "Binary WeFA", "reasoning", "logic-based argumentation", "decision-support", "knowledge management", "directed weighted graph"], "prmu": ["P", "R", "R", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1261", "title": "Topology-adaptive modeling of objects using surface evolutions based on 3D mathematical morphology", "abstract": "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", "keyphrases": ["level set methods", "topology-adaptive modeling", "surface evolutions", "3D mathematical morphology", "3D object", "arbitrary topology", "repeated distance transformations", "initial approximation", "refined approximation", "energy minimization", "range data", "pseudo curvature flow"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["electronic reserves", "library service", "librarianship", "students", "faculty", "academic libraries", "copyright compliance", "negotiation", "litigation", "legislation", "e-reserves environment", "permission fees"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["women under-representation", "computing profession", "future computer professional perceptions", "employment", "mate students", "female students", "computing courses"], "prmu": ["R", "P", "R", "P", "P", "R", "R"]}
{"id": "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", "keyphrases": ["car-caravan snaking", "active caravan braking", "virtual design", "trailer", "snaking vibrations suppression", "dynamics"], "prmu": ["P", "P", "P", "P", "R", "U"]}
{"id": "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", "keyphrases": ["digital library management system", "Cornell University Library Gateway", "information gateways", "portals", "ENCompass", "metadata"], "prmu": ["P", "P", "P", "P", "P", "U"]}
{"id": "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?", "keyphrases": ["site owners", "polls", "surveys", "content managers", "World Wide Web", "site feedback"], "prmu": ["M", "P", "P", "P", "M", "R"]}
{"id": "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)", "keyphrases": ["edge colorings", "polychromatic stars", "positive integer", "positive integers"], "prmu": ["M", "P", "P", "P"]}
{"id": "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", "keyphrases": ["usable knowledge", "customer relationship management", "banks"], "prmu": ["P", "M", "P"]}
{"id": "1381", "title": "An augmented spatial digital tree algorithm for contact detection in computational mechanics", "abstract": "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", "keyphrases": ["augmented spatial digital tree algorithm", "contact detection", "computational mechanics", "alternating digital tree algorithm", "upper comer vertex", "augmented data structure", "spatial binary tree-based contact detection approaches"], "prmu": ["P", "P", "P", "R", "P", "M", "M"]}
{"id": "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", "keyphrases": ["longitudinal vibration control", "feedback waves", "noncollocated feedback wave control", "collocated feedback wave control", "control design", "wave transmission", "wave reflection", "control force", "complex closed form solution", "standing waves", "vibration energy", "vibration free zone"], "prmu": ["R", "P", "P", "R", "P", "P", "R", "P", "P", "P", "P", "P"]}
{"id": "1040", "title": "CRONE control: principles and extension to time-variant plants with asymptotically constant coefficients", "abstract": "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", "keyphrases": ["CRONE control", "time-variant plants", "asymptotically constant coefficients", "frequency-domain robust control design", "fractional differentiation", "time-variant frequency responses", "stability theorem", "feedback systems", "robust control", "automatic control"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["large scale systems", "average-case identifiability", "average-case controllability", "enhanced process integration", "process control", "multivariable statistics", "high dimension square processes", "nonsquare processes", "measured variables", "manipulated variables", "process identification", "Monte Carlo simulations", "chemical engineering"], "prmu": ["P", "P", "R", "P", "R", "P", "M", "P", "P", "P", "M", "U", "U"]}
{"id": "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", "keyphrases": ["strong stability", "concurrent repetitive processes", "common resources", "steady-state behaviour", "cyclic processes", "mutual exclusion", "recurrent equations framework", "necessary and sufficient conditions", "maximal performance steady-state", "waiting-free steady-states", "constraint logic programming", "3-process system", "Oz language"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["Olympic Games", "online coverage", "marketing", "sponsorship", "economic relevance", "Olympiad", "IOC", "online rights", "e-broadcast"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "M", "U"]}
{"id": "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", "keyphrases": ["Secure Telephony Enabled Middlebox", "STEM", "IP telephony", "network infrastructure", "firewalls", "network address translation devices", "dynamic applications", "STEM architecture", "network design", "static devices", "application layer", "detection mechanisms", "response mechanisms", "network-based vulnerabilities", "SIP protocol"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P"]}
{"id": "1304", "title": "Center-crossing recurrent neural networks for the evolution of rhythmic behavior", "abstract": "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", "keyphrases": ["center-crossing recurrent neural networks", "rhythmic behavior evolution", "null surfaces", "symmetry", "activation function", "evolutionary algorithm", "random initial population", "evolutionary search", "high-fitness oscillatory circuits", "learning", "low mutation variance", "random networks"], "prmu": ["P", "R", "U", "P", "P", "M", "P", "P", "P", "U", "P", "P"]}
{"id": "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", "keyphrases": ["latent variables", "spectral data", "linear model", "near-IR spectroscopy", "predictors", "strong colinearity", "regression models through constrained principal components analysis", "dependent variables", "latent root regression analysis", "tuning parameter"], "prmu": ["P", "P", "P", "U", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["embeddings", "planar graphs", "long-face cycles", "NP-complete problem", "graph drawing"], "prmu": ["P", "P", "P", "R", "M"]}
{"id": "124", "title": "High-speed CMOS circuits with parallel dynamic logic and speed-enhanced skewed static logic", "abstract": "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%", "keyphrases": ["high-speed CMOS circuits", "parallel dynamic logic", "speed-enhanced skewed static logic", "parallel-connected transistors", "low-voltage operation", "logic synthesis", "carry lookahead adders", "delay", "power-delay product", "back-bias effect", "stacked transistors", "32 bit", "0.25 micron"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "U", "U"]}
{"id": "967", "title": "On the relationship between parametric variation and state feedback in chaos control", "abstract": "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", "keyphrases": ["parametric variation", "chaos control", "state-feedback", "logistic", "Henon map", "continuous flows", "Rossler system", "Lorenz system", "diffeomorphisms"], "prmu": ["P", "P", "P", "P", "R", "P", "R", "R", "P"]}
{"id": "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", "keyphrases": ["virtual environments", "physical environments", "collision detection", "discrete time steps", "consecutive time frames", "continuous time intervals", "interframe collision detection", "nonconvex objects", "collision information processing", "fast moving objects", "air traffic control", "smart sensors", "military training", "high speed machining", "convex objects", "tracking"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "M", "P", "P", "U", "R", "U", "U", "P", "P"]}
{"id": "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", "keyphrases": ["strong consensus problem", "distributed consensus problem", "Byzantine agreement", "fault-free processors", "fully connected network", "hybrid fault model", "fault-tolerant distributed system", "strong consensus"], "prmu": ["R", "P", "P", "P", "P", "P", "M", "P"]}
{"id": "609", "title": "Chemical production in the superlative [formaldehyde plant process control system and remote I/O system]", "abstract": "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", "keyphrases": ["chemical production", "formaldehyde production plant construction", "superlative", "BASF", "cost-effective plant", "automation technology", "process control system", "trail-blazing Simatic PCS 7", "Siemens", "remote I/O system I.S.1", "R. STAHL Schaltgerate GmbH", "signal recording", "Zone 1 hazardous area", "Zone 2 hazardous area", "price-performance ratio", "remote I/O field station design"], "prmu": ["P", "M", "P", "P", "R", "P", "P", "P", "P", "P", "P", "R", "R", "R", "P", "R"]}
{"id": "1219", "title": "Knowledge organisation of product design blackboard systems via graph decomposition", "abstract": "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", "keyphrases": ["knowledge organisation", "product design blackboard systems", "graph decomposition", "knowledge-based product design", "data exchange", "case study"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["run-time data flow analysis", "parallelizing compilers", "run-time privatization method", "run-time dead code", "backward data-flow information", "Proteus Test", "dynamic parallelism"], "prmu": ["M", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["data intrinsic dimension estimation", "fractal-based method", "time series", "Santa Fe competition", "pattern recognition"], "prmu": ["R", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["scalable hybrid computation", "spikes", "hybrid analog-digital scheme", "moderate-precision analog units", "frequent discrete signal restoration", "analog noise", "spike-count codes", "finite-state-machine", "distributed analog computation", "spike-time codes", "digital carry interactions", "binary control vector", "feedback interactions", "two neuron hybrid state machine", "error-correcting analog-to-digital conversion", "silicon circuits", "pattern recognition", "learning", "vector quantization"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["DVD media manufacturers", "DVD format war", "DVD-RAM", "DVD+RW", "DVD+R", "DVD-RW", "DVD-R", "compatibility", "writable DVD"], "prmu": ["P", "P", "U", "U", "U", "U", "U", "U", "M"]}
{"id": "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", "keyphrases": ["algorithmic results", "ordered median problems", "objective function", "location theory", "ordered median function", "finite dominating sets", "polynomial time algorithms", "detailed complexity analysis"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["girls", "teachers", "computer science", "programming", "women", "childhood", "gender issues", "boys"], "prmu": ["P", "P", "P", "P", "P", "P", "U", "P"]}
{"id": "1042", "title": "Chaotic phenomena and fractional-order dynamics in the trajectory control of redundant manipulators", "abstract": "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", "keyphrases": ["chaotic phenomena", "fractional-order dynamics", "trajectory control", "redundant manipulators", "classical arms", "trajectory optimization", "kinematic control algorithms", "generalized inverse matrices", "trajectory planning schemes", "fractional calculus"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["decentralized integral controllability", "necessary sufficient conditions", "stable decentralized controllers", "integral action", "closed-loop properties", "stable independent detuning", "control system design", "systematic control structure selection", "steady-state process gain matrix", "real structured singular value", "controller gain realness", "unworkable pairing elimination", "Schur complement"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "R", "P", "P", "R", "R", "U"]}
{"id": "885", "title": "Assignment of periods and priorities of messages and tasks in distributed control systems", "abstract": "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", "keyphrases": ["periods assignment", "priorities assignment", "message-based scheduling method", "distributed control systems", "task-based scheduling method", "end-to-end constraints", "precedence constraints", "time constraints"], "prmu": ["R", "R", "P", "P", "M", "P", "P", "P"]}
{"id": "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", "keyphrases": ["discreteness", "relevance", "continuity", "cognitive systems", "neural systems"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["rapid local area modeling", "construction automation", "rapid 3D positioning", "equipment operations", "spatial perception", "rapid local area sensing", "3D modeling", "human-assisted graphical workspace modeling", "pre-stored Computer-Aided Design models", "single-axis laser rangefinders", "remote video cameras"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P"]}
{"id": "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", "keyphrases": ["computer supported cooperative work", "end-user perspectives", "information systems", "meta-analyses", "information technology", "CSCW", "activity theory"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "126", "title": "A new architecture for implementing pipelined FIR ADF based on classification of coefficients", "abstract": "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", "keyphrases": ["pipelined FIR ADF", "coefficient classification", "adaptive digital filter", "maximum delay", "delayed least mean square filter", "pre-upsampled filter", "post-downsampled filter", "convergence speed"], "prmu": ["P", "R", "P", "P", "R", "R", "R", "P"]}
{"id": "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", "keyphrases": ["sliding mode control", "chaos", "cubic Chua circuit system", "sliding surface", "chattering", "state change", "match disturbance", "mismatch disturbance"], "prmu": ["P", "P", "R", "P", "P", "P", "U", "U"]}
{"id": "920", "title": "Three-dimensional periodic Voronoi grain models and micromechanical FE-simulations of a two-phase steel", "abstract": "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", "keyphrases": ["two-phase steel", "three-dimensional model", "periodic Voronoi grain models", "micromechanical FEM simulations", "microstructures modeling", "periodic boundary conditions", "Voronoi algorithm", "geometrical model", "ferrite-pearlite steel", "stress-strain curves", "Voronoi tessellation", "adaptive mesh generator", "quadtree/octree-based algorithm", "kinematic constraints", "computational time"], "prmu": ["P", "P", "P", "M", "R", "P", "P", "P", "M", "P", "M", "M", "M", "U", "U"]}
{"id": "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", "keyphrases": ["FLID-DL", "congestion control", "fair layered increase/decrease with dynamic layering", "multirate congestion control algorithm", "layered multicast sessions", "receiver-driven layered congestion control protocol", "Internet group management protocol", "scalable congestion control", "IGMP", "transmission control protocol", "sender-initiated synchronization", "multicast layers", "simulations", "throughput", "dynamic layering", "Internet protocol multicast", "TCP fairness"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "R", "R"]}
{"id": "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", "keyphrases": ["credit card company", "Capital One", "customer growth", "cutting-edge technology"], "prmu": ["P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["market research company", "Mori", "interim IT manager"], "prmu": ["P", "P", "P"]}
{"id": "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", "keyphrases": ["super high definition image transmission system", "WHD image transmission system", "CODECs", "camera system imaging", "reality-enhanced feeling"], "prmu": ["R", "P", "P", "P", "P"]}
{"id": "958", "title": "Efficient combinational verification using overlapping local BDDs and a hash table", "abstract": "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", "keyphrases": ["combinational verification", "overlapping local BDDs", "hash table", "combinational circuit verification", "case-by-case verification", "internal node pairs", "internal correspondence based verification", "heuristics", "structural levels", "BDD manager", "BDD sizes", "cutsets", "ISCAS85 benchmark circuits", "hard industrial circuits", "internal equivalences", "formal verification", "internal correspondence-based verification", "binary decision diagrams"], "prmu": ["P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "M", "P"]}
{"id": "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", "keyphrases": ["wedge strip test", "boundary constraints", "sheet buckling", "forming processes", "tensile test machine", "strain state", "energy-based analytical wrinkling criterion", "stress field", "deformed geometry", "finite element analysis"], "prmu": ["P", "P", "P", "M", "P", "P", "P", "P", "P", "M"]}
{"id": "1127", "title": "Repeated games with lack of information on one side: the dual differential approach", "abstract": "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", "keyphrases": ["repeated games", "dual differential game", "repeated game", "discrete time approximations", "limit value", "discrete time", "viscosity solution", "limit condition"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["finite simple groups recognition", "divisibility relation", "element orders"], "prmu": ["R", "U", "P"]}
{"id": "793", "title": "Advancements during the past quarter century in on-line monitoring of motor and generator winding insulation", "abstract": "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", "keyphrases": ["generator winding insulation", "motor generator winding insulation", "winding insulation on-line monitoring", "premature insulation failure", "electrical insulation", "electronics", "sensors", "computers", "software", "rotor windings", "stator windings", "temperature monitoring", "condition monitors", "tagging compounds", "ozone monitoring", "PD monitoring", "magnetic flux monitoring", "partial discharge monitoring", "endwinding vibration monitoring"], "prmu": ["P", "R", "R", "R", "P", "P", "P", "P", "P", "P", "P", "M", "M", "U", "M", "M", "M", "M", "M"]}
{"id": "1383", "title": "Semantic data broadcast for a mobile environment based on dynamic and adaptive chunking", "abstract": "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", "keyphrases": ["mobile databases", "mobile computing", "semantic data broadcast", "mobile clients", "semantic descriptor", "data chunking", "query processing", "data affinity index", "adaptive chunking", "answerability"], "prmu": ["R", "M", "P", "P", "P", "P", "M", "P", "P", "P"]}
{"id": "800", "title": "A model for choosing an electronic reserves system: a pre-implementation study at the library of Long Island University's Brooklyn campus", "abstract": "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)", "keyphrases": ["electronic reserves system", "Long Island University Brooklyn Campus Library"], "prmu": ["P", "R"]}
{"id": "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", "keyphrases": ["gender bias", "software design", "gender-role influenced achievement choice model", "computing career", "ethical issues", "occupational equity"], "prmu": ["P", "P", "R", "R", "P", "P"]}
{"id": "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", "keyphrases": ["numerical approximation", "nonlinear boundary value problems", "boundary value methods", "mesh selection strategy", "quasi-linearization technique", "Newton method", "nonlinear differential equation", "stopping criteria", "stiff problems", "BVMs"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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\"", "keyphrases": ["banking", "mobile-commerce", "GPRS", "wireless application protocol"], "prmu": ["P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["content management", "enterprise systems", "product functionality", "partnerships", "industry consolidation"], "prmu": ["P", "U", "P", "P", "P"]}
{"id": "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", "keyphrases": ["LAN-based building maintenance and surveillance robot", "high-rise building", "security purposes", "building management system", "local area network", "first-line fault attendance", "hardware structure", "pan/tilt/zoom functions", "teleoperation", "landmark recognition method"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["basin configuration", "six-dimensional model", "electric power system", "massively complex electrical power systems", "global geometric structure", "infinite bus", "attractors", "pathological states", "global map", "state space", "power system stability"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "556", "title": "Coarse-grained reduction and analysis of a network model of cortical response: I. Drifting grating stimuli", "abstract": "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", "keyphrases": ["large-scale network model", "visual cortex", "neuronal networks", "coarse-graining", "point-neuron network", "phase-averaged firing rates", "nonlinear spatiotemporal integral equations", "dynamics", "orientation selectivity"], "prmu": ["P", "P", "R", "P", "P", "R", "P", "U", "P"]}
{"id": "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", "keyphrases": ["autonomic computing", "new age computing", "AC", "self-managed computing", "IBM initiative", "computing reliability", "problem-free computing", "computer speed", "computer memory", "computer crash", "IT industry initiatives", "AC requirements", "AC development", "AC implementation", "open standards", "self-healing computing", "adaptive algorithms"], "prmu": ["P", "P", "P", "P", "R", "R", "R", "R", "R", "R", "R", "R", "R", "R", "U", "M", "U"]}
{"id": "1146", "title": "Mammogram synthesis using a 3D simulation. I. Breast tissue model and image acquisition simulation", "abstract": "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", "keyphrases": ["mammogram synthesis", "3D simulation", "breast tissue model", "image acquisition simulation", "mammographic compression", "computer breast model", "adipose compartments", "ducts", "X-ray image acquisition", "tissue elasticity parameters", "force values", "monoenergetic parallel beam approximation", "breast lesions", "rectangular slice approximation", "composite beam model", "linear Young's moduli"], "prmu": ["P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "M", "M", "M", "U"]}
{"id": "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", "keyphrases": ["fan-beam projections", "2D image reconstruction", "exact stable reconstruction", "region-of-interest", "vertex path", "filtered-backprojection algorithm", "X-ray computed tomography", "short-scan condition", "Hilbert transform", "Radon transform", "rebinning formula", "convolution", "linear interpolation", "3D head phantom"], "prmu": ["P", "P", "R", "P", "P", "P", "U", "M", "U", "U", "U", "U", "U", "U"]}
{"id": "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", "keyphrases": ["hybrid active filter", "harmonic elimination", "harmonic currents suppression", "active filter", "passive filter", "equivalent output voltage", "harmonic currents", "nonlinear load", "converter power rating reduction", "DC-link voltage regulation", "active filter equivalent voltage", "computer simulation", "scaled-down laboratory prototype", "voltage source inverter"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "P", "M", "P", "R", "P", "P", "M"]}
{"id": "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", "keyphrases": ["web services", "transaction support", "security"], "prmu": ["P", "U", "U"]}
{"id": "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", "keyphrases": ["software projects", "manufacturing industry", "budgeting", "management", "software requirements"], "prmu": ["P", "M", "P", "U", "M"]}
{"id": "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", "keyphrases": ["multi-access portals", "consumer portal operators", "revenue streams", "fee-based services", "advertising", "blue-chip sponsorship"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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\"", "keyphrases": ["Internet", "knowledge", "academy", "education", "certification", "university", "faculty", "liberal studies"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "861", "title": "The decision procedure for profitability of investment projects using the internal rate of return of single-period projects", "abstract": "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", "keyphrases": ["decision procedure", "investment project profitability", "internal rate of return", "single-period projects", "profitability", "cash flows", "investment project decomposition", "IRR criterion", "project investment rate", "PIR"], "prmu": ["P", "R", "P", "P", "P", "P", "M", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Moys Classification Scheme", "law society library"], "prmu": ["P", "P"]}
{"id": "1066", "title": "Application of artificial intelligence to search ground-state geometry of clusters", "abstract": "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", "keyphrases": ["artificial intelligence", "ground-state geometry", "atomic clusters", "global optimization procedure", "neural-assisted genetic algorithm", "artificial neural network", "population", "optimum solution", "silicon clusters", "Si/sub 10/", "Si/sub 20/", "cluster size"], "prmu": ["P", "P", "M", "P", "P", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["nonlinear dual-window operator", "edge detection", "nonlinear edge detection technique", "two-concentric-circular-window operator", "standard gradient", "dual window operator", "zero-crossing points", "difference function", "minimum values", "maximum values", "computational efficiency", "detected edges", "Laplacian algorithms", "Gaussian algorithms", "Canny's algorithms", "computational load", "nonlinear processing"], "prmu": ["P", "P", "P", "P", "P", "M", "P", "P", "R", "P", "P", "P", "R", "P", "R", "P", "M"]}
{"id": "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", "keyphrases": ["search algorithms", "CSP", "Constraint Satisfaction Problems", "local search algorithms", "systematic algorithms", "partial assignments", "filtering techniques", "tabu decision-repair"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1367", "title": "The set of just-in-time management strategies: an assessment of their impact on plant-level productivity and input-factor substitutability using variable cost function estimates", "abstract": "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", "keyphrases": ["just-in-time management strategies", "plant-level productivity", "input-factor substitutability", "variable cost function estimates", "automobile industry", "JIT", "efficiency", "product quality", "auto-parts manufacturing firms"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["information access", "blind clients", "visually impaired clients", "information and referral systems", "communication techniques", "disability etiquette", "effective voice", "accessible media", "in-person communication", "assistive technologies", "electronic communications", "written communications", "large-print materials", "Braille materials"], "prmu": ["R", "R", "P", "M", "P", "P", "P", "P", "P", "P", "P", "R", "R", "P"]}
{"id": "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", "keyphrases": ["co-operative Web caching architecture", "network caching", "network traffic reduction", "network latency reduction", "co-operative hit rate", "cooperative cache system", "protocols", "hierarchical caching", "transversal caching", "network load", "scalable architecture", "low traffic overhead", "low database overhead", "Web browser", "World Wide Web"], "prmu": ["P", "P", "M", "M", "P", "P", "P", "R", "P", "P", "R", "R", "R", "M", "M"]}
{"id": "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", "keyphrases": ["technology deployment", "implementation", "incremental targets", "third-party integration", "vendor-supplied hardware integration services", "vendor-supplied software integration services", "manufacturers"], "prmu": ["P", "P", "U", "U", "U", "U", "U"]}
{"id": "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", "keyphrases": ["harmless delays", "Cohen-Grossberg neural networks", "monotonicity", "differentiability", "activation functions", "interconnections", "globally asymptotic stability", "multiple delays", "Lyapunov functionals", "Razumikhin technique"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["nonGaussian stock price model", "financial instruments", "option pricing formulas", "nonextensive thermodynamics parameter", "Black-Scholes partial differential equation", "closed-form solutions", "stock volatility", "volatility smile", "empirical distribution"], "prmu": ["M", "P", "P", "P", "R", "P", "P", "P", "P"]}
{"id": "904", "title": "Modeling and simulation of adaptive available bit rate voice over asynchronous transfer mode networks", "abstract": "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", "keyphrases": ["simulation", "modeling", "performance analysis", "voice quality", "traffic", "feedback", "resource management cells", "encoding level", "bandwidth contention", "scheduling/drop policies", "queue size", "averaging interval length", "performance metrics", "link capacity", "adaptive available bit rate voice", "ATM networks"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "P", "M", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["digital age", "online music delivery", "music industry", "Internet", "Napster", "digital content creators"], "prmu": ["P", "R", "R", "U", "U", "P"]}
{"id": "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", "keyphrases": ["average depth", "decision trees", "Boolean functions", "average time complexity", "worst case time complexity"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "697", "title": "Schedulability analysis of real-time traffic in WorldFIP networks: an integrated approach", "abstract": "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", "keyphrases": ["WorldFIP Networks", "EN-50170 European fieldbus standard", "real-time traffic schedulability analysis", "distributed computer-controlled systems", "communication services", "aperiodic exchanges", "traffic online admission control", "first-come-first-served policy", "periodic process variables", "real-time communication", "scheduling algorithms", "response time"], "prmu": ["P", "R", "R", "P", "P", "P", "P", "P", "P", "R", "M", "M"]}
{"id": "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", "keyphrases": ["integrate-and-fire neurons", "correlated stochastic input", "synaptic input correlations", "firing times", "correlated binary variable", "coefficient of variation", "spike-train variability", "computer simulation", "output spike trains", "temporal correlations"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["archival documents restoration", "wavelet technique", "handwritten archival documents", "ink seepage", "wavelet reconstruction process", "iterative stroke enhancement", "Canny edge detector"], "prmu": ["R", "P", "P", "M", "P", "R", "P"]}
{"id": "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", "keyphrases": ["bivariate dependence", "convex order", "discrete uniform distributions", "probability measures", "topology", "weak convergence", "component variability", "mean life", "serial systems", "parallel systems", "bivariate probability distributions"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "R"]}
{"id": "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?", "keyphrases": ["UK health records", "electronic records project", "integrated care records services", "health care", "social care"], "prmu": ["P", "P", "M", "M", "U"]}
{"id": "1000", "title": "Does classicism explain universality? Arguments against a pure classical component of mind", "abstract": "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", "keyphrases": ["classicism", "universality", "classical component of mind", "human cognition", "universal generalization", "connectionist models", "classical symbol systems", "syntax-sensitive rules", "causal explanations", "mental processes"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1045", "title": "Using fractional order adjustment rules and fractional order reference models in model-reference adaptive control", "abstract": "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", "keyphrases": ["fractional order adjustment rules", "fractional order reference models", "model-reference adaptive control", "MRAC", "FOC", "fractional calculus"], "prmu": ["P", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["M/D/1 queue", "deterministic server vacations", "Poisson arrivals", "deterministic service", "deterministic vacations", "M/D/D/1 model", "time-dependent probability generation functions", "steady state probability generation functions", "mean number", "mean waiting time"], "prmu": ["P", "P", "P", "P", "P", "R", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["air conditioning", "energy efficiency"], "prmu": ["P", "P"]}
{"id": "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", "keyphrases": ["GKN Sinter Metals", "powder metal lines", "automating", "conveyors", "gentle transfer units", "robotic systems"], "prmu": ["P", "P", "P", "U", "U", "U"]}
{"id": "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", "keyphrases": ["in situ health monitoring", "piezoceramic wafer elements", "fatigue degradation", "metallic specimens", "cyclic loading", "Lamb waves", "surface-mounted piezotransducer elements", "structural degradation", "robustness", "loading conditions", "automated in situ structural health monitoring", "fatigue operational structures", "aircraft"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["optimal control", "transport equation", "Liouville machine", "scattering behavior", "physical particles", "adaptive behavior", "embedded agents"], "prmu": ["P", "P", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["formula-dependent equivalence", "compositional minimization", "CTL model checking", "polytime computable state equivalence", "CTL formula", "coarse equivalence", "complexity reduction", "interacting FSM", "automatic method", "formal design verification", "computation tree logic"], "prmu": ["P", "M", "P", "P", "P", "M", "M", "P", "R", "U", "M"]}
{"id": "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", "keyphrases": ["small business owners", "information technology implementation", "negative attitudes", "positive attitudes", "uncertain attitude", "risk", "organization", "management style", "computer specialists", "planning"], "prmu": ["P", "R", "P", "R", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["outlier detection", "prediction sample", "calibration samples", "uncertainty estimation", "convex hull method", "Mahalanobis distance", "X-residuals", "potential functions", "robust techniques", "inliers"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1259", "title": "A mechanism for inferring approximate solutions under incomplete knowledge based on rule similarity", "abstract": "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", "keyphrases": ["inference method", "approximate solution", "incomplete knowledge", "rule similarity", "problem solving", "SLD procedure", "subgoal atom", "consequence atom", "word knowledge base", "reasoning", "reliability", "representative solution", "common sense knowledge"], "prmu": ["P", "P", "P", "P", "R", "P", "R", "P", "R", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["post-projected Runge-Kutta methods", "numerical approximation", "order of convergence", "projected methods", "index-2 differential-algebraic equations"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "588", "title": "An accurate COG defuzzifier design using Lamarckian co-adaptation of learning and evolution", "abstract": "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", "keyphrases": ["optimal center of gravity defuzzifier", "learning", "evolution", "fuzzy logic controller", "local search"], "prmu": ["R", "P", "P", "P", "P"]}
{"id": "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?", "keyphrases": ["corporate portal", "return on investment", "ROI calculator", "web sites", "metrics"], "prmu": ["P", "M", "P", "P", "U"]}
{"id": "631", "title": "A modified Fieller interval for the interval estimation of effective doses for a logistic dose-response curve", "abstract": "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", "keyphrases": ["modified Fieller interval", "interval estimation", "effective doses", "logistic dose-response curve", "asymptotic variance", "maximum likelihood estimator", "delta interval", "Fieller's theorem", "median effective dose"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1264", "title": "Estimation of the vanishing point for automatic driving system using a cross ratio", "abstract": "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", "keyphrases": ["vanishing point estimation", "automatic driving system", "cross ratio", "automatic driving systems", "collinear points", "Hough space", "lane markings", "real road scene"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["reciprocal tutoring computational support", "collaborative learning", "scaffolding tools", "computer-simulated virtual participant", "system architecture", "intelligent tutoring system"], "prmu": ["R", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["IT spending", "content management", "Web delivery", "publishing", "budget", "computer support", "customer relationship management"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["continuous-time systems", "linear systems", "continuous input-output maps", "time-invariant systems", "impulse response", "zero function", "frequency domain response", "commutation", "signal processing"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "575", "title": "A new voltage-vector selection algorithm in direct torque control of induction motor drives", "abstract": "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", "keyphrases": ["voltage-vector selection algorithm", "direct torque control", "induction motor drives", "AC drives", "high dynamic performance", "torque ripple", "voltage vector selection strategy", "operating conditions", "RMS value", "stator current ripple", "inverter switching frequency", "torque variations", "flux variations", "4-poles induction motor", "steady-state operation", "dynamic behavior", "torque step response", "220 V", "50 Hz", "4 kW"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "M", "M", "M", "R", "M", "U", "U", "U"]}
{"id": "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", "keyphrases": ["element orders", "finite group", "isomorphism"], "prmu": ["P", "P", "P"]}
{"id": "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", "keyphrases": ["QoS", "Diffserv", "traffic conditioning", "packet forwarding", "AF", "feedback mechanism", "fairness", "TCP", "feedback control", "QoS architecture"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "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\"", "keyphrases": ["double-bracket flows discretization", "Magnus series", "Lie-algebraic equations", "isospectral flow", "Taylor expansion", "bicolor leaves"], "prmu": ["R", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["database broadcasting", "query processing", "access time", "tuning time", "broadcast program", "wireless broadcast channels", "access latency", "mobile computing"], "prmu": ["M", "P", "M", "U", "M", "P", "P", "P"]}
{"id": "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", "keyphrases": ["action aggregation", "defuzzification", "Mamdani-type fuzzy systems", "sentence connective", "set union operation", "fuzzy rules", "fuzzy response", "crisp signals", "transparency", "mapping accuracy"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["pipeline shrinkage problem", "women", "computer science degrees", "science", "engineering"], "prmu": ["M", "P", "M", "P", "P"]}
{"id": "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", "keyphrases": ["integrated optical metrology", "transistor gate critical dimension", "post etch CD control", "IC fabs", "target gate length", "operational speed", "optical CD metrology tools", "etch mainframes", "etcher stability", "in-line process control", "lithography tools", "CD performance", "photolithography"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "R", "P", "U"]}
{"id": "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.\"", "keyphrases": ["Content Delivery Networks", "Web-site operators", "delivery quality", "scalability", "security", "outsourced service model", "World Wide Web", "Web interaction", "Web-based business models", "Internet experience"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P", "P", "P"]}
{"id": "1085", "title": "A variable-stepsize variable-order multistep method for the integration of perturbed linear problems", "abstract": "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", "keyphrases": ["variable-stepsize variable-order multistep method", "perturbed linear problems integration", "perturbed oscillator", "monomials", "Taylor series", "multistep code", "constant steplength methods", "Adams methods"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Web-based intelligent helpdesk-support environment", "Internet technology", "WebHotLine", "customer service centre", "Web-based fault information retrieval", "online multilingual translation capability", "videoconferencing"], "prmu": ["P", "P", "P", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["permission grid", "spatial occupancy grid", "polygonal surface simplification algorithm", "guaranteed geometric error bound", "approximation", "error-bounded simplification", "user-specified distance", "scientific computing", "adaptive level of detail control", "arbitrary triangular models", "mesh degeneracies", "error tolerance", "vertex correspondences", "representation complexity", "running time overhead"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["access privilege management", "protection systems", "protected objects", "locks", "key-lock technique", "polymorphic access rights", "complex access privilege possession certification", "selective revocation", "lock conversion function"], "prmu": ["P", "P", "P", "P", "P", "P", "M", "P", "P"]}
{"id": "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", "keyphrases": ["3D object level of detail modeling system", "wavelet-based level-of-detail representation", "range images", "wavelet transform", "marching cube algorithm", "base mesh", "decimation algorithm", "wavelet coefficients", "critical problem", "surface crease problem", "mesh simplification", "hierarchy transformation"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "1141", "title": "Reproducibility of mammary gland structure during repeat setups in a supine position", "abstract": "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", "keyphrases": ["mammary gland structure reproducibility", "repeat setups", "supine position", "breast conserving therapy", "contrast-enhanced magnetic resonance imaging", "accurate tumor localization", "breast immobilization device", "reproducibility margins", "internal tissue shifts", "localization methods"], "prmu": ["R", "P", "P", "P", "R", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["three-stage pipelined architecture", "multi-view images decoder", "hardware structure", "pixel depth", "node selector", "depth extractor", "affine transformer", "viewpoint", "Max+PlusII design tool", "operating frequency", "30 MHz"], "prmu": ["M", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Philadelphia stock exchange", "TimesTen", "Equity Options AutoQuote System", "data architecture"], "prmu": ["P", "P", "P", "P"]}
{"id": "650", "title": "Molecular descriptor selection combining genetic algorithms and fuzzy logic: application to database mining procedures", "abstract": "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", "keyphrases": ["molecular descriptor selection", "database mining", "data mining", "genetic algorithms", "fuzzy clustering method", "fuzzy logic", "descriptor hyperspace exploration", "local convergence", "stepwise approach", "fitness function", "test sets", "training sets", "fitness score", "Bullseye", "olfactory compounds", "odor categories"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["fossil-fuelled power plant simulator", "intelligent tutoring system", "SIMULINK", "object oriented programming", "control simulation", "C programming language", "CAI"], "prmu": ["P", "P", "P", "P", "R", "P", "U"]}
{"id": "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", "keyphrases": ["HPF/SX V2", "High Performance Fortran compiler", "vector parallel machines", "benchmark", "parallelization", "compiler"], "prmu": ["P", "R", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["HPCView", "top-down analysis", "node performance", "complex scientific programs", "peak performance", "instruction-level parallelism", "deep memory hierarchies", "performance analysis", "source code", "commodity Web browser", "data layout", "optimizing compilers", "software tools", "binary analysis"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "M"]}
{"id": "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", "keyphrases": ["bistable MEMS", "optical actuation scheme", "radiation pressure", "MEMS devices", "intersecting light beams", "high temperature environments", "high radiation environments", "heat transfer model"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "P"]}
{"id": "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", "keyphrases": ["network intrusion", "fault detection", "Internet", "computer network attacks", "denial of service", "early warning systems", "neural network classification", "ad hoc wireless experiments", "backpropagation", "perceptron-back propagation hybrid", "electronic commerce environment", "adaptive/automatic network/service intrusion", "wide area data networks", "e-commerce infrastructure", "hierarchical multitier statistical anomaly detection", "multiwindow anomaly detection", "wired ad hoc networks", "wireless ad hoc networks", "statistical models", "multivariate classifiers", "traffic anomaly intensity", "background traffic intensity"], "prmu": ["P", "P", "P", "M", "M", "R", "M", "M", "U", "U", "P", "P", "P", "P", "R", "R", "R", "P", "P", "P", "P", "P"]}
{"id": "708", "title": "Sufficient conditions on nonemptiness and boundedness of the solution set of the P/sub 0/ function nonlinear complementarity problem", "abstract": "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", "keyphrases": ["sufficient conditions", "nonemptiness", "boundedness", "solution set", "P/sub 0/ function nonlinear complementarity problem"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "866", "title": "Adjoint-based optimization of steady suction for disturbance control in incompressible flows", "abstract": "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", "keyphrases": ["adjoint-based optimization", "steady suction", "disturbance control", "incompressible flows", "quasithree-dimensional incompressible boundary layers", "flat plate", "parabolized stability equations", "gradient-based optimization procedure", "stabilization procedure", "Tollmien-Schlichting waves", "steady streamwise streaks", "oblique waves", "adverse pressure gradient", "mean flow", "steady cross-flow mode", "laminar-turbulent transition"], "prmu": ["P", "P", "P", "P", "M", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["thermal coefficients", "magneto-optical media", "thermal conductivity", "laser power", "maximum temperature", "TbFeCo layer", "Curie temperature", "dielectric layer", "heat capacity", "aluminum alloy layer", "magneto-optic recording media", "static disks", "light focusing", "thermal diffusion", "multilayer structure", "irradiation time", "TbFeCo"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1435", "title": "Experimental investigations on monitoring and control of induction heating process for semi-solid alloys using the heating coil as sensor", "abstract": "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", "keyphrases": ["induction heating process", "process monitoring", "process control", "semisolid alloys", "semisolid metal casting", "heating coil sensor", "coil impedance", "reactance component", "billet state", "billet deformation", "resistance component", "resistivity variation", "solid/liquid fraction", "solenoid coil", "20 to 700 C"], "prmu": ["P", "R", "R", "M", "M", "R", "R", "P", "P", "R", "P", "R", "P", "M", "M"]}
{"id": "1019", "title": "Optical setup and analysis of disk-type photopolymer high-density holographic storage", "abstract": "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", "keyphrases": ["disk-type photopolymer high-density holographic storage", "optical setup", "angular multiplexing", "spatial multiplexing", "recording capacity", "recording density", "spatio-angular multiplexing", "limited medium thickness", "optimal beam recording angle", "maximum recording capacity", "maximum density"], "prmu": ["P", "P", "R", "P", "P", "R", "M", "P", "P", "P", "R"]}
{"id": "1024", "title": "Rational systems exhibit moderate risk aversion with respect to \"gambles\" on variable-resolution compression", "abstract": "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", "keyphrases": ["variable-resolution compression", "progressive transmission", "rational system", "moderate risk aversion", "embedded wavelet scheme", "tree structure", "hierarchical pyramid spatial relationship", "transform coefficients", "local spatial region", "successive-approximation quantization", "reconstructed image", "truncation time", "behavioral inconsistency avoidance", "gambles", "image encoding", "acceptable predictor", "visual distinctness", "digital imagery", "embedded coding", "rate control optimization", "decision problem", "progressive transmission utility functions", "information theoretic measure"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "R", "P", "R", "P", "P", "P", "R", "U", "U", "M", "U"]}
{"id": "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", "keyphrases": ["Extensible Firmware Interface standard", "anti-virus", "embedded systems"], "prmu": ["R", "P", "P"]}
{"id": "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", "keyphrases": ["X-Rite", "graphic arts", "colour measurement"], "prmu": ["P", "P", "M"]}
{"id": "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", "keyphrases": ["semiconductor industry", "IC manufacturing", "automated post bonding inspection", "machine vision", "wire bonding", "packaging", "bond pad connection", "lead fingers", "bonding line missing", "bonding line breakage", "bonding balls", "defect classification", "image preprocessing", "orientation determination", "connection detection", "bonding line detection", "bonding ball detection"], "prmu": ["P", "U", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Valiant Programme", "police IT", "UK"], "prmu": ["P", "P", "U"]}
{"id": "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", "keyphrases": ["3D visibility complex", "computer graphics", "hidden-part removal", "view computation", "shadow boundaries", "mutual object visibility", "lighting simulation", "smooth convex objects", "light rays", "maximal free segments", "visual events", "worst case complexity analysis", "probabilistic study", "normal scenes", "temporal visibility", "output-sensitive construction algorithm"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "R", "P", "R", "P", "P"]}
{"id": "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", "keyphrases": ["PKI", "business-critical applications", "public key infrastructure", "e-commerce", "IPSec VPNs", "PKI vendors", "security", "secure remote access", "secure messaging", "electronic document exchange", "transaction validation", "network authentication", "Baltimore Technologies", "Entrust", "GeoTrust", "RSA Security", "VeriSign"], "prmu": ["P", "M", "P", "U", "U", "P", "P", "P", "P", "P", "P", "P", "U", "U", "U", "M", "U"]}
{"id": "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", "keyphrases": ["speaker adaptive modeling", "vocal tract normalization", "databases", "training method", "single-density acoustic models", "HMM state", "frequency scale factor", "training speakers", "single Gaussian densities", "training results", "error rate reduction", "two-pass strategy", "nonnormalized acoustic model", "word sequence", "telephone digit string recognition", "German spontaneous speech task", "Verlimobil", "WSJ task", "German telephone digit string corpus", "SieTill"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "M", "P", "M", "P", "P", "P", "U", "P", "P", "P"]}
{"id": "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", "keyphrases": ["rank tests", "association", "paired exchangeable data", "twin lifespans", "pooled sample", "nonparametric test", "within-pair ranks", "within-pair rank products", "null hypothesis", "within-pair independence", "test statistics", "exact means", "exact variances", "nonparametric statistical evidence", "longevity", "identical twins", "fraternal twins", "Danish twin registry", "clinical trial", "ventilation tube failure time", "bilateral otitis media"], "prmu": ["P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "R", "P"]}
{"id": "12", "title": "National learning systems: a new approach on technological change in late industrializing economies and evidences from the cases of Brazil and South Korea", "abstract": "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", "keyphrases": ["national learning systems", "technological change", "late industrializing economies", "Brazil", "South Korea", "national innovation system"], "prmu": ["P", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["finite element method", "parallel programs", "Poisson equation", "HPF compiler", "conjugate gradient solver", "message passing", "element-by-element", "HPF"], "prmu": ["M", "M", "R", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["evolutionary algorithms", "multimodal test function", "convergence probability", "convergence speed", "parallel evolutionary algorithms", "parallelizing"], "prmu": ["P", "P", "P", "P", "R", "P"]}
{"id": "903", "title": "Modeling and simulation of an ABR flow control algorithm using a virtual source/virtual destination switch", "abstract": "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", "keyphrases": ["modeling", "ABR flow control algorithm", "virtual source/virtual destination switch", "ATM networks", "available bit rate service class", "feedback control mechanism", "link capacities", "control loop", "feedback delay", "traffic control", "closed segments", "classical linear control theory", "discrete event simulations", "transient behavior", "control model", "performance issues", "stability", "high link utilization", "fair bandwidth distribution", "robust operation"], "prmu": ["P", "P", "P", "M", "R", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "140", "title": "A high-resolution high-frequency monolithic top-shooting microinjector free of satellite drops - part II: fabrication, implementation, and characterization", "abstract": "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", "keyphrases": ["monolithic top-shooting microinjector", "satellite drops", "thermal driven microinjector", "bubble check valve", "bulk/surface-combined micromachining", "bonding process", "inkjet printhead", "nozzle", "droplet volume", "consumer market", "crosstalk", "10 micron", "35 kHz"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "P"]}
{"id": "591", "title": "Approximation theory of fuzzy systems based upon genuine many-valued implications - MIMO cases", "abstract": "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", "keyphrases": ["multi-input-multi-output fuzzy systems", "Boolean type fuzzy systems", "fuzzy systems", "many-valued implication", "universal approximator"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "946", "title": "Entanglement measures with asymptotic weak-monotonicity as lower (upper) bound for the entanglement of cost (distillation)", "abstract": "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)", "keyphrases": ["entanglement measures", "asymptotic weak-monotonicity", "entanglement of cost", "distillation"], "prmu": ["P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Greenberger-Horne-Zeilinger paradoxes", "many qubits", "GHZ contradictions", "entangled state", "GHZ paradox"], "prmu": ["P", "P", "R", "P", "P"]}
{"id": "1139", "title": "Development and evaluation of a case-based reasoning classifier for prediction of breast biopsy outcome with BI-RADS/sup TM/ lexicon", "abstract": "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", "keyphrases": ["case-based reasoning classifier", "breast biopsy outcome", "BI-RADS lexicon", "benign lesions", "biopsy-proven mammographic cases", "CBR similarity", "Hamming distance measure", "Euclidean distance measure", "calcification distribution", "calcification morphology", "calcification number", "mass margin", "mass shape", "mass density", "mass size", "associated findings", "special cases", "age", "Round Robin sampling", "Receiver Operating Characteristic analysis", "bootstrap", "feature combinations", "similarity thresholds", "feature subsets", "highest partial ROC areas", "influential features", "diagnostic tool", "mammographic lesion classification", "short-term follow-up"], "prmu": ["P", "P", "R", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["polymorphic subtypes", "products subtypes", "Hilbert style axiomatization", "logical semantics", "Gentzen style calculi", "finite binary tree", "pushdown store", "metamathernatical properties", "decidability"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "M", "P"]}
{"id": "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", "keyphrases": ["robust Kalman filter", "discrete time-delay systems", "uncertain systems", "state delay", "time-varying parameter uncertainty", "norm-bounded parameter uncertainty", "state matrices", "output matrices", "linear filter", "Riccati equations", "robust state estimation"], "prmu": ["P", "P", "R", "P", "R", "P", "R", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["middle school girls", "hardware and programming curriculum", "Techbridge", "technology skills teaching"], "prmu": ["P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["moulds", "reliable high-speed machining", "process planning", "NC programs", "high-speed milling", "forging dies", "injection moulds", "complex surface geometry", "error-free programs", "optimum cutting strategies", "productivity", "surface quality", "hardened steels", "tool breakage", "tool workpiece collisions", "ceramic bearings", "CAM methodology", "process engineering redefinition", "process simulation tools", "CAM programming re-engineering", "cutting strategies"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "M", "P", "P", "P"]}
{"id": "737", "title": "What's in a name? [mobile telephony branding]", "abstract": "Mobile operators are frantically consolidating businesses into single international brands", "keyphrases": ["mobile telephony", "branding", "consolidating businesses"], "prmu": ["P", "P", "P"]}
{"id": "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", "keyphrases": ["real-time procedural solid texturing", "meshed atlases", "texture atlas", "one-to-one mapping", "object surface", "texture space", "graphics hardware", "rasterization", "solid texture coordinates", "colors", "rendering", "multiresolution texture atlas", "linear magnification filtering", "MIP-mapped minification antialiasing"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1026", "title": "Use of SPOT images as a tool for coastal zone management and monitoring of environmental impacts in the coastal zone", "abstract": "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", "keyphrases": ["coastal zone management", "SPOT images", "environmental impact monitoring", "remote sensing", "multitemporal analysis", "land use", "Colombian Caribbean Coast", "anthropogenic activities", "mangrove deforestation", "shrimp farming", "endangered areas", "erosion problems", "water pollution", "satellite images", "human activities", "supervised classification", "sedimentation", "shrimp ponds", "vectorization", "vector overlay"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "U", "U", "P", "U", "U"]}
{"id": "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", "keyphrases": ["partially known quantum states", "quantum system", "secretly prepared quantum state", "classical signals", "Hilbert space", "degrees of freedom", "nonclassical part", "quantum cryptography", "bits", "qubits", "ebits", "quantum teleportation", "mixed-state ensembles"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["timed mu CRL", "completeness", "process algebra", "operational semantics"], "prmu": ["P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["partial converse", "Hadamard theorem", "homeomorphisms", "Banach space", "Lipschitz continuous inverse", "nonlinear system stability", "linear system stability", "linearization", "nonlinear feedback systems", "nonlinear networks"], "prmu": ["P", "R", "P", "P", "P", "R", "R", "P", "M", "M"]}
{"id": "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", "keyphrases": ["asynchronous cellular automata", "cellular automata", "fault tolerance", "discrete dynamical systems", "random noise", "synchronous automata"], "prmu": ["P", "P", "P", "U", "P", "P"]}
{"id": "901", "title": "Estimation of the Poisson stream intensity in a multilinear queue with an exponential job queue decay", "abstract": "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", "keyphrases": ["Poisson stream intensity", "multilinear queue", "exponential job queue decay", "busy queue periods start", "uniform resource allocation", "stream intensity", "individual servers"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["surface micromachined microvalve", "normally-open microvalves", "paraffin microactuator", "active element", "channel materials", "gas flow rates", "actuation powers", "leak rates", "blocking valve structures", "differential pressure", "flow rates", "600 micron", "30 micron", "50 to 150 mW", "800 torr"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "M", "P", "P"]}
{"id": "593", "title": "Fuzzy systems with overlapping Gaussian concepts: Approximation properties in Sobolev norms", "abstract": "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", "keyphrases": ["fuzzy systems", "overlapping Gaussian concepts", "radial basis functions", "learning", "fuzzy system models", "reproducing kernel Hilbert spaces"], "prmu": ["P", "P", "P", "U", "M", "U"]}
{"id": "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", "keyphrases": ["local manipulation", "Gaussian states", "state transformation", "bipartite continuous-variable system", "trace-preserving maps", "quantum information theory"], "prmu": ["P", "P", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["deterministic single-photon source", "distributed quantum networking", "single three-level atom", "high-finesse optical cavity", "adiabatically driven stimulated Raman transition", "vacuum field", "quantum communication", "all-optical quantum information processing"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["self-testing chips", "ATE", "automatic test equipment", "innovative circuits", "design-for-test techniques", "embedded deterministic testing technique"], "prmu": ["P", "P", "P", "P", "U", "M"]}
{"id": "979", "title": "Design, analysis and testing of some parallel two-step W-methods for stiff systems", "abstract": "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", "keyphrases": ["parallel two-step W-methods", "large stiff systems", "linearly-implicit integration methods", "stage order", "stability", "shared memory computer", "differential equations", "convergence analysis", "Krylov-techniques"], "prmu": ["P", "P", "P", "P", "P", "P", "U", "M", "P"]}
{"id": "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", "keyphrases": ["end system multicast", "Internet protocol", "protocol layer", "IP multicast", "network management", "network scalability", "higher layer functionality", "congestion control", "membership management", "packet replication", "network routers", "end-to-end delays", "Narada protocol", "overlay structure", "distributed protocol", "network dynamics", "application level performance", "simulation", "Internet experiments", "performance penalties", "self-organizing protocol"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["trifocal tensor estimation", "GMM", "Gaussian mixture model", "Gaussian distributions", "Bayesian rule", "inliers", "outliers", "motion analysis", "image data", "image analysis"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "U", "U", "U"]}
{"id": "68", "title": "Human factors research on data modeling: a review of prior research, an extended framework and future research directions", "abstract": "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", "keyphrases": ["human factors", "conceptual data modeling", "future efforts", "Analyst Developer models", "User-Analyst models", "database"], "prmu": ["P", "P", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["VPP Fortran", "data parallel language", "data parallelism", "high performance", "asynchronous interprocessor communication", "explicit shadow", "benchmark", "asynchronous communication", "data locality"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "R", "R"]}
{"id": "1207", "title": "Packet spacing: an enabling mechanism for delivering multimedia content in computational grids", "abstract": "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", "keyphrases": ["streaming multimedia", "UDP", "distributed systems", "Internet", "remote computational steering", "visualization data", "inter-packet spacing", "UDP-based streaming", "network protocol", "transport protocols"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "M", "U"]}
{"id": "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", "keyphrases": ["Securities Industry Association", "straight-through-processing", "T+1"], "prmu": ["P", "U", "P"]}
{"id": "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", "keyphrases": ["Internet Web site design", "system design techniques", "structured programming"], "prmu": ["R", "P", "P"]}
{"id": "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", "keyphrases": ["bistability", "harmonically forced relaxation oscillations", "external periodic force", "entrainment", "van der Pol equation", "harmonically driven Stoker-Haag piecewise discontinuous equation", "control parameter space", "nonlinear dynamics"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["three-source model", "head scatter factors", "intensity modulated radiation therapy", "segmented fields", "collimator jaw settings", "calculation algorithm", "symmetric", "fields", "asymmetric", "fields", "irregular open fields", "tertiary collimator", "multileaf collimator", "blocks", "source-to-chamber distance", "photon radiation", "target", "extra-focal photon sources", "scattered photons", "primary collimator", "flattening filter", "field mapping method", "extra-focal source planes", "source intensity distributions", "MS Windows environment", "input data", "symmetric square fields", "machine commissioning", "upper collimator jaws", "lower collimator jaws"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["Halden Reactor Project", "man-machine systems programme", "human factors", "computer-based support system", "safety", "reliability", "virtual reality", "control room design"], "prmu": ["R", "R", "P", "P", "P", "P", "P", "P"]}
{"id": "899", "title": "Mathematical model of functioning of an insurance company with allowance for advertising expenses", "abstract": "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", "keyphrases": ["insurance company functioning", "advertising expenses allowance", "capital", "mathematical model"], "prmu": ["R", "R", "P", "P"]}
{"id": "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", "keyphrases": ["risky corporate debt valuation", "stock holdings", "debt holdings", "securities", "option", "corporate business asset value", "payoff functions", "multiple cross-holdings", "Modigliani-Miller theorem", "cross-shareholdings", "bond holder", "credit risks", "correlation", "Monte Carlo simulation"], "prmu": ["M", "M", "M", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["intellectual property", "cultural issues", "economic issues", "political issues", "legal issues"], "prmu": ["P", "M", "M", "M", "M"]}
{"id": "1437", "title": "Improving the frequency stability of microwave oscillators by utilizing the dual-mode sapphire-loaded cavity resonator", "abstract": "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", "keyphrases": ["microwave oscillators", "temperature control circuit", "dual-mode sapphire-loaded cavity resonator", "frequency standard", "frequency stability", "temperature stabilisation", "whispering gallery resonator-oscillator", "finite-element analysis", "whispering gallery modes", "difference frequency", "high-quality factor", "9 GHz", "270 K"], "prmu": ["P", "P", "P", "M", "P", "M", "P", "M", "R", "P", "M", "P", "M"]}
{"id": "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", "keyphrases": ["robust H/sub infinity / control", "induction motors control", "robustness", "stability", "internal disturbances", "external disturbances", "field orientation", "input-output linearization"], "prmu": ["P", "P", "P", "P", "R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["d-MC problem", "multi-state systems", "multi-state components", "reliability computation", "d-Mincuts", "flow networks", "failure analysis algorithm", "time bounds", "max-flow/min-cut"], "prmu": ["P", "P", "P", "R", "P", "P", "M", "P", "P"]}
{"id": "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", "keyphrases": ["quality-of-service", "interactivity", "scheduling", "video-on-demand", "multicast", "conventional patching", "customer request rate", "hybrid broadcast scheme"], "prmu": ["U", "P", "U", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["web hosting service provider", "IT managers", "selection", "customer service"], "prmu": ["P", "U", "P", "M"]}
{"id": "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", "keyphrases": ["k-nearest-neighbor classification", "tree leaves", "hybrid composite classifier", "classification trees", "feature space division", "computational load", "data sets", "k-NN rule"], "prmu": ["P", "R", "R", "P", "M", "P", "P", "P"]}
{"id": "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", "keyphrases": ["intelligent information gathering method", "dynamic information mediators", "Internet", "information infrastructures", "WWW", "academic research", "business work", "electronic commerce", "artificial information integration problem", "real-world flight information service"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1223", "title": "Formalising optimal feature weight setting in case based diagnosis as linear programming problems", "abstract": "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", "keyphrases": ["optimal feature weight setting", "case based diagnosis", "linear programming", "case based reasoning", "distance functions", "polynomial time", "searching", "exponential weight space", "classification", "heuristics"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["schema evolution", "data warehouses", "system maintenance", "containment", "data sources", "source relations", "structural view maintenance", "view adaptation", "SQL query", "organizational decision-making", "data analysis"], "prmu": ["P", "P", "R", "U", "P", "P", "M", "R", "U", "P", "R"]}
{"id": "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", "keyphrases": ["computing profession", "women"], "prmu": ["P", "P"]}
{"id": "805", "title": "Active pitch control in larger scale fixed speed horizontal axis wind turbine systems. I. linear controller design", "abstract": "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", "keyphrases": ["fixed speed wind turbine system", "pitch angle control", "control theory", "nonlinear equations", "digital simulation", "linear quadratic optimal feedback controller", "closed circle system", "linear system control theory", "wind turbines", "horizontal axis wind turbine systems", "active pitch control", "linear controller design", "aerodynamics", "drive train dynamics"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "U", "M"]}
{"id": "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", "keyphrases": ["Web content extraction", "FlipDog", "job description", "job-hunting site", "company Web sites", "WhizBang! Extraction Framework"], "prmu": ["P", "P", "P", "M", "P", "P"]}
{"id": "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", "keyphrases": ["DIMSIMs", "stiff differential systems", "reliable estimation", "local discretization error", "interpolants", "nonlinear systems of equations", "simplified Newton iterations", "experimental Matlab code", "diagonally implicit multistage integration methods"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["voice recognition", "financial fraud", "biometric", "cost"], "prmu": ["P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["quadratic Newton iteration", "systems with multiplicity", "Newton's iterator", "polynomial equation system solvers", "Jacobian matrix", "quadratic convergence", "m-adic topology"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["disaster planning", "banks", "planning", "recovery", "public relations", "emergency management"], "prmu": ["P", "P", "P", "U", "U", "U"]}
{"id": "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", "keyphrases": ["world-making", "selective representing", "mental representations", "organisms", "realism", "mind-independent world", "cognitive profiles"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["initialized fractional-order systems", "dynamics", "control", "initialization response", "forced response", "impulse response", "exponential function", "vector space representation", "state space concept", "fractional-order differintegral", "transfer function"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["computer science education", "gender issues", "future", "women", "girls", "society", "democracy"], "prmu": ["R", "U", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["mathematical arguments", "biology", "scientific hypotheses", "linear model", "DNA", "genome", "hypothesis testing", "cortical maps", "neural nets"], "prmu": ["P", "P", "P", "P", "P", "P", "U", "U", "U"]}
{"id": "1346", "title": "Automatic multilevel thresholding for image segmentation by the growing time adaptive self-organizing map", "abstract": "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", "keyphrases": ["automatic multilevel thresholding", "image segmentation", "growing time adaptive self-organizing map", "Growing TASOM", "GTASOM", "peak finding process"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["feasibility testing", "dial-a-ride problems", "dispatching", "vehicle-operating agency", "routing", "scheduling", "service-related constraints", "maximum wait time constraints", "maximum ride time constraints"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "756", "title": "A new high resolution color flow system using an eigendecomposition-based adaptive filter for clutter rejection", "abstract": "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", "keyphrases": ["high resolution colour flow system", "eigendecomposition-based adaptive filter", "clutter rejection filter", "signal processing strategy", "high frequency color flow mapping", "HF colour flow mapping", "moving tissue environments", "high blood-to-clutter ratios", "blood velocity estimates correction", "estimated tissue motion profile", "swept-scan signal model", "in vivo color flow images", "blood flow mapping", "microcirculation", "echoes", "clutter suppression performance"], "prmu": ["M", "P", "P", "P", "P", "M", "P", "P", "R", "P", "P", "P", "R", "P", "U", "M"]}
{"id": "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", "keyphrases": ["women", "culture of computing", "sex difference", "children", "male adolescent culture", "educational software", "computer games", "teachers"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "71", "title": "A study of computer attitudes of non-computing students of technical colleges in Brunei Darussalam", "abstract": "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", "keyphrases": ["computer attitudes", "noncomputing students", "survey", "computer experience", "educational qualification", "gender", "age", "personal computer ownership", "computer training", "educational computing", "end user computing", "technical colleges"], "prmu": ["P", "M", "P", "P", "P", "P", "P", "R", "P", "R", "M", "P"]}
{"id": "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", "keyphrases": ["strain recovery", "one-way shape memory", "flexible polyurethanes", "alloy wires", "SMA wires", "actuation deformation", "two-way shape memory effect", "recoverable strains", "flexible polyurethane", "embedded sensor", "smart structures", "three-dimensional finite element analysis", "actuation strain", "deformations", "matrix material", "transverse strain fields"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["bisimulation minimization", "symbolic model checking", "state space minimization techniques", "state explosion", "explicit-state verification tools", "experimental results", "optimization", "invariance properties", "BDD", "binary decision diagram", "backwards reachability", "invariance verification"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "U", "U", "P", "P"]}
{"id": "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", "keyphrases": ["identification approach", "FIR models", "stochastic discrete systems", "general prediction error criterion", "time-domain estimate", "optimal frequency estimation", "frequency-domain estimate", "empirical frequency-domain optimal parameter estimate"], "prmu": ["P", "P", "P", "R", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["e-commerce", "bankers", "eScout"], "prmu": ["P", "P", "P"]}
{"id": "1382", "title": "Loop restructuring for data I/O minimization on limited on-chip memory embedded processors", "abstract": "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", "keyphrases": ["loop restructuring", "data I/O minimization", "on-chip memory", "data traffic", "embedded processors", "loop fusion", "data locality", "program dependence graph", "Petit", "fused loop nest", "closeness factor", "DSP"], "prmu": ["P", "P", "P", "P", "P", "R", "M", "P", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["women", "computing history"], "prmu": ["P", "P"]}
{"id": "801", "title": "International customers, suppliers, and document delivery in a fee-based information service", "abstract": "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", "keyphrases": ["Purdue University Libraries fee-based information service", "Technical Information Service", "international suppliers", "international customers", "document requests", "document delivery", "fragmentary citation verification", "document availability", "pricing information", "inclusive cost quotes", "customer deadline meeting", "international payments", "continuous staff improvement"], "prmu": ["R", "P", "P", "P", "P", "P", "M", "R", "P", "P", "R", "P", "R"]}
{"id": "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.\"", "keyphrases": ["virtual community", "craigslist", "Internet businesses", "Web content", "revenue generation", "community portals", "announcements", "local events", "want ads", "real estate", "San Francisco Bay community"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["differential algebraic systems", "low index linear systems", "numerical integration method", "inherent regular ODE", "commutativity", "stepsize restrictions", "abstract differential algebraic equations"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Web-based listings", "electronic journals", "URL", "library", "technical services", "public services partnerships", "Web pages", "case study", "online catalog", "Web sites", "feedback"], "prmu": ["P", "P", "P", "P", "U", "U", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["digital fountain", "asynchronous reliable multicast", "autonomous receivers", "broadcast protocols", "multicast protocol", "scalable protocol", "heterogeneous receivers", "optimal efficiency", "high loss rates", "erasure codes", "large block size", "performance measurements", "experimental system performance", "Internet", "FEC codes", "forward error correction", "RS codes", "Tornado codes", "Luby transform codes", "bulk data distribution", "IP multicast", "simulation results", "interoperability", "content distribution methods", "Reed-Solomon codes", "decoder"], "prmu": ["P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "R", "U", "M", "U", "M", "M", "M", "M", "M", "U", "U", "M", "M", "U"]}
{"id": "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", "keyphrases": ["PCI", "FPGA card", "SHOKE2000", "reconfigurable computing", "field programmable gate arrays", "FPGA", "I/O standard", "interfaces", "digital signal processors", "DSP", "analog devices", "hybrid reconfigurable systems", "image recognition application", "distributed shared memory computer cluster", "teaching materials", "computer education", "intellectual property", "user logic circuits"], "prmu": ["U", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "U", "P"]}
{"id": "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", "keyphrases": ["PalmSource", "operating system", "mobile devices", "Palm OS 5.0", "ARM architecture", "compatibility"], "prmu": ["P", "P", "P", "M", "P", "P"]}
{"id": "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", "keyphrases": ["PowerPC microprocessor", "model checking", "temporal logic", "circuit design error", "hardware testing", "correctness specification", "verification methodologies", "Computation Tree Logic", "circuit debugging"], "prmu": ["P", "P", "P", "M", "P", "P", "P", "M", "M"]}
{"id": "573", "title": "ECG-gated /sup 18/F-FDG positron emission tomography. Single test evaluation of segmental metabolism, function and contractile reserve in patients with coronary artery disease and regional dysfunction", "abstract": "/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", "keyphrases": ["Fourier-based ECG-gated metabolic /sup 18/F-fluorodeoxyglucose-positron emission tomography", "/sup 18/F-fluorodeoxyglucose uptake", "thirty six-segment model", "ventriculography", "dysfunctional segments", "normokinetic/hypokinetic/akinetic segments", "residual function", "dobutamine test", "inotropic reserve", "akinetic segments", "hypokinetic segments", "pixel-based Fourier smoothing", "regional function", "segmental status", "transfer artefacts", "viable myocardium", "regional dysfunction", "myocardial glucose metabolism", "myocardial viability", "functional", "transfer uncertainty", "Fourier-based ECG-gated PET technique", "high resolution scanner", "patients", "diseased left ventricles", "coronary artery disease", "left ventricular segment", "severe hypokinesis", "akinesis", "biplane cineventriculography"], "prmu": ["M", "R", "M", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1163", "title": "Evaluating the complexity of index sets for families of general recursive functions in the arithmetic hierarchy", "abstract": "The complexity of index sets of families of general recursive functions is evaluated in the Kleene-Mostowski arithmetic hierarchy", "keyphrases": ["index sets complexity", "general recursive functions", "arithmetic hierarchy", "Kleene-Mostowski arithmetic hierarchy"], "prmu": ["R", "P", "P", "P"]}
{"id": "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", "keyphrases": ["market game core axiomatization", "nonempty games", "individual rationality", "superadditive games", "weak reduced game property", "converse reduced game property", "weak symmetry", "transitive 4-person TU game", "redundant"], "prmu": ["R", "R", "P", "R", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["continuity", "dynamic representations", "integrative neuroscience", "neurons", "cognition", "uncertainty", "spike arrival times", "spike trains", "cognitive systems", "neural nets"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "M", "U"]}
{"id": "88", "title": "Planning linear construction projects: automated method for the generation of earthwork activities", "abstract": "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", "keyphrases": ["linear construction projects", "earthwork activities", "road construction projects", "planning rules", "earthworks planning process", "computer-based system", "knowledge base"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["attendant system", "Auto Attendant System", "fuzzy request", "clear request", "semantic frame", "dialog manager", "spoken dialog systems", "telephone", "speech recognizer", "telephone-based system"], "prmu": ["P", "P", "P", "M", "U", "P", "M", "U", "P", "M"]}
{"id": "921", "title": "Processing of complexly shaped multiply connected domains in finite element mesh generation", "abstract": "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", "keyphrases": ["finite element mesh generation", "complexly shaped multiply connected domains", "finite element models", "quadrilateral mesh", "domains transformation", "set of simple domains", "parasitic inductances", "parasitic capacitances", "printed circuit boards", "programming implementation", "arbitrary geometrical complexity", "metal forming processes", "structural engineering models", "iterative basis", "general domain subdivision algorithm", "artificial cut", "automatic step calculation"], "prmu": ["P", "P", "P", "R", "R", "P", "P", "R", "P", "P", "P", "M", "M", "U", "M", "U", "U"]}
{"id": "964", "title": "Modeling group foraging: individual suboptimality, interference, and a kind of matching", "abstract": "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", "keyphrases": ["group foraging", "individual suboptimality", "agent-based models", "group situation", "suboptimal behavior", "isolated individual", "behavioral ecology", "experimental psychology", "interference function", "focal forager", "matching law", "genetic algorithms", "multiple agents", "spatially explicit environments", "situated perception", "situated action"], "prmu": ["P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["asymptotical stability", "fixed point", "Lyapunov function method", "symmetric connections", "asymmetric connections", "unique attractor", "stability", "equilibrium stability", "connection weight matrix", "interval matrix", "generalized sufficient condition", "discrete-time neural networks"], "prmu": ["P", "P", "P", "R", "P", "P", "P", "R", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["survey", "BIALL/SPTL", "academic law library", "academic law librarians"], "prmu": ["P", "P", "P", "P"]}
{"id": "1342", "title": "Defending against flooding-based distributed denial-of-service attacks: a tutorial", "abstract": "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", "keyphrases": ["flooding-based distributed denial-of-service attacks", "tutorial", "Internet stability", "DDoS attack methods", "DDoS attack tools", "large-scale attacks", "Internet firewall", "attack packets interception", "reflector attacks", "distributed attack detection"], "prmu": ["P", "P", "R", "P", "R", "P", "M", "R", "M", "M"]}
{"id": "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", "keyphrases": ["network simplex algorithm", "degenerate pivots", "minimum cost flow problem", "degeneracy", "cycling", "stalling", "anti-stalling pivot rule", "negative cost augmenting cycle"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["DLP displays", "LCD displays", "plasma displays", "Leeza", "outboard video signal processors", "fixed-pixel displays", "heavily processed video"], "prmu": ["P", "R", "R", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["women", "history", "computer science", "ENIAC", "business", "gender issues"], "prmu": ["P", "P", "P", "P", "P", "U"]}
{"id": "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", "keyphrases": ["complex biological processes", "robust model-order reduction", "high dimensional nonlinear partial differential equation model", "nonlinear distributed parameter model", "pilot-scale BNR activated sludge plant", "state-space model", "singular perturbation approximation balanced truncating technique", "modelling errors", "controller design", "Hankel singular values", "biological nutrient removal activated sludge processes"], "prmu": ["P", "P", "R", "R", "R", "P", "P", "P", "P", "M", "R"]}
{"id": "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", "keyphrases": ["fractional motion control", "XY cutting table", "path tracking design", "actuators", "fractional differentiation", "minimum path completion time", "closed-loop system", "Davidson-Cole filter", "spline function", "optimization"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "884", "title": "A hybrid-neural network and population learning algorithm approach to solving reliability optimization problem", "abstract": "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", "keyphrases": ["hybrid approach", "dedicated artificial neural network", "population learning algorithm", "system reliability", "cost constraints", "technical feasibility constraints", "reliability optimization problem"], "prmu": ["P", "P", "P", "P", "R", "P", "P"]}
{"id": "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", "keyphrases": ["Ethernet", "factory floor", "cutting-edge manufacturers", "supervisory level"], "prmu": ["P", "P", "P", "U"]}
{"id": "905", "title": "Ultra-high speed positioning control of a gravure engraving unit using a discrete-time two-degree-of-freedom H/sub infinity / control", "abstract": "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", "keyphrases": ["ultra-high speed positioning control", "gravure engraving unit", "discrete-time two-degree-of-freedom H/sub infinity / control", "piezoelectric actuator", "control design method", "high-precision response", "feedforward", "nonlinear properties", "hysteresis", "feedback control", "digital control system"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["hardware reliability", "software reliability", "high availability systems", "redundant hardware components", "fault detection", "fault correction", "software design patterns", "checkpointing", "software redundancy", "fault tolerant systems"], "prmu": ["R", "R", "P", "P", "P", "R", "P", "U", "R", "P"]}
{"id": "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", "keyphrases": ["media response", "Cyber Patrol Internet filtering software", "Microsystems Software", "crisis management", "public relations"], "prmu": ["P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["dose optimization algorithms", "effect-volume histogram", "intensity-modulated radiotherapy", "dosimetric conflicts", "treatment goals", "treatment risks", "computer software", "decision-making process", "partial volumes", "high doses", "low doses", "volume element weights", "treatment planning", "objective function", "insufficient target coverage", "exponential law", "cell survival", "one-sided quadratic penalties", "quadratic overdose penalty"], "prmu": ["P", "P", "P", "P", "P", "R", "P", "P", "P", "R", "P", "R", "M", "R", "U", "U", "U", "U", "U"]}
{"id": "14", "title": "Application of hybrid models for prediction and optimization of enzyme fermentation process. A comparative study", "abstract": "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", "keyphrases": ["mathematical models", "bioprocess", "hybrid models", "product mass balance equation", "fuzzy-neural network", "cell age distribution", "biosynthesis rate", "enzyme fermentation", "industrial processes", "optimization", "identification"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P"]}
{"id": "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", "keyphrases": ["self-describing Turing machines", "self-describeness", "self-reproduction", "encodings"], "prmu": ["P", "P", "P", "P"]}
{"id": "696", "title": "Design and implementation of a new sliding-mode observer for speed-sensorless control of induction machine", "abstract": "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", "keyphrases": ["speed-sensorless control", "induction machine", "sliding-mode observer", "induction motor drive", "sensorless control", "flux", "speed", "rotor time constant", "flux equations", "current equations", "current model", "sliding function", "speed estimation accuracy", "fourth-order system reduction", "parameter uncertainties"], "prmu": ["P", "P", "P", "M", "M", "P", "P", "P", "P", "R", "P", "P", "P", "M", "P"]}
{"id": "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", "keyphrases": ["bad pixel identification", "principal components analysis", "temporal evolution", "statistical distance", "robustness", "identification algorithm", "eigenimages", "multinormal distribution", "CCD visible camera", "focal plane array", "IR camera"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P"]}
{"id": "1067", "title": "Quantum-information processing by nuclear magnetic resonance: Experimental implementation of half-adder and subtractor operations using an oriented spin-7/2 system", "abstract": "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", "keyphrases": ["quantum-information processing", "nuclear magnetic resonance", "half-adder operations", "subtractor operations", "oriented spin-7/2 system", "quantum systems", "computational tasks", "quantum algorithms", "state superposition", "entanglement", "qubits", "three-qubit system", "/sup 133/Cs nuclei", "liquid-crystalline medium", "quadrupolar split well-resolved septet", "quantum states", "computational task", "/sup 133/Cs"], "prmu": ["P", "P", "R", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["resolution based proof system", "temporal logic", "branching-time temporal logic", "CTL", "modal logic", "KD45", "belief", "dynamic logics", "multi-agent systems", "multi-modal logics", "rational agents"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["newspaper-system market", "Adobe InDesign", "pagination", "Macintosh", "publishing"], "prmu": ["P", "P", "P", "U", "U"]}
{"id": "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", "keyphrases": ["control chart pattern recognition", "fuzzy-soft learning vector quantization", "supervised competitive learning network approach", "unnatural patterns", "statistical process control", "SPC", "supervised LVQ", "fuzzy relaxation technique", "simultaneous neuron update", "correct recognition accuracy", "learning time", "numerical results", "manufacturing process"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "U", "M"]}
{"id": "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", "keyphrases": ["Surrey County Council", "Swan", "voice over IP", "WAN", "LAN"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "776", "title": "Information access for all: meeting the needs of deaf and hard of hearing people", "abstract": "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", "keyphrases": ["information access", "deaf clients", "hard of hearing clients", "deafness", "hearing impairments", "communication contexts", "sightreading", "TTY communications", "ASL interpreters"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Virtual Family", "gender-neutral game-based software", "Java programming teaching", "multimedia resources", "teaching workshops", "high-school teaching units", "Supporting Women in Information Technology"], "prmu": ["P", "P", "R", "P", "P", "P", "P"]}
{"id": "825", "title": "Genetic algorithm-neural network estimation of Cobb angle from torso asymmetry in scoliosis", "abstract": "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", "keyphrases": ["Cobb angle", "artificial neural network", "torso surface asymmetry", "genetic algorithm", "input torso indices", "scoliosis patients", "scoliosis progression"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["subject classification", "library information systems", "LIS", "information resources", "legal information"], "prmu": ["P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["cross selling", "financial institutions", "FleetBoston", "Fidelity", "Berkshire Group"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "557", "title": "Noise and the PSTH response to current transients: II. Integrate-and-fire model with slow recovery and application to motoneuron data", "abstract": "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", "keyphrases": ["PSTH", "integrate-and-fire model", "firing rates", "membrane trajectories", "spike-response model", "passive membrane time constant", "recovery time", "spike afterpotential", "motoneuron"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Runge-Kutta method convergence", "time discretizations", "linearization", "uniformly sectorial operator", "nonsmooth-data error estimates", "data error estimates", "backward Euler method", "nonlinear parabolic differential equations"], "prmu": ["R", "P", "P", "P", "P", "M", "P", "P"]}
{"id": "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", "keyphrases": ["emission tuned aperture computed tomography scintimammography", "angular disparity", "small tumors", "image quality", "computer simulation", "spherical tumor", "hemispherical breast", "gamma camera", "pinhole collimator", "pinhole-to-detector distances", "pinhole-to-tumor distances", "ray tracing technique", "tuned aperture computed tomography reconstruction method", "image sets", "axial spatial resolution", "in-plane spatial resolution", "clinical choice"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "R", "P", "P", "P", "P"]}
{"id": "1102", "title": "Design and implementation of a reusable and extensible HL7 encoding/decoding framework", "abstract": "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", "keyphrases": ["reusable framework", "extensible encoding/decoding framework", "Health Level Seven", "message object model", "message definition repository", "MDR", "MOM", "abstract message form", "logical relationships", "structural constraints", "international standard", "standalone software components", "heterogeneous hospital information systems", "HIS", "external database", "key definitions", "JAVA", "ActiveX", "JAVABEAN", "CORBA", "electronic data exchange", "health care environments", "clinical information", "administrative information", "HL7 message formats"], "prmu": ["R", "R", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "U", "U", "U", "P", "P", "R", "P", "P"]}
{"id": "938", "title": "Fast accurate MEG source localization using a multilayer perceptron trained with real brain noise", "abstract": "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", "keyphrases": ["MEG source localization", "fast accurate localization", "multilayer perceptron", "real brain noise", "real-time localizer", "analytical model", "quasistatic electromagnetic propagation", "spherical head", "white Gaussian noise", "correlated noise", "computation accuracy", "Levenberg-Marquardt method", "iterative gradient methods", "forward model"], "prmu": ["P", "R", "P", "P", "M", "P", "P", "P", "P", "P", "R", "R", "P", "M"]}
{"id": "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", "keyphrases": ["Cataloger's Desktop", "electronic cataloging tool", "online cataloging tools", "Internet", "cataloging tool aggregators", "online documentation", "large public libraries", "academic ARL", "staff training", "documentation", "managing technical issues", "cataloger's workstation"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P"]}
{"id": "613", "title": "Comparison between discrete STFT and wavelets for the analysis of power quality events", "abstract": "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", "keyphrases": ["discrete STFT", "wavelets", "power quality events", "signal processing tools", "signal processing techniques", "wavelet filters", "discrete short-time Fourier transforms", "adjustable speed drive", "six-pulse converter", "EMTP/ATP", "utility capacitors", "medium-sized industrial plant", "electrical disturbance", "short-time Fourier transforms"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["information science", "universities", "academia", "business", "information profession", "specialist skills", "academic courses", "information departments"], "prmu": ["M", "U", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["manufacturing industries", "information technology", "management of change", "customer relationship management", "services choices", "enterprise resource planning"], "prmu": ["M", "M", "U", "U", "P", "U"]}
{"id": "1058", "title": "Bigger is better: the influence of physical size on aesthetic preference judgments", "abstract": "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", "keyphrases": ["aesthetic preference judgments", "physical size influence", "decision making", "preference formation", "judgment cues", "abstract stimuli", "adult participants", "child participants", "preference pattern", "preference-evoking information", "attentional resources"], "prmu": ["P", "R", "M", "M", "M", "P", "R", "M", "P", "P", "P"]}
{"id": "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", "keyphrases": ["linguistic data", "fuzzy control charts", "probabilistic control charts", "control chart construction", "membership functions", "fuzziness degree", "average run length", "sensitivity", "fuzzy subsets", "porcelain products"], "prmu": ["P", "R", "P", "R", "P", "R", "P", "P", "M", "U"]}
{"id": "749", "title": "Numerical modeling of the flow in stenosed coronary artery. The relationship between main hemodynamic parameters", "abstract": "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", "keyphrases": ["numerical modeling", "hemodynamic parameters", "coronary arterial stenosis", "stenosis severity", "clinical setting", "computational model", "blood flow", "blunt stenosis", "autoregulated vascular bed", "simulation", "stenosed blood vessel", "arterial autoregulation", "constant flow regulation mechanism", "physiological range", "constant wall shear stress model", "minimally invasive methods"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "P"]}
{"id": "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", "keyphrases": ["generalized maximum balanced flow problem", "two-terminal network", "polynomial algorithms", "parameterized technique"], "prmu": ["P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["Leucadia National Corp", "Williams Communications", "bankruptcy"], "prmu": ["M", "P", "P"]}
{"id": "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", "keyphrases": ["law library users", "cataloguing", "Internet resources", "reference library", "location mark"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "654", "title": "A question of perspective: assigning Library of Congress subject headings to classical literature and ancient history", "abstract": "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", "keyphrases": ["Library of Congress subject heading assignment", "world view", "cultures", "civilizations", "classical literature", "ancient history", "Ancient Greece", "Ancient Rome"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "R"]}
{"id": "611", "title": "Intelligent optimal sieving method for FACTS device control in multi-machine systems", "abstract": "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", "keyphrases": ["FACTS", "intelligent control", "intelligent optimal sieving method", "FACTS device control", "multi-machine systems", "multi-target oriented optimal control strategy", "intelligent optimal sieve", "artificial neural network technologies", "fuzzy methods", "control signal", "selected optimal output", "inverse system method", "three-machine power system", "system oscillations attenuation", "power system transient stability enhancement"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "R"]}
{"id": "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", "keyphrases": ["business information professionals", "ethical dilemmas", "moral context", "applied ethics", "business information units"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["product lifecycle management", "manufacturing companies", "product data management", "product development", "enterprise resource planning"], "prmu": ["P", "P", "M", "M", "U"]}
{"id": "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", "keyphrases": ["transient gating charge movement", "transmembrane voltage", "gating current", "action potentials", "ion channels", "charge movement", "inactivation", "immobilization", "Markov state model"], "prmu": ["P", "P", "P", "U", "P", "P", "P", "U", "P"]}
{"id": "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", "keyphrases": ["mosaic patterns", "CNN", "spatially variant templates", "one-dimensional cellular neural network", "infinite lattices", "finite lattices", "boundary conditions", "spatial entropy", "transition matrix"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "R", "U"]}
{"id": "1145", "title": "Mammogram synthesis using a 3D simulation. II. Evaluation of synthetic mammogram texture", "abstract": "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", "keyphrases": ["mammogram synthesis", "3D simulation", "synthetic mammogram texture", "breast tissue simulation", "adipose tissue compartments", "3D tissue distribution", "mathematical morphology", "fractal dimension", "cumulative distributions", "synthetic images", "dense fibroglandular tissue regions", "retroareolar tissue regions", "X-ray image acquisition", "computationally compressed phantom"], "prmu": ["P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "R", "M", "M"]}
{"id": "1100", "title": "Evaluation of existing and new feature recognition algorithms. 2. Experimental results", "abstract": "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", "keyphrases": ["feature recognition algorithms", "general-purpose feature detection techniques", "National Design Repository", "face sets", "convex hull", "concavity"], "prmu": ["P", "P", "P", "P", "U", "U"]}
{"id": "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", "keyphrases": ["finance", "help desk", "Schwab", "Ameritrade", "RBC", "wireless"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "568", "title": "Modeling cutting temperatures for turning inserts with various tool geometries and materials", "abstract": "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", "keyphrases": ["cutting temperature model", "turning inserts", "machining", "tool nose radius", "parametric mesh generator", "finite element models", "temperature correction factor", "insert shape effects", "tool geometries"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["network-centric systems", "graduate level course"], "prmu": ["P", "M"]}
{"id": "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", "keyphrases": ["linear time special case", "MC games", "two-player games", "modal mu-calculus model checking", "linear time algorithm"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "694", "title": "A novel genetic algorithm for the design of a signed power-of-two coefficient quadrature mirror filter lattice filter bank", "abstract": "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", "keyphrases": ["genetic algorithm", "signed power-of-two coefficient lattice structure", "quadrature mirror filter", "QMF", "lattice filter bank", "encoding scheme", "natural selection", "offspring survival rate", "chromosome codon", "signal processing", "perfect reconstruction"], "prmu": ["P", "R", "P", "U", "P", "P", "P", "P", "R", "U", "U"]}
{"id": "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", "keyphrases": ["place/transition Petri net evolutions", "semantic domains", "monoids", "firing sequences", "dependence graphs", "post-set disjoint", "pre-set disjoint"], "prmu": ["P", "P", "P", "P", "P", "P", "R"]}
{"id": "1185", "title": "Trading exchanges: online marketplaces evolve", "abstract": "Looks at how trading exchanges are evolving rapidly to help manufacturers keep up with customer demand", "keyphrases": ["online marketplaces", "trading exchanges", "manufacturers", "customer demand", "enterprise platforms", "supply chain management", "enterprise resource planning", "core software platform", "private exchanges", "integration technology", "middleware", "XML standards", "content management capabilities"], "prmu": ["P", "P", "P", "P", "U", "U", "U", "U", "M", "U", "U", "U", "U"]}
{"id": "907", "title": "Development of an integrated and open-architecture precision motion control system", "abstract": "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", "keyphrases": ["motion control", "direct drive servo systems", "linear motors", "dSPACE DS1004 processor", "composite controller", "feedforward", "feedback", "adaptive notch filter", "open-architecture", "precision", "geometrical error compensation"], "prmu": ["P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["magneto-optical disk", "recording capacity", "GIGAMO media", "MO disks", "land-groove recording method", "magnetically induced super resolution", "MSR", "address format", "rewriting durability", "lifetime", "crosstalk", "3.5 inch", "2.3 GB", "SiN-GdFeCo-GdFe-TbFeCo-SiN-Al"], "prmu": ["P", "P", "P", "R", "M", "P", "P", "P", "R", "P", "U", "P", "P", "U"]}
{"id": "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", "keyphrases": ["enterprise programming mistakes", "common errors", "data store", "database", "XML", "Enterprise JavaBeans", "vendor-specific programming"], "prmu": ["P", "P", "U", "U", "U", "M", "M"]}
{"id": "942", "title": "Micro-optical realization of arrays of selectively addressable dipole traps: a scalable configuration for quantum computation with atomic qubits", "abstract": "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", "keyphrases": ["atomic qubits", "registers", "neutral atoms", "far-detuned dipole traps", "red-detuned laser beam", "microfabricated array", "microlenses", "internal states", "quantum gate operations", "quantum computation", "scalable configuration"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["machine tools", "sequential tolerance control", "adaptive sphere-fitting method", "design constraints", "compliance", "real-time measurement information", "yield improvement", "skewed distributions", "computational effort"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P", "P"]}
{"id": "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", "keyphrases": ["aggregate bandwidth estimation", "stored video distribution systems", "multimedia applications", "video on demand", "distance learning", "Internet video broadcast", "broadband networks", "video streams transmission", "quality of service", "statistical estimation", "variable bit rate traffic", "marginal distribution", "conditional probabilities", "temporary closed streams", "iterative algorithms", "upper bound", "lower bound", "loss probability", "simulations", "VoD", "video coding", "QoS"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "R", "P", "P", "P", "U", "M", "U"]}
{"id": "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", "keyphrases": ["Web site accessibility", "information and referral services", "disabilities"], "prmu": ["P", "M", "P"]}
{"id": "1449", "title": "Raising the standard of management education for electronic commerce professionals", "abstract": "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", "keyphrases": ["electronic commerce professionals", "universities", "information technology", "IT", "information systems", "business schools", "management education standards improvement", "organizational level", "formal education", "Kenneth Boulding"], "prmu": ["P", "P", "P", "P", "P", "P", "M", "P", "P", "P"]}
{"id": "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", "keyphrases": ["instability phenomena", "gas-metal arc welding", "self-regulation process", "arc instability", "weld quality", "GMAW process", "exact arc voltage characteristic", "metal transfer mode"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1020", "title": "Supersampling multiframe blind deconvolution resolution enhancement of adaptive optics compensated imagery of low earth orbit satellites", "abstract": "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", "keyphrases": ["supersampling multiframe blind deconvolution resolution enhancement", "adaptive optics compensated imagery", "low earth orbit satellites", "postprocessing methodology", "undersampled image sequence reconstruction", "randomly varying blur", "image enhancement", "sensor sampling resolution", "simulated imagery", "Starfire Optical Range telescope", "multiframe blind deconvolution", "ground-based telescope", "spatial sampling", "focal plane array elements", "forward stochastic model", "random shifts", "AO-compensated point spread function", "aliasing effects", "sub-Nyquist sampling", "resolution loss", "wide-field-of-view modes", "3.5 m"], "prmu": ["P", "P", "P", "P", "R", "P", "P", "R", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "U"]}
{"id": "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", "keyphrases": ["quantum universal variable-length source coding", "optimal quantum universal variable-length code", "admissible minimum rate", "probability distribution", "quantum states", "quantum information theory", "quantum cryptography", "optimal code", "exponent", "average error"], "prmu": ["P", "P", "P", "P", "P", "M", "M", "R", "P", "P"]}
{"id": "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", "keyphrases": ["Hutchison Telecommunications", "Singapore Technologies", "Global Crossing", "bankrupt"], "prmu": ["P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["performance test", "lightweight piezo-composite curved actuator", "LIPCA", "carbon fiber composite layer", "near-zero coefficient of thermal expansion", "PZT ceramic wafer", "glass/epoxy layer", "fiber reinforced plastic layers", "predicted curvatures", "performance tests", "boundary conditions", "THUNDER", "177 degrees C", "177 degC"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "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", "keyphrases": ["Chen attractors", "Chen system", "Lorenz system", "tuning", "Lorenz attractor", "transition chaotic attractor"], "prmu": ["P", "P", "R", "P", "P", "P"]}
{"id": "125", "title": "A fast implementation of correlation of long data sequences for coherent receivers", "abstract": "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", "keyphrases": ["correlation", "long data sequences", "coherent receivers", "transmitted signal", "received signal", "fast Fourier transform", "time delay information", "latency", "mission critical real time applications", "parallel algorithm", "multiprocessor environment", "computation"], "prmu": ["P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["frequently accessed wireless data modeling", "weak consistency", "response time reduction", "wireless data access", "mobile network", "caches", "wireless handheld devices", "data entry", "time-to-live interval", "expiration time prediction", "analytic model", "simulation experiments", "wireless communication cost", "stale access probability"], "prmu": ["R", "P", "M", "P", "P", "P", "P", "P", "R", "R", "P", "P", "P", "R"]}
{"id": "608", "title": "How closely can a personal computer clock track the UTC timescale via the Internet?", "abstract": "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", "keyphrases": ["personal computer clock", "UTC timescale", "internet", "software packages", "time servers", "didactic laboratory", "statistical sense", "global positioning system satellite constellation", "final timing difference", "synch error", "black boxes"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "1218", "title": "Knowledge acquisition for expert systems in accounting and financial problem domains", "abstract": "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", "keyphrases": ["knowledge acquisition", "expert systems", "accounting", "finance", "rule extraction process", "artificial intelligence", "problem domain taxonomy"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "1119", "title": "A component-based software configuration management model and its supporting system", "abstract": "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", "keyphrases": ["component-based software configuration management model", "software development", "integral logical constituents", "software reuse", "version control"], "prmu": ["P", "P", "P", "M", "U"]}
{"id": "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", "keyphrases": ["individual rationality", "human behavior", "game theory", "multiple-agent", "artificial social systems", "cooperation", "conditional preference relationships", "artificial societies", "self interest", "decision theory", "group rationality"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "R", "R"]}
{"id": "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", "keyphrases": ["fractional differentiation", "passive vibration control", "vibration isolation", "suspension", "robust controller", "viscoelastic behaviour", "sprung mass", "engine suspension"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "886", "title": "A fractional-flow model of serial manufacturing systems with rework and its reachability and controllability properties", "abstract": "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", "keyphrases": ["serial manufacturing systems", "rework", "reachability", "controllability", "dynamic fractional-flow model", "positive linear systems", "performance optimisation", "feedback control"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "P"]}
{"id": "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", "keyphrases": ["enterprise-wide content syndication technology", "business model", "enterprise clients", "aggregator", "business Web sites", "customer base", "infrastructure companies"], "prmu": ["P", "U", "P", "U", "U", "U", "P"]}
{"id": "1305", "title": "Learning nonregular languages: a comparison of simple recurrent networks and LSTM", "abstract": "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", "keyphrases": ["nonregular language learning", "recurrent neural networks", "LSTM", "context-sensitive languages", "context-free languages", "performance", "short-term memory recurrent nets"], "prmu": ["R", "M", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["orthogonal decompositions", "complete digraphs", "isomorphic copies", "vertex-disjoint union", "necessary conditions"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["quadratic 0-1 knapsack problem", "series-parallel support", "underlying graph structure", "dynamic programming algorithm", "pseudo-polynomial time complexity", "fully polynomial time approximation scheme", "NP-complete problem"], "prmu": ["P", "P", "P", "P", "P", "P", "R"]}
{"id": "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", "keyphrases": ["fully automated cerebrum segmentation algorithm", "full 3D sagittal brain MR images", "midsagittal brain MR image", "landmarks", "anatomical information", "connectivity-based threshold segmentation algorithm", "laterally adjacent slices", "masking operation", "brain region truncation", "boundary end points", "masked image boundaries", "connectivity-based algorithm"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "P", "R", "R", "P", "P"]}
{"id": "846", "title": "Female computer science doctorates: what does the survey of earned doctorates reveal?", "abstract": "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?", "keyphrases": ["female computer science doctorates", "Survey of Earned Doctorates", "information science"], "prmu": ["P", "P", "P"]}
{"id": "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", "keyphrases": ["grid voltage stability control", "wind turbine voltage stability control", "wind turbine modelling", "power system stability", "power grid", "grid-connected wind turbines", "blade angle control", "wind turbine power reduction", "short circuit fault", "offshore wind turbines"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "R", "P", "M"]}
{"id": "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", "keyphrases": ["digital content", "econtent contract", "econtent negotiation", "sales tactics", "econtent buyers", "news databases", "Web site"], "prmu": ["P", "P", "R", "P", "R", "U", "U"]}
{"id": "1081", "title": "Stability of W-methods with applications to operator splitting and to geometric theory", "abstract": "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", "keyphrases": ["W-methods stability", "operator splitting", "geometric theory", "parabolic initial value problem", "abstract Banach space", "analytic semigroup", "nonsmooth initial data", "linearly implicit Runge-Kutta methods"], "prmu": ["R", "P", "P", "P", "P", "P", "P", "M"]}
{"id": "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?", "keyphrases": ["PDAs", "operating system", "corporate infrastructure", "developer support", "buyer's guide"], "prmu": ["P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["chromatic spectrum", "mixed hypergraphs", "vertex set", "strict k-coloring", "positive integers", "mixed hypergraph"], "prmu": ["P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["telecom carriers", "purchasing process", "sales cycle", "request for information", "request for proposal"], "prmu": ["P", "P", "U", "U", "U"]}
{"id": "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", "keyphrases": ["data assimilation", "local model error forecasts", "deterministic model", "Kalman filter", "forcing conditions", "forecast horizon", "error prediction", "hydrodynamic modelling"], "prmu": ["P", "P", "P", "P", "P", "P", "R", "M"]}
{"id": "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", "keyphrases": ["feature-preserving volumetric technique", "merge surface triangulations", "surface merging procedures", "iso-surfaces extraction", "multi-component objects", "simple geometrical entities", "complex engineering applications", "overlapping components", "images", "mesh generation", "unstructured grids", "discrete data", "surface intersection", "geometric modelling", "adaptive background grid", "sharp edges", "sharp comers", "Delaunay triangulation method", "local voxelizations", "point enrichment technique background grid", "ridges", "Boolean operations", "surface triangulations", "arterial surfaces", "haemoglobin molecule"], "prmu": ["P", "P", "P", "P", "P", "P", "P", "P", "P", "M", "M", "R", "M", "R", "P", "P", "R", "P", "P", "R", "P", "P", "P", "M", "U"]}
{"id": "1039", "title": "Design of an adaptive vibration absorber to reduce electrical transformer structural vibration", "abstract": "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", "keyphrases": ["adaptive vibration absorber", "electrical transformer", "structural vibration", "bandwidth control"], "prmu": ["P", "P", "P", "P"]}
{"id": "571", "title": "Control of transient thermal response during sequential open-die forging: a trajectory optimization approach", "abstract": "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", "keyphrases": ["transient thermal response control", "trajectory optimization", "open-die forging", "titanium alloy billet", "temperature distribution", "microstructural defects", "heating profile"], "prmu": ["R", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["model theory", "model-theoretic properties", "countable signatures", "iterated families", "definable union", "finitely many complete subsets", "countable hereditarily finite superstructure"], "prmu": ["P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["data extraction", "wrapper generation", "data integration", "Internet", "information source", "schema", "HTML", "distributed database", "queries"], "prmu": ["P", "R", "M", "P", "P", "P", "P", "U", "U"]}
{"id": "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", "keyphrases": ["sensorless control", "induction motor drives", "reliability", "stator voltages", "stator currents", "vector-controlled drives", "magnitude", "spatial orientation", "fundamental magnetic flux waves", "open-loop estimators", "closed-loop observers", "robustness", "sensitivity", "model parameter variations", "steady-state speed accuracy", "parasitic effects", "signal flow graphs", "space vector quantities"], "prmu": ["P", "P", "P", "P", "R", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P", "P"]}
{"id": "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", "keyphrases": ["abrupt change detection", "abrupt change estimation", "process variability", "sequence", "chi-square random variables", "generalized likelihood ratio test statistic", "distribution", "even degrees of freedom", "upper bounds", "lower bounds", "odd degrees of freedom", "noninteger degrees of freedom", "liberal bounds", "conservative bounds", "simulation", "individual observations", "non null case", "confidence intervals", "quality control", "deep level gold mine", "ambulatory monitoring", "medical data", "econometrics"], "prmu": ["R", "R", "R", "P", "P", "P", "P", "P", "R", "P", "R", "M", "R", "P", "P", "P", "M", "P", "P", "P", "P", "P", "P"]}
{"id": "1260", "title": "A dataflow computer which accelerates execution of sequential programs by precedent firing instructions", "abstract": "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", "keyphrases": ["dataflow computer", "execution acceleration", "sequential programs", "precedent firing instructions", "precedent firing control", "execution time", "waiting operands", "hardware scale", "parallel processing", "computer architecture", "processing performance", "switching process"], "prmu": ["P", "R", "P", "P", "P", "P", "P", "P", "M", "M", "P", "P"]}
{"id": "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", "keyphrases": ["BTexact", "voice over DSL", "virtual private networks", "public access WLANs"], "prmu": ["P", "P", "P", "P"]}