name stringlengths 7 10 | title stringlengths 13 125 | abstract stringlengths 67 3.02k | fulltext stringclasses 1
value | keywords stringlengths 17 734 |
|---|---|---|---|---|
train_1273 | Towards an ontology of approximate reason | 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... | reflective judgment;ontology;granules;parameterized approximation spaces;approximate reason;decision rules;pattern recognition;rough sets;information granules | |
train_1274 | Bounded model checking for the universal fragment of CTL | 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 h... | reactive systems;verification method;universal fragment;linear time temporal logic;bounded semantics;sat methods;bounded model checking;model checking;elementary net systems;propositional formula | |
train_1275 | Modeling dynamic objects in distributed systems with nested Petri nets | 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, suc... | nested petri nets;object-oriented petri net;recursive-parallel systems;multi-agent systems;decidability;process algebras;distributed systems;dynamic objects modelling | |
train_1276 | A comparative study of some generalized rough approximations | 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 elem... | generalized rough approximations;binary reflexive relation;classical indiscernibility relation;generalized rough approximation mappings;elementary granules | |
train_1277 | Dynamic modification of object Petri nets. An application to modelling | protocols with fork-join structures In this paper we discuss possibilities of modelling protocols by objects in object-based high-level Petri nets. Some advantages of dynamically modifying the structure of token objects are discussed and the need for further investigations into mathematically rigorous foundations of ob... | object petri nets;fork-join structures;dynamic modification;object net formalisms;token objects;mathematically rigorous foundations;protocols | |
train_1278 | Verification of timed automata based on similarity | 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 ... | timed automata verification;branching time temporal logics;universal fragments;partitioning technique;bisimilarity;observational simulation relations;abstract state spaces | |
train_1279 | Place/Transition Petri net evolutions: recording ways, analysis and synthesis | 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, N... | monoids;post-set disjoint;firing sequences;semantic domains;dependence graphs;pre-set disjoint;place/transition petri net evolutions | |
train_128 | A new result on the global convergence of Hopfield neural networks | 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 | sufficient conditions;hopfield neural networks;global stability;globally exponentially stable networks | |
train_1280 | Products and polymorphic subtypes | 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 sy... | gentzen style calculi;finite binary tree;decidability;polymorphic subtypes;metamathernatical properties;hilbert style axiomatization;pushdown store;products subtypes;logical semantics | |
train_1281 | A notion of non-interference for timed automata | 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... | concurrent systems;timed automata;real-time systems;time-critical system;security property;noninterference notion | |
train_1282 | Completeness of timed mu CRL | 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 expres... | timed mu crl;operational semantics;completeness;process algebra | |
train_1283 | UPSILON: universal programming system with incomplete lazy object notation | 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 synchronizatio... | universal programming system;incomplete lazy object notation;programming system;usable type theory;upsilon;data synchronization primitive;object-oriented flavor | |
train_1284 | A linear time special case for MC games | 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... | two-player games;linear time special case;linear time algorithm;mc games;modal mu-calculus model checking | |
train_1285 | On fractal dimension in information systems. Toward exact sets in infinite | information systems The notions of an exact as well as a rough set are well-grounded as basic notions in rough set theory. They are however defined in the setting of a finite information system i.e. an information system having finite numbers of objects as well as attributes. In theoretical studies e.g. of topological ... | data mining;qualitative measures;rough set;closure operators;equivalence classes;complexity;knowledge discovery;topological properties;infinite information systems;information systems;exact sets;fractal dimension | |
train_1286 | Self-describing Turing machines | 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 i... | self-describing turing machines;self-reproduction;encodings;self-describeness | |
train_1287 | On average depth of decision trees implementing Boolean functions | 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 compa... | decision trees;worst case time complexity;average depth;boolean functions;average time complexity | |
train_1288 | A modal logic for indiscernibility and complementarity in information systems | 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 condit... | modal logic;indiscernibility;duality result;complementarity;first-order characterization;first-order conditions;relational type;information systems | |
train_1289 | Combining PC control and HMI | 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 strategie... | pc-based control system;application programming interfaces;pc interfaces;shop floor system;programmable logic controller;human machine interface | |
train_129 | Phase conditions for Schur polynomials | 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 Tch... | phase monotonicity;discrete-time control systems;tchebyshev representation;stabilization;phase conditions;robust stability;rate of change of phase;schur polynomial;real coefficients | |
train_1290 | Making the MIS integration process work | 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... | legacy software;scalable information systems;network infrastructure;human resources;client server hardware;information flow;lean manufacturing process;management information systems | |
train_1291 | Taking back control [SCADA system] | 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-hou... | compatibility;data acquisition;scada;in-house integration;programmable logic controllers;supervisory control | |
train_1292 | The heat is on [building automation systems] | 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 protoc... | internet;interoperability;hvac;remote monitoring;real-time data;building automation systems;heating;ventilation;air conditioning | |
train_1293 | Truss topology optimization by a modified genetic algorithm | 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 resulti... | load-bearing truss structures;stochastic search procedure;near-optimal topologies;modified genetic algorithm;triangles;truss topology optimization | |
train_1294 | Multicriterion optimization of composite laminates for maximum failure margins | with an interactive descent algorithm An interactive multicriterion optimization method for composite laminates subjected to multiple loading conditions is introduced. Laminate margins to initial failure (first ply failure, FPF) with respect of the applied loading conditions are treated as criteria. The original proble... | interactive descent algorithm;first ply failure;composite laminates;interactive multicriterion optimization;multiple loading conditions;convergence;pareto optimum;maximum failure margins;discrete procedure;bicriterion problem | |
train_1295 | Development of visual design steering as an aid in large-scale | multidisciplinary design optimization. II. Method validation For pt. I see ibid., pp. 412-24. Graph morphing, the first concept developed under the newly proposed paradigm of visual design steering (VDS), is applied to optimal design problems. Graph morphing, described in Part I of this paper, can be used to provide in... | function smoothness;visual design steering;reliability;design variable impact;optimal design problems;large-scale multidisciplinary design optimization;accuracy;graph morphing;constraint redundancy;constraint allowable limits;method validation;cycle time | |
train_1296 | Development of visual design steering as an aid in large-scale | multidisciplinary design optimization. I. Method development A modified paradigm of computational steering (CS), termed visual design steering (VDS), is developed in this paper. The VDS paradigm is applied to optimal design problems to provide a means for capturing and enabling designer insights. VDS allows a designer ... | graph morphing visualization method;visual design steering;n-dimensional optimization;visual representations;design variable changes;3d visualizations;complexity;complex systems;constraint redundancies;optimal design problems;2d visualizations;objective function contour smoothness;large-scale multidisciplinary design o... | |
train_1297 | Stochastic optimization of acoustic response - a numerical and experimental | comparison The objective of the work presented is to compare results from numerical optimization with experimental data and to highlight and discuss the differences between two fundamentally different optimization methods. The problem domain is minimization of acoustic emission and the structure used in the work is a c... | simulated annealing;forced vibration;gradient-based method;acoustic response;numerical optimization;acoustic emission minimization;closed cylinder;structure;stochastic optimization | |
train_1298 | An analytical model for a composite adaptive rectangular structure using the | Heaviside function The objective of this article is to describe a mathematical model, based on the Heaviside function and on the delta -Dirac distribution, for a composite adaptive rectangular structure with embedded and/or bonded piezoelectric actuators and sensors. In the adopted structure model, the laminae are made... | hamilton principle;virtual kinetic energy;delta-dirac distribution;electromechanical coupling;embedded actuators;heaviside function;mindlin displacement field;linear piezoelectricity;constitutive relations;closed-form solution;piezoelectric sensors;lagrangian functions;equations of motion;rectangular composite plate;pi... | |
train_1299 | How much should publishers spend on technology? | 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... | content management;customer relationship management;budget;publishing;computer support;web delivery;it spending | |
train_13 | Stability analysis of the characteristic polynomials whose coefficients are | polynomials of interval parameters using monotonicity We analyze the stability of the characteristic polynomials whose coefficients are polynomials of interval parameters via monotonicity methods. Our stability conditions are based on Frazer-Duncan's theorem and all conditions can be checked using only endpoint values ... | necessary and sufficient conditions;interval division method;monotonicity;interval parameters;transformation algorithm;characteristic polynomials;frazer-duncan theorem;stability analysis;endpoint values | |
train_130 | Resolution of a current-mode algorithmic analog-to-digital converter | 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 ... | 0.35 micron;cmos technology;a/d converters;resolution;algorithmic adc;error analysis;analog-to-digital converters;circuit analysis;4 bit;current-mode adc;statistical analysis;circuit techniques;tolerance analysis | |
train_1300 | Will CPXe save the photofinishing market? | 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 | photofinishing market;kodak;web-services standards;fujifilm;common picture exchange environment;cpxe;hp | |
train_1301 | Integrate-and-fire neurons driven by correlated stochastic input | 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 integr... | correlated binary variable;integrate-and-fire neurons;computer simulation;synaptic input correlations;coefficient of variation;spike-train variability;output spike trains;temporal correlations;firing times;correlated stochastic input | |
train_1302 | Dynamics of the firing probability of noisy integrate-and-fire neurons | 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) ... | colored noise;white noise;membrane time constant;noise filtering;numerical simulation;synaptic activity;firing probability;fokker-planck equation;synaptic time constant;phase lag;cortical neurons;noisy integrate-and-fire neurons;synaptic receptors | |
train_1303 | Reply to Carreira-Perpinan and Goodhill [mathematics in biology] | 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, s... | cortical maps;mathematical arguments;biology;dna;scientific hypotheses;genome;hypothesis testing;neural nets;linear model | |
train_1304 | Center-crossing recurrent neural networks for the evolution of rhythmic | behavior A center-crossing recurrent neural network is one in which the null(hyper)surfaces of each neuron intersect at their exact centers of symmetry, ensuring that each neuron's activation function is centered over the range of net inputs that it receives. We demonstrate that relative to a random initial population,... | random initial population;random networks;center-crossing recurrent neural networks;evolutionary algorithm;activation function;high-fitness oscillatory circuits;learning;null surfaces;low mutation variance;rhythmic behavior evolution;evolutionary search;symmetry | |
train_1305 | Learning nonregular languages: a comparison of simple recurrent networks and | LSTM Rodriguez (2001) examined the learning ability of simple recurrent nets (SRNs) (Elman, 1990) on simple context-sensitive and context-free languages. In response to Rodriguez's (2001) article, we compare the performance of simple recurrent nets and long short-term memory recurrent nets on context-free and context-s... | context-free languages;performance;nonregular language learning;lstm;short-term memory recurrent nets;recurrent neural networks;context-sensitive languages | |
train_1306 | Scalable hybrid computation with spikes | 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 modera... | frequent discrete signal restoration;spike-time codes;learning;distributed analog computation;digital carry interactions;feedback interactions;silicon circuits;spikes;finite-state-machine;hybrid analog-digital scheme;error-correcting analog-to-digital conversion;pattern recognition;scalable hybrid computation;analog no... | |
train_1307 | Law librarians' survey: are academic law librarians in decline? | 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 import... | academic law librarians;biall/sptl;academic law library;survey | |
train_1308 | SPTL/BIALL academic law library survey 2000/2001 | 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 | funding;information services;uk;ireland;survey;sptl/biall;postal questionnaire;cardiff university;academic law libraries | |
train_1309 | Transcripts: bane or boon? [law reporting] | 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 ... | judge-made law;law reporting;transcripts;judgments | |
train_131 | On biorthogonal nonuniform filter banks and tree structures | 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 ca... | dyadic filter banks;rational transfer functions;stability preserving;fir preserving;tree structured filter bank;biorthogonal pairs;dyadic trees;biorthogonal nonuniform filter banks | |
train_1310 | Cat and class: what use are these skills to the new legal information | professional? This article looks at the cataloguing and classification skills taught on information studies courses and the use these skills are to new legal information professionals. The article is based on the opinions of nine new legal information professionals from both academic and law firm libraries | information studies courses;classification;legal information professional;law firm libraries;academic libraries;cataloguing | |
train_1311 | Blended implementation of block implicit methods for ODEs | 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 Scie... | blended implementation;odes;numerical tests;parallel computers;numerical method;nonlinear splittings;diagonal splitting;block implicit methods | |
train_1312 | Stability in the numerical solution of the heat equation with nonlocal boundary | conditions This paper deals with numerical methods for the solution of the heat equation with integral boundary conditions. Finite differences are used for the discretization in space. The matrices specifying the resulting semidiscrete problem are proved to satisfy a sectorial resolvent condition, uniformly with respec... | integral boundary conditions;fully discrete numerical process;maximum norm;matrices;numerical solution;one-step methods;sectorial resolvent condition;finite differences;semidiscrete problem;space discretization;stability;heat equation;nonlocal boundary conditions | |
train_1313 | A collocation formulation of multistep methods for variable step-size | extensions Multistep methods are classically constructed by specially designed difference operators on an equidistant time grid. To make them practically useful, they have to be implemented by varying the step-size according to some error-control algorithm. It is well known how to extend Adams and BDF formulas to a var... | variable step-size polynomial collocation formulation;equidistant time grid;multistep methods;collocation formulation;k-step method;error-control algorithm;variable step-size extensions;piecewise polynomials;difference operators | |
train_1314 | Multi-timescale Internet traffic engineering | 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 ma... | packet-based hop-by-hop routed networks;multi-timescale internet traffic engineering;internet management;operator services;control timescale;bgp routing protocol;tcp congestion control;ecn proxy;admission control;resource allocation;packet marking disciplines | |
train_1315 | Traffic engineering with traditional IP routing protocols | 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 Sh... | intradomain traffic engineering;traffic routing;shortest path routing protocols;network conditions;ip routing protocols;network topology;tcp;open shortest path first protocol;interior gateway protocols;ip networks;network resources;intermediate system-intermediate system protocol;transmission control protocol;user perf... | |
train_1316 | Understanding Internet traffic streams: dragonflies and tortoises | 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 per... | internet stream size measurement;internet stream lifetime measurement;packet volume;tortoises;network traffic streams;isp;elephants;traffic engineering;long-running streams;mice;traffic provisioning;internet routers;dragonflies;traffic distributions;forwarding cache mechanisms;internet traffic streams;byte volume | |
train_1317 | Dynamic spectrum management for next-generation DSL systems | 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 ... | static spectrum management;coordinated transmission/reception;adsl systems;vectored-dmt;dsl systems performance;crosstalk-free communication;universal internet access;data transmission;twisted pairs;iterative water-filling;phone cable;dsl system design;electromagnetic coupling;transceivers;dynamic spectrum management;a... | |
train_1318 | Network intrusion and fault detection: a statistical anomaly approach | 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... | background traffic intensity;fault detection;computer network attacks;early warning systems;traffic anomaly intensity;adaptive/automatic network/service intrusion;wireless ad hoc networks;multiwindow anomaly detection;neural network classification;internet;multivariate classifiers;e-commerce infrastructure;network intr... | |
train_1319 | Routing security in wireless ad hoc networks | 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 du... | on-demand distance vector routing protocol;distributed cooperation;mobile ad hoc network;dynamic topology;wireless ad hoc networks;home wireless personal area networks;wireless mobile nodes;routing security;open medium;wireless manet;satellite transmission | |
train_132 | A unified view for vector rotational CORDIC algorithms and architectures based | on angle quantization approach Vector rotation is the key operation employed extensively in many digital signal processing applications. In this paper, we introduce a new design concept called Angle Quantization (AQ). It can be used as a design index for vector rotational operation, where the rotational angle is known ... | scaling operations;high-speed rotational vlsi circuits;dsp applications;fixed-point implementations;vector rotational cordic algorithms;low-latency rotational architectures;angle quantization;trellis-based searching algorithm;low-latency rotational algorithms;vector rotational operation;searching algorithms;greedy sear... | |
train_1320 | Securing the Internet routing infrastructure | 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 ... | networking infrastructure;countermeasures;routing infrastructure;secure routing schemes;network performance;networked systems;routing protocols;preventive security mechanisms;networking technology;integrated communication infrastructure;link state protocols;internet routing infrastructure security;research;false routin... | |
train_1323 | Editorial system vendors focus on Adobe and the future | 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 | newspaper-system market;publishing;macintosh;adobe indesign;pagination | |
train_1324 | A look at MonacoProfiler 4 | 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 | color-correction;commercial printers;monacoprofiler 4;pantone hexachrome | |
train_1325 | X-Rite: more than a graphic arts company | 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 | colour measurement;graphic arts;x-rite | |
train_1326 | Verona Lastre: consolidation provides opening for a new plate vendor | 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 manufactur... | verona lastre;ctp plates;vela | |
train_1328 | Tablet PCs on the way [publishing markets] | Previews of hardware and software look promising for publishing markets | publishing markets;tablet pc | |
train_1329 | PageFlex + MediaRich = PageRich | 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 | mediarich;layout;pagerich;pageflex;graphics;composition;software houses | |
train_133 | L/sub p/ stability and linearization | 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 assu... | banach space;nonlinear system;feedback systems;lipschitz continuous inverse;l/sub p/ stability;linear systems;hadamard's condition | |
train_1330 | Strobbe Graphics' next frontier: CTP for commercial printers | 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 | strobbe graphics;polaris;commercial printing;punch international;platesetters;workflow;agfa | |
train_1331 | Enterprise content integration III: Agari Mediaware's Media Star | 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 ... | agari mediaware media star;enterprise content integration;middleware | |
train_1332 | Personal cards for on-line purchases | 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 ... | personalized printing;cardinthebox.com;personal cards;online purchases;4yoursoul.com | |
train_1333 | The crossing number of P(N, 3) | 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 | crossing number;generalized petersen graph | |
train_1334 | A shy invariant of graphs | 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) ca... | minimum clique-cover;graph invariant;minimum clique-partition;cardinality;induced odd cycles;maximum stable set | |
train_1335 | Arranging solid balls to represent a graph | 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 vertice... | adjacent vertices;graph representation;finite graph;finite sequence;solid balls | |
train_1336 | On abelian branched coverings of the sphere | 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 (... | explicit formula;enumeration formula;abelian branched coverings;pseudofree spherical;weak equivalence classes;finite abelian groups | |
train_1337 | Some properties of Hadamard matrices coming from dihedral groups | 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 | dihedral groups;hadamard matrices | |
train_1338 | The chromatic spectrum of mixed hypergraphs | 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... | positive integers;mixed hypergraph;vertex set;mixed hypergraphs;chromatic spectrum;strict k-coloring | |
train_1339 | Edge-colorings with no large polychromatic stars | 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 dispro... | positive integer;positive integers;edge colorings;polychromatic stars | |
train_134 | A model of periodic oscillation for genetic regulatory systems | 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 mul... | bifurcation;nonlinearly positive feedback loops;time delay;circadian rhythm;genetic regulation;modeling;autoregulatory feedback loop;genetic regulatory system;two-gene system;jumping dynamics;singular perturbation theory;stability region;biochemical reactions;nonlinear model;relaxation oscillator;hysteretic properties;... | |
train_1340 | Orthogonal decompositions of complete digraphs | 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... | vertex-disjoint union;isomorphic copies;orthogonal decompositions;necessary conditions;complete digraphs | |
train_1341 | STEM: Secure Telephony Enabled Middlebox | 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... | stem;ip telephony;response mechanisms;network-based vulnerabilities;network address translation devices;static devices;network design;network infrastructure;detection mechanisms;firewalls;dynamic applications;sip protocol;stem architecture;secure telephony enabled middlebox;application layer | |
train_1342 | Defending against flooding-based distributed denial-of-service attacks: a | tutorial Flooding-based distributed denial-of-service (DDoS) attack presents a very serious threat to the stability of the Internet. In a typical DDoS attack, a large number of compromised hosts are amassed to send useless packets to jam a victim, or its Internet connection, or both. In the last two years, it was disco... | internet stability;internet firewall;distributed attack detection;reflector attacks;ddos attack tools;attack packets interception;ddos attack methods;large-scale attacks;flooding-based distributed denial-of-service attacks;tutorial | |
train_1343 | Estimating the intrinsic dimension of data with a fractal-based method | 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 origina... | fractal-based method;time series;santa fe competition;pattern recognition;data intrinsic dimension estimation | |
train_1344 | Restoration of archival documents using a wavelet technique | 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... | archival documents restoration;handwritten archival documents;wavelet reconstruction process;iterative stroke enhancement;ink seepage;wavelet technique;canny edge detector | |
train_1345 | Infrared-image classification using hidden Markov trees | 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 targ... | karhunen-loeve representation;vehicles;hmt;target pose;3d target image;hidden markov trees;target-sensor orientation;infrared-image classification;minimization;ir image classification;contiguous target-sensor orientations;wiener filters;flir imagery;forward-looking-infrared imagery | |
train_1346 | Automatic multilevel thresholding for image segmentation by the growing time | adaptive self-organizing map In this paper, a Growing TASOM (Time Adaptive Self-Organizing Map) network called "GTASOM" along with a peak finding process is proposed for automatic multilevel thresholding. The proposed GTASOM is tested for image segmentation. Experimental results demonstrate that the GTASOM is a reliabl... | growing tasom;image segmentation;growing time adaptive self-organizing map;gtasom;automatic multilevel thresholding;peak finding process | |
train_1347 | A maximum-likelihood surface estimator for dense range data | 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 likelihoo... | surface fitting;simulated ladar data;noisy range measurements;3d surface models;bayesian estimation;unbiased estimator;synthetic aperture radar;calibration;real ladar data;complex scenes;noisy range data;parameter estimation;heuristic;optimal estimation;maximum-likelihood surface estimator;biased solutions;dense range ... | |
train_1348 | Reconstructing surfaces by volumetric regularization using radial basis | functions We present a new method of surface reconstruction that generates smooth and seamless models from sparse, noisy, nonuniform, and low resolution range data. Data acquisition techniques from computer vision, such as stereo range images and space carving, produce 3D point sets that are imprecise and nonuniform wh... | 3d point sets;vision-based data sets;sparse range data;data acquisition techniques;surfaces reconstruction;noisy data;computer vision;low resolution range data;radial basis functions;stereo range images;nonuniform data;weighted radial basis functions;3d implicit surface;space carving;volumetric regularization | |
train_1349 | Efficient simplicial reconstructions of manifolds from their samples | 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, ... | sampling density;simplicial reconstructions;true manifold;learned manifold;finite-dimensional differentiable manifold;manifold learning;simplicial complex | |
train_135 | Hysteretic threshold logic and quasi-delay insensitive asynchronous design | 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 des... | cmos implementation;hlt logic;state-holding boolean functions;asynchronous circuit design;quasi-delay insensitive style;digital logic;hysteretic linear-threshold logic functions;logic design | |
train_1350 | Generalized mosaicing: wide field of view multispectral imaging | 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... | scene sampling rate;scene illumination;registration method;image fusion;wide field of view multispectral imaging;physics-based vision;image-based rendering;color balance;image acquisition;spatially varying spectral bands;generalized mosaicing;scene rendering;hyperspectral imaging;simulated illumination spectra;spatiall... | |
train_1351 | Analytic PCA construction for theoretical analysis of lighting variability in | images of a Lambertian object We analyze theoretically the subspace best approximating images of a convex Lambertian object taken from the same viewpoint, but under different distant illumination conditions. We analytically construct the principal component analysis for images of a convex Lambertian object, explicitly ... | principal eigenvalues;irradiance;lighting variability;surface normal vectors;five-dimensional subspace;radiance;spherical harmonics;principal eigenmodes;analytic principal component analysis;convex lambertian object | |
train_1352 | Elastically adaptive deformable models | 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 ... | elastically adaptive deformable models;physics-based modeling techniques;elastic degrees of freedom;extended kalman filter;geometric degrees of freedom;state equations;kalman filter framework;shape estimation;elastic parameters;automatic adaptation | |
train_1353 | Generalized spatio-chromatic diffusion | 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 ... | vector-valued diffusion;opponent colors;generalized spatio-chromatic diffusion;cielab;diffusion;thermodynamics;color evolution;color images;rgb;ihs;irreversible transformations;nonlinear term;color channels;spatial diffusive term;scale-space | |
train_1354 | Design and analysis of optimal material distribution policies in flexible | manufacturing systems using a single AGV Modern automated manufacturing processes employ automated guided vehicles (AGVs) for material handling, which serve several machine centres (MC) in a factory. Optimal scheduling of AGVs can significantly help to increase the efficiency of the manufacturing process by minimizing ... | manufacturing lead time;optimal scheduling;material delivery;automated guided vehicle;idle time minimization;machine centres;waiting time;agv;flexible manufacturing systems;optimal material distribution policies;material handling | |
train_1355 | Comparison of push and pull systems with transporters: a metamodelling approach | 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 ma... | performance measures;multiproduct multiline multistage production system;throughput rate;average waiting time;pull systems;machine utilization;metamodelling approach;push systems;batch size;demand variation;processing time variation;transporters | |
train_1356 | Five-axis NC milling of ruled surfaces: optimal geometry of a conical tool | 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 co... | optimal geometry;conical milling cutter;conical;side milling;tolerance interval;positioning;five-axis nc milling;cutter dimensions;ruled surfaces | |
train_1357 | Work sequencing in a manufacturing cell with limited labour constraints | 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 labou... | efficiency oriented exhaustive group scheduling heuristics;automated manufacturing cells;job scheduling;dual-constrained automated manufacturing cell;nonexhaustive heuristics;manufacturing cell;group scheduling heuristics;limited labour constraints;work sequencing;labour allocation policies;production planning | |
train_1358 | Analysis of the surface roughness and dimensional accuracy capability of fused | deposition modelling processes Building up materials in layers poses significant challenges from the viewpoint of material science, heat transfer and applied mechanics. However, numerous aspects of the use of these technologies have yet to be studied. One of these aspects is the characterization of the surface roughnes... | cnc-controlled robot;rms roughness;surface roughness;dimensional accuracy capability;layered manufacturing processes;fused deposition modelling processes;prototype parts;dimensional precision;cad model;rapid prototyping;three-dimensional solid objects;extrusion head;roughness average | |
train_1359 | On fuzzy and probabilistic control charts | 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 ... | control chart construction;membership functions;fuzzy control charts;probabilistic control charts;average run length;fuzzy subsets;porcelain products;fuzziness degree;linguistic data;sensitivity | |
train_136 | Design of 1-D and 2-D variable fractional delay allpass filters using weighted | least-squares method In this paper, a weighted least-squares method is presented to design one-dimensional and two-dimensional variable fractional delay allpass filters. First, each coefficient of the variable allpass filter is expressed as the polynomial of the fractional delay parameter. Then, the nonlinear phase err... | cost function;fractional delay parameter;variable fractional delay allpass filters;linear simultaneous equations;nonlinear phase error approximation;1d allpass filters;2d allpass filters;weighted least-squares method;optimal polynomial coefficients;weighted equation error | |
train_1360 | Automated post bonding inspection by using machine vision techniques | 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. Th... | defect classification;wire bonding;orientation determination;lead fingers;bonding line detection;machine vision;packaging;connection detection;semiconductor industry;bonding line missing;ic manufacturing;bonding line breakage;bonding balls;automated post bonding inspection;bonding ball detection;image preprocessing;bon... | |
train_1361 | Adaptive scheduling of batch servers in flow shops | 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 withi... | flow shops;control strategies;two-stage flow shop;batch servers;simulation study;parallel machines;manufacturing operations;production systems;integral scheduling approach;near-future arrivals;dynamic scheduling;batch servicing;look-ahead strategy;aircraft industry;shop optimization;single machine;ovens;semiconductor m... | |
train_1362 | Process planning for reliable high-speed machining of moulds | 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 ... | forging dies;cam methodology;process engineering redefinition;optimum cutting strategies;complex surface geometry;cutting strategies;injection moulds;error-free programs;moulds;process simulation tools;cam programming re-engineering;productivity;tool workpiece collisions;tool breakage;nc programs;process planning;high-... | |
train_1363 | Heuristics for single-pass welding task sequencing | 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 be... | random problems;nearest neighbour concept;welding distortion;welded structure problems;tabu search heuristics;single-pass welding task sequencing;local search heuristics;offline programming;modified travelling salesman problem;productivity;computational speed;automated process-planning procedure;robot arc welding;const... | |
train_1364 | An adaptive sphere-fitting method for sequential tolerance control | 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 i... | real-time measurement information;compliance;skewed distributions;sequential tolerance control;yield improvement;adaptive sphere-fitting method;computational effort;machine tools;design constraints | |
train_1365 | Deadlock-free scheduling in flexible manufacturing systems using Petri nets | 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 ... | optimal deadlock-free schedule;siphon truncation technique;systems of sequential systems with shared resources;optimality condition relaxation;mean flow time minimization;user control factor;randomly generated examples;deadlock-free scheduling;near-optimal deadlock-free schedule;petri net model transitions firing seque... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.