ppxscal/embedding_network huggingface dataset:
High-resolution 3D spatial modelling of complex geological structures for an environmental risk assessment of abundant mining and industrial megasites
Authors: P. Wycisk, T. Hubert, W. Gossel, Ch. Neumann
Venue: Computers Geosciences (2009)

Conceptual geological models of industrial and mining megasites are an essential task of groundwater investigations as well as environmental risk assessment studies. Therefore, the conceptualization process of the structural geological model has depended on the development of a set of 2D cross-sections to portray a 3D picture of groundwater flow. This attempt always includes some simplifications that require, only to some extent, the true 3D situation of heterogeneous aquifers. Consequently, the modelled predictions of the path flow and transport conditions of contaminated groundwater are not satisfying in terms of a flow-path and risk based modelling approach. A more structured approach to develop the hydrogeological framework for the conceptual model is advocated, using different 3D geological modelling software packages to assemble the data, working in three dimensions and using this platform for subsequent groundwater flow modelling. Attention is given to the capability of different 3D modelling approaches, indicated by geostatistically based versus constructive cross-section based interpolations of complex sedimentary successions, that are compared in their results and suitability for subsequent hydrogeological modelling requirements. The paper describes the results, in high-resolution 3D modelling, of the complex geological environment of the Bitterfeld/Wolfen megasite in the eastern part of Germany. Identification, assessment, and remediation of large-scale groundwater contamination require a detailed knowledge of the heterogeneous geological structure to predict the fate and pathways of contaminants and their potential interaction with, e.g., surface water. An area of 16km^2 of the model area of the Bitterfeld/Wolfen area was chosen to transfer the complex structural geological setting. The subsurface geology could be assigned to 31 lithostratigraphic units and depicted using a 10x10m GIS grid. This constructive and ''knowledge-driven'' 3D modelling allows the prediction of vertical and horizontal sections, visualization purposes, volumetric calculations of distinct sedimentary units, GIS applications, and the use of the detailed digital information within the subsequent flow and transport groundwater modelling. The high-resolution digital 3D model improves the hydrogeological modelling results. It is considered a basic requirement for groundwater modelling and investigations on environmental risk and impact assessment by fate, and pathway exposure route analysis of the complex geological and groundwater situations.
Semantic annotation and linking of competitive intelligence reports for business clusters
Authors: Jan Nemrava, Tomáš Kliegr, Vojtěch Svátek, Martin Ralbovský, Jiří Šplíchal, Tomáš Vejlupek
Venue: Proceedings of the first international workshop on Ontology-supported business intelligence (2008)

Competitive intelligence (CI) is a sub-discipline of business intelligence that supports the decision makers in understanding the competitive environment by means of textual reports prepared based on public resources. CI is particularly demanding in the context of larger business clusters. We report on a long-term project featuring large-scale manual semantic annotation of CI reports wrt. business clusters in several industries. The underlying ontologies are the result of collaborative editing by multiple student teams. The results of annotation are finally merged into CI maps that allow easy access to both the original documents and the knowledge structures.
A three-dimensional characterization space of software components for rapidly developing multimodal interfaces
Authors: Marcos Serrano, David Juras, Laurence Nigay
Venue: Proceedings of the 10th international conference on Multimodal interfaces (2008)

In this paper we address the problem of the development of multimodal interfaces. We describe a three-dimensional characterization space for software components along with its implementation in a component-based platform for rapidly developing multimodal interfaces. By graphically assembling components, the designer/developer describes the transformation chain from physical devices to tasks and vice-versa. In this context, the key point is to identify generic components that can be reused for different multimodal applications. Nevertheless for flexibility purposes, a mixed approach that enables the designer to use both generic components and tailored components is required. As a consequence, our characterization space includes one axis dedicated to the reusability aspect of a component. The two other axes of our characterization space, respectively depict the role of the component in the data-flow from devices to tasks and the level of specification of the component. We illustrate our three dimensional characterization space as well as the implemented tool based on it using a multimodal map navigator.
Web-based laboratory network management system that integrates multiple servers
Authors: Takao Shimomura, Quan Liang Chen, Nhor Sok Lang, Kenji Ikeda
Venue: WSEAS Transactions on Information Science and Applications (2007)

There are some tools that help system administrators administer machines and networks using graphical user interface and Web interface. This paper presents a Web-based system that automates some processes to connect machines to a network, create accounts, mount remote home directories, set mailing lists, and so on by cooperating with multiple servers, and describes its implementation. By introducing this novel system, a lot of task has been reduced compared with the conventional administrative tasks, and it has become easier for users to create and change their own accounts and connect their machines to the network without login.
Gaussian process modelling of latent chemical species
Authors: Pei Gao, Antti Honkela, Magnus Rattray, Neil D. Lawrence
Venue: Bioinformatics (2008)

Motivation: Inference of latent chemical species in biochemical interaction networks is a key problem in estimation of the structure and parameters of the genetic, metabolic and protein interaction networks that underpin all biological processes. We present a framework for Bayesian marginalization of these latent chemical species through Gaussian process priors. Results: We demonstrate our general approach on three different biological examples of single input motifs, including both activation and repression of transcription. We focus in particular on the problem of inferring transcription factor activity when the concentration of active protein cannot easily be measured. We show how the uncertainty in the inferred transcription factor activity can be integrated out in order to derive a likelihood function that can be used for the estimation of regulatory model parameters. An advantage of our approach is that we avoid the use of a coarsegrained discretization of continuous time functions, which would lead to a large number of additional parameters to be estimated. We develop exact (for linear regulation) and approximate (for non-linear regulation) inference schemes, which are much more efficient than competing sampling-based schemes and therefore provide us with a practical toolkit for model-based inference. Availability: The software and data for recreating all the experiments in this paper is available in MATLAB from http://www.cs.man.ac.uk/~neill/gpsim. Contact: neill@cs.man.ac.uk
Pathline predicates and unsteady flow structures
Authors: Tobias Salzbrunn, Christoph Garth, Gerik Scheuermann, Joerg Meyer
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

In most fluid dynamics applications, unsteady flow is a natural phenomenon and steady models are just simplifications of the real situation. Since computing power increases, the number and complexity of unsteady flow simulations grows, too. Besides time-dependent features, scientists and engineers are essentially looking for a description of the overall flow behavior, usually with respect to the requirements of their application domain. We call such a description a flow structure, requiring a framework of definitions for an unsteady flow structure. In this article, we present such a framework based on pathline predicates. Using the common computer science definition, a predicate is a Boolean function, and a pathline predicate is a Boolean function on pathlines that decides if a pathline has a property of interest to the user. We will show that any suitable set of pathline predicates can be interpreted as an unsteady flow structure definition. The visualization of the resulting unsteady flow structure provides a visual description of overall flow behavior with respect to the user&#x2019;s interest. Furthermore, this flow structure serves as a basis for pathline placements tailored to the requirements of the application.
Constrained physical design tuning
Authors: Nicolas Bruno, Surajit Chaudhuri
Venue: Proceedings of the VLDB Endowment (2008)

Existing solutions to the automated physical design problem in database systems attempt to minimize execution costs of input workloads for a given a storage constraint. In this paper, we argue that this model is not flexible enough to address several real-world situations. To overcome this limitation, we introduce a constraint language that is simple yet powerful enough to express many important scenarios. We build upon an existing transformation-based framework to effectively incorporate constraints in the search space. We then show experimentally that we are able to handle a rich class of constraints and that our proposed technique scales gracefully.
On Structural Analysis of Parliamentarian Voting Data
Authors: Tomas Krilavičius, Antanas Žilinskas
Venue: Informatica (2008)

We investigate applicability of quantitative methods to discover the most fundamental structural properties of the most reliable political data in Lithuania. Namely, we analyze voting data of the Lithuanian Parliament. Two most widely used techniques of structural data analysis (clustering and multidimensional scaling) are compared. We draw some technical conclusions which can serve as recommendations in more purposeful application of these methods.
Tiara: A Self-stabilizing Deterministic Skip List
Authors: Thomas Clouser, Mikhail Nesterenko, Christian Scheideler
Venue: Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems (2008)

We present Tiara -- a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We rigorously prove the algorithm correct in the shared register model. We then describe its extension to a ring and incorporation of crash tolerance.
On the zero-rate error exponent for a BSC with noisy feedback
Authors: M. V. Burnashev, H. Yamamoto
Venue: Problems of Information Transmission (2008)

For information transmission, a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes (without delay) all outputs of the forward channel via the feedback channel. Transmission of non-exponentially many messages is considered (i.e., the transmission rate is zero). The achievable decoding error exponent for this combination of channels is investigated. It is shown that if the crossover probability of the feedback channel is less than a certain positive value, then the achievable error exponent is better than the similar error exponent of the no-feedback channel. The described transmission method and the corresponding lower bound for the error exponent can be improved, as well as extended to positive transmission rates.
Set based logic programming
Authors: H. A. Blair, V. W. Marek, J. B. Remmel
Venue: Annals of Mathematics and Artificial Intelligence (2008)

In a previous paper (Blair et al. 2001), the authors showed that the mechanism underlying Logic Programming can be extended to handle the situation where the atoms are interpreted as subsets of a given space X. The view of a logic program as a one-step consequence operator along with the concepts of supported and stable model can be transferred to such situations. In this paper, we show that we can further extend this paradigm by creating a new one-step consequence operator by composing the old one-step consequence operator with a monotonic idempotent operator (miop) in the space of all subsets of X, 2 X . We call this extension set based logic programming. We show that such a set based formalism for logic programming naturally supports a variety of options. For example, if the underlying space has a topology, one can insist that the new one-step consequence operator always produces a closed set or always produces an open set. The flexibility inherent in the semantics of set based logic programs is due to both the range of natural choices available for specifying the semantics of negation, as well as the role of monotonic idempotent operators (miops) as parameters in the semantics. This leads to a natural type of polymorphism for logic programming, i.e. the same logic program can produce a variety of outcomes depending on the miop associated with the semantics. We develop a general framework for set based programming involving miops. Among the applications, we obtain integer-based representations of real continuous functions as stable models of a set based logic program.
Semantic reclassification of the UMLS concepts
Authors: Jung-Wei Fan, Carol Friedman
Venue: Bioinformatics (2008)

Summary: Accurate semantic classification is valuable for text mining and knowledge-based tasks that perform inference based on semantic classes. To benefit applications using the semantic classification of the Unified Medical Language System (UMLS) concepts, we automatically reclassified the concepts based on their lexical and contextual features. The new classification is useful for auditing the original UMLS semantic classification and for building biomedical text mining applications. Availability: http://www.dbmi.columbia.edu/~juf7002/reclassify_production Contact: fan@dbmi.columbia.edu Supplementary information: Supplementary data is available at http://www.dbmi.columbia.edu/~juf7002/reclassify_production.
Convexity of chance constraints with independent random variables
Authors: René Henrion, Cyrille Strugarek
Venue: Computational Optimization and Applications (2008)

We investigate the convexity of chance constraints with independent random variables. It will be shown, how concavity properties of the mapping related to the decision vector have to be combined with a suitable property of decrease for the marginal densities in order to arrive at convexity of the feasible set for large enough probability levels. It turns out that the required decrease can be verified for most prominent density functions. The results are applied then, to derive convexity of linear chance constraints with normally distributed stochastic coefficients when assuming independence of the rows of the coefficient matrix.
Practical issues with using network tomography for fault diagnosis
Authors: Yiyi Huang, Nick Feamster, Renata Teixeira
Venue: ACM SIGCOMM Computer Communication Review (2008)

This paper investigates the practical issues in applying network tomography to monitor failures. We outline an approach for selecting paths to monitor, detecting and confirming the existence of a failure, correlating multiple independent observations into a single failure event, and applying existing binary networking tomography algorithms to identify failures. We evaluate the ability of network tomography algorithms to correctly detect and identify failures in a controlled environment on the VINI testbed.
Application of interfacial fracture mechanics approach for obtaining design rules for flip chip interconnections
Authors: M. Dre&#x00df;ler, K-F. Becker, B. Wunderle, J. Auersperg, H. Reichl
Venue: Microsystem Technologies (2008)

The reliability of an electronic package can be described by a physics-of-failure approach. Crack initiation and propagation in the bulk material and interface leads to catastrophic mechanical and finally to electrical failure. Therefore, bulk and interfacial fracture mechanics is a suitable method to describe the reliability of an electronic package. As package, a stud bump bonding flip chip interconnection on a thermoplastic substrate material [liquid crystal polymer (LCP)] is studied. The paper focuses on the description of the interfacial cracking between the underfill and the LCP. This is used to obtain design rules for flip chip interconnection on LCP by means of finite element analysis. Geometry design parameters&#x2014;fillet shape, chip and substrate sizes&#x2014;are studied. Moreover, the influence of material properties of the substrate and underfill are investigated. The impacts of the parameters are evaluated by analyzing the energy release rate (ERR) and mode-mixity in the interface. For determination of the critical ERR as function of the mode-mixity, a modified button shear test is utilized. The button, made out of underfill, is cured on the LCP substrate. A pre-delamination is established using a Teflon strip. The critical ERR for different mode-mixities is obtained by varying the shearing height of the button test. Additional, the influence of oxygen plasma treatment of the LCP substrate on the interfacial cracking is taken into account. In the investigation, design rules for increasing the reliability of flip chip interconnections are obtained. Moreover, a modified button-test is applied to obtain critical energy releases rates for different mode-mixities for the interface underfill/LCP. These results are used to optimize the geometry and materials of flip chip interconnections for automotive sensor applications in respect to delamination risk between substrate and underfill.
Animation and Interactive Programming: A Practical Approach
Authors: Phillip Benachour, Reuben Edwards
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

This paper describes a work in progress of using animation software tools to teach programming principles. The motivation behind this work is to encourage students in higher education who do not see themselves as serious programmers to engage with some of the concepts and methods used in the teaching of programming. In addition this work was used in workshops to engage with local and regional secondary schools focussing on the use of animation as a tool for learning programming principles. The results presented in this paper are based on feedback from first year undergraduate students. Initial feedback from teachers, pupils and schools has been very positive and requests for additional visits have been made. This has created an opportunity to further engage with these schools for additional workshops. Analysis and feedback from these schools will be presented in the workshop.
Interorganizational partnership, switching cost, and strategic flexibility in supply chain
Authors: Jao-Hong Cheng, Chih-Huei Tang, Huei-Ping Chen
Venue: WSEAS Transactions on Information Science and Applications (2008)

Many studies work focusing on the interaction between the various dimensions of supply chain (SC) relationships (such as trust, commitment, satisfaction, investment, communication and collaboration) but far less on the impact of SC relationships on switching cost and strategic flexibility. The partnership interaction between the SC and the strategic flexibility is the most important factor when the manufacturer and subcontractors linked together. However, there has also been a few empirical researches that have examined the impact of switching cost and strategic flexibility. The effect of SC relationships on strategic flexibility has received less attention. As a result, it becomes the key issue in this study. To address these situations, we developed a conceptual framework incorporating dimensions of SC relationships, switching cost, and strategic flexibility. Data is drawn from the survey responses of 202 in Taiwan enterprises. Our findings provide considerable support for our conceptual model.
Scalable multi-query optimization for exploratory queries over federated scientific databases
Authors: Anastasios Kementsietsidis, Frank Neven, Dieter Van de Craen, Stijn Vansummeren
Venue: Proceedings of the VLDB Endowment (2008)

The diversity and large volumes of data processed in the Natural Sciences today has led to a proliferation of highly-specialized and autonomous scientific databases with inherent and often intricate relationships. As a user-friendly method for querying this complex, ever-expanding network of sources for correlations, we propose exploratory queries. Exploratory queries are loosely-structured, hence requiring only minimal user knowledge of the source network. Evaluating an exploratory query usually involves the evaluation of many distributed queries. As the number of such distributed queries can quickly become large, we attack the optimization problem for exploratory queries by proposing several multi-query optimization algorithms that compute a global evaluation plan while minimizing the total communication cost, a key bottleneck in distributed settings. The proposed algorithms are necessarily heuristics, as computing an optimal global evaluation plan is shown to be NP-hard. Finally, we present an implementation of our algorithms, along with experiments that illustrate their potential not only for the optimization of exploratory queries, but also for the multiquery optimization of large batches of standard queries.
Surprising Areas in the Quest for Small Universal Devices
Authors: Maurice Margenstern
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

In this paper, we study a few points indicated in the talk which we presented at MFCSIT meeting in Cork. Our study concerns three main areas: Turing machines, cellular automata and hyperbolic cellular automata. The common thread is the quest for small universal devices. It leads from properties belonging to the classical domain up to results on super-Turing computations.
Robust convergence of a compact fourth-order finite difference scheme for reaction&#x2013;diffusion problems
Authors: Torsten Lin&#x00df;
Venue: Numerische Mathematik (2008)

We consider a singularly perturbed one-dimensional reaction&#x2013;diffusion problem with strong layers. The problem is discretized using a compact fourth order finite difference scheme. Altough the discretization is not inverse monotone we are able to establish its maximum-norm stability and to prove its pointwise convergence on a Shishkin mesh. The convergence is uniform with respect to the perturbation parameter. Numerical experiments complement our theoretical results.
Ontology-based fuzzy support agent for ship steering control
Authors: Ki-Yeol Seo, Gyei-Kark Park, Chang-Shing Lee, Mei-Hui Wang
Venue: Expert Systems with Applications: An International Journal (2009)

The important field of research on ship operation is related to the high efficiency of transportation, the convenience of maneuvering ships, and the safety of navigation. This paper proposes an ontology-based fuzzy support agent for ship steering control and desires to testify the validity of the proposal by applying the fuzzy control model to the steering control system based on linguistic instruction. The fuzzy support agent is presented to build the maneuvering models of steersman and the miniature model for steering control system. The proposed fuzzy agent contains three main mechanisms, including the interpretation mechanism of linguistic instruction, the self-regulation mechanism, and the task performance mechanism. Furthermore, the task performance mechanism includes the kinematics module and the performance ontology. The simulation results show that the proposed approach can work effectively for ship steering control.