ppxscal/embedding_network huggingface dataset:
Density functional and CIS(D) studies on the ground and excited electronic state properties of nitrogen dioxide
Authors: Alan Hinchliffe, Humberto J. Soscún, Ahmed Mkadmh, Fakhr M. Abu-Awwad
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

We report Ab Initio and DFT calculations for the ground and the lowest five electronic excited states of nitrogen dioxide. Molecular geometries, together with the electric dipole moment, molecular dipole polarizability and first hyperpolarizability are given for each state. We fitted the ground state (&Xtilde;$^2A_1$) mean polarizability and anisotropy to a fourth order Taylor series expansion to account for the effect of the symmetric stretch. The first five excited states were treated using the UCIS and UCIS(D) models; these models give a poor representation of the excited state energies, but demonstrate the substantial differences between the molecular electronic properties for the six electronic states considered.
CBR to Explain Medical Model Exceptions
Authors: Olga Vorobieva, Rainer Schmidt
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

In medicine many exceptions occur. In medical practise and in knowledge-based systems too, it is necessary to consider them and to deal with them appropriately. In medical studies and in research exceptions shall be explained. We present a system that helps to explain cases that do not fit into a theoretical hypothesis. Our starting points are situations where neither a well-developed theory nor reliable knowledge nor a proper case base is available. So, instead of reliable theoretical knowledge and intelligent experience, we have just some theoretical hypothesis and a set of measurements.In this paper, we propose to combine CBR with a statistical model. We use CBR to explain those cases that do not fit the model. The case base has to be set up incrementally, it contains the exceptional cases, and their explanations are the solutions, which can be used to help to explain further exceptional cases.
Speeding up N-body Calculations on Machines without Hardware Square Root
Authors: Alan H. Karp
Venue: Scientific Programming (1992)

The most time consuming part of an N-body simulation is computing the components of the accelerations of the particles. On most machines the slowest part of computing the acceleration is in evaluating $r^{-3/2}$, which is especially true on machines that do the square root in software. This note shows how to cut the time for this part of the calculation by a factor of 3 or more using standard Fortran.
Information systems revisited – the general continuous case
Authors: Dieter Spreen, Luoshan Xu, Xuxin Mao
Venue: Theoretical Computer Science (2008)

In this paper a new notion of continuous information system is introduced. It is shown that the information systems of this kind generate exactly the continuous domains. The new information systems are of the same logic-oriented style as the information systems first introduced by Scott in 1982: they consist of a set of tokens, a consistency predicate and an entailment relation satisfying a set of natural axioms. It is shown that continuous information systems are closely related to abstract bases. Indeed, both categories are equivalent. Since it is known that the categories of abstract bases and/or continuous domains are equivalent, it follows that the category of continuous information systems is also equivalent to that of continuous domains. In applications, mostly subclasses of continuous domains are considered. For example, the domains have to be pointed, algebraic, bounded-complete or FS. Conditions are presented that, when fulfilled by a continuous information system, force the generated domain to belong to the required subclass. In most cases the requirements are not only sufficient but also necessary.
Digital concrete: A multi-scale approach for the concrete behavior
Authors: Ghassan Mounajed, Frédéric Grondin, Hélène Dumontet, Abdelwahed Ben Hamida
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

This article presents a numerical method of homogenization in thermo-hydro-mechanic for materials based on the choice of a representative volume in which heterogeneities are generated in random process. The numerical model is used to predict elastic behaviour as well as thermal damage behaviour and the concrete permeability. This numerical model is developed and implemented in the general finite element code 'SYMPHONIE'. The Digital concrete model is used then to the calculation of the High Strength Concrete behaviour. Obtained results appear in good agreement with experimental measures and show the capacity of the model to take in account the size distribution of aggregates and pores of concrete. Furthermore, this method allows through the process of localization to estimate the local fields and to predict possible damages of the material.
An Approach for Mapping Features to Code Based on Static and Dynamic Analysis
Authors: Abhishek Rohatgi, Abdelwahab Hamou-Lhadj, Juergen Rilling
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

System evolution depends greatly on the ability of a maintainer to locate source code that is specific to feature implementation. Existing feature location techniques require either exercising several features of the system, or rely heavily on domain experts to guide the feature location process. In this paper, we present a novel approach for feature location that combines static and dynamic analysis techniques. An execution trace is generated by exercising the feature under study (dynamic analysis). A component dependency graph (static analysis) is used to rank the components invoked in the trace according to their relevance to the feature. Our ranking technique is based on the impact of a component modification on the rest of the system. The proposed approach is automatic to a large extent relieving users from any decision that would otherwise require extensive domain knowledge of the system. A case study is presented to support and evaluate the applicability of our approach.
A demonstration of phototacs: a simple image-based phone dialing interface for people with cognitive or visual impairments
Authors: Michael J. Astrauskas, John A. Black,  Jr., Sethuraman Panchanathan
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

Modern cell phones are becoming increasingly complex, as more and more features are added to every new generation. These complex user interfaces can make even placing a call difficult for those with disabilities. This presentation demonstrates a fully-functional version of PhotoTacs, an easy-to-use image-based phone book, designed specifically for those with cognitive disabilities and visual impairments.
A Model to Study Phase Transition and Plateaus in Relational Learning
Authors: Erick Alphonse, Aomar Osmani
Venue: Proceedings of the 18th international conference on Inductive Logic Programming (2008)

The feasibility of symbolic learning strongly relies on the efficiency of heuristic search in the hypothesis space. However, recent works in relational learning claimed that the phase transition phenomenon which may occur in the subsumption test during search acts as a plateau for the heuristic search, strongly hindering its efficiency. We further develop this point by proposing a learning problem generator where it is shown that top-down and bottom-up learning strategies face a plateau during search before reaching a solution. This property is ensured by the underlying CSP generator, the RB model, that we use to exhibit a phase transition of the subsumption test. In this model, the size of the current hypothesis maintained by the learner is an order parameter of the phase transition and, as it is also the control parameter of heuristic search, the learner has to face a plateau during the problem resolution. One advantage of this model is that small relational learning problems with interesting properties can be constructed and therefore can serve as a benchmark model for complete search algorithms used in learning. We use the generator to study complete informed and non-informed search algorithms for relational learning and compare their behaviour when facing a phase transition of the subsumption test. We show that this generator exhibits the pathological case where informed learners degenerate into non-informed ones.
Two-dimensional to three-dimensional conversion with direct geometrical search and approximation spaces
Authors: Maciej Borkowski
Venue:  (2007)

This dissertation describes the design and implementation of a system that has been designed to extract 3D information from pairs of 2D images. System input consists of two images taken by all ordinary digital camera. System output is a full 3D model extracted from 2D images. There are no assumptions about the positions of the cameras during the time when the images are being taken, but the scene must not undergo any modifications. The process of extracting 3D information from 2D images consists of three basic steps. First, point matching is performed. The main contribution of this step is the introduction of an approach to Matching image segments in the context of an approximation space. The second step copes with the problem of estimating external camera parameters. The proposed solution to this problem uses 3D geometry rather than the fundamental matrix widely used in 2D to 3D conversion. In the proposed approach (DirectGS), the distances between reprojected rays for all image points are minimised. The contribution of the approach considered in this step is a definition of an optimal search space for solving the 2D to 3D conversion problem and introduction of an efficient algorithm that minimises reprojection error. In the third step, the problem of dense matching is considered. The contribution of this step is the introduction of a proposed approach to dense matching of 3D object structures that utilises the presence of points on lines in 3D space. The theory and experiments developed for this dissertation demonstrate the usefulness of the proposed system in the process of digitizing 3D information. The main advantage of the proposed approach is its low cost, simplicity in use for an untrained user and the high precision of reconstructed objects. Keywords: 2D to 3D conversion: 3D object structure; dense matching; camera parameters; epipolar geometry; minimisation; approximation space, genetic algorithm, image processing, 2D matching, rough sets, image segment
Languages Modulo Normalization
Authors: Hitoshi Ohsaki, Hiroyuki Seki
Venue: Proceedings of the 6th international symposium on Frontiers of Combining Systems (2007)

We propose a new class of tree automata, called tree automata with normalization (TAN). This framework is obtained by extending equational tree automata, and improves the results of the previous work, such as: recognized tree languages modulo the idempotency f(x,x) = x are closed under complement, which are not closed in equational tree automata, besides we do not lose important decidability. In the paper, first we investigate the closure properties of this class for Boolean operations and the decidability relative to the equational tree automata. Next we consider the relationship to other automata frameworks, in particular, hedge automata, which is a class of unranked tree automata. Hedge automata have been recognized in the XML database community as a theoretical basis for modeling the manipulation of semi-structured data. Through the observation about transformations from hedge automata to tree automata, we discuss advantages in the expressiveness and complexity of TAN. As an application of our framework, we show an example that XML schema with constraints that can not be dealt with by other tree automata frameworks is manipulated by TAN.
A Domain-Specific Query Language for Information Services Mash-up
Authors: Weilong Ding, Jing Cheng, Kaiyuan Qi, Yan Li, Zhuofeng Zhao, Jun Fang
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

With the prevalence of Web Services technology, more and more information in the web are provided through Web Services. In certain domains, information can be queried by web services, but building a complete and exact query from these services is always time-consuming and less convenient for end users, especially domain users. Meanwhile, mash-up brings a new way for end-users to build personal view of data and many mash-up tools like Yahoo Pipes, Popfly etc are provided to construct mash-up application. Many of these tools rely on a graphical user interface for ease of use. However, for domain users, they can not help to get the desired outcome quickly. Domain users are familiar with the domain knowledge, and yearn for a dialect using this available domain knowledge to express their query requirements precisely and concisely.In this paper, a domain-specific query language (DSQL) for services mash-up is proposed. We first abstract the domain knowledge model as components of the DSQL, and propose the definition of DSQL to express advanced query requirements. Meanwhile, correlated services could be recommended via business process in domain after the execution of the DSQL. We build a portal site as a case study, featuring the central idea of domain-specific query language (DSQL), according to the application of National Scientific Information System (NSIS) in scientific information domain. The portal site is an interactive platform to receive and respond to users’ requests by the DSQL.
Implicit Feedback between Reconstruction and Tracking in a Combined Optimization Approach
Authors: Olaf Kähler, Joachim Denzler
Venue: Proceedings of the 30th DAGM symposium on Pattern Recognition (2008)

In this work, we present a combined approach to tracking and reconstruction. An implicit feedback of 3d information to the tracking process is achieved by optimizing a single error function, instead of two separate steps. No assumptions about the error distribution of the tracker are needed in the reconstruction step either. This results in higher reconstruction accuracy and improved tracking robustness in our experimental evaluations. The approach is suited for online reconstruction and has a close to real-time performance on current computing hardware.
EA and CCZ Equivalence of Functions over GF(2n)
Authors: K. J. Horadam
Venue: Proceedings of the 2nd international workshop on Arithmetic of Finite Fields (2008)

EA-equivalence classes and the more general CCZ-equiva- lence classes of functions over GF(2 n ) each preserve APN and AB properties desirable for S-box functions. We show that they can be related to subsets c[T] and g[T] of equivalence classes [T] of transversals, respectively, thus clarifying their relationship and providing a new approach to their study. We derive a formula which characterises when two CCZ-equivalent functions are EA-inequivalent.
Learning of Neural Information Routing for Correspondence Finding
Authors: Jan D. Bouecke, Jörg Lücke
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

We present a neural network model that learns to find correspondences. The network uses control units that gate feature information from an input to a model layer of neural feature detectors. The control units communicate via a network of lateral connections to coordinate the gating of feature information such that information about spatial feature arrangements can be used for correspondence finding. Using synaptic plasticity to modify the connections amongst control units, we show that the network can learn to find the relevant neighborhood relationship of features in a given class of input patterns. In numerical simulations we show quantitative results on pairs of one-dimensional artificial inputs and preliminary results on two-dimensional natural images. In both cases the system gradually learns the structure of feature neighborhood relations and uses this information to gradually improve in the task of correspondence finding.
A Web-Based Self-training Approach for Authorship Attribution
Authors: Rafael Guzmán-Cabrera, Manuel Montes-Y-Gómez, Paolo Rosso, Luis Villaseñor-Pineda
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

As any other text categorization task, authorship attribution requires a large number of training examples. These examples, which are easily obtained for most of the tasks, are particularly difficult to obtain for this case. Based on this fact, in this paper we investigate the possibility of using Web-based text mining methods for the identification of the author of a given poem. In particular, we propose a semi-supervised method that is specially suited to work with justfew training examples in order to tackle the problem of the lack of data with the same writing style. The method considers the automatic extraction of the unlabeled examples from the Web and its iterative integration into the training data set. To the knowledge of the authors, a semi-supervised method which makes use of the Web as support lexical resource has not been previously employed in this task. The results obtained on poem categorization show that this method may improve the classification accuracy and it is appropriate to handle the attribution of short documents.
Face to Face Cooperation with CoFFEE
Authors: Furio Belgiorno, Rosario Chiara, Ilaria Manno, Maarten Overdijk, Vittorio Scarano, Wouter Diggelen
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

Co-located collaboration in classroom is the topic we tackle in this paper. In particular we will describe how CoFFEE implements this kind of collaboration. CoFFEE is an extensible platform on which to implement different collaborative tools. Every tool renders a different kind cooperation between users. In this paper we will also provide further details in about the newly implemented tools for collaboration, the Repository, the Positionometer and the Co-Writer.
Mobility Driven Vertical Handover for Mobile IPTV Traffic in Hybrid IEEE 802.11e/16e Networks
Authors: Eunjun Choi, Wonjun Lee, Joongheon Kim
Venue: Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing (2007)

This paper addresses a mobility driven vertical handover (M-VHO) scheme to avoid unnecessary handovers for IEEE 802.11e/16e wireless networks. In the M-VHO scheme, the mobility of a mobile station (MS), e.g., an IPTV terminal, can be estimated by the pattern of velocities and directions. As the mobile IPTV traffic strictly needs to be considered for supporting high quality and large scale multimedia services, IEEE 802.11e-based QoS-aware MAC is good to use. Therefore, the proposed M-VHO scheme is operated over IEEE 802.11e/16e networks. Results demonstrate that M-VHO scheme is efficient to supply QoS in various traffic.
Fast communication: Bayesian Cramer-Rao bounds for complex gain parameters estimation of slowly varying Rayleigh channel in OFDM systems
Authors: Hussein Hijazi, Laurent Ros
Venue: Signal Processing (2009)

This paper deals with on-line Bayesian Cramer-Rao (BCRB) lower bound for complex gains dynamic estimation of time-varying multi-path Rayleigh channels. We propose three novel lower bounds for 4-QAM OFDM systems in case of negligible channel variation within one symbol, and assuming both channel delay and Doppler frequency related information. We derive the true BCRB for data-aided (DA) context and, two closed-form expressions for non-data-aided (NDA) context.
Building a Model for Time Reduction of Steel Scrap Meltdown in the Electric Arc Furnace (EAF): General Strategy with a Comparison of Feature Selection Methods
Authors: Tadeusz Wieczorek, Marcin Blachnik, Krystian Mączka
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

Time reduction of steel scraps meltdown during the electic arc process is really a challenging problem. Typically the EAF process is stochastic without any determinism and only simple and naive rules are currently used to manage such processes. The goal of the paper is to present the way, which have been considered, to build an accurate model concerning different feature selection methods that would be helpful in predicting the end of the meltdown and maximum energy needed by the furnace.
Computation and interpretation of Raman scattering intensities
Authors: Kathleen M. Gough, Concetta Lupinetti, Richard Dawes
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

The experimental measurement and the theoretical calculation of Raman scattering intensities present a number of challenges. We evaluate the currently available options with regard to our on-going studies of intensity in hydrocarbons and silanes. In the treatment of experimental data, anharmonic force fields permit the calculation of combination and overtone intensities as well as the resolution of anharmonic resonances. The structural dependence of the magnitude of the mean molecular polarizability derivative associated with the stretch of a single bond is confirmed at the B3LYP/aug-cc-pVTZ level of calculation. Although they do not exhibit nonlinear optical properties, derivatives for the straight chain alkanes show nonlinear trends in common with silanes, polyenes and polyaromatic hydrocarbons. The dynamic correction has been evaluated using time dependent DFT with the same basis set (TDDFT). The best calculations yield results that agree with the measured values to within experimental error.
An Operating System for a Time-Predictable Computing Node
Authors: Guenter Khyo, Peter Puschner, Martin Delvai
Venue: Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems (2008)

The increasing complexity of speed-up mechanisms found in modern computer architectures makes it difficult to predict the timing of the software that runs on this hardware, especially when the software itself has many different execution paths. To fight this combined hardware-software complexity that makes an accurate timing analysis infeasible, we have conceived a very simple software structure for real-time tasks: We do not allow that decisions about the control flow are made at runtime, i.e., all decisions are resolved in an off-line analysis before runtime.In this paper we show that simple control structures generated before runtime can as well be used within the operating system of an embedded real-time system. In this way we make not only task timing but also the timing of the operating system and thus the timing of the entire real-time computer system fully deterministic, thus time-predictable. We explain the principles and mechanisms we use to achieve this predictability and show the results of an experiment that demonstrates the feasibility of our concepts.
Aspect-Oriented Modeling for Variability Management
Authors: Natsuko Noda, Tomoji Kishi
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

In product line development (PLD), reusability is the key factor, and it is important to make architecture and components flexibly configurable. Thus far, several techniques for utilizing aspect-oriented technologies (AOTs) for PLD have been proposed. However, the application of AOTs to PLD is not simple and various issues related to the application, such as an invasive change problem that prevents reusability, have been reported. We have proposed an aspect oriented modeling (AOM) mechanism that separates concerns from their relationships with other concerns. In this study, we propose the application of our AOM to variability management and demonstrate the effectiveness of our approach with the help of a case study of embedded software.