ppxscal/embedding_network huggingface dataset:
Integrated code and data placement in two-dimensional mesh based chip multiprocessors
Authors: Taylan Yemliha, Shekhar Srikantaiah, Mahmut Kandemir, Mustafa Karakoy, Mary Jane Irwin
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

As transistor sizes continue to shrink and the number of transistors per chip keeps increasing, chip multiprocessors (CMPs) are becoming a promising alternative to remain on the current performance trajectory for both high-end systems and embedded systems. Since future technologies offer the promise of being able to integrate billions of transistors on a chip, the prospects of having hundreds to thousands of processors on a single chip along with an underlying memory hierarchy and an interconnection system is entirely feasible. This paper proposes a compiler directed integrated code and data placement scheme for two-dimensional mesh based CMP architectures. The proposed approach uses a Code-Data Affinity Graph (CDAG) to represent the relationship between loop iterations and array data and then assigns the sets of loop iterations to processing cores and sets of data blocks to on-chip memories. During the mapping process, the on-chip memory capacity and load imbalance across different cores and the topology of the NoC are taken into account. In this paper, we present two variants of our approach: depth-first placement (DFP) and breadth-first placement (BFP), and compare them to three alternate code/data mapping schemes. The experimental evaluation shows that our CDAG based placement schemes are very successful in practice, achieving average performance improvements of 19.9% (DFP) and 16.8% (BFP), and average energy improvements of 29.7% (DFP) and 27.8% (BFP).
Interoperability within Multi-Agent System
Authors: Jeffrey Tweedale, Lakhmi C. Jain
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2009)

Heuristic computing has consolidated into two streams of research (personification software and smart products) [1]. Cognitive Science is one of these fields and is attracting research effort based on Multi-Agent System (MAS). This research requires the formation of a voluntarily trust relationship in order for collaboration to occur, otherwise the imposed goal(s) may be aborted or fail completely [2,3]. An Agent Transportation Layer Adaption System (ATLAS) communications framework has been constructed to pass messages between separate agent systems. Discussion about confined frameworks have recently been extended to enable individual students associated with our Knowledge-Based and Intellingent Information and Engineering Systems (KES) Centre to fast track the development of their research concepts. A Plug 'n' Play concept based on a multi-agent blackboard architecture forms the basis of this research. This paper highlights the core architecture, we believe is required for Multi-Agent System (MAS) developers to achieve such flexibility. Agent teams can provide the ability to adapt and dynamically organize. The model described, concentrates on the blackboard design constructs to represents all functional blocks required to automate the processes required to complete any decomposed goals. Discussion in this paper is limited to the formative work within the foundation layers of that framework.
The design and use of the TMiner component-based data mining framework
Authors: Fernando Berzal, Juan-Carlos Cubero, Aída Jiménez
Venue: Expert Systems with Applications: An International Journal (2009)

This paper provides some practical guidelines for the design of data mining frameworks. It describes the rationale behind some of the key design decisions that guided the design, development, and implementation of the TMiner component-based data mining framework. TMiner is a flexible framework that can be used as a stand-alone tool or integrated into larger business intelligence (BI) solutions. TMiner is a general-purpose component-based system designed to support the whole KDD process into a single framework and thus facilitate the implementation of complex data mining scenarios.
On the elliptic mesh generation in domains containing multiple inclusions and undergoing large deformations
Authors: N. Chatzidai, A. Giannousakis, Y. Dimakopoulos, J. Tsamopoulos
Venue: Journal of Computational Physics (2009)

We present an improved method to generate a sequence of structured meshes even when the physical domain contains deforming inclusions. This method belongs to the class of Arbitrary Lagrangian-Eulerian (ALE) methods for solving moving boundary problems. Its tools are either (a) separate mappings of the domain boundaries and enforcing the node distribution on lines emanating from singular points or (b) domain decomposition and separate mappings of each subdomain using suitable coordinate systems. The latter is shown to be more versatile and general. In both cases a set of elliptic equations is used to generate the grid extending in this way the method advanced by Dimakopoulos and Tsamopoulos [Y. Dimakopoulos, J.A. Tsamopoulos, A quasi-elliptic transformation for moving boundary problems with large anisotropic deformations, J. Comput. Phys. 192 (2003) 494-522]. We shall present examples where this earlier method and all other mesh generating methods which are based on a conformal mapping or solving a quasi-elliptic set of PDEs fail to produce an acceptable mesh and accurate solutions in such geometries. Furthermore, in contrast to other methods, appropriate boundary conditions and constraints such as, orthogonality of specific mesh lines and prespecified node distributions on them, can be easily implemented along a specific part of the domain or its boundary. Hence, no attractive terms at specific corners or singular points are needed. To increase the mesh resolution around the moving interfaces while keeping low the memory requirements and the computational time, a local mesh refinement technique has been incorporated as well. The method is demonstrated in two challenging examples where no remeshing is required in spite of the large domain deformations. In the first one, the transient growth of two bubbles embedded in a viscoelastic filament undergoing stretching in the axial direction is examined, while in the second one the linear and non-linear dynamics of two bubbles in a viscous medium are determined in an acoustic field. The large elasticity of the filament in the first case or the large inertia in the second case coupled with the externally induced large deformations of the liquid domain requires the accurate calculation which is achieved by the method we propose herein. The governing equations are solved using the finite element/Galerkin method with appropriate modifications to solve the hyperbolic constitutive equation of a viscoelastic fluid. These are coupled with an implicit Euler method for time integration or with Arnoldi's algorithm for normal mode analysis.
Performance models for hierarchical grid architectures
Authors: Paolo Cremonesi, Roberto Turrin
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

Main characteristics of large-scale, geographically distributed grid systems are resource heterogeneity and network latency. In this paper, we use queuing network models to analyze data-parallel grid applications and we show the effects of resource heterogeneity, communications delays, network bandwidths and synchronization overheads on the application-level performance. The proposed models rely on the statistical pattern of computation, communication, and I/O operations in the parallel applications, as well as on measurable infrastructure characteristics. We finally show how the high variability in the execution and communication times must be considered when modeling applications on geographically distributed grid infrastructures.1
Global exponential stability of impulsive BAM neural networks with distributed delays
Authors: Jie Zhou, Shuyong Li
Venue: Neurocomputing (2009)

In this paper, the existence and uniqueness, and the global exponential stability (GES) of equilibrium point of a impulsive BAM neural networks with distributed delays are considered. Here we point out, different from previous methods, we do not construct Lyapunov functional or use the properties of nonsingular M-matrix. We use some basic analytical technique, such as contraction mapping principle and differential inequality technique to obtain our results. It is shown that, in some case, the stability criteria can be easily checked. Several remarks are worked out to demonstrate the advantage of our results.
Global satellite communications technology and systems - An overview
Authors: Alfred U. Mac Rae, Joseph N. Pelton
Venue: Space Communications (2000)

The National Aeronautics and Space Administration (NASA) and the National Science Foundation (NSF) commissioned a panel of scientists and engineers in 1997 to benchmark the global status of commercial communications satellite technology, markets and regulatory and policy issues. After visiting or interviewing over 60 manufacturing, R D laboratory, service provider and government institutions in North and South America, Europe and Asia, the review panel concluded as follows: Many European and Asian governments are increasing their satellite communications R D programs and supporting demonstrations and space marketing efforts, relative to the US. The US is currently the leader in new technology and its insertion into commercial satellite systems, but ambitious foreign efforts threaten this position. Global commercial satellite communications is a large and rapidly growing business. New technology is being inserted into satellites at an increasingly rapid pace with an increasing number of international participants. Aerospace communications companies, worldwide, are consolidating their efforts and are expanding into the end user service business. The Direct-to-End User mass consumer satellite service industry has the potential to be quite large and is changing the way satellites are manufactured and deployed and is creating a potentially large satellite terminal industry. Satellite manufacturing is increasingly becoming a design, assembly and test operation with parts and sub-systems obtained from global suppliers. This increased use of satellites for communications services is creating a shortage of spectrum and orbital slots and is resulting in spectrum utilization conflicts with terrestrial wireless service providers. Future development of commercial satellite communications is dependent on the resolution of key regulatory, trade, spectrum, inter-operability and standards issues and government leadership is vitally needed. There are opportunities for international cooperation to facilitate the development of satellites technologies, systems, standards and protocols. There is concern that unless several issues are addressed, particularly an increase in long term oriented R D and trade and regulatory issues, the US may experience a deterioration of its leading position in the manufacture of satellites for global service providers and the initiation of new services, much in the way that it lost its leading position in the launch of commercial satellites.
Applying fuzzy sets and rough sets as metric for vagueness and uncertainty in information retrieval systems
Authors: Nancy Mehta, Neera Bawa
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

This paper reviews and compares theories of fuzzy sets and rough sets applying information retrieval. Vagueness and uncertainty have attracted the attention of philosophers and logicians for many years. The aim of this paper is to synthetically present the rough set and fuzzy set approach to the modeling of flexibility with respect to vagueness and uncertainty in the specification of users' information needs. The two theories model different types of uncertainty. The rough set theory takes into consideration the indiscernibility between objects; typically characterized by an equivalence relation. Rough sets are the results of approximating crisp sets using equivalence classes. The fuzzy set theory deals with the ill-definition of the boundary of a class through a continuous generalization of set characteristic functions. The indiscernibility between objects is not used in fuzzy set theory. So the membership relation is best theory for categorization of two theories.
Stochastic Behavior and Explicit Discrete Time in Concurrent Constraint Programming
Authors: Jesús Aranda, Jorge A. Pérez, Camilo Rueda, Frank D. Valencia
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

We address the inclusion of stochastic information into an explicitly timed concurrent constraint process language. An operational semantics is proposed as a preliminary result. Our approach finds applications in biology, among other areas.
Distributed uplink power control for optimal sir assignment in cellular data networks
Authors: Prashanth Hande, Sundeep Rangan, Mung Chiang, Xinzhou Wu
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

This paper solves the joint power control and SIR assignment problem through distributed algorithms in the uplink of multi-cellular wireless networks. The 1993 Foschini-Miljanic distributed power control can attain a given fixed and feasible SIR target. In data networks, however, SIR needs to be jointly optimized with transmit powers in wireless data networks. In the vast research literature since the mid-1990s, solutions to this joint optimization problem are either distributed but suboptimal, or optimal but centralized. For convex formulations of this problem, we report a distributed and optimal algorithm. The main issue that has been the research bottleneck is the complicated, coupled constraint set, and we resolve it through a re-parametrization via the left Perron Frobenius eigenvectors, followed by development of a locally computable ascent direction. A key step is a new characterization of the feasible SIR region in terms of the loads on the base stations, and an indication of the potential interference from mobile stations, which we term spillage. Based on this load-spillage characterization, we first develop a distributed algorithm that can achieve any Pareto-optimal SIR assignment, then a distributed algorithm that picks out a particular Pareto-optimal SIR assignment and the associated powers through utility maximization. Extensions to power-constrained and interference-constrained cases are carried out. The algorithms are theoretically sound and practically implementable: we present convergence and optimality proofs as well as simulations using 3GPP network and path loss models.
Museum collection management on-demand
Authors: Steven Wu, Philip Chua
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

In this case study, we trace the rationale, development and operation of the Integrated Museum Collection Management System as a software-as-a-service solution for public as well as private museums in Singapore. This on-demand service may serve as a model for other public services particularly in the context of business process re-engineering and standards adoption. It comprises a traditional client-server solution for internal users and a web frontend for public search. From the operation perspective, the service has posed challenges in delivery and support. Lastly, standards and technology adoption issues have to be addressed.
0-1 reformulations of the multicommodity capacitated network design problem
Authors: Antonio Frangioni, Bernard Gendron
Venue: Discrete Applied Mathematics (2009)

We study 0-1 reformulations of the multicommodity capacitated network design problem, which is usually modeled with general integer variables to represent design decisions on the number of facilities to install on each arc of the network. The reformulations are based on the multiple choice model, a generic approach to represent piecewise linear costs using 0-1 variables. This model is improved by the addition of extended linking inequalities, derived from variable disaggregation techniques. We show that these extended linking inequalities for the 0-1 model are equivalent to the residual capacity inequalities, a class of valid inequalities derived for the model with general integer variables. In this paper, we compare two cutting-plane algorithms to compute the same lower bound on the optimal value of the problem: one based on the generation of residual capacity inequalities within the model with general integer variables, and the other based on the addition of extended linking inequalities to the 0-1 reformulation. To further improve the computational results of the latter approach, we develop a column-and-row generation approach; the resulting algorithm is shown to be competitive with the approach relying on residual capacity inequalities.
Position transformation: a location privacy protection method for moving objects
Authors: Dan Lin, Elisa Bertino, Reynold Cheng, Sunil Prabhakar
Venue: Proceedings of the SIGSPATIAL ACM GIS 2008 International Workshop on Security and Privacy in GIS and LBS (2008)

The expanding use of location-based services has profound implications on the privacy of personal information. In this paper, we propose a framework for preserving location privacy based on the idea of sending to the service provider suitably modified location information. Agents execute data transformation and the service provider directly processes the transformed dataset. Our technique not only prevents the service provider from knowing the exact locations of users, but also protects information about user movements and locations from being disclosed to other users who are not authorized to access this information. We also define a privacy model to analyze our framework, and examine our approach experimentally.
A high-order cell-centered Lagrangian scheme for two-dimensional compressible fluid flows on unstructured meshes
Authors: Pierre-Henri Maire
Venue: Journal of Computational Physics (2009)

We present a high-order cell-centered Lagrangian scheme for solving the two-dimensional gas dynamics equations on unstructured meshes. A node-based discretization of the numerical fluxes for the physical conservation laws allows to derive a scheme that is compatible with the geometric conservation law (GCL). Fluxes are computed using a nodal solver which can be viewed as a two-dimensional extension of an approximate Riemann solver. The first-order scheme is conservative for momentum and total energy, and satisfies a local entropy inequality in its semi-discrete form. The two-dimensional high-order extension is constructed employing the generalized Riemann problem (GRP) in the acoustic approximation. Many numerical tests are presented in order to assess this new scheme. The results obtained for various representative configurations of one and two-dimensional compressible fluid flows show the robustness and the accuracy of our new scheme.
An engineering process for developing Secure Data Warehouses
Authors: Juan Trujillo, Emilio Soler, Eduardo Fernández-Medina, Mario Piattini
Venue: Information and Software Technology (2009)

We present a new approach for the elicitation and development security requirements in the entire Data Warehouse (DWs) life cycle, which we have called a Secure Engineering process for DAta WArehouses (SEDAWA). Whilst many methods for the requirements analysis phase of the DWs have been proposed, the elicitation of security requirements as non-functional requirements has not received sufficient attention. Hence, in this paper we propose a methodology for the DW design based on Model Driven Architecture (MDA) and the standard Software Process Engineering Metamodel Specification (SPEM) from the Object Management Group (OMG). We define four phases comprising of several activities and steps, an d five disciplines which cover the whole DW design. Our methodology adapts the i^* framework to be used under MDA and the SPEM approaches in order to elicit and develop security requirements for DWs. The benefits of our proposal are shown through an example related to the management of the pharmacies consortium business.
Scene change detection on H.264/AVC compressed video using intra mode distribution histogram based on intra prediction mode
Authors: Minyoung Eom, Yoonsik Choe
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

This paper presents a novel scene change detection method using complexity and edge direction based on intra prediction mode in H.264/AVC compressed video. When scene change occurs, there is less temporal correlation between consecutive frames. Therefore, most of macro-blocks are encoded in intra mode. Using this property, the proposed method calculates the percentage of intra mode blocks in each predictive frame in order to get candidates of scene change frames. To detect accurate scene change frames, we generate the Intra Mode Distribution Histogram (IMDH) representing edge directionality and image roughness. By similarity matching of consecutive two IMDHs, we decide scene change frames. The distance between two IMDHs is measured using χ2-statistic. The experimental results show that our method is efficient and robust.
A superior choice making system for optimal journey agency
Authors: Huay Chang
Venue: WSEAS Transactions on Information Science and Applications (2009)

This paper presents a decision choice making system method for travelers to find the best journal agency. First of all, the factors those were concerned by the travelers in evaluating the journey agency were submitted through the literature review. These factors are classified into three units. These three units are the price unit, the tour product characteristics unit and the journey agency image unit. Each unit owns its sub-factors. Subsequently, the minimum norm approach is used to the classify the optimal fit level between the travelers and the selected journal agency. The findings of this paper appear the understandings of decision key elemtns those influence consumers 'purchasing lead to the understanding of consumers' characteristics. Furthermore, the simulation test results appear the adoption of appropriate promotion method in keeping or expanding consumers group become the further key issues for journey agencies.
A heavy-tailed empirical Bayes method for replicated microarray data
Authors: Diego Salas-Gonzalez, Ercan E. Kuruoglu, Diego P. Ruiz
Venue: Computational Statistics Data Analysis (2009)

DNA microarray has been recognized as being an important tool for studying the expression of thousands of genes simultaneously. These experiments allow us to compare two different samples of cDNA obtained under different conditions. A novel method for the analysis of replicated microarray experiments based upon the modelling of gene expression distribution as a mixture of @a-stable distributions is presented. Some features of the distribution of gene expression, such as Pareto tails and the fact that the variance of any given array increases concomitantly with an increase in the number of genes studied, suggest the possibility of modelling gene expression distribution on the basis of @a-stable density. The proposed methodology uses very well known properties of @a-stable distribution, such as the scale mixture of normals. A Bayesian log-posterior odds is calculated, which allows us to decide whether a gene is expressed differentially or not. The proposed methodology is illustrated using simulated and experimental data and the results are compared with other existing statistical approaches. The proposed heavy-tail model improves the performance of other distributions and is easily applicable to microarray gene data, specially if the dataset contains outliers or presents high variance between replicates.