ppxscal/embedding_network huggingface dataset:
Parallel strategies for algebraic multi-grid
Authors: Xiang Zhao, Kunal Jain, Sijun Zhang
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

The major portion of computing time in a computational fluid dynamic (CFD) flow solver is consumed by the solution of the linear equations, the use of an efficient matrix solver is critical to obtain high computing performance. Currently, Algebraic Multi-Grid (AMG) is recognized in CFD community as one of the best choices to achieve high efficiency for solving linear algebraic equations. As AMG is increasingly used for large problems, its parallelization is highly demanded. In this paper, a parallel algorithm for AMG is proposed with regard to unique characteristics of partial differential equations governing fluid flows. A building strategy was developed to accomplish grid coarsening and build the hierarchy of multi-level grids. Moreover an agglomeration approach was proposed, which comes from the physical and mathematical properties of flow fields. The parallelized AMG has demonstrated excellent performances on many cases.
A web-based system for managing construction information
Authors: A. P. Chassiakos, S. P. Sakellaropoulos
Venue: Advances in Engineering Software (2008)

The efficient deployment of construction projects depends partly on the effective communication among project participants. This communication, however, is hindered by the large amount and wide variation of the information involved and the spatial dispersion of construction sites. This paper presents a web-based system that facilitates construction information management and communication. Unlike common document-based systems, the present work focuses on demonstrating the potential of data-centric web databases in enhancing the communication process during project execution. Further, this work has aimed to put emphasis on information modelling, i.e., representation of the construction process in data to facilitate exchange and interoperability of information. The proposed system consists of a relational database and a dynamic data-driven web application. The database contains 32 appropriately designed tables. End users access the database through the internet and can perform certain transactions according to their authorisation. The system implementation and testing have shown that it can provide structured and reliable information, quick and remote access, and prompt updating capabilities.
A Limited-Client-Capability Broadcasting Scheme for VoD Applications
Authors: Hsiang-Fu Yu, Hung-Chang Yang, Chu-Yi Chien, Yao-Tien Wang
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Data broadcasting is independent of client arrival rate, and thus it is very suitable to transmit popular videos that interest many clients at a particular period of time. One broadcasting method (called periodic broadcasting) is to partition a video into segments, which are then simultaneously broadcast on several data channels. Once clients want to watch the video, they download the segments from these channels. Specially, the skyscraper broadcasting (SkB), client-centric approach (CCA), greedy disk-conserving broadcasting (GDB) schemes were proposed to support a client with a small bandwidth. This paper presents a limited-client-capability broadcasting (LCCB) scheme, which achieves small waiting time, bandwidth consumption, and buffer demand on the client side. In comparison with SkB, CCA, and GDB, LCCB gains smaller waiting time. Extensive simulation results indicate that LCCB also requires lower client buffer spaces than SkB, CCA, and GDB.
The disenchantment of affect
Authors: Phoebe Sengers, Kirsten Boehner, Michael Mateas, Geri Gay
Venue: Personal and Ubiquitous Computing (2008)

In computing design, experience is often broken down, compartmentalized, and engineered: a process that often disenchants the original experience. In this paper, we demonstrate the possibility to design for experience, not by formalizing and rationalizing it, but instead by supporting open-ended engagement and appropriation. We illustrate this approach through Affector, a case study in affective computing, in which we focus on user interpretation and construction of emotional experience over its computational modeling. We derive design and evaluation strategies for enchantment that focus on supporting the ongoing construction and interpretation of experience by human participants over the course of interaction. We suggest that enchanting experiences may be designed only by approaching enchantment obliquely: not by engineering it in, but by providing opportunities where it may emerge.
"Blast Those Sequences': A Gridified Framework for Bioinformatics Blast Using the A3pviGrid
Authors: Avinash Shankaranarayanan, Christine Amaldas, Russel Pears
Venue: Proceedings of the 2008 International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies (2008)

Probably the single most important concern of the biotechnology industry is to improve existing biotechnology applications and tools due to the exponential increase in the size of the datasets. Improving application specific performance, pertaining to sudden and dynamic changes in the execution environment has been a widely researched problem. This research was undertaken to find application specific performance problems in the field of applied Bioinformatics. We specifically narrow down on an important everyday bioinformatics application namely Blast, used commonly by biologists for everyday research. A detailed literature study was undertaken to observe the gaps specific to the applications performance subjected to different quality of service constraints and system specific parameters under the confluence of a dynamic mini grid test bed. A number of gaps were identified; throughput in terms of latency (message passing); scalability (load balancing) and application performance (reliability) needs to be addressed. An experimental mini grid test bed was implemented to simulate various conditions and to test the proposed hypotheses. The implemented architecture utilizes game theoretic optimization and agent based team formation (Coalition) algorithms to improve upon scalability with respect to team formation. Due to the dynamic nature of distributed systems (as discussed in previous works) all interactions are made local within a team transparently. This paper is a proof of concept of an experimental mini-Grid test-bed aimed at improving performances of bioinformatics Blast application in terms of scalability and stability. Experimental results and detailed literature on current approaches are explored to conduct a set of generic experiments to validate our claims.
Numerical analysis of edge effects in adhesively-bonded assemblies application to the determination of the adhesive behaviour
Authors: Jean Yves Cognard
Venue: Computers and Structures (2008)

This paper presents contributions of numerical modelling for the optimization of adhesively-bonded assemblies for marine and underwater applications. The experimental and numerical analyses of the mechanical behaviour of bonded joints are particularly made difficult by the stress singularities due to edge effects. Therefore, to analyse the behaviour of the adhesive in an assembly, experimental fixtures which strongly limit edge effects must be designed in order to obtain reliable data. Different finite element analyses, under the assumption of elastic behaviour of the constituents, have highlighted the influence of two parameters: the geometry of the substrate close to the adhesive joint and the local geometry of the joint near the edge. The numerical results have been confirmed through experimental tests. Moreover, numerical simulations taking into account the non-linear behaviour of the adhesive give more information about the way an adhesive behaves in an assembly. An improvement is proposed in order to nearly cancel out the solicitation of the adhesive near the free edge of the joint.
Efficient oblivious branching programs for threshold functions
Authors: R. K. Sinha, J. S. Thathachar
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

In his survey paper on branching programs, A.A. Razborov (1991) asked the following question: Does every rectifier-switching network computing the majority of n bits have size n/sup 1+/spl Omega/(1/)? We answer this question in the negative by constructing a simple oblivious branching program of size O(n log/sup 3/ n/log log n log log log n) for computing any threshold function. This improves the previously best known upper bound of O(n/sup 3/2/) due to O.B. Lupanov (1965).
Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
Authors: Christian Kanzow, Stefania Petra
Venue: Optimization Methods Software (2007)

A reformulation of the mixed complementarity problem as a box constrained overdetermined system of semismooth equations or, equivalently, a box constrained nonlinear least squares problem with zero residual is presented. On the basis of this reformulation, a trust region method for the solution of mixed complementarity problems is considered. This trust region method contains elements from different areas: a projected Levenberg-Marquardt step in order to guarantee local fast convergence under suitable assumptions, affine scaling matrices which are used to improve the global convergence properties, and a multidimensional filter technique to accept a full step more frequently. Global convergence results as well as local superlinear/quadratic convergence is shown under appropriate assumptions. Moreover, numerical results for the MCPLIB indicate that the overall method is quite robust.
Web document compaction by compressing URI references in RDF and OWL data
Authors: Kisung Lee, Jin Hyun Son, Gun-Woo Kim, Myoung Ho Kim
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

The enormous web documents in WWW have made it dramatically difficult to retrieve meaningful information which we really want to find out. The Semantic Web technology has been considered to solve the problem and RDF and OWL have emerged as standards for the Semantic Web documents by W3C. The RDF/XML, an XML representation of RDF and OWL, documents are very large as compared to their intrinsic data size because of their inherent verbosity from XML. These large-size RDF/XML documents are inefficient in data exchanging and archiving. In this paper, we propose an efficient method for compressing URI references which may cover very large portions of RDF/XML documents. Our compression method compresses URI references using two-level dictionary-based encoding: one for compressing URI parts of URI references and the other for compressing whole URI references. The performance evaluation using real RDF/XML documents shows that our compression method significantly reduces the size of the RDF/XML documents.
SIMULATION AND ANALYSIS OF CONTROLLED MULTI-REPRESENTATIONAL REASONING PROCESSES
Authors: Tibor Bosse, Catholijn M. Jonker, Jan Treur
Venue: Applied Artificial Intelligence (2007)

Multi-representational reasoning processes often show a variety of reasoning paths that can be followed. To analyze such reasoning processes with special attention for differences between individuals, it is required (1) to obtain an overview of the variety of different possibilities and (2) to address navigation and control within the reasoning process. This paper presents a simulation model and a formal analysis method for the dynamics of a controlled reasoning process in which multiple representations play a role. Reasoning strategies to navigate through the space of possible reasoning states are modeled explicitly, and simulated. Simulation results are analyzed by software tools on the basis of formalized dynamic properties. The variety of dynamic properties specified and the variety of traces simulated provides an overview for the individual differences between subjects that have been observed while solving multiplication problems.
Multi-task compressive sensing with Dirichlet process priors
Authors: Yuting Qi, Dehong Liu, David Dunson, Lawrence Carin
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Compressive sensing (CS) is an emerging &pound;eld that, under appropriate conditions, can signi&pound;cantly reduce the number of measurements required for a given signal. In many applications, one is interested in multiple signals that may be measured in multiple CS-type measurements, where here each signal corresponds to a sensing "task". In this paper we propose a novel multitask compressive sensing framework based on a Bayesian formalism, where a Dirichlet process (DP) prior is employed, yielding a principled means of simultaneously inferring the appropriate sharing mechanisms as well as CS inversion for each task. A variational Bayesian (VB) inference algorithm is employed to estimate the full posterior on the model parameters.
Strategy evaluation in extensive games with importance sampling
Authors: Michael Bowling, Michael Johanson, Neil Burch, Duane Szafron
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Typically agent evaluation is done through Monte Carlo estimation. However, stochastic agent decisions and stochastic outcomes can make this approach inefficient, requiring many samples for an accurate estimate. We present a new technique that can be used to simultaneously evaluate many strategies while playing a single strategy in the context of an extensive game. This technique is based on importance sampling, but utilizes two new mechanisms for significantly reducing variance in the estimates. We demonstrate its effectiveness in the domain of poker, where stochasticity makes traditional evaluation problematic.
Using opinion polls to help measure business impact in agile development
Authors: Harald Klein, Sabine Canditt
Venue: Proceedings of the 1st international workshop on Business impact of process improvements (2008)

The achievement of quantifiable business impact is an essential goal of improvement activities in software development. Traditionally, a set of well-defined metrics built up a sound foundation for measuring the effects on business improvements before and afterwards. However, those metrics are not always equally applicable throughout all development methodologies, especially when moving from traditional (waterfall) towards agile development. Furthermore, some major impacts of improvement activities (e.g. customer satisfaction) might not be directly accessible with standard measurements. For this reason we suggest that opinion polls should supplement traditional metrics. Opinion polls fit perfectly into the idea of frequent feedback, given by customers as well as team members, that is an inherent part of agile processes. Thus, opinion polls are especially suitable for agile improvements. Adding subjectivity and the power of individual evaluation to objective metrics can help to analyze root causes that form the major levers for achieving business impact.
The mixed signal optimum energy point: voltage and parallelism
Authors: Brian P. Ginsburg, Anantha P. Chandrakasan
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

An energy optimization is proposed that addresses the non-trivial digital contribution to power and impact on performance in high-speed mixed-signal circuits. Parallel energy and behavioral models are used to quantify architectural tradeoffs across the analog/digital boundary. An interleaved ADC is optimized as a case study to demonstrate this approach. The chosen operating point of 36 channels and 700mV operation gives a 3&times; improvement in energy compared to the seed of the model. The model matches closely the measured results of an ADC testchip implemented in a 65nm CMOS process.
Stability of the intersection of solution sets of semi-infinite systems
Authors: Miguel A. Goberna, Mercedes Larriqueta, Virginia N. Vera de Serio
Venue: Journal of Computational and Applied Mathematics (2008)

Many mathematical programming models arising in practice present a block structure in their constraint systems. Consequently, the feasibility of these problems depends on whether the intersection of the solution sets of each of those blocks is empty or not. The existence theorems allow to decide when the intersection of non-empty sets in the Euclidean space, which are the solution sets of systems of (possibly infinite) inequalities, is empty or not. In those situations where the data (i.e., the constraints) can be affected by some kind of perturbations, the problem consists of determining whether the relative position of the sets is preserved by sufficiently small perturbations or not. This paper focuses on the stability of the non-empty (empty) intersection of the solutions of some given systems, which can be seen as the images of set-valued mappings. We give sufficient conditions for the stability, and necessary ones as well; in particular we consider (semi-infinite) convex systems and also linear systems. In this last case we discuss the distance to ill-posedness.
EARS: Efficient Entity Authentication in Remote Systems
Authors: Manik Lal Das, V. Lakshmi Narasimhan
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

With the rapid pace of electronic business, strong authentication is required to mitigate risks of simple password-based authentication systems. In this paper, we present a two-factor entity authentication scheme for remote systems, which provides strong authentication, greater flexibility and requires less computational cost.
Ironmodel: robust performance models in the wild
Authors: Eno Thereska, Gregory R. Ganger
Venue: ACM SIGMETRICS Performance Evaluation Review (2008)

Traditional performance models are too brittle to be relied on for continuous capacity planning and performance debugging in many computer systems. Simply put, a brittle model is often inaccurate and incorrect. We find two types of reasons why a model's prediction might diverge from the reality: (1) the underlying system might be misconfigured or buggy or (2) the model's assumptions might be incorrect. The extra effort of manually finding and fixing the source of these discrepancies, continuously, in both the system and model, is one reason why many system designers and administrators avoid using mathematical models altogether. Instead, they opt for simple, but often inaccurate, "rules-of-thumb". This paper describes IRONModel, a robust performance modeling architecture. Through studying performance anomalies encountered in an experimental cluster-based storage system, we analyze why and how models and actual system implementations get out-of-sync. Lessons learned from that study are incorporated into IRONModel. IRONModel leverages the redundancy of high-level system specifications described through models and low-level system implementation to localize many types of system-model inconsistencies. IRONModel can guide designers to the potential source of the discrepancy, and, if appropriate, can semi-automatically evolve the models to handle unanticipated inputs.
Performance Analysis of Data Delivery Schemes for a Multi-Sink Wireless Sensor Network
Authors: Hwee-Pink Tan, Adriana F. Gabor, Winston K. G. Seah, Pius W. Q. Lee
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Wireless sensor networks are expected to be deployed in harsh environments characterised by extremely poor and fluctuating channel conditions. With the commonly adopted single-sink architecture, such conditions are exemplified by contention near the sink as a result of multipath delivery. This may be reduced by deploying multiple sinks spatially-apart e.g., along the edges of the network such that multiple spatially diverse paths that diverge like a starburst from each node towards these sinks can be set-up. Such an architecture opens up new challenges to the data delivery scheme, which determines the performance of the network.Since the compactness of sensors with limited energy resources restrict the use of sophisticated mechanisms, we consider simple data delivery schemes suited for such a multi-sink architecture. We optimise a single-path data delivery scheme with simple ARQ for a spatially-invariant environment, and demonstrate that its optimality over a spatially-diverse multipath scheme extends to spatially-variant environments. We also verify our analysis with simulations obtained using the Qualnet simulator.
A generating function and some recurrence relations for a family of polynomials
Authors: Rabia Aktas, Abdullah Altin
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

In the present paper, we derive some families of polynomials. Some further results of these polynomials as generating function, rodrigues formula and recurrence relations are also discussed.
Hierarchical layout hypergraph operations and diagrammatic reasoning
Authors: Ewa Grabska, Andrzej Łachwa, Grazyna Slusarczyk, Katarzyna Grzesiak-Kopec, Jacek Lembas
Venue: Machine Graphics Vision International Journal (2007)

This paper deals with a new, computer-aided approach to floor-layout design. The approach proposes: firstly, a specific layout language with a syntactic knowledge defined by means of hierarchical hypergraphs; secondly, a correspondence between layout modifications and hypergraph operations. An initial layout drawn by the designer is automatically converted into a hypergraph and each designer's modification to the layout is reflected in the hypergraph structure. Our new approach is illustrated by a step by step example, where two complementary representations of the same floor-layout design are used.
A heuristic for nesting problems of irregular shapes
Authors: Wen-Chen Lee, Heng Ma, Bor-Wen Cheng
Venue: Computer-Aided Design (2008)

Layout has a close relationship with product cost in the vein of how to most efficiently cut product patterns from raw materials. This is the so-called ''nesting problem'', which occurs frequently in sheet metal and furniture industries, wherein material utilization needs to be maximized. In this paper, a quick location and movement (QLM) algorithm is proposed to solve the situation of irregular shapes nested on multiple irregular sheets. This approach includes two major parts: it first approximates irregular shapes to a polygon with the use of a cluster of straight lines, and second, it arranges the approximated shapes one-by-one with the proposed step-by-step rule. Finally, this study investigates and compares examples presented by other authors. The results show that the QLM algorithm takes less time to calculate a layout and the material utilization efficiency is higher compared to other methods.
Tetravalent half-arc-transitive graphs of order p4
Authors: Yan-Quan Feng, Jin Ho Kwak, Ming-Yao Xu, Jin-Xin Zhou
Venue: European Journal of Combinatorics (2008)

A graph is half-arc-transitive if its automorphism group acts transitively on vertices and edges, but not on arcs. It is known that for a prime p there is no tetravalent half-arc-transitive graphs of order p or p^2. Xu [M.Y. Xu, Half-transitive graphs of prime-cube order, J. Algebraic Combin. 1 (1992) 275-282] classified the tetravalent half-arc-transitive graphs of order p^3. As a continuation, we classify in this paper the tetravalent half-arc-transitive graphs of order p^4. It shows that there are exactly p-1 nonisomorphic connected tetravalent half-arc-transitive graphs of order p^4 for each odd prime p.