ppxscal/embedding_network huggingface dataset:
Selective Catalytic Reduction of NO with NH3 over Wire-Mesh Honeycomb Supported V2O5 -MoO3/TiO2/Al2O3 Catalyst
Authors: Xu Zhai, Zhonglin Chen, Jie Yao, He Wang, Junsheng Li
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

A novel V2O5-MoO3/TiO2/Al2O3 metal wire-mesh-honeycomb catalyst prepared by electrophoretic deposition (EPD) was investigated for the selective catalytic reduction (SCR) of NO with NH3. The effects of reaction temperature, space velocity and NH3/NO ratio on the SCR activity were evaluated. The experimental results show that V2O5-MoO3/TiO2/Al2O3 catalyst can achieve satisfied NO removal effect at 350°C; the increase of the space velocity will make NO conversion ratio reduce, except 400°C. NH3/NO ratio has a little influence on NO removal efficiency, which raises slowly with the increasing NH3/NO ratio. At the same time, body structure and surface character of catalyst prepared were characterized by XRD, SEM and XPS. Combining characterization with the results of activity test, the relation between catalyst structure and catalysis performance was analyzed. The results of characterization show that the active component is uniformly distributed on the catalyst carrier as a single layer and high SCR activity is attributed to the strong interaction between TiO2 and V2O5.
Real-time event processing for high volume applications using StarRules&trade;
Authors: Fast Abstract, Francis McCabe
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

StarRules is a high-level programming language based on Event Calculus principles that was developed for processing large volumes of data. It is an integral part of a comprehensive platform that has been used for many applications, including fault detection in large scale facilities and in factory scheduling for semiconductor manufacturing.
Teleo-reactive programs for agent control
Authors: Nils J. Nilsson
Venue: Journal of Artificial Intelligence Research (1993)

A formalism is presented for computing and organizing actions for autonomous agents in dynamic environments. We introduce the notion of teleo-reactive (T-R) programs whose execution entails the construction of circuitry for the continuous computation of the parameters and conditions on which agent action is based. In addition to continuous feedback, T-R programs support parameter binding and recursion. A primary difference between T-R programs and many other circuit-based systems is that the circuitry of T-R programs is more compact; it is constructed at run time and thus does not have to anticipate all the contingencies that might arise over all possible runs. In addition, T-R programs are intuitive and easy to write and are written in a form that is compatible with automatic planning and learning methods. We briefly describe some experimental applications of T-R programs in the control of simulated and actual mobile robots.
Real arguments are approximate arguments
Authors: Anthony Hunter
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arguments. A common assumption for logic-based argumentation is that an argument is a pair (Φ, α) where Φ is minimal subset of the knowledgebase such that Φ is consistent and Φ entails the claim α. However, real arguments (i.e. arguments presented by humans) usually do not have enough explicitly presented premises for the entailment of the claim. This is because there is some common knowledge that can be assumed by a proponent of an argument and the recipient of it. This allows the proponent of an argument to encode an argument into a real argument by ignoring the common knowledge, and it allows a recipient of a real argument to decode it into an argument by drawing on the common knowledge. If both the proponent and recipient use the same common knowledge, then this process is straightforward. Unfortunately, this is not always the case, and raises the need for an approximation of the notion of an argument for the recipient to cope with the disparities between the different views on what constitutes common knowledge.
A Novel Air-Conditioning Load Prediction Based on ARIMA and BPNN Model
Authors: Li Xuemei, Ding Lixing, Shao Ming, Xu Gang, Li Jibin
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

Accurate air-conditioning load forecasting is the precondition for the optimal control and energy saving operation of HVAC systems. Many forecasting techniques such as support vector machine (SVM), artificial neural network (ANN), autoregressive integrated moving average (ARIMA) and grey model, have been proposed in the field of air-conditioning load prediction. However, none of them has enough accuracy to satisfy the practical demand. Therefore, a novel method integrating ARIMA and Artificial Neural Network (ANN) is presented to forecast an air-conditioning load. ARIMA is suitable for linear prediction and ANN is suitable for nonlinear prediction. This paper also investigates the issue on how to effectively model short term air conditioning load time series with a new algorithm, which estimates the weights of the ANN and the parameters of ARMA model. Experimental results demonstrate that the hybrid air conditioning load forecasting model can be an effective way to improve forecasting accuracy achieved by either of the models used separately.
Is the `Figure of Merit' Really That Meritorious?
Authors: Jarinee Chattratichart, Gitte Lindgaard
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

Studies comparing performance of Usability Evaluation Methods (UEMs) led to three standard metrics, namely, validity, thoroughness, and effectiveness, calculated from lab-based usability test results. The effectiveness metric, E = T × V, was proposed as the `figure of merit' [7] that would give a balanced account of validity and thoroughness. This paper provides an analysis of the formula to caution future researchers and usability practitioners against its use, proposes an alternative formula, and discusses the limitations of the common baseline approach to UEM comparison.
The quest for usable knowledge: the delicate balance between research, design and change
Authors: Ilya Zitter, Sanne Akkerman, Elly De Bruijn
Venue: Proceedings of the 8th international conference on International conference for the learning sciences - Volume 3 (2008)

To bridge the gap between educational research and practice, a methodological approach known as educational design research (EDR) has gained influence. In our view, carrying out EDR necessitates balancing three processes: (1) research, (2) design, and (3) change. Using Activity theory as theoretical foundation, we will clarify the processes and the potential tension between these processes.
Markerless 3D Face Tracking
Authors: Christian Walder, Martin Breidt, Heinrich Bülthoff, Bernhard Schölkopf, Cristóbal Curio
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

We present a novel algorithm for the markerless tracking of deforming surfaces such as faces. We acquire a sequence of 3D scans along with color images at 40Hz. The data is then represented by implicit surface and color functions, using a novel partition-of-unity type method of efficiently combining local regressors using nearest neighbor searches. Both these functions act on the 4D space of 3D plus time, and use temporal information to handle the noise in individual scans. After interactive registration of a template mesh to the first frame, it is then automatically deformed to track the scanned surface, using the variation of both shape and color as features in a dynamic energy minimization problem. Our prototype system yields high-quality animated 3D models in correspondence, at a rate of approximately twenty seconds per timestep. Tracking results for faces and other objects are presented.
Characterization of 3D shape parts for semantic annotation
Authors: Marco Attene, Francesco Robbiano, Michela Spagnuolo, Bianca Falcidieno
Venue: Computer-Aided Design (2009)

3D content stored in big databases or shared on the Internet is a precious resource for several applications, but unfortunately it risks being underexploited due to the difficulty of retrieving it efficiently. In this paper we describe a system called the ''ShapeAnnotator'' through which it is possible to perform non-trivial segmentations of 3D surface meshes and annotate the detected parts through concepts expressed by an ontology. Each part is connected to an instance that can be stored in a knowledge base to ease the retrieval process based on semantics. Through an intuitive interface, users create such instances by simply selecting proper classes in the ontology; attributes and relations with other instances can be computed automatically based on a customizable analysis of the underlying topology and geometry of the parts. We show how our part-based annotation framework can be used in two scenarios, namely for the creation of avatars in emerging Internet-based virtual worlds, and for product design in e-manufacturing.
Study on Computing Grid Distributed Middleware and Its Application
Authors: Shengxian Luo, Xiaochuan Peng, Shengbo Fan, Peiyu Zhang
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Focused on the problems that the development of grid application is difficult and the type of discovered resources is restricted when directly using Globus Toolkit API, some technologies such as grid container, grid plug-in, grid object pool, grid resource adapter and the subgrid communication protocol for computing grid are introduced, the kernel methods and hiberarchy of computing grid distributed middleware (CGDM) are discussed in this paper. By applying these technologies, the computing grid distributed middleware is realized, which is independent of computing grid portal and grid application. The real application in a campus cmputing grid development shows that this middleware can make it easy to discover new types of grid resources and lead to a quick grid application developing and interconnection between the subgrids.
Optimized evaluation of image alteration indexes in IFC
Authors: Domenico Grimaldi, Francesco Lamonaca
Venue: Proceedings of the 2009 IEEE International Workshop on Medical Measurements and Applications (2009)

On the basis of the hardware architecture of the Image Flow Cytometer it was assessed that the alterations affecting the images are: bad exposure, out of focus, motion blur, and Gaussian noise. In the paper the computational burden to evaluate the Image Quality indexes is taken into account in order to reduce it and to speed up the overall correction process of the altered images. To reach these goals a new optimized procedure is proposed. It is able to evaluate in the sequential manner the indexes of the considered image alterations. Preliminary experimental tests confirm the fitness of the indexes evaluated on the basis of the optimized procedure and the advantages regarding the reduction of computational complexity.
Study of Petroleum Hydrocarbons under Chemical-Biological Degradation in Contaminated Soils
Authors: Ningning Sun, Hongqi Wang, Jingqi Liu, Yongqiang Qi
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Microbial decontamination of petroleum-polluted soils has been recognized to be an efficient, economical and versatile alternative for physical or chemical treatments. In this study, different components of petroleum in contaminated soil were investigated under optimal environmental conditions which were determined by previous experiments. An aerobic bacteria with the ability to utilize both hydrocarbons and benzene as carbon sources was identified as Flavobacterium sp. based on morphological, physiological and biochemical tests. The results demonstrate a 39.88% removal rate for total petroleum hydrocarbons over a period of 27 days. Different fractions of the petroleum were observed to be degraded incongruently. The degradation rate declines with increasing alkane chain length (carbon number). It was found that the total degradation rate can be approximated by the degradation rate of the n-alkane with 23 carbon atoms. N-alkanes with carbon number lower than 23 were removed faster than the total hydrocarbon amount, and the reverse trend was observed for n-alkanes with carbon number higher than 23. Unlike n-alkanes, the degradation rate of total iso-alkanes can be simulated by that of with iso-alkanes with 19 carbon atoms. The benzene utilization studies with the bacteria species showed that it metabolizes benzene when benzene concentration is under 10 mg/L, concentrations over which turn out to be inhibitory. The optimal conditions for effective removal of benzene by this species appear to be 30 ºC, pH of 6.5-6.7, inoculum concentration of 10% (v/v).
The graph camera
Authors: Voicu Popescu, Paul Rosen, Nicoletta Adamo-Villani
Venue: ACM Transactions on Graphics (TOG) (2009)

A conventional pinhole camera captures only a small fraction of a 3-D scene due to occlusions. We introduce the graph camera, a non-pinhole with rays that circumvent occluders to create a single layer image that shows simultaneously several regions of interest in a 3-D scene. The graph camera image exhibits good continuity and little redundancy. The graph camera model is literally a graph of tens of planar pinhole cameras. A fast projection operation allows rendering in feed-forward fashion, at interactive rates, which provides support for dynamic scenes. The graph camera is an infrastructure level tool with many applications. We explore the graph camera benefits in the contexts of virtual 3-D scene exploration and summarization, and in the context of real-world 3-D scene visualization. The graph camera allows integrating multiple video feeds seamlessly, which enables monitoring complex real-world spaces with a single image.
Using genericity to create cutomizable finite-state tools
Authors: Sandro Pedrazzini, Marcus Hoffmann
Venue: Proceedings of the International Workshop on Finite State Methods in Natural Language Processing (1998)

In this article we present the realization of a generic finite-state system. The system has been used to create concrete lexical tools for word form analysis, word form generation, creation and derivation history, and spellchecking. It will also be used to create a finite-state transducer for the recognition of phrases. Producing a finite-state component with the generic system requires little effort. We will first emphasize its meaning and its architecture from a design point of view; then we will present some lexical finite-state tools created with it.
Baum's Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions
Authors: Adam R. Klivans, Philip M. Long, Alex K. Tang
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

In 1990, E. Baum gave an elegant polynomial-time algorithm for learning the intersection of two origin-centered halfspaces with respect to any symmetric distribution (i.e., any ${\cal D}$ such that ${\cal D}(E) = {\cal D}(-E)$) [3]. Here we prove that his algorithm also succeeds with respect to any mean zero distribution with a log-concave density (a broad class of distributions that need not be symmetric). As far as we are aware, prior to this work, it was not known how to efficiently learn any class of intersections of halfspaces with respect to log-concave distributions.The key to our proof is a "Brunn-Minkowski" inequality for log-concave densities that may be of independent interest.
Optimality Principle Based Sink Tree Methodology for Adaptive Static Routing Using Multiple Route Configuration Scheme
Authors: Hartinder Singh Johal
Venue: Proceedings of the Advances in Electrical and Electronics Engineering - IAENG Special Edition of the World Congress on Engineering and Computer Science 2008 (2008)

Optimality Principle Based Sink Tree Methodology for Adaptive Static Routing Using Multiple Route Configuration Scheme is an innovative strategy for integrating Dynamic Routing Protocol attributes seamlessly into Static Routing. In context of incapability to dynamically adapt to network topology failures and high management overhead, Static Routing still offers robustness to routing convergence failure, external route spoofing and easy prediction. This paper proposes a Static Routing strategy with an objective of extending its ability to adapt to logical network topology changes, equipment failures or network outages 'on the fly'. This strategy will involve discovery of all possible Static Routes from a specific source router to destination router, analyzing and ordering their applicability using optimality principle based Sink Tree approach. A random subnet composed of fifteen routers is simulated and mapped to Sink Tree and most obvious paths between random source and destination are analyzed. Static Routes are traced to extract information about hop count from source to destination. The hop count information is recorded for each Static Route trace and comparative analysis is performed. Based on this comparison the Static Route are sorted in order of preference as per optimality principle and are offered to router as secondary routes in event of failure of primary preferred Static Route, thereby retaining the benefits of Static Routing while still availing the flexibility of Dynamic Routing to some extent.
Agent organized networks redux
Authors: Robin Glinton, Katia Sycara, Paul Scerri
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

Individual robots or agents will often need to form coalitions to accomplish shared tasks, e.g., in sensor networks or markets. Furthermore, in most real systems it is infeasible for entities to interact with all peers. The presence of a social network can alleviate this problem by providing a neighborhood system within which entities interact with a reduced number of peers. Previous research has shown that the topology of the underlying social network has a dramatic effect on the quality of coalitions formed and consequently on system performance (Gaston & deslardins 2005a). It has also been shown that it is feasible to develop agents which dynamically alter connections to improve an organization's ability to form coalitions on the network. However those studies have not analysed the network topologies that result from connectivity adaptation strategies. In this paper the resulting network topologies were analysed and it was found that high performance and rapid convergence were attained because scale free networks were being formed. However it was observed that organizational performance is not impacted by limiting the number of links per agent to the total number of skills available within the population. implying that bandwidth was wasted by previous approaches. We used these observations to inform the design of a token based algorithm that attains higher performance using an order of magnitude less messages for both uniform and non-uniform distributions of skills.
Electromagnetic MUSIC-type imaging of perfectly conducting, arc-like cracks at single frequency
Authors: Won-Kwang Park, Dominique Lesselier
Venue: Journal of Computational Physics (2009)

We propose a non-iterative MUSIC (MUltiple SIgnal Classification)-type algorithm for the time-harmonic electromagnetic imaging of one or more perfectly conducting, arc-like cracks found within a homogeneous space R^2. The algorithm is based on a factorization of the Multi-Static Response (MSR) matrix collected in the far-field at a single, nonzero frequency in either Transverse Magnetic (TM) mode (Dirichlet boundary condition) or Transverse Electric (TE) mode (Neumann boundary condition), followed by the calculation of a MUSIC cost functional expected to exhibit peaks along the crack curves each half a wavelength. Numerical experimentation from exact, noiseless and noisy data shows that this is indeed the case and that the proposed algorithm behaves in robust manner, with better results in the TM mode than in the TE mode for which one would have to estimate the normal to the crack to get the most optimal results.
Adaptive Mind Agent
Authors: Brigitte Krenn, Marcin Skowron, Gregor Sieber, Erich Gstrein, Jörg Irran
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

We present the Adaptive Mind Agent, an intelligent virtual agent that is able to actively participate in a real-time, dynamic environment. The agent is equipped with a collection of processing tools that form the basis of its perception from and action on the environment consisting of web documents, URLs, RRS feeds, domain-specific knowledgebases, other accessible virtual agents and the user. How these predispositions are finally shaped into unique agent behaviour depends on the agent's abilities to learn through actual interactions, in particular the abilities: (i) to memorize and evaluate episodes comprising the actions the agent had performed on its environment in the past depending on its perceptions of the user requests and its interpretation of the user's feedback reinforcing or inhibiting a certain action; (ii) to dynamically develop user-driven interest and preference profiles through memorizing and evaluating the user clicks on selected web pages.
Development of Oversize Bogie-Hearth Resistance Furnance Computer Control System
Authors: Huang Run, Long Wei, Pang Biao
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Focusing on the special technology requirements of large-scale heat treatment resistance furnace, a increment adaptive predicting compensation controller and limit amplitude output combination control strategy is provided in this article, which can solve the problems in temperature control such as large-time delay, heating nonhomogeneity in temperature field and so on. To meet different technology demands and to reduce cost, a way with the software configuration king 6.03 is provided in this article.
Logic Programs under Three-Valued Łukasiewicz Semantics
Authors: Steffen Hölldobler, Carroline Dewi Kencana Ramli
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

If logic programs are interpreted over a three-valued logic, then often Kleene's strong three-valued logic with complete equivalence and Fitting's associated immediate consequence operator is used. However, in such a logic the least fixed point of the Fitting operator is not necessarily a model for the program under consideration. Moreover, the model intersection property does not hold. In this paper, we consider the three-valued ¿ukasiewicz semantics and show that fixed points of the Fitting operator are also models for the program under consideration and that the model intersection property holds. Moreover, we review a slightly different immediate consequence operator first introduced by Stenning and van Lambalgen and relate it to the Fitting operator under ¿ukasiewicz semantics. Some examples are discussed to support the claim that ¿ukasiewicz semantics and the Stenning and van Lambalgen operator is better suited to model commonsense and human reasoning.