ppxscal/embedding_network huggingface dataset:
Graphical Concrete Syntax Rendering with SVG
Authors: Frédéric Fondement
Venue: Proceedings of the 4th European conference on Model Driven Architecture: Foundations and Applications (2008)

Model-based techniques place modeling at the cornerstone of software development. Because of the large number of domains and levels of abstraction one can find in software systems, a large number of modeling languages is necessary. Modeling languages need to be properly defined regarding concrete syntax in addition to abstract syntax and semantics. Most modeling languages use a graphical concrete syntax, and solutions to model those syntaxes appeared. If those solutions are convincing to support the rapid development of graphical modeling tools, they are often restrictive in the range of possible concrete syntaxes for a given abstract syntax, and rely on dedicated technologies. In previous works, we proposed such a solution based on a representation model which was more flexible in that it abstracted away purely graphical concerns. Those concerns include actual design for representation icons, how the design reacts to representation variations within the icons, possible interactions with an icon, and synchronization between the graphical representation and the graphical model. In this paper, we show how to solve those four last points using the SVG open standard for vector graphics. We propose to define representation icons by SVG templates complemented by layout constraints, a predefined and extensible library of possible user interactions using DOM, and a specific approach based on events to synchronize the graphical representation with the graphical model. Thus, our solution solves the concrete realization of an modeling environment cumulating advantages of a clear separation between abstract and concrete syntaxes at the modeling level, while benefiting from the expertise of the vector graphics community.
An Experimental Investigation of the Congestion Control Used by Skype VoIP
Authors: Luca Cicco, Saverio Mascolo, Vittorio Palmisano
Venue: Proceedings of the 5th international conference on Wired/Wireless Internet Communications (2007)

The explosive growth of VoIP traffic poses a potential challenge to the stability of the Internet that, up to now, has been guaranteed by the TCP congestion control. In this paper, we investigate how Skype behaves in the presence of time-varying available bandwidth in order to discover if some sort of congestion control mechanism is implemented at the application layer to match the network available bandwidth and cope with congestion. We have found that Skype flows are somewhat elastic, i.e. they employ some sort of congestion control when sharing the bandwidth with unresponsive flows, but are inelastic in the presence of classic TCP responsive flows, which provokes extreme unfair use of the available bandwidth in this case. Finally, we have found that when more Skype calls are established on the same link, they are not able to adapt their sending rate to correctly match the available bandwidth, which would confirm the risk of network congestion collapse.
DObjects: Enabling Distributed Data Services for Metacomputing Platforms
Authors: Pawel Jurczyk, Li Xiong, Vaidy Sunderam
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Many applications rely heavily on large amounts of data in the distributed storages collected over time or produced by large scale scientific experiments or simulations. The key constraints for building a distributed data query infrastructure for such applications are: scalability, consistency, heterogeneity and network and resource dynamics. We designed and developed DObjects, a general-purpose query and data operations infrastructure that can be integrated with metacomputing middleware. This paper describes the architecture of our data services and shows how those services were integrated with the metacomputing framework offering users an open platform for building distributed applications that require access to data integrated from multiple distributed data sources.
A New Stochastic Framework for Accurate Lung Segmentation
Authors: Ayman El-Ba, Georgy Gimel'Farb, Robert Falk, Trevor Holland, Teresa Shaffer
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

New techniques for more accurate unsupervised segmentation of lung tissues from Low Dose Computed Tomography (LDCT) are proposed. In this paper we describe LDCT images and desired maps of regions (lung and the other chest tissues) by a joint Markov-Gibbs random field model (MGRF) of independent image signals and interdependent region labels but focus on most accurate model identification. To better specify region borders, each empirical distribution of signals is precisely approximated by a Linear Combination of Discrete Gaussians (LCDG) with positive and negative components. We modify a conventional Expectation-Maximization (EM) algorithm to deal with the LCDG and develop a sequential EM-based technique to get an initial LCDG-approximation for the modified EM algorithm. The initial segmentation based on the LCDG-models is then iteratively refined using a MGRF model with analytically estimated potentials. Experiments on real data sets confirm high accuracy of the proposed approach.
Term-Graph Rewriting Via Explicit Paths
Authors: Emilie Balland, Pierre-Etienne Moreau
Venue: Proceedings of the 19th international conference on Rewriting Techniques and Applications (2008)

The notion of path is classical in graph theory but not directly used in the term rewriting community. The main idea of this work is to raise the notion of path to the level of first-order terms, i.e. paths become part of the terms and not just meta-information about them. These paths are represented by words of integers (positive or negative) and are interpreted as relative addresses in terms. In this way, paths can also be seen as a generalization of the classical notion of position for the first-order terms and are inspired by de Bruijn indexes.In this paper, we define an original framework called Referenced Term Rewriting where paths are used to represent pointers between subterms. Using this approach, any term-graph rewriting systems can be simulated using a term rewrite-based environment.
Prediction of RNA-Binding Residues in Proteins Using the Interaction Propensities of Amino Acids and Nucleotides
Authors: Rojan Shrestha, Jisu Kim, Kyungsook Han
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Recently several machine learning approaches have been attempted to predict RNA-binding residues in amino acid sequences. None of these consider interacting partners (i.e., RNA) for a given protein when predicting RNA-binding amino acids, so they always predict the same RNA-binding residues for a given protein even if the protein may bind to different RNA molecules. In this study, we present a support vector machine (SVM) classifier that takes an RNA sequence as well as a protein sequence as input and predicts potential RNA-binding residues in the protein. The interaction propensity between an amino acid and nucleotide obtained from the extensive analysis of the representative protein-RNA complexes in the Protein Data Bank (PDB) was encoded in the feature vector of the SVM classifier. Four biochemical properties of an amino acid (the side chain pKa value, hydrophobicity index, molecular mass, and accessible surface area) were also encoded in the feature vector. On a dataset of 145 protein sequences and 78 RNA sequences, the SVM classifier achieved a sensitivity of 72.30% and specificity of 78.03%.
A Cooperative Simulation Framework for Traffic and Transportation Engineering
Authors: Paulo A. Ferreira, Edgar F. Esteves, Rosaldo J. Rossetti, Eugénio C. Oliveira
Venue: Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering (2008)

As contemporary intelligent transportation systems are becoming a reality in our everyday's life and future urban transportation brings about concerns of a wide range of new performance measures, multidisciplinary teams are more and more faced with the need to work collaboratively so as to meet those demands. This paper reports on the specification of the MAS-T2er Lab framework, emphasising on its ability to support collaborative simulation and different perspective analyses of the complex and dynamic application domain of traffic and transportation in major urban areas. The architecture underlying all subsystems within the framework is discussed on the basis of the multi-agent systems metaphor, and a practical overview of its use is presented.
Edge Matching Puzzles as Hard SAT/CSP Benchmarks
Authors: Carlos Ansótegui, Ramón Béjar, César Fernàndez, Carles Mateu
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

Recently, edge matching puzzles, an NP-complete problem, have received, thanks to money-prized contests, considerable attention from wide audiences. This paper studies edge matching puzzles focusing on providing generation models of problem instances of variable hardness and on its resolution through the application of SAT and CSP techniques. From the generation side, we also identify the phase transition phenomena for each model. As solving methods, we employ both; SAT solvers through the translation to a SAT formula, and two ad-hoc CSP solvers we have developed, with different levels of consistency, employing generic and specialized heuristics. Finally, we conducted an extensive experimental investigation to identify the hardest generation models and the best performing solving techniques.
Towards Trust-Based Acquisition of Unverifiable Information
Authors: Eugen Staab, Volker Fusenig, Thomas Engel
Venue: Proceedings of the 12th international workshop on Cooperative Information Agents XII (2008)

We present a trust-based mechanism for the acquisition of information from possibly unreliable sources. Our mechanism addresses the case where the acquired information cannot be verified. The idea is to intersperse questions ("challenges") for which the correct answers are known. By evaluating the answers to these challenges, probabilistic conclusions about the correctness of the unverifiable information can be drawn. Less challenges need to be used if an information provider has shown to be trustworthy. This work focuses on three major issues of such a mechanism. First, how to estimate the correctness of the unverifiable information. Second, how to determine an optimal number of challenges. And finally, how to establish trust and use it to reduce the number of challenges. Our approach can resist collusion and shows great promise for various application areas such as distributed computing or peer-to-peer networks.
Electric dipole polarizabilities and C$_6$ dipole-dipole dispersion coefficients for alkali metal clusters and C$_{60}$
Authors: Auayporn Jiemchooroj, Bo E. Sernelius, Patrick Norman
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

The frequency dependent polarizabilities of closed-shell alkali metal clusters containing up to ten lithium, potassium, and rubidium atoms have been calculated using the linear complex polarization propagator approach in conjunction with Hartree - Fock and Kohn - Sham density functional theory. In combination with polarizabilities for C$_{60}$ from a previous work [J. Chem. Phys. 123, 124312 (2005)], the C$_6$ dipole-dipole dispersion coefficients for the metal cluster-to-cluster and cluster-to-buckminster fullerene interactions are obtained via the Casimir - Polder relation. The B3PW91 results for the polarizabilities and dispersion interactions of the alkali metal dimers and tetramers are benchmarked against couple cluster calculations, and the whole series of calculations are compared against the corresponding work on sodium clusters [J. Chem. Phys. 125, 124306 (2006)]. The error bars of the reported theoretical results for the C$_6$ coefficients are estimated to be 8%.
Mixin' up the ML module system
Authors: Derek Dreyer, Andreas Rossberg
Venue: ACM SIGPLAN Notices (2008)

ML modules provide hierarchical namespace management, as well as fine-grained control over the propagation of type information, but they do not allow modules to be broken up into mutually recursive, separately compilable components. Mixin modules facilitate recursive linking of separately compiled components, but they are not hierarchically composable and typically do not support type abstraction. We synthesize the complementary advantages of these two mechanisms in a novel module system design we call MixML. A MixML module is like an ML structure in which some of the components are specified but not defined. In other words, it unifies the ML structure and signature languages into one. MixML seamlessly integrates hierarchical composition, translucent MLstyle data abstraction, and mixin-style recursive linking. Moreover, the design of MixML is clean and minimalist; it emphasizes how all the salient, semantically interesting features of the ML module system (as well as several proposed extensions to it) can be understood simply as stylized uses of a small set of orthogonal underlying constructs, with mixin composition playing a central role.
All-pairs shortest-paths for large graphs on the GPU
Authors: Gary J. Katz, Joseph T. Kider,  Jr
Venue: Proceedings of the 23rd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware (2008)

The all-pairs shortest-path problem is an intricate part in numerous practical applications. We describe a shared memory cache efficient GPU implementation to solve transitive closure and the all-pairs shortest-path problem on directed graphs for large datasets. The proposed algorithmic design utilizes the resources available on the NVIDIA G80 GPU architecture using the CUDA API. Our solution generalizes to handle graph sizes that are inherently larger then the DRAM memory available on the GPU. Experiments demonstrate that our method is able to significantly increase processing large graphs making our method applicable for bioinformatics, internet node traffic, social networking, and routing problems.
Representations of Multi-Model Based Controllers by Using Artificial Intelligence Tools
Authors: Asier Ibeas, Manuel de la Sen
Venue: Informatica (2004)

This paper develops a representation of multi-model based controllers by using artificial intelligence typical structures. These structures will be neural networks, genetic algorithms and fuzzy logic. The interpretation of multimodel controllers in an artificial intelligence frame will allow the application of each specific technique to the design of improved multimodel based controllers. The obtained artificial intelligence based multimodel controllers are compared with classical single model based ones. It is shown through simulation examples that a transient response improvement can be achieved by using multiestimation based techniques. Furthermore, a method for synthesizing multimodel based neural network controllers from already designed single model based ones is presented. The proposed methodology allows to extend the existing single model based neural controllers to multimodel based ones, extending the applicability of this kind of techniques to a more general type of controllers. Also, some applications of genetic algorithms and fuzzy logic to multimodel controller design are proposed. Thus, the mutation operation from genetic algorithms inspires a robustness test which consists of a random modification of the estimates which is used to select the estimates leading to the better identification performance towards parameterizing online the adaptive controller. Such a test is useful for plants operating in a noisy environment. The proposed robustness test improves the selection of the plant model used to parameterize the adaptive controller in comparison to classical multimodel schemes where the controller parameterization choice is basically taken based on the identification accuracy of each model. Moreover, the fuzzy logic approach suggests new ideas to the design of multiestimation structures which can be applied to a broad variety of adaptive controllers such as robotic manipulator controller design.
Dirichlet degrees of freedom need not be eliminated
Authors: J. Maubach
Venue: Applied Numerical Mathematics (2008)

Dirichlet degrees of freedom are often eliminated from discretized initial value boundary value equations. This has advantages (creation of a symmetric system of equations and simplification of the equations) and a potential disadvantage (modification of the equations could lead to a more complex and less convenient implementation). This paper demonstrates that no elimination is needed to keep all elimination-related advantages - if one uses standard iterative solution techniques in a proper manner.
Operating Systems for the Micronet Network Computer
Authors: Andre Van Tilborg, Larry Wittie
Venue: IEEE Micro (1983)

The Micros operating system executes on a modular multimicroprocessor system. It provides system-wide high-level control as well as local operating systems for individual nodes.
Mendel: A Model, Metrics, and Rules to Understand Class Hierarchies
Authors: Simon Denier, Yann-Gaël Guéhéneuc
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

Inheritance is an important mechanism when developing object-oriented programs with class-based programming languages: it enables subtyping, polymorphism, and code reuse. Inheritance is also known as a difficult feature to grasp and to use correctly because of its many purposes. We propose a model of inheritance to help understand class hierarchies of class-based object-oriented programs. We define metrics and rules to highlight interesting classes and behaviours with respect to inheritance. Thus, we provide the programmer with insight on how inheritance is used in a program. We illustrate our approach on JHotDraw and validate it further on three other programs: ArgoUML, Azureus, and Log4J. We also show thatour model can describe existing rules, such as micro patterns.
Participative Approaches for "Technology and Autonomous Living"
Authors: Ulrike Bechtold, Mahshid Sotoudeh
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

This contribution aims to identify which conditions are to be met in accordance with social needs and users' perspectives on technical solutions facilitating autonomous living. In the following, different participative approaches will be proposed for improving the user friendliness of assistive technologies. To achieve this it is important to know what areas of life are affected by Assistive Technologies (AT) and who should be involved at what stage of the research and (product) development process. Consequently, this paper investigates ways of shaping the information and knowledge transfer between technology users as people with special needs and technology developers.
Quality factor for band-pass filters designed with CPW resonators using J/K-inverter
Authors: Sova Mihai
Venue: Proceedings of the 6th WSEAS International Conference on Applied Electromagnetics, Wireless and Optical (2008)

This paper describes the way of determining quality factor for the case of coplanar waveguide resonators using J/K-inverters. The model for single case resonator is simulated, realized and measured using numerical formulas, ADS Momentum software and vector network analyzer.
A Formal Framework for Expressing Trust Negotiation in the Ubiquitous Computing Environment
Authors: Deqing Zou, Jong Hyuk Park, Laurence Tianruo Yang, Zhensong Liao, Tai-Hoon Kim
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

There are lots of entities in the ubiquitous computing environment. For the traditional public key Infrastructure (PKI), every entity should be signed a valid certificate by the certificate authentication center. However, it's hard to construct a centralized trust management framework and assign a valid certificate for every entity in the ubiquitous computing environment because of large numbers of dynamic entities. Trust negotiation (TN) is an important means to establish trust between strangers in ubiquitous computing systems through the exchange of digital credentials and mobile access control policies specifying what combinations of credentials a stranger must submit. Current existing TN technologies, such as TrustBuilder and KeyNote, focused on how to solve a certain problem by using some special techniques. In this paper, we present a formal framework for expressing trust negotiation. The framework specifies the basic concepts, elements and the semantics of TN. By analyzing TN, we point out how to build a TN system in practice.
Comparative Technical Study of Two Generations of CR Plates for Digital Mammography
Authors: Hilde Bosmans, Kim Lemmens, Jurgen Jacobs, Beatrijs Verbrugge, Koen Michielsen, Federica Zanca, Joris Nens, Chantal Ongeval, Guy Marchal
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

The performance that can be achieved with CR plates for mammographic applications can be influenced by 2 main components: (1) the performance of plate and reader, and (2) the X-ray beam quality and intensity. Present study investigates a prototype CR plate with a crystal based phosphor layer, as produced by Konica Minolta, in a comparative set-up with a commercially available CR plate of the same company. The following system tests were performed: contrast-detail analysis, system MTF and noise power evaluations. The results reveal that the new CR plate outperforms the older plate. Similar levels of quality can be achieved with a 26% lower dose. The contrast-detail analysis shows better results for the W/Rh anode filter combination than for Mo/Mo and Mo/Rh. Therefore higher beam qualities may be promising candidates for use in clinical practice. It may be recommendable to work in practice at the same dose settings as with the actually available plates and thus benefit from better image quality.
Performance estimation of an email contact center by a finite source discrete time Geo/Geo/1 queue with disasters
Authors: F. Jolai, S. M. Asadzadeh, M. R. Taghizadeh
Venue: Computers and Industrial Engineering (2008)

In this paper, we model and analyze an email contact center as a queuing system. This queue system is a finite source discrete time Geo/Geo/1/~/N queue with disasters. The arrival process of ordinary customers (OCs) and disasters and service process are mutually independent and geometrically distributed. Disasters in this system cause the system to be empty at once. The main contribution of the paper is to model a clearing mechanism in a real finite source system with the aid of disasters. The system states are a Markov chain and we develop a numerical scheme to compute the steady state probabilities of the system. Some of the performance measures of the system are calculated. At the end numerical illustrations show how sensitive the system performance measures are when parameters of the system change.