ppxscal/embedding_network huggingface dataset:
Computational Linguistic Text Processing: Logical Form, Semantic Interpretation, Discourse Relations and Question Answering
Authors: Rodolfo Delmonte
Venue:  (2007)

The topic of this book is the theoretical foundations of a theory LSLT - Lexical Semantic Language Theory - and its implementation in a the system for text analysis and understanding. There are two main tenets of the theory which are supporting the construction of the system is that it is possible to reduce access to domain world knowledge by means of contextual reasoning, i.e. reasoning triggered independently by contextual or linguistic features of the text under analysis. In other words, it adopts what could be termed the Shallow Processing Hypothesis: access to WordNet is reduced and substituted whenever links are missing through inferences on the basis of hand-coded lexical and grammatical knowledge given to the system, which are worked out in a fully general manner.The purpose of the book is to present in detail the scientific foundations of the architecture and components of a (yet to be) implemented system for text understanding and generation, and at the same time to discuss critically some of the possible applications in real world domains in which such an approach could be fruitful.
Step-out group signatures
Authors: Marek Klonowski, &#x0141;ukasz Krzywiecki, Miros&#x0142;aw Kuty&#x0142;owski, Anna Lauks
Venue: Computing (2009)

Group signature schemes enable to create digital signatures such that the signers are hidden in a group of potential signers. However, in a case of need it is possible to reveal the actual signer either by a group administrator or collectively by the group members. We design a new kind of signatures that we call step-out group signature where the situation is reversed: any member of the group except the signer may prove that he or she was not the signer. This is a dual solution that is useful in certain scenarios: in many cases it is unnecessary to find the signer, it suffices to eliminate some potential signers (e.g. during prosecutions and court procedures). Our solution is more convenient for implementing personal data protection rules: since the signer is not revealed, there is no need to protect this information. On the other hand, the traditional scheme may lead to serious legal problems: if the legal case is to find out whether Bob has created group signature s, it might be illegal to reveal that Alice has created s.
The evolution of optical and electrical properties of low-k dielectrics under bias stress
Authors: J. M. Atkin, E. Cartier, T. M. Shaw, J. R. Lloyd, R. B. Laibowitz, T. F. Heinz
Venue: Microelectronic Engineering (2009)

Photocurrent spectroscopy and transient photocurrent measurements are employed in order to investigate the change in barrier heights and density of traps within low-k dielectric films under bias stressing conditions. By characterizing these fundamental physical properties, we hope to gain an understanding of the processes leading to time-dependent dielectric breakdown.
Adaptive price update in distributed Lagrangian relaxation protocol
Authors: Katsutoshi Hirayama, Toshihiro Matsui, Makoto Yokoo
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (GMAP). In DisLRP, when updating Lagrange multipliers (prices) of goods, the agents basically control their step length, which determines the degree of update, by a static rule. A merit of this updating rule is that since it is static, it is easy to implement even without a central control. Furthermore, if we choose this static rule appropriately, we have observed empirically that DisLRP converges to a state providing a good upper bound. However, it must be difficult to devise such a good static rule for updating step length since it naturally depends on problem instances to be solved. On the other hand, in a centralized context, the Lagrangian relaxation approach has conventionally computed step length by exploiting the least upper bound obtained during the search and a lower bound obtained through preprocessing. In this paper, we achieve this approach in a distributed environment where no central control exists and name the resultant protocol Adaptive DisLRP (ADisLRP). The key ideas of this new protocol are to 1) compute global information with a spanning tree, 2) update step length simultaneously with a synchronization protocol, and 3) estimate lower bounds during the search. We also show the robustness of ADisLRP through experiments where we compared ADisLRP with the previous protocols on the critically hard benchmark instances.
Ontology (Science)
Authors: Barry Smith
Venue: Proceeding of the 2008 conference on Formal Ontology in Information Systems: Proceedings of the Fifth International Conference (FOIS 2008) (2008)

Increasingly, in data-intensive areas of the life sciences, experimental results are being described in algorithmically useful ways with the help of ontologies. Such ontologies are authored and maintained by scientists to support the retrieval, integration and analysis of their data. The proposition to be defended here is that ontologies of this type --the Gene Ontology (GO) being the most conspicuous example --are a part of science. Initial evidence for the truth of this proposition (which some will find self-evident) is the increasing recognition of the importance of empirically-based methods of evaluation to the ontology development work being undertaken in support of scientific research. Ontologies created by scientists must, of course, be associated with implementations satisfying the requirements of software engineering. But the ontologies are not themselves engineering artifacts, and to conceive them as such brings grievous consequences. Rather, ontologies such as the GO are in different respects comparable to scientific theories, to scientific databases, and to scientific journal publications. Such a view implies a new conception of what is involved in the authoring, maintenance and application of ontologies in scientific contexts, and therewith also a new approach to the evaluation of ontologies and to the training of ontologists.
An analysis of hybrid FIR structures in applications to ultrasound image processing
Authors: L. J. Morales-Mendoza, Yu S. Shmaliy, O. G. Ibarra-Manzano
Venue: Proceedings of the international conference on Computational and information science 2009 (2009)

In this paper, we analyze and develop hybrid finite impulse response (FIR) structures in applications to image enhancing. Three particular hybrid structures are observed: the FIR median hybrid (FMH), the moving average hybrid (MAH), and the smoothing FIR hybrid (FSH). All these structures have been developed for preserving a sharp edge and enhancing ultrasound images. It is shown that, among others, the FSH structure has a better performance in terms of the minimum mean square error and maximum signal-to-noise ratio in the enhanced image.
Controlled Natural Language for Semantic Annotation
Authors: Brian Davis, Pradeep Varma, Siegfried Handschuh, Laura Dragan, Hamish Cunningham
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

Sovereign is a novel collection of resources for authoring(1), annotating(2) and accessing(3) knowledge on the Social Semantic Desktop. With respect to (2), the Sovereign Semantic Annotator allows the non-expert user in a novel way to semi-automatically author and annotate meeting minutes and status reports simultaneously using Controlled Natural Language(CNL). The metadata is captured as knowledge on the Social Semantic Desktop for later aggregation and access. The annotator is based on Controlled Language for Information Extraction (CLIE) technology. Furthermore, it is available as a plugin for a semantic note-taking application for the Social Semantic Desktop. We intend to present a working prototype of the Sovereign annotator for the Social Semantic Desktop at ESWC.
Control and optimization with dimensionality constraints
Authors: Tryphon T. Georgiou, Gary J. Balas
Venue:  (2008)

The purpose of this thesis is to develop synthesis tools for control design with dimensionality constraints. In particular, given a model for a physical process, the goal is to characterize all possible controllers of a certain dimension which satisfy given performance criteria. In classical feedback design, the complexity of controller adversely affects robustness of the regulatory mechanisms of the feedback and adds to the fragility of the system. The complexity is often due to the difficulty in imposing performance specifications in a natural mathematical context. Typically, this is done using "weight functions" which encapsulate the specifications, and then introducing those in a suitable optimization problem. A contribution of this work is to address a certain type of optimization problem and the choice of weight functions. More precisely, we develop a new design approach which leads to a controller achieving both requirements, the performance specifications and low complexity, at the same time. Further, this thesis generalizes the previous methods for multivariable systems by developing analogous theory and techniques. The main contribution in multivariable analytic interpolation is to characterize a family of minimal McMillan degree solutions by a choice of spectral-zero dynamics. In addition to application of this theory for model-matching in control design, we show how to use the same techniques for maximum power transfer in circuit theory, and for spectral estimation in signal analysis. Also in this thesis we give new results on implementation of controllers with some very specific elements. One such, which is hard to simulate on a digital computer, is what could be described as "half capacitor". It implements a "fractional integration" and can be used to a great advantage in classical feedback design, providing gain but without introducing time-lag.
Errors of linear multistep methods for singularly perturbed Volterra delay-integro-differential equations
Authors: Shifeng Wu, Siqing Gan
Venue: Mathematics and Computers in Simulation (2009)

This paper is concerned with the error behaviour of linear multistep methods applied to singularly perturbed Volterra delay-integro-differential equations. We derive global error estimates of A(@a)-stable linear multistep methods with convergent quadrature rule. Numerical experiments confirm our theoretical analysis.
Future tenseConfusions of the hive mind
Authors: Jaron Lanier
Venue: Communications of the ACM (2009)

Future Tense, one of the revolving features on this page, presents stories and essays from the intersection of computational science and technological speculation, their boundaries limited only by our ability to imagine what will and could be.Cherish the individual.
High-order compact schemes for incompressible flows: A simple and efficient method with quasi-spectral accuracy
Authors: Sylvain Laizet, Eric Lamballais
Venue: Journal of Computational Physics (2009)

In this paper, a finite difference code for Direct and Large Eddy Simulation (DNS/LES) of incompressible flows is presented. This code is an intermediate tool between fully spectral Navier-Stokes solvers (limited to academic geometry through Fourier or Chebyshev representation) and more versatile codes based on standard numerical schemes (typically only second-order accurate). The interest of high-order schemes is discussed in terms of implementation easiness, computational efficiency and accuracy improvement considered through simplified benchmark problems and practical calculations. The equivalence rules between operations in physical and spectral spaces are efficiently used to solve the Poisson equation introduced by the projection method. It is shown that for the pressure treatment, an accurate Fourier representation can be used for more flexible boundary conditions than periodicity or free-slip. Using the concept of the modified wave number, the incompressibility can be enforced up to the machine accuracy. The benefit offered by this alternative method is found to be very satisfactory, even when a formal second-order error is introduced locally by boundary conditions that are neither periodic nor symmetric. The usefulness of high-order schemes combined with an immersed boundary method (IBM) is also demonstrated despite the second-order accuracy introduced by this wall modelling strategy. In particular, the interest of a partially staggered mesh is exhibited in this specific context. Three-dimensional calculations of transitional and turbulent channel flows emphasize the ability of present high-order schemes to reduce the computational cost for a given accuracy. The main conclusion of this paper is that finite difference schemes with quasi-spectral accuracy can be very efficient for DNS/LES of incompressible flows, while allowing flexibility for the boundary conditions and easiness in the code development. Therefore, this compromise fits particularly well for very high-resolution simulations of turbulent flows with relatively complex geometries without requiring heavy numerical developments.
Thread-based analysis of patterns of collaborative interaction in chat
Authors: Murat Cakir, Fatos Xhafa, Nan Zhou, Gerry Stahl
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

In this work we present a thread-based approach for analyzing synchronous collaborative math problem solving activities. Thread information is shown to be an important resource for analyzing collaborative activities, especially for conducting sequential analysis of interaction among participants of a small group. We propose a computational model based on thread information which allows us to identify patterns of interaction and their sequential organization in computer-supported collaborative environments. This approach enables us to understand important features of collaborative math problem solving in a chat environment and to envisage several useful implications for educational and design purposes.
Semantic model approach for eGovernment to improve sharing, retrieving and exchanging documentation across back-office
Authors: Fernando Ortiz-Rodríguez, Julian Chaparro Pelaez, Felix Jose Pascual
Venue: Proceedings of the 10th Annual International Conference on Digital Government Research: Social Networks: Making Connections between Citizens, Data and Government (2009)

In this paper we present the EGO Model, in order to have a framework to create eGovernment ontologies that describe how to access and manage official and non-official documentation across the governments. Two applications using the Model are described.
Aeroengine Turbine Exhaust Gas Temperature Prediction Using Support Vector Machines
Authors: Xuyun Fu, Gang Ding, Shisheng Zhong
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

The turbine exhaust gas temperature (EGT) is an important parameter of the aeroengine and it represents the thermal health condition of the aeroengine. By predicting the EGT, the performance deterioration of the aeroengine can be deduced in advance. Thus, the flight safety and the economy of the airlines can be guaranteed. However, the EGT is influenced by many complicated factors during the practical operation of the aeroengine. It is difficult to predict the change tendency of the EGT effectively by the traditional methods. To solve this problem, a novel EGT prediction method based on the support vector machines (SVM) is proposed. Finally, the proposed prediction method is utilized to predict the EGT of some aeroengine, and the results are satisfying.
Versal deformations for generalized second order linear systems: application to control theory
Authors: M. Isabel García-Planas
Venue: Proceedings of the 13th WSEAS international conference on Applied mathematics (2008)

In this work we consider families of quadruples of matrices ϕ(ξ) = (E(ξ),A1(ξ),A2(ξ), B(ξ)) smoothly depending on parameters, representing families of generalized second order linear systems in the form E(ξ)x = A1(ξ)x + A2(ξ)x + B(ξ)u(t), with E(ξ),A1(ξ),A2(ξ) ∈ Mn(C), B(ξ) ∈ Mn × m(C) for each ξ, arising naturally in a variety of circumstances for example they are used in power systems. In this paper we show that the family can be reduced locally to a special typically more simple form, called the versal deformation, by a smooth change of parameters and a equivalence transformation. We suggest an explicit recurrent procedure for finding the change of parameters and equivalence transformation in the reduction of a given family to the versal deformation. As an application, we analyze the uncontrollability set in the space of parameters for a one-input second order linear system.
Noisy Iris Verification: A Modified Version of Local Intensity Variation Method
Authors: Nima Tajbakhsh, Babak Nadjar Araabi, Hamid Soltanian-Zadeh
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

In this paper, a modified version of local intensity variation method is proposed to enhance the efficiency of identification system while dealing with degradation factors presented in iris texture. Our contributions to improve the robustness and performance of local intensity variation method consist of defining overlapped patches to compensate for deformation of texture, performing a de-noising strategy to remove high frequency components of intensity signals, proposing to add a coding strategy, and combining the dissimilarity values obtained from intensity signals. Experimental results on UBIRIS database demonstrate the effectiveness of proposed method when facing low quality images. To assess the robustness of proposed method to noise, lack of focus, and motion blur, we simulate these degradation factors that may occur during image acquisition in non-ideal conditions. Our results on a private database show that verification performance remains acceptable while the original method [11] suffers from a dramatic degradation.
Characterization and modeling of electro-thermal MEMS structures
Authors: P&#x00e9;ter G&#x00e1;bor Szab&#x00f3;, Vladim&#x00ed;r Sz&#x00e9;kely
Venue: Microsystem Technologies (2009)

Thermal functional circuits are an interesting group of the MEMS elements with high a potential. A practical realisation is called Quadratic Transfer Characteristics (QTC) element of which driving principle is the Seebeck effect. Such devices can be applied e.g. as RMS meters. In this paper we are dealing with the analyses of a QTC element from different perspectives. A family of compact models is presented. These models are suitable to use in network simulation programs. To investigate the detailed behaviour of the device, we measured a few secondary properties of the structure, such as temperature dependence, cut-off frequency and non-quadratic error.
An approach to multiattribute decision making with interval-valued intuitionistic fuzzy assessments and incomplete weights
Authors: Zhoujing Wang, Kevin W. Li, Weize Wang
Venue: Information Sciences: an International Journal (2009)

This article proposes an approach to multiattribute decision making with incomplete attribute weight information where individual assessments are provided as interval-valued intuitionistic fuzzy numbers (IVIFNs). By employing a series of optimization models, the proposed approach derives a linear program for determining attribute weights. The weights are subsequently used to synthesize individual IVIFN assessments into an aggregated IVIFN value for each alternative. In order to rank alternatives based on their aggregated IVIFN values, a novel method is developed for comparing two IVIFNs by introducing two new functions: the membership uncertainty index and the hesitation uncertainty index. An illustrative investment decision problem is employed to demonstrate how to apply the proposed procedure and comparative studies are conducted to show its overall consistency with existing approaches.
Architecture for effective personalised web search
Authors: S. Sendhilkumar, T. V. Geetha
Venue: International Journal of Computer Applications in Technology (2009)

The major problem faced by the users of web search is the quality and quantity of the results return by any search engine. Personalisation is a popular remedy for this problem. There are many factors that affect personalisation and many systems have been proposed to address a specific issue of personalisation in web search. No single system exists in literature that incorporates the entire spectrum of factors that affect personalisation of web search. This paper aims towards providing an architecture that integrates the various personalisation factors for effective search through the world wide web.
Plenary lecture 5: real-time fuzzy digital filters: basic concepts
Authors: Jesus Medel
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

The Real-time Fuzzy Digital Filters (RTFDF) concepts considering the fuzzy logic description, adaptive digital filters and Real-time constrains. The main characteristic operation of this class of filters is bounded by a region knew as linguistic natural knowledge base including all possible combinations results. Illustratively speaking, the computational output signals system classified with respect to desired answers in linguistic natural form, requiring to establish the membership function set due to natural computational interaction respect to linguistic output communication. The RTFDF requires a rules group inside of the knowledge base, typically described by logic connectors; considering the quality answers into natural languages, and the interaction constrains with adaptive properties. The basic results will be described in formal sense, using definitions, considering Nyquist, Shannon, Zadeh and Passino criteria into convolution filter scheme.
Characterizing the association between mobile users using wireless network traces
Authors: Pierrot Chery, Jiang Li, Legand L. Burge,  III
Venue: The Fifth Richard Tapia Celebration of Diversity in Computing Conference: Intellect, Initiatives, Insight, and Innovations (2009)

In Delay Tolerant Networks (DTN), the performance heavily depends on the association between mobile users, which decides how frequently the users meet with each other. It is therefore very important to understand the association. In this paper, by analyzing a number of wireless network traces, we verified the exponential distribution of the association of mobile users, which means that most mobile users are not closely associated. Furthermore, we examined the distribution of the inter-connectivity time of those mobile users more closely associated.
Scheduling identical parallel machines and operators within a period based changing mode
Authors: M. Zouba, P. Baptiste, D. Rebaine
Venue: Computers and Operations Research (2009)

This article addresses the problem of scheduling n non-preemptive jobs on m identical parallel machines with @w operators to minimize the makespan. The number of operators is less than the number of machines. As a result, it may happen that an operator has to supervise simultaneously several machines. This in turn has an impact on the job processing times as they become a function of the operators modus operandi. In this paper we consider the case where each modus operandi can only be changed at the end of a given period, i.e., a period based changing mode. We present heuristic algorithms to solve this problem. An experimental study is conducted to evaluate the performance of these heuristics in the average case, and a worst case analysis is presented for one of them.